Packages

object PathMatchers extends PathMatchersMixin

Linear Supertypes
PathMatchersMixin, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PathMatchers
  2. PathMatchersMixin
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. def apply(optimizedMap: OptimizedMapLayers): PathMatchers

    Creates a PathMatchers from an Optimized Map for Location Library.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def carPathMatcherWithTransitions[O](carPathMatcherLayers: CarPathMatcherLayers)(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.

  7. def carPathMatcherWithoutTransitions[O](carPathMatcherLayers: CarPathMatcherLayers)(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

  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def newHMMPathMatcher[O, V, T](cg: CandidateGenerator[O, V], eps: EmissionProbabilityStrategy[O, V], tps: TransitionProbabilityStrategy[O, V, T]): HMMPathMatcher[O, V, T]

    Creates an HMM path matcher from its components.

    Creates an HMM path matcher from its components.

    Definition Classes
    PathMatchersMixin
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. def restrictedDense[O, V, E, LS](search: ProximitySearch[V], graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], turnRestrictions: PropertyMap[E, Boolean], projection: GeoProjection)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): PathMatcher[O, V, Seq[V]]

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

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

    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.

    O

    The type of data accepted by the path matcher

    V

    The vertex type of the graph

    E

    The edge type of the graph

    LS

    The line string type of vertex geometries

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    turnRestrictions

    If this attribute is true for some edge, that edge is restricted and will not be traversed by the path matcher

    projection

    Used to compute distances between points and project them onto vertex geometries

    Definition Classes
    PathMatchersMixin
  20. def restrictedSparse[O, V, E, LS](search: ProximitySearch[V], graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], turnRestrictions: PropertyMap[E, Boolean], projection: GeoProjection)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): PathMatcher[O, V, Seq[V]]

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

    Creates an HMM path matcher that only matches to accessible vertices and 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

    V

    The vertex type of the graph

    E

    The edge type of the graph

    LS

    The line string type of vertex geometries

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    turnRestrictions

    If this attribute is true for some edge, that edge is restricted and will not be traversed by the path matcher

    projection

    Used to compute distances between points and project them onto vertex geometries

    Definition Classes
    PathMatchersMixin
  21. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  22. def toString(): String
    Definition Classes
    AnyRef → Any
  23. def unrestrictedDense[O, V, E, LS](search: ProximitySearch[V], graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], projection: GeoProjection)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): PathMatcher[O, V, Seq[V]]

    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.

    O

    The type of data accepted by the path matcher

    V

    The vertex type of the graph

    E

    The edge type of the graph

    LS

    The line string type of vertex geometries

    projection

    used to compute distances between points and project them onto vertex geometries

    Definition Classes
    PathMatchersMixin
  24. def unrestrictedPathMatcherWithTransitions[O](unrestrictedPathMatcherLayers: UnrestrictedPathMatcherLayers)(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.

  25. def unrestrictedPathMatcherWithoutTransitions[O](unrestrictedPathMatcherLayers: UnrestrictedPathMatcherLayers)(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.

  26. def unrestrictedSparse[O, V, E, LS](search: ProximitySearch[V], graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], projection: GeoProjection)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): PathMatcher[O, V, Seq[V]]

    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.

    O

    The type of data accepted by the path matcher

    V

    The vertex type of the graph

    E

    The edge type of the graph

    LS

    The line string type of vertex geometries

    projection

    Used to compute distances between points and project them onto vertex geometries

    Definition Classes
    PathMatchersMixin
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Deprecated Value Members

  1. def carPathMatcher[O](optimizedMap: Catalog, cacheManager: DataLoaderProvider)(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

    optimizedMap

    An Optimized Map for Location Library instance

    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.

  2. def carPathMatcherWithTransitions[O](optimizedMap: Catalog, cacheManager: DataLoaderProvider)(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

    optimizedMap

    An Optimized Map instance

    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.

    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.

  3. def unrestrictedPathMatcher[O](optimizedMap: Catalog, cacheManager: DataLoaderProvider)(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.

    optimizedMap

    An Optimized Map for Location Library instance

    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.

  4. def unrestrictedPathMatcherWithTransitions[O](optimizedMap: Catalog, cacheManager: DataLoaderProvider)(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.

    optimizedMap

    An Optimized Map for Location Library instance

    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.54) Use methods based on OptimizedMapLayers instead.

Inherited from PathMatchersMixin

Inherited from AnyRef

Inherited from Any

Ungrouped