ptree.h

Go to the documentation of this file.

/*
 * Copyright (c) 1991-2006 Kawahara Lab., Kyoto University
 * Copyright (c) 2000-2005 Shikano Lab., Nara Institute of Science and Technology
 * Copyright (c) 2005-2006 Julius project team, Nagoya Institute of Technology, Nagoya Institute of Technology
 * All rights reserved
 */

#ifndef __PATRICIA_TREE_H__
#define __PATRICIA_TREE_H__

typedef struct _apatnode {
  union {
    void        *data;          
    int         thres_bit;      
  } value;
  struct _apatnode *left0;      
  struct _apatnode *right1;     
} APATNODE;

typedef struct _patnode {
  union {
    int         data;           
    int         thres_bit;      
  } value;
  struct _patnode *left0;       
  struct _patnode *right1;      
} PATNODE;


int testbit(char *str, int bitplace);
int where_the_bit_differ(char *str1, char *str2);
PATNODE *make_ptree(char **words, int *data, int wordsnum, int bitplace);
void disp_ptree(PATNODE *node, int level);
int ptree_search_data(char *str, PATNODE *rootnode);
PATNODE *ptree_make_root_node(int data);
void ptree_add_entry(char *str, int data, char *matchstr, PATNODE **rootnode);
void free_ptree(PATNODE *rootnode);

void *aptree_search_data(char *str, APATNODE *rootnode);
APATNODE *aptree_make_root_node(void *data);
void aptree_add_entry(char *str, void *data, char *matchstr, APATNODE **rootnode);
void aptree_remove_entry(char *str, APATNODE **rootnode);
void aptree_traverse_and_do(APATNODE *node, void (*callback)(void *));
void free_aptree(APATNODE *rootnode);



#endif /* __PATRICIA_TREE_H__ */

---