| /dports/biology/p5-AcePerl/AcePerl-1.92/acelib/ |
| H A D | helpsubs.c | 731 node->left = leftnode ; in parseHtml()
766 node->left = leftnode ; in parseHead()
801 node->left = leftnode ; in parseBody()
916 node->left = leftnode ; in parseHeader()
951 node->left = leftnode ; in parseCode()
986 node->left = leftnode ; in parseBold()
1021 node->left = leftnode ; in parseStrong()
1056 node->left = leftnode ; in parseItalic()
1214 node->left = leftnode ; in parseHref()
1353 node->left = leftnode ; in parseListItem()
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/fs/unicode/ |
| H A D | mkutf8data.c | 371 unsigned char leftnode; member
500 node->leftnode = NODE; in alloc_node()
566 node->leftnode = LEAF; in insert()
586 parent->leftnode = LEAF; in insert()
681 if (node->leftnode == LEAF) in prune()
702 if (left->leftnode == LEAF) in prune()
716 if (right->leftnode == LEAF) in prune()
792 node->leftnode == NODE && in prune()
1034 if (node->leftnode == NODE) in mark_subtree()
1232 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/fs/unicode/ |
| H A D | mkutf8data.c | 371 unsigned char leftnode; member
500 node->leftnode = NODE; in alloc_node()
566 node->leftnode = LEAF; in insert()
586 parent->leftnode = LEAF; in insert()
681 if (node->leftnode == LEAF) in prune()
702 if (left->leftnode == LEAF) in prune()
716 if (right->leftnode == LEAF) in prune()
792 node->leftnode == NODE && in prune()
1034 if (node->leftnode == NODE) in mark_subtree()
1232 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/misc/e2fsprogs-libblkid/e2fsprogs-1.46.5/util/ |
| H A D | mkutf8data.c | 369 unsigned char leftnode; member
498 node->leftnode = NODE; in alloc_node()
564 node->leftnode = LEAF; in insert()
584 parent->leftnode = LEAF; in insert()
679 if (node->leftnode == LEAF) in prune()
700 if (left->leftnode == LEAF) in prune()
714 if (right->leftnode == LEAF) in prune()
790 node->leftnode == NODE && in prune()
1032 if (node->leftnode == NODE) in mark_subtree()
1230 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/misc/e2fsprogs-libuuid/e2fsprogs-1.46.5/util/ |
| H A D | mkutf8data.c | 369 unsigned char leftnode; member
498 node->leftnode = NODE; in alloc_node()
564 node->leftnode = LEAF; in insert()
584 parent->leftnode = LEAF; in insert()
679 if (node->leftnode == LEAF) in prune()
700 if (left->leftnode == LEAF) in prune()
714 if (right->leftnode == LEAF) in prune()
790 node->leftnode == NODE && in prune()
1032 if (node->leftnode == NODE) in mark_subtree()
1230 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/sysutils/e2fsprogs/e2fsprogs-1.46.5/util/ |
| H A D | mkutf8data.c | 369 unsigned char leftnode; member
498 node->leftnode = NODE; in alloc_node()
564 node->leftnode = LEAF; in insert()
584 parent->leftnode = LEAF; in insert()
679 if (node->leftnode == LEAF) in prune()
700 if (left->leftnode == LEAF) in prune()
714 if (right->leftnode == LEAF) in prune()
790 node->leftnode == NODE && in prune()
1032 if (node->leftnode == NODE) in mark_subtree()
1230 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/fs/unicode/ |
| H A D | mkutf8data.c | 371 unsigned char leftnode; member
500 node->leftnode = NODE; in alloc_node()
566 node->leftnode = LEAF; in insert()
586 parent->leftnode = LEAF; in insert()
681 if (node->leftnode == LEAF) in prune()
702 if (left->leftnode == LEAF) in prune()
716 if (right->leftnode == LEAF) in prune()
792 node->leftnode == NODE && in prune()
1034 if (node->leftnode == NODE) in mark_subtree()
1232 if (node->leftnode == NODE) in emit()
[all …]
|
| /dports/net-mgmt/pmacct/pmacct-1.7.5/src/isis/ |
| H A D | dict.c | 1132 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1143 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1144 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1148 } else if (leftnode != NULL) { in dict_merge()
1153 assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1159 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1161 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1163 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1164 leftnode = next; in dict_merge()
|
| /dports/games/freecell-solver/freecell-solver-6.2.0/ |
| H A D | kaz_tree.c | 1516 dnode_t *leftnode = fc_solve_kaz_tree_first(dest), in dict_merge() local
1531 if (leftnode != NULL && rightnode != NULL) in dict_merge()
1533 if (dest->compare(leftnode->key, rightnode->key, source->context) < in dict_merge()
1539 else if (leftnode != NULL) in dict_merge()
1549 assert(leftnode == NULL && rightnode == NULL); in dict_merge()
1554 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1556 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1558 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1559 leftnode = next; in dict_merge()
|
| /dports/net/quagga/quagga-1.2.4/isisd/ |
| H A D | dict.c | 1130 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1141 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1142 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1146 } else if (leftnode != NULL) { in dict_merge()
1151 assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1157 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1159 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1161 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1162 leftnode = next; in dict_merge()
|
| /dports/misc/e2fsprogs-libblkid/e2fsprogs-1.46.5/lib/support/ |
| H A D | dict.c | 1185 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1196 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1197 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1201 } else if (leftnode != NULL) { in dict_merge()
1206 dict_assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1212 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1214 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1216 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1217 leftnode = next; in dict_merge()
|
| /dports/misc/e2fsprogs-libuuid/e2fsprogs-1.46.5/lib/support/ |
| H A D | dict.c | 1185 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1196 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1197 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1201 } else if (leftnode != NULL) { in dict_merge()
1206 dict_assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1212 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1214 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1216 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1217 leftnode = next; in dict_merge()
|
| /dports/sysutils/e2fsprogs/e2fsprogs-1.46.5/lib/support/ |
| H A D | dict.c | 1185 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source); in dict_merge() local
1196 if (leftnode != NULL && rightnode != NULL) { in dict_merge()
1197 if (dest->compare(leftnode->key, rightnode->key) < 0) in dict_merge()
1201 } else if (leftnode != NULL) { in dict_merge()
1206 dict_assert (leftnode == NULL && rightnode == NULL); in dict_merge()
1212 dnode_t *next = dict_next(dest, leftnode); in dict_merge()
1214 leftnode->left = NULL; /* suppress assertion in dict_load_next */ in dict_merge()
1216 dict_load_next(&load, leftnode, leftnode->key); in dict_merge()
1217 leftnode = next; in dict_merge()
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/Mono.C5/C5/trees/ |
| H A D | RedBlackTreeBag.cs | 127 if (e != null && e.lastgeneration >= treegen && e.leftnode) in left()
130 if (n.lastgeneration >= generation && n.leftnode) in left()
150 if (n.lastgeneration >= generation && !n.leftnode) in right()
207 public bool leftnode; field in C5.TreeBag.Node.Extra
219 public bool leftnode; field in C5.TreeBag.Node
233 Node oldref = leftnode ? cursor.left : cursor.right; in update()
247 extra.leftnode = leftnode; in update()
251 else if (cursor.extra.leftnode != leftnode || cursor.extra.lastgeneration < maxsnapid) in update()
255 cursor.leftnode = leftnode; in update()
259 else if (cursor.leftnode != leftnode || cursor.lastgeneration < maxsnapid) in update()
[all …]
|
| H A D | RedBlackTreeSet.cs | 127 if (e != null && e.lastgeneration >= treegen && e.leftnode) in left()
130 if (n.lastgeneration >= generation && n.leftnode) in left()
150 if (n.lastgeneration >= generation && !n.leftnode) in right()
207 public bool leftnode; field in C5.TreeSet.Node.Extra
219 public bool leftnode; field in C5.TreeSet.Node
233 Node oldref = leftnode ? cursor.left : cursor.right; in update()
247 extra.leftnode = leftnode; in update()
251 else if (cursor.extra.leftnode != leftnode || cursor.extra.lastgeneration < maxsnapid) in update()
255 cursor.leftnode = leftnode; in update()
259 else if (cursor.leftnode != leftnode || cursor.lastgeneration < maxsnapid) in update()
[all …]
|
| /dports/devel/libarea/libarea-2752cd9/kbool/src/ |
| H A D | scanbeam.cpp | 1060 Node * leftnode; //left node of clossest link in ProcessHoles() local
1062 leftnode = link->GetBeginNode(): in ProcessHoles()
1063 leftnode = link->GetEndNode(); in ProcessHoles()
1066 KBoolLink *link_A = new KBoolLink(0, link->m_user_data, leftnode, node_A, _GC); in ProcessHoles()
1070 link_D->Replace(leftnode,node_A); in ProcessHoles()
|
| /dports/textproc/p5-LaTeX-TOM/LaTeX-TOM-1.03/lib/LaTeX/TOM/ |
| H A D | Parser.pm | 473 my ($leftnode, $rightnode) = $node->split($a, $b);
496 splice @{$tree->{nodes}}, $i, 1, $leftnode, $commandnode, $rightnode;
691 … my ($leftnode, $textnode3) = $node->split($rightpos, $rightpos + length($right) - 1);
692 … my ($textnode1, $textnode2) = $leftnode->split($leftpos, $leftpos + length($left) - 1);
1008 my ($leftnode, $rightnode) = $node->split($idx, $idx + length($command));
1014 splice @{$tree->{nodes}}, $i, 1, $leftnode, @{$applied->{nodes}}, $rightnode;
1627 my ($leftnode, $rightnode) = $node->split($idx, $idx + length($all) - 1);
1636 splice @{$template->{nodes}}, $i, 1, $leftnode, @{$param->{nodes}}, $rightnode;
|
| /dports/graphics/Coin/coin-Coin-4.0.0/include/Inventor/VRMLnodes/ |
| H A D | SoVRMLTransform.h | 65 void combineLeft(SoVRMLTransform * leftnode);
|
| /dports/net-p2p/go-ethereum/go-ethereum-1.10.14/trie/ |
| H A D | proof.go | 262 leftnode, rightnode := rn.Children[left[pos]], rn.Children[right[pos]]
263 if leftnode == nil || rightnode == nil || leftnode != rightnode {
|
| /dports/biology/stringtie/stringtie-2.1.1/ |
| H A D | rlink.h | 283 CNodeCapacity(int nid=0,bool leftnode=false,float p=0): id(nid),left(leftnode),perc(p) {} in id()
374 int leftnode; member
378 …CGJunc(int n1=0,int n2=0,double _cov=0,double _goodcov=0):leftnode(n1),rightnode(n2),cov(_cov),goo… in leftnode() function
|
| /dports/graphics/Coin/coin-Coin-4.0.0/src/vrml97/ |
| H A D | Transform.cpp | 361 SoVRMLTransform::combineLeft(SoVRMLTransform * leftnode) in combineLeft() argument
364 ma.apply(leftnode); in combineLeft()
|
| /dports/devel/mercurial/mercurial-6.0/mercurial/templates/json/ |
| H A D | map | 183 "leftnode": {leftnode|json},
|
| /dports/graphics/blender/blender-2.91.0/intern/cycles/bvh/ |
| H A D | bvh_build.cpp | 635 BVHNode *leftnode = build_node(left, level + 1); in build_node() local
638 inner = new InnerNode(bounds, leftnode, rightnode); in build_node()
741 BVHNode *leftnode = build_node(left, references, level + 1, storage); in build_node() local
746 inner = new InnerNode(bounds, leftnode, rightnode); in build_node()
|
| /dports/devel/mercurial/mercurial-6.0/mercurial/templates/monoblue/ |
| H A D | filecomparison.tmpl | 59 <th>{leftrev}:{leftnode|short}</th>
|
| /dports/devel/mercurial/mercurial-6.0/mercurial/templates/gitweb/ |
| H A D | filecomparison.tmpl | 65 <th>{leftrev}:{leftnode|short}</th>
|