Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Fix some clippy lints | Tavian Barnes | 2021-10-12 | 4 | -5/+6 |
| | |||||
* | exhaustive: Derive Clone | Tavian Barnes | 2021-07-04 | 1 | -1/+1 |
| | |||||
* | kd, vp: Use as_deref() | Tavian Barnes | 2021-06-02 | 2 | -6/+4 |
| | |||||
* | docs: Update katex to 0.13.11 | Tavian Barnes | 2021-05-19 | 1 | -2/+4 |
| | |||||
* | distance: Move a bound from a where clause to Self::Value directly | Tavian Barnes | 2021-02-25 | 1 | -2/+1 |
| | |||||
* | knn: Move NearestNeighbor interfaces to a submodule | Tavian Barnes | 2021-02-25 | 8 | -509/+524 |
| | |||||
* | vp: Remove workaround for https://github.com/rust-lang/rust/issues/72582 | Tavian Barnes | 2021-02-24 | 1 | -5/+1 |
| | |||||
* | vp: Add a non-consuming iter() to VpTree and FlatVpTree | Tavian Barnes | 2021-02-24 | 1 | -0/+92 |
| | |||||
* | kd: Add a non-consuming iter() to KdTree and FlatKdTree | Tavian Barnes | 2021-02-24 | 1 | -2/+72 |
| | |||||
* | exhaustive: Add a non-consuming iter() | Tavian Barnes | 2021-02-24 | 1 | -3/+37 |
| | |||||
* | exhaustive: Add a wrapper type for IntoIterator | Tavian Barnes | 2021-02-24 | 1 | -9/+13 |
| | |||||
* | docs: Fix a typo in the top-level documentation | Tavian Barnes | 2021-02-24 | 1 | -2/+2 |
| | |||||
* | ks: Use sort_unstable_by_key rather than sort_by_cached_key | Tavian Barnes | 2020-11-18 | 1 | -4/+4 |
| | | | | | The comparison key is just a single coordinate, no need for the overhead of caching. | ||||
* | vp: Fix FlatVpTree Debug field name | Tavian Barnes | 2020-10-13 | 1 | -1/+1 |
| | |||||
* | Version 0.2.00.2.0 | Tavian Barnes | 2020-08-24 | 1 | -2/+2 |
| | |||||
* | Update default branch to 'main' | Tavian Barnes | 2020-07-10 | 1 | -2/+2 |
| | |||||
* | docs: Add some examples to the main page | Tavian Barnes | 2020-07-08 | 1 | -0/+27 |
| | |||||
* | kd: Use a more traditional k-d tree implementation | Tavian Barnes | 2020-07-06 | 9 | -118/+84 |
| | | | | | | | | | The slight extra pruning possible in the previous implementation didn't seem to be worth it. The new, simpler implementation is also about 30% faster in most of the benchmarks. This gets rid of Coordinate{Proximity,Metric} as they're not necessary any more (and the old ExactNeighbors impl was too restrictive anyway). | ||||
* | Clean up merge_k_nearest*() interface a bit | Tavian Barnes | 2020-07-06 | 2 | -47/+41 |
| | |||||
* | Add methods for merging new neighbors into a vector in-place | Tavian Barnes | 2020-07-03 | 2 | -82/+184 |
| | |||||
* | Preallocate the heap for k_nearest*() | Tavian Barnes | 2020-07-02 | 1 | -3/+3 |
| | |||||
* | Version 0.1.10.1.1 | Tavian Barnes | 2020-06-29 | 1 | -1/+1 |
| | |||||
* | Bump criterion to 0.3.3 | Tavian Barnes | 2020-06-29 | 1 | -1/+1 |
| | |||||
* | distance: Expand the Distance docs | Tavian Barnes | 2020-06-29 | 1 | -3/+9 |
| | |||||
* | distance: Expand the Proximity docs | Tavian Barnes | 2020-06-29 | 1 | -6/+49 |
| | |||||
* | Apply some rustfmt suggestions | Tavian Barnes | 2020-06-28 | 8 | -18/+16 |
| | |||||
* | benches: Deduplicate some code with macros | Tavian Barnes | 2020-06-28 | 1 | -46/+48 |
| | |||||
* | cos: Add a TryFrom<T> impl for AngularDistance<T> | Tavian Barnes | 2020-06-27 | 1 | -1/+20 |
| | |||||
* | Fix some clippy lints | Tavian Barnes | 2020-06-27 | 2 | -5/+17 |
| | |||||
* | docs: Update some links | Tavian Barnes | 2020-06-27 | 10 | -63/+73 |
| | |||||
* | docs: Integrate KaTeX and add some formulas | Tavian Barnes | 2020-06-27 | 9 | -18/+141 |
| | |||||
* | euclid: Fix a doc typo (s/Createa/Creates/) | Tavian Barnes | 2020-06-25 | 1 | -1/+1 |
| | |||||
* | cos: Add prenormalized cosine/angular distances, and an order embedding | Tavian Barnes | 2020-06-25 | 1 | -16/+332 |
| | |||||
* | cos: Implement cosine and angular distance | Tavian Barnes | 2020-06-25 | 2 | -0/+196 |
| | |||||
* | Add links to module summaries | Tavian Barnes | 2020-06-24 | 8 | -8/+8 |
| | |||||
* | cargo: Update dependencies | Tavian Barnes | 2020-06-24 | 1 | -2/+2 |
| | |||||
* | cargo: Make rand a dev dependency | Tavian Barnes | 2020-06-24 | 1 | -2/+2 |
| | |||||
* | README.md: Add crates.io and docs.rs badges | Tavian Barnes | 2020-06-24 | 1 | -0/+2 |
| | |||||
* | lp: Implement general L^p spaces | Tavian Barnes | 2020-06-24 | 2 | -0/+59 |
| | |||||
* | hamming: Implement Hamming distance0.1.0 | Tavian Barnes | 2020-06-24 | 2 | -0/+77 |
| | |||||
* | chebyshev: Implement Chebyshev distance | Tavian Barnes | 2020-06-24 | 2 | -0/+121 |
| | |||||
* | taxi: Implement taxicab distance | Tavian Barnes | 2020-06-24 | 2 | -0/+117 |
| | |||||
* | docs: Add a README | Tavian Barnes | 2020-06-24 | 2 | -0/+31 |
| | |||||
* | Add an overview to the documentation | Tavian Barnes | 2020-06-24 | 1 | -0/+88 |
| | |||||
* | kd: Implement flat k-d trees | Tavian Barnes | 2020-06-24 | 2 | -1/+162 |
| | |||||
* | kd: Implement k-d trees | Tavian Barnes | 2020-06-24 | 3 | -0/+365 |
| | |||||
* | vp: Implement flat VP trees | Tavian Barnes | 2020-06-24 | 2 | -2/+189 |
| | |||||
* | vp: Implement vantage-point trees | Tavian Barnes | 2020-06-24 | 3 | -0/+380 |
| | |||||
* | util: Add a wrapper to implement Ord on top of PartialOrd | Tavian Barnes | 2020-06-24 | 2 | -0/+56 |
| | | | | | This allows nearest neighbors implementations to sort things by distance or coordinate. | ||||
* | benches: Add criterion benchmarks | Tavian Barnes | 2020-06-24 | 2 | -0/+71 |
| |