Home
last modified time | relevance | path

Searched refs:left_tree (Results 1 – 25 of 73) 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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
135 [os.path.join(left_base, left_tree[0]),
138 if left_tree[1] is None and right_tree[1] is not None:
139 printFileVsDir(os.path.join(left_base, left_tree[0]),
143 if left_tree[1] is not None and right_tree[1] is None:
144 printDirVsFile(os.path.join(left_base, left_tree[0]),
150 left_names = [node[0] for node in left_tree[1]]
157 printOnlyIn(left_base, left_tree[0], left_names[l])
165 [left_tree[1][l], right_tree[1][r]],
[all …]
/dports/textproc/py-xmldiff/xmldiff-2.4/tests/
H A Dtest_diff.py506 left_tree = etree.fromstring(left)
509 differ.set_trees(left_tree, right_tree)
817 left_tree = etree.fromstring(left)
820 differ.set_trees(left_tree, right_tree)
916 left_tree = etree.fromstring(left)
919 differ.set_trees(left_tree, right_tree)
970 left_tree = etree.fromstring(left)
973 differ.set_trees(left_tree, right_tree)
1059 left_tree = etree.fromstring(left, 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:
501 return compareTwoFiles([os.path.join(left_base, left_tree[0]),
504 if left_tree[1] is None and right_tree[1] is not None:
505 printFileVsDir(os.path.join(left_base, left_tree[0]),
509 if left_tree[1] is not None and right_tree[1] is None:
510 printDirVsFile(os.path.join(left_base, left_tree[0]),
516 left_names = [node[0] for node in left_tree[1]]
523 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
504 return compareTwoFiles([os.path.join(left_base, left_tree[0]),
507 if left_tree[1] is None and right_tree[1] is not None:
508 printFileVsDir(os.path.join(left_base, left_tree[0]),
512 if left_tree[1] is not None and right_tree[1] is None:
513 printDirVsFile(os.path.join(left_base, left_tree[0]),
519 left_names = [node[0] for node in left_tree[1]]
526 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
501 return compareTwoFiles([os.path.join(left_base, left_tree[0]),
504 if left_tree[1] is None and right_tree[1] is not None:
505 printFileVsDir(os.path.join(left_base, left_tree[0]),
509 if left_tree[1] is not None and right_tree[1] is None:
510 printDirVsFile(os.path.join(left_base, left_tree[0]),
516 left_names = [node[0] for node in left_tree[1]]
523 printOnlyIn(left_base, left_tree[0], left_names[l])
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:
501 return compareTwoFiles([os.path.join(left_base, left_tree[0]),
504 if left_tree[1] is None and right_tree[1] is not None:
505 printFileVsDir(os.path.join(left_base, left_tree[0]),
509 if left_tree[1] is not None and right_tree[1] is None:
510 printDirVsFile(os.path.join(left_base, left_tree[0]),
516 left_names = [node[0] for node in left_tree[1]]
523 printOnlyIn(left_base, left_tree[0], left_names[l])
530 exitCode |= compareDirTrees([left_tree[1][l], right_tree[1][r]],
[all …]
/dports/textproc/py-xmldiff/xmldiff-2.4/xmldiff/
H A Dmain.py36 left_tree = parse_method(left, parser)
38 return diff_trees(left_tree, right_tree, diff_options=diff_options,
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dfractional_matching.h970 int left_tree = _tree_set->find(left); in augmentOnEdge() local
972 alternatePath(left, left_tree); in augmentOnEdge()
973 destroyTree(left_tree); in augmentOnEdge()
1259 int left_tree = _tree_set->find(left); in start() local
1262 if (left_tree == right_tree) { in start()
1263 cycleOnEdge(e, left_tree); in start()
1715 int left_tree = _tree_set->find(left); in augmentOnEdge() local
1717 alternatePath(left, left_tree); in augmentOnEdge()
1718 destroyTree(left_tree); in augmentOnEdge()
1997 if (left_tree == right_tree) { in start()
[all …]
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dfractional_matching.h970 int left_tree = _tree_set->find(left); in augmentOnEdge() local
972 alternatePath(left, left_tree); in augmentOnEdge()
973 destroyTree(left_tree); in augmentOnEdge()
1259 int left_tree = _tree_set->find(left); in start() local
1262 if (left_tree == right_tree) { in start()
1263 cycleOnEdge(e, left_tree); in start()
1715 int left_tree = _tree_set->find(left); in augmentOnEdge() local
1717 alternatePath(left, left_tree); in augmentOnEdge()
1718 destroyTree(left_tree); in augmentOnEdge()
1997 if (left_tree == right_tree) { in start()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dfractional_matching.h970 int left_tree = _tree_set->find(left); in augmentOnEdge() local
972 alternatePath(left, left_tree); in augmentOnEdge()
973 destroyTree(left_tree); in augmentOnEdge()
1259 int left_tree = _tree_set->find(left); in start() local
1262 if (left_tree == right_tree) { in start()
1263 cycleOnEdge(e, left_tree); in start()
1715 int left_tree = _tree_set->find(left); in augmentOnEdge() local
1717 alternatePath(left, left_tree); in augmentOnEdge()
1718 destroyTree(left_tree); in augmentOnEdge()
1997 if (left_tree == right_tree) { in start()
[all …]
/dports/net-mgmt/phpipam/phpipam-a14bc06/functions/PEAR/Spreadsheet/Excel/Writer/
H A DParser.php1690 $left_tree = $this->toReversePolish($tree['left']);
1692 $left_tree = '';
1694 if (PEAR::isError($left_tree)) {
1695 return $left_tree;
1698 return $left_tree.$this->_convertFunction($tree['value'], $tree['right']);
/dports/www/limesurvey/limesurvey/application/third_party/pear/Spreadsheet/Excel/Writer/
H A DParser.php1686 $left_tree = $this->toReversePolish($tree['left']);
1688 $left_tree = '';
1690 if (PEAR::isError($left_tree)) {
1691 return $left_tree;
1694 return $left_tree.$this->_convertFunction($tree['value'], $tree['right']);
/dports/textproc/pear-Spreadsheet_Excel_Writer/Spreadsheet_Excel_Writer-0.9.4/Spreadsheet/Excel/Writer/
H A DParser.php1686 $left_tree = $this->toReversePolish($tree['left']);
1688 $left_tree = '';
1690 if (PEAR::isError($left_tree)) {
1691 return $left_tree;
1694 return $left_tree.$this->_convertFunction($tree['value'], $tree['right']);

123