What's new

• No more bubble sorts in hot paths. See the ref.: #45
• Index-based BFS. See the ref.: #46
• Reduced allocations in projection calculation. See the ref.: #47
• Fixed bug in FindNearest function which could led to incorrect early exists. See the ref.: #48
• Flatten hashmaps, added bbox pruning and cache polylines data. See the ref.: #50

What's new

• Resolve false sub-match breaks when consecutive GPS points project onto the same edge with different routing vertices.
• Use distance-based transition probability (length in meters) instead of time-based cost (geometrical similarity)

What's new

Now Horizon is CSV-format-agnostic and enables time-based routing cost instead of distance-only (thanks to flexible lookup technique)

For the more information see the reference: #43

What's new

• New codes.go with matcher code constants. Currently they are:
  900 - OK,
  901 - no candidates,
  902 - orphan observation
• Updated matcher enginge to preserve unmatched observations in results
• Do not call Viterbi on single point. Just use 2 * emission for probablity

For more info see PR: #39

What's new

• Now candidates (in shortest path/map match) are prioritized via Strongly Connected Components (SCC, Tarjan's Algorithm). Ref: https://en.wikipedia.org/wiki/
• It is possible now to not use radius (for both gRPC and HTTP API), so it fallbacks to optimized function FindNearest which uses incremental frontier expansion instead of recalculating BFS per ring (cells around). Max distance of search in that case is (maxSearchRings * cellSize)

For for information check this PR: #38

What's new

• New for import WKT is used instead of GeoJSON.
  It is a breaking change, to to deal with it and get more information check PR: #37

What's new

• Update CH version
• Use thread-safe API of CH package via QueryPool (since it is breaking change)
• Queries became a little bit faster due new CH, but at the same time a little bit longer due thread-safeness. So changes are negligible in total.

For the more information see #36

What's new

• Now it is possible to define Euclidean spatial storage. Storage is based on R-tree thanks to https://github.com/tidwall/rtree
• Spatial storage is now interface

For the detailed info see this PR #35

What's new

• Bump dependencies
• Allow to specify accuracy (sigma) for each observation
• Allow sub map matching
• Introduce initial builder pattern for both matcher and spatial engine

For more details:

1. Sub matching #33, #34
2. Accuracy #32
3. Deps: #31

What's new

• gRPC API is now prepared. There is a little difference between REST API and gRPC: most of it just field naming and arrangement, but you should be good to go.
• Server gRPC docs on http://ip:port/api/v0.1.0/grpc/docs/index.html
• Bumped golang.org/x/net version up to 0.38.0
• New binaries have been built

For more information see the reference:
#27
#28