Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def carPathMatcherWithTransitions[O](implicit arg0: GeoCoordinateOperations[O]): PathMatcher[O, Vertex, Seq[Vertex]]

   Creates an HMM path matcher that only matches to vertices that are accessible by cars, and that is suitable for sparse probes.

   Creates an HMM path matcher that only matches to vertices that are accessible by cars, and that is suitable for sparse probes. However, if the observations are not close enough, they will be considered unreachable.

   Besides a sequence of MatchResults, this path matcher returns a list of transitions. A transition is a sequence of Vertex objects that represents a path between OnRoad match results associated to two successive observations. A transition does not contain the two vertices referenced by the corresponding OnRoad match results.

   Consider the following example:

    O1                   O2
    |                    |
    v                    v
   --V1--> --V2--> --V3-->

   The observation O1 is matched to vertex V1, and O2 to V3. Although V1 and V3 are not directly connected, the path matcher returns a transition from O1 to O2 that contains the intermediate vertices, V2 in this case.

   Internally, this method creates a PathMatcherWithFilter that uses a DistanceFilter and a ProjectingInterpolator to improve match results when consecutive points are close to one another.

   See also PathMatcherWithFilter for more information about filtering and interpolation.

   O

   The type of data accepted by the path matcher

   Note

   On rare occasions, for example with very sparse probes, the returned path matcher might calculate transitions that involve forbidden manoeuvres. This is a known limitation and will be fixed in a later version.

6.  def carPathMatcherWithoutTransitions[O](implicit arg0: GeoCoordinateOperations[O]): PathMatcher[O, Vertex, NoTransition]

   Creates an HMM path matcher that only matches to vertices that are accessible by cars.

   Creates an HMM path matcher that only matches to vertices that are accessible by cars.

   The path matcher uses TransitionProbabilityStrategies.directDistance to calculate the transition probabilities of the Hidden Markov Model. Therefore, this path matcher is not recommended for sparse input observations. For sparse input observations, consider using a path matcher created by PathMatchers.carPathMatcherWithTransitions instead.

   O

   The type of data accepted by the path matcher

7.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

8.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

16.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

17.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

18.  def toString(): String

    Definition Classes

    AnyRef → Any

19.  def unrestrictedPathMatcherWithTransitions[O](implicit arg0: GeoCoordinateOperations[O]): PathMatcher[O, Vertex, Seq[Vertex]]

    Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration.

    Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration. It is suitable for sparse probes. However, if the observations are not close enough, they will be considered unreachable.

    Besides a sequence of MatchResults, this path matcher returns a list of transitions. A transition is a sequence of Vertex objects that represents a path between OnRoad match results associated to two successive observations. A transition does not contain the two vertices referenced by the corresponding OnRoad match results.

    Consider the following example:

     O1                   O2
     |                    |
     v                    v
    --V1--> --V2--> --V3-->

    The observation O1 is matched to vertex V1, and O2 to V3. Although V1 and V3 are not directly connected, the path matcher returns a transition from O1 to O2 that contains the intermediate vertices, V2 in this case. * Internally, this method creates a PathMatcherWithFilter that uses a DistanceFilter and a ProjectingInterpolator to improve match results when consecutive points are close to one another.

    See also PathMatcherWithFilter for more information about filtering and interpolation.

20.  def unrestrictedPathMatcherWithoutTransitions[O](implicit arg0: GeoCoordinateOperations[O]): PathMatcher[O, Vertex, NoTransition]

    Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration.

    Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration.

    The path matcher uses TransitionProbabilityStrategies.directDistance to calculate the transition probabilities of the Hidden Markov Model. Therefore, this path matcher is not recommended for sparse input observations. For sparse input observations, consider using a path matcher created by PathMatchers.unrestrictedPathMatcherWithTransitions instead.

21.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()