SYMBOL INDEX (394 symbols across 76 files)

FILE: algorithms/HCNNG/clusterEdge.h
  function namespace (line 38) | namespace parlayANN {
  function generate_index (line 62) | int generate_index(int N, int i) {
  function closer_first (line 71) | auto closer_first =
  function closer_second (line 78) | auto closer_second =
  function active_indices (line 141) | auto active_indices =

FILE: algorithms/HCNNG/hcnng_index.h
  function namespace (line 36) | namespace parlayANN {
  function _union (line 53) | void _union(int x, int y) {
  function find (line 68) | int find(int x) {
  function flatten (line 82) | void flatten() {
  function is_full (line 86) | bool is_full() {
  function remove_edge_duplicates (line 114) | static void remove_edge_duplicates(indexType p, GraphI &G) {
  function remove_all_duplicates (line 123) | void remove_all_duplicates(GraphI &G) {
  function process_edges (line 129) | static void process_edges(GraphI &G, parlay::sequence<edge> edges) {

FILE: algorithms/HCNNG/neighbors.h
  function namespace (line 37) | namespace parlayANN {

FILE: algorithms/HNSW/HNSW.hpp
  type ANN (line 39) | namespace ANN{
    type type_metric (line 43) | enum class type_metric{
    type point (line 47) | struct point{
    class HNSW (line 52) | class HNSW
      type node (line 86) | struct node{
      type dist (line 93) | struct dist{
      type dist_ex (line 106) | struct dist_ex : dist
      type nearest (line 111) | struct nearest{
      type farthest (line 117) | struct farthest{
      method neighbourhood (line 146) | static auto neighbourhood(node &u, uint32_t level)
      method neighbourhood (line 155) | static auto neighbourhood(const node &u, uint32_t level)
      method node (line 161) | node& get_node(node_id id)
      method node (line 166) | const node& get_node(const node_id id) const
      class dist_evaluator (line 182) | class dist_evaluator{
        method dist_evaluator (line 189) | dist_evaluator(const point_t &p, uint32_t dim) :
        method dist_t (line 192) | dist_t operator()(const point_t &pv) const{
        method dist_t (line 195) | dist_t operator()(const point_t &pu, const point_t &pv) const{
      type graph (line 200) | struct graph{
        type edgeRange (line 202) | struct edgeRange{
          method edgeRange (line 203) | edgeRange(Nbh &nbh) : nbh(nbh){
          method size (line 208) | auto size() const{
          method prefetch (line 211) | void prefetch() const{
        method graph (line 222) | graph(const HNSW<U,Allocator> &hnsw, uint32_t l) :
        method num_nodes (line 226) | decltype(auto) num_nodes() const{
        method get_node (line 229) | decltype(auto) get_node(node_id pu) const{
        method get_edges (line 232) | decltype(auto) get_edges(node_id pu){
        method get_edges (line 235) | decltype(auto) get_edges(node_id pu) const{
        method max_degree (line 239) | uint32_t max_degree() const{
      method select_neighbors_simple_impl (line 259) | void select_neighbors_simple_impl(const T &u, Queue &C, uint32_t M)
      method select_neighbors_simple (line 294) | auto select_neighbors_simple(const T &u, const Queue &C, uint32_t M)
      method select_neighbors_heuristic (line 324) | auto select_neighbors_heuristic(const T &u,
      method Seq (line 431) | Seq prune_heuristic(
      method select_neighbors (line 488) | auto select_neighbors(const T &u,
      method get_level_random (line 505) | uint32_t get_level_random()
      method get_threshold_m (line 527) | auto get_threshold_m(uint32_t level) const{
      method get_deg (line 534) | auto get_deg(uint32_t level=0)
      method get_indeg (line 546) | auto get_indeg(uint32_t level) const
      method get_height (line 565) | uint32_t get_height() const
      method cnt_degree (line 570) | size_t cnt_degree(uint32_t l) const
      method cnt_vertex (line 580) | size_t cnt_vertex(uint32_t l) const
      method get_degree_max (line 589) | size_t get_degree_max(uint32_t l) const
    function beamSearch (line 1017) | auto beamSearch(

FILE: algorithms/HNSW/debug.hpp
  type search_control (line 13) | struct search_control{

FILE: algorithms/HNSW/dist.hpp
  class descr_ang (line 9) | class descr_ang
    method distance (line 18) | static float distance(const type_point &u, const type_point &v, uint32...
    method get_id (line 31) | static auto get_id(const type_point &u)
  class descr_ndot (line 38) | class descr_ndot
    method distance (line 47) | static float distance(const type_point &u, const type_point &v, uint32...
    method get_id (line 56) | static auto get_id(const type_point &u)
  class descr_l2 (line 63) | class descr_l2
    method distance (line 72) | static float distance(const type_point &u, const type_point &v, uint32...
    method get_id (line 93) | static auto get_id(const type_point &u)

FILE: algorithms/HNSW/h5_ops.hpp
  function get_reader (line 15) | auto get_reader(const char *file, const char *dir)
  function read_array_from_HDF5 (line 55) | std::pair<std::unique_ptr<T[]>,std::array<hsize_t,2>> read_array_from_HD...

FILE: algorithms/HNSW/type_point.hpp
  class internal_termination (line 18) | class internal_termination{
    method internal_termination (line 20) | internal_termination(){}
    method internal_termination (line 21) | internal_termination(int){std::terminate();}
  class fake_copyable (line 25) | class fake_copyable : public internal_termination{
    method fake_copyable (line 28) | fake_copyable(const T &c) : content(c){}
    method fake_copyable (line 29) | fake_copyable(T &&c) : content(std::move(c)){}
    method fake_copyable (line 31) | fake_copyable(fake_copyable&&) = default;
    method fake_copyable (line 32) | fake_copyable(const fake_copyable &other [[maybe_unused]])
  type point (line 51) | struct point
    method point (line 58) | point()
    method point (line 62) | point(uint32_t id_, const T *coord_)
    method point (line 67) | point(uint32_t id_, const T *coord_, C &&closure_)
  type file_format (line 75) | enum class file_format{
  class point_converter_default (line 80) | class point_converter_default
    method type (line 86) | type operator()(uint32_t id, Iter begin, [[maybe_unused]] Iter end)
  function load_from_vec (line 114) | inline std::pair<parlay::sequence<typename Conv::type>,uint32_t>
  class trait_type (line 143) | class trait_type{
  class trait_type<T,std::void_t<typename T::type>> (line 147) | class trait_type<T,std::void_t<typename T::type>>{
  class trait_type<T*,void> (line 153) | class trait_type<T*,void>{
  class trait_type<parlay::sequence<T>,void> (line 159) | class trait_type<parlay::sequence<T>,void>{
  function load_from_HDF5 (line 165) | inline std::pair<parlay::sequence<typename Conv::type>,uint32_t>
  function load_from_bin (line 193) | inline std::pair<parlay::sequence<typename Conv::type>,uint32_t>
  function load_from_range (line 213) | inline std::pair<parlay::sequence<typename Conv::type>,uint32_t>
  function load_point (line 262) | inline auto load_point(const char *input_name, Conv converter, size_t ma...

FILE: algorithms/bench/IO.h
  function namespace (line 35) | namespace benchIO {

FILE: algorithms/bench/benchUtils.h
  type class (line 45) | enum class
  function ptr_raw (line 65) | ptr_raw(p){
  function T (line 85) | T* get() const{
  function operator (line 89) | operator T*() const{
  type stat (line 173) | struct stat

FILE: algorithms/bench/common/IO.h
  function namespace (line 35) | namespace benchIO {

FILE: algorithms/bench/common/atomics.h
  function namespace (line 3) | namespace pbbs {

FILE: algorithms/bench/common/dataGen.h
  function namespace (line 4) | namespace dataGen {

FILE: algorithms/bench/common/geometry.h
  function vector (line 36) | vector operator*(coord s) {return vector(x * s, y * s, z * s);}
  function vector (line 37) | vector operator/(coord s) {return vector(x / s, y / s, z / s);}
  function print (line 44) | void print() {cout << std::setprecision(10) << ":(" << x << "," << y << ...
  function coord (line 45) | coord Length(void) { return sqrt(x*x+y*y+z*z);}
  function coord (line 46) | coord sqLength(void) { return x*x+y*y+z*z;}
  function dimension (line 57) | int dimension() {return 3;}
  function print (line 62) | void print() {cout << ":(" << x << "," << y << "," << z << "):";}
  function point (line 67) | point minCoords(point b) {
  function point (line 69) | point maxCoords(point b) {
  function point (line 87) | point changeCoords(std::vector<coord> v){
  function outOfBox (line 92) | bool outOfBox(point pt, coord hsize) {
  function vector (line 128) | vector operator*(coord s) {return vector(x * s, y * s);}
  function vector (line 129) | vector operator/(coord s) {return vector(x / s, y / s);}
  function coord (line 130) | coord operator[] (int i) {return (i==0) ? x : y;}
  function coord (line 131) | coord dot(vector v) {return x * v.x + y * v.y;}
  function coord (line 132) | coord cross(vector v) { return x*v.y - y*v.x; }
  function coord (line 133) | coord maxDim() {return max(x,y);}
  function print (line 134) | void print() {cout << ":(" << x << "," << y << "):";}
  function coord (line 135) | coord Length(void) { return sqrt(x*x+y*y);}
  function coord (line 136) | coord sqLength(void) { return x*x+y*y;}
  function dimension (line 156) | int dimension() {return 2;}
  function print (line 161) | void print() {cout << ":(" << x << "," << y << "):";}
  function coord (line 164) | coord operator[] (int i) {return (i==0) ? x : y;}
  function point (line 165) | point minCoords(point b) { return point(min(x,b.x),min(y,b.y)); }
  function point (line 166) | point maxCoords(point b) { return point(max(x,b.x),max(y,b.y)); }
  function quadrant (line 167) | int quadrant(point center) {
  function point (line 175) | point offsetPoint(int dir, coord offset) {
  function outOfBox (line 180) | bool outOfBox(point pt, coord hsize) {
  function numPoints (line 259) | size_t numPoints() {return P.size();}
  function numTriangles (line 260) | size_t numTriangles() {return T.size();}
  function coord (line 278) | inline coord angle(point2d<coord> a, point2d<coord> b, point2d<coord> c) {

FILE: algorithms/bench/common/geometryIO.h
  function namespace (line 75) | namespace benchIO {

FILE: algorithms/bench/common/get_time.h
  function get_time (line 9) | struct timer {
  function start (line 27) | void start () {
  function stop (line 32) | double stop () {
  function reset (line 39) | void reset() {
  function get_total (line 44) | double get_total() {
  function get_next (line 49) | double get_next() {
  function report (line 58) | void report(double time, std::string str) {
  function total (line 69) | void total() {
  function reportTotal (line 74) | void reportTotal(std::string str) {
  function next (line 78) | void next(std::string str) {

FILE: algorithms/bench/common/glue.h
  function namespace (line 11) | namespace utils {
  function namespace (line 96) | namespace dataGen {

FILE: algorithms/bench/common/graph.h
  function addDegrees (line 130) | void addDegrees() {
  function MVT (line 135) | MVT operator[] (const size_t i) {
  function VT (line 140) | const VT operator[] (const size_t i) const {
  function VT (line 184) | VT operator[] (const size_t i) {
  function FlowGraph (line 206) | FlowGraph copy() {
  function del (line 209) | void del() { g.del(); }

FILE: algorithms/bench/common/graphIO.h
  function namespace (line 69) | namespace benchIO {

FILE: algorithms/bench/common/graphUtils.h
  function E (line 43) | auto E = parlay::tabulate(m, [&] (size_t i) -> WE {

FILE: algorithms/bench/common/ligraLight.h
  function namespace (line 32) | namespace ligra {

FILE: algorithms/bench/common/parse_command_line.h
  type commandLine (line 30) | struct commandLine {

FILE: algorithms/bench/common/runTests.py
  function onPprocessors (line 6) | def onPprocessors(command,p) :
  function shellGetOutput (line 15) | def shellGetOutput(str) :
  function stripFloat (line 24) | def stripFloat(val) :
  function runSingle (line 28) | def runSingle(runProgram, options, ifile, procs) :
  function geomean (line 40) | def geomean(a) :
  function runTest (line 46) | def runTest(runProgram, checkProgram, dataDir, test, rounds, procs, noOu...
  function averageTime (line 81) | def averageTime(times) :
  function timeAll (line 84) | def timeAll(name, runProgram, checkProgram, dataDir, tests, rounds, proc...
  function getOption (line 112) | def getOption(str) :
  function getArg (line 120) | def getArg(str, default) :
  function getArgs (line 128) | def getArgs() :
  function timeAllArgs (line 136) | def timeAllArgs(runProgram, problem, checkProgram, dataDir, tests, keepI...
  function dbInitConnection (line 149) | def dbInitConnection():
  function dbAddResult (line 163) | def dbAddResult(problem, program, results, numProcs, mean, min, median, ...
  function computeContentHash (line 196) | def computeContentHash(tests):
  function dbGetProblemId (line 206) | def dbGetProblemId(probname, contentHash):
  function dbGetProgramId (line 216) | def dbGetProgramId(progname, problemId):
  function getHostId (line 227) | def getHostId():
  function detectCPUModel (line 246) | def detectCPUModel():
  function detectCPUs (line 263) | def detectCPUs():

FILE: algorithms/bench/common/runTestsANN.py
  function addLineToFile (line 6) | def addLineToFile(oFile, line):
  function onPprocessors (line 17) | def onPprocessors(command,p) :
  function shellGetOutput (line 26) | def shellGetOutput(str) :
  function stripFloat (line 35) | def stripFloat(val) :
  function runSingle (line 39) | def runSingle(runProgram, options, ifile, procs, oFile) :
  function runTest (line 53) | def runTest(runProgram, checkProgram, dataDir, test, rounds, procs, noOu...
  function averageTime (line 99) | def averageTime(times) :
  function timeAll (line 103) | def timeAll(name, runProgram, checkProgram, dataDir, tests, rounds, proc...
  function getOption (line 139) | def getOption(str) :
  function getArg (line 147) | def getArg(str, default) :
  function getArgs (line 155) | def getArgs() :
  function timeAllArgs (line 161) | def timeAllArgs(runProgram, problem, checkProgram, dataDir, tests, oFile) :

FILE: algorithms/bench/common/sequenceIO.h
  function namespace (line 33) | namespace parlay {
  function namespace (line 37) | namespace benchIO {

FILE: algorithms/bench/common/speculative_for.h
  function namespace (line 28) | namespace pbbs {

FILE: algorithms/bench/common/topology.h
  function setT (line 55) | void setT(tri_t *t1, tri_t *t2, tri_t* t3) {
  function setV (line 57) | void setV(vtx_t *v1, vtx_t *v2, vtx_t *v3) {
  function locate (line 59) | int locate(tri_t *t) {
  function update (line 67) | void update(tri_t *t, tri_t *tn) {
  function print (line 86) | void print() {
  function mod3 (line 95) | inline int mod3(int i) {return (i>2) ? i-3 : i;}
  function print (line 121) | void print() {
  function simplex (line 135) | simplex across() {
  function simplex (line 142) | simplex rotClockwise() { return simplex(t,mod3(o+1));}
  function valid (line 144) | bool valid() {return (!boundary);}
  function isTriangle (line 145) | bool isTriangle() {return (!boundary);}
  function isBoundary (line 146) | bool isBoundary() {return boundary;}
  function vtx_t (line 148) | vtx_t *firstVertex() {return t->vtx[o];}
  function inCirc (line 150) | bool inCirc(vtx_t *v) {
  function farAngle (line 157) | double farAngle() {
  function outside (line 163) | bool outside(vtx_t *v) {
  function flip (line 169) | void flip() {
  function split (line 195) | void split(vtx_t* v, tri_t* ta0, tri_t* ta1) {
  function splitBoundary (line 211) | void splitBoundary(vtx_t* v, tri_t* ta) {
  function simplex (line 228) | simplex extend(vtx_t* v, tri_t* ta) {

FILE: algorithms/bench/common/topology_from_triangles.h
  function getKey (line 51) | struct hashEdges {
  function hash (line 56) | size_t hash(kType s) { return hash64(s.first)+3*(hash64(s.second)); }
  function cmp (line 57) | int cmp(kType s1, kType s2) {
  function cas (line 63) | bool cas(eType* p, eType o, eType n) {
  function replaceQ (line 66) | bool replaceQ(eType s, eType s2) {return 0;}
  function EdgeTable (line 71) | EdgeTable makeEdgeTable(size_t m) {

FILE: algorithms/bench/get_time.h
  function namespace (line 9) | namespace cpam {

FILE: algorithms/bench/parse_command_line.h
  type commandLine (line 30) | struct commandLine {

FILE: algorithms/pyNNDescent/clusterPynn.h
  function namespace (line 39) | namespace parlayANN {

FILE: algorithms/pyNNDescent/neighbors.h
  function namespace (line 35) | namespace parlayANN {

FILE: algorithms/pyNNDescent/pynn_index.h
  function namespace (line 34) | namespace parlayANN {
  function undirect_and_prune (line 198) | void undirect_and_prune(GraphI &G, PR &Points, double alpha){

FILE: algorithms/utils/NSGDist.h
  type Metric (line 23) | enum Metric { L2 = 0, INNER_PRODUCT = 1, FAST_L2 = 2, PQ = 3 }
  function class (line 24) | class Distance {
  function compare (line 335) | float compare(const float *a, const float *b, float norm,

FILE: algorithms/utils/beamSearch.h
  function namespace (line 21) | namespace parlayANN {
  type EStop (line 411) | struct EStop {
  function indices (line 468) | auto indices = parlay::tabulate(Query_Points.size(), [&](size_t i) {

FILE: algorithms/utils/check_nn_recall.h
  function namespace (line 15) | namespace parlayANN {

FILE: algorithms/utils/check_range_recall.h
  function namespace (line 14) | namespace parlayANN {

FILE: algorithms/utils/csvfile.h
  function namespace (line 31) | namespace parlayANN {

FILE: algorithms/utils/doublingSearch.h
  function namespace (line 19) | namespace parlayANN{

FILE: algorithms/utils/earlyStopping.h
  function namespace (line 18) | namespace parlayANN{

FILE: algorithms/utils/euclidian_point.h
  function namespace (line 43) | namespace parlayANN {
  function const (line 272) | int8_t operator [] (long j) const {
  function distance (line 276) | float distance(const Euclidean_JL_Sparse_Point &q) const {
  function prefetch (line 282) | void prefetch() const {
  function normalize (line 302) | void normalize() {
  type Euclidean_Bit_Point (line 338) | struct Euclidean_Bit_Point {
  function const (line 356) | int8_t operator [] (long j) const {
  function distance (line 361) | float distance(const Euclidean_Bit_Point &q) const {
  function prefetch (line 371) | void prefetch() const {
  function normalize (line 395) | void normalize() {

FILE: algorithms/utils/graph.h
  function namespace (line 43) | namespace parlayANN {

FILE: algorithms/utils/graph_reorder.h
  type tagged_w_type (line 21) | struct tagged_w_type {w_type w; edge_id i;}
  function greater (line 22) | bool greater(tagged_w_type a, tagged_w_type b) {
  type vertex_info (line 24) | struct vertex_info {
  function recursive_reorder (line 41) | void recursive_reorder(parlay::sequence<w_edge>& E,

FILE: algorithms/utils/hashset.h
  function hash (line 19) | size_t hash(K const& k) const noexcept {

FILE: algorithms/utils/jl_point.h
  function namespace (line 19) | namespace parlayANN {
  type parameters (line 113) | struct parameters {
  function const (line 128) | int8_t operator [] (long j) const {
  function distance (line 132) | float distance(const Mips_JL_Bit_Point &q) const {
  function prefetch (line 138) | void prefetch() const {
  function normalize (line 158) | void normalize() {
  type parameters (line 199) | struct parameters {
  function const (line 217) | int8_t operator [] (long j) const {
  function distance (line 221) | float distance(const Mips_JL_Sparse_Point &q) const {
  function prefetch (line 227) | void prefetch() const {
  function normalize (line 247) | void normalize() {
  type parameters (line 292) | struct parameters {
  function const (line 310) | int8_t operator [] (long j) const {
  function distance (line 314) | float distance(const Mips_JL_Sparse_Point_Normalized &q) const {
  function prefetch (line 322) | void prefetch() const {
  function normalize (line 342) | void normalize() {

FILE: algorithms/utils/mips_point.h
  function namespace (line 42) | namespace parlayANN {
  type Mips_2Bit_Point (line 510) | struct Mips_2Bit_Point {
  type parameters (line 527) | struct parameters {
  function const (line 541) | int operator [] (long i) const {
  function distance_8 (line 545) | float distance_8(byte* p_, byte* q_) const {
  function distance (line 560) | float distance(const Mips_2Bit_Point &x) const {
  function prefetch (line 564) | void prefetch() const {
  function normalize (line 589) | void normalize() {
  type Mips_Bit_Point (line 640) | struct Mips_Bit_Point {
  function const (line 657) | int8_t operator [] (long j) const {
  function distance (line 662) | float distance(const Mips_Bit_Point &q) const {
  function prefetch (line 672) | void prefetch() const {
  function normalize (line 696) | void normalize() {
  type Mips_4Bit_Point (line 721) | struct Mips_4Bit_Point {
  type parameters (line 736) | struct parameters {
  function const (line 750) | int operator [] (long i) const {
  function triple (line 754) | static int16_t triple(word a, word b, word plus, word minus) {
  function distance (line 759) | float distance(byte* p_, byte* q_) const {
  function distance (line 784) | float distance(const Mips_4Bit_Point &x) const {
  function prefetch (line 788) | void prefetch() const {
  function normalize (line 813) | void normalize() {

FILE: algorithms/utils/mmap.h
  function namespace (line 11) | namespace parlayANN {

FILE: algorithms/utils/parse_results.h
  function namespace (line 10) | namespace parlayANN {
  function print (line 48) | struct range_result {
  function print (line 102) | struct nn_result {
  function print_verbose (line 146) | void print_verbose() {
  function print (line 158) | struct lsh_result {
  function pred (line 195) | auto pred = [&](res R) { return R.recall >= b; }
  function pred2 (line 202) | auto pred2 = [&](res R) { return R.recall <= c; }

FILE: algorithms/utils/point_range.h
  function namespace (line 40) | namespace parlayANN {

FILE: algorithms/utils/simpleGraph.h
  function indexType (line 55) | indexType operator [] (indexType j) const {
  function append_neighbor (line 62) | void append_neighbor(indexType nbh){
  function clear_neighbors (line 79) | void clear_neighbors(){
  function prefetch (line 83) | void prefetch() const {
  function indexType (line 93) | indexType* begin() const {return (*edges).data();}
  function indexType (line 95) | indexType* end() const {return (*edges).data() + size();}
  function save (line 122) | void save(char* oFile) {

FILE: algorithms/utils/stats.h
  function namespace (line 39) | namespace parlayANN {
  function GG (line 56) | auto GG = parlay::tabulate(n, [&] (indexType i) {
  function increment_dist (line 133) | void increment_dist(indexType i, indexType j){
  function increment_visited (line 135) | void increment_visited(indexType i, indexType j){
  function clear (line 141) | void clear(){
  function parlay (line 147) | static parlay::sequence<indexType> statistics(parlay::sequence<indexType...

FILE: algorithms/utils/types.h
  function namespace (line 36) | namespace parlayANN {
  function max_degree (line 225) | long max_degree(){
  type QueryParams (line 233) | struct QueryParams{
  type Point (line 274) | typedef Point type_point;

FILE: algorithms/utils/union.h
  function namespace (line 8) | namespace parlayANN {

FILE: algorithms/vamana/index.h
  function namespace (line 40) | namespace parlayANN {

FILE: algorithms/vamana/index_test.cc
  function TEST (line 5) | TEST(PlaceHolderTest, BuildPlaceHolder) { EXPECT_EQ(7 * 6, 42); }

FILE: algorithms/vamana/neighbors.h
  function namespace (line 39) | namespace parlayANN {

FILE: algorithms/vamana/neighbors_test.cc
  function TEST (line 5) | TEST(PlaceHolderTest, BuildPlaceHolder) { EXPECT_EQ(7 * 6, 42); }

FILE: algorithms/vamanaRange/index.h
  function BP (line 54) | BP(BP) {}
  function indexType (line 56) | indexType get_start() { return start_point; }
  function new_end (line 82) | auto new_end =std::unique(candidates.begin(), candidates.end(),
  function set_start (line 144) | void set_start(){start_point = 0;}

FILE: data_tools/compute_groundtruth.cpp
  function compute_groundtruth (line 23) | parlay::sequence<parlay::sequence<pid>> compute_groundtruth(PointRange &B,
  function write_ibin (line 64) | void write_ibin(parlay::sequence<parlay::sequence<pid>> &result, const s...
  function main (line 102) | int main(int argc, char* argv[]) {

FILE: data_tools/compute_range_groundtruth.cpp
  function compute_range_groundtruth (line 15) | parlay::sequence<parlay::sequence<int>> compute_range_groundtruth(PointR...
  function write_nonzero_elts (line 33) | void write_nonzero_elts(parlay::sequence<parlay::sequence<int>> &result,...
  function write_rangeres (line 65) | void write_rangeres(parlay::sequence<parlay::sequence<int>> &result, con...
  function main (line 92) | int main(int argc, char* argv[]) {

FILE: data_tools/crop.cpp
  function mmapStringFromFile (line 18) | std::pair<char*, size_t> mmapStringFromFile(const char* filename) {
  function crop_file (line 48) | void crop_file(char* iFile, int n, char* oFile){
  function main (line 68) | int main(int argc, char* argv[]) {

FILE: data_tools/random_sample.cpp
  function random_sample (line 14) | void random_sample(char* iFile, int n, char* oFile){
  function main (line 48) | int main(int argc, char* argv[]) {

FILE: data_tools/vec_to_bin.cpp
  function convert_onebyte (line 10) | auto convert_onebyte(const char* infile, const char* outfile) {
  function convert_fourbyte (line 24) | auto convert_fourbyte(const char* infile, const char* outfile) {
  function main (line 38) | int main(int argc, char* argv[]) {

FILE: python/__init__.py
  class QueryResponse (line 82) | class QueryResponse(NamedTuple):
  class QueryResponseBatch (line 96) | class QueryResponseBatch(NamedTuple):

FILE: python/_builder.py
  function _valid_path_and_dtype (line 45) | def _valid_path_and_dtype(
  function build_memory_index (line 71) | def build_memory_index(

FILE: python/_builder.pyi
  function numpy_to_diskann_file (line 29) | def numpy_to_diskann_file(vectors: np.ndarray, file_handler: BinaryIO): ...
  function build_vamana_index (line 30) | def build_vamana_index(
  function build_hcnng_index (line 41) | def build_hcnng_index(
  function build_pynndescent_index (line 51) | def build_pynndescent_index(

FILE: python/_common.py
  function valid_dtype (line 45) | def valid_dtype(dtype: Type) -> VectorDType:
  function _assert (line 59) | def _assert(statement_eval: bool, message: str):
  function _valid_metric (line 64) | def _valid_metric(metric: str) -> str:
  function _assert_dtype (line 75) | def _assert_dtype(dtype: Type):
  function _castable_dtype_or_raise (line 82) | def _castable_dtype_or_raise(
  function _assert_2d (line 93) | def _assert_2d(vectors: np.ndarray, name: str):
  function _assert_is_positive_uint32 (line 100) | def _assert_is_positive_uint32(test_value: int, parameter: str):
  function _assert_is_nonnegative_uint32 (line 107) | def _assert_is_nonnegative_uint32(test_value: int, parameter: str):
  function _assert_is_nonnegative_uint64 (line 114) | def _assert_is_nonnegative_uint64(test_value: int, parameter: str):
  function _assert_existing_directory (line 121) | def _assert_existing_directory(path: str, parameter: str):
  function _assert_existing_file (line 128) | def _assert_existing_file(path: str, parameter: str):
  class _DataType (line 133) | class _DataType(Enum):
    method from_type (line 139) | def from_type(cls, vector_dtype: VectorDType) -> "DataType":
    method to_type (line 147) | def to_type(self) -> VectorDType:
  function _build_metadata_path (line 159) | def _build_metadata_path(index_path_and_prefix: str) -> str:
  function _write_index_metadata (line 163) | def _write_index_metadata(
  function _read_index_metadata (line 181) | def _read_index_metadata(
  function _ensure_index_metadata (line 197) | def _ensure_index_metadata(
  function _valid_index_prefix (line 231) | def _valid_index_prefix(index_directory: str, index_prefix: str) -> str:

FILE: python/_files.py
  class Metadata (line 33) | class Metadata(NamedTuple):
  function vectors_metadata_from_file (line 42) | def vectors_metadata_from_file(vector_file: str) -> Metadata:
  function _write_bin (line 56) | def _write_bin(data: np.ndarray, file_handler: BinaryIO):
  function vectors_to_file (line 64) | def vectors_to_file(vector_file: str, vectors: VectorLikeBatch) -> None:
  function vectors_from_file (line 78) | def vectors_from_file(vector_file: str, dtype: VectorDType) -> npt.NDArr...

FILE: python/builder.cpp
  function build_vamana_index (line 37) | void build_vamana_index(std::string metric, std::string &vector_bin_path,
  function build_hcnng_index (line 119) | void build_hcnng_index(std::string metric, std::string &vector_bin_path,
  function build_pynndescent_index (line 163) | void build_pynndescent_index(std::string metric, std::string &vector_bin...
  function build_hnsw_index (line 207) | void build_hnsw_index(std::string metric, std::string &vector_bin_path,

FILE: python/graph_index.cpp
  type GraphIndex (line 49) | struct GraphIndex{
    method GraphIndex (line 82) | GraphIndex(std::string &data_path, std::string &index_path, bool is_hn...
    method search_dispatch (line 120) | auto search_dispatch(Point &q, QueryParams &QP, bool quant)
    method NeighborsAndDistances (line 192) | NeighborsAndDistances batch_search(py::array_t<T, py::array::c_style |...
    method single_search (line 218) | py::array_t<unsigned int>
    method NeighborsAndDistances (line 237) | NeighborsAndDistances batch_search_from_string(std::string &queries,
    method check_recall (line 259) | void check_recall(std::string &queries_file,

FILE: python/module.cpp
  type Variant (line 44) | struct Variant
  function add_variant (line 59) | inline void add_variant(py::module_ &m, const Variant &variant)
  function add_hcnng_variant (line 87) | inline void add_hcnng_variant(py::module_ &m, const Variant &variant)
  function add_pynndescent_variant (line 105) | inline void add_pynndescent_variant(py::module_ &m, const Variant &variant)
  function add_hnsw_variant (line 124) | inline void add_hnsw_variant(py::module_ &m, const Variant &variant)
  function PYBIND11_MODULE (line 132) | PYBIND11_MODULE(_ParlayANNpy, m)

FILE: python/wrapper.py
  function build_vamana_index (line 3) | def build_vamana_index(metric, dtype, data_dir, index_dir, R, L, alpha, ...
  function build_hcnng_index (line 27) | def build_hcnng_index(metric, dtype, data_dir, index_dir, mst_deg, num_c...
  function build_pynndescent_index (line 50) | def build_pynndescent_index(metric, dtype, data_dir, index_dir, max_deg,...
  function build_hnsw_index (line 73) | def build_hnsw_index(metric, dtype, data_dir, index_dir, R, efc, m_l, al...
  function load_index (line 96) | def load_index(metric, dtype, data_dir, index_dir, hnsw=False):

FILE: rangeSearch/bench/IO.h
  function namespace (line 35) | namespace benchIO {

FILE: rangeSearch/bench/get_time.h
  function namespace (line 9) | namespace cpam {

FILE: rangeSearch/bench/rangeTime.C
  function main (line 61) | int main(int argc, char* argv[]) {

FILE: rangeSearch/vamanaRange/range.h
  function namespace (line 40) | namespace parlayANN{