| /dports/science/py-dlib/dlib-19.22/dlib/graph_cuts/ |
| H A D | min_cut.h | 28 const node_label FREE_NODE = 255; variable
159 g.set_label(i, FREE_NODE); in operator()
297 g.set_label(p, FREE_NODE); in adopt()
348 g.set_label(p, FREE_NODE); in adopt()
479 if (label_i == FREE_NODE) in grow()
511 if (label_i == FREE_NODE) in grow()
|
| H A D | min_cut_abstract.h | 21 const node_label FREE_NODE = 255; variable
|
| H A D | find_max_factor_graph_potts.h | 143 source_label = FREE_NODE; in potts_flow_graph()
144 sink_label = FREE_NODE; in potts_flow_graph()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/graph_cuts/ |
| H A D | min_cut.h | 28 const node_label FREE_NODE = 255; variable
159 g.set_label(i, FREE_NODE); in operator()
297 g.set_label(p, FREE_NODE); in adopt()
348 g.set_label(p, FREE_NODE); in adopt()
479 if (label_i == FREE_NODE) in grow()
511 if (label_i == FREE_NODE) in grow()
|
| H A D | min_cut_abstract.h | 21 const node_label FREE_NODE = 255; variable
|
| H A D | find_max_factor_graph_potts.h | 143 source_label = FREE_NODE; in potts_flow_graph()
144 sink_label = FREE_NODE; in potts_flow_graph()
|
| /dports/audio/audacity/audacity-Audacity-3.1.3/lib-src/libnyquist/nyquist/xlisp/ |
| H A D | xlimage.c | 121 case FREE_NODE: in xlisave()
147 osbputc(FREE_NODE,fp); in xlisave()
230 case FREE_NODE: in xlirestore()
315 osbputc(FREE_NODE,fp); in setoffset()
|
| H A D | xldmem.h | 104 #define FREE_NODE 0 macro
|
| H A D | xlprin.c | 117 case FREE_NODE: in xlprint()
|
| H A D | xldmem.c | 528 p->n_type = FREE_NODE; in sweep()
|
| H A D | xllist.c | 836 if (list && (ntype(list) == FREE_NODE)) { in xsort()
|
| /dports/lang/seed7/seed7/src/ |
| H A D | flistutl.h | 122 #define FREE_NODE(N) (F_LOG2(N) (N)->next1 = flist.nodes, flist.nodes = (N)) macro
125 #define FREE_NODE(N) FREE_RECORD(N, nodeRecord, count.node) macro
|
| H A D | entutl.c | 89 FREE_NODE(node); in free_nodes()
|
| /dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/image/tzp/ |
| H A D | avl.c | 187 #define FREE_NODE(node) FREE_OBJ(node, NODE_LIST) macro
533 FREE_NODE(node) in avl_insert()
560 FREE_NODE(node) in avl_insert()
1217 FREE_NODE(node) in avl__remove()
1625 FREE_NODE(root) in release_subtree()
1633 FREE_NODE(root) in reset_subtree()
1680 FREE_NODE(newroot->left); in copy_subtree()
1690 FREE_NODE(newroot->right); in copy_subtree()
1715 FREE_NODE(newtree->root) in avl_copy()
|
| /dports/science/py-dlib/dlib-19.22/dlib/test/ |
| H A D | graph_cuts.cpp | 48 labels = FREE_NODE; in dense_potts_problem()
152 labels = FREE_NODE; in image_potts_problem()
524 std::vector<node_label> best_cut(g.number_of_nodes(),FREE_NODE); in brute_force_min_cut()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
| H A D | graph_cuts.cpp | 48 labels = FREE_NODE; in dense_potts_problem()
152 labels = FREE_NODE; in image_potts_problem()
524 std::vector<node_label> best_cut(g.number_of_nodes(),FREE_NODE); in brute_force_min_cut()
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/mca/coll/libnbc/libdict/ |
| H A D | hb_tree.c | 306 #define FREE_NODE(n) \ macro
345 FREE_NODE(node); in hb_tree_remove()
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/mca/coll/libnbc/libdict/ |
| H A D | hb_tree.c | 299 #define FREE_NODE(n) \ macro
338 FREE_NODE(node); in hb_tree_remove()
|
| /dports/audio/audacity/audacity-Audacity-3.1.3/lib-src/libnyquist/nyquist/nyqsrc/ |
| H A D | nyx.c | 167 if (ntype(p) != FREE_NODE) { in freesegs()
199 if (ntype(p) == FREE_NODE) { in freesegs()
|
| /dports/audio/audacity/audacity-Audacity-3.1.3/lib-src/libnyquist/ |
| H A D | nyx.c | 170 if (ntype(p) != FREE_NODE) { in freesegs()
202 if (ntype(p) == FREE_NODE) { in freesegs()
|