1   /* Copyright 2002-2025 CS GROUP
2    * Licensed to CS GROUP (CS) under one or more
3    * contributor license agreements.  See the NOTICE file distributed with
4    * this work for additional information regarding copyright ownership.
5    * CS licenses this file to You under the Apache License, Version 2.0
6    * (the "License"); you may not use this file except in compliance with
7    * the License.  You may obtain a copy of the License at
8    *
9    *   http://www.apache.org/licenses/LICENSE-2.0
10   *
11   * Unless required by applicable law or agreed to in writing, software
12   * distributed under the License is distributed on an "AS IS" BASIS,
13   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14   * See the License for the specific language governing permissions and
15   * limitations under the License.
16   */
17  package org.orekit.estimation.measurements.gnss;
18  
19  /** Interface defining ambiguity acceptance tests.
20   * @see AmbiguitySolver
21   * @author Luc Maisonobe
22   * @since 10.0
23   */
24  public interface AmbiguityAcceptance {
25  
26      /** Get the number of candidate solutions to search for.
27       * @return number of candidate solutions to search for
28       */
29      int numberOfCandidates();
30  
31      /** Check if one of the candidate solutions can be accepted.
32       * @param candidates candidate solutions of the Integer Least Squares problem,
33       * in increasing squared distance order (the array contains at least
34       * {@link #numberOfCandidates()} candidates)
35       * @return the candidate solution to accept (normally the one at index 0), or
36       * null if we should still use the float solution
37       */
38      IntegerLeastSquareSolution accept(IntegerLeastSquareSolution[] candidates);
39  
40  }