/dports/misc/openmvg/openMVG-2.0/src/openMVG/sfm/ |
H A D | sfm_data_graph_utils_test.cpp | 75 const std::set<IndexT> & pairs1 = iter_second->second; in TEST() local 76 EXPECT_EQ(4, pairs1.size()); in TEST() 77 if (pairs1.size() == 4) in TEST() 79 EXPECT_TRUE(pairs1.find(0) != pairs1.end()); in TEST() 80 EXPECT_TRUE(pairs1.find(1) != pairs1.end()); in TEST() 81 EXPECT_TRUE(pairs1.find(2) != pairs1.end()); in TEST() 82 EXPECT_TRUE(pairs1.find(3) != pairs1.end()); in TEST()
|
/dports/devel/spark/spark-2.1.1/examples/src/main/scala/org/apache/spark/examples/ |
H A D | GroupByTest.scala | 40 val pairs1 = spark.sparkContext.parallelize(0 until numMappers, numMappers).flatMap { p => constant 51 pairs1.count() 53 println(pairs1.groupByKey(numReducers).count())
|
H A D | SkewedGroupByTest.scala | 40 val pairs1 = spark.sparkContext.parallelize(0 until numMappers, numMappers).flatMap { p => constant 55 pairs1.count() 57 println(pairs1.groupByKey(numReducers).count())
|
H A D | SimpleSkewedGroupByTest.scala | 41 val pairs1 = spark.sparkContext.parallelize(0 until numMappers, numMappers).flatMap { p => constant 60 pairs1.count 62 println("RESULT: " + pairs1.groupByKey(numReducers).count)
|
/dports/textproc/libtranslate/libtranslate-0.99/src/ |
H A D | translate-pair.c | 321 translate_pairs_merge (GSList *pairs1, const GSList *pairs2) in translate_pairs_merge() argument 330 existing_pair = translate_pairs_find(pairs1, pair->priv->from, pair->priv->to); in translate_pairs_merge() 334 pairs1 = g_slist_append(pairs1, g_object_ref(pair)); in translate_pairs_merge() 337 return pairs1; in translate_pairs_merge()
|
H A D | translate-pair-private.h | 38 GSList *translate_pairs_merge (GSList *pairs1, const GSList *pairs2);
|
/dports/finance/hs-hledger/hledger-1.19/Hledger/Cli/Commands/ |
H A D | Registermatch.hs | 80 i = length $ intersect pairs1 pairs2 81 u = length pairs1 + length pairs2 82 pairs1 = wordLetterPairs $ uppercase s1 function
|
/dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/hledger-1.19.1/Hledger/Cli/Commands/ |
H A D | Registermatch.hs | 80 i = length $ intersect pairs1 pairs2 81 u = length pairs1 + length pairs2 82 pairs1 = wordLetterPairs $ uppercase s1 function
|
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/hledger-1.19/Hledger/Cli/Commands/ |
H A D | Registermatch.hs | 80 i = length $ intersect pairs1 pairs2 81 u = length pairs1 + length pairs2 82 pairs1 = wordLetterPairs $ uppercase s1 function
|
/dports/lang/solidity/solidity_0.8.11/test/yulPhaser/ |
H A D | PairSelections.cpp | 207 IndexPairs pairs1{{0, 1}, {1, 0}}; in BOOST_AUTO_TEST_CASE() local 208 BOOST_TEST(PairMosaicSelection(pairs1, 0.5).materialise(4) == IndexPairs({{0, 1}, {1, 0}})); in BOOST_AUTO_TEST_CASE() 209 …BOOST_TEST(PairMosaicSelection(pairs1, 1.0).materialise(4) == IndexPairs({{0, 1}, {1, 0}, {0, 1}, … in BOOST_AUTO_TEST_CASE() 210 …BOOST_TEST(PairMosaicSelection(pairs1, 2.0).materialise(4) == IndexPairs({{0, 1}, {1, 0}, {0, 1}, … in BOOST_AUTO_TEST_CASE() 211 BOOST_TEST(PairMosaicSelection(pairs1, 1.0).materialise(2) == IndexPairs({{0, 1}, {1, 0}})); in BOOST_AUTO_TEST_CASE()
|
/dports/biology/gatk/gatk-4.2.0.0/src/test/java/org/broadinstitute/hellbender/tools/walkers/realignmentfilter/ |
H A D | RealignmentEngineUnitTest.java | 84 …final List<Pair<BwaMemAlignment, BwaMemAlignment>> pairs1 = findPlausiblePairs(readAlignments1, ma… in testFindPlausiblePairs() local 85 Assert.assertEquals(pairs1.size(),1); in testFindPlausiblePairs() 86 Assert.assertEquals(pairs1.get(0).getLeft(), aln9); in testFindPlausiblePairs() 87 Assert.assertEquals(pairs1.get(0).getRight(), aln10); in testFindPlausiblePairs()
|
/dports/science/py-gpaw/gpaw-21.6.0/gpaw/hybrids/ |
H A D | symmetry.py | 137 pairs1 = defaultdict(int) 145 pairs1[(i1, i2, s3)] += 1 150 pairs1[(i1, i1, s3)] += 1 152 pairs1[(i2, i1, s4)] += 1 155 for (i1, i2, s), count in pairs1.items():
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/grid/ |
H A D | grid_tools_dof_handlers.cc | 2047 if (!(((pairs1.size() > 0) && in match_periodic_face_pairs() 2055 Assert(pairs1.size() == pairs2.size(), in match_periodic_face_pairs() 2066 for (PairIterator it1 = pairs1.begin(); it1 != pairs1.end(); ++it1) in match_periodic_face_pairs() 2102 if (!(((pairs1.size() > 0) && in match_periodic_face_pairs() 2155 pairs1.insert(pair1); in collect_periodic_faces() 2166 Assert(pairs1.size() == pairs2.size(), in collect_periodic_faces() 2169 Assert(pairs1.size() > 0, in collect_periodic_faces() 2233 pairs1.insert(pair1); in collect_periodic_faces() 2251 if (!(((pairs1.size() > 0) && in collect_periodic_faces() 2259 Assert(pairs1.size() == pairs2.size(), in collect_periodic_faces() [all …]
|
/dports/biology/py-ete3/ete3-3.1.2/ete3/tools/ete_build_lib/task/ |
H A D | cog_creator.py | 159 pairs1 = [] 169 pairs1 = DB.orthocursor.fetchall() 182 for seq1, sp1, seq2, sp2 in pairs1 + pairs2: 318 pairs1 = [] 327 pairs1 = DB.orthocursor.fetchall() 336 for seq1, sp1, seq2, sp2 in pairs1 + pairs2: 377 pairs1 = [] 382 pairs1= DB.orthocursor.fetchall() 392 all_pairs = pairs1 + pairs2
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bbgm/ |
H A D | bbgm_features.cxx | 531 const std::set<bbgm_mask_pair_feature, fless>& pairs1 = pg1.pairs(); in pair_group_merge() local 541 for (pit = pairs1.begin(); pit != pairs1.end(); ++pit) in pair_group_merge() 560 const std::set<bbgm_mask_pair_feature, fless>& pairs1 = pg1.pairs(); in pair_group_max_union() local 573 for (pit = pairs1.begin(); pit != pairs1.end(); ++pit) { in pair_group_max_union()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/accessibility/ |
H A D | ax_tree.cc | 49 if (pairs1.size() != pairs2.size()) in KeyValuePairsKeysMatch() 51 for (size_t i = 0; i < pairs1.size(); ++i) { in KeyValuePairsKeysMatch() 52 if (pairs1[i].first != pairs2[i].first) in KeyValuePairsKeysMatch() 77 if (KeyValuePairsKeysMatch(pairs1, pairs2)) { in CallIfAttributeValuesChanged() 78 for (size_t i = 0; i < pairs1.size(); ++i) { in CallIfAttributeValuesChanged() 79 if (pairs1[i].second != pairs2[i].second) in CallIfAttributeValuesChanged() 80 callback(pairs1[i].first, pairs1[i].second, pairs2[i].second); in CallIfAttributeValuesChanged() 88 auto map1 = MapFromKeyValuePairs(pairs1); in CallIfAttributeValuesChanged() 90 for (size_t i = 0; i < pairs1.size(); ++i) { in CallIfAttributeValuesChanged() 91 const auto& new_iter = map2.find(pairs1[i].first); in CallIfAttributeValuesChanged() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/ui/accessibility/ |
H A D | ax_tree.cc | 50 if (pairs1.size() != pairs2.size()) in KeyValuePairsKeysMatch() 52 for (size_t i = 0; i < pairs1.size(); ++i) { in KeyValuePairsKeysMatch() 53 if (pairs1[i].first != pairs2[i].first) in KeyValuePairsKeysMatch() 78 if (KeyValuePairsKeysMatch(pairs1, pairs2)) { in CallIfAttributeValuesChanged() 79 for (size_t i = 0; i < pairs1.size(); ++i) { in CallIfAttributeValuesChanged() 80 if (pairs1[i].second != pairs2[i].second) in CallIfAttributeValuesChanged() 81 callback(pairs1[i].first, pairs1[i].second, pairs2[i].second); in CallIfAttributeValuesChanged() 89 auto map1 = MapFromKeyValuePairs(pairs1); in CallIfAttributeValuesChanged() 91 for (size_t i = 0; i < pairs1.size(); ++i) { in CallIfAttributeValuesChanged() 92 const auto& new_iter = map2.find(pairs1[i].first); in CallIfAttributeValuesChanged() [all …]
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/tst/standard/ |
H A D | congpairs.tst | 437 gap> pairs1 := [[Bipartition([[1, 2, 3, -1, -2, -3]]), 443 gap> cong1 := SemigroupCongruence(S, pairs1);; 448 gap> pairs1[1] in cong3; 461 gap> pairs1 := [[Bipartition([[1, 2, 3, -1, -2, -3]]), 467 gap> cong1 := LeftSemigroupCongruence(S, pairs1);; 472 gap> pairs1[1] in cong3; 485 gap> pairs1 := [[Bipartition([[1, 2, 3, -1, -2, -3]]), 491 gap> cong1 := RightSemigroupCongruence(S, pairs1);; 496 gap> pairs1[1] in cong3; 702 gap> Unbind(pairs1);
|
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/ |
H A D | NonEmpty.hs | 696 ipxs = NonEmpty.init (pairs1 xx) 697 ipys = NonEmpty.init (pairs1 yy) 713 $ liftM2 (,) (pairs1 xs) (pairs1 ys) 716 pairs1 :: NonEmpty a -> NonEmpty (a, a) 717 pairs1 as@(x:|xs) = NonEmpty.zip as $ maybe (x :| []) (`appendNonEmpty` [x]) $ NonEmpty.nonEmpty xs function
|
/dports/misc/libcomps/libcomps-0.1.17/libcomps/src/ |
H A D | comps_doccategory.c | 173 COMPS_HSList *pairs1, *pairs2; in comps_doccategory_intersect() local 179 pairs1 = comps_objdict_pairs(c1->properties); in comps_doccategory_intersect() 180 for (hsit = pairs1->first; hsit != NULL; hsit = hsit->next) { in comps_doccategory_intersect() 191 comps_hslist_destroy(&pairs1); in comps_doccategory_intersect()
|
H A D | comps_docgroup.c | 216 COMPS_HSList *pairs1, *pairs2; in comps_docgroup_intersect() local 223 pairs1 = comps_objdict_pairs(g1->properties); in comps_docgroup_intersect() 224 for (hsit = pairs1->first; hsit != NULL; hsit = hsit->next) { in comps_docgroup_intersect() 235 comps_hslist_destroy(&pairs1); in comps_docgroup_intersect()
|
H A D | comps_docenv.c | 227 COMPS_HSList *pairs1, *pairs2; in comps_docenv_intersect() local 233 pairs1 = comps_objdict_pairs(e1->properties); in comps_docenv_intersect() 234 for (hsit = pairs1->first; hsit != NULL; hsit = hsit->next) { in comps_docenv_intersect() 244 comps_hslist_destroy(&pairs1); in comps_docenv_intersect()
|
/dports/devel/spark/spark-2.1.1/core/src/test/scala/org/apache/spark/ |
H A D | ShuffleSuite.scala | 180 val pairs1: RDD[MutablePair[Int, Int]] = sc.parallelize(data1, 2) constant 182 val results = new CoGroupedRDD[Int](Seq(pairs1, pairs2), new HashPartitioner(2)) 207 val pairs1: RDD[MutablePair[Int, Int]] = sc.parallelize(data1, 2) constant 209 val results = new SubtractedRDD(pairs1, pairs2, new HashPartitioner(2)).collect()
|
/dports/math/spot/spot-2.10.2/spot/twaalgos/ |
H A D | toparity.cc | 1422 auto pairs1 = std::vector<acc_cond::rs_pair>(); in chooseAlgo() local 1424 std::sort(pairs1.begin(), pairs1.end()); in chooseAlgo() 1425 pairs1.erase(std::unique(pairs1.begin(), pairs1.end()), pairs1.end()); in chooseAlgo() 1428 bool is_r_like = scc_condition.is_rabin_like(pairs1); in chooseAlgo() 1433 if ((is_s_like && pairs1.size() < pairs2.size()) || !is_s_like) in chooseAlgo() 1435 if (pairs1.size() > num_cols) in chooseAlgo() 1437 pairs = pairs1; in chooseAlgo()
|
/dports/math/py-spot/spot-2.10.2/spot/twaalgos/ |
H A D | toparity.cc | 1422 auto pairs1 = std::vector<acc_cond::rs_pair>(); in chooseAlgo() local 1424 std::sort(pairs1.begin(), pairs1.end()); in chooseAlgo() 1425 pairs1.erase(std::unique(pairs1.begin(), pairs1.end()), pairs1.end()); in chooseAlgo() 1428 bool is_r_like = scc_condition.is_rabin_like(pairs1); in chooseAlgo() 1433 if ((is_s_like && pairs1.size() < pairs2.size()) || !is_s_like) in chooseAlgo() 1435 if (pairs1.size() > num_cols) in chooseAlgo() 1437 pairs = pairs1; in chooseAlgo()
|