var searchIndex = {};
searchIndex["cogset"] = {"doc":"Clustering algorithms.","items":[[3,"Dbscan","cogset","Clustering via the DBSCAN algorithm[1].",null,null],[3,"BruteScan","","A point collection where queries are answered via brute-force\nscans over the whole list.",null,null],[3,"BruteScanNeighbours","","An iterator over the neighbours of a point in a `BruteScan`.",null,null],[3,"Euclid","","Points in ℝ<sup><i>n</i></sup> with the <i>L</i><sup>2</sup> norm.",null,null],[12,"0","","",0,null],[11,"new","","Create a new DBSCAN instance, with the given `eps` and\n`min_points`.",1,{"inputs":[{"name":"p"},{"name":"f64"},{"name":"usize"}],"output":{"name":"dbscan"}}],[11,"noise_points","","Points that have been classified as noise once the algorithm\nfinishes.",1,null],[11,"next","","",1,null],[11,"new","","Create a new `BruteScan`.",2,null],[11,"all_points","","",2,null],[11,"neighbours","","",2,null],[11,"next","","",3,null],[11,"partial_cmp","","",0,null],[11,"lt","","",0,null],[11,"le","","",0,null],[11,"gt","","",0,null],[11,"ge","","",0,null],[11,"cmp","","",0,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"clone","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[11,"dist","","",0,null],[11,"dist_lower_bound","","",0,null],[8,"Point","","A point in some (metric) space.",null,null],[10,"dist","","Accurate compute the distance from `self` to `other`.",4,null],[11,"dist_lower_bound","","Compute an estimate of the distance from `self` to `other`.",4,null],[8,"RegionQuery","","Collections of points that can be queried to find nearby points.",null,null],[16,"Neighbours","","An iterator over the nearby points and their distances of a given one.",5,null],[10,"neighbours","","Return an iterator over points in `self` with distance from\n`point` less than or equal to `epsilon`.",5,null],[8,"Points","","A data structure that contains points of some sort.",null,null],[16,"Point","","The representation of a point.",6,null],[8,"ListPoints","","Collections of points that can list everything they contain.",null,null],[16,"AllPoints","","An iterator over all the points in an instance of `Self`",7,null],[10,"all_points","","Return an iterator over all points in `self`.",7,null],[11,"dist_lower_bound","","Compute an estimate of the distance from `self` to `other`.",4,null]],"paths":[[3,"Euclid"],[3,"Dbscan"],[3,"BruteScan"],[3,"BruteScanNeighbours"],[8,"Point"],[8,"RegionQuery"],[8,"Points"],[8,"ListPoints"]]};
initSearch(searchIndex);