Main Page | Data Structures | File List | Data Fields | Globals

distance.h File Reference

Go to the source code of this file.

Data Structures

struct  matrix

Defines

#define max(a, b)   ((a) >= (b) ? (a) : (b))
#define min(a, b)   ((a) <= (b) ? (a) : (b))

Functions

int levenshtein_d (const void *d1, size_t len1, const void *d2, size_t len2)
int hamming_d (const void *d1, size_t len1, const void *d2, size_t len2)
void bloom_create (const void *data, size_t len, const void *digest, size_t digest_len)
double bloom_d (const void *digest1, const void *digest2, size_t digest_len)
double mod_levenshtein_d (const void *d1, size_t len1, const void *d2, size_t len2, struct matrix *m)


Define Documentation

#define max a,
 )     ((a) >= (b) ? (a) : (b))
 

#define min a,
 )     ((a) <= (b) ? (a) : (b))
 


Function Documentation

void bloom_create const void *  data,
size_t  len,
const void *  digest,
size_t  digest_len
 

double bloom_d const void *  digest1,
const void *  digest2,
size_t  digest_len
 

int hamming_d const void *  d1,
size_t  len1,
const void *  d2,
size_t  len2
 

int levenshtein_d const void *  d1,
size_t  len1,
const void *  d2,
size_t  len2
 

double mod_levenshtein_d const void *  d1,
size_t  len1,
const void *  d2,
size_t  len2,
struct matrix mt
 

calculate the cost between two inputs using a cost matrix. this matrix carries with it the costs for any conversions and insertions. for example, going from A to a may be low cost, but A to B may be high cost.


Generated on Tue May 18 20:32:17 2004 for libdistance by doxygen 1.3.7