ttree.h

Go to the documentation of this file.

#ifndef  __JBXL_TINY_TREE_H_
#define  __JBXL_TINY_TREE_H_
 
#include "buffer.h"
#include "tlist.h"
 
 
typedef  tList        tTree;
 
 
#define    TREE_ANCHOR_NODE  JBXL_STATE_ANCHOR        
#define    TREE_NOCTRL_NODE                  0        
#define    TREE_NOCMP_NODE                 100        
#define    TREE_NOCMP_COPY_NODE            101        
#define    TREE_COPY_NODE                  102        
#define    TREE_NOSIS_NODE                 103        
#define    TREE_DELETE_NODE                104        
#define    TREE_KEEP_NODE                  105        
#define    TREE_ALREADY_FOUND_NODE         110        
#define    TREE_ALREADY_FOUND_NODE_TEMP    111        
 
 
// Tiny Tree Graph Node
 
tTree*  new_tTree_node(void);                           
tTree*  new_tTree_anchor_node(void);                    
tTree   make_tTree_node(tList_data data);               
tTree*  del_tTree_anchor_node(tTree* node);             
#define del_tTree_anchor(t) del_tTree_anchor_node((t))  
#define new_tTree()         new_tTree_node()            
#define new_tTree_anchor()  new_tTree_anchor_node()     
 
tTree*  add_tTree_node         (tTree* pp, tTree* node);        
tTree*  add_tTree_node_bydata  (tTree* pp, tList_data ldat);    
tTree*  add_tTree_node_bystr   (tTree* pp, int id, int lv, const char*  key, const char*  val, void* ptr, int sz);  
tTree*  add_tTree_node_byBuffer(tTree* pp, int id, int lv, Buffer key, Buffer val, void* ptr, int sz);          
 
#define add_tTree_node_int(p, k, v)         add_tTree_node_bystr((p), (k), (v), NULL, NULL, NULL, 0)            
#define add_tTree_node_str(p, k, v)         add_tTree_node_bystr((p), 0, 0, (char*)(k), (char*)(v), NULL, 0)    
#define add_tTree_node_Buffer(p, k, v)      add_tTree_node_byBuffer((p), 0, 0, (k), (v), NULL, 0)               
 
tTree*  insert_tTree_node         (tTree* pp, tTree* pt);       
tTree*  insert_tTree_node_bydata  (tTree* pp, tList_data ldat); 
tTree*  insert_tTree_node_bystr   (tTree* pp, int id, int lv, const char*  key, const char*  val, void* ptr, int sz); 
tTree*  insert_tTree_node_byBuffer(tTree* pp, int id, int lv, Buffer key, Buffer val, void* ptr, int sz);       
 
#define insert_tTree_node_int(p, k, v)      insert_tTree_node_bystr((p), (k), (v), NULL, NULL, NULL, 0)         
#define insert_tTree_node_str(p, k, v)      insert_tTree_node_bystr((p), 0, 0, (char*)(k), (char*)(v), NULL, 0) 
#define insert_tTree_node_Buffer(p, k, v)   insert_tTree_node_byBuffer((p), 0, 0, (k), (v), NULL, 0)            
 
tTree*  move_tTree_node(tTree* node, tTree* pp);                                        
int     replace_all_tTree_node(tTree* pp, char* key, char* src, char* dst, int len);    
tTree*  del_tTree_node(tTree** node); 
tTree*  free_tTree_node(tTree* node); 
 
#define set_tTree_node_bydata(p, k)                  set_tList_node_bydata((p), (k))                            
#define set_tTree_node_bystr(p, i, l, k, v, d, s)    set_tList_node_bystr((p), (i), (l), (k), (v), (d), (s))    
#define set_tTree_node_byBuffer(p, i, l, k, v, d, s) set_tList_node_byBuffer((p), (i), (l), (k), (v), (d), (s)) 
 
#define set_tTree_node_int(p, k, d)          set_tList_node_bystr((p), (k), (v), NULL, NULL, NULL, 0)           
#define set_tTree_node_str(p, k, d)          set_tList_node_bystr((p), 0, 0, (char*)(k), (char*)(v), NULL, 0)   
#define set_tTree_node_Buffer(p, k, d)       set_tList_node_byBuffer((p), 0, 0, (k), (v), NULL, 0)              
 
#define dup_tTree_node(p)                    dup_tList_node(p)                                                  
 
 
// Tiny Tree Graph
 
void    del_delete_node_tTree(tTree** pp);      
void    _del_delete_node_tTree(tTree** pp);     
void    del_non_keep_node_tTree(tTree** pp);    
void    _del_non_keep_node_tTree(tTree** pp);   
 
tTree*  del_tTree(tTree** pp);                  
void    del_all_tTree(tTree** pp);              
tTree*  del_children_tTree(tTree** pp);         
tTree*  del_sisters_tTree(tTree** pp);          
tTree*  del_sisters_children_tTree(tTree** pp); 
 
void    adjust_tTree_depth(tTree* pp);          
void    print_tTree(FILE* fp, tTree* pp);       
void    print_tTree_tree(FILE* fp, tTree* pp, const char* space);  
 
tTree*  add_tTree(tTree* pp, tTree* pt);        
tTree*  div_tTree(tTree* pp);                   
tTree*  dup_merge_tTree(tTree* pp, tTree* tp);  
void    merge_tTree(tTree* tp, tTree* tt);      
void    exchange_tTree(tTree* tl, tTree* tt);   
int     count_tTree(tTree* pp);                 
 
#define find_tTree_top(p)   find_tList_top((p)) 
tTree*  find_tTree_end(tTree* pp);              
 
// 検索/置換
tTree*  strncmp_tTree    (tTree* pp, const char*  key, int len, int no);
tTree*  strncasecmp_tTree(tTree* pp, const char*  key, int len, int no);
 
int     find_match_tTree  (tTree* pp, tTree* pt);                       
tList*  find_match_tTree_endlist(tTree* pp, tTree* pt);                 
tList*  _find_match_tTree_endlist_rcsv(tTree* pp, tTree* pt, tTree* te);
 
int     check_match_tTree (tTree* tp, tTree* tr);   
tTree*  cmp_sisters_tTree (tTree* tp, tTree* tr);   
 
int     replace_tTree_node(tTree* pp, tTree* pt);   
void    _copy_tTree_byctrl (tTree* pt);             
void    _clear_tTree_ctrl  (tTree* pp);             
 
Buffer  get_value_tTree  (tTree* pp, tTree* pt);    
#define set_value_tTree(p, t)    replace_tTree_node((p), (t))   
 
// 補助的関数
tTree*  _next_strncmp_vertical_tTree    (tTree* pp, const char* key, int len, int no, int* nn);  
tTree*  _next_strncasecmp_vertical_tTree(tTree* pp, const char* key, int len, int no, int* nn);  
 
tTree*  _next_strncmp_horizon_tTree    (tTree* pp, const char* key, int len, int no, int* nn);   
tTree*  _next_strncasecmp_horizon_tTree(tTree* pp, const char* key, int len, int no, int* nn);   
 
 
#endif  // __JBXL_TINY_TREE_H_