| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/LINKERN/ |
| H A D | flip_btc.c | 54 cycle_fillin(int *x, int i, btree *p, int r);
67 cycle_fillin();
120 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
122 static int cycle_fillin(x, i, p, r) in cycle_fillin()
133 i = cycle_fillin (x, i, p->child[r], r);
135 i = cycle_fillin (x, i, p->child[1 - r], r);
147 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_btd.c | 53 cycle_fillin(int *x, int i, btree *p, int r);
66 cycle_fillin();
119 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
121 static int cycle_fillin(x, i, p, r) in cycle_fillin()
132 i = cycle_fillin (x, i, p->child[r], r);
134 i = cycle_fillin (x, i, p->child[1 - r], r);
146 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt0.c | 60 cycle_fillin(int *x, int i, btree *p, int r);
74 cycle_fillin();
146 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
148 static int cycle_fillin(x, i, p, r) in cycle_fillin()
159 i = cycle_fillin (x, i, p->child[r], r);
161 i = cycle_fillin (x, i, p->child[1 - r], r);
173 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_btr.c | 60 cycle_fillin(int *x, int i, btree *p, int r);
74 cycle_fillin();
146 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
148 static int cycle_fillin(x, i, p, r) in cycle_fillin()
159 i = cycle_fillin (x, i, p->child[r], r);
161 i = cycle_fillin (x, i, p->child[1 - r], r);
173 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt3.c | 62 cycle_fillin(int *x, int i, btree *p, int r);
76 cycle_fillin();
164 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
166 static int cycle_fillin(x, i, p, r) in cycle_fillin()
177 i = cycle_fillin (x, i, p->child[r], r);
179 i = cycle_fillin (x, i, p->child[1 - r], r);
196 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt1.c | 62 cycle_fillin(int *x, int i, btree *p, int r);
76 cycle_fillin();
163 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
165 static int cycle_fillin(x, i, p, r) in cycle_fillin()
176 i = cycle_fillin (x, i, p->child[r], r);
178 i = cycle_fillin (x, i, p->child[1 - r], r);
193 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt5.c | 58 cycle_fillin(int *x, int i, btree *p, int r);
71 cycle_fillin();
143 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
145 static int cycle_fillin(x, i, p, r) in cycle_fillin()
156 i = cycle_fillin (x, i, p->child[r], r);
158 i = cycle_fillin (x, i, p->child[1 - r], r);
170 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt2.c | 67 cycle_fillin(int *x, int i, btree *p, int r);
81 cycle_fillin();
183 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
185 static int cycle_fillin(x, i, p, r) in cycle_fillin()
196 i = cycle_fillin (x, i, p->child[r], r);
198 i = cycle_fillin (x, i, p->child[1 - r], r);
215 return cycle_fillin (x, 0, root, 0);
|
| H A D | flip_bt4.c | 71 cycle_fillin(int *x, int i, btree *p, int r);
86 cycle_fillin();
210 static int cycle_fillin(int *x, int i, btree *p, int r) in cycle_fillin() function
212 static int cycle_fillin(x, i, p, r) in cycle_fillin()
227 i = cycle_fillin (x, i, p->child[r], r);
229 i = cycle_fillin (x, i, p->child[1 - r], r);
246 return cycle_fillin (x, 0, root, 0);
|