OLD | NEW |
1 /* $Id: inttree.h 2101 2008-05-23 06:46:51Z peter $ */ | |
2 #ifndef YASM_INTTREE_H | 1 #ifndef YASM_INTTREE_H |
3 #define YASM_INTTREE_H | 2 #define YASM_INTTREE_H |
4 | 3 |
5 #ifndef YASM_LIB_DECL | 4 #ifndef YASM_LIB_DECL |
6 #define YASM_LIB_DECL | 5 #define YASM_LIB_DECL |
7 #endif | 6 #endif |
8 | 7 |
9 /* The interval_tree.h and interval_tree.cc files contain code for | 8 /* The interval_tree.h and interval_tree.cc files contain code for |
10 * interval trees implemented using red-black-trees as described in | 9 * interval trees implemented using red-black-trees as described in |
11 * the book _Introduction_To_Algorithms_ by Cormen, Leisserson, | 10 * the book _Introduction_To_Algorithms_ by Cormen, Leisserson, |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
62 IntervalTreeNode *IT_insert(IntervalTree *, long low, long high, void *data); | 61 IntervalTreeNode *IT_insert(IntervalTree *, long low, long high, void *data); |
63 YASM_LIB_DECL | 62 YASM_LIB_DECL |
64 IntervalTreeNode *IT_get_predecessor(const IntervalTree *, IntervalTreeNode *); | 63 IntervalTreeNode *IT_get_predecessor(const IntervalTree *, IntervalTreeNode *); |
65 YASM_LIB_DECL | 64 YASM_LIB_DECL |
66 IntervalTreeNode *IT_get_successor(const IntervalTree *, IntervalTreeNode *); | 65 IntervalTreeNode *IT_get_successor(const IntervalTree *, IntervalTreeNode *); |
67 YASM_LIB_DECL | 66 YASM_LIB_DECL |
68 void IT_enumerate(IntervalTree *, long low, long high, void *cbd, | 67 void IT_enumerate(IntervalTree *, long low, long high, void *cbd, |
69 void (*callback) (IntervalTreeNode *node, void *cbd)); | 68 void (*callback) (IntervalTreeNode *node, void *cbd)); |
70 | 69 |
71 #endif | 70 #endif |
OLD | NEW |