| /dports/math/eprover/eprover-E-2.0/BASICS/ |
| H A D | clb_floattrees.c | 68 new.rson = NULL; in splay_tree()
98 if (!tree->rson) in splay_tree()
113 left->rson = tree; in splay_tree()
115 tree = tree->rson; in splay_tree()
122 left->rson = tree->lson; in splay_tree()
124 tree->lson = new.rson; in splay_tree()
125 tree->rson = new.lson; in splay_tree()
191 if(junk->rson) in FloatTreeFree()
231 new->rson = *root; in FloatTreeInsert()
238 new->rson = (*root)->rson; in FloatTreeInsert()
[all …]
|
| H A D | clb_numxtrees.c | 66 newnode.rson = NULL; in splay_tree()
96 if (!tree->rson) in splay_tree()
106 if (!tree->rson) in splay_tree()
111 left->rson = tree; in splay_tree()
113 tree = tree->rson; in splay_tree()
120 left->rson = tree->lson; in splay_tree()
121 right->lson = tree->rson; in splay_tree()
193 if(junk->rson) in NumXTreeFree()
240 newnode->rson = (*root)->rson; in NumXTreeInsert()
344 x->rson = (*root)->rson; in NumXTreeExtractEntry()
[all …]
|
| H A D | clb_stringtrees.c | 70 newnode.rson = NULL; in splay_tree()
100 if (!tree->rson) in splay_tree()
110 if (!tree->rson) in splay_tree()
115 left->rson = tree; in splay_tree()
117 tree = tree->rson; in splay_tree()
124 left->rson = tree->lson; in splay_tree()
125 right->lson = tree->rson; in splay_tree()
184 StrTreeFree(junk->rson); in StrTreeFree()
227 newnode->rson = (*root)->rson; in StrTreeInsert()
229 (*root)->rson = NULL; in StrTreeInsert()
[all …]
|
| H A D | clb_numtrees.c | 124 newnode.rson = NULL; in splay_tree()
154 if (!tree->rson) in splay_tree()
164 if (!tree->rson) in splay_tree()
169 left->rson = tree; in splay_tree()
171 tree = tree->rson; in splay_tree()
178 left->rson = tree->lson; in splay_tree()
247 if(junk->rson) in NumTreeFree()
294 newnode->rson = (*root)->rson; in NumTreeInsert()
296 (*root)->rson = NULL; in NumTreeInsert()
418 x->rson = (*root)->rson; in NumTreeExtractEntry()
[all …]
|
| H A D | clb_quadtrees.c | 67 newnode.rson = NULL; in splay_tree()
84 tmp->rson = tree; in splay_tree()
97 if (!tree->rson) in splay_tree()
103 tmp = tree->rson; in splay_tree()
107 if (!tree->rson) in splay_tree()
112 left->rson = tree; in splay_tree()
114 tree = tree->rson; in splay_tree()
216 if(junk->rson) in QuadTreeFree()
265 newnode->rson = (*root)->rson; in QuadTreeInsert()
368 x = (*root)->rson; in QuadTreeExtractEntry()
[all …]
|
| H A D | clb_objtrees.c | 67 newnode.rson = NULL; in splay_tree()
84 tmp->rson = tree; in splay_tree()
97 if (!tree->rson) in splay_tree()
103 tmp = tree->rson; in splay_tree()
107 if (!tree->rson) in splay_tree()
112 left->rson = tree; in splay_tree()
114 tree = tree->rson; in splay_tree()
175 newnode->rson = (*root)->rson; in PTreeObjInsert()
301 root = root->rson; in PTreeObjFindBinary()
342 x = (*root)->rson; in PTreeObjExtractEntry()
[all …]
|
| H A D | clb_ptrees.c | 64 newnode.rson = NULL; in splay_ptree()
80 tmp->rson = tree; in splay_ptree()
93 if (!tree->rson) in splay_ptree()
99 tmp = tree->rson; in splay_ptree()
103 if (!tree->rson) in splay_ptree()
108 left->rson = tree; in splay_ptree()
110 tree = tree->rson; in splay_ptree()
186 if(junk->rson) in PTreeFree()
231 newnode->rson = (*root)->rson; in PTreeInsert()
323 root = root->rson; in PTreeFindBinary()
[all …]
|
| /dports/math/eprover/eprover-E-2.0/TERMS/ |
| H A D | cte_termtrees.c | 67 new.rson = NULL; in splay_term_tree()
97 if (!tree->rson) in splay_term_tree()
112 left->rson = tree; in splay_term_tree()
114 tree = tree->rson; in splay_term_tree()
121 left->rson = tree->lson; in splay_term_tree()
123 tree->lson = new.rson; in splay_term_tree()
124 tree->rson = new.lson; in splay_term_tree()
164 if(junk->rson) in TermTreeFree()
282 new->rson = *root; in TermTreeInsert()
289 new->rson = (*root)->rson; in TermTreeInsert()
[all …]
|
| H A D | cte_simpletypes.c | 59 res->rson = NULL; in TypeAlloc()
85 junk->rson = NULL; in TypeFree()
118 new.rson = NULL; in splay_type()
148 if (!tree->rson) in splay_type()
163 left->rson = tree; in splay_type()
165 tree = tree->rson; in splay_type()
174 tree->lson = new.rson; in splay_type()
175 tree->rson = new.lson; in splay_type()
236 new->rson = *root; in TypeTreeInsert()
243 new->rson = (*root)->rson; in TypeTreeInsert()
[all …]
|
| /dports/editors/biew/biew-610/tools/lzss/ |
| H A D | lzssutil.c | 78 if (rson[p] != NIL) p = rson[p]; in InsertNode()
91 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
93 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
108 if (rson[q] != NIL) { in DeleteNode()
109 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
113 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
116 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode()
140 if(rson) PFREE(rson); in Encode()
232 PFREE(rson); in Encode()
271 if(rson) PFREE(rson); in Decode()
[all …]
|
| /dports/games/quake2-lights/quake2-lights-1/lights/src/ace/ |
| H A D | acebot_compress.c | 68 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
71 if (rson[p] != NIL) p = rson[p]; in InsertNode()
84 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
85 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
86 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
96 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
97 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
100 if (rson[q] != NIL) { in DeleteNode()
101 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
105 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/qudos/QuDos-0.40.1-src/src/mods/xatrix/ace/ |
| H A D | acebot_compress.c | 67 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
70 if (rson[p] != NIL) p = rson[p]; in InsertNode()
83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
95 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
96 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
99 if (rson[q] != NIL) { in DeleteNode()
100 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/qudos/QuDos-0.40.1-src/src/mods/zaero/ace/ |
| H A D | acebot_compress.c | 67 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
70 if (rson[p] != NIL) p = rson[p]; in InsertNode()
83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
95 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
96 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
99 if (rson[q] != NIL) { in DeleteNode()
100 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/qudos/QuDos-0.40.1-src/src/mods/rogue/ace/ |
| H A D | acebot_compress.c | 67 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
70 if (rson[p] != NIL) p = rson[p]; in InsertNode()
83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
95 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
96 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
99 if (rson[q] != NIL) { in DeleteNode()
100 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/qudos/QuDos-0.40.1-src/src/game/ace/ |
| H A D | acebot_compress.c | 67 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
70 if (rson[p] != NIL) p = rson[p]; in InsertNode()
83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
95 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
96 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
99 if (rson[q] != NIL) { in DeleteNode()
100 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/uqm/uqm-0.8.0/src/libs/decomp/ |
| H A D | lzencode.c | 33 static SWORD *rson; variable
87 p = rson[p]; in InsertNode()
90 rson[p] = r; in InsertNode()
135 rson[r] = rson[p]; in InsertNode()
137 dad[rson[p]] = r; in InsertNode()
139 rson[dad[p]] = r; in InsertNode()
155 q = rson[p]; in DeleteNode()
163 q = rson[q]; in DeleteNode()
170 rson[q] = rson[p]; in DeleteNode()
171 dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/math/eprover/eprover-E-2.0/CLAUSES/ |
| H A D | ccl_neweval.c | 89 newnode->evals[pos].rson = NULL; in splay_tree()
106 tmp->evals[pos].rson = tree; in splay_tree()
119 if (!tree->evals[pos].rson) in splay_tree()
125 tmp = tree->evals[pos].rson; in splay_tree()
129 if (!tree->evals[pos].rson) in splay_tree()
134 left->evals[pos].rson = tree; in splay_tree()
136 tree = tree->evals[pos].rson; in splay_tree()
453 newnode->evals[pos].rson = (*root)->evals[pos].rson; in EvalTreeInsert()
455 (*root)->evals[pos].rson = NULL; in EvalTreeInsert()
522 x->evals[pos].rson = (*root)->evals[pos].rson; in EvalTreeExtractEntry()
[all …]
|
| /dports/games/ags/ags_linux_v.3.4.4.1/Common/util/ |
| H A D | lzw.cpp | 48 #define rson (node+1+N+N) macro
67 lson[i] = rson[i] = NIL; in insert()
80 p = &rson[j]; in insert()
85 dad[rson[j]] = rson + i - node; in insert()
87 rson[i] = rson[j]; in insert()
102 if (rson[z] == NIL) in _delete()
105 j = rson[z]; in _delete()
108 if (rson[j] != NIL) { in _delete()
110 j = rson[j]; in _delete()
119 rson[j] = rson[z]; in _delete()
[all …]
|
| /dports/devel/allegro/allegro-4.4.3.1/src/ |
| H A D | lzss.c | 138 dat->rson[i] = N; in lzss_inittree()
169 if (dat->rson[p] != N) in lzss_insertnode()
170 p = dat->rson[p]; in lzss_insertnode()
172 dat->rson[p] = r; in lzss_insertnode()
200 dat->rson[r] = dat->rson[p]; in lzss_insertnode()
222 if (dat->rson[p] == N) in lzss_deletenode()
226 q = dat->rson[p]; in lzss_deletenode()
229 if (dat->rson[q] != N) { in lzss_deletenode()
231 q = dat->rson[q]; in lzss_deletenode()
238 dat->rson[q] = dat->rson[p]; in lzss_deletenode()
[all …]
|
| /dports/games/scummvm/scummvm-2.5.1/engines/ags/shared/util/ |
| H A D | lzw.cpp | 52 #define rson (_G(node)+1+N+N) macro
65 lson[i] = rson[i] = NIL; in insert()
78 p = &rson[j]; in insert()
83 dad[rson[j]] = rson + i - _G(node); in insert()
85 rson[i] = rson[j]; in insert()
99 if (rson[z] == NIL) in _delete()
102 j = rson[z]; in _delete()
105 if (rson[j] != NIL) { in _delete()
107 j = rson[j]; in _delete()
116 rson[j] = rson[z]; in _delete()
[all …]
|
| /dports/games/bstone/bstone-1.1.9/src/ |
| H A D | jm_lzh.cpp | 428 if (!(rson = farmalloc((N + 257) * sizeof(*rson)))) { in LZH_Startup()
490 if (rson) { in LZH_Shutdown()
491 farfree(rson); in LZH_Shutdown()
520 rson = id_rson; in StartHuff()
662 if (rson[p] == NIL) { in DeleteNode()
665 q = rson[p]; in DeleteNode()
679 rson[q] = rson[p]; in DeleteNode()
680 dad[rson[p]] = q; in DeleteNode()
686 rson[dad[p]] = q; in DeleteNode()
751 rson[r] = rson[p]; in InsertNode()
[all …]
|
| /dports/games/xray_re-tools/xray_re-tools-52721d2/garbage/lzhuf/ |
| H A D | lzhuf.c | 65 p = rson[p]; in InsertNode()
67 rson[p] = r; in InsertNode()
98 rson[r] = rson[p]; in InsertNode()
100 dad[rson[p]] = r; in InsertNode()
102 rson[dad[p]] = r; in InsertNode()
114 if (rson[p] == NIL) in DeleteNode()
118 q = rson[p]; in DeleteNode()
123 q = rson[q]; in DeleteNode()
130 rson[q] = rson[p]; in DeleteNode()
131 dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Framework/src/ |
| H A D | LzAri.cpp | 112 rson[r] = lson[r] = NIL; match_length = 0; in InsertNode()
115 if (rson[p] != NIL) p = rson[p]; in InsertNode()
133 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode()
134 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode()
135 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode()
145 if (rson[p] == NIL) q = lson[p]; in DeleteNode()
146 else if (lson[p] == NIL) q = rson[p]; in DeleteNode()
149 if (rson[q] != NIL) { in DeleteNode()
150 do { q = rson[q]; } while (rson[q] != NIL); in DeleteNode()
154 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/xray_re-tools/xray_re-tools-52721d2/sources/xray_re/ |
| H A D | xr_lzhuf.cxx | 46 p = rson[p]; in InsertNode()
48 rson[p] = r; in InsertNode()
79 rson[r] = rson[p]; in InsertNode()
81 dad[rson[p]] = r; in InsertNode()
83 rson[dad[p]] = r; in InsertNode()
95 if (rson[p] == NIL) in DeleteNode()
99 q = rson[p]; in DeleteNode()
104 q = rson[q]; in DeleteNode()
111 rson[q] = rson[p]; in DeleteNode()
112 dad[rson[p]] = q; in DeleteNode()
[all …]
|
| /dports/games/xray_re-tools/xray_re-tools-52721d2/sources/plugins/xray_fsl/Core/Code/ |
| H A D | lzhuf.cpp | 57 p = rson[p]; in InsertNode()
59 rson[p] = r; in InsertNode()
90 rson[r] = rson[p]; in InsertNode()
92 dad[rson[p]] = r; in InsertNode()
94 rson[dad[p]] = r; in InsertNode()
106 if (rson[p] == NIL) in DeleteNode()
110 q = rson[p]; in DeleteNode()
115 q = rson[q]; in DeleteNode()
122 rson[q] = rson[p]; in DeleteNode()
123 dad[rson[p]] = q; in DeleteNode()
[all …]
|