SYMBOL INDEX (2608 symbols across 439 files)

FILE: algorithms/AGH/src/AGH.cpp
  function diff_timeval (line 42) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 46) | int main(int argc, char * argv[]) {

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

FILE: algorithms/AGH/src/center_chooser.h
  function class (line 4) | class CenterChooser

FILE: algorithms/AGH/src/data_util.h
  function transpose (line 21) | void transpose(vector<vector<float> > X,vector<vector<float> >* Y)
  function ReadPoints (line 38) | void ReadPoints(char* filepath,vector<vector<float> >* points, int* len,...
  function ReadPoints (line 63) | void ReadPoints(const string& filename, vector<vector<float> >* points, ...
  function ReadGroundtruth (line 92) | void ReadGroundtruth(char* filepath, vector<vector<int> >* gnds, int* le...
  function ReadGroundtruth (line 116) | void ReadGroundtruth(const string& filename, vector<vector<int> >* gnds,...
  function ReadB1 (line 139) | void ReadB1(const string& filename, vector<vector<unsigned> >* B1,int n)...
  function ReadChecks (line 162) | void ReadChecks(const string& filename, vector<int>* checks) {

FILE: algorithms/AGH/src/dynamic_bitset.h
  function class (line 3) | class DynamicBitset
  function clear (line 17) | void clear()
  function reset (line 22) | void reset()
  function resize (line 28) | void resize(size_t size)
  function set (line 38) | void set(size_t index)
  function test (line 47) | bool test(size_t index) const

FILE: algorithms/AGH/src/eval.h
  function compute_recall (line 22) | float compute_recall(vector<vector<int> >* gnds, vector<vector<int> >* r...
  function compute_mean_reciprocal_rank (line 39) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 60) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<in...
  function compute_relative_distance_error (line 84) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 108) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 136) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...
  function compute_recall (line 162) | float compute_recall(vector<vector<int> >* gnds, vector<vector<E_Neighbo...
  function compute_mean_reciprocal_rank (line 180) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 201) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<E_...
  function compute_relative_distance_error (line 225) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 251) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 279) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...

FILE: algorithms/AGH/src/hammingDist.h
  type B_Neighbor (line 22) | struct B_Neighbor{
  type E_Neighbor (line 33) | struct E_Neighbor{
  function get_distance (line 43) | float get_distance(vector<float> point, vector<float> query)
  function hammingDist (line 54) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function UpdatePriorityList_Binary (line 76) | void UpdatePriorityList_Binary (B_Neighbor *BList, B_Neighbor tmp, int l...
  function hammingDist (line 96) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function hammingDist_ByRange (line 130) | void hammingDist_ByRange(vector<vector<unsigned> >* B2,vector<vector<uns...
  function UpdatePriorityList_Euclidean (line 154) | void UpdatePriorityList_Euclidean (E_Neighbor *BList, E_Neighbor tmp, in...

FILE: algorithms/AGH/src/heap.h
  function size (line 42) | int size()
  function empty (line 52) | bool empty()
  function clear (line 60) | void clear()
  type CompareT (line 66) | struct CompareT
  function const (line 68) | bool operator()(const T& t_1, const T& t_2) const
  function insert (line 83) | void insert(const T& value)
  function popMin (line 105) | bool popMin(T& value)
  type Interval (line 125) | struct Interval
  function size (line 155) | size_t size()
  function empty (line 164) | bool empty()
  function clear (line 172) | void clear()
  function insert (line 177) | void insert(const T& value)
  function popMin (line 251) | bool popMin(T& value)
  function popMax (line 296) | bool popMax(T& value)
  function getMin (line 336) | bool getMin(T& value)
  function getMax (line 346) | bool getMax(T& value)
  function size (line 371) | int size()
  function empty (line 380) | bool empty()
  function clear (line 388) | void clear()
  function insert (line 393) | void insert(const T& value)
  function popMin (line 404) | bool popMin(T& value)

FILE: algorithms/AGH/src/hierarchical_clustering_index.h
  function class (line 23) | class HierarchicalClusteringIndex
  type Node (line 126) | typedef Node* NodePtr;
  type BranchStruct (line 127) | struct BranchStruct
  function get_distance (line 143) | int get_distance(int p1, int p2)
  function get_distance (line 156) | int get_distance(const vector<unsigned>* p1, const vector<unsigned>* p2)
  function computeLabels (line 169) | void computeLabels(int* indices, int indices_length,  int* centers, int ...
  function computeClustering (line 184) | void computeClustering(Node* node, int* indices, int indices_length)
  type BranchStruct (line 240) | typedef BranchStruct BranchSt;
  function findNN (line 242) | void findNN(NodePtr node, ResultSet& result, const vector<unsigned>* vec...
  function findNeighborsWithRemoved (line 283) | void findNeighborsWithRemoved(ResultSet& result, const vector<unsigned>*...
  function knnSearch (line 308) | int knnSearch(const vector<vector<unsigned> >& queries, vector< vector<i...

FILE: algorithms/AGH/src/random.h
  function seed_random (line 9) | inline void seed_random(unsigned int seed)
  function class (line 40) | class RandomGenerator
  function class (line 51) | class UniqueRandom
  function init (line 72) | void init(int n)
  function next (line 91) | int next()

FILE: algorithms/AGH/src/result_set.h
  type DistanceIndex (line 9) | struct DistanceIndex
  function class (line 24) | class ResultSet
  function clear (line 44) | void clear()
  function full (line 64) | bool full()
  function addPoint (line 75) | void addPoint(int dist, int index)
  function copy (line 108) | void copy(vector<int>* indices, vector<int>* dists, size_t num_elements)

FILE: algorithms/Annoy/src/annoy.cpp
  type RandRandom (line 67) | struct RandRandom {
    method flip (line 70) | inline int flip() {
    method index (line 74) | inline size_t index(size_t n) {
  function T (line 81) | inline T get_norm(T* v, int f) {
  function normalize (line 89) | inline void normalize(T* v, int f) {
  function two_means (line 96) | inline void two_means(const vector<Node*>& nodes, int f, Random& random,...
  type Angular (line 132) | struct Angular {
    method Node (line 134) | struct ANNOY_NODE_ATTRIBUTE Node {
    method T (line 154) | static inline T distance(const T* x, const T* y, int f) {
    method T (line 169) | static inline T margin(const Node<S, T>* n, const T* y, int f) {
    method side (line 176) | static inline bool side(const Node<S, T>* n, const T* y, int f, Random...
    method create_split (line 184) | static inline void create_split(const vector<Node<S, T>*>& nodes, int ...
    method T (line 192) | static inline T normalized_distance(T distance) {
  type Euclidean (line 200) | struct Euclidean {
    method Node (line 202) | struct ANNOY_NODE_ATTRIBUTE Node {
    method T (line 210) | static inline T distance(const T* x, const T* y, int f) {
    method T (line 217) | static inline T margin(const Node<S, T>* n, const T* y, int f) {
    method side (line 224) | static inline bool side(const Node<S, T>* n, const T* y, int f, Random...
    method create_split (line 232) | static inline void create_split(const vector<Node<S, T>*>& nodes, int ...
    method T (line 244) | static inline T normalized_distance(T distance) {
  class AnnoyIndexInterface (line 250) | class AnnoyIndexInterface {
  class AnnoyIndex (line 267) | class AnnoyIndex : public AnnoyIndexInterface<S, T> {
    method AnnoyIndex (line 294) | AnnoyIndex(int f) : _random() {
    method add_item (line 305) | void add_item(S item, const T* w) {
    method build (line 320) | void build(int q) {
    method save (line 354) | bool save(const char* filename) {
    method reinitialize (line 367) | void reinitialize() {
    method unload (line 377) | void unload() {
    method load (line 391) | bool load(const char* filename) {
    method T (line 420) | T get_distance(S i, S j) {
    method get_nns_by_item (line 426) | void get_nns_by_item(S item, size_t n, size_t search_k, vector<S>* res...
    method get_nns_by_vector (line 431) | void get_nns_by_vector(const T* w, size_t n, size_t search_k, vector<S...
    method S (line 434) | S get_n_items() {
    method verbose (line 437) | void verbose(bool v) {
    method get_item (line 441) | void get_item(S item, T* v) {
    method _allocate_size (line 447) | void _allocate_size(S n) {
    method Node (line 459) | inline Node* _get(S i) {
    method S (line 463) | S _make_tree(const vector<S >& indices) {
    method _get_all_nns (line 534) | void _get_all_nns(const T* v, size_t n, size_t search_k, vector<S>* re...

FILE: algorithms/Annoy/src/data.h
  function namespace (line 24) | namespace kgraph {
  type l2 (line 55) | struct l2 {
  function reset (line 71) | void reset (unsigned r, unsigned c) {
  function data (line 84) | Matrix (unsigned r, unsigned c): data(0) {
  function resize (line 99) | void resize (unsigned r, unsigned c) {
  function T (line 102) | T const *operator [] (unsigned i) const {
  function T (line 105) | T *operator [] (unsigned i) {
  function zero (line 108) | void zero () {
  function load_lshkit (line 129) | void load_lshkit (std::string const &path) {
  function save_lshkit (line 143) | void save_lshkit (std::string const &path) {
  function DATA_TYPE (line 204) | DATA_TYPE const *operator [] (unsigned i) const {
  function virtual (line 226) | virtual float operator () (unsigned i) const {
  function proxy (line 231) | proxy(m) {
  function virtual (line 236) | virtual float operator () (unsigned i, unsigned j) const {
  function virtual (line 240) | virtual float angle (unsigned orign, unsigned pivot, unsigned x) const {...
  function SearchOracle (line 255) | SearchOracle query (DATA_TYPE const *query) const {
  function AverageAccuracy (line 324) | inline void AverageAccuracy(Matrix<float> const &gs, Matrix<float> const...
  function AverageMinDist (line 460) | inline void AverageMinDist (Matrix<float> const &gs, Matrix<float> const...
  function namespace (line 482) | namespace kgraph { namespace metric {
  function namespace (line 490) | namespace kgraph { namespace metric {

FILE: algorithms/Annoy/src/indexer.cpp
  type item (line 17) | struct item{
  function diff_timeval (line 22) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 53) | int main(int argc, char *argv[]){

FILE: algorithms/Annoy/src/kissrandom.h
  function kiss (line 12) | struct Kiss32Random {
  function flip (line 42) | inline int flip() {
  function index (line 46) | inline size_t index(size_t n) {
  function kiss (line 53) | struct Kiss64Random {
  function flip (line 84) | inline int flip() {
  function index (line 88) | inline size_t index(size_t n) {

FILE: algorithms/Annoy/src/searcher.cpp
  type item (line 17) | struct item{
  function diff_timeval (line 22) | float diff_timeval(timeval t1, timeval t2) {
  function P (line 32) | P* load_data(const char* data_path, int* len, int* d)
  function T (line 54) | T get_recall(S * gt, vector<int32_t>* res, S k)
  function T (line 69) | T get_mAP(S * gt, vector<int32_t>* res, S k)
  function main (line 89) | int main(int argc, char *argv[]){

FILE: algorithms/DPG/src/DPG_diverse.cpp
  function main (line 32) | int main(int argc, char *argv[]){

FILE: algorithms/DPG/src/DPG_index.cpp
  function main (line 33) | int main(int argc, char *argv[]) {

FILE: algorithms/DPG/src/DPG_search.cpp
  function main (line 33) | int main(int argc, char *argv[]) {

FILE: algorithms/DPG/src/RandGen.cpp
  function gaussian (line 31) | float gaussian(float mean, float sigma) {
  function uniform (line 56) | float uniform(float _min, float _max) {

FILE: algorithms/DPG/src/kgraph-data.h
  function namespace (line 24) | namespace kgraph {
  type l2 (line 55) | struct l2 {
  function reset (line 71) | void reset (unsigned r, unsigned c) {
  function data (line 84) | Matrix (unsigned r, unsigned c): data(0) {
  function resize (line 99) | void resize (unsigned r, unsigned c) {
  function T (line 102) | T const *operator [] (unsigned i) const {
  function T (line 105) | T *operator [] (unsigned i) {
  function zero (line 108) | void zero () {
  function load_lshkit (line 129) | void load_lshkit (std::string const &path) {
  function save_lshkit (line 143) | void save_lshkit (std::string const &path) {
  function DATA_TYPE (line 204) | DATA_TYPE const *operator [] (unsigned i) const {
  function virtual (line 226) | virtual float operator () (unsigned i) const {
  function proxy (line 231) | proxy(m) {
  function virtual (line 236) | virtual float operator () (unsigned i, unsigned j) const {
  function virtual (line 240) | virtual float angle (unsigned orign, unsigned pivot, unsigned x) const {...
  function SearchOracle (line 255) | SearchOracle query (DATA_TYPE const *query) const {
  function AverageAccuracy (line 324) | inline void AverageAccuracy(Matrix<float> const &gs, Matrix<float> const...
  function AverageMinDist (line 460) | inline void AverageMinDist (Matrix<float> const &gs, Matrix<float> const...
  function namespace (line 482) | namespace kgraph { namespace metric {
  function namespace (line 490) | namespace kgraph { namespace metric {

FILE: algorithms/DPG/src/kgraph.cpp
  type kgraph (line 25) | namespace kgraph {
    function GenRandom (line 38) | static void GenRandom (RNG &rng, unsigned *addr, unsigned size, unsign...
    type Neighbor (line 54) | struct Neighbor {
      method Neighbor (line 58) | Neighbor () {}
      method Neighbor (line 59) | Neighbor (unsigned i, float d, bool f = true): id(i), dist(d), flag(...
    function EvaluateRecall (line 73) | static float EvaluateRecall (Neighbors const &pool, Neighbors const &k...
    function EvaluateAccuracy (line 107) | static float EvaluateAccuracy (Neighbors const &pool, Neighbors const ...
    function EvaluateOneRecall (line 120) | static float EvaluateOneRecall (Neighbors const &pool, Neighbors const...
    function EvaluateDelta (line 125) | static float EvaluateDelta (Neighbors const &pool, unsigned K) {
    type Control (line 135) | struct Control {
    function UpdateKnnList (line 153) | static inline unsigned UpdateKnnList (Neighbor *addr, unsigned K, Neig...
    function LinearSearch (line 180) | void LinearSearch (IndexOracle const &oracle, unsigned i, unsigned K, ...
    function GenerateControl (line 223) | void GenerateControl (IndexOracle const &oracle, unsigned C, unsigned ...
    class KGraphImpl (line 248) | class KGraphImpl: public KGraph {
      method load (line 255) | virtual void load (char const *path) {
      method merge (line 290) | virtual void merge(char const * graph_path, char const * id_path){
      method output_info (line 345) | virtual void output_info(int const id){
      type hub_pair (line 360) | struct hub_pair{
        method hub_pair (line 363) | hub_pair(unsigned x, int y){
      type rknn_pair (line 372) | struct rknn_pair{
        method rknn_pair (line 375) | rknn_pair(unsigned x, float y){
      method connectivity (line 381) | virtual void connectivity(unsigned const source, unsigned const dest){
      method get_partitions (line 413) | virtual void get_partitions(char const *output_path){
      method output_M (line 495) | virtual void output_M (char const* filename) {
      method make_inverse_graph (line 507) | virtual void make_inverse_graph(){
      method test_connectivity (line 527) | virtual void test_connectivity(unsigned dest){ // for inverse kgraph
      method add_random_backward_edges (line 552) | virtual void add_random_backward_edges(char const *data_path, char c...
      method add_backward_edges (line 624) | virtual void add_backward_edges(){
      method compute_diversity (line 665) | virtual void compute_diversity(IndexOracle const &oracle, int d, flo...
      method diversify_by_cut (line 720) | virtual void diversify_by_cut(IndexOracle const &oracle, const int e...
      method statistics (line 849) | virtual  float statistics(IndexOracle const &oracle, const int edge_...
      method remove_near_edges (line 911) | virtual void remove_near_edges(IndexOracle const &oracle, const int ...
      method remove_near_edges_2 (line 980) | virtual void remove_near_edges_2(IndexOracle const &oracle, vector<u...
      method add_long_edges (line 1028) | virtual void add_long_edges(IndexOracle const &oracle, int const ran...
      method saver (line 1090) | virtual void saver (char const *path) const {
      method save (line 1109) | virtual void save (char const *path) const {
      method get_hubs (line 1129) | virtual void get_hubs (char const *hubs_path,char const *knn_path) c...
      method kgraph2dot (line 1199) | virtual void kgraph2dot (char * const &filename){
      method advanced_search (line 1214) | virtual unsigned advanced_search (SearchOracle const &oracle, Search...
      method find_lm (line 1481) | virtual void find_lm (SearchOracle const &oracle) const {
      method search (line 1576) | virtual unsigned search (SearchOracle const &oracle, SearchParams co...
      method search_greedy (line 1849) | virtual unsigned search_greedy (SearchOracle const &oracle, SearchPa...
      method get_nn (line 2088) | virtual void get_nn (unsigned id, unsigned *nns, float *dist, unsign...
      method prune1 (line 2105) | void prune1 () {
      method prune2 (line 2113) | void prune2 () {
      method prune (line 2160) | virtual void prune (IndexOracle const &oracle, unsigned level) {
    class KGraphConstructor (line 2170) | class KGraphConstructor: public KGraphImpl {
      type Nhood (line 2174) | struct Nhood { // neighborhood
        method parallel_try_insert (line 2188) | unsigned parallel_try_insert (unsigned id, float dist) {
        method join (line 2205) | void join (C callback) const {
      method init (line 2225) | void init () {
      method join (line 2263) | void join () {
      method update (line 2282) | void update () {
      method KGraphConstructor (line 2353) | KGraphConstructor (IndexOracle const &o, IndexParams const &p, Index...
    function KGraph (line 2482) | KGraph *KGraph::create () {

FILE: algorithms/DPG/src/kgraph.h
  function namespace (line 19) | namespace kgraph {
  function namespace (line 262) | namespace kgraph {

FILE: algorithms/DPG/src/main.cpp
  function main_index (line 39) | int main_index(int argc, char *argv[]) {
  function main_statistic (line 203) | int main_statistic(int argc, char *argv[]){
  function main_diversify (line 256) | int main_diversify(int argc, char *argv[]){
  function main_search (line 330) | int main_search(int argc, char *argv[]) {
  function main (line 468) | int main(int argc, char *argv[])

FILE: algorithms/DPG/src/metric.cpp
  function float_l2sqr_avx (line 15) | float float_l2sqr_avx (float const *t1, float const *t2, unsigned dim) {
  type kgraph (line 58) | namespace kgraph {
    function float_l2sqr_sse2 (line 59) | float float_l2sqr_sse2 (float const *t1, float const *t2, unsigned dim) {
  function uint8_l2sqr_sse2 (line 164) | float uint8_l2sqr_sse2 (uint8_t const *t1, uint8_t const *t2, unsigned d...

FILE: algorithms/KGraph/src/RandGen.cpp
  function gaussian (line 31) | float gaussian(float mean, float sigma) {
  function uniform (line 56) | float uniform(float _min, float _max) {

FILE: algorithms/KGraph/src/kgraph-data.h
  function namespace (line 24) | namespace kgraph {
  type l2 (line 55) | struct l2 {
  function reset (line 71) | void reset (unsigned r, unsigned c) {
  function data (line 84) | Matrix (unsigned r, unsigned c): data(0) {
  function resize (line 99) | void resize (unsigned r, unsigned c) {
  function T (line 102) | T const *operator [] (unsigned i) const {
  function T (line 105) | T *operator [] (unsigned i) {
  function zero (line 108) | void zero () {
  function load_lshkit (line 129) | void load_lshkit (std::string const &path) {
  function save_lshkit (line 143) | void save_lshkit (std::string const &path) {
  function DATA_TYPE (line 204) | DATA_TYPE const *operator [] (unsigned i) const {
  function virtual (line 226) | virtual float operator () (unsigned i) const {
  function proxy (line 231) | proxy(m) {
  function virtual (line 236) | virtual float operator () (unsigned i, unsigned j) const {
  function virtual (line 240) | virtual float angle (unsigned orign, unsigned pivot, unsigned x) const {...
  function SearchOracle (line 255) | SearchOracle query (DATA_TYPE const *query) const {
  function AverageAccuracy (line 324) | inline void AverageAccuracy(Matrix<float> const &gs, Matrix<float> const...
  function AverageMinDist (line 460) | inline void AverageMinDist (Matrix<float> const &gs, Matrix<float> const...
  function namespace (line 482) | namespace kgraph { namespace metric {
  function namespace (line 490) | namespace kgraph { namespace metric {

FILE: algorithms/KGraph/src/kgraph.cpp
  type kgraph (line 25) | namespace kgraph {
    function GenRandom (line 38) | static void GenRandom (RNG &rng, unsigned *addr, unsigned size, unsign...
    type Neighbor (line 54) | struct Neighbor {
      method Neighbor (line 58) | Neighbor () {}
      method Neighbor (line 59) | Neighbor (unsigned i, float d, bool f = true): id(i), dist(d), flag(...
    function EvaluateRecall (line 73) | static float EvaluateRecall (Neighbors const &pool, Neighbors const &k...
    function EvaluateAccuracy (line 107) | static float EvaluateAccuracy (Neighbors const &pool, Neighbors const ...
    function EvaluateOneRecall (line 120) | static float EvaluateOneRecall (Neighbors const &pool, Neighbors const...
    function EvaluateDelta (line 125) | static float EvaluateDelta (Neighbors const &pool, unsigned K) {
    type Control (line 135) | struct Control {
    function UpdateKnnList (line 153) | static inline unsigned UpdateKnnList (Neighbor *addr, unsigned K, Neig...
    function LinearSearch (line 180) | void LinearSearch (IndexOracle const &oracle, unsigned i, unsigned K, ...
    function GenerateControl (line 223) | void GenerateControl (IndexOracle const &oracle, unsigned C, unsigned ...
    class KGraphImpl (line 248) | class KGraphImpl: public KGraph {
      method load (line 255) | virtual void load (char const *path) {
      method merge (line 290) | virtual void merge(char const * graph_path, char const * id_path){
      method output_info (line 345) | virtual void output_info(int const id){
      type hub_pair (line 360) | struct hub_pair{
        method hub_pair (line 363) | hub_pair(unsigned x, int y){
      type rknn_pair (line 372) | struct rknn_pair{
        method rknn_pair (line 375) | rknn_pair(unsigned x, float y){
      method connectivity (line 381) | virtual void connectivity(unsigned const source, unsigned const dest){
      method get_partitions (line 413) | virtual void get_partitions(char const *output_path){
      method output_M (line 495) | virtual void output_M (char const* filename) {
      method make_inverse_graph (line 507) | virtual void make_inverse_graph(){
      method test_connectivity (line 527) | virtual void test_connectivity(unsigned dest){ // for inverse kgraph
      method add_random_backward_edges (line 552) | virtual void add_random_backward_edges(char const *data_path, char c...
      method add_backward_edges (line 624) | virtual void add_backward_edges(){
      method compute_diversity (line 665) | virtual void compute_diversity(IndexOracle const &oracle, int d, flo...
      method diversify_by_cut (line 720) | virtual void diversify_by_cut(IndexOracle const &oracle, const int e...
      method statistics (line 849) | virtual  float statistics(IndexOracle const &oracle, const int edge_...
      method remove_near_edges (line 911) | virtual void remove_near_edges(IndexOracle const &oracle, const int ...
      method remove_near_edges_2 (line 965) | virtual void remove_near_edges_2(IndexOracle const &oracle, vector<u...
      method add_long_edges (line 1013) | virtual void add_long_edges(IndexOracle const &oracle, int const ran...
      method saver (line 1075) | virtual void saver (char const *path) const {
      method save (line 1094) | virtual void save (char const *path) const {
      method get_hubs (line 1114) | virtual void get_hubs (char const *hubs_path,char const *knn_path) c...
      method kgraph2dot (line 1184) | virtual void kgraph2dot (char * const &filename){
      method advanced_search (line 1199) | virtual unsigned advanced_search (SearchOracle const &oracle, Search...
      method find_lm (line 1466) | virtual void find_lm (SearchOracle const &oracle) const {
      method search (line 1561) | virtual unsigned search (SearchOracle const &oracle, SearchParams co...
      method search_greedy (line 1834) | virtual unsigned search_greedy (SearchOracle const &oracle, SearchPa...
      method get_nn (line 2073) | virtual void get_nn (unsigned id, unsigned *nns, float *dist, unsign...
      method prune1 (line 2090) | void prune1 () {
      method prune2 (line 2098) | void prune2 () {
      method prune (line 2145) | virtual void prune (IndexOracle const &oracle, unsigned level) {
    class KGraphConstructor (line 2155) | class KGraphConstructor: public KGraphImpl {
      type Nhood (line 2159) | struct Nhood { // neighborhood
        method parallel_try_insert (line 2173) | unsigned parallel_try_insert (unsigned id, float dist) {
        method join (line 2190) | void join (C callback) const {
      method init (line 2210) | void init () {
      method join (line 2248) | void join () {
      method update (line 2267) | void update () {
      method KGraphConstructor (line 2338) | KGraphConstructor (IndexOracle const &o, IndexParams const &p, Index...
    function KGraph (line 2467) | KGraph *KGraph::create () {

FILE: algorithms/KGraph/src/kgraph.h
  function namespace (line 19) | namespace kgraph {
  function namespace (line 259) | namespace kgraph {

FILE: algorithms/KGraph/src/kgraph_index.cpp
  function main (line 33) | int main(int argc, char *argv[]) {

FILE: algorithms/KGraph/src/kgraph_search.cpp
  function main (line 33) | int main(int argc, char *argv[]) {

FILE: algorithms/KGraph/src/metric.cpp
  function float_l2sqr_avx (line 15) | float float_l2sqr_avx (float const *t1, float const *t2, unsigned dim) {
  type kgraph (line 58) | namespace kgraph {
    function float_l2sqr_sse2 (line 59) | float float_l2sqr_sse2 (float const *t1, float const *t2, unsigned dim) {
  function uint8_l2sqr_sse2 (line 164) | float uint8_l2sqr_sse2 (uint8_t const *t1, uint8_t const *t2, unsigned d...

FILE: algorithms/NMSLIB/code/CMakeFiles/3.2.3/CompilerIdC/CMakeCCompilerId.c
  function main (line 479) | void main() {}
  function main (line 481) | int main(int argc, char* argv[])

FILE: algorithms/NMSLIB/code/CMakeFiles/3.2.3/CompilerIdCXX/CMakeCXXCompilerId.cpp
  function main (line 473) | int main(int argc, char* argv[])

FILE: algorithms/NMSLIB/code/CMakeFiles/feature_tests.c
  function main (line 34) | int main(int argc, char** argv) { (void)argv; return features[argc]; }

FILE: algorithms/NMSLIB/code/CMakeFiles/feature_tests.cxx
  function main (line 405) | int main(int argc, char** argv) { (void)argv; return features[argc]; }

FILE: algorithms/NMSLIB/code/include/cluster_util.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/distcomp.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/distcomp_edist.h
  function namespace (line 19) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/eval_metrics.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/eval_results.h
  function namespace (line 34) | namespace similarity {
  function GetKNNData (line 121) | void GetKNNData(const KNNQuery<dist_t>* query) {
  function GetRangeData (line 149) | void GetRangeData(const RangeQuery<dist_t>* query) {
  function ComputeMetrics (line 174) | void ComputeMetrics(LabelType queryLabel) {

FILE: algorithms/NMSLIB/code/include/experimentconf.h
  function namespace (line 30) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/experiments.h
  function namespace (line 47) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/init_methods.h
  function namespace (line 52) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/init_spaces.h
  function namespace (line 36) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/bbtree.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/dummy.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/ghtree.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/hnsw.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/list_clusters.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/lsh.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/lsh_multiprobe.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/multi_index.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/multi_vantage_point_tree.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/nndes.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/nonmetr_list_clust.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/omedrank.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/perm_bin_vptree.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/perm_index_incr_bin.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/perm_lsh_bin.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/permutation_inverted_index.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/permutation_prefix_index.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/pivot_neighb_invindx.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/proj_vptree.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/projection_index_incremental.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/seqsearch.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/small_world_rand.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/spatial_approx_tree.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/method/vptree.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_bit_hamming.h
  function namespace (line 21) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_bregman.h
  function namespace (line 21) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_dummy.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_edist.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_savch.h
  function ElementType (line 42) | ElementType accum_dist (ElementType a, ElementType b) const {
  function ElementType (line 55) | ElementType operator()(const ElementType* x, const ElementType* y, size_...

FILE: algorithms/NMSLIB/code/include/factory/space/space_scalar.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_sparse_scalar.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_sqfd.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/factory/space/space_word_embed.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/floatdiff.h
  type UInt (line 55) | typedef void UInt;
  type TypeWithSize (line 59) | struct TypeWithSize
  type UInt (line 61) | typedef uint32_t UInt;
  type TypeWithSize (line 65) | struct TypeWithSize
  type UInt (line 67) | typedef uint64_t UInt;
  function explicit (line 86) | explicit FloatingPointDiff(const RawType& x) : value_(x) {}
  function AlmostEquals (line 91) | bool AlmostEquals(const FloatingPointDiff& rhs, size_t maxUlps) const {
  function Bits (line 96) | Bits ULP_diff(const FloatingPointDiff& rhs) const {
  function Bits (line 114) | Bits ULP_diff(const Bits& sam1, const Bits& sam2) const

FILE: algorithms/NMSLIB/code/include/global.h
  function namespace (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/gold_standard.h
  function namespace (line 39) | namespace similarity {
  type ClassResult (line 91) | enum ClassResult {
  function Write (line 125) | void Write(ostream& controlStream, ostream& binaryStream) const {
  function Read (line 134) | void Read(istream& controlStream, istream& binaryStream) {
  function Compute (line 235) | void Compute(size_t threadQty, float maxKeepEntryCoeff) {
  function Read (line 251) | void Read(istream& controlStream, istream& binaryStream,
  function Write (line 273) | void Write(ostream& controlStream, ostream& binaryStream,
  function vector (line 292) | const vector<unique_ptr<GoldStandard<dist_t>>> &GetRangeGS(size_t i) con...
  function vector (line 295) | const vector<unique_ptr<GoldStandard<dist_t>>> &GetKNNGS(size_t i) const {
  function writeOneGS (line 303) | void writeOneGS(ostream& controlStream, ostream& binaryStream,
  function readOneGS (line 310) | void readOneGS(istream& controlStream, istream& binaryStream,

FILE: algorithms/NMSLIB/code/include/idtype.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/incremental_quick_select.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/index.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/init.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/knnquery.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/knnqueue.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/logging.h
  type LogSeverity (line 32) | enum LogSeverity {LIB_INFO, LIB_WARNING, LIB_ERROR, LIB_FATAL}
  type LogChoice (line 33) | enum LogChoice  {LIB_LOGNONE, LIB_LOGFILE, LIB_LOGSTDERR}
  function class (line 40) | class Logger {
  function class (line 58) | class RuntimeErrorWrapper {

FILE: algorithms/NMSLIB/code/include/memory.h
  function namespace (line 20) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/meta_analysis.h
  function namespace (line 25) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/bbtree.h
  function namespace (line 36) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/dummy.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/ghtree.h
  function namespace (line 25) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/hnsw.h
  function namespace (line 47) | namespace similarity {
  function Object (line 300) | const Object* getData() const {
  function vector (line 304) | const vector<HnswNode*>& getAllFriends(int level) const {
  function HnswNode (line 338) | HnswNode* getMSWNodeHier() const { return element; }
  function operator (line 339) | bool operator< (const HnswNodeDistFarther &obj1) const {
  function operator (line 362) | bool operator< (const EvaluatedMSWNodeInt &obj1) const {
  function HnswNode (line 384) | HnswNode* getMSWNodeHier() const { return element; }
  function operator (line 385) | bool operator< (const HnswNodeDistCloser &obj1) const {
  function std (line 409) | const std::string StrDesc() const override;
  function link (line 439) | void link(HnswNode* first, HnswNode* second, int level, const Space<dist...
  function class (line 486) | class VisitedList {
  function reset (line 496) | void reset() {
  function class (line 514) | class VisitedListPool {
  function VisitedList (line 527) | VisitedList * getFreeVisitedList() {
  function releaseVisitedList (line 540) | void releaseVisitedList(VisitedList *vl) {

FILE: algorithms/NMSLIB/code/include/method/lcstrategy.h
  function ListClustersStrategy (line 8) | enum class ListClustersStrategy {

FILE: algorithms/NMSLIB/code/include/method/list_clusters.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/lsh.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/lsh_multiprobe.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/lsh_space.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/multi_index.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/multi_vantage_point_tree.h
  function namespace (line 25) | namespace similarity {
  function class (line 131) | class LeafNode : public Node {

FILE: algorithms/NMSLIB/code/include/method/multi_vantage_point_tree_utils.h
  function namespace (line 20) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/nndes.h
  function namespace (line 43) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/omedrank.h
  function namespace (line 34) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/perm_bin_vptree.h
  function namespace (line 31) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/perm_index_incr_bin.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/perm_lsh_bin.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/permutation_inverted_index.h
  function namespace (line 29) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/permutation_prefix_index.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/pivot_neighb_common.h
  function namespace (line 8) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/pivot_neighb_invindx.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/proj_vptree.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/projection_index_incremental.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/seqsearch.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/small_world_rand.h
  function namespace (line 37) | namespace similarity {
  function MSWNode (line 127) | MSWNode* getMSWNode() const {return element;}
  function operator (line 128) | bool operator< (const EvaluatedMSWNodeReverse &obj1) const {
  function MSWNode (line 150) | MSWNode* getMSWNode() const {return element;}
  function operator (line 151) | bool operator< (const EvaluatedMSWNodeDirect &obj1) const {
  type std (line 175) | typedef std::vector<MSWNode*> ElementList;
  function std (line 177) | const std::string StrDesc() const override;
  type AlgoType (line 217) | enum AlgoType { kOld, kV1Merge }

FILE: algorithms/NMSLIB/code/include/method/small_world_rand_split.h
  function namespace (line 36) | namespace similarity {
  function class (line 143) | class EvaluatedMSWNodeDirect{
  function MSWNode (line 155) | MSWNode* getMSWNode() const {return element;}
  function operator (line 156) | bool operator< (const EvaluatedMSWNodeDirect &obj1) const {
  type std (line 176) | typedef std::vector<MSWNode*> ElementList;
  function std (line 178) | const std::string StrDesc() const override;

FILE: algorithms/NMSLIB/code/include/method/spatial_approx_tree.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/vptree.h
  function namespace (line 29) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/method/vptree_utils.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/methodfactory.h
  function namespace (line 26) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/nndes/nndes-common.h
  function namespace (line 35) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/nndes/nndes.h
  function namespace (line 18) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/object.h
  function namespace (line 35) | namespace similarity {
  type std (line 171) | typedef std::vector<const Object*> ObjectVector;
  function DataSpaceUsed (line 173) | inline size_t DataSpaceUsed(const ObjectVector &vect) {
  function ClearBucket (line 211) | inline void ClearBucket(char* CacheOptimizedBucket,

FILE: algorithms/NMSLIB/code/include/params.h
  function namespace (line 32) | namespace similarity {
  function AnyParams (line 167) | const inline AnyParams& getEmptyParams() {
  function class (line 172) | class AnyParamManager {
  function ConvertStrToValue (line 297) | void AnyParamManager::ConvertStrToValue(const string& s, ParamType& Valu...

FILE: algorithms/NMSLIB/code/include/params_cmdline.h
  function namespace (line 33) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/permutation_type.h
  function namespace (line 23) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/permutation_utils.h
  function namespace (line 31) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/ported_boost_progress.h
  function namespace (line 28) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/pow.h
  function namespace (line 30) | namespace similarity {
  function T (line 157) | T EfficientFractPowUtil(T Base, uint64_t Exp, uint64_t MaxK) {
  function T (line 180) | T EfficientFractPow(T Base, T FractExp, unsigned NumDig) {

FILE: algorithms/NMSLIB/code/include/projection.h
  function namespace (line 44) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/query.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/query_creator.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/randproj_util.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/rangequery.h
  function namespace (line 24) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/report.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/report_intr_dim.h
  function namespace (line 22) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/searchoracle.h
  function namespace (line 49) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/simddebug.h
  function namespace (line 33) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/sort_arr_bi.h
  function key (line 39) | Item(const KeyType& k) : key(k) {}
  function operator (line 42) | bool operator < (const Item& i2) const {
  function v_ (line 48) | SortArrBI(size_t max_elem) :  v_(max_elem) {
  function resize (line 55) | void resize(size_t max_elem) {
  function push_unsorted_grow (line 60) | void push_unsorted_grow(const KeyType& key, const DataType& data) {
  function KeyType (line 68) | KeyType top_key() {
  function sort (line 72) | void sort() {
  function swap (line 77) | void swap(size_t x, size_t y) {
  function push_or_replace_non_empty (line 83) | size_t push_or_replace_non_empty(const KeyType& key, const DataType& dat...
  function merge_with_sorted_items (line 106) | size_t merge_with_sorted_items(Item* items, size_t item_qty) {
  function push_or_replace_non_empty_exp (line 140) | size_t push_or_replace_non_empty_exp(const KeyType& key, const DataType&...

FILE: algorithms/NMSLIB/code/include/space.h
  function namespace (line 42) | namespace similarity {
  function virtual (line 116) | virtual ~Space() {}
  function dist_t (line 118) | dist_t IndexTimeDistance(const Object* obj1, const Object* obj2) const {
  function virtual (line 126) | virtual dist_t ProxyDistance(const Object* obj1, const Object* obj2) con...
  function virtual (line 162) | virtual void WriteNextObj(const Object& obj, const string& externId, Dat...

FILE: algorithms/NMSLIB/code/include/space/space_bit_hamming.h
  function namespace (line 33) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_bregman.h
  function virtual (line 49) | virtual ~BregmanDiv() {}
  function virtual (line 74) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pDstVect,
  function BregmanDiv (line 82) | static inline
  function virtual (line 102) | virtual ~KLDivAbstract() {}
  function virtual (line 108) | virtual std::string StrDesc() const = 0;
  function virtual (line 136) | virtual ~KLDivGenFast() {}
  function virtual (line 141) | virtual size_t GetElemQty(const Object* object) const { return object->d...
  function virtual (line 153) | virtual ~ItakuraSaitoFast() {}
  function virtual (line 161) | virtual size_t GetElemQty(const Object* object) const { return object->d...
  function virtual (line 173) | virtual ~KLDivGenFastRightQuery() {}
  function virtual (line 175) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pDstVect,
  function virtual (line 183) | virtual size_t GetElemQty(const Object* object) const { return object->d...
  function virtual (line 194) | virtual ~KLDivFast() {}
  function virtual (line 196) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pDstVect,
  function virtual (line 204) | virtual size_t GetElemQty(const Object* object) const { return object->d...
  function virtual (line 215) | virtual ~KLDivFastRightQuery() {}
  function virtual (line 217) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pDstVect,
  function virtual (line 225) | virtual size_t GetElemQty(const Object* object) const { return object->d...

FILE: algorithms/NMSLIB/code/include/space/space_dummy.h
  function namespace (line 35) | namespace similarity {
  function virtual (line 101) | virtual bool ApproxEqual(const Object& obj1, const Object& obj2) const {
  function virtual (line 110) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pVect,
  function virtual (line 114) | virtual size_t GetElemQty(const Object* object) const {return 0;}

FILE: algorithms/NMSLIB/code/include/space/space_js.h
  function namespace (line 39) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_leven.h
  function namespace (line 29) | namespace similarity {
  function class (line 53) | class SpaceLevenshteinNormalized : public StringSpace<float> {

FILE: algorithms/NMSLIB/code/include/space/space_lp.h
  function namespace (line 38) | namespace similarity {
  function dist_t (line 51) | dist_t operator()(const dist_t* x, const dist_t* y, size_t length) const {
  function virtual (line 82) | virtual ~SpaceLp() {}

FILE: algorithms/NMSLIB/code/include/space/space_rank_correl.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_scalar.h
  function namespace (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_sparse_lp.h
  function namespace (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_sparse_scalar.h
  function namespace (line 36) | namespace similarity {
  function virtual (line 70) | virtual ~SpaceSparseCosineSimilarity() {}

FILE: algorithms/NMSLIB/code/include/space/space_sparse_scalar_fast.h
  function namespace (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_sparse_vector.h
  function namespace (line 34) | namespace similarity {
  function explicit (line 75) | explicit SpaceSparseVector() {}
  function virtual (line 76) | virtual ~SpaceSparseVector() {}
  function virtual (line 108) | virtual size_t GetElemQty(const Object* object) const {return 0;}
  function virtual (line 122) | virtual ~SpaceSparseVectorSimpleStorage() {}
  function explicit (line 123) | explicit SpaceSparseVectorSimpleStorage() {}
  function virtual (line 125) | virtual void CreateDenseVectFromObj(const Object* obj, dist_t* pVect,
  function Object (line 138) | Object* CreateObjFromVect(IdType id, LabelType label, const vector<ElemT...
  function virtual (line 142) | virtual dist_t ScalarProduct(const Object* obj1, const Object* obj2) con...
  function virtual (line 150) | virtual void CreateVectFromObj(const Object* obj, vector<ElemType>& v) c...
  type SpaceNormScalarProduct (line 159) | struct SpaceNormScalarProduct {

FILE: algorithms/NMSLIB/code/include/space/space_sparse_vector_inter.h
  function namespace (line 35) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_sqfd.h
  function namespace (line 39) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_string.h
  function namespace (line 30) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_vector.h
  function namespace (line 32) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_vector_gen.h
  function namespace (line 25) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/space/space_word_embed.h
  function namespace (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/spacefactory.h
  function namespace (line 27) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/tune.h
  function namespace (line 39) | namespace similarity {

FILE: algorithms/NMSLIB/code/include/utils.h
  type SSIZE_T (line 70) | typedef SSIZE_T ssize_t;
  function namespace (line 75) | namespace similarity {
  function mMap (line 283) | mMap(Map) {}
  function mMap (line 292) | mMap(Map) {}

FILE: algorithms/NMSLIB/code/include/ztimer.h
  function class (line 27) | class WallClockTimer {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/apost.h
  type Parameter (line 65) | struct Parameter {
  function apply1 (line 115) | float apply1 (Domain obj, unsigned m) const {
  function apply1 (line 125) | void apply1 (Domain obj, std::vector<float> *h) const {
  function apply_const (line 144) | unsigned apply_const (Domain obj) const
  type APostExample (line 171) | struct APostExample {
  type PrH (line 176) | struct PrH {    // Pr[h] of certain compnent
  function operator (line 187) | bool operator < (const PrH &p1, const PrH &p2) {
  function class (line 193) | class APostModel
  type typename (line 236) | typedef typename Super::Parameter Parameter;
  type typename (line 238) | typedef typename Super::Domain Domain;
  type KEY (line 239) | typedef KEY Key;
  function train (line 289) | void train (const std::vector<APostExample> &examples, unsigned Nz, floa...
  function load (line 296) | void load (std::istream &ar)
  function save (line 304) | void save (std::ostream &ar)

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/archive.h
  function namespace (line 49) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/common.h
  function namespace (line 49) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/composite.h
  function namespace (line 50) | namespace lshkit {
  type Parameter (line 138) | struct Parameter
  type typename (line 141) | typedef typename Super::Domain Domain;
  function const (line 164) | unsigned operator () (Domain obj) const
  type Parameter (line 195) | struct Parameter
  type typename (line 198) | typedef typename Super::Domain Domain;
  type Parameter (line 223) | struct Parameter
  type typename (line 226) | typedef typename Super::Domain Domain;
  function const (line 236) | unsigned operator () (Domain obj) const
  function const (line 241) | unsigned operator () (Domain obj, float *delta) const
  type Parameter (line 285) | struct Parameter
  type typename (line 292) | typedef typename Super::Domain Domain;
  function const (line 327) | unsigned operator () (Domain obj) const
  type Parameter (line 384) | struct Parameter
  type typename (line 391) | typedef typename LSH::Domain Domain;
  function const (line 422) | unsigned operator () (Domain obj) const
  type Parameter (line 469) | struct Parameter
  type typename (line 475) | typedef typename Super::Domain Domain;
  function const (line 503) | unsigned operator () (Domain obj) const
  type Parameter (line 535) | struct Parameter
  type typename (line 538) | typedef typename Super::Domain Domain;
  function const (line 549) | unsigned operator () (Domain obj) const {
  function const (line 553) | unsigned operator () (Domain obj, float *delta) const

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/concept.h
  function namespace (line 82) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/eval.h
  function namespace (line 38) | namespace lshkit {
  function load (line 118) | void load (std::istream &is)
  function save (line 139) | void save (std::ostream &os) const
  function load (line 151) | void load (const std::string &path)
  function save (line 158) | void save (const std::string &path) const
  function getQuery (line 168) | unsigned getQuery (unsigned n) const {  return queries_[n]; }
  function Topk (line 171) | const Topk<KEY> &getAnswer (unsigned n) const { return topks_[n]; }
  function class (line 201) | class Stat
  function merge (line 244) | void merge (const Stat &stat)

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/forest.h
  function namespace (line 59) | namespace lshkit {
  function lookup (line 172) | void lookup (Domain val, std::vector<const Node *> *nodes) const {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/histogram.h
  function namespace (line 83) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/kernel.h
  function namespace (line 32) | namespace lshkit { namespace kernel {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/lsh-index.h
  function namespace (line 35) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/lsh.h
  function namespace (line 34) | namespace lshkit {
  type StableDistLsh (line 201) | typedef StableDistLsh<Cauchy> CauchyLsh;
  type StableDistLsh (line 203) | typedef StableDistLsh<Gaussian> GaussianLsh;
  function class (line 231) | class HyperPlaneLsh
  function const (line 271) | unsigned operator () (Domain obj) const
  function const (line 281) | unsigned operator () (Domain obj, float *delta) const
  function class (line 342) | class ThresholdingLsh
  function const (line 385) | unsigned operator () (Domain obj) const
  function const (line 390) | unsigned operator () (Domain obj, float *delta) const

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/matrix-io.h
  function namespace (line 41) | namespace lshkit{

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/matrix.h
  function namespace (line 46) | namespace lshkit {
  function class (line 135) | class Accessor
  type Matrix (line 186) | typedef Matrix<float> FloatMatrix;

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/metric.h
  function namespace (line 33) | namespace lshkit { namespace metric {
  function const (line 91) | float operator () (const T *first1, const T *first2) const
  function const (line 109) | float operator () (const T *first1, const T *first2) const
  type basic_hamming (line 124) | struct basic_hamming
  function __hamming (line 141) | unsigned __hamming (unsigned char c1, unsigned char c2) const
  function const (line 162) | float operator () (const T *first1, const T *first2) const

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/mplsh-model.h
  function namespace (line 41) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/mplsh.h
  function namespace (line 138) | namespace lshkit
  type std (line 170) | typedef std::vector<Probe> ProbeSequence;
  function class (line 176) | class ProbeSequenceTemplates: public std::vector<ProbeSequence>
  function class (line 192) | class MultiProbeLsh: public RepeatHash<GaussianLsh>
  function const (line 244) | unsigned operator () (Domain obj) const
  type typename (line 269) | typedef typename Super::Parameter Parameter;
  type KEY (line 278) | typedef KEY Key;
  function load (line 302) | void load (std::istream &ar)
  function save (line 311) | void save (std::ostream &ar)

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/multiprobelsh-fitdata.h
  function namespace (line 57) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/multiprobelsh-tune.h
  function namespace (line 147) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/sketch.h
  function namespace (line 107) | namespace lshkit {
  function load (line 196) | void load (std::istream &is) {
  function save (line 201) | void save (std::ostream &os) {
  function update (line 247) | void update (const CHUNK *in, const float *asym)
  function distTo (line 270) | float distTo (const CHUNK *in)

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/spectral-hash.h
  function namespace (line 35) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/topk.h
  function namespace (line 59) | namespace lshkit {
  type typename (line 111) | typedef typename std::vector<TopkEntry<KEY> > Base;
  function reset (line 138) | void reset (float r) {
  function recall (line 193) | float recall (const Topk<KEY> &topk /* to be evaluated */) const
  type typename (line 226) | typedef typename ACCESSOR::Value Value;
  function reset (line 252) | void reset (Value query) {
  function reset (line 311) | void reset (const float *query) {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/tune.h
  function namespace (line 31) | namespace lshkit { namespace tune {

FILE: algorithms/NMSLIB/code/lshkit/include/lshkit/vq.h
  function namespace (line 26) | namespace lshkit {

FILE: algorithms/NMSLIB/code/lshkit/src/apost.cpp
  type lshkit (line 28) | namespace lshkit
    type ExampleModel (line 33) | struct ExampleModel {
      method estimate (line 38) | void estimate (const APostLsh &lsh, const APostExample &example)
    class GaussianHashModel (line 136) | class GaussianHashModel
      method GaussianHashModel (line 141) | GaussianHashModel (const APostLsh &lsh, const std::vector<APostExamp...
      method estimate (line 158) | void estimate (unsigned m, float h, float *mean, float *std) { // mt...
    function GaussianInterval (line 173) | static inline float GaussianInterval (float mean, float std, float l, ...
    type PrC (line 254) | struct PrC {
    type Probe (line 264) | struct Probe {
      method Probe (line 270) | Probe () {
      method Probe (line 274) | Probe (const std::vector<unsigned> *range_):
      method canShift (line 282) | bool canShift () const {
      method shift (line 289) | void shift () {
      method canExpand (line 295) | bool canExpand () const {
      method expand (line 301) | void expand () {
      method canExtend (line 306) | bool canExtend () const {
      method extend (line 311) | void extend () {
      method setPr (line 319) | void setPr (const std::vector<PrC> &pl) {
      method hash (line 327) | unsigned hash (const APostLsh &lsh,
      method print (line 337) | unsigned print (const std::vector<PrC> &pl) {
    function BOOST_FOREACH (line 389) | BOOST_FOREACH(const PrC &prc, pl) {

FILE: algorithms/NMSLIB/code/lshkit/src/kdtree.cpp
  function sqr (line 17) | static inline float sqr (float x) {
  function l2sqr (line 21) | static inline float l2sqr (const float *p1, const float *p2, unsigned D) {
  type kd_node (line 36) | struct kd_node
  function kd_is_leaf (line 48) | static inline int kd_is_leaf (union kd_leaf_or_node u, unsigned K) {
  type kd_node (line 57) | struct kd_node {
  type kd_tree (line 70) | struct kd_tree {
  function kd_node_t (line 79) | static inline kd_node_t *kd_alloc_node (kd_tree_t *tree) {
  function kd_tree_t (line 84) | kd_tree_t *kd_tree_alloc (unsigned K, unsigned dim) {
  function kd_tree_free (line 99) | void kd_tree_free (kd_tree_t *tree) {
  function bisec (line 108) | static inline void bisec (
  function kd_node_t (line 200) | static const kd_node_t *kd_index_hlp (kd_tree_t *tree, unsigned *idx, un...
  function kd_tree_index (line 244) | void kd_tree_index (kd_tree_t *tree, const float *means) {
  type kd_search_stat (line 285) | struct kd_search_stat {
  type kd_search_stat (line 295) | struct kd_search_stat
  function kd_search_leaf_or_node (line 297) | static inline void kd_search_leaf_or_node (union kd_leaf_or_node lon,
  function kd_search_node (line 314) | static void kd_search_node (const kd_node_t *node, struct kd_search_stat...
  function kd_tree_search (line 352) | unsigned kd_tree_search (kd_tree_t *tree, const float *pt, unsigned *cnt) {
  function kd_tree_ln_search (line 388) | unsigned kd_tree_ln_search (kd_tree_t *tree, const float *pt, unsigned *...

FILE: algorithms/NMSLIB/code/lshkit/src/kdtree.h
  type kd_tree_t (line 4) | typedef struct kd_tree kd_tree_t;

FILE: algorithms/NMSLIB/code/lshkit/src/mplsh-model.cpp
  type lshkit (line 36) | namespace lshkit {
    class GammaDoubleMleHelper (line 41) | class GammaDoubleMleHelper
      method GammaDoubleMleHelper (line 45) | GammaDoubleMleHelper(double rate): rate_(rate) {}
    function GammaDoubleMleTol (line 53) | bool GammaDoubleMleTol (double first, double second)
    function GammaDouble (line 58) | GammaDouble GammaDoubleMLE (double M, double G)
    function col_helper (line 68) | static inline double col_helper (double x)
    function p_col_helper (line 76) | static inline double p_col_helper (double x, double k)
    type __MpLshMdlHlpr (line 117) | struct __MpLshMdlHlpr
    function recall_helper (line 123) | static double recall_helper (double xsqr, void *_param)
    function recall (line 130) | static double recall (__MpLshMdlHlpr *param)

FILE: algorithms/NMSLIB/code/lshkit/src/mplsh.cpp
  type lshkit (line 24) | namespace lshkit
    function GenExpectScores (line 28) | void GenExpectScores (ProbeSequence &seq, unsigned M)
    class ProbeGT (line 44) | class ProbeGT
    function GenProbeSequenceTemplate (line 53) | void GenProbeSequenceTemplate (ProbeSequence &seq, unsigned M, unsigne...

FILE: algorithms/NMSLIB/code/lshkit/src/vq.cpp
  type lshkit (line 26) | namespace lshkit

FILE: algorithms/NMSLIB/code/lshkit/tools/apost-run.cpp
  function main (line 82) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/dump-query.cpp
  function main (line 119) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/embed.cpp
  class Embedder (line 89) | class Embedder {
    method add (line 96) | void add (float *out, const float *in) const {
    method zero (line 100) | void zero (float *out) const {
    method scale (line 104) | void scale (float *out, float s) const
    method norm (line 109) | void norm (float *out) const
  class StripeEmbedder (line 123) | class StripeEmbedder: public Embedder, public StripeEmbedderBase {
    type Parameter (line 126) | struct Parameter: public Base::Parameter {
    method StripeEmbedder (line 137) | StripeEmbedder (const Parameter &param, lshkit::DefaultRng &rng)
    method dim (line 141) | virtual unsigned dim () const {
    method add (line 145) | virtual void add (float *out, const float *in, float weight) const {
  class HyperPlaneEmbedder (line 155) | class HyperPlaneEmbedder: public Embedder, public HyperPlaneEmbedderBase {
    type Parameter (line 158) | struct Parameter: public Base::Parameter {
    method HyperPlaneEmbedder (line 167) | HyperPlaneEmbedder (const Parameter &param, lshkit::DefaultRng &rng)
    method dim (line 171) | virtual unsigned dim () const {
    method add (line 175) | virtual void add (float *out, const float *in, float weight) const {
  function main (line 187) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/fitdata.cpp
  function main (line 67) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/forest-run.cpp
  function main (line 56) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/lsh-run.cpp
  function main (line 62) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/mplsh-predict.cpp
  function main (line 50) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/mplsh-run.cpp
  function main (line 119) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/mplsh-tune.cpp
  function main (line 205) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/run-spectral.cpp
  function main (line 6) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/scan.cpp
  function main (line 58) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/sketch-run.cpp
  function main (line 64) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/lshkit/tools/txt2bin.cpp
  function main (line 48) | int main (int argc, char *argv[])

FILE: algorithms/NMSLIB/code/src/cluster_util.cc
  type similarity (line 28) | namespace similarity {
    type DataWrapper (line 33) | struct DataWrapper {
      method DataWrapper (line 34) | DataWrapper(IdTypeUnsign dataId, IdType centerIndex, const Object* p...
      method DataWrapper (line 36) | DataWrapper(){}
    class ClusterUtils<float> (line 851) | class ClusterUtils<float>
    class ClusterUtils<double> (line 852) | class ClusterUtils<double>
    class ClusterUtils<int> (line 853) | class ClusterUtils<int>

FILE: algorithms/NMSLIB/code/src/distcomp_bregman.cc
  type similarity (line 29) | namespace similarity {
    function T (line 39) | T ItakuraSaito(const T* pVect1, const T* pVect2, size_t qty) {
    function T (line 53) | T ItakuraSaitoPrecomp(const T* pVect1, const T* pVect2, size_t qty) {
    function ItakuraSaitoPrecompSIMD (line 86) | float ItakuraSaitoPrecompSIMD(const float* pVect1, const float* pVect2...
    function ItakuraSaitoPrecompSIMD (line 155) | double ItakuraSaitoPrecompSIMD(const double* pVect1, const double* pVe...
    function T (line 208) | T KLStandard(const T *pVect1, const T *pVect2, size_t qty)
    function T (line 222) | T KLStandardLogDiff(const T *p1, const T *p2, size_t qty)
    function T (line 238) | T KLPrecomp(const T* pVect1, const T* pVect2, size_t qty) {
    function KLPrecompSIMD (line 270) | float KLPrecompSIMD(const float* pVect1, const float* pVect2, size_t qty)
    function KLPrecompSIMD (line 332) | double KLPrecompSIMD(const double* pVect1, const double* pVect2, size_...
    function T (line 377) | T KLGeneralStandard(const T *pVect1, const T *pVect2, size_t qty)
    function T (line 396) | T KLGeneralPrecomp(const T* pVect1, const T* pVect2, size_t qty) {
    function KLGeneralPrecompSIMD (line 428) | float KLGeneralPrecompSIMD(const float* pVect1, const float* pVect2, s...
    function KLGeneralPrecompSIMD (line 498) | double KLGeneralPrecompSIMD(const double* pVect1, const double* pVect2...

FILE: algorithms/NMSLIB/code/src/distcomp_edist.cc
  type similarity (line 25) | namespace similarity {
    function levenshtein (line 29) | int levenshtein(const T* p1, size_t len1, const T* p2, size_t len2) {

FILE: algorithms/NMSLIB/code/src/distcomp_js.cc
  type similarity (line 30) | namespace similarity {
    function T (line 50) | T JSStandard(const T *pVect1, const T *pVect2, size_t qty)
    function T (line 72) | T JSPrecomp(const T* pVect1, const T* pVect2, size_t qty) {
    function lapprox (line 99) | inline unsigned lapprox(T f) {
    class ApproxLogs (line 104) | class ApproxLogs {
      method ApproxLogs (line 106) | ApproxLogs() {
    function T (line 116) | T
    function JSPrecompSIMDApproxLog (line 153) | float JSPrecompSIMDApproxLog(const float* pVect1, const float* pVect2,...
    function JSPrecompSIMDApproxLog (line 238) | double JSPrecompSIMDApproxLog(const double* pVect1, const double* pVec...

FILE: algorithms/NMSLIB/code/src/distcomp_lp.cc
  type similarity (line 33) | namespace similarity {
    function T (line 42) | T LInfNormStandard(const T *p1, const T *p2, size_t qty)
    function T (line 58) | T LInfNorm(const T* pVect1, const T* pVect2, size_t qty) {
    function LInfNormSIMD (line 87) | float LInfNormSIMD(const float* pVect1, const float* pVect2, size_t qt...
    function LInfNormSIMD (line 151) | double LInfNormSIMD(const double* pVect1, const double* pVect2, size_t...
    function T (line 200) | T L1NormStandard(const T *p1, const T *p2, size_t qty)
    function T (line 216) | T L1Norm(const T* pVect1, const T* pVect2, size_t qty) {
    function L1NormSIMD (line 245) | float L1NormSIMD(const float* pVect1, const float* pVect2, size_t qty) {
    function L1NormSIMD (line 308) | double L1NormSIMD(const double* pVect1, const double* pVect2, size_t q...
    function T (line 358) | T L2NormStandard(const T *p1, const T *p2, size_t qty)
    function T (line 373) | T L2Norm(const T* pVect1, const T* pVect2, size_t qty) {
    function L2SqrSIMD (line 410) | float L2SqrSIMD(const float* pVect1, const float* pVect2, size_t qty) {
    function L2NormSIMD (line 474) | float L2NormSIMD(const float* pVect1, const float* pVect2, size_t qty) {
    function L2NormSIMD (line 480) | double L2NormSIMD(const double* pVect1, const double* pVect2, size_t q...
    function T (line 527) | T LPGenericDistance(const T* x, const T* y, const int length, const T ...
    function T (line 551) | T LPGenericDistanceOptim(const T* x, const T* y, const int length, con...

FILE: algorithms/NMSLIB/code/src/distcomp_rankcorr.cc
  type similarity (line 23) | namespace similarity {
    function SpearmanFootrule (line 33) | int SpearmanFootrule(const PivotIdType* x, const PivotIdType* y, size_...
    function SpearmanFootruleSIMD (line 45) | int SpearmanFootruleSIMD(const int32_t* pVect1, const int32_t* pVect2,...
    function SpearmanRho (line 105) | int SpearmanRho(const PivotIdType* x, const PivotIdType* y, size_t qty) {
    function SpearmanRhoSIMD (line 117) | int SpearmanRhoSIMD(const PivotIdType* pVect1, const PivotIdType* pVec...

FILE: algorithms/NMSLIB/code/src/distcomp_scalar.cc
  type similarity (line 24) | namespace similarity {
    function T (line 34) | T NormScalarProduct(const T *p1, const T *p2, size_t qty)
    function NormScalarProductSIMD (line 66) | float NormScalarProductSIMD(const float* pVect1, const float* pVect2, ...
    function NormScalarProductSIMD (line 154) | double NormScalarProductSIMD(const double* pVect1, const double* pVect...
    function T (line 253) | T ScalarProduct(const T *p1, const T *p2, size_t qty) {
    function ScalarProductSIMD (line 271) | float ScalarProductSIMD(const float* pVect1, const float* pVect2, size...
    function ScalarProductSIMD (line 325) | double ScalarProductSIMD(const double* pVect1, const double* pVect2, s...
    function T (line 387) | T AngularDistance(const T *p1, const T *p2, size_t qty)
    function T (line 401) | T CosineSimilarity(const T *p1, const T *p2, size_t qty)

FILE: algorithms/NMSLIB/code/src/distcomp_sparse_scalar_fast.cc
  type similarity (line 25) | namespace similarity {
    function ScalarProductFast (line 85) | float ScalarProductFast(const char* pData1, size_t len1,

FILE: algorithms/NMSLIB/code/src/dummy_app.cc
  function main (line 4) | int main(void) {

FILE: algorithms/NMSLIB/code/src/experimentconf.cc
  type similarity (line 45) | namespace similarity {
    class ExperimentConfig<float> (line 430) | class ExperimentConfig<float>
    class ExperimentConfig<double> (line 431) | class ExperimentConfig<double>
    class ExperimentConfig<int> (line 432) | class ExperimentConfig<int>

FILE: algorithms/NMSLIB/code/src/global.cc
  type similarity (line 19) | namespace similarity {

FILE: algorithms/NMSLIB/code/src/init.cc
  type similarity (line 31) | namespace similarity {
    function initLibrary (line 33) | void initLibrary(LogChoice choice, const char* pLogFile) {

FILE: algorithms/NMSLIB/code/src/knnquery.cc
  type similarity (line 29) | namespace similarity {
    function dist_t (line 57) | dist_t KNNQuery<dist_t>::Radius() const {
    class KNNQuery<float> (line 136) | class KNNQuery<float>
    class KNNQuery<double> (line 137) | class KNNQuery<double>
    class KNNQuery<int> (line 138) | class KNNQuery<int>
    class KNNQuery<short int> (line 139) | class KNNQuery<short int>

FILE: algorithms/NMSLIB/code/src/logging.cc
  type voidstream (line 38) | struct voidstream : public ostream {
    method ostream (line 39) | ostream& operator<< (T) { return *this; }
    method ostream (line 40) | ostream& operator<< (T*) { return *this; }
    method ostream (line 41) | ostream& operator<< (T&) { return *this; }
    method voidstream (line 42) | voidstream() : ostream(0) {}
  function LibGetCurrentTime (line 45) | std::string LibGetCurrentTime() {
  function InitializeLogger (line 79) | void InitializeLogger(LogChoice choice, const char* logfile) {

FILE: algorithms/NMSLIB/code/src/main.cc
  function OutData (line 53) | void OutData(bool DoAppend, const string& FilePrefix,
  function ProcessResults (line 88) | void ProcessResults(const ExperimentConfig<dist_t>& config,
  function RunExper (line 130) | void RunExper(bool                                bPrintProgress,
  function main (line 510) | int main(int ac, char* av[]) {

FILE: algorithms/NMSLIB/code/src/memory.cc
  type similarity (line 37) | namespace similarity {

FILE: algorithms/NMSLIB/code/src/method/bbtree.cc
  type similarity (line 39) | namespace similarity {
    class BBTree<double> (line 331) | class BBTree<double>
    class BBTree<float> (line 332) | class BBTree<float>

FILE: algorithms/NMSLIB/code/src/method/dummy.cc
  type similarity (line 22) | namespace similarity {
    class DummyMethod<float> (line 59) | class DummyMethod<float>
    class DummyMethod<double> (line 60) | class DummyMethod<double>
    class DummyMethod<int> (line 61) | class DummyMethod<int>

FILE: algorithms/NMSLIB/code/src/method/ghtree.cc
  type similarity (line 25) | namespace similarity {
    class GHTree<double> (line 208) | class GHTree<double>
    class GHTree<float> (line 209) | class GHTree<float>
    class GHTree<int> (line 210) | class GHTree<int>

FILE: algorithms/NMSLIB/code/src/method/hnsw.cc
  type similarity (line 60) | namespace similarity {
    class Hnsw<float> (line 880) | class Hnsw<float>
    class Hnsw<double> (line 881) | class Hnsw<double>
    class Hnsw<int> (line 882) | class Hnsw<int>

FILE: algorithms/NMSLIB/code/src/method/hnsw_distfunc_opt.cc
  type similarity (line 42) | namespace similarity {
    function L2SqrSIMD16Ext (line 43) | float L2SqrSIMD16Ext(const float* pVect1, const float* pVect2, size_t ...
    function L2SqrSIMDExt (line 97) | float L2SqrSIMDExt(const float* pVect1, const float* pVect2, size_t &q...
    function ScalarProductSIMD (line 151) | float ScalarProductSIMD(const float* __restrict pVect1, const float*  ...
    function NormScalarProductSIMD (line 208) | float NormScalarProductSIMD(const float* pVect1, const float* pVect2, ...
    class Hnsw<float> (line 524) | class Hnsw<float>
    class Hnsw<double> (line 525) | class Hnsw<double>
    class Hnsw<int> (line 526) | class Hnsw<int>

FILE: algorithms/NMSLIB/code/src/method/list_clusters.cc
  type similarity (line 27) | namespace similarity {
    type DistDistObjectTupleAscComparator (line 37) | struct DistDistObjectTupleAscComparator {
    type Elem (line 219) | struct Elem {
      method Elem (line 223) | Elem(Cluster* c, dist_t d) : cluster(c), dist_qc(d) {}
    function Object (line 260) | const Object* ListClusters<dist_t>::SelectNextCenter(
    function Object (line 329) | const Object* ListClusters<dist_t>::Cluster::GetCenter() {
    function dist_t (line 334) | const dist_t ListClusters<dist_t>::Cluster::GetCoveringRadius() {
    function ObjectVector (line 339) | const ObjectVector& ListClusters<dist_t>::Cluster::GetBucket() {
    class ListClusters<double> (line 351) | class ListClusters<double>
    class ListClusters<float> (line 352) | class ListClusters<float>
    class ListClusters<int> (line 353) | class ListClusters<int>

FILE: algorithms/NMSLIB/code/src/method/lsh.cc
  type similarity (line 25) | namespace similarity {
    class LSH<float, lshkit::ThresholdingLsh, ParameterCreator<TailRepeatHashThreshold>> (line 123) | class LSH<float, lshkit::ThresholdingLsh, ParameterCreator<TailRepeatH...
    class LSH<float, lshkit::CauchyLsh, ParameterCreator<TailRepeatHashCauchy>> (line 124) | class LSH<float, lshkit::CauchyLsh, ParameterCreator<TailRepeatHashCau...
    class LSH<float, lshkit::GaussianLsh, ParameterCreator<TailRepeatHashGaussian>> (line 125) | class LSH<float, lshkit::GaussianLsh, ParameterCreator<TailRepeatHashG...

FILE: algorithms/NMSLIB/code/src/method/lsh_multiprobe.cc
  type similarity (line 25) | namespace similarity {
    class MultiProbeLSH<float> (line 196) | class MultiProbeLSH<float>

FILE: algorithms/NMSLIB/code/src/method/lsh_space.cc
  type similarity (line 20) | namespace similarity {
    function LSHLp (line 29) | float LSHLp(const float* x, const float* y, const int dim, const int p) {
    function LSHMultiProbeLp (line 41) | float LSHMultiProbeLp(const float* x, const float* y, const int dim) {

FILE: algorithms/NMSLIB/code/src/method/multi_index.cc
  type similarity (line 30) | namespace similarity {
    class MultiIndex<float> (line 143) | class MultiIndex<float>
    class MultiIndex<double> (line 144) | class MultiIndex<double>
    class MultiIndex<int> (line 145) | class MultiIndex<int>

FILE: algorithms/NMSLIB/code/src/method/multi_vantage_point_tree.cc
  type similarity (line 26) | namespace similarity {
    class MultiVantagePointTree<float> (line 245) | class MultiVantagePointTree<float>
    class MultiVantagePointTree<double> (line 246) | class MultiVantagePointTree<double>
    class MultiVantagePointTree<int> (line 247) | class MultiVantagePointTree<int>

FILE: algorithms/NMSLIB/code/src/method/nndes.cc
  type similarity (line 63) | namespace similarity {
    class NNDescentMethod<float> (line 260) | class NNDescentMethod<float>
    class NNDescentMethod<double> (line 261) | class NNDescentMethod<double>
    class NNDescentMethod<int> (line 262) | class NNDescentMethod<int>

FILE: algorithms/NMSLIB/code/src/method/nonmetr_list_clust.cc
  type similarity (line 26) | namespace similarity {
    class NonMetrListClust<float> (line 148) | class NonMetrListClust<float>
    class NonMetrListClust<double> (line 149) | class NonMetrListClust<double>
    class NonMetrListClust<int> (line 150) | class NonMetrListClust<int>

FILE: algorithms/NMSLIB/code/src/method/omedrank.cc
  type similarity (line 32) | namespace similarity {
    class OMedRank<float> (line 294) | class OMedRank<float>
    class OMedRank<double> (line 295) | class OMedRank<double>
    class OMedRank<int> (line 296) | class OMedRank<int>

FILE: algorithms/NMSLIB/code/src/method/perm_bin_vptree.cc
  type similarity (line 32) | namespace similarity {
    class PermBinVPTree<float, SpearmanRho> (line 178) | class PermBinVPTree<float, SpearmanRho>
    class PermBinVPTree<float, SpearmanRhoSIMD> (line 179) | class PermBinVPTree<float, SpearmanRhoSIMD>
    class PermBinVPTree<float, SpearmanFootrule> (line 180) | class PermBinVPTree<float, SpearmanFootrule>
    class PermBinVPTree<double, SpearmanRho> (line 181) | class PermBinVPTree<double, SpearmanRho>
    class PermBinVPTree<double, SpearmanRhoSIMD> (line 182) | class PermBinVPTree<double, SpearmanRhoSIMD>
    class PermBinVPTree<double, SpearmanFootrule> (line 183) | class PermBinVPTree<double, SpearmanFootrule>
    class PermBinVPTree<int, SpearmanRho> (line 184) | class PermBinVPTree<int, SpearmanRho>
    class PermBinVPTree<int, SpearmanRhoSIMD> (line 185) | class PermBinVPTree<int, SpearmanRhoSIMD>
    class PermBinVPTree<int, SpearmanFootrule> (line 186) | class PermBinVPTree<int, SpearmanFootrule>

FILE: algorithms/NMSLIB/code/src/method/perm_index_incr_bin.cc
  type similarity (line 29) | namespace similarity {
    class PermutationIndexIncrementalBin<float,SpearmanRho> (line 169) | class PermutationIndexIncrementalBin<float,SpearmanRho>
    class PermutationIndexIncrementalBin<double,SpearmanRho> (line 170) | class PermutationIndexIncrementalBin<double,SpearmanRho>
    class PermutationIndexIncrementalBin<int,SpearmanRho> (line 171) | class PermutationIndexIncrementalBin<int,SpearmanRho>
    class PermutationIndexIncrementalBin<float,SpearmanFootrule> (line 172) | class PermutationIndexIncrementalBin<float,SpearmanFootrule>
    class PermutationIndexIncrementalBin<double,SpearmanFootrule> (line 173) | class PermutationIndexIncrementalBin<double,SpearmanFootrule>
    class PermutationIndexIncrementalBin<int,SpearmanFootrule> (line 174) | class PermutationIndexIncrementalBin<int,SpearmanFootrule>
    class PermutationIndexIncrementalBin<float,SpearmanRhoSIMD> (line 175) | class PermutationIndexIncrementalBin<float,SpearmanRhoSIMD>
    class PermutationIndexIncrementalBin<double,SpearmanRhoSIMD> (line 176) | class PermutationIndexIncrementalBin<double,SpearmanRhoSIMD>
    class PermutationIndexIncrementalBin<int,SpearmanRhoSIMD> (line 177) | class PermutationIndexIncrementalBin<int,SpearmanRhoSIMD>
    class PermutationIndexIncrementalBin<float,SpearmanFootruleSIMD> (line 178) | class PermutationIndexIncrementalBin<float,SpearmanFootruleSIMD>
    class PermutationIndexIncrementalBin<double,SpearmanFootruleSIMD> (line 179) | class PermutationIndexIncrementalBin<double,SpearmanFootruleSIMD>
    class PermutationIndexIncrementalBin<int,SpearmanFootruleSIMD> (line 180) | class PermutationIndexIncrementalBin<int,SpearmanFootruleSIMD>

FILE: algorithms/NMSLIB/code/src/method/perm_lsh_bin.cc
  type similarity (line 28) | namespace similarity {
    class PermutationIndexLSHBin<float> (line 162) | class PermutationIndexLSHBin<float>
    class PermutationIndexLSHBin<double> (line 163) | class PermutationIndexLSHBin<double>
    class PermutationIndexLSHBin<int> (line 164) | class PermutationIndexLSHBin<int>

FILE: algorithms/NMSLIB/code/src/method/permutation_inverted_index.cc
  type similarity (line 29) | namespace similarity {
    function string (line 132) | const string PermutationInvertedIndex<dist_t>::StrDesc() const {
    class PermutationInvertedIndex<float> (line 272) | class PermutationInvertedIndex<float>
    class PermutationInvertedIndex<double> (line 273) | class PermutationInvertedIndex<double>
    class PermutationInvertedIndex<int> (line 274) | class PermutationInvertedIndex<int>

FILE: algorithms/NMSLIB/code/src/method/permutation_prefix_index.cc
  type similarity (line 28) | namespace similarity {
    class PrefixNode (line 30) | class PrefixNode
    class PrefixNodeInternal (line 31) | class PrefixNodeInternal
      method PrefixNodeInternal (line 99) | PrefixNodeInternal() : num_objects_(0) {}
      method IsLeaf (line 107) | bool IsLeaf() const { return false; }
      method ChunkBuckets (line 109) | virtual void ChunkBuckets() {
      method Insert (line 113) | void Insert(const Permutation& perm,
      method GetNumberObjects (line 134) | size_t GetNumberObjects() const { return num_objects_; }
      method GetAllObjectsInThisSubTree (line 136) | void GetAllObjectsInThisSubTree(
      method PrefixNode (line 147) | const PrefixNode* SearchPath(const Permutation& perm,
    class PrefixNodeLeaf (line 32) | class PrefixNodeLeaf
      method PrefixNodeLeaf (line 54) | PrefixNodeLeaf() : bucket_(new ObjectVector()), CacheOptimizedBucket...
      method ChunkBuckets (line 57) | virtual void ChunkBuckets() {
      method IsLeaf (line 65) | bool IsLeaf() const { return true; }
      method Insert (line 67) | void Insert(const Permutation& perm,
      method GetNumberObjects (line 75) | size_t GetNumberObjects() const { return bucket_->size(); }
      method GetAllObjectsInThisSubTree (line 77) | void GetAllObjectsInThisSubTree(
      method PrefixNode (line 86) | const PrefixNode* SearchPath(const Permutation& perm,
    class PrefixNode (line 34) | class PrefixNode {
    class PrefixNodeLeaf (line 52) | class PrefixNodeLeaf : public PrefixNode {
      method PrefixNodeLeaf (line 54) | PrefixNodeLeaf() : bucket_(new ObjectVector()), CacheOptimizedBucket...
      method ChunkBuckets (line 57) | virtual void ChunkBuckets() {
      method IsLeaf (line 65) | bool IsLeaf() const { return true; }
      method Insert (line 67) | void Insert(const Permutation& perm,
      method GetNumberObjects (line 75) | size_t GetNumberObjects() const { return bucket_->size(); }
      method GetAllObjectsInThisSubTree (line 77) | void GetAllObjectsInThisSubTree(
      method PrefixNode (line 86) | const PrefixNode* SearchPath(const Permutation& perm,
    class PrefixNodeInternal (line 97) | class PrefixNodeInternal : public PrefixNode {
      method PrefixNodeInternal (line 99) | PrefixNodeInternal() : num_objects_(0) {}
      method IsLeaf (line 107) | bool IsLeaf() const { return false; }
      method ChunkBuckets (line 109) | virtual void ChunkBuckets() {
      method Insert (line 113) | void Insert(const Permutation& perm,
      method GetNumberObjects (line 134) | size_t GetNumberObjects() const { return num_objects_; }
      method GetAllObjectsInThisSubTree (line 136) | void GetAllObjectsInThisSubTree(
      method PrefixNode (line 147) | const PrefixNode* SearchPath(const Permutation& perm,
    class PrefixTree (line 167) | class PrefixTree {
      method PrefixTree (line 169) | PrefixTree() : root_(new PrefixNodeInternal) {}
      method ChunkBuckets (line 170) | void ChunkBuckets() { root_->ChunkBuckets(); }
      method Insert (line 174) | void Insert(const Permutation& perm,
      method FindCandidates (line 180) | void FindCandidates(const Permutation& perm_q,
    class PermutationPrefixIndex<float> (line 310) | class PermutationPrefixIndex<float>
    class PermutationPrefixIndex<double> (line 311) | class PermutationPrefixIndex<double>
    class PermutationPrefixIndex<int> (line 312) | class PermutationPrefixIndex<int>

FILE: algorithms/NMSLIB/code/src/method/pivot_neighb_invindx.cc
  type similarity (line 32) | namespace similarity {
    type IndexThreadParamsPNII (line 39) | struct IndexThreadParamsPNII {
      method IndexThreadParamsPNII (line 47) | IndexThreadParamsPNII(
    type IndexThreadPNII (line 65) | struct IndexThreadPNII {
    function string (line 292) | const string PivotNeighbInvertedIndex<dist_t>::StrDesc() const {
    class PivotNeighbInvertedIndex<float> (line 597) | class PivotNeighbInvertedIndex<float>
    class PivotNeighbInvertedIndex<double> (line 598) | class PivotNeighbInvertedIndex<double>
    class PivotNeighbInvertedIndex<int> (line 599) | class PivotNeighbInvertedIndex<int>

FILE: algorithms/NMSLIB/code/src/method/proj_vptree.cc
  type similarity (line 32) | namespace similarity {
    function Object (line 37) | Object* ProjectionVPTree<dist_t>::ProjectOneVect(size_t targSpaceId,
    class ProjectionVPTree<float> (line 247) | class ProjectionVPTree<float>
    class ProjectionVPTree<double> (line 248) | class ProjectionVPTree<double>
    class ProjectionVPTree<int> (line 249) | class ProjectionVPTree<int>

FILE: algorithms/NMSLIB/code/src/method/projection_index_incremental.cc
  class ProjectionIndexIncremental<float> (line 245) | class ProjectionIndexIncremental<float>
  class ProjectionIndexIncremental<double> (line 246) | class ProjectionIndexIncremental<double>
  class ProjectionIndexIncremental<int> (line 247) | class ProjectionIndexIncremental<int>

FILE: algorithms/NMSLIB/code/src/method/seqsearch.cc
  type similarity (line 25) | namespace similarity {
    type SearchThreadParamSeqSearch (line 28) | struct SearchThreadParamSeqSearch {
      method SearchThreadParamSeqSearch (line 34) | SearchThreadParamSeqSearch(
    type SearchThreadSeqSearch (line 47) | struct SearchThreadSeqSearch {
    class SeqSearch<float> (line 181) | class SeqSearch<float>
    class SeqSearch<double> (line 182) | class SeqSearch<double>
    class SeqSearch<int> (line 183) | class SeqSearch<int>

FILE: algorithms/NMSLIB/code/src/method/small_world_rand.cc
  type similarity (line 40) | namespace similarity {
    type IndexThreadParamsSW (line 45) | struct IndexThreadParamsSW {
      method IndexThreadParamsSW (line 55) | IndexThreadParamsSW(
    type IndexThreadSW (line 77) | struct IndexThreadSW {
    function MSWNode (line 203) | MSWNode* SmallWorldRand<dist_t>::getRandomEntryPointLocked() const
    function MSWNode (line 219) | MSWNode* SmallWorldRand<dist_t>::getRandomEntryPoint() const {
    class SmallWorldRand<float> (line 743) | class SmallWorldRand<float>
    class SmallWorldRand<double> (line 744) | class SmallWorldRand<double>
    class SmallWorldRand<int> (line 745) | class SmallWorldRand<int>

FILE: algorithms/NMSLIB/code/src/method/small_world_rand_split.cc
  type similarity (line 37) | namespace similarity {
    type IndexThreadParamsSplitSW (line 42) | struct IndexThreadParamsSplitSW {
      method IndexThreadParamsSplitSW (line 55) | IndexThreadParamsSplitSW(
    type IndexThreadSplitSW (line 82) | struct IndexThreadSplitSW {
    class SmallWorldRandSplit<float> (line 635) | class SmallWorldRandSplit<float>
    class SmallWorldRandSplit<double> (line 636) | class SmallWorldRandSplit<double>
    class SmallWorldRandSplit<int> (line 637) | class SmallWorldRandSplit<int>

FILE: algorithms/NMSLIB/code/src/method/spatial_approx_tree.cc
  type similarity (line 28) | namespace similarity {
    type SpatialApproxTree<dist_t>::SATKnn (line 31) | struct SpatialApproxTree<dist_t>::SATKnn {
      method SATKnn (line 37) | SATKnn() : lbound(0), mind(0), dist_qp(0), node(NULL) {}
      method SATKnn (line 38) | SATKnn(dist_t lbound, dist_t mind, dist_t dist_qp, SATNode* node)
    class SpatialApproxTree<dist_t>::SATNode (line 47) | class SpatialApproxTree<dist_t>::SATNode {
    function string (line 187) | const string SpatialApproxTree<dist_t>::StrDesc() const {
    class SpatialApproxTree<double> (line 248) | class SpatialApproxTree<double>
    class SpatialApproxTree<float> (line 249) | class SpatialApproxTree<float>
    class SpatialApproxTree<int> (line 250) | class SpatialApproxTree<int>

FILE: algorithms/NMSLIB/code/src/method/vptree.cc
  type similarity (line 31) | namespace similarity {
    class VPTree<float, PolynomialPruner<float> > (line 256) | class VPTree<float, PolynomialPruner<float> >
    class VPTree<double, PolynomialPruner<double> > (line 257) | class VPTree<double, PolynomialPruner<double> >
    class VPTree<int, PolynomialPruner<int> > (line 258) | class VPTree<int, PolynomialPruner<int> >

FILE: algorithms/NMSLIB/code/src/params.cc
  type similarity (line 31) | namespace similarity {
    function ParseSpaceArg (line 36) | void ParseSpaceArg(const string& descStr, string& SpaceType, vector<st...
    function ParseArg (line 52) | void ParseArg(const string& descStr, vector<string>& vDesc) {

FILE: algorithms/NMSLIB/code/src/params_cmdline.cc
  type similarity (line 33) | namespace similarity {
    function Usage (line 40) | static void Usage(const char *prog,
    function ParseCommandLine (line 46) | void ParseCommandLine(int argc, char* argv[], bool& bPrintProgress,

FILE: algorithms/NMSLIB/code/src/projection.cc
  type similarity (line 30) | namespace similarity {
    class ProjectionVectDense (line 40) | class ProjectionVectDense : public Projection<dist_t> {
      method compProj (line 42) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionVectDense (line 57) | ProjectionVectDense(const Space<dist_t>& space, size_t nDstDim) :
    class ProjectionRand (line 72) | class ProjectionRand : public Projection<dist_t> {
      method compProj (line 74) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionRand (line 103) | ProjectionRand(const Space<dist_t>& space, const ObjectVector& data,
    class ProjectionRandRefPoint (line 135) | class ProjectionRandRefPoint : public Projection<dist_t> {
      method compProj (line 137) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionRandRefPoint (line 149) | ProjectionRandRefPoint(const Space<dist_t>& space,
    class ProjectionPermutation (line 176) | class ProjectionPermutation : public Projection<dist_t> {
      method compProj (line 178) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionPermutation (line 198) | ProjectionPermutation(const Space<dist_t>& space,
    class ProjectionPermutationTrunc (line 211) | class ProjectionPermutationTrunc : public Projection<dist_t> {
      method compProj (line 213) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionPermutationTrunc (line 233) | ProjectionPermutationTrunc(const Space<dist_t>& space,
    class ProjectionPermutationBin (line 250) | class ProjectionPermutationBin : public Projection<dist_t> {
      method compProj (line 252) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionPermutationBin (line 273) | ProjectionPermutationBin(const Space<dist_t>& space,
    class ProjectionFastMap (line 298) | class ProjectionFastMap : public Projection<dist_t> {
      method compProj (line 300) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionFastMap (line 323) | ProjectionFastMap(const Space<dist_t>& space,
    class ProjectionNone (line 362) | class ProjectionNone : public Projection<dist_t> {
      method compProj (line 364) | virtual void compProj(const Query<dist_t>* pQuery,
      method ProjectionNone (line 390) | ProjectionNone(const Space<dist_t>& space, const ObjectVector& data,
    class Projection<float> (line 457) | class Projection<float>
    class Projection<double> (line 458) | class Projection<double>
    class Projection<int> (line 459) | class Projection<int>
    class ProjectionRand<float> (line 461) | class ProjectionRand<float>
    class ProjectionRand<double> (line 462) | class ProjectionRand<double>
    class ProjectionRand<int> (line 463) | class ProjectionRand<int>
    class ProjectionRandRefPoint<float> (line 465) | class ProjectionRandRefPoint<float>
    class ProjectionRandRefPoint<double> (line 466) | class ProjectionRandRefPoint<double>
    class ProjectionRandRefPoint<int> (line 467) | class ProjectionRandRefPoint<int>
    class ProjectionPermutation<float> (line 469) | class ProjectionPermutation<float>
    class ProjectionPermutation<double> (line 470) | class ProjectionPermutation<double>
    class ProjectionPermutation<int> (line 471) | class ProjectionPermutation<int>
    class ProjectionFastMap<float> (line 473) | class ProjectionFastMap<float>
    class ProjectionFastMap<double> (line 474) | class ProjectionFastMap<double>
    class ProjectionFastMap<int> (line 475) | class ProjectionFastMap<int>
    class ProjectionNone<float> (line 477) | class ProjectionNone<float>
    class ProjectionNone<double> (line 478) | class ProjectionNone<double>
    class ProjectionNone<int> (line 479) | class ProjectionNone<int>

FILE: algorithms/NMSLIB/code/src/query.cc
  type similarity (line 25) | namespace similarity {
    function Object (line 39) | const Object* Query<dist_t>::QueryObject() const {
    function dist_t (line 54) | dist_t Query<dist_t>::Distance(
    function dist_t (line 62) | dist_t Query<dist_t>::DistanceObjLeft(const Object* object) const {
    function dist_t (line 67) | dist_t Query<dist_t>::DistanceObjRight(const Object* object) const {
    class Query<float> (line 71) | class Query<float>
    class Query<double> (line 72) | class Query<double>
    class Query<int> (line 73) | class Query<int>
    class Query<short int> (line 74) | class Query<short int>

FILE: algorithms/NMSLIB/code/src/randproj_util.cc
  type similarity (line 27) | namespace similarity {
    function initRandProj (line 31) | void initRandProj(size_t nSrcDim, size_t nDstDim,
    function compRandProj (line 86) | void compRandProj(const vector<vector<dist_t>>& projMatr,

FILE: algorithms/NMSLIB/code/src/rangequery.cc
  type similarity (line 27) | namespace similarity {
    function ObjectVector (line 40) | const ObjectVector* RangeQuery<dist_t>::Result() const {
    function dist_t (line 54) | dist_t RangeQuery<dist_t>::Radius() const {
    class RangeQuery<float> (line 117) | class RangeQuery<float>
    class RangeQuery<double> (line 118) | class RangeQuery<double>
    class RangeQuery<int> (line 119) | class RangeQuery<int>
    class RangeQuery<short int> (line 120) | class RangeQuery<short int>

FILE: algorithms/NMSLIB/code/src/searchoracle.cc
  type similarity (line 27) | namespace similarity {
    class PolynomialPruner<int> (line 294) | class PolynomialPruner<int>
    class PolynomialPruner<float> (line 295) | class PolynomialPruner<float>
    class PolynomialPruner<double> (line 296) | class PolynomialPruner<double>

FILE: algorithms/NMSLIB/code/src/space.cc
  type similarity (line 19) | namespace similarity {
    class Space<int> (line 60) | class Space<int>
    class Space<float> (line 61) | class Space<float>
    class Space<double> (line 62) | class Space<double>

FILE: algorithms/NMSLIB/code/src/space/space_bit_hamming.cc
  type similarity (line 29) | namespace similarity {
    function Object (line 77) | Object* SpaceBitHamming::CreateObjFromBitMaskVect(IdType id, LabelType...
    function Object (line 117) | Object* SpaceBitHamming::CreateObjFromVectInternal(IdType id, LabelTyp...
    function string (line 142) | string SpaceBitHamming::CreateStrFromObj(const Object* pObj, const str...

FILE: algorithms/NMSLIB/code/src/space/space_bregman.cc
  type similarity (line 27) | namespace similarity {
    function Object (line 30) | Object* BregmanDiv<dist_t>::Mean(const ObjectVector& data) const {
    function dist_t (line 63) | dist_t KLDivAbstract<dist_t>::Function(const Object* object) const {
    function Object (line 76) | Object* KLDivAbstract<dist_t>::GradientFunction(const Object* object) ...
    function Object (line 91) | Object* KLDivAbstract<dist_t>::InverseGradientFunction(const Object* o...
    function Object (line 108) | Object* KLDivGenFast<dist_t>::Mean(const ObjectVector& data) const {
    function Object (line 123) | Object* KLDivGenFast<dist_t>::InverseGradientFunction(const Object* ob...
    function dist_t (line 134) | dist_t KLDivGenFast<dist_t>::HiddenDistance(const Object* obj1, const ...
    function Object (line 146) | Object* KLDivGenFast<dist_t>::CreateObjFromVect(IdType id, LabelType l...
    function Object (line 160) | Object* ItakuraSaitoFast<dist_t>::Mean(const ObjectVector& data) const {
    function dist_t (line 175) | dist_t ItakuraSaitoFast<dist_t>::Function(const Object* object) const {
    function Object (line 188) | Object* ItakuraSaitoFast<dist_t>::GradientFunction(const Object* objec...
    function Object (line 203) | Object* ItakuraSaitoFast<dist_t>::InverseGradientFunction(const Object...
    function dist_t (line 218) | dist_t ItakuraSaitoFast<dist_t>::HiddenDistance(const Object* obj1, co...
    function Object (line 230) | Object* ItakuraSaitoFast<dist_t>::CreateObjFromVect(IdType id, LabelTy...
    function dist_t (line 243) | dist_t KLDivGenSlow<dist_t>::HiddenDistance(const Object* obj1, const ...
    function Object (line 255) | Object* KLDivGenSlow<dist_t>::CreateObjFromVect(IdType id, LabelType l...
    function dist_t (line 260) | dist_t KLDivGenFastRightQuery<dist_t>::HiddenDistance(const Object* ob...
    function Object (line 272) | Object* KLDivGenFastRightQuery<dist_t>::CreateObjFromVect(IdType id, L...
    function dist_t (line 285) | dist_t KLDivFast<dist_t>::HiddenDistance(const Object* obj1, const Obj...
    function Object (line 297) | Object* KLDivFast<dist_t>::CreateObjFromVect(IdType id, LabelType labe...
    function dist_t (line 310) | dist_t KLDivFastRightQuery<dist_t>::HiddenDistance(const Object* obj1,...
    function Object (line 322) | Object* KLDivFastRightQuery<dist_t>::CreateObjFromVect(IdType id, Labe...
    class BregmanDiv<float> (line 332) | class BregmanDiv<float>
    class BregmanDiv<double> (line 333) | class BregmanDiv<double>
    class KLDivAbstract<float> (line 334) | class KLDivAbstract<float>
    class KLDivAbstract<double> (line 335) | class KLDivAbstract<double>
    class KLDivGenSlow<float> (line 336) | class KLDivGenSlow<float>
    class KLDivGenSlow<double> (line 337) | class KLDivGenSlow<double>
    class KLDivGenFast<float> (line 338) | class KLDivGenFast<float>
    class KLDivGenFast<double> (line 339) | class KLDivGenFast<double>
    class ItakuraSaitoFast<float> (line 340) | class ItakuraSaitoFast<float>
    class ItakuraSaitoFast<double> (line 341) | class ItakuraSaitoFast<double>
    class KLDivGenFastRightQuery<float> (line 342) | class KLDivGenFastRightQuery<float>
    class KLDivGenFastRightQuery<double> (line 343) | class KLDivGenFastRightQuery<double>
    class KLDivFast<float> (line 344) | class KLDivFast<float>
    class KLDivFast<double> (line 345) | class KLDivFast<double>
    class KLDivFastRightQuery<float> (line 346) | class KLDivFastRightQuery<float>
    class KLDivFastRightQuery<double> (line 347) | class KLDivFastRightQuery<double>

FILE: algorithms/NMSLIB/code/src/space/space_dummy.cc
  type similarity (line 25) | namespace similarity {
    function dist_t (line 28) | dist_t SpaceDummy<dist_t>::HiddenDistance(const Object* obj1, const Ob...
    function string (line 65) | string SpaceDummy<dist_t>::CreateStrFromObj(const Object* pObj, const ...
    class SpaceDummy<int> (line 92) | class SpaceDummy<int>
    class SpaceDummy<float> (line 93) | class SpaceDummy<float>
    class SpaceDummy<double> (line 94) | class SpaceDummy<double>

FILE: algorithms/NMSLIB/code/src/space/space_js.cc
  type similarity (line 27) | namespace similarity {
    function Object (line 30) | Object* SpaceJSBase<dist_t>::CreateObjFromVect(IdType id, LabelType la...
    function dist_t (line 45) | dist_t SpaceJSBase<dist_t>::JensenShannonFunc(const Object* obj1, cons...
    class SpaceJSBase<float> (line 70) | class SpaceJSBase<float>
    class SpaceJSBase<double> (line 71) | class SpaceJSBase<double>
    class SpaceJSDiv<float> (line 73) | class SpaceJSDiv<float>
    class SpaceJSDiv<double> (line 74) | class SpaceJSDiv<double>
    class SpaceJSMetric<float> (line 76) | class SpaceJSMetric<float>
    class SpaceJSMetric<double> (line 77) | class SpaceJSMetric<double>

FILE: algorithms/NMSLIB/code/src/space/space_lp.cc
  type similarity (line 26) | namespace similarity {
    function dist_t (line 29) | dist_t SpaceLp<dist_t>::HiddenDistance(const Object* obj1, const Objec...
    class SpaceLp<float> (line 46) | class SpaceLp<float>
    class SpaceLp<double> (line 47) | class SpaceLp<double>

FILE: algorithms/NMSLIB/code/src/space/space_scalar.cc
  type similarity (line 26) | namespace similarity {
    function dist_t (line 29) | dist_t SpaceCosineSimilarity<dist_t>::HiddenDistance(const Object* obj...
    class SpaceCosineSimilarity<float> (line 42) | class SpaceCosineSimilarity<float>
    class SpaceCosineSimilarity<double> (line 43) | class SpaceCosineSimilarity<double>
    function dist_t (line 46) | dist_t SpaceAngularDistance<dist_t>::HiddenDistance(const Object* obj1...
    class SpaceAngularDistance<float> (line 59) | class SpaceAngularDistance<float>
    class SpaceAngularDistance<double> (line 60) | class SpaceAngularDistance<double>

FILE: algorithms/NMSLIB/code/src/space/space_sparse_lp.cc
  type similarity (line 28) | namespace similarity {
    function dist_t (line 31) | dist_t SpaceSparseLp<dist_t>::HiddenDistance(const Object* obj1, const...
    class SpaceSparseLp<float> (line 42) | class SpaceSparseLp<float>
    class SpaceSparseLp<double> (line 43) | class SpaceSparseLp<double>

FILE: algorithms/NMSLIB/code/src/space/space_sparse_scalar_fast.cc
  type similarity (line 30) | namespace similarity {

FILE: algorithms/NMSLIB/code/src/space/space_sparse_vector.cc
  type similarity (line 31) | namespace similarity {
    function string (line 121) | string SpaceSparseVector<dist_t>::CreateStrFromObj(const Object* pObj,...
    class SpaceSparseVector<float> (line 158) | class SpaceSparseVector<float>
    class SpaceSparseVector<double> (line 159) | class SpaceSparseVector<double>
    class SpaceSparseVectorSimpleStorage<float> (line 161) | class SpaceSparseVectorSimpleStorage<float>
    class SpaceSparseVectorSimpleStorage<double> (line 162) | class SpaceSparseVectorSimpleStorage<double>

FILE: algorithms/NMSLIB/code/src/space/space_sparse_vector_inter.cc
  type similarity (line 28) | namespace similarity {
    function Object (line 54) | Object* SpaceSparseVectorInter<dist_t>::CreateObjFromVect(IdType id, L...
    class SpaceSparseVectorInter<float> (line 67) | class SpaceSparseVectorInter<float>
    class SpaceSparseVectorInter<double> (line 68) | class SpaceSparseVectorInter<double>

FILE: algorithms/NMSLIB/code/src/space/space_sqfd.cc
  type similarity (line 34) | namespace similarity {
    type DataFileInputStateSQFD (line 51) | struct DataFileInputStateSQFD : public DataFileInputStateOneFile {
      method DataFileInputStateSQFD (line 52) | DataFileInputStateSQFD(const string& inpFileName) :
    function string (line 133) | string SpaceSqfd<dist_t>::CreateStrFromObj(const Object* pObj, const s...
    function dist_t (line 283) | dist_t SpaceSqfd<dist_t>::HiddenDistance(
    function string (line 335) | string SpaceSqfd<dist_t>::StrDesc() const {
    class SpaceSqfd<float> (line 341) | class SpaceSqfd<float>
    class SpaceSqfd<double> (line 342) | class SpaceSqfd<double>

FILE: algorithms/NMSLIB/code/src/space/space_string.cc
  type similarity (line 28) | namespace similarity {
    function string (line 65) | string StringSpace<dist_t>::CreateStrFromObj(const Object* pObj, const...
    class StringSpace<int> (line 94) | class StringSpace<int>
    class StringSpace<float> (line 96) | class StringSpace<float>
    class StringSpace<double> (line 97) | class StringSpace<double>

FILE: algorithms/NMSLIB/code/src/space/space_vector.cc
  type similarity (line 33) | namespace similarity {
    function string (line 95) | string VectorSpace<dist_t>::CreateStrFromObj(const Object* pObj, const...
    function Object (line 148) | Object* VectorSpace<dist_t>::CreateObjFromVect(IdType id, LabelType la...
    class VectorSpace<PivotIdType> (line 156) | class VectorSpace<PivotIdType>
    class VectorSpace<float> (line 157) | class VectorSpace<float>
    class VectorSpace<double> (line 158) | class VectorSpace<double>

FILE: algorithms/NMSLIB/code/src/space/space_word_embed.cc
  type similarity (line 34) | namespace similarity {
    function string (line 41) | string WordEmbedSpace<dist_t>::CreateStrFromObj(const Object* pObj, co...
    function string (line 76) | string WordEmbedSpace<dist_t>::StrDesc() const {
    function dist_t (line 90) | dist_t WordEmbedSpace<dist_t>::HiddenDistance(const Object* obj1, cons...
    class WordEmbedSpace<float> (line 108) | class WordEmbedSpace<float>
    class WordEmbedSpace<double> (line 109) | class WordEmbedSpace<double>

FILE: algorithms/NMSLIB/code/src/tune_vptree.cc
  function Usage (line 66) | static void Usage(const char *prog,
  function RunExper (line 73) | void RunExper(unsigned AddRestartQty,
  function ParseCommandLineForTuning (line 272) | void ParseCommandLineForTuning(int argc, char*argv[],
  function main (line 417) | int main(int ac, char* av[]) {

FILE: algorithms/NMSLIB/code/src/utils.cc
  type similarity (line 41) | namespace similarity {
    function DoesFileExist (line 53) | bool DoesFileExist(const char *filename) {
    function RStrip (line 61) | void RStrip(char* str) {
    function Mean (line 68) | double Mean(const double* array, const unsigned size) {
    function Variance (line 75) | double Variance(const double* array, const unsigned size, const double...
    function Variance (line 85) | double Variance(const double* array, const unsigned size) {
    function StdDev (line 89) | double StdDev(const double* array, const unsigned size) {
    function ApproxEqualOther (line 137) | inline bool ApproxEqualOther(const T& x, const T& y, unsigned maxUlps) {

FILE: algorithms/NMSLIB/code/test/bench_distfunc.cc
  type similarity (line 44) | namespace similarity {
    function Normalize (line 51) | inline void Normalize(T* pVect, size_t qty) {
    function GenRandVect (line 65) | inline void GenRandVect(T* pVect, size_t qty, T MinElem = T(0), T MaxE...
    function GenRandIntVect (line 78) | inline void GenRandIntVect(int* pVect, size_t qty) {
    function SetRandZeros (line 85) | inline void SetRandZeros(T* pVect, size_t qty, double pZero) {
    function GenSparseVectZipf (line 111) | void GenSparseVectZipf(size_t maxSize, vector<SparseVectElem<dist_t>>&...
    function TestLInfNormStandard (line 125) | void TestLInfNormStandard(size_t N, size_t dim, size_t Rep) {
    function TestLInfNorm (line 162) | void TestLInfNorm(size_t N, size_t dim, size_t Rep) {
    function TestLInfNormSIMD (line 199) | void TestLInfNormSIMD(size_t N, size_t dim, size_t Rep) {
    function TestL1NormStandard (line 237) | void TestL1NormStandard(size_t N, size_t dim, size_t Rep) {
    function TestL1Norm (line 274) | void TestL1Norm(size_t N, size_t dim, size_t Rep) {
    function TestL1NormSIMD (line 311) | void TestL1NormSIMD(size_t N, size_t dim, size_t Rep) {
    function TestL2NormStandard (line 348) | void TestL2NormStandard(size_t N, size_t dim, size_t Rep) {
    function TestL2Norm (line 385) | void TestL2Norm(size_t N, size_t dim, size_t Rep) {
    function TestL2NormSIMD (line 422) | void TestL2NormSIMD(size_t N, size_t dim, size_t Rep) {
    function TestLPGeneric (line 460) | void TestLPGeneric(size_t N, size_t dim, size_t Rep, T power) {
    function TestLPGenericOptim (line 498) | void TestLPGenericOptim(size_t N, size_t dim, size_t Rep, T power) {
    function TestItakuraSaitoPrecomp (line 536) | void TestItakuraSaitoPrecomp(size_t N, size_t dim, size_t Rep) {
    function TestItakuraSaitoPrecompSIMD (line 575) | void TestItakuraSaitoPrecompSIMD(size_t N, size_t dim, size_t Rep) {
    function TestItakuraSaitoStandard (line 614) | void TestItakuraSaitoStandard(size_t N, size_t dim, size_t Rep) {
    function TestKLPrecomp (line 653) | void TestKLPrecomp(size_t N, size_t dim, size_t Rep) {
    function TestKLPrecompSIMD (line 692) | void TestKLPrecompSIMD(size_t N, size_t dim, size_t Rep) {
    function TestKLStandard (line 731) | void TestKLStandard(size_t N, size_t dim, size_t Rep) {
    function TestKLGeneralPrecomp (line 770) | void TestKLGeneralPrecomp(size_t N, size_t dim, size_t Rep) {
    function TestKLGeneralPrecompSIMD (line 809) | void TestKLGeneralPrecompSIMD(size_t N, size_t dim, size_t Rep) {
    function TestKLGeneralStandard (line 848) | void TestKLGeneralStandard(size_t N, size_t dim, size_t Rep) {
    function TestJSStandard (line 886) | void TestJSStandard(size_t N, size_t dim, size_t Rep, float pZero) {
    function TestJSPrecomp (line 926) | void TestJSPrecomp(size_t N, size_t dim, size_t Rep, float pZero) {
    function TestJSPrecompApproxLog (line 966) | void TestJSPrecompApproxLog(size_t N, size_t dim, size_t Rep, float pZ...
    function TestJSPrecompSIMDApproxLog (line 1006) | void TestJSPrecompSIMDApproxLog(size_t N, size_t dim, size_t Rep, floa...
    function TestSpearmanRho (line 1045) | void TestSpearmanRho(size_t N, size_t dim, size_t Rep) {
    function TestSpearmanRhoSIMD (line 1082) | void TestSpearmanRhoSIMD(size_t N, size_t dim, size_t Rep) {
    function TestSpearmanFootrule (line 1119) | void TestSpearmanFootrule(size_t N, size_t dim, size_t Rep) {
    function TestSpearmanFootruleSIMD (line 1156) | void TestSpearmanFootruleSIMD(size_t N, size_t dim, size_t Rep) {
    function TestSQFDGeneric (line 1196) | void TestSQFDGeneric(size_t N, size_t Rep, SqfdFunction<T>& func) {
    function TestSQFDMinus (line 1237) | void TestSQFDMinus(size_t N, size_t Rep) {
    function TestSQFDHeuristic (line 1243) | void TestSQFDHeuristic(size_t N, size_t Rep) {
    function TestSQFDGaussian (line 1249) | void TestSQFDGaussian(size_t N, size_t Rep) {
    function TestLevenshtein (line 1256) | void TestLevenshtein(size_t N, size_t Rep) {
    function TestSparseLp (line 1295) | void TestSparseLp(size_t N, size_t Rep, T power) {
    function TestSparseAngularDistance (line 1334) | void TestSparseAngularDistance(const string& dataFile, size_t N, size_...
    function TestSparseCosineSimilarityFast (line 1373) | void TestSparseCosineSimilarityFast(const string& dataFile, size_t N, ...
    function TestSparseAngularDistanceFast (line 1414) | void TestSparseAngularDistanceFast(const string& dataFile, size_t N, s...
    function TestSparseCosineSimilarity (line 1457) | void TestSparseCosineSimilarity(const string& dataFile, size_t N, size...
    function TestScalarProduct (line 1497) | void TestScalarProduct(size_t N, size_t dim, size_t Rep) {
    function TestScalarProductSIMD (line 1534) | void TestScalarProductSIMD(size_t N, size_t dim, size_t Rep) {
    function TestNormScalarProduct (line 1571) | void TestNormScalarProduct(size_t N, size_t dim, size_t Rep) {
    function TestNormScalarProductSIMD (line 1608) | void TestNormScalarProductSIMD(size_t N, size_t dim, size_t Rep) {
    function TestCosineSimilarity (line 1645) | void TestCosineSimilarity(size_t N, size_t dim, size_t Rep) {
    function TestAngularDistance (line 1682) | void TestAngularDistance(size_t N, size_t dim, size_t Rep) {
    function TestBitHamming (line 1718) | void TestBitHamming(size_t N, size_t dim, size_t Rep) {
  function main (line 1767) | int main(int argc, char* argv[]) {

FILE: algorithms/NMSLIB/code/test/bench_projection.cc
  function Usage (line 34) | static void Usage(const char *prog,
  function benchProjection (line 41) | void benchProjection(size_t repeatQty,
  function main (line 194) | int main(int argc, char *argv[]) {

FILE: algorithms/NMSLIB/code/test/bunit.cc
  type similarity (line 24) | namespace similarity {
    function TestRunner (line 26) | TestRunner& TestRunner::Instance() {
  function main (line 92) | int main(int argc, char *argv[]) {

FILE: algorithms/NMSLIB/code/test/bunit.h
  function namespace (line 34) | namespace similarity {

FILE: algorithms/NMSLIB/code/test/genrand_vect.h
  function namespace (line 21) | namespace similarity {
  function GenRandIntVect (line 51) | inline void GenRandIntVect(int* pVect, size_t qty) {
  function SetRandZeros (line 58) | void SetRandZeros(T* pVect, size_t qty, double pZero) {

FILE: algorithms/NMSLIB/code/test/report_intr_dim.cc
  function Usage (line 35) | static void Usage(const char *prog,
  function ComputeMuDeffect (line 42) | void ComputeMuDeffect(const Space<dist_t>& space,
  function TestSpace (line 83) | void TestSpace(
  function main (line 118) | int main(int argc, char* argv[]) {

FILE: algorithms/NMSLIB/code/test/test_clust.cc
  function Usage (line 88) | static void Usage(const char *prog,
  function RunExper (line 95) | void RunExper(
  function ParseCommandLineForClustering (line 152) | void ParseCommandLineForClustering(int argc, char*argv[],
  function main (line 238) | int main(int argc, char* argv[]) {

FILE: algorithms/NMSLIB/code/test/test_distfunc.cc
  function TEST (line 65) | TEST(Platform64) {
  function checkElemVectEq (line 70) | bool checkElemVectEq(const vector<SparseVectElem<dist_t>>& source,
  function TestSparsePackUnpack (line 81) | void TestSparsePackUnpack() {
  function TEST (line 116) | TEST(BlockZeros) {
  function TEST (line 128) | TEST(SparsePackUnpack) {
  function TEST (line 134) | TEST(TestEfficientPower) {
  function TEST (line 145) | TEST(TestEfficientFract) {
  function TestScalarProductAgree (line 164) | bool TestScalarProductAgree(size_t N, size_t dim, size_t Rep) {
  function TestNormScalarProductAgree (line 196) | bool TestNormScalarProductAgree(size_t N, size_t dim, size_t Rep) {
  function TestLInfAgree (line 229) | bool TestLInfAgree(size_t N, size_t dim, size_t Rep) {
  function TestL1Agree (line 262) | bool TestL1Agree(size_t N, size_t dim, size_t Rep) {
  function TestL2Agree (line 294) | bool TestL2Agree(size_t N, size_t dim, size_t Rep) {
  function TestItakuraSaitoAgree (line 327) | bool TestItakuraSaitoAgree(size_t N, size_t dim, size_t Rep) {
  function TestKLAgree (line 376) | bool TestKLAgree(size_t N, size_t dim, size_t Rep) {
  function TestKLGeneralAgree (line 438) | bool TestKLGeneralAgree(size_t N, size_t dim, size_t Rep) {
  function TestJSAgree (line 484) | bool TestJSAgree(size_t N, size_t dim, size_t Rep, double pZero) {
  function TestSpearmanFootruleAgree (line 558) | bool TestSpearmanFootruleAgree(size_t N, size_t dim, size_t Rep) {
  function TestSpearmanRhoAgree (line 587) | bool TestSpearmanRhoAgree(size_t N, size_t dim, size_t Rep) {
  function TestLPGenericAgree (line 617) | bool TestLPGenericAgree(size_t N, size_t dim, size_t Rep, T power) {
  function TestBitHammingAgree (line 673) | bool TestBitHammingAgree(size_t N, size_t dim, size_t Rep) {
  function TestSparseAngularDistanceAgree (line 718) | bool TestSparseAngularDistanceAgree(const string& dataFile, size_t N, si...
  function TestSparseCosineSimilarityAgree (line 767) | bool TestSparseCosineSimilarityAgree(const string& dataFile, size_t N, s...
  function TEST (line 815) | TEST(DISABLE_TestAgree) {

FILE: algorithms/NMSLIB/code/test/test_editdist.cc
  type similarity (line 24) | namespace similarity {
    class ShortStringDataSet (line 37) | class ShortStringDataSet : public TestDataset {
      method ShortStringDataSet (line 39) | ShortStringDataSet(SpaceLevenshtein& space) {
    function TEST (line 48) | TEST(EditDistanceShort) {
    class LongStringDataSet (line 93) | class LongStringDataSet : public TestDataset {
      method LongStringDataSet (line 95) | LongStringDataSet(SpaceLevenshtein& space) {
    function TEST (line 106) | TEST(EditDistanceLong) {

FILE: algorithms/NMSLIB/code/test/test_eval.cc
  type similarity (line 28) | namespace similarity {
    function testMetric (line 31) | void testMetric(
    function TEST (line 67) | TEST(TestRecallDouble) {
    function TEST (line 101) | TEST(TestRecallFloat) {
    function TEST (line 134) | TEST(TestRecallInt) {
    function TEST (line 167) | TEST(TestNumCloserDouble) {
    function TEST (line 200) | TEST(TestNumCloserFloat) {
    function TEST (line 233) | TEST(TestNumCloserInt) {
    function TEST (line 266) | TEST(TestRelPosErrorDouble) {
    function TEST (line 302) | TEST(TestRelPosErrorFloat) {
    function TEST (line 338) | TEST(TestRelPosErrorInt) {
    function TEST (line 371) | TEST(TestPrecisionOfApproxDouble) {
    function TEST (line 404) | TEST(TestPrecisionOfApproxFloat) {
    function TEST (line 437) | TEST(TestPrecisionOfApproxInt) {
    function testResultEntryIO (line 468) | void testResultEntryIO(string fileName, const vector<ResultEntry<dist_...
    function TEST (line 492) | TEST(TestResultEntryIntIO) {
    function TEST (line 503) | TEST(TestResultEntryFloatIO) {
    function TEST (line 513) | TEST(TestResultEntryDoubleIO) {

FILE: algorithms/NMSLIB/code/test/test_fp.cc
  type similarity (line 25) | namespace similarity {
    function testEqualInt (line 28) | void testEqualInt(dist_t num1, dist_t num2) {
    function testNotEqualInt (line 33) | void testNotEqualInt(dist_t num1, dist_t num2) {
    function testEqualFP (line 38) | void testEqualFP(dist_t baseNum, float epsFact) {
    function testNotEqualFP (line 44) | void testNotEqualFP(dist_t baseNum, float epsFact) {
    function TEST (line 49) | TEST(FP_Char1) {
    function TEST (line 53) | TEST(FP_Char2) {
    function TEST (line 57) | TEST(FP_Char3) {
    function TEST (line 61) | TEST(FP_Char4) {
    function TEST (line 65) | TEST(FP_Short1) {
    function TEST (line 69) | TEST(FP_Short2) {
    function TEST (line 73) | TEST(FP_Short3) {
    function TEST (line 77) | TEST(FP_Short4) {
    function TEST (line 81) | TEST(FP_Int1) {
    function TEST (line 85) | TEST(FP_Int2) {
    function TEST (line 89) | TEST(FP_Int3) {
    function TEST (line 93) | TEST(FP_Int4) {
    function TEST (line 97) | TEST(FP_Unsigned1) {
    function TEST (line 101) | TEST(FP_Unsigned2) {
    function TEST (line 105) | TEST(FP_Unsigned3) {
    function TEST (line 109) | TEST(FP_Float1) {
    function TEST (line 116) | TEST(FP_Float2) {
    function TEST (line 122) | TEST(FP_Float3) {
    function TEST (line 128) | TEST(FP_Float4) {
    function TEST (line 132) | TEST(FP_Float5) {
    function TEST (line 136) | TEST(FP_Double1) {
    function TEST (line 143) | TEST(FP_Double2) {
    function TEST (line 149) | TEST(FP_Double3) {
    function TEST (line 155) | TEST(FP_Double4) {
    function TEST (line 159) | TEST(FP_Double5) {
    function TEST (line 163) | TEST(FP_LongDouble1) {
    function TEST (line 169) | TEST(FP_LongDouble2) {
    function TEST (line 175) | TEST(FP_LongDouble3) {
    function TEST (line 181) | TEST(FP_LongDouble4) {
    function TEST (line 187) | TEST(FP_NANFloat) {
    function TEST (line 193) | TEST(FP_NANDouble) {
    function TEST (line 199) | TEST(FP_NANLongDouble) {
    function TEST (line 205) | TEST(FP_ZEROFloat) {
    function TEST (line 215) | TEST(FP_ZERODouble) {
    function TEST (line 225) | TEST(FP_ZEROLongDouble) {

FILE: algorithms/NMSLIB/code/test/test_integr.cc
  function main (line 293) | int main(int ac, char* av[]) {

FILE: algorithms/NMSLIB/code/test/test_integr_util.h
  type MethodTestCase (line 47) | struct MethodTestCase {
  function string (line 191) | inline string getFirstParam(const string& paramDef) {
  function string (line 205) | inline string quoteEmpty(const string& str) {
  function string (line 209) | string CreateCmdStr(
  function RunOneTest (line 503) | inline bool RunOneTest(const vector<MethodTestCase>& vTestCases,

FILE: algorithms/NMSLIB/code/test/test_lpnorm.cc
  type similarity (line 23) | namespace similarity {
    class VectorDataset1 (line 27) | class VectorDataset1 : public TestDataset {
      method VectorDataset1 (line 29) | VectorDataset1() {
    function TEST (line 48) | TEST(EuclideanDistance) {
    function TEST (line 72) | TEST(ManhattanDistance) {
    function TEST (line 96) | TEST(ChebyshevDistance) {

FILE: algorithms/NMSLIB/code/test/test_object.cc
  type similarity (line 25) | namespace similarity {
    function TEST (line 27) | TEST(Object) {
    function TEST (line 49) | TEST(ExtractLabel) {
    function TEST (line 74) | TEST(AddLabel) {

FILE: algorithms/NMSLIB/code/test/test_proj.cc
  type similarity (line 22) | namespace similarity {
    function TestRandProj (line 27) | bool TestRandProj(size_t srcDim, size_t dstDim, size_t rep, dist_t eps) {
    function TEST (line 58) | TEST(TestRandProj) {

FILE: algorithms/NMSLIB/code/test/test_space_serial.cc
  type similarity (line 42) | namespace similarity {
    function fullTestCommon (line 47) | bool fullTestCommon(Space<dist_t>* pSpace, const ObjectVector& dataSet...
    function fullTest (line 88) | bool fullTest(const string& dataSetFileName, size_t maxNumRec, const s...
    function fullTest (line 116) | bool fullTest(const vector<string>& dataSetStr, size_t maxNumRec, cons...
    function TEST (line 154) | TEST(Test_WordEmbedSpace) {
    function TEST (line 163) | TEST(Test_DenseVectorSpace) {
    function TEST (line 170) | TEST(Test_DenseVectorKLDiv) {
    function TEST (line 180) | TEST(Test_SparseVectorSpace) {
    function TEST (line 189) | TEST(Test_SparseVectorSpaceFast) {
    function TEST (line 196) | TEST(Test_StringSpace) {
    function TEST (line 202) | TEST(Test_BitHamming) {
    function TEST (line 220) | TEST(Test_SFQD) {

FILE: algorithms/NMSLIB/code/test/test_sqfd.cc
  type similarity (line 25) | namespace similarity {
    function Object (line 27) | Object* CreateSqfdObject(
    function TEST (line 48) | TEST(Sqfd_From_Article) {
    function TEST (line 81) | TEST(Sqfd) {

FILE: algorithms/NMSLIB/code/test/test_timer.cc
  class WallClockTimerBannister (line 33) | class WallClockTimerBannister {
    type timeval (line 35) | struct timeval
    method WallClockTimerBannister (line 36) | WallClockTimerBannister() :
    method reset (line 41) | void reset() {
    method elapsed (line 45) | uint64_t elapsed() {
    method split (line 48) | uint64_t split() {
  function BurnCPU (line 54) | void BurnCPU(size_t qty = 10000000000) {
  function TEST (line 64) | TEST(DISABLE_TestTimer) {

FILE: algorithms/NMSLIB/code/test/testdataset.h
  function namespace (line 25) | namespace similarity {

FILE: algorithms/NSH/src/NSH.cpp
  function diff_timeval (line 37) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 41) | int main(int argc, char * argv[]) {

FILE: algorithms/NSH/src/NSH.h
  function class (line 27) | class NSH

FILE: algorithms/NSH/src/center_chooser.h
  function class (line 5) | class CenterChooser

FILE: algorithms/NSH/src/data_util.h
  function transpose (line 21) | void transpose(vector<vector<float> > X,vector<vector<float> >* Y)
  function ReadPoints (line 37) | void ReadPoints(char* filepath,vector<vector<float> >* points, int* len,...
  function ReadGroundtruth (line 61) | void ReadGroundtruth(char* filepath, vector<vector<int> >* gnds, int* le...
  function ReadB1 (line 85) | void ReadB1(const string& filename, vector<vector<unsigned> >* B1,int n)...
  function ReadChecks (line 108) | void ReadChecks(const string& filename, vector<int>* checks) {

FILE: algorithms/NSH/src/dynamic_bitset.h
  function class (line 3) | class DynamicBitset
  function clear (line 17) | void clear()
  function reset (line 22) | void reset()
  function resize (line 28) | void resize(size_t size)
  function set (line 38) | void set(size_t index)
  function test (line 47) | bool test(size_t index) const

FILE: algorithms/NSH/src/eval.h
  function compute_recall (line 28) | float compute_recall(vector<vector<int> >* gnds, vector<vector<int> >* r...
  function compute_mean_reciprocal_rank (line 45) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 66) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<in...
  function compute_relative_distance_error (line 90) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 118) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 146) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...
  function compute_recall (line 172) | float compute_recall(vector<vector<int> >* gnds, vector<vector<E_Neighbo...
  function compute_mean_reciprocal_rank (line 190) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 211) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<E_...
  function compute_relative_distance_error (line 235) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 261) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 289) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...

FILE: algorithms/NSH/src/hammingDist.h
  type B_Neighbor (line 29) | struct B_Neighbor{
  type E_Neighbor (line 40) | struct E_Neighbor{
  function get_distance (line 50) | float get_distance(vector<float> point, vector<float> query)
  function get_distance (line 61) | int get_distance(const vector<unsigned>* p1, const vector<unsigned>* p2)
  function hammingDist (line 73) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function UpdatePriorityList_Binary (line 96) | void UpdatePriorityList_Binary (B_Neighbor *BList, B_Neighbor tmp, int l...
  function hammingDist (line 116) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function hammingDist_ByRange (line 151) | void hammingDist_ByRange(vector<vector<unsigned> >* B2,vector<vector<uns...
  function UpdatePriorityList_Euclidean (line 176) | void UpdatePriorityList_Euclidean (E_Neighbor *BList, E_Neighbor tmp, in...

FILE: algorithms/NSH/src/heap.h
  function size (line 42) | int size()
  function empty (line 52) | bool empty()
  function clear (line 60) | void clear()
  type CompareT (line 66) | struct CompareT
  function const (line 68) | bool operator()(const T& t_1, const T& t_2) const
  function insert (line 83) | void insert(const T& value)
  function popMin (line 105) | bool popMin(T& value)
  type Interval (line 125) | struct Interval
  function size (line 155) | size_t size()
  function empty (line 164) | bool empty()
  function clear (line 172) | void clear()
  function insert (line 177) | void insert(const T& value)
  function popMin (line 251) | bool popMin(T& value)
  function popMax (line 296) | bool popMax(T& value)
  function getMin (line 336) | bool getMin(T& value)
  function getMax (line 346) | bool getMax(T& value)
  function size (line 371) | int size()
  function empty (line 380) | bool empty()
  function clear (line 388) | void clear()
  function insert (line 393) | void insert(const T& value)
  function popMin (line 404) | bool popMin(T& value)

FILE: algorithms/NSH/src/hierarchical_clustering_index.h
  function class (line 23) | class HierarchicalClusteringIndex
  type Node (line 118) | typedef Node* NodePtr;
  type BranchStruct (line 119) | struct BranchStruct
  function get_distance (line 135) | int get_distance(int p1, int p2)
  function get_distance (line 148) | int get_distance(const vector<unsigned>* p1, const vector<unsigned>* p2)
  function computeLabels (line 161) | void computeLabels(int* indices, int indices_length,  int* centers, int ...
  function computeClustering (line 176) | void computeClustering(Node* node, int* indices, int indices_length)
  type BranchStruct (line 232) | typedef BranchStruct BranchSt;
  function findNN (line 234) | void findNN(NodePtr node, ResultSet& result, const vector<unsigned>* vec...
  function findNeighborsWithRemoved (line 275) | void findNeighborsWithRemoved(ResultSet& result, const vector<unsigned>*...
  function knnSearch (line 300) | int knnSearch(const vector<vector<unsigned> >& queries, vector< vector<i...

FILE: algorithms/NSH/src/random.h
  function seed_random (line 39) | inline void seed_random(unsigned int seed)
  function class (line 70) | class RandomGenerator
  function class (line 81) | class UniqueRandom
  function init (line 102) | void init(int n)
  function next (line 121) | int next()

FILE: algorithms/NSH/src/result_set.h
  type DistanceIndex (line 9) | struct DistanceIndex
  function class (line 24) | class ResultSet
  function clear (line 44) | void clear()
  function full (line 64) | bool full()
  function addPoint (line 75) | void addPoint(int dist, int index)
  function copy (line 108) | void copy(vector<int>* indices, vector<int>* dists, size_t num_elements)

FILE: algorithms/OPQ/src/data_util.cpp
  function Distance (line 5) | Distance Eucldistance(const Point& x, const Point& y) {
  function Distance (line 15) | Distance Eucldistance(const Point& x, const Point& y,
  function GetSubpoints (line 26) | void GetSubpoints(const Points& points,
  function ClusterId (line 42) | ClusterId GetNearestClusterId(const Point& point,
  function GetResidual (line 62) | void GetResidual(const Point& point, const CoarseQuantization& coarse_qu...
  function GetResidual (line 74) | void GetResidual(const Point& point, const CoarseQuantization& coarse_qu...
  function GetNearestClusterIdsForPointSubset (line 85) | void GetNearestClusterIdsForPointSubset(const Points& points, const Cent...
  function GetNearestClusterIdsForSubpoints (line 101) | void GetNearestClusterIdsForSubpoints(const Points& points, const Centro...
  function GetPointsCoarseQuaintizations (line 122) | void GetPointsCoarseQuaintizations(const Points& points,

FILE: algorithms/OPQ/src/data_util.h
  type Coord (line 37) | typedef float Coord;
  type Distance (line 42) | typedef float Distance;
  type Dimensions (line 47) | typedef int Dimensions;
  type PointId (line 52) | typedef int PointId;
  type ClusterId (line 57) | typedef int ClusterId;
  type vector (line 62) | typedef vector<Coord> Point;
  type vector (line 67) | typedef vector<Point> Points;
  type vector (line 72) | typedef vector<PointId> PointIds;
  type set (line 77) | typedef set<PointId> SetPoints;
  type vector (line 82) | typedef vector<ClusterId> ClusterIds;
  type vector (line 88) | typedef vector<ClusterId> CoarseQuantization;
  type FineClusterId (line 93) | typedef unsigned char FineClusterId;
  type vector (line 98) | typedef vector<FineClusterId> FineQuantization;
  type vector (line 104) | typedef vector<SetPoints> ClustersToPoints;
  type std (line 110) | typedef std::vector<ClusterId> PointsToClusters;
  type std (line 115) | typedef std::vector<Point> Centroids;
  type PointType (line 121) | enum PointType {
  type RerankMode (line 131) | enum RerankMode {
  type IndexConfig (line 405) | struct IndexConfig {
  type RerankADC8 (line 414) | struct RerankADC8 {
  type RerankADC16 (line 428) | struct RerankADC16 {

FILE: algorithms/OPQ/src/indexer.h
  type PointType (line 43) | enum PointType
  function GetRecord (line 240) | void GetRecord(const Point& point, const PointId pid,
  function GetRecord (line 680) | inline void GetRecord<PointId> (const Point& point, const PointId pid,
  function FillAdcInfo (line 687) | inline void FillAdcInfo(const Point& point, const PointId pid,
  function RerankADC8 (line 702) | inline void GetRecord<RerankADC8> (const Point& point, const PointId pid,
  function RerankADC16 (line 718) | inline void GetRecord<RerankADC16> (const Point& point, const PointId pid,

FILE: algorithms/OPQ/src/indexer_launcher.cpp
  function SetOptions (line 69) | int SetOptions(int argc, char** argv) {
  function diff_timeval (line 137) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 141) | int main(int argc, char** argv) {

FILE: algorithms/OPQ/src/multitable.hpp
  type Multitable (line 15) | struct Multitable {
    method serialize (line 49) | void serialize(Archive& arc, unsigned int version) {
  function T (line 96) | T Multitable<T>::GetValue(const vector<int>& indices) {

FILE: algorithms/OPQ/src/ordered_lists_merger.h
  type vector (line 12) | typedef vector<int> MergedItemIndices;

FILE: algorithms/OPQ/src/perfomance_util.cpp
  function GetRecallAt (line 72) | int GetRecallAt(const int length, const vector<PointId>& groundtruth,
  function GetPresicionAt (line 86) | double GetPresicionAt(const int length, const vector<PointId>& groundtruth,
  function GetRecall (line 102) | double GetRecall(int k, const vector<PointId>& groundtruth,
  function get_distance (line 121) | float get_distance(Point data, Point query)
  function compute_relative_distance_error (line 131) | float compute_relative_distance_error(int k, const Points& dataset, cons...
  function compute_number_closer (line 147) | float compute_number_closer (int k, const vector<PointId>& groundtruth, ...
  function compute_mean_reciprocal_rank (line 164) | float compute_mean_reciprocal_rank (int k, const vector<PointId>& ground...
  function compute_mean_average_precision (line 179) | float compute_mean_average_precision (int k, const vector<PointId>& grou...
  function compute_discounted_culmulative_gain (line 199) | float compute_discounted_culmulative_gain(int k, const vector<PointId>& ...

FILE: algorithms/OPQ/src/perfomance_util.h
  type pair (line 20) | typedef pair<Distance, PointId> DistanceToPoint;
  function class (line 25) | class PerfTester {

FILE: algorithms/OPQ/src/searcher.h
  type PointType (line 26) | enum PointType
  type vector (line 35) | typedef vector<pair<Distance, ClusterId> > NearestSubspaceCentroids;
  function RecordToMetainfoAndDistance (line 188) | void RecordToMetainfoAndDistance(const Coord* point,

FILE: algorithms/OPQ/src/searcher_tester.cpp
  function SetOptions (line 75) | int SetOptions(int argc, char** argv) {
  function diff_timeval (line 146) | float diff_timeval(timeval t1, timeval t2) {
  function TestSearcher (line 151) | void TestSearcher(TSearcher& searcher,
  function main (line 187) | int main(int argc, char** argv) {

FILE: algorithms/QALSH/src/ann.cpp
  function diff_timeval (line 4) | float diff_timeval(timeval t1, timeval t2) {
  function ground_truth (line 10) | int ground_truth(					// output the ground truth results
  function indexing (line 121) | int indexing(						// build hash tables for the dataset
  function lshknn (line 195) | int lshknn(							// k-nn via qalsh (data in disk)
  function linear_scan (line 347) | int linear_scan(					// brute-force linear scan (data in disk)

FILE: algorithms/QALSH/src/b_node.cpp
  function BNode (line 95) | BNode* BNode::get_left_sibling()	// get the left-sibling node
  function BNode (line 106) | BNode* BNode::get_right_sibling()	// get the right-sibling node
  function BIndexNode (line 382) | BIndexNode* BIndexNode::get_left_sibling()
  function BIndexNode (line 394) | BIndexNode* BIndexNode::get_right_sibling()
  function BLeafNode (line 678) | BLeafNode* BLeafNode::get_left_sibling()
  function BLeafNode (line 690) | BLeafNode* BLeafNode::get_right_sibling()

FILE: algorithms/QALSH/src/b_node.h
  function class (line 10) | class BNode {
  function class (line 86) | class BIndexNode : public BNode {
  function class (line 140) | class BLeafNode : public BNode {

FILE: algorithms/QALSH/src/b_tree.h
  type HashValue (line 8) | struct HashValue
  function class (line 13) | class BTree {

FILE: algorithms/QALSH/src/block_file.h
  function class (line 8) | class BlockFile {

FILE: algorithms/QALSH/src/main.cpp
  function usage (line 4) | void usage() 						// display the usage of qalsh
  function main (line 34) | int main(int nargs, char **args)

FILE: algorithms/QALSH/src/qalsh.cpp
  function HashValueQsortComp (line 975) | int HashValueQsortComp(				// compare function for qsort

FILE: algorithms/QALSH/src/qalsh.h
  type ResultItem (line 10) | struct ResultItem {
  type PageBuffer (line 23) | struct PageBuffer {
  type HashValue (line 33) | struct HashValue {
  function class (line 42) | class QALSH {

FILE: algorithms/QALSH/src/random.cpp
  function uniform (line 6) | float uniform(						// r.v. from Uniform(min, max)
  function gaussian (line 24) | float gaussian(						// r.v. from Gaussian(mean, sigma)
  function gaussian_pdf (line 46) | float gaussian_pdf(					// pdf of N(0, 1)
  function gaussian_cdf (line 54) | float gaussian_cdf(					// cdf of N(0, 1) in range (-inf, x]
  function new_gaussian_cdf (line 66) | float new_gaussian_cdf(				// cdf of N(0, 1) in range [-x, x]
  function orig_gaussian_prob (line 84) | float orig_gaussian_prob(			// calc original gaussian probability
  function new_gaussian_prob (line 95) | float new_gaussian_prob(			// calc new gaussian probability
  function prob_of_gaussian (line 105) | void prob_of_gaussian()				// curve of p1, p2 vs. w under gaussian
  function diff_prob_of_gaussian (line 132) | void diff_prob_of_gaussian()		// curve of p1 - p2 vs. w under gaussian
  function rho_of_gaussian (line 160) | void rho_of_gaussian()				// curve of rho vs. w under gaussian

FILE: algorithms/QALSH/src/util.cpp
  function compfloats (line 13) | int compfloats(						// compare two real values
  function error (line 23) | void error(							// display an error message
  function check_mem (line 32) | int check_mem()						// check memory is enough
  function calc_l2_dist (line 49) | float calc_l2_dist(					// calculate l2 distance of 2 vectors
  function read_set (line 67) | int read_set(						// read (data or query) set from disk
  function write_data_new_form (line 107) | int write_data_new_form(			// write dataset with new format
  function get_data_filename (line 214) | void get_data_filename(				// get file name of data
  function write_data_to_buffer (line 228) | void write_data_to_buffer(			// write data to buffer
  function write_buffer_to_page (line 245) | int write_buffer_to_page(			// write buffer to one page
  function read_data (line 267) | int read_data(						// read data from page
  function read_buffer_from_page (line 321) | int read_buffer_from_page(			// read buffer from page
  function read_data_from_buffer (line 341) | void read_data_from_buffer(			// read data from buffer

FILE: algorithms/RCT/src/DistData.h
  function class (line 12) | class DistData {

FILE: algorithms/RCT/src/data_util.h
  function DistData (line 26) | DistData** ReadPoints(const char * filepath, int *len, int *d) {
  function ReadPoints (line 50) | void ReadPoints(const char * filepath,DistData** points, int *len, int *...
  function ReadGroundtruth (line 73) | void ReadGroundtruth(const string& filename,int** gnds, int count) {
  function ReadChecks (line 95) | void ReadChecks(const string& filename, vector<float>* checks) {
  function compute_recall (line 107) | float compute_recall(int** gnds, int** indices,int nq,int nn,int* nums)
  function compute_mean_reciprocal_rank (line 122) | float compute_mean_reciprocal_rank(int** gnds, int** indices,int nq,int ...
  function compute_number_closer (line 145) | float compute_number_closer(int** gnds, int** indices,int nq,int nn,int*...
  function compute_relative_distance_error (line 168) | float compute_relative_distance_error(int** gnds,DistData** points,DistD...
  function compute_mean_average_precision (line 194) | float compute_mean_average_precision (int** gnds,  int** indices,int nq,...
  function compute_discounted_culmulative_gain (line 216) | float compute_discounted_culmulative_gain (int** gnds,  int** indices,in...

FILE: algorithms/RCT/src/indexer.cpp
  function diff_timeval (line 26) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 30) | int main(int argc, char * argv[]) {

FILE: algorithms/RCT/src/random.cpp
  function Random (line 48) | Random& Random::seed(const unsigned long& s) {
  function Random (line 58) | Random& Random::seed(const unsigned long* array, const unsigned long& si...

FILE: algorithms/RCT/src/random.h
  function class (line 4) | class Random {

FILE: algorithms/RCT/src/rct.cpp
  function DistData (line 592) | DistData** RCT::getData() {

FILE: algorithms/RCT/src/rct.h
  function class (line 233) | class RCT {

FILE: algorithms/RCT/src/searcher.cpp
  function diff_timeval (line 34) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 38) | int main(int argc, char * argv[]) {

FILE: algorithms/SGH/src/SGH.cpp
  function diff_timeval (line 40) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 44) | int main(int argc, char * argv[]) {

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

FILE: algorithms/SGH/src/center_chooser.h
  function class (line 5) | class CenterChooser

FILE: algorithms/SGH/src/data_util.h
  function transpose (line 22) | void transpose(vector<vector<float> > X,vector<vector<float> >* Y)
  function ReadPoints (line 40) | void ReadPoints(char* filepath,vector<vector<float> >* points, int* len,...
  function ReadGroundtruth (line 64) | void ReadGroundtruth(char* filepath, vector<vector<int> >* gnds, int* le...
  function ReadB1 (line 88) | void ReadB1(const string& filename, vector<vector<unsigned> >* B1,int n)...
  function ReadChecks (line 111) | void ReadChecks(const string& filename, vector<int>* checks) {

FILE: algorithms/SGH/src/dynamic_bitset.h
  function class (line 3) | class DynamicBitset
  function clear (line 17) | void clear()
  function reset (line 22) | void reset()
  function resize (line 28) | void resize(size_t size)
  function set (line 38) | void set(size_t index)
  function test (line 47) | bool test(size_t index) const

FILE: algorithms/SGH/src/eval.h
  function compute_recall (line 29) | float compute_recall(vector<vector<int> >* gnds, vector<vector<int> >* r...
  function compute_mean_reciprocal_rank (line 46) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 67) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<in...
  function compute_relative_distance_error (line 91) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 115) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 143) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...
  function compute_recall (line 169) | float compute_recall(vector<vector<int> >* gnds, vector<vector<E_Neighbo...
  function compute_mean_reciprocal_rank (line 187) | float compute_mean_reciprocal_rank(vector<vector<int> >* gnds, vector<ve...
  function compute_number_closer (line 208) | float compute_number_closer(vector<vector<int> >* gnds, vector<vector<E_...
  function compute_relative_distance_error (line 232) | float compute_relative_distance_error(vector<vector<float> >* points, ve...
  function compute_mean_average_precision (line 257) | float compute_mean_average_precision (vector<vector<int> >* gnds, vector...
  function compute_discounted_culmulative_gain (line 285) | float compute_discounted_culmulative_gain (vector<vector<int> >* gnds, v...

FILE: algorithms/SGH/src/hammingDist.h
  type B_Neighbor (line 30) | struct B_Neighbor{
  type E_Neighbor (line 41) | struct E_Neighbor{
  function get_distance (line 51) | float get_distance(vector<float> point, vector<float> query)
  function hammingDist (line 62) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function UpdatePriorityList_Binary (line 84) | void UpdatePriorityList_Binary (B_Neighbor *BList, B_Neighbor tmp, int l...
  function hammingDist (line 104) | void hammingDist(vector<vector<unsigned> >* B2,vector<vector<unsigned> >...
  function hammingDist_ByRange (line 138) | void hammingDist_ByRange(vector<vector<unsigned> >* B2,vector<vector<uns...
  function UpdatePriorityList_Euclidean (line 162) | void UpdatePriorityList_Euclidean (E_Neighbor *BList, E_Neighbor tmp, in...

FILE: algorithms/SGH/src/heap.h
  function size (line 42) | int size()
  function empty (line 52) | bool empty()
  function clear (line 60) | void clear()
  type CompareT (line 66) | struct CompareT
  function const (line 68) | bool operator()(const T& t_1, const T& t_2) const
  function insert (line 83) | void insert(const T& value)
  function popMin (line 105) | bool popMin(T& value)
  type Interval (line 125) | struct Interval
  function size (line 155) | size_t size()
  function empty (line 164) | bool empty()
  function clear (line 172) | void clear()
  function insert (line 177) | void insert(const T& value)
  function popMin (line 251) | bool popMin(T& value)
  function popMax (line 296) | bool popMax(T& value)
  function getMin (line 336) | bool getMin(T& value)
  function getMax (line 346) | bool getMax(T& value)
  function size (line 371) | int size()
  function empty (line 380) | bool empty()
  function clear (line 388) | void clear()
  function insert (line 393) | void insert(const T& value)
  function popMin (line 404) | bool popMin(T& value)

FILE: algorithms/SGH/src/hierarchical_clustering_index.h
  function class (line 23) | class HierarchicalClusteringIndex
  type Node (line 126) | typedef Node* NodePtr;
  type BranchStruct (line 127) | struct BranchStruct
  function get_distance (line 143) | int get_distance(int p1, int p2)
  function get_distance (line 156) | int get_distance(const vector<unsigned>* p1, const vector<unsigned>* p2)
  function computeLabels (line 169) | void computeLabels(int* indices, int indices_length,  int* centers, int ...
  function computeClustering (line 184) | void computeClustering(Node* node, int* indices, int indices_length)
  type BranchStruct (line 240) | typedef BranchStruct BranchSt;
  function findNN (line 242) | void findNN(NodePtr node, ResultSet& result, const vector<unsigned>* vec...
  function findNeighborsWithRemoved (line 283) | void findNeighborsWithRemoved(ResultSet& result, const vector<unsigned>*...
  function knnSearch (line 308) | int knnSearch(const vector<vector<unsigned> >& queries, vector< vector<i...

FILE: algorithms/SGH/src/random.h
  function seed_random (line 39) | inline void seed_random(unsigned int seed)
  function class (line 70) | class RandomGenerator
  function class (line 81) | class UniqueRandom
  function init (line 102) | void init(int n)
  function next (line 121) | int next()

FILE: algorithms/SGH/src/result_set.h
  type DistanceIndex (line 9) | struct DistanceIndex
  function class (line 24) | class ResultSet
  function clear (line 44) | void clear()
  function full (line 64) | bool full()
  function addPoint (line 75) | void addPoint(int dist, int index)
  function copy (line 108) | void copy(vector<int>* indices, vector<int>* dists, size_t num_elements)

FILE: algorithms/SH/src/SHgeneral.h
  function class (line 14) | class SHGeneral{

FILE: algorithms/SH/src/SHindex.cpp
  function datakeycompare (line 37) | bool datakeycompare(datakey a,datakey b)

FILE: algorithms/SH/src/SHindex.h
  type datakey (line 13) | struct datakey
  function class (line 19) | class SHIndex{

FILE: algorithms/SH/src/SHselection.h
  function class (line 12) | class SHSelection{

FILE: algorithms/SH/src/io.h
  function class (line 8) | class IO{

FILE: algorithms/SH/src/knn.cpp
  function GenRandom (line 31) | vector<int> GenRandom (int size,int N)

FILE: algorithms/SH/src/knn.h
  function class (line 9) | class Knn{

FILE: algorithms/SH/src/main.cpp
  function main (line 49) | int main()

FILE: algorithms/SH/src/myrandom.h
  function class (line 5) | class MyRandom{

FILE: algorithms/SH/src/myvector.h
  function class (line 4) | class MyVector{

FILE: algorithms/SH/src/statisticsmodule.h
  function class (line 11) | class StatisticsModule{

FILE: algorithms/SRS/src/ParamFile.cpp
  function writeParamFile (line 26) | void writeParamFile(char * file_path, long long n, int d, int m, int B,

FILE: algorithms/SRS/src/ProjData.cpp
  function cal_squared_dist_1 (line 27) | inline float cal_squared_dist_1(float * a, float * b) {
  function cal_squared_dist_2 (line 31) | inline float cal_squared_dist_2(float * a, float * b) {
  function cal_squared_dist_3 (line 35) | inline float cal_squared_dist_3(float * a, float * b) {
  function cal_squared_dist_4 (line 40) | inline float cal_squared_dist_4(float * a, float * b) {
  function cal_squared_dist_5 (line 44) | inline float cal_squared_dist_5(float * a, float * b) {
  function cal_squared_dist_6 (line 49) | inline float cal_squared_dist_6(float * a, float * b) {
  function cal_squared_dist_7 (line 54) | inline float cal_squared_dist_7(float * a, float * b) {
  function cal_squared_dist_8 (line 60) | inline float cal_squared_dist_8(float * a, float * b) {
  function cal_squared_dist_9 (line 66) | inline float cal_squared_dist_9(float * a, float * b) {
  function cal_squared_dist_10 (line 73) | inline float cal_squared_dist_10(float * a, float * b) {

FILE: algorithms/SRS/src/ProjData.h
  function class (line 26) | class Proj_data {

FILE: algorithms/SRS/src/RandGen.cpp
  function gaussian (line 31) | float gaussian(float mean, float sigma) {
  function uniform (line 56) | float uniform(float _min, float _max) {

FILE: algorithms/SRS/src/Rawdata.h
  type T (line 29) | typedef T Type;
  function float (line 32) | struct Accumulator<float> {
  function int (line 36) | struct Accumulator<int> {
  type typename (line 42) | typedef typename Accumulator<T>::Type ResultType;
  function virtual (line 56) | virtual ~Raw_data() {
  function ResultType (line 60) | ResultType cal_squared_dist(long long id, T * q) {

FILE: algorithms/SRS/src/SRSCoverTree.cpp
  type search_node (line 23) | struct search_node {
  function dist_of_scale (line 55) | inline float dist_of_scale(int s) {
  function get_scale (line 59) | inline int get_scale(float d) {
  function min (line 63) | inline int min(int a, int b) {
  function max (line 70) | inline float max(float a, float b) {
  function TreeNode (line 101) | TreeNode * SRS_Cover_Tree::new_node(int id) {
  function TreeNode (line 159) | TreeNode * SRS_Cover_Tree::batch_insert(int pivot, int max_scale, int to...
  function res_pair (line 278) | res_pair SRS_Cover_Tree::increm_knn_search_compressed() {
  function adjust_offset (line 408) | void adjust_offset(CompressedTreeNode * node, char * tmppool, char * poo...
  function traverse (line 445) | void traverse(CompressedTreeNode * node, int my_height, int & max_height,

FILE: algorithms/SRS/src/SRSCoverTree.h
  type TreeNode (line 37) | struct TreeNode {
  type CompressedTreeNode (line 44) | struct CompressedTreeNode {
  type res_pair (line 59) | struct res_pair {
  type ds_node (line 64) | struct ds_node {
  type search_node (line 69) | struct search_node
  function class (line 71) | class SRS_Cover_Tree {

FILE: algorithms/SRS/src/SRSInMemory.h
  function int (line 117) | struct type_name<int> {
  function float (line 122) | struct type_name<float> {
  function double (line 127) | struct type_name<double> {
  type type_name (line 132) | struct type_name
  function int (line 143) | struct type_format<int> {
  function float (line 148) | struct type_format<float> {
  function double (line 153) | struct type_format<double> {
  type type_format (line 158) | struct type_format
  function get_m (line 186) | int get_m() {

FILE: algorithms/SRS/src/cal_param.cpp
  function main (line 32) | int main(int argc, char* argv[]) {
  function cal_para_given_t (line 113) | void cal_para_given_t(int n, double max_f, double c, double sp) {
  function cal_para_given_m (line 164) | void cal_para_given_m(int n, int m, double c, double sp) {
  function usage (line 193) | void usage() {

FILE: algorithms/SRS/src/gen_gt.cpp
  function main (line 50) | int main(int argc, char * argv[]) {
  function usage (line 140) | void usage() {
  function file_exists (line 159) | bool file_exists(const char *filename) {
  function l2_dist_int (line 164) | double l2_dist_int(int *_p1, int *_p2, int _dim) {
  function l2_dist_float (line 173) | double l2_dist_float(float *_p1, float *_p2, int _dim) {
  function gen_gt (line 182) | void gen_gt(int n, int d, int k, const char * data_file,

FILE: algorithms/SRS/src/gen_hard_data.cpp
  function main (line 34) | int main(int argc, char* argv[]) {
  function gen_hard_data_float (line 118) | void gen_hard_data_float(int n, int d, float c, char * data_file_path,
  function usage (line 216) | void usage() {

FILE: algorithms/SRS/src/srs.cpp
  function diff_timeval (line 50) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 54) | int main(int argc, char * argv[]) {
  function usage (line 282) | void usage() {
  function file_exists (line 316) | bool file_exists(const char *filename) {
  function dir_exists (line 324) | bool dir_exists(const char *dirname) {
  function query_workload (line 335) | void query_workload(SRS_In_Memory<T> * searcher,int qn, int d, int k, in...
  function cal_thres (line 392) | double cal_thres(double c, double p_thres, int m) {

FILE: algorithms/SRS/src/stack.h
  function T (line 30) | T last() {
  function decr (line 33) | void decr() {

FILE: algorithms/flann/code/bin/download_checkmd5.py
  class AppURLopener (line 6) | class AppURLopener(urllib.FancyURLopener):
    method prompt_user_passwd (line 9) | def prompt_user_passwd(self, host, realm):
  function file_md5 (line 13) | def file_md5(file):
  function main (line 19) | def main():

FILE: algorithms/flann/code/build/CMakeFiles/3.2.3/CompilerIdC/CMakeCCompilerId.c
  function main (line 479) | void main() {}
  function main (line 481) | int main(int argc, char* argv[])

FILE: algorithms/flann/code/build/CMakeFiles/3.2.3/CompilerIdCXX/CMakeCXXCompilerId.cpp
  function main (line 473) | int main(int argc, char* argv[])

FILE: algorithms/flann/code/build/CMakeFiles/feature_tests.c
  function main (line 34) | int main(int argc, char** argv) { (void)argv; return features[argc]; }

FILE: algorithms/flann/code/build/CMakeFiles/feature_tests.cxx
  function main (line 405) | int main(int argc, char** argv) { (void)argv; return features[argc]; }

FILE: algorithms/flann/code/build/src/python/setup.py
  function find_path (line 9) | def find_path():

FILE: algorithms/flann/code/examples/build_auto.cpp
  function diff_timeval (line 13) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 17) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/build_hkmeans.cpp
  function diff_timeval (line 14) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 18) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/build_kdtree.cpp
  function diff_timeval (line 15) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 19) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/linear.cpp
  function diff_timeval (line 14) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 19) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/search_auto.cpp
  function compute_recall (line 15) | float compute_recall(int k,const flann::Matrix<int>& results, const flan...
  function diff_timeval (line 31) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 35) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/search_hkmeans.cpp
  function compute_recall (line 14) | float compute_recall(int k,const flann::Matrix<int>& results, const flan...
  function diff_timeval (line 31) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 35) | int main(int argc, char** argv)

FILE: algorithms/flann/code/examples/search_kdtree.cpp
  function compute_recall (line 14) | float compute_recall(int k,const flann::Matrix<int>& results, const flan...
  function diff_timeval (line 29) | float diff_timeval(timeval t1, timeval t2) {
  function main (line 33) | int main(int argc, char** argv)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/#kmeans_index.h
  function namespace (line 55) | namespace flann
  type typename (line 89) | typedef typename Distance::ElementType ElementType;
  type typename (line 90) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 92) | typedef NNIndex<Distance> BaseClass;
  type needs_vector_space_distance (line 94) | typedef bool needs_vector_space_distance;
  function initCenterChooser (line 170) | void initCenterChooser()
  function virtual (line 192) | virtual ~KMeansIndex()
  function BaseClass (line 198) | BaseClass* clone() const
  function set_cb_index (line 204) | void set_cb_index( float index)
  function saveIndex (line 265) | void saveIndex(FILE* stream)
  function loadIndex (line 271) | void loadIndex(FILE* stream)
  function findNeighbors (line 288) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function getClusterCenters (line 306) | int getClusterCenters(Matrix<DistanceType>& centers)
  type PointInfo (line 394) | struct PointInfo
  type serialization (line 410) | struct serialization
  type Node (line 416) | struct Node
  type KMeansIndex (line 460) | typedef KMeansIndex<Distance> Index;
  type Node (line 494) | typedef Node* NodePtr;
  type BranchStruct (line 499) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  function freeIndex (line 505) | void freeIndex()
  function copyTree (line 512) | void copyTree(NodePtr& dst, const NodePtr& src)
  function computeNodeStatistics (line 540) | void computeNodeStatistics(NodePtr node, const std::vector<int>& indices)
  type _clus (line 588) | struct _clus
  function computeClustering (line 596) | void computeClustering(NodePtr node, int* indices, int indices_length, i...
  function exploreNodeBranches (line 879) | int exploreNodeBranches(NodePtr node, const ElementType* q, Heap<BranchS...
  function getCenterOrdering (line 957) | void getCenterOrdering(NodePtr node, const ElementType* q, std::vector<i...
  function DistanceType (line 979) | DistanceType getDistanceToBorder(DistanceType* p, DistanceType* c, Dista...
  function getMinVarianceClusters (line 1003) | int getMinVarianceClusters(NodePtr root, std::vector<NodePtr>& clusters,...
  function addPointToTree (line 1046) | void addPointToTree(NodePtr node, size_t index, DistanceType dist_to_pivot)
  function swap (line 1087) | void swap(KMeansIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/#nn_index.h
  function namespace (line 44) | namespace flann
  function virtual (line 113) | virtual ~NNIndex()
  function virtual (line 126) | virtual void buildIndex()
  function virtual (line 142) | virtual void buildIndex(const Matrix<ElementType>& dataset)
  function virtual (line 162) | virtual void removePoint(size_t id)
  function virtual (line 188) | virtual ElementType* getPoint(size_t id)
  function virtual (line 302) | virtual int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 364) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 391) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 462) | int knnSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 487) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 570) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 597) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 676) | int radiusSearch(const Matrix<ElementType>& queries,
  function id_to_index (line 701) | size_t id_to_index(size_t id)
  function indices_to_ids (line 733) | void indices_to_ids(const size_t* in, size_t* out, size_t size) const
  function setDataset (line 742) | void setDataset(const Matrix<ElementType>& dataset)
  function extendDataset (line 759) | void extendDataset(const Matrix<ElementType>& new_points)
  function cleanRemovedPoints (line 778) | void cleanRemovedPoints()
  function swap (line 798) | void swap(NNIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/all_indices.h
  function namespace (line 49) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/algorithms/autotuned_index.h
  function namespace (line 47) | namespace flann
  type typename (line 78) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 80) | typedef NNIndex<Distance> BaseClass;
  type AutotunedIndex (line 82) | typedef AutotunedIndex<Distance> IndexType;
  type needs_kdtree_distance (line 84) | typedef bool needs_kdtree_distance;
  function virtual (line 123) | virtual ~AutotunedIndex()
  function BaseClass (line 128) | BaseClass* clone() const
  function buildIndex (line 136) | void buildIndex()
  function buildIndex (line 163) | void buildIndex(const Matrix<ElementType>& dataset)
  function removePoint (line 178) | void removePoint(size_t id)
  function saveIndex (line 216) | void saveIndex(FILE* stream)
  function loadIndex (line 224) | void loadIndex(FILE* stream)
  function knnSearch (line 235) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 249) | int knnSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 264) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 278) | int radiusSearch(const Matrix<ElementType>& queries,
  function findNeighbors (line 297) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function freeIndex (line 357) | void freeIndex()
  type CostData (line 364) | struct CostData
  function evaluate_kmeans (line 373) | void evaluate_kmeans(CostData& cost)
  function evaluate_kdtree (line 400) | void evaluate_kdtree(CostData& cost)
  function optimizeKMeans (line 473) | void optimizeKMeans(std::vector<CostData>& costs)
  function optimizeKDTree (line 521) | void optimizeKDTree(std::vector<CostData>& costs)
  function IndexParams (line 563) | IndexParams estimateBuildParams()
  function estimateSearchParams (line 652) | float estimateSearchParams(SearchParams& searchParams)
  function swap (line 725) | void swap(AutotunedIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/center_chooser.h
  function namespace (line 13) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/algorithms/composite_index.h
  function namespace (line 39) | namespace flann
  type typename (line 75) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 77) | typedef NNIndex<Distance> BaseClass;
  type needs_kdtree_distance (line 79) | typedef bool needs_kdtree_distance;
  function virtual (line 114) | virtual ~CompositeIndex()
  function BaseClass (line 120) | BaseClass* clone() const
  function buildIndex (line 161) | void buildIndex()
  function removePoint (line 175) | void removePoint(size_t index)
  function saveIndex (line 186) | void saveIndex(FILE* stream)
  function loadIndex (line 196) | void loadIndex(FILE* stream)
  function findNeighbors (line 205) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function buildIndexImpl (line 218) | void buildIndexImpl()
  function freeIndex (line 223) | void freeIndex()

FILE: algorithms/flann/code/src/cpp/flann/algorithms/dist.h
  function namespace (line 47) | namespace flann
  function byteBitsLookUp (line 408) | static unsigned char byteBitsLookUp(unsigned char b)
  type T (line 487) | typedef T ElementType;
  type ResultType (line 488) | typedef int ResultType;
  type pop_t (line 517) | typedef unsigned long long pop_t;
  type T (line 545) | typedef T ElementType;
  type ResultType (line 546) | typedef unsigned int ResultType;
  function popcnt32 (line 550) | unsigned int popcnt32(uint32_t n) const
  function popcnt64 (line 557) | unsigned int popcnt64(uint64_t n) const
  type is_kdtree_distance (line 599) | typedef bool is_kdtree_distance;
  type T (line 601) | typedef T ElementType;
  type typename (line 602) | typedef typename Accumulator<T>::Type ResultType;
  function ResultType (line 642) | ResultType accum_dist(const U& a, const V& b, int) const
  type is_kdtree_distance (line 653) | typedef bool is_kdtree_distance;
  type T (line 655) | typedef T ElementType;
  type typename (line 656) | typedef typename Accumulator<T>::Type ResultType;
  function ResultType (line 690) | ResultType accum_dist(const U& a, const V& b, int) const
  type is_kdtree_distance (line 700) | typedef bool is_kdtree_distance;
  type T (line 702) | typedef T ElementType;
  type typename (line 703) | typedef typename Accumulator<T>::Type ResultType;
  function ResultType (line 735) | ResultType accum_dist(const U& a, const V& b, int) const
  type is_kdtree_distance (line 753) | typedef bool is_kdtree_distance;
  type T (line 755) | typedef T ElementType;
  type typename (line 756) | typedef typename Accumulator<T>::Type ResultType;
  function ResultType (line 788) | ResultType accum_dist(const U& a, const V& b, int) const

FILE: algorithms/flann/code/src/cpp/flann/algorithms/hierarchical_clustering_index.h
  function namespace (line 52) | namespace flann
  type typename (line 86) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 88) | typedef NNIndex<Distance> BaseClass;
  function initCenterChooser (line 157) | void initCenterChooser()
  function virtual (line 179) | virtual ~HierarchicalClusteringIndex()
  function BaseClass (line 185) | BaseClass* clone() const
  function saveIndex (line 258) | void saveIndex(FILE* stream)
  function loadIndex (line 265) | void loadIndex(FILE* stream)
  function findNeighbors (line 282) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  type PointInfo (line 315) | struct PointInfo
  type Node (line 342) | struct Node
  type HierarchicalClusteringIndex (line 373) | typedef HierarchicalClusteringIndex<Distance> Index;
  type Node (line 403) | typedef Node* NodePtr;
  type BranchStruct (line 410) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  function freeIndex (line 417) | void freeIndex(){
  function copyTree (line 424) | void copyTree(NodePtr& dst, const NodePtr& src)
  function computeLabels (line 443) | void computeLabels(int* indices, int indices_length,  int* centers, int ...
  function computeClustering (line 471) | void computeClustering(NodePtr node, int* indices, int indices_length)
  function addPointToTree (line 603) | void addPointToTree(NodePtr node, size_t index)
  function swap (line 639) | void swap(HierarchicalClusteringIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kdtree_cuda_3d_index.h
  function namespace (line 49) | namespace flann
  type typename (line 74) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 76) | typedef NNIndex<Distance> BaseClass;
  type needs_kdtree_distance (line 80) | typedef bool needs_kdtree_distance;
  function BaseClass (line 114) | BaseClass* clone() const
  function buildIndex (line 122) | void buildIndex()
  function removePoint (line 147) | void removePoint(size_t index)
  function ElementType (line 152) | ElementType* getPoint(size_t id)
  function saveIndex (line 157) | void saveIndex(FILE* stream)
  function loadIndex (line 164) | void loadIndex(FILE* stream)
  function knnSearch (line 194) | int knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, ...
  function knnSearch (line 208) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearchGpu (line 228) | int knnSearchGpu(const Matrix<ElementType>& queries,
  function radiusSearch (line 250) | int radiusSearch(const Matrix<ElementType>& queries, Matrix<int>& indice...
  function radiusSearch (line 256) | int radiusSearch(const Matrix<ElementType>& queries, std::vector< std::v...
  function findNeighbors (line 272) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function freeIndex (line 282) | void freeIndex()
  type GpuHelper (line 298) | struct GpuHelper

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kdtree_cuda_builder.h
  function namespace (line 43) | namespace flann
  type SplitNodes (line 271) | struct SplitNodes
  type set_addr3 (line 366) | struct set_addr3
  type pointxyz_to_px_py_pz (line 383) | struct pointxyz_to_px_py_pz
  function class (line 401) | class CudaKdTreeBuilder
  function resize_node_vectors (line 670) | void resize_node_vectors( size_t new_size )
  type AllocationInfo (line 701) | enum AllocationInfo

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kdtree_index.h
  function namespace (line 51) | namespace flann
  type typename (line 75) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 77) | typedef NNIndex<Distance> BaseClass;
  type needs_kdtree_distance (line 79) | typedef bool needs_kdtree_distance;
  function virtual (line 129) | virtual ~KDTreeIndex()
  function BaseClass (line 134) | BaseClass* clone() const
  function saveIndex (line 192) | void saveIndex(FILE* stream)
  function loadIndex (line 199) | void loadIndex(FILE* stream)
  function findNeighbors (line 224) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function freeIndex (line 280) | void freeIndex()
  type Node (line 293) | struct Node
  type KDTreeIndex (line 321) | typedef KDTreeIndex<Distance> Index;
  type Node (line 350) | typedef Node* NodePtr;
  type BranchStruct (line 351) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  type BranchSt (line 352) | typedef BranchSt* Branch;
  function High (line 355) | int High(NodePtr T)
  function copyTree (line 366) | void copyTree(NodePtr& dst, const NodePtr& src)
  function NodePtr (line 391) | NodePtr divideTree(int* ind, int count)
  function meanSplit (line 422) | void meanSplit(int* ind, int count, int& index, int& cutfeat, DistanceTy...
  function selectDivision (line 472) | int selectDivision(DistanceType* v)
  function planeSplit (line 510) | void planeSplit(int* ind, int count, int cutfeat, DistanceType cutval, i...
  function addPointToTree (line 674) | void addPointToTree(NodePtr node, int ind)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kdtree_single_index.h
  function namespace (line 48) | namespace flann
  type typename (line 73) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 75) | typedef NNIndex<Distance> BaseClass;
  type needs_kdtree_distance (line 77) | typedef bool needs_kdtree_distance;
  function virtual (line 131) | virtual ~KDTreeSingleIndex()
  function BaseClass (line 136) | BaseClass* clone() const
  function saveIndex (line 188) | void saveIndex(FILE* stream)
  function loadIndex (line 195) | void loadIndex(FILE* stream)
  function findNeighbors (line 220) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  type Node (line 262) | struct Node
  type KDTreeSingleIndex (line 291) | typedef KDTreeSingleIndex<Distance> Index;
  type Node (line 317) | typedef Node* NodePtr;
  type Interval (line 320) | struct Interval
  type serialization (line 331) | struct serialization
  type std (line 334) | typedef std::vector<Interval> BoundingBox;
  type BranchStruct (line 336) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  type BranchSt (line 337) | typedef BranchSt* Branch;

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kmeans_index.h
  function namespace (line 55) | namespace flann
  type typename (line 87) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 89) | typedef NNIndex<Distance> BaseClass;
  type needs_vector_space_distance (line 91) | typedef bool needs_vector_space_distance;
  function initCenterChooser (line 167) | void initCenterChooser()
  function virtual (line 189) | virtual ~KMeansIndex()
  function BaseClass (line 195) | BaseClass* clone() const
  function set_cb_index (line 201) | void set_cb_index( float index)
  function saveIndex (line 262) | void saveIndex(FILE* stream)
  function loadIndex (line 268) | void loadIndex(FILE* stream)
  function findNeighbors (line 285) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function getClusterCenters (line 303) | int getClusterCenters(Matrix<DistanceType>& centers)
  type PointInfo (line 349) | struct PointInfo
  type serialization (line 365) | struct serialization
  type Node (line 371) | struct Node
  type KMeansIndex (line 415) | typedef KMeansIndex<Distance> Index;
  type Node (line 449) | typedef Node* NodePtr;
  type BranchStruct (line 454) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  function freeIndex (line 460) | void freeIndex()
  function copyTree (line 467) | void copyTree(NodePtr& dst, const NodePtr& src)
  function computeNodeStatistics (line 495) | void computeNodeStatistics(NodePtr node, const std::vector<int>& indices)
  function computeClustering (line 542) | void computeClustering(NodePtr node, int* indices, int indices_length, i...
  function exploreNodeBranches (line 802) | int exploreNodeBranches(NodePtr node, const ElementType* q, Heap<BranchS...
  function getCenterOrdering (line 880) | void getCenterOrdering(NodePtr node, const ElementType* q, std::vector<i...
  function DistanceType (line 902) | DistanceType getDistanceToBorder(DistanceType* p, DistanceType* c, Dista...
  function getMinVarianceClusters (line 926) | int getMinVarianceClusters(NodePtr root, std::vector<NodePtr>& clusters,...
  function addPointToTree (line 969) | void addPointToTree(NodePtr node, size_t index, DistanceType dist_to_pivot)
  function swap (line 1010) | void swap(KMeansIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/kmeans_index_print.h
  function namespace (line 55) | namespace flann
  type typename (line 87) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 89) | typedef NNIndex<Distance> BaseClass;
  type needs_vector_space_distance (line 91) | typedef bool needs_vector_space_distance;
  function initCenterChooser (line 167) | void initCenterChooser()
  function virtual (line 189) | virtual ~KMeansIndex()
  function BaseClass (line 195) | BaseClass* clone() const
  function set_cb_index (line 201) | void set_cb_index( float index)
  function saveIndex (line 262) | void saveIndex(FILE* stream)
  function loadIndex (line 268) | void loadIndex(FILE* stream)
  function findNeighbors (line 285) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function getClusterCenters (line 303) | int getClusterCenters(Matrix<DistanceType>& centers)
  type PointInfo (line 383) | struct PointInfo
  type serialization (line 399) | struct serialization
  type Node (line 405) | struct Node
  type KMeansIndex (line 449) | typedef KMeansIndex<Distance> Index;
  type Node (line 483) | typedef Node* NodePtr;
  type BranchStruct (line 488) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  function freeIndex (line 494) | void freeIndex()
  function copyTree (line 501) | void copyTree(NodePtr& dst, const NodePtr& src)
  function computeNodeStatistics (line 529) | void computeNodeStatistics(NodePtr node, const std::vector<int>& indices)
  type _clus (line 578) | struct _clus
  function computeClustering (line 587) | void computeClustering(NodePtr node, int* indices, int indices_length, i...
  function exploreNodeBranches (line 869) | int exploreNodeBranches(NodePtr node, const ElementType* q, Heap<BranchS...
  function getCenterOrdering (line 947) | void getCenterOrdering(NodePtr node, const ElementType* q, std::vector<i...
  function DistanceType (line 969) | DistanceType getDistanceToBorder(DistanceType* p, DistanceType* c, Dista...
  function getMinVarianceClusters (line 993) | int getMinVarianceClusters(NodePtr root, std::vector<NodePtr>& clusters,...
  function addPointToTree (line 1036) | void addPointToTree(NodePtr node, size_t index, DistanceType dist_to_pivot)
  function swap (line 1077) | void swap(KMeansIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/linear_index.h
  function namespace (line 37) | namespace flann
  type typename (line 54) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 56) | typedef NNIndex<Distance> BaseClass;
  function BaseClass (line 69) | LinearIndex(const LinearIndex& other) : BaseClass(other)
  function virtual (line 79) | virtual ~LinearIndex()
  function BaseClass (line 83) | BaseClass* clone() const
  function saveIndex (line 117) | void saveIndex(FILE* stream)
  function loadIndex (line 123) | void loadIndex(FILE* stream)
  function findNeighbors (line 129) | void findNeighbors(ResultSet<DistanceType>& resultSet, const ElementType...
  function freeIndex (line 151) | void freeIndex()

FILE: algorithms/flann/code/src/cpp/flann/algorithms/lsh_index.h
  function namespace (line 54) | namespace flann
  type typename (line 82) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 84) | typedef NNIndex<Distance> BaseClass;
  function virtual (line 133) | virtual ~LshIndex()
  function BaseClass (line 139) | BaseClass* clone() const
  function saveIndex (line 195) | void saveIndex(FILE* stream)
  function loadIndex (line 201) | void loadIndex(FILE* stream)
  function knnSearch (line 224) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 279) | int knnSearch(const Matrix<ElementType>& queries,
  function findNeighbors (line 341) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function freeIndex (line 368) | void freeIndex()
  type SortScoreIndexPairOnSecond (line 378) | struct SortScoreIndexPairOnSecond
  function fill_xor_mask (line 392) | void fill_xor_mask(lsh::BucketKey key, int lowest_index, unsigned int le...
  function getNeighbors (line 412) | void getNeighbors(const ElementType* vec, bool do_radius, float radius, ...
  function getNeighbors (line 490) | void getNeighbors(const ElementType* vec, ResultSet<DistanceType>& resul...
  function swap (line 520) | void swap(LshIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/algorithms/nn_index.h
  function namespace (line 43) | namespace flann
  function virtual (line 112) | virtual ~NNIndex()
  function virtual (line 125) | virtual void buildIndex()
  function virtual (line 141) | virtual void buildIndex(const Matrix<ElementType>& dataset)
  function virtual (line 161) | virtual void removePoint(size_t id)
  function virtual (line 187) | virtual ElementType* getPoint(size_t id)
  function virtual (line 301) | virtual int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 363) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 390) | int knnSearch(const Matrix<ElementType>& queries,
  function knnSearch (line 461) | int knnSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 486) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 569) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 596) | int radiusSearch(const Matrix<ElementType>& queries,
  function radiusSearch (line 675) | int radiusSearch(const Matrix<ElementType>& queries,
  function id_to_index (line 700) | size_t id_to_index(size_t id)
  function indices_to_ids (line 732) | void indices_to_ids(const size_t* in, size_t* out, size_t size) const
  function setDataset (line 741) | void setDataset(const Matrix<ElementType>& dataset)
  function extendDataset (line 758) | void extendDataset(const Matrix<ElementType>& new_points)
  function cleanRemovedPoints (line 777) | void cleanRemovedPoints()
  function swap (line 797) | void swap(NNIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/defines.h
  function namespace (line 75) | namespace flann {

FILE: algorithms/flann/code/src/cpp/flann/flann.cpp
  type FLANNParameters (line 34) | struct FLANNParameters
  function create_parameters (line 48) | flann::IndexParams create_parameters(FLANNParameters* p)
  function create_search_params (line 105) | flann::SearchParams create_search_params(FLANNParameters* p)
  function update_flann_parameters (line 118) | void update_flann_parameters(const IndexParams& params, FLANNParameters*...
  function init_flann_parameters (line 168) | void init_flann_parameters(FLANNParameters* p)
  function flann_log_verbosity (line 179) | void flann_log_verbosity(int level)
  function flann_set_distance_type (line 187) | void flann_set_distance_type(flann_distance_t distance_type, int order)
  function flann_index_t (line 195) | flann_index_t __flann_build_index(typename Distance::ElementType* datase...
  function flann_index_t (line 228) | flann_index_t _flann_build_index(T* dataset, int rows, int cols, float* ...
  function flann_index_t (line 257) | flann_index_t flann_build_index(float* dataset, int rows, int cols, floa...
  function flann_index_t (line 262) | flann_index_t flann_build_index_float(float* dataset, int rows, int cols...
  function flann_index_t (line 267) | flann_index_t flann_build_index_double(double* dataset, int rows, int co...
  function flann_index_t (line 272) | flann_index_t flann_build_index_byte(unsigned char* dataset, int rows, i...
  function flann_index_t (line 277) | flann_index_t flann_build_index_int(int* dataset, int rows, int cols, fl...
  function __flann_save_index (line 283) | int __flann_save_index(flann_index_t index_ptr, char* filename)
  function _flann_save_index (line 302) | int _flann_save_index(flann_index_t index_ptr, char* filename)
  function flann_save_index (line 331) | int flann_save_index(flann_index_t index_ptr, char* filename)
  function flann_save_index_float (line 336) | int flann_save_index_float(flann_index_t index_ptr, char* filename)
  function flann_save_index_double (line 341) | int flann_save_index_double(flann_index_t index_ptr, char* filename)
  function flann_save_index_byte (line 346) | int flann_save_index_byte(flann_index_t index_ptr, char* filename)
  function flann_save_index_int (line 351) | int flann_save_index_int(flann_index_t index_ptr, char* filename)
  function flann_index_t (line 358) | flann_index_t __flann_load_index(char* filename, typename Distance::Elem...
  function flann_index_t (line 372) | flann_index_t _flann_load_index(char* filename, T* dataset, int rows, in...
  function flann_index_t (line 402) | flann_index_t flann_load_index(char* filename, float* dataset, int rows,...
  function flann_index_t (line 407) | flann_index_t flann_load_index_float(char* filename, float* dataset, int...
  function flann_index_t (line 412) | flann_index_t flann_load_index_double(char* filename, double* dataset, i...
  function flann_index_t (line 417) | flann_index_t flann_load_index_byte(char* filename, unsigned char* datas...
  function flann_index_t (line 422) | flann_index_t flann_load_index_int(char* filename, int* dataset, int row...
  function __flann_find_nearest_neighbors (line 430) | int __flann_find_nearest_neighbors(typename Distance::ElementType* datas...
  function _flann_find_nearest_neighbors (line 459) | int _flann_find_nearest_neighbors(T* dataset,  int rows, int cols, T* te...
  function flann_find_nearest_neighbors (line 489) | int flann_find_nearest_neighbors(float* dataset,  int rows, int cols, fl...
  function flann_find_nearest_neighbors_float (line 494) | int flann_find_nearest_neighbors_float(float* dataset,  int rows, int co...
  function flann_find_nearest_neighbors_double (line 499) | int flann_find_nearest_neighbors_double(double* dataset,  int rows, int ...
  function flann_find_nearest_neighbors_byte (line 504) | int flann_find_nearest_neighbors_byte(unsigned char* dataset,  int rows,...
  function flann_find_nearest_neighbors_int (line 509) | int flann_find_nearest_neighbors_int(int* dataset,  int rows, int cols, ...
  function __flann_find_nearest_neighbors_index (line 516) | int __flann_find_nearest_neighbors_index(flann_index_t index_ptr, typena...
  function _flann_find_nearest_neighbors_index (line 548) | int _flann_find_nearest_neighbors_index(flann_index_t index_ptr, T* test...
  function flann_find_nearest_neighbors_index (line 579) | int flann_find_nearest_neighbors_index(flann_index_t index_ptr, float* t...
  function flann_find_nearest_neighbors_index_float (line 584) | int flann_find_nearest_neighbors_index_float(flann_index_t index_ptr, fl...
  function flann_find_nearest_neighbors_index_double (line 589) | int flann_find_nearest_neighbors_index_double(flann_index_t index_ptr, d...
  function flann_find_nearest_neighbors_index_byte (line 594) | int flann_find_nearest_neighbors_index_byte(flann_index_t index_ptr, uns...
  function flann_find_nearest_neighbors_index_int (line 599) | int flann_find_nearest_neighbors_index_int(flann_index_t index_ptr, int*...
  function __flann_radius_search (line 606) | int __flann_radius_search(flann_index_t index_ptr,
  function _flann_radius_search (line 641) | int _flann_radius_search(flann_index_t index_ptr,
  function flann_radius_search (line 676) | int flann_radius_search(flann_index_t index_ptr,
  function flann_radius_search_float (line 687) | int flann_radius_search_float(flann_index_t index_ptr,
  function flann_radius_search_double (line 698) | int flann_radius_search_double(flann_index_t index_ptr,
  function flann_radius_search_byte (line 709) | int flann_radius_search_byte(flann_index_t index_ptr,
  function flann_radius_search_int (line 720) | int flann_radius_search_int(flann_index_t index_ptr,
  function __flann_free_index (line 733) | int __flann_free_index(flann_index_t index_ptr, FLANNParameters* flann_p...
  function _flann_free_index (line 752) | int _flann_free_index(flann_index_t index_ptr, FLANNParameters* flann_pa...
  function flann_free_index (line 781) | int flann_free_index(flann_index_t index_ptr, FLANNParameters* flann_par...
  function flann_free_index_float (line 786) | int flann_free_index_float(flann_index_t index_ptr, FLANNParameters* fla...
  function flann_free_index_double (line 791) | int flann_free_index_double(flann_index_t index_ptr, FLANNParameters* fl...
  function flann_free_index_byte (line 796) | int flann_free_index_byte(flann_index_t index_ptr, FLANNParameters* flan...
  function flann_free_index_int (line 801) | int flann_free_index_int(flann_index_t index_ptr, FLANNParameters* flann...
  function __flann_compute_cluster_centers (line 808) | int __flann_compute_cluster_centers(typename Distance::ElementType* data...
  function _flann_compute_cluster_centers (line 832) | int _flann_compute_cluster_centers(T* dataset, int rows, int cols, int c...
  function flann_compute_cluster_centers (line 861) | int flann_compute_cluster_centers(float* dataset, int rows, int cols, in...
  function flann_compute_cluster_centers_float (line 866) | int flann_compute_cluster_centers_float(float* dataset, int rows, int co...
  function flann_compute_cluster_centers_double (line 871) | int flann_compute_cluster_centers_double(double* dataset, int rows, int ...
  function flann_compute_cluster_centers_byte (line 876) | int flann_compute_cluster_centers_byte(unsigned char* dataset, int rows,...
  function flann_compute_cluster_centers_int (line 881) | int flann_compute_cluster_centers_int(int* dataset, int rows, int cols, ...

FILE: algorithms/flann/code/src/cpp/flann/flann.h
  type FLANNParameters (line 43) | struct FLANNParameters
  type flann_distance_t (line 101) | enum flann_distance_t
  type FLANNParameters (line 122) | struct FLANNParameters
  type FLANNParameters (line 128) | struct FLANNParameters
  type FLANNParameters (line 134) | struct FLANNParameters
  type FLANNParameters (line 140) | struct FLANNParameters
  type FLANNParameters (line 146) | struct FLANNParameters
  type FLANNParameters (line 229) | struct FLANNParameters
  type FLANNParameters (line 239) | struct FLANNParameters
  type FLANNParameters (line 249) | struct FLANNParameters
  type FLANNParameters (line 259) | struct FLANNParameters
  type FLANNParameters (line 269) | struct FLANNParameters
  type FLANNParameters (line 294) | struct FLANNParameters
  type FLANNParameters (line 302) | struct FLANNParameters
  type FLANNParameters (line 310) | struct FLANNParameters
  type FLANNParameters (line 318) | struct FLANNParameters
  type FLANNParameters (line 326) | struct FLANNParameters
  type FLANNParameters (line 349) | struct FLANNParameters
  type FLANNParameters (line 357) | struct FLANNParameters
  type FLANNParameters (line 365) | struct FLANNParameters
  type FLANNParameters (line 373) | struct FLANNParameters
  type FLANNParameters (line 381) | struct FLANNParameters
  type FLANNParameters (line 393) | struct FLANNParameters
  type FLANNParameters (line 396) | struct FLANNParameters
  type FLANNParameters (line 399) | struct FLANNParameters
  type FLANNParameters (line 402) | struct FLANNParameters
  type FLANNParameters (line 405) | struct FLANNParameters
  type FLANNParameters (line 431) | struct FLANNParameters
  type FLANNParameters (line 438) | struct FLANNParameters
  type FLANNParameters (line 445) | struct FLANNParameters
  type FLANNParameters (line 452) | struct FLANNParameters
  type FLANNParameters (line 459) | struct FLANNParameters

FILE: algorithms/flann/code/src/cpp/flann/flann.hpp
  type flann (line 47) | namespace flann
    function log_verbosity (line 54) | inline void log_verbosity(int level)
    type SavedIndexParams (line 64) | struct SavedIndexParams : public IndexParams
      method SavedIndexParams (line 66) | SavedIndexParams(std::string filename)
    class Index (line 76) | class Index
      method Index (line 83) | Index(const IndexParams& params, Distance distance = Distance() )
      method Index (line 101) | Index(const Matrix<ElementType>& features, const IndexParams& params...
      method Index (line 118) | Index(const Index& other) : loaded_(other.loaded_), index_params_(ot...
      method Index (line 123) | Index& operator=(Index other)
      method buildIndex (line 137) | void buildIndex()
      method buildIndex (line 144) | void buildIndex(const Matrix<ElementType>& points)
      method addPoints (line 149) | void addPoints(const Matrix<ElementType>& points, float rebuild_thre...
      method removePoint (line 158) | void removePoint(size_t point_id)
      method ElementType (line 168) | ElementType* getPoint(size_t point_id)
      method save (line 177) | void save(std::string filename)
      method veclen (line 190) | size_t veclen() const
      method size (line 198) | size_t size() const
      method flann_algorithm_t (line 206) | flann_algorithm_t getType() const
      method usedMemory (line 214) | int usedMemory() const
      method IndexParams (line 223) | IndexParams getParameters() const
      method knnSearch (line 236) | int knnSearch(const Matrix<ElementType>& queries,
      method knnSearch (line 255) | int knnSearch(const Matrix<ElementType>& queries,
      method knnSearch (line 272) | int knnSearch(const Matrix<ElementType>& queries,
      method knnSearch (line 290) | int knnSearch(const Matrix<ElementType>& queries,
      method radiusSearch (line 308) | int radiusSearch(const Matrix<ElementType>& queries,
      method radiusSearch (line 326) | int radiusSearch(const Matrix<ElementType>& queries,
      method radiusSearch (line 344) | int radiusSearch(const Matrix<ElementType>& queries,
      method radiusSearch (line 362) | int radiusSearch(const Matrix<ElementType>& queries,
      method IndexType (line 372) | IndexType* load_saved_index(const Matrix<ElementType>& dataset, cons...
      method swap (line 393) | void swap( Index& other)
    function hierarchicalClustering (line 425) | int hierarchicalClustering(const Matrix<typename Distance::ElementType...

FILE: algorithms/flann/code/src/cpp/flann/general.h
  function namespace (line 39) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/io/hdf5.h
  function namespace (line 38) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/kmeans_index.h
  function namespace (line 55) | namespace flann
  type typename (line 89) | typedef typename Distance::ElementType ElementType;
  type typename (line 90) | typedef typename Distance::ResultType DistanceType;
  type NNIndex (line 92) | typedef NNIndex<Distance> BaseClass;
  type needs_vector_space_distance (line 94) | typedef bool needs_vector_space_distance;
  function initCenterChooser (line 170) | void initCenterChooser()
  function virtual (line 192) | virtual ~KMeansIndex()
  function BaseClass (line 198) | BaseClass* clone() const
  function set_cb_index (line 204) | void set_cb_index( float index)
  function saveIndex (line 265) | void saveIndex(FILE* stream)
  function loadIndex (line 271) | void loadIndex(FILE* stream)
  function findNeighbors (line 288) | void findNeighbors(ResultSet<DistanceType>& result, const ElementType* v...
  function getClusterCenters (line 306) | int getClusterCenters(Matrix<DistanceType>& centers)
  type PointInfo (line 361) | struct PointInfo
  type serialization (line 377) | struct serialization
  type Node (line 383) | struct Node
  type KMeansIndex (line 427) | typedef KMeansIndex<Distance> Index;
  type Node (line 461) | typedef Node* NodePtr;
  type BranchStruct (line 466) | typedef BranchStruct<NodePtr, DistanceType> BranchSt;
  function freeIndex (line 472) | void freeIndex()
  function copyTree (line 479) | void copyTree(NodePtr& dst, const NodePtr& src)
  function computeNodeStatistics (line 507) | void computeNodeStatistics(NodePtr node, const std::vector<int>& indices)
  function computeClustering (line 554) | void computeClustering(NodePtr node, int* indices, int indices_length, i...
  function exploreNodeBranches (line 816) | int exploreNodeBranches(NodePtr node, const ElementType* q, Heap<BranchS...
  function getCenterOrdering (line 894) | void getCenterOrdering(NodePtr node, const ElementType* q, std::vector<i...
  function DistanceType (line 916) | DistanceType getDistanceToBorder(DistanceType* p, DistanceType* c, Dista...
  function getMinVarianceClusters (line 940) | int getMinVarianceClusters(NodePtr root, std::vector<NodePtr>& clusters,...
  function addPointToTree (line 983) | void addPointToTree(NodePtr node, size_t index, DistanceType dist_to_pivot)
  function swap (line 1024) | void swap(KMeansIndex& other)

FILE: algorithms/flann/code/src/cpp/flann/mpi/client.h
  function namespace (line 39) | namespace flann {

FILE: algorithms/flann/code/src/cpp/flann/mpi/flann_mpi_client.cpp
  function start_timer (line 15) | void start_timer(const std::string& message = "")
  function stop_timer (line 24) | double stop_timer()
  function compute_precision (line 32) | float compute_precision(const flann::Matrix<int>& match, const flann::Ma...
  function main (line 53) | int main(int argc, char* argv[])

FILE: algorithms/flann/code/src/cpp/flann/mpi/flann_mpi_server.cpp
  function main (line 6) | int main(int argc, char* argv[])

FILE: algorithms/flann/code/src/cpp/flann/mpi/index.h
  function namespace (line 40) | namespace mpi

FILE: algorithms/flann/code/src/cpp/flann/mpi/matrix.h
  function namespace (line 37) | namespace boost {

FILE: algorithms/flann/code/src/cpp/flann/mpi/queries.h
  function namespace (line 38) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/mpi/server.h
  function namespace (line 46) | namespace flann {

FILE: algorithms/flann/code/src/cpp/flann/nn/ground_truth.h
  type typename (line 45) | typedef typename Distance::ElementType ElementType;
  type typename (line 46) | typedef typename Distance::ResultType DistanceType;

FILE: algorithms/flann/code/src/cpp/flann/nn/index_testing.h
  function namespace (line 45) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/nn/simplex_downhill.h
  function namespace (line 34) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/#result_set.h
  function namespace (line 42) | namespace flann
  function virtual (line 88) | virtual bool full() const = 0;
  function clear (line 123) | void clear()
  function addPoint (line 153) | void addPoint(DistanceType dist, size_t index)
  function capacity_ (line 217) | KNNResultSet(int capacity) : capacity_(capacity)
  function clear (line 233) | void clear()
  function addPoint (line 251) | void addPoint(DistanceType dist, size_t index)
  function capacity_ (line 324) | KNNResultSet2(size_t capacity_) :
  function clear (line 340) | void clear()
  function addPoint (line 371) | void addPoint(DistanceType dist, size_t index)
  function radius_ (line 450) | RadiusResultSet(DistanceType radius_) :
  function clear (line 465) | void clear()
  function addPoint (line 494) | void addPoint(DistanceType dist, size_t index)
  function clear (line 566) | void clear()
  function addPoint (line 597) | void addPoint(DistanceType dist, size_t index)
  function clear (line 687) | void clear()
  function addPoint (line 702) | void addPoint(DistanceType dist, size_t index)
  type DistIndex (line 726) | struct DistIndex
  type typename (line 763) | typedef typename std::set<DistIndex>::const_iterator Iterator;
  function addPoint (line 820) | inline void addPoint(DistanceType dist, size_t index)
  function clear (line 840) | void clear()
  function addPoint (line 879) | void addPoint(DistanceType dist, size_t index)
  function clear (line 886) | inline void clear()
  function clear (line 936) | void clear()

FILE: algorithms/flann/code/src/cpp/flann/util/allocator.h
  function namespace (line 38) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/any.h
  function namespace (line 19) | namespace flann
  function class (line 148) | class any
  function reset (line 257) | void reset()
  function compatible (line 264) | bool compatible(const any& x) const

FILE: algorithms/flann/code/src/cpp/flann/util/cuda/heap.h
  function namespace (line 31) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/cuda/result_set.h
  function infinity (line 36) | float infinity()
  function namespace (line 45) | namespace flann
  function __device__ (line 397) | __device__
  function __device__ (line 431) | __device__
  function __device__ (line 447) | __device__
  function __device__ (line 461) | __device__
  function __device__ (line 497) | __device__
  function __device__ (line 511) | __device__
  function __device__ (line 519) | __device__

FILE: algorithms/flann/code/src/cpp/flann/util/cutil_math.h
  type uint (line 28) | typedef unsigned int uint;
  type ushort (line 29) | typedef unsigned short ushort;
  function fminf (line 38) | inline float fminf(float a, float b)
  function fmaxf (line 43) | inline float fmaxf(float a, float b)
  function max (line 48) | inline int max(int a, int b)
  function min (line 53) | inline int min(int a, int b)
  function rsqrtf (line 58) | inline float rsqrtf(float x)
  function float2 (line 68) | float2 make_float2(float s)
  function float2 (line 72) | float2 make_float2(float3 a)
  function float2 (line 76) | float2 make_float2(int2 a)
  function float2 (line 80) | float2 make_float2(uint2 a)
  function int2 (line 85) | int2 make_int2(int s)
  function int2 (line 89) | int2 make_int2(int3 a)
  function int2 (line 93) | int2 make_int2(uint2 a)
  function int2 (line 97) | int2 make_int2(float2 a)
  function uint2 (line 102) | uint2 make_uint2(uint s)
  function uint2 (line 106) | uint2 make_uint2(uint3 a)
  function uint2 (line 110) | uint2 make_uint2(int2 a)
  function float3 (line 115) | float3 make_float3(float s)
  function float3 (line 119) | float3 make_float3(float2 a)
  function float3 (line 123) | float3 make_float3(float2 a, float s)
  function float3 (line 127) | float3 make_float3(float4 a)
  function float3 (line 131) | float3 make_float3(int3 a)
  function float3 (line 135) | float3 make_float3(uint3 a)
  function int3 (line 140) | int3 make_int3(int s)
  function int3 (line 144) | int3 make_int3(int2 a)
  function int3 (line 148) | int3 make_int3(int2 a, int s)
  function int3 (line 152) | int3 make_int3(uint3 a)
  function int3 (line 156) | int3 make_int3(float3 a)
  function uint3 (line 161) | uint3 make_uint3(uint s)
  function uint3 (line 165) | uint3 make_uint3(uint2 a)
  function uint3 (line 169) | uint3 make_uint3(uint2 a, uint s)
  function uint3 (line 173) | uint3 make_uint3(uint4 a)
  function uint3 (line 177) | uint3 make_uint3(int3 a)
  function float4 (line 182) | float4 make_float4(float s)
  function float4 (line 186) | float4 make_float4(float3 a)
  function float4 (line 190) | float4 make_float4(float3 a, float w)
  function float4 (line 194) | float4 make_float4(int4 a)
  function float4 (line 198) | float4 make_float4(uint4 a)
  function int4 (line 203) | int4 make_int4(int s)
  function int4 (line 207) | int4 make_int4(int3 a)
  function int4 (line 211) | int4 make_int4(int3 a, int w)
  function int4 (line 215) | int4 make_int4(uint4 a)
  function int4 (line 219) | int4 make_int4(float4 a)
  function uint4 (line 225) | uint4 make_uint4(uint s)
  function uint4 (line 229) | uint4 make_uint4(uint3 a)
  function uint4 (line 233) | uint4 make_uint4(uint3 a, uint w)
  function uint4 (line 237) | uint4 make_uint4(int4 a)
  function float2 (line 659) | float2 operator*(float2 a, float2 b)
  function float2 (line 667) | float2 operator*(float2 a, float b)
  function float2 (line 671) | float2 operator*(float b, float2 a)
  function int2 (line 680) | int2 operator*(int2 a, int2 b)
  function int2 (line 688) | int2 operator*(int2 a, int b)
  function int2 (line 692) | int2 operator*(int b, int2 a)
  function uint2 (line 701) | uint2 operator*(uint2 a, uint2 b)
  function uint2 (line 709) | uint2 operator*(uint2 a, uint b)
  function uint2 (line 713) | uint2 operator*(uint b, uint2 a)
  function float3 (line 722) | float3 operator*(float3 a, float3 b)
  function float3 (line 730) | float3 operator*(float3 a, float b)
  function float3 (line 734) | float3 operator*(float b, float3 a)
  function int3 (line 743) | int3 operator*(int3 a, int3 b)
  function int3 (line 751) | int3 operator*(int3 a, int b)
  function int3 (line 755) | int3 operator*(int b, int3 a)
  function uint3 (line 764) | uint3 operator*(uint3 a, uint3 b)
  function uint3 (line 772) | uint3 operator*(uint3 a, uint b)
  function uint3 (line 776) | uint3 operator*(uint b, uint3 a)
  function float4 (line 785) | float4 operator*(float4 a, float4 b)
  function float4 (line 793) | float4 operator*(float4 a, float b)
  function float4 (line 797) | float4 operator*(float b, float4 a)
  function int4 (line 806) | int4 operator*(int4 a, int4 b)
  function int4 (line 814) | int4 operator*(int4 a, int b)
  function int4 (line 818) | int4 operator*(int b, int4 a)
  function uint4 (line 827) | uint4 operator*(uint4 a, uint4 b)
  function uint4 (line 835) | uint4 operator*(uint4 a, uint b)
  function uint4 (line 839) | uint4 operator*(uint b, uint4 a)
  function float2 (line 918) | float2 fminf(float2 a, float2 b)
  function float3 (line 922) | float3 fminf(float3 a, float3 b)
  function float4 (line 926) | float4 fminf(float4 a, float4 b)
  function int2 (line 931) | int2 min(int2 a, int2 b)
  function int3 (line 935) | int3 min(int3 a, int3 b)
  function int4 (line 939) | int4 min(int4 a, int4 b)
  function uint2 (line 944) | uint2 min(uint2 a, uint2 b)
  function uint3 (line 948) | uint3 min(uint3 a, uint3 b)
  function uint4 (line 952) | uint4 min(uint4 a, uint4 b)
  function float2 (line 961) | float2 fmaxf(float2 a, float2 b)
  function float3 (line 965) | float3 fmaxf(float3 a, float3 b)
  function float4 (line 969) | float4 fmaxf(float4 a, float4 b)
  function int2 (line 974) | int2 max(int2 a, int2 b)
  function int3 (line 978) | int3 max(int3 a, int3 b)
  function int4 (line 982) | int4 max(int4 a, int4 b)
  function uint2 (line 987) | uint2 max(uint2 a, uint2 b)
  function uint3 (line 991) | uint3 max(uint3 a, uint3 b)
  function uint4 (line 995) | uint4 max(uint4 a, uint4 b)
  function lerp (line 1005) | float lerp(float a, float b, float t)
  function float2 (line 1009) | float2 lerp(float2 a, float2 b, float t)
  function float3 (line 1013) | float3 lerp(float3 a, float3 b, float t)
  function float4 (line 1017) | float4 lerp(float4 a, float4 b, float t)
  function clamp (line 1027) | float clamp(float f, float a, float b)
  function clamp (line 1031) | int clamp(int f, int a, int b)
  function uint (line 1035) | uint clamp(uint f, uint a, uint b)
  function float2 (line 1040) | float2 clamp(float2 v, float a, float b)
  function float2 (line 1044) | float2 clamp(float2 v, float2 a, float2 b)
  function float3 (line 1048) | float3 clamp(float3 v, float a, float b)
  function float3 (line 1052) | float3 clamp(float3 v, float3 a, float3 b)
  function float4 (line 1056) | float4 clamp(float4 v, float a, float b)
  function float4 (line 1060) | float4 clamp(float4 v, float4 a, float4 b)
  function int2 (line 1065) | int2 clamp(int2 v, int a, int b)
  function int2 (line 1069) | int2 clamp(int2 v, int2 a, int2 b)
  function int3 (line 1073) | int3 clamp(int3 v, int a, int b)
  function int3 (line 1077) | int3 clamp(int3 v, int3 a, int3 b)
  function int4 (line 1081) | int4 clamp(int4 v, int a, int b)
  function int4 (line 1085) | int4 clamp(int4 v, int4 a, int4 b)
  function uint2 (line 1090) | uint2 clamp(uint2 v, uint a, uint b)
  function uint2 (line 1094) | uint2 clamp(uint2 v, uint2 a, uint2 b)
  function uint3 (line 1098) | uint3 clamp(uint3 v, uint a, uint b)
  function uint3 (line 1102) | uint3 clamp(uint3 v, uint3 a, uint3 b)
  function uint4 (line 1106) | uint4 clamp(uint4 v, uint a, uint b)
  function uint4 (line 1110) | uint4 clamp(uint4 v, uint4 a, uint4 b)
  function dot (line 1119) | float dot(float2 a, float2 b)
  function dot (line 1123) | float dot(float3 a, float3 b)
  function dot (line 1127) | float dot(float4 a, float4 b)
  function dot (line 1132) | int dot(int2 a, int2 b)
  function dot (line 1136) | int dot(int3 a, int3 b)
  function dot (line 1140) | int dot(int4 a, int4 b)
  function uint (line 1145) | uint dot(uint2 a, uint2 b)
  function uint (line 1149) | uint dot(uint3 a, uint3 b)
  function uint (line 1153) | uint dot(uint4 a, uint4 b)
  function length (line 1162) | float length(float2 v)
  function length (line 1166) | float length(float3 v)
  function length (line 1170) | float length(float4 v)
  function float2 (line 1179) | float2 normalize(float2 v)
  function float3 (line 1184) | float3 normalize(float3 v)
  function float4 (line 1189) | float4 normalize(float4 v)
  function float2 (line 1199) | float2 floorf(float2 v)
  function float3 (line 1203) | float3 floorf(float3 v)
  function float4 (line 1207) | float4 floorf(float4 v)
  function fracf (line 1216) | float fracf(float v)
  function float2 (line 1220) | float2 fracf(float2 v)
  function float3 (line 1224) | float3 fracf(float3 v)
  function float4 (line 1228) | float4 fracf(float4 v)
  function float2 (line 1237) | float2 fmodf(float2 a, float2 b)
  function float3 (line 1241) | float3 fmodf(float3 a, float3 b)
  function float4 (line 1245) | float4 fmodf(float4 a, float4 b)
  function float2 (line 1254) | float2 fabs(float2 v)
  function float3 (line 1258) | float3 fabs(float3 v)
  function float4 (line 1262) | float4 fabs(float4 v)
  function int2 (line 1267) | int2 abs(int2 v)
  function int3 (line 1271) | int3 abs(int3 v)
  function int4 (line 1275) | int4 abs(int4 v)
  function float3 (line 1286) | float3 reflect(float3 i, float3 n)
  function float3 (line 1295) | float3 cross(float3 a, float3 b)
  function smoothstep (line 1307) | float smoothstep(float a, float b, float x)
  function float2 (line 1312) | float2 smoothstep(float2 a, float2 b, float2 x)
  function float3 (line 1317) | float3 smoothstep(float3 a, float3 b, float3 x)
  function float4 (line 1322) | float4 smoothstep(float4 a, float4 b, float4 x)

FILE: algorithms/flann/code/src/cpp/flann/util/dynamic_bitset.h
  type boost (line 41) | typedef boost::dynamic_bitset<> DynamicBitset;
  function namespace (line 46) | namespace flann {

FILE: algorithms/flann/code/src/cpp/flann/util/heap.h
  function namespace (line 37) | namespace flann
  type Interval (line 167) | struct Interval
  function size (line 197) | size_t size()
  function empty (line 206) | bool empty()
  function clear (line 214) | void clear()
  function insert (line 219) | void insert(const T& value)
  function popMin (line 293) | bool popMin(T& value)
  function popMax (line 338) | bool popMax(T& value)
  function getMin (line 378) | bool getMin(T& value)
  function getMax (line 388) | bool getMax(T& value)
  function size (line 413) | int size()
  function empty (line 422) | bool empty()
  function clear (line 430) | void clear()
  function insert (line 435) | void insert(const T& value)
  function popMin (line 446) | bool popMin(T& value)

FILE: algorithms/flann/code/src/cpp/flann/util/logger.h
  function namespace (line 40) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/lsh_table.h
  function namespace (line 54) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/matrix.h
  function namespace (line 38) | namespace flann
  function T (line 121) | inline T* operator[](size_t index) const
  function T (line 127) | T* ptr() const

FILE: algorithms/flann/code/src/cpp/flann/util/object_factory.h
  function namespace (line 36) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/params.h
  function namespace (line 39) | namespace flann
  function has_param (line 89) | inline bool has_param(const IndexParams& params, std::string name)
  function string (line 107) | string name)
  function print_params (line 118) | inline void print_params(const IndexParams& params)
  function print_params (line 127) | inline void print_params(const SearchParams& params)

FILE: algorithms/flann/code/src/cpp/flann/util/random.h
  function namespace (line 41) | namespace flann
  function class (line 80) | class RandomGenerator
  function class (line 91) | class UniqueRandom
  function init (line 112) | void init(int n)
  function next (line 131) | int next()

FILE: algorithms/flann/code/src/cpp/flann/util/result_set.h
  function namespace (line 41) | namespace flann
  function virtual (line 87) | virtual bool full() const = 0;
  function clear (line 121) | void clear()
  function addPoint (line 151) | void addPoint(DistanceType dist, size_t index)
  function capacity_ (line 210) | KNNResultSet(int capacity) : capacity_(capacity)
  function clear (line 225) | void clear()
  function addPoint (line 243) | void addPoint(DistanceType dist, size_t index)
  function capacity_ (line 311) | KNNResultSet2(size_t capacity_) :
  function clear (line 326) | void clear()
  function addPoint (line 357) | void addPoint(DistanceType dist, size_t index)
  function radius_ (line 433) | RadiusResultSet(DistanceType radius_) :
  function clear (line 448) | void clear()
  function addPoint (line 477) | void addPoint(DistanceType dist, size_t index)
  function clear (line 549) | void clear()
  function addPoint (line 580) | void addPoint(DistanceType dist, size_t index)
  function clear (line 670) | void clear()
  function addPoint (line 685) | void addPoint(DistanceType dist, size_t index)
  type DistIndex (line 709) | struct DistIndex
  type typename (line 746) | typedef typename std::set<DistIndex>::const_iterator Iterator;
  function addPoint (line 803) | inline void addPoint(DistanceType dist, size_t index)
  function clear (line 823) | void clear()
  function addPoint (line 862) | void addPoint(DistanceType dist, size_t index)
  function clear (line 869) | inline void clear()
  function clear (line 919) | void clear()

FILE: algorithms/flann/code/src/cpp/flann/util/sampling.h
  function namespace (line 36) | namespace flann

FILE: algorithms/flann/code/src/cpp/flann/util/saving.h
  function namespace (line 45) | namespace flann
  function IndexHeader (line 108) | inline IndexHeader load_header(FILE* stream)
  function namespace (line 125) | namespace serialization

FILE: algorithms/flann/code/src/cpp/flann/util/serialization.h
  function namespace (line 8) | namespace flann
  function load (line 170) | inline void load(InputArchive& ar, T (&val)[N])
  function save (line 176) | inline void save(OutputArchive& ar,  T const (&val)[N])
  type binary_object (line 185) | struct binary_object
  function binary_object (line 206) | inline const binary_object make_binary_object(/* const */ void * t, size...
  function binary_object (line 211) | struct Serializer<const binary_object>
  function binary_object (line 227) | struct Serializer<binary_object>
  type value_type (line 247) | typedef bool value_type;
  function class (line 251) | class ArchiveBase
  type bool_ (line 271) | typedef bool_<false> is_saving;
  type bool_ (line 289) | typedef bool_<true> is_saving;
  function class (line 301) | class SizeArchive : public OutputArchive<SizeArchive>
  function reset (line 323) | void reset()
  function size (line 328) | size_t size()
  function class (line 353) | class SaveArchive : public OutputArchive<SaveArchive>
  function class (line 397) | class LoadArchive : public InputArchive<LoadArchive>

FILE: algorithms/flann/code/src/cpp/flann/util/timer.h
  function namespace (line 37) | namespace flann

FILE: algorithms/flann/code/src/matlab/nearest_neighbors.cpp
  type TypedIndex (line 41) | struct TypedIndex
  function mxArray (line 49) | static mxArray* to_mx_array(T value)
  function matlabStructToFlannStruct (line 59) | static void matlabStructToFlannStruct( const mxArray* mexParams, FLANNPa...
  function mxArray (line 90) | static mxArray* flannStructToMatlabStruct( const FLANNParameters& flannP...
  function check_allowed_type (line 114) | static void check_allowed_type(const mxArray* datasetMat)
  function _find_nn (line 130) | static void _find_nn(int nOutArray, mxArray* OutArray[], int nInArray, c...
  function _index_find_nn (line 236) | static void _index_find_nn(int nOutArray, mxArray* OutArray[], int nInAr...
  function _build_index (line 339) | static void _build_index(int nOutArray, mxArray* OutArray[], int nInArra...
  function _free_index (line 416) | static void _free_index(int nOutArray, mxArray* OutArray[], int nInArray...
  function _set_log_level (line 441) | static void _set_log_level(int nOutArray, mxArray* OutArray[], int nInAr...
  function _set_distance_type (line 461) | static void _set_distance_type(int nOutArray, mxArray* OutArray[], int n...
  function _save_index (line 490) | static void _save_index(int nOutArray, mxArray* OutArray[], int nInArray...
  function _load_index (line 525) | static void _load_index(int nOutArray, mxArray* OutArray[], int nInArray...
  type mexFunctionEntry (line 583) | struct mexFunctionEntry
  function print_selector_error (line 601) | static void print_selector_error()
  function mexFunction (line 621) | void mexFunction(int nOutArray, mxArray* OutArray[], int nInArray, const...

FILE: algorithms/flann/code/src/python/pyflann/exceptions.py
  class FLANNException (line 30) | class FLANNException(Exception):
    method __init__ (line 31) | def __init__(self, *args):

FILE: algorithms/flann/code/src/python/pyflann/flann_ctypes.py
  class CustomStructure (line 37) | class CustomStructure(Structure):
    method __init__ (line 46) | def __init__(self):
    method update (line 51) | def update(self, dict):
    method __getitem__ (line 56) | def __getitem__(self, k):
    method __setitem__ (line 60) | def __setitem__(self, k, v):
    method keys (line 66) | def keys(self):
    method __translate (line 69) | def __translate(self,k,v):
    method __translate_back (line 75) | def __translate_back(self,k,v):
  class FLANNParameters (line 82) | class FLANNParameters(CustomStructure):
  function load_flann_library (line 141) | def load_flann_library():
  class FlannLib (line 187) | class FlannLib: pass
  function define_functions (line 209) | def define_functions(str):
  function ensure_2d_array (line 374) | def ensure_2d_array(array, flags, **kwargs):

FILE: algorithms/flann/code/src/python/pyflann/index.py
  function set_distance_type (line 34) | def set_distance_type(distance_type, order = 0):
  function to_bytes (line 58) | def to_bytes(string):
  class FLANN (line 64) | class FLANN:
    method __init__ (line 72) | def __init__(self, **kwargs):
    method __del__ (line 88) | def __del__(self):
    method nn (line 95) | def nn(self, pts, qpts, num_neighbors = 1, **kwargs):
    method build_index (line 137) | def build_index(self, pts, **kwargs):
    method save_index (line 175) | def save_index(self, filename):
    method load_index (line 182) | def load_index(self, filename, pts):
    method nn_index (line 203) | def nn_index(self, qpts, num_neighbors = 1, **kwargs):
    method nn_radius (line 250) | def nn_radius(self, query, radius, **kwargs):
    method delete_index (line 279) | def delete_index(self, **kwargs):
    method kmeans (line 295) | def kmeans(self, pts, num_clusters, max_iterations = None,
    method hierarchical_kmeans (line 323) | def hierarchical_kmeans(self, pts, branch_size, num_branches,
    method __ensureRandomSeed (line 397) | def __ensureRandomSeed(self, kwargs):

FILE: algorithms/flann/code/src/python/setup.py
  function find_path (line 9) | def find_path():

FILE: data/transformer/src/compute_gnd.cpp
  function main (line 7) | int main(int argc, char** argv)

FILE: data/transformer/src/gnd.h
  function get_dist (line 17) | float get_dist(const float* p1, const float* p2, int d)
  type _pair (line 28) | struct _pair

FILE: data/transformer/src/load_from_hdf.cpp
  function main (line 6) | int main(int argc, char** argv)