SYMBOL INDEX (163 symbols across 15 files)

FILE: algorithm/base_index.hpp
  type efanna (line 20) | namespace efanna{
    type Point (line 24) | struct Point {
      method Point (line 28) | Point () {}
      method Point (line 29) | Point (unsigned i, float d, bool f = true): id(i), dist(d), flag(f) {
    function InsertIntoKnn (line 37) | static inline unsigned InsertIntoKnn (Point *addr, unsigned K, Point n...
    type Neighbor (line 63) | struct Neighbor {
      method Neighbor (line 76) | Neighbor() : lock(std::make_shared<Lock>())
      method insert (line 80) | unsigned insert (unsigned id, float dist) {
      method join (line 96) | void join (C callback) const {
    class InitIndex (line 112) | class InitIndex{
      method InitIndex (line 114) | InitIndex(const Matrix<DataType>& features, const Distance<DataType>...
      method buildTrees (line 121) | virtual void buildTrees(){}
      method buildIndex (line 123) | virtual void buildIndex()
      method saveResults (line 136) | void saveResults(char* filename){
      method setSearchParams (line 153) | void setSearchParams(int epochs, int init_num, int extend_to,int sea...
      method nnExpansion_kgraph (line 165) | void nnExpansion_kgraph(size_t K, const DataType* qNow, std::vector<...
      method nnExpansion (line 243) | void nnExpansion(size_t K, const DataType* qNow, std::vector<unsigne...
      method knnSearch (line 311) | virtual void knnSearch(int K, const Matrix<DataType>& query){
      method join (line 328) | void join(){
      method update (line 373) | void update (int paramL) {
      method refineGraph (line 438) | void refineGraph(){
      method calculate_norm (line 483) | void calculate_norm(){
      method getGraphSize (line 494) | size_t getGraphSize(){return gs.size();}
      method getGraphRow (line 495) | std::vector<unsigned> getGraphRow(unsigned row_id){

FILE: algorithm/hashing_index.hpp
  type efanna (line 18) | namespace efanna{
    type HASHINGIndexParams (line 19) | struct HASHINGIndexParams : public IndexParams
      method HASHINGIndexParams (line 21) | HASHINGIndexParams(int codelen, int TableNum,int UpperBits, int Hash...
    class HASHINGIndex (line 49) | class HASHINGIndex : public InitIndex<DataType>
      method HASHINGIndex (line 64) | HASHINGIndex(const Matrix<DataType>& dataset, const Distance<DataTyp...
      method LoadCode32 (line 206) | void LoadCode32(char* filename, std::vector<Codes>& baseAll){
      method LoadCode64 (line 264) | void LoadCode64(char* filename, std::vector<Codes64>& baseAll){
      method BuildHashTable32 (line 323) | void BuildHashTable32(int upbits, int lowbits, std::vector<Codes>& b...
      method generateMask32 (line 349) | void generateMask32(){
      method BuildHashTable64 (line 629) | void BuildHashTable64(int upbits, int lowbits, std::vector<Codes64>&...
      method generateMask64 (line 657) | void generateMask64(){
      method buildIndexImpl (line 874) | void buildIndexImpl()
      method getNeighbors (line 891) | void getNeighbors(size_t K, const Matrix<DataType>& query){
      method getNeighbors32 (line 929) | void getNeighbors32(size_t K, const Matrix<DataType>& query){
      method getNeighbors64 (line 1007) | void getNeighbors64(size_t K, const Matrix<DataType>& query){
      method getNeighborsIEH32_nnexp (line 1087) | void getNeighborsIEH32_nnexp(size_t K, const Matrix<DataType>& query){
      method getNeighborsIEH32_kgraph (line 1204) | void getNeighborsIEH32_kgraph(size_t K, const Matrix<DataType>& query){
      method getNeighborsIEH64_nnexp (line 1354) | void getNeighborsIEH64_nnexp(size_t K, const Matrix<DataType>& query){
      method getNeighborsIEH64_kgraph (line 1471) | void getNeighborsIEH64_kgraph(size_t K, const Matrix<DataType>& query){
      method outputVisitBucketNum (line 1621) | void outputVisitBucketNum(){
      method loadIndex (line 1631) | void loadIndex(char* filename){}
      method saveIndex (line 1632) | void saveIndex(char* filename){}
      method loadTrees (line 1633) | void loadTrees(char* filename){}
      method saveTrees (line 1634) | void saveTrees(char* filename){}
      method loadGraph (line 1635) | void loadGraph(char* filename){
      method saveGraph (line 1659) | void saveGraph(char* filename){}
      method initGraph (line 1660) | void initGraph(){}

FILE: algorithm/init_indices.hpp
  type efanna (line 6) | namespace efanna{

FILE: algorithm/kdtreeub_index.hpp
  type efanna (line 13) | namespace efanna{
    type KDTreeUbIndexParams (line 14) | struct KDTreeUbIndexParams : public IndexParams
      method KDTreeUbIndexParams (line 16) | KDTreeUbIndexParams(bool rnn_used, int tree_num_total, int merge_lev...
    class KDTreeUbIndex (line 37) | class KDTreeUbIndex : public InitIndex<DataType>
      method KDTreeUbIndex (line 42) | KDTreeUbIndex(const Matrix<DataType>& dataset, const Distance<DataTy...
      method buildIndexImpl (line 92) | void buildIndexImpl(){
      type Node (line 114) | struct Node
      method loadIndex (line 129) | void loadIndex(char* filename){
      method saveIndex (line 132) | void saveIndex(char* filename){
      method loadTrees (line 139) | void loadTrees(char* filename){
      method saveTrees (line 197) | void saveTrees(char* filename){
      method loadGraph (line 243) | void loadGraph(char* filename){
      method saveGraph (line 295) | void saveGraph(char* filename){
      method SearchQueryToLeaf (line 315) | void SearchQueryToLeaf(Node* node, const DataType* q, unsigned dep, ...
      method getSearchNodeList (line 332) | void getSearchNodeList(Node* node, const DataType* q, unsigned int l...
      method getNeighbors (line 349) | void getNeighbors(size_t searchK, const Matrix<DataType>& query){
      method getNeighbors_nnexp (line 363) | void getNeighbors_nnexp(size_t K, const Matrix<DataType>& query){
      method getNeighbors_kgraph (line 496) | void getNeighbors_kgraph(size_t searchK, const Matrix<DataType>& que...
      method DepthFirstWrite (line 658) | int DepthFirstWrite(std::fstream& out, struct Node *root){
      type Node (line 672) | struct Node
      type Node (line 672) | struct Node
      type Node (line 674) | struct Node
      method read_data (line 701) | void read_data(char *filename){
      method save_data (line 771) | void save_data(char *filename, unsigned int K, size_t num, size_t dim){
      method meanSplit (line 902) | void meanSplit(std::mt19937& rng, unsigned* indices, unsigned count,...
      method planeSplit (line 954) | void planeSplit(unsigned* indices, unsigned count, unsigned cutdim, ...
      method selectDivision (line 974) | int selectDivision(std::mt19937& rng, DataType* v){
      method getMergeLevelNodeList (line 1000) | void getMergeLevelNodeList(Node* node, size_t treeid, int deepth){
      method Node (line 1012) | Node* SearchToLeaf(Node* node, size_t id){
      method mergeSubGraphs (line 1022) | void mergeSubGraphs(size_t treeid, Node* node){
      method USING_BASECLASS_SYMBOLS (line 1117) | USING_BASECLASS_SYMBOLS
      method DFSbuild (line 1138) | void DFSbuild(Node* node, std::mt19937& rng, unsigned* indices, unsi...
      method DFStest (line 1169) | void DFStest(unsigned level, unsigned dim, Node* node){
      method buildTrees (line 1192) | void buildTrees(){
      method outputVisitBucketNum (line 1277) | void outputVisitBucketNum(){}
      method initGraph (line 1279) | void initGraph(){

FILE: efanna.hpp
  type efanna (line 8) | namespace efanna{
    class FIndex (line 10) | class FIndex{
      method FIndex (line 14) | FIndex(const Matrix<DataType>& features, Distance<DataType>* d, cons...
      method buildIndex (line 24) | void buildIndex()
      method buildTrees (line 28) | void buildTrees()
      method knnSearch (line 32) | void knnSearch(int k, const Matrix<DataType>& query){
      method saveIndex (line 35) | void saveIndex(char* filename){
      method loadIndex (line 38) | void loadIndex(char* filename){
      method saveTrees (line 41) | void saveTrees(char* filename){
      method loadTrees (line 44) | void loadTrees(char* filename){
      method saveGraph (line 47) | void saveGraph(char* filename){
      method loadGraph (line 50) | void loadGraph(char* filename){
      method saveResults (line 53) | void saveResults(char* filename){
      method setSearchParams (line 56) | void setSearchParams(int epochs, int init_num, int extend_to, int se...
      method getGraphSize (line 59) | size_t getGraphSize(){
      method getGraphRow (line 62) | std::vector<unsigned> getGraphRow(unsigned row_id){
      method outputVisitBucketNum (line 65) | void outputVisitBucketNum(){

FILE: general/distance.hpp
  type Candidate (line 27) | struct Candidate {
    method Candidate (line 30) | Candidate(const size_t row_id, const T distance): row_id(row_id), dist...
  class Distance (line 47) | class Distance {
  function ResultType (line 71) | ResultType compare(const T* a, const T* b, size_t size) const {
  class L2Distance (line 118) | class L2Distance: public Distance<T> {
    method ResultType (line 125) | ResultType compare(const T* a, const T* b, size_t size) const {
    method T (line 148) | T norm(const T* a, size_t length) const
    method T (line 152) | T dot(const T* a, const T* b, size_t length) const
  function T (line 258) | T dot(const T* a, const T* b, size_t size) const
  function T (line 328) | T norm(const T* a, size_t size) const

FILE: general/matrix.hpp
  type efanna (line 10) | namespace efanna {
    class Matrix (line 13) | class Matrix {
      method Matrix (line 21) | Matrix(const size_t rows, const size_t cols, const void* data):
      method get_cols (line 41) | size_t get_cols() const {
      method get_rows (line 45) | size_t get_rows() const {
      method T (line 49) | const T* get_row(const size_t index) const {
      method brute_force_search (line 57) | std::vector<std::pair<T, size_t> > brute_force_search(size_t idx, si...

FILE: general/params.hpp
  type efanna (line 6) | namespace efanna {
    type init_algorithm (line 7) | enum init_algorithm {
    type IndexParams (line 19) | struct IndexParams{
    type SearchParams (line 35) | struct SearchParams{

FILE: matlab/findex.cc
  function copy_matrix (line 14) | Matrix<T> copy_matrix(const mxArray *array)
  type construct_func (line 25) | struct construct_func {
  function _construct (line 62) | void _construct(int out_n, mxArray* out_array[], int in_n, const mxArray...
  function _destruct (line 98) | void _destruct(int out_n, mxArray* out_array[], int in_n, const mxArray ...
  function _get_graph_mat (line 106) | void _get_graph_mat(int out_n, mxArray* out_array[], int in_n, const mxA...
  function _build_index (line 153) | void _build_index(int out_n, mxArray* out_array[], int in_n, const mxArr...
  function _build_trees (line 164) | void _build_trees(int out_n, mxArray* out_array[], int in_n, const mxArr...
  function _load_index (line 174) | void _load_index(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _save_index (line 185) | void _save_index(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _load_graph (line 196) | void _load_graph(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _save_graph (line 208) | void _save_graph(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _load_trees (line 219) | void _load_trees(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _save_trees (line 230) | void _save_trees(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _set_search_params_kdtreeub (line 241) | void _set_search_params_kdtreeub(FIndex<T>* handle, int in_n, const mxAr...
  function _set_search_params_nndescent (line 251) | void _set_search_params_nndescent(FIndex<T>* handle, int in_n, const mxA...
  function _set_search_params_nnexp (line 256) | void _set_search_params_nnexp(FIndex<T>* handle, int in_n, const mxArray...
  function _set_search_params (line 261) | void _set_search_params(int out_n, mxArray* out_array[], int in_n, const...
  function _knn_search (line 284) | void _knn_search(int out_n, mxArray* out_array[], int in_n, const mxArra...
  function _save_result (line 293) | void _save_result(int out_n, mxArray* out_array[], int in_n, const mxArr...
  type mexfunc (line 304) | struct mexfunc {
  function mexFunction (line 308) | void mexFunction(int out_n, mxArray* out_array[], int in_n, const mxArra...

FILE: matlab/handle_wrapper.hpp
  class handle_wrapper (line 5) | class handle_wrapper
    method handle_wrapper (line 8) | handle_wrapper(base *ptr) : handle(ptr) {}
    method base (line 10) | base *get_handle() {return handle;}
  function mxArray (line 15) | inline mxArray *handle2mat(base *ptr)
  function base (line 30) | inline base *mat2handle(const mxArray *mat)
  function delete_wrapper (line 35) | inline void delete_wrapper(const mxArray *mat)

FILE: samples/efanna_index_buildall.cc
  function load_data (line 9) | void load_data(char* filename, float*& data, size_t& num,int& dim){// lo...
  function main (line 29) | int main(int argc, char** argv){

FILE: samples/efanna_index_buildgraph.cc
  function load_data (line 10) | void load_data(char* filename, float*& data, size_t& num,int& dim){// lo...
  function main (line 30) | int main(int argc, char** argv){

FILE: samples/efanna_index_buildtrees.cc
  function load_data (line 9) | void load_data(char* filename, float*& data, size_t& num,int& dim){// lo...
  function main (line 29) | int main(int argc, char** argv){

FILE: samples/efanna_search.cc
  function load_data (line 11) | void load_data(char* filename, float*& data, size_t& num,int& dim){// lo...
  function main (line 31) | int main(int argc, char** argv){

FILE: samples/evaluate.cc
  function load_data (line 6) | void load_data(char* filename, int*& data, int& num,int& dim){// load da...
  function main (line 24) | int main(int argc, char** argv){