Home
last modified time | relevance | path

Searched refs:right_tree (Results 1 – 25 of 75) sorted by relevance

123

/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/utils/lit/lit/builtin_commands/
H A Ddiff.py129 left_tree, right_tree = dir_trees[0], dir_trees[1]
133 if left_tree[1] is None and right_tree[1] is None:
136 os.path.join(right_base, right_tree[0])])
138 if left_tree[1] is None and right_tree[1] is not None:
140 os.path.join(right_base, right_tree[0]))
143 if left_tree[1] is not None and right_tree[1] is None:
145 os.path.join(right_base, right_tree[0]))
151 right_names = [node[0] for node in right_tree[1]]
161 printOnlyIn(right_base, right_tree[0], right_names[r])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/lang/rust/rustc-1.58.1-src/library/alloc/src/collections/btree/
H A Dappend.rs69 let mut right_tree = Root::new(); in bulk_push() localVariable
71 right_tree.push_internal_level(); in bulk_push()
73 open_node.push(key, value, right_tree); in bulk_push()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dfractional_matching.h979 alternatePath(right, right_tree); in augmentOnEdge()
980 destroyTree(right_tree); in augmentOnEdge()
993 alternatePath(right, right_tree); in augmentOnArc()
994 destroyTree(right_tree); in augmentOnArc()
1122 alternatePath(right, right_tree); in extractCycle()
1123 destroyTree(right_tree); in extractCycle()
1724 alternatePath(right, right_tree); in augmentOnEdge()
1725 destroyTree(right_tree); in augmentOnEdge()
1738 alternatePath(right, right_tree); in augmentOnArc()
1739 destroyTree(right_tree); in augmentOnArc()
[all …]
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dfractional_matching.h979 alternatePath(right, right_tree); in augmentOnEdge()
980 destroyTree(right_tree); in augmentOnEdge()
993 alternatePath(right, right_tree); in augmentOnArc()
994 destroyTree(right_tree); in augmentOnArc()
1122 alternatePath(right, right_tree); in extractCycle()
1123 destroyTree(right_tree); in extractCycle()
1724 alternatePath(right, right_tree); in augmentOnEdge()
1725 destroyTree(right_tree); in augmentOnEdge()
1738 alternatePath(right, right_tree); in augmentOnArc()
1739 destroyTree(right_tree); in augmentOnArc()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dfractional_matching.h979 alternatePath(right, right_tree); in augmentOnEdge()
980 destroyTree(right_tree); in augmentOnEdge()
993 alternatePath(right, right_tree); in augmentOnArc()
994 destroyTree(right_tree); in augmentOnArc()
1122 alternatePath(right, right_tree); in extractCycle()
1123 destroyTree(right_tree); in extractCycle()
1724 alternatePath(right, right_tree); in augmentOnEdge()
1725 destroyTree(right_tree); in augmentOnEdge()
1738 alternatePath(right, right_tree); in augmentOnArc()
1739 destroyTree(right_tree); in augmentOnArc()
[all …]
/dports/textproc/py-xmldiff/xmldiff-2.4/tests/
H A Dtest_diff.py507 right_tree = etree.fromstring(right)
509 differ.set_trees(left_tree, right_tree)
818 right_tree = etree.fromstring(right)
820 differ.set_trees(left_tree, right_tree)
917 right_tree = etree.fromstring(right)
919 differ.set_trees(left_tree, right_tree)
971 right_tree = etree.fromstring(right)
973 differ.set_trees(left_tree, right_tree)
1060 right_tree = etree.fromstring(right, parser)
1062 differ.set_trees(left_tree, right_tree)
/dports/devel/ispc/ispc-1.16.1/utils/lit/lit/
H A DTestRunner.py496 left_tree, right_tree = dir_trees[0], dir_trees[1]
500 if left_tree[1] is None and right_tree[1] is None:
502 os.path.join(right_base, right_tree[0])])
504 if left_tree[1] is None and right_tree[1] is not None:
506 os.path.join(right_base, right_tree[0]))
509 if left_tree[1] is not None and right_tree[1] is None:
511 os.path.join(right_base, right_tree[0]))
517 right_names = [node[0] for node in right_tree[1]]
527 printOnlyIn(right_base, right_tree[0], right_names[r])
530 exitCode |= compareDirTrees([left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/utils/lit/lit/
H A DTestRunner.py499 left_tree, right_tree = dir_trees[0], dir_trees[1]
503 if left_tree[1] is None and right_tree[1] is None:
505 os.path.join(right_base, right_tree[0])])
507 if left_tree[1] is None and right_tree[1] is not None:
509 os.path.join(right_base, right_tree[0]))
512 if left_tree[1] is not None and right_tree[1] is None:
514 os.path.join(right_base, right_tree[0]))
520 right_names = [node[0] for node in right_tree[1]]
530 printOnlyIn(right_base, right_tree[0], right_names[r])
533 exitCode |= compareDirTrees([left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/utils/lit/lit/
H A DTestRunner.py496 left_tree, right_tree = dir_trees[0], dir_trees[1]
500 if left_tree[1] is None and right_tree[1] is None:
502 os.path.join(right_base, right_tree[0])])
504 if left_tree[1] is None and right_tree[1] is not None:
506 os.path.join(right_base, right_tree[0]))
509 if left_tree[1] is not None and right_tree[1] is None:
511 os.path.join(right_base, right_tree[0]))
517 right_names = [node[0] for node in right_tree[1]]
527 printOnlyIn(right_base, right_tree[0], right_names[r])
530 exitCode |= compareDirTrees([left_tree[1][l], right_tree[1][r]],
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/utils/lit/lit/
H A DTestRunner.py496 left_tree, right_tree = dir_trees[0], dir_trees[1]
500 if left_tree[1] is None and right_tree[1] is None:
502 os.path.join(right_base, right_tree[0])])
504 if left_tree[1] is None and right_tree[1] is not None:
506 os.path.join(right_base, right_tree[0]))
509 if left_tree[1] is not None and right_tree[1] is None:
511 os.path.join(right_base, right_tree[0]))
517 right_names = [node[0] for node in right_tree[1]]
527 printOnlyIn(right_base, right_tree[0], right_names[r])
530 exitCode |= compareDirTrees([left_tree[1][l], right_tree[1][r]],
[all …]
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/erts/emulator/beam/jit/x86/
H A Dinstr_select.cpp169 Label right_tree = a.newLabel(); in emit_binsearch_nodes() local
170 a.ja(right_tree); in emit_binsearch_nodes()
172 a.bind(right_tree); in emit_binsearch_nodes()
/dports/lang/erlang-wx/otp-OTP-24.1.7/erts/emulator/beam/jit/x86/
H A Dinstr_select.cpp169 Label right_tree = a.newLabel(); in emit_binsearch_nodes() local
170 a.ja(right_tree); in emit_binsearch_nodes()
172 a.bind(right_tree); in emit_binsearch_nodes()
/dports/lang/erlang/otp-OTP-24.1.7/erts/emulator/beam/jit/x86/
H A Dinstr_select.cpp169 Label right_tree = a.newLabel(); in emit_binsearch_nodes() local
170 a.ja(right_tree); in emit_binsearch_nodes()
172 a.bind(right_tree); in emit_binsearch_nodes()

123