SYMBOL INDEX (185 symbols across 33 files)

FILE: src/ANN/ANN.cpp
  function ANNdist (line 47) | ANNdist annDist(						// interpoint squared distance
  function annPrintPt (line 71) | void annPrintPt(						// print a point
  function ANNpoint (line 111) | ANNpoint annAllocPt(int dim, ANNcoord c)		// allocate 1 point
  function ANNpointArray (line 118) | ANNpointArray annAllocPts(int n, int dim)		// allocate n pts in dim
  function annDeallocPt (line 128) | void annDeallocPt(ANNpoint &p)					// deallocate 1 point
  function annDeallocPts (line 134) | void annDeallocPts(ANNpointArray &pa)			// deallocate points
  function ANNpoint (line 141) | ANNpoint annCopyPt(int dim, ANNpoint source)	// copy point
  function annAssignRect (line 149) | void annAssignRect(int dim, ANNorthRect &dest, const ANNorthRect &source)
  function ANNbool (line 158) | ANNbool ANNorthRect::inside(int dim, ANNpoint p)
  function annError (line 170) | void annError(const char *msg, ANNerr level)
  function annMaxPtsVisit (line 200) | void annMaxPtsVisit(			// set limit on max. pts to visit in search

FILE: src/ANN/ANN.h
  type ANNbool (line 130) | enum ANNbool {ANNfalse = 0, ANNtrue = 1}
  type ANNcoord (line 156) | typedef double	ANNcoord;
  type ANNdist (line 157) | typedef double	ANNdist;
  type ANNidx (line 173) | typedef int		ANNidx;
  type ANNcoord (line 374) | typedef ANNcoord* ANNpoint;
  type ANNpoint (line 375) | typedef ANNpoint* ANNpointArray;
  type ANNdist (line 376) | typedef ANNdist*  ANNdistArray;
  type ANNidx (line 377) | typedef ANNidx*   ANNidxArray;
  function class (line 490) | class DLL_API ANNpointSet {
  function theDim (line 574) | int theDim()						// return dimension of space
  function nPoints (line 577) | int nPoints()						// return number of points
  function ANNpointArray (line 580) | ANNpointArray thePoints()			// return pointer to points
  type ANNsplitRule (line 605) | enum ANNsplitRule {
  type ANNshrinkRule (line 614) | enum ANNshrinkRule {
  type ANNkd_node (line 712) | typedef ANNkd_node*	ANNkd_ptr;
  function theDim (line 779) | int theDim()						// return dimension of space
  function nPoints (line 782) | int nPoints()						// return number of points
  function ANNpointArray (line 785) | ANNpointArray thePoints()			// return pointer to points

FILE: src/ANN/ANNperf.h
  function class (line 45) | class ANNkdStats {			// stats on kd-tree
  function class (line 85) | class DLL_API ANNsampStat {

FILE: src/ANN/ANNx.h
  type ANNerr (line 46) | enum ANNerr {ANNwarn = 0, ANNabort = 1}
  function class (line 89) | class ANNorthRect {
  function class (line 130) | class ANNorthHalfSpace {
  function ANNbool (line 145) | ANNbool in(ANNpoint q) const	// is q inside halfspace?
  function ANNbool (line 148) | ANNbool out(ANNpoint q) const	// is q outside halfspace?
  function ANNdist (line 151) | ANNdist dist(ANNpoint q) const	// (squared) distance from q
  function setLowerBound (line 154) | void setLowerBound(int d, ANNpoint p)// set to lower bound at p[i]
  function setUpperBound (line 157) | void setUpperBound(int d, ANNpoint p)// set to upper bound at p[i]
  function project (line 160) | void project(ANNpoint &q)		// project q (modified) onto halfspace
  type ANNorthHalfSpace (line 165) | typedef ANNorthHalfSpace *ANNorthHSArray;

FILE: src/ANN/bd_tree.cpp
  type ANNdecomp (line 163) | enum ANNdecomp {SPLIT, SHRINK}
  function ANNdecomp (line 182) | ANNdecomp trySimpleShrink(				// try a simple shrink
  function ANNdecomp (line 237) | ANNdecomp tryCentroidShrink(			// try a centroid shrink
  function ANNdecomp (line 280) | ANNdecomp selectDecomp(			// select decomposition method
  function ANNkd_ptr (line 336) | ANNkd_ptr rbd_tree(				// recursive construction of bd-tree

FILE: src/ANN/bd_tree.h
  function class (line 61) | class ANNbd_shrink : public ANNkd_node	// splitting node of a kd-tree

FILE: src/ANN/kd_dump.cpp
  type ANNtreeType (line 53) | enum ANNtreeType {KD_TREE, BD_TREE}
  function ANNkd_ptr (line 260) | static ANNkd_ptr annReadDump(
  function ANNkd_ptr (line 375) | static ANNkd_ptr annReadTree(

FILE: src/ANN/kd_split.cpp
  function kd_split (line 44) | void kd_split(
  function midpt_split (line 76) | void midpt_split(
  function sl_midpt_split (line 146) | void sl_midpt_split(
  function fair_split (line 243) | void fair_split(
  function sl_fair_split (line 346) | void sl_fair_split(

FILE: src/ANN/kd_tree.cpp
  function annClose (line 221) | void annClose()				// close use of ANN
  function ANNkd_ptr (line 314) | ANNkd_ptr rkd_tree(				// recursive construction of kd-tree

FILE: src/ANN/kd_tree.h
  function class (line 46) | class ANNkd_node{						// generic kd-tree node (empty shell)
  function class (line 91) | class ANNkd_leaf: public ANNkd_node		// leaf node for kd-tree
  function class (line 142) | class ANNkd_split : public ANNkd_node	// splitting node of a kd-tree

FILE: src/ANN/kd_util.cpp
  function annAspectRatio (line 52) | double annAspectRatio(
  function annEnclRect (line 73) | void annEnclRect(
  function annEnclCube (line 92) | void annEnclCube(						// compute smallest enclosing cube
  function ANNdist (line 124) | ANNdist annBoxDistance(			// compute distance from point to box
  function ANNcoord (line 154) | ANNcoord annSpread(				// compute point spread along dimension
  function annMinMax (line 170) | void annMinMax(					// compute min and max coordinates along dim
  function annMaxSpread (line 187) | int annMaxSpread(						// compute dimension of max spread
  function annMedianSplit (line 230) | void annMedianSplit(
  function annPlaneSplit (line 291) | void annPlaneSplit(				// split points by a plane
  function annBoxSplit (line 332) | void annBoxSplit(				// split points by a box
  function annSplitBalance (line 360) | int annSplitBalance(			// determine balance factor of a split
  function annBox2Bnds (line 384) | void annBox2Bnds(						// convert inner box to bounds
  function annBnds2Box (line 426) | void annBnds2Box(

FILE: src/ANN/perf.cpp
  function DLL_API (line 69) | DLL_API void annResetStats(int data_size) // reset stats for a set of qu...
  function DLL_API (line 83) | DLL_API void annResetCounts()				// reset counts for one query
  function DLL_API (line 93) | DLL_API void annUpdateStats()				// update stats with current counts
  function print_one_stat (line 105) | void print_one_stat(const char *title, ANNsampStat s, double div)
  function DLL_API (line 114) | DLL_API void annPrintStats(				// print statistics for a run

FILE: src/ANN/pr_queue.h
  type ANNdist (line 36) | typedef ANNdist			PQkey;
  function class (line 54) | class ANNpr_queue {
  function ANNbool (line 75) | ANNbool empty()						// is queue empty?
  function ANNbool (line 78) | ANNbool non_empty()					// is queue nonempty?
  function reset (line 81) | void reset()						// make existing queue empty
  function insert (line 84) | inline void insert(					// insert item (inlined for speed)
  function extr_min (line 102) | inline void extr_min(				// extract minimum (inlined for speed)

FILE: src/ANN/pr_queue_k.h
  type ANNdist (line 34) | typedef ANNdist			PQKkey;
  type PQKinfo (line 35) | typedef int				PQKinfo;
  function class (line 66) | class ANNmin_k {
  function PQKkey (line 87) | PQKkey ANNmin_key()					// return minimum key
  function PQKkey (line 90) | PQKkey max_key()					// return maximum key
  function PQKkey (line 93) | PQKkey ith_smallest_key(int i)		// ith smallest key (i in [0..n-1])
  function PQKinfo (line 96) | PQKinfo ith_smallest_info(int i)	// info for ith smallest (i in [0..n-1])
  function insert (line 99) | inline void insert(					// insert item (inlined for speed)

FILE: src/JP.cpp
  function IntegerVector (line 16) | IntegerVector JP_int(IntegerMatrix nn, unsigned int kt) {
  function IntegerMatrix (line 88) | IntegerMatrix SNN_sim_int(IntegerMatrix nn, LogicalVector jp) {

FILE: src/RcppExports.cpp
  function RcppExport (line 15) | RcppExport SEXP _dbscan_JP_int(SEXP nnSEXP, SEXP ktSEXP) {
  function RcppExport (line 27) | RcppExport SEXP _dbscan_SNN_sim_int(SEXP nnSEXP, SEXP jpSEXP) {
  function RcppExport (line 39) | RcppExport SEXP _dbscan_ANN_cleanup() {
  function RcppExport (line 48) | RcppExport SEXP _dbscan_comps_kNN(SEXP nnSEXP, SEXP mutualSEXP) {
  function RcppExport (line 60) | RcppExport SEXP _dbscan_comps_frNN(SEXP nnSEXP, SEXP mutualSEXP) {
  function RcppExport (line 72) | RcppExport SEXP _dbscan_intToStr(SEXP ivSEXP) {
  function RcppExport (line 83) | RcppExport SEXP _dbscan_dist_subset(SEXP distSEXP, SEXP idxSEXP) {
  function RcppExport (line 95) | RcppExport SEXP _dbscan_XOR(SEXP lhsSEXP, SEXP rhsSEXP) {
  function RcppExport (line 107) | RcppExport SEXP _dbscan_dspc(SEXP cl_idxSEXP, SEXP internal_nodesSEXP, S...
  function RcppExport (line 121) | RcppExport SEXP _dbscan_dbscan_int(SEXP dataSEXP, SEXP epsSEXP, SEXP min...
  function RcppExport (line 141) | RcppExport SEXP _dbscan_reach_to_dendrogram(SEXP reachabilitySEXP, SEXP ...
  function RcppExport (line 153) | RcppExport SEXP _dbscan_dendrogram_to_reach(SEXP xSEXP) {
  function RcppExport (line 164) | RcppExport SEXP _dbscan_mst_to_dendrogram(SEXP mstSEXP) {
  function RcppExport (line 175) | RcppExport SEXP _dbscan_dbscan_density_int(SEXP dataSEXP, SEXP epsSEXP, ...
  function RcppExport (line 191) | RcppExport SEXP _dbscan_frNN_int(SEXP dataSEXP, SEXP epsSEXP, SEXP typeS...
  function RcppExport (line 207) | RcppExport SEXP _dbscan_frNN_query_int(SEXP dataSEXP, SEXP querySEXP, SE...
  function RcppExport (line 224) | RcppExport SEXP _dbscan_distToAdjacency(SEXP constraintsSEXP, SEXP NSEXP) {
  function RcppExport (line 236) | RcppExport SEXP _dbscan_buildDendrogram(SEXP hclSEXP) {
  function RcppExport (line 247) | RcppExport SEXP _dbscan_all_children(SEXP hierSEXP, SEXP keySEXP, SEXP l...
  function RcppExport (line 260) | RcppExport SEXP _dbscan_node_xy(SEXP cl_treeSEXP, SEXP cl_hierarchySEXP,...
  function RcppExport (line 273) | RcppExport SEXP _dbscan_simplifiedTree(SEXP cl_treeSEXP) {
  function RcppExport (line 284) | RcppExport SEXP _dbscan_computeStability(SEXP hclSEXP, SEXP minPtsSEXP, ...
  function RcppExport (line 297) | RcppExport SEXP _dbscan_validateConstraintList(SEXP constraintsSEXP, SEX...
  function RcppExport (line 309) | RcppExport SEXP _dbscan_computeVirtualNode(SEXP noiseSEXP, SEXP constrai...
  function RcppExport (line 321) | RcppExport SEXP _dbscan_fosc(SEXP cl_treeSEXP, SEXP cidSEXP, SEXP scSEXP...
  function RcppExport (line 341) | RcppExport SEXP _dbscan_extractUnsupervised(SEXP cl_treeSEXP, SEXP prune...
  function RcppExport (line 354) | RcppExport SEXP _dbscan_extractSemiSupervised(SEXP cl_treeSEXP, SEXP con...
  function RcppExport (line 369) | RcppExport SEXP _dbscan_kNN_query_int(SEXP dataSEXP, SEXP querySEXP, SEX...
  function RcppExport (line 386) | RcppExport SEXP _dbscan_kNN_int(SEXP dataSEXP, SEXP kSEXP, SEXP typeSEXP...
  function RcppExport (line 402) | RcppExport SEXP _dbscan_lof_kNN(SEXP dataSEXP, SEXP minPtsSEXP, SEXP typ...
  function RcppExport (line 418) | RcppExport SEXP _dbscan_mrd(SEXP dmSEXP, SEXP cdSEXP) {
  function RcppExport (line 430) | RcppExport SEXP _dbscan_mst(SEXP x_distSEXP, SEXP nSEXP) {
  function RcppExport (line 442) | RcppExport SEXP _dbscan_hclustMergeOrder(SEXP mstSEXP, SEXP oSEXP) {
  function RcppExport (line 454) | RcppExport SEXP _dbscan_optics_int(SEXP dataSEXP, SEXP epsSEXP, SEXP min...
  function RcppExport (line 472) | RcppExport SEXP _dbscan_lowerTri(SEXP mSEXP) {
  function RcppExport (line 521) | RcppExport void R_init_dbscan(DllInfo *dll) {

FILE: src/UnionFind.h
  function class (line 21) | class UnionFind

FILE: src/cleanup.cpp
  function ANN_cleanup (line 16) | void ANN_cleanup() {

FILE: src/connectedComps.cpp
  function IntegerVector (line 17) | IntegerVector comps_kNN(IntegerMatrix nn, bool mutual) {
  function IntegerVector (line 73) | IntegerVector comps_frNN(List nn, bool mutual) {

FILE: src/dbcv.cpp
  function StringVector (line 25) | StringVector intToStr(IntegerVector iv){
  function toMap (line 34) | std::unordered_map<std::string, double> toMap(List map){
  function NumericVector (line 44) | NumericVector retrieve(StringVector keys, std::unordered_map<std::string...
  function NumericVector (line 52) | NumericVector dist_subset_arma(const NumericVector& dist, IntegerVector ...
  function NumericVector (line 65) | NumericVector dist_subset(const NumericVector& dist, IntegerVector idx){
  function remove_zero (line 83) | bool remove_zero(ANNdist cdist){
  function ANNdist (line 87) | ANNdist inv_density(ANNdist cdist){
  function XOR (line 208) | Rcpp::LogicalVector XOR(Rcpp::LogicalVector lhs, Rcpp::LogicalVector rhs) {
  function NumericMatrix (line 216) | NumericMatrix dspc(const List& cl_idx, const List& internal_nodes, const...

FILE: src/dbscan.cpp
  function IntegerVector (line 24) | IntegerVector dbscan_int(

FILE: src/dendrogram.cpp
  function fast_atoi (line 18) | int fast_atoi( const char * str )
  function which_int (line 27) | int which_int(IntegerVector x, int target) {
  function List (line 37) | List reach_to_dendrogram(const Rcpp::List reachability, const NumericVec...
  function DFS (line 95) | int DFS(List d, List& rp, int pnode, NumericVector stack) {
  function List (line 131) | List dendrogram_to_reach(const Rcpp::List x) {
  function List (line 142) | List mst_to_dendrogram(const NumericMatrix mst) {

FILE: src/density.cpp
  function IntegerVector (line 20) | IntegerVector dbscan_density_int(

FILE: src/frNN.cpp
  function List (line 19) | List frNN_int(NumericMatrix data, double eps, int type,
  function List (line 93) | List frNN_query_int(NumericMatrix data, NumericMatrix query, double eps,...

FILE: src/hdbscan.cpp
  function List (line 31) | List distToAdjacency(IntegerVector constraints, const int N){
  function List (line 49) | List buildDendrogram(List hcl) {
  function IntegerVector (line 138) | IntegerVector all_children(List hier, int key, bool leaves_only = false){
  function IntegerVector (line 173) | IntegerVector getSalientAssignments(List cl_tree, List cl_hierarchy, std...
  function NumericMatrix (line 199) | NumericMatrix node_xy(List cl_tree, List cl_hierarchy, int cid = 0){
  function List (line 249) | List simplifiedTree(List cl_tree) {
  function List (line 342) | List computeStability(const List hcl, const int minPts, bool compute_glo...
  function List (line 489) | List validateConstraintList(List& constraints, int n){
  function computeVirtualNode (line 601) | double computeVirtualNode(IntegerVector noise, List constraints){
  function NumericVector (line 637) | NumericVector fosc(List cl_tree, std::string cid, std::list<int>& sc, Li...
  function List (line 762) | List extractUnsupervised(List cl_tree, bool prune_unstable = false, doub...
  function List (line 776) | List extractSemiSupervised(List cl_tree, List constraints, float alpha =...

FILE: src/kNN.cpp
  function List (line 16) | List kNN_int(NumericMatrix data, int k,
  function List (line 84) | List kNN_query_int(NumericMatrix data, NumericMatrix query, int k,

FILE: src/lof.cpp
  function List (line 21) | List lof_kNN(NumericMatrix data, int minPts,

FILE: src/mrd.cpp
  function NumericVector (line 29) | NumericVector mrd(NumericVector dm, NumericVector cd) {

FILE: src/mst.cpp
  function mst (line 37) | Rcpp::NumericMatrix mst(const NumericVector x_dist, const R_xlen_t n) {
  function visit (line 99) | void visit(const IntegerMatrix& merge, IntegerVector& order, int i, int ...
  function IntegerVector (line 110) | IntegerVector extractOrder(IntegerMatrix merge){
  function List (line 119) | List hclustMergeOrder(NumericMatrix mst, IntegerVector o){

FILE: src/optics.cpp
  function update (line 18) | void update(
  function List (line 60) | List optics_int(NumericMatrix data, double eps, int minPts,

FILE: src/regionQuery.cpp
  function nn (line 20) | nn regionQueryDist(int id, ANNpointArray dataPts, ANNpointSet* kdTree,
  function regionQuery (line 32) | std::vector<int> regionQuery(int id, ANNpointArray dataPts, ANNpointSet*...
  function nn (line 46) | nn regionQueryDist_point(ANNpoint queryPt, ANNpointArray dataPts,
  function regionQuery_point (line 57) | std::vector<int> regionQuery_point(ANNpoint queryPt, ANNpointArray dataPts,

FILE: src/regionQuery.h
  type std (line 20) | typedef std::pair< std::vector<int>, std::vector<double> > nn ;

FILE: src/utilities.cpp
  function IntegerVector (line 15) | IntegerVector lowerTri(IntegerMatrix m) {
  function NumericVector (line 26) | NumericVector combine(const NumericVector& t1, const NumericVector& t2) {
  function IntegerVector (line 34) | IntegerVector combine(const IntegerVector& t1, const IntegerVector& t2) {
  function IntegerVector (line 44) | IntegerVector concat_int(List const& container) {