/dports/science/cdk/cdk-cdk-2.3/base/test-standard/src/test/java/org/openscience/cdk/graph/ |
H A D | MatchingTest.java | 55 matching.match(2, 5); in match() 56 matching.match(6, 7); in match() 70 matching.match(2, 5); in replace() 71 matching.match(6, 7); in replace() 72 matching.match(5, 6); in replace() 84 matching.match(2, 5); in other() 85 matching.match(6, 7); in other() 86 matching.match(5, 6); in other() 93 matching.match(2, 4); in unmatch() 145 matching.match(1, 3); in string() [all …]
|
/dports/sysutils/tarsnap/tarsnap-autoconf-1.0.39/tar/ |
H A D | matching.c | 83 struct matching *matching; in exclude() local 87 matching = bsdtar->matching; in exclude() 103 struct matching *matching; in include() local 107 matching = bsdtar->matching; in include() 143 struct matching *matching; in excluded() local 147 matching = bsdtar->matching; in excluded() 251 bsdtar->matching = malloc(sizeof(*bsdtar->matching)); in initialize_matching() 260 struct matching *matching; in unmatched_inclusions() local 262 matching = bsdtar->matching; in unmatched_inclusions() 272 struct matching *matching; in unmatched_inclusions_warn() local [all …]
|
/dports/textproc/py-whoosh/Whoosh-2.7.4/tests/ |
H A D | test_matching.py | 18 nm = matching.NullMatcher() 26 lm = matching.ListMatcher(ids) 33 lm = matching.ListMatcher(ids) 43 lm = matching.ListMatcher(ids) 66 wm = matching.WrappingMatcher(matching.ListMatcher([1, 2, 5, 9, 10]), 75 wm = matching.WrappingMatcher(matching.ListMatcher(ids), boost=2.0) 90 em = matching.FilterMatcher(matching.ListMatcher([1, 2, 5, 9, 10]), 94 em = matching.FilterMatcher(matching.ListMatcher([1, 2, 5, 9, 10]), 98 em = matching.FilterMatcher(matching.ListMatcher([1, 2, 5, 9, 10]), 356 um = matching.UnionMatcher(s1, matching.UnionMatcher(s2, s3)) [all …]
|
/dports/math/chaco/Chaco-2.2/code/klvspiff/ |
H A D | matching.c | 79 sfree((char *) matching); 98 matching[i] = -1; 107 matching[i] = indices[j]; 108 matching[indices[j]] = i; 181 matching[neighbor] = node; 182 matching[node] = neighbor; 186 result = touch(matching[neighbor], pointers, indices, matching, touched, 242 result = touch2(matching[neighbor], pointers, indices, matching, touched); 298 if (matching[i] != -1 && matching[matching[i]] != i) { 300 i, matching[i], matching[i], matching[matching[i]]); [all …]
|
/dports/security/libssh/libssh-0.9.6/tests/unittests/ |
H A D | torture_tokens.c | 36 char *matching; in torture_find_matching() local 42 SAFE_FREE(matching); in torture_find_matching() 48 SAFE_FREE(matching); in torture_find_matching() 54 SAFE_FREE(matching); in torture_find_matching() 60 SAFE_FREE(matching); in torture_find_matching() 64 assert_null(matching); in torture_find_matching() 69 char *matching; in torture_find_all_matching() local 75 SAFE_FREE(matching); in torture_find_all_matching() 81 SAFE_FREE(matching); in torture_find_all_matching() 87 SAFE_FREE(matching); in torture_find_all_matching() [all …]
|
/dports/www/trafficserver/trafficserver-9.1.1/src/tscore/unit_tests/ |
H A D | test_X509HostnameValidator.cc | 106 char *matching; variable 112 ats_free(matching); 128 char *matching; variable 133 ats_free(matching); 136 REQUIRE(strcmp("*.trafficserver.org", matching) == 0); 139 ats_free(matching); 144 char *matching; variable 149 ats_free(matching); 157 char *matching; variable 162 ats_free(matching); [all …]
|
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/contrib/incidence_analysis/tests/ |
H A D | test_matching.py | 30 self.assertEqual(len(matching), N) 32 self.assertIn(i, matching) 39 self.assertIn(i, matching) 46 self.assertIn(i, matching) 89 values = set(matching.values()) 91 self.assertIn(i, matching) 127 values = set(matching.values()) 129 self.assertIn(i, matching) 170 self.assertIn(0, matching) 171 self.assertIn(N-1, matching) [all …]
|
/dports/math/igraph/igraph-0.9.5/examples/simple/ |
H A D | igraph_maximum_bipartite_matching.c | 33 igraph_vector_long_t matching; in test_graph_from_leda_tutorial() local 53 igraph_vector_long_init(&matching, 0); in test_graph_from_leda_tutorial() 72 igraph_vector_long_destroy(&matching); in test_graph_from_leda_tutorial() 85 igraph_vector_long_t matching; in test_weighted_graph_from_mit_notes() local 108 igraph_vector_long_init(&matching, 0); in test_weighted_graph_from_mit_notes() 130 igraph_vector_long_destroy(&matching); in test_weighted_graph_from_mit_notes() 141 igraph_vector_long_t matching; in test_weighted_graph_generated() local 153 igraph_vector_long_init(&matching, 0); in test_weighted_graph_generated() 192 igraph_vector_long_t matching; in test_weighted_graph_from_file() local 220 igraph_vector_long_print(&matching); in test_weighted_graph_from_file() [all …]
|
/dports/security/gcr/gcr-3.40.0/gcr/ |
H A D | test-util.c | 32 const gchar ***matching = user_data; in on_line_parsed_match_template() local 34 g_assert (matching); in on_line_parsed_match_template() 35 g_assert (*matching); in on_line_parsed_match_template() 38 g_assert ((*matching)[0]); in on_line_parsed_match_template() 42 (*matching)++; in on_line_parsed_match_template() 50 const gchar **matching = matches; in test_parse_lines() local 55 g_assert (*matching == NULL); in test_parse_lines() 67 const gchar **matching = matches; in test_parse_lines_and_last() local 73 g_assert (*matching == NULL); in test_parse_lines_and_last() 86 const gchar **matching = matches; in test_parse_lines_dos() local [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
H A D | Matching.h | 43 inline bool isMatching(const Graph& graph, const EdgeContainer& matching) { in isMatching() argument 46 for (edge e : matching) { in isMatching() 64 bool isMaximal(const Graph& graph, const EdgeContainer& matching, edge& addable) { in isMaximal() argument 69 for (edge e : matching) { in isMaximal() 89 inline bool isMaximal(const Graph& graph, const EdgeContainer& matching) { in isMaximal() argument 91 return isMaximal(graph, matching, ignored); in isMaximal() 96 inline bool isMaximalMatching(const Graph& graph, const EdgeContainer& matching) { in isMaximalMatching() argument 97 return isMatching(graph, matching) && isMaximal(graph, matching); in isMaximalMatching() 102 inline bool isPerfect(const Graph& graph, const EdgeContainer& matching) { in isPerfect() argument 103 return 2 * int(matching.size()) == graph.numberOfNodes(); in isPerfect() [all …]
|
/dports/security/py-zxcvbn/zxcvbn-python-4.4.28/tests/ |
H A D | matching_test.py | 4 from zxcvbn import matching 71 matching.add_frequency_lists({ 178 matches = matching.dictionary_match('wow') 287 matches = matching.l33t_match('4 1 @') 433 matches = matching.repeat_match(pattern) 439 matches = matching.repeat_match(pattern) 445 matches = matching.repeat_match(pattern) 456 matches = matching.regex_match(pattern) 494 matches = matching.date_match(password) 530 matches = matching.date_match(password) [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/testing/web-platform/meta/dom/nodes/ |
H A D | ParentNode-querySelector-All-xht.xht.ini | 2 …[Document.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 5 …[Document.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 8 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 11 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 14 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 17 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 47 …[Detached Element.querySelector: Descendant combinator '>>', matching element that is a descendant… 80 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 83 …[Fragment.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 86 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… [all …]
|
H A D | ParentNode-querySelector-All.html.ini | 2 …[Document.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 5 …[Document.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 8 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 11 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 14 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 17 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 47 …[Detached Element.querySelector: Descendant combinator '>>', matching element that is a descendant… 80 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 83 …[Fragment.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 86 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/testing/web-platform/meta/dom/nodes/ |
H A D | ParentNode-querySelector-All-xht.xht.ini | 3 …[Document.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 6 …[Document.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 9 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 12 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 15 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 18 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 48 …[Detached Element.querySelector: Descendant combinator '>>', matching element that is a descendant… 81 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 84 …[Fragment.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 87 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… [all …]
|
H A D | ParentNode-querySelector-All.html.ini | 3 …[Document.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 6 …[Document.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 9 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 12 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 15 …[Document.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… 18 …[Document.querySelector: Descendant combinator '>>', matching element with id that is a descendant… 48 …[Detached Element.querySelector: Descendant combinator '>>', matching element that is a descendant… 81 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element that is a descendant of a… 84 …[Fragment.querySelector: Descendant combinator '>>', matching element that is a descendant of an e… 87 …[Fragment.querySelectorAll: Descendant combinator '>>', matching element with id that is a descend… [all …]
|
/dports/misc/concourse/concourse-6.7.2/vendor/code.cloudfoundry.org/credhub-cli/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/security/lego/lego-4.5.3/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 13 paths := bg.maximalDisjointSLAPCollection(matching) 17 matching = matching.SymmetricDifference(path) 19 paths = bg.maximalDisjointSLAPCollection(matching) 26 guideLayers := bg.createSLAPGuideLayers(matching) 49 matching EdgeSet, 60 matching EdgeSet, 80 if matching.Contains(edge) == util.Odd(currentLevel) { 101 if matching.Free(node) { 126 if !found || matching.Contains(edge) { 133 if matching.Free(rightNode) { [all …]
|
/dports/textproc/spiff/spiff-1.0.8/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 122 if !found || matching.Contains(edge) { 129 if matching.Free(rightNode) { [all …]
|
/dports/devel/app-builder/app-builder-3.4.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/security/lego/lego-4.5.3/vendor/github.com/infobloxopen/infoblox-go-client/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/net/storj/storj-1.45.3/vendor/github.com/cloudfoundry/gosigar/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 8 paths := bg.maximalDisjointSLAPCollection(matching) 12 matching = matching.SymmetricDifference(path) 14 paths = bg.maximalDisjointSLAPCollection(matching) 21 guideLayers := bg.createSLAPGuideLayers(matching) 44 matching EdgeSet, 55 matching EdgeSet, 75 if matching.Contains(edge) == util.Odd(currentLevel) { 96 if matching.Free(node) { 121 if !found || matching.Contains(edge) { 128 if matching.Free(rightNode) { [all …]
|
/dports/net/concourse-fly/concourse-6.7.1/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 13 paths := bg.maximalDisjointSLAPCollection(matching) 17 matching = matching.SymmetricDifference(path) 19 paths = bg.maximalDisjointSLAPCollection(matching) 26 guideLayers := bg.createSLAPGuideLayers(matching) 49 matching EdgeSet, 60 matching EdgeSet, 80 if matching.Contains(edge) == util.Odd(currentLevel) { 101 if matching.Free(node) { 126 if !found || matching.Contains(edge) { 133 if matching.Free(rightNode) { [all …]
|
/dports/misc/concourse/concourse-6.7.2/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/ |
H A D | bipartitegraphmatching.go | 13 paths := bg.maximalDisjointSLAPCollection(matching) 17 matching = matching.SymmetricDifference(path) 19 paths = bg.maximalDisjointSLAPCollection(matching) 26 guideLayers := bg.createSLAPGuideLayers(matching) 49 matching EdgeSet, 60 matching EdgeSet, 80 if matching.Contains(edge) == util.Odd(currentLevel) { 101 if matching.Free(node) { 126 if !found || matching.Contains(edge) { 133 if matching.Free(rightNode) { [all …]
|