work/smartcore
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix: broken links

Browse Source
This commit is contained in:
Volodymyr Orlov
2020-08-30 16:47:19 -07:00
parent 70fbdfe413
commit 53ed216c4c
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/algorithm/neighbour/cover_tree.rs
+1 -1
View File
@@ -45,7 +45,7 @@ pub struct CoverTree<T, F: RealNumber, D: Distance<T, F>> {
impl<T: Debug, F: RealNumber, D: Distance<T, F>> CoverTree<T, F, D> {
/// Construct a cover tree.
/// * `data` - vector of data points to search for.
/// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../algorithm/neighbour/index.html) interface.
/// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../../../math/distance/index.html) interface.
pub fn new(mut data: Vec<T>, distance: D) -> CoverTree<T, F, D> {
let mut tree = CoverTree {
base: F::two(),
src/algorithm/neighbour/linear_search.rs
+1 -1
View File
@@ -40,7 +40,7 @@ pub struct LinearKNNSearch<T, F: RealNumber, D: Distance<T, F>> {
impl<T, F: RealNumber, D: Distance<T, F>> LinearKNNSearch<T, F, D> {
/// Initializes algorithm.
/// * `data` - vector of data points to search for.
/// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../algorithm/neighbour/index.html) interface.
/// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../../../math/distance/index.html) interface.
pub fn new(data: Vec<T>, distance: D) -> LinearKNNSearch<T, F, D> {
LinearKNNSearch {
data: data,