/dports/math/cvc4/CVC4-1.7/test/regress/regress1/rels/ |
H A D | rel_pressure_0.cvc | 4 x : SET OF IntPair; 5 y : SET OF IntPair; 9 a11 : IntPair; 12 a12 : IntPair; 15 a13 : IntPair; 18 a14 : IntPair; 21 a15 : IntPair; 24 a16 : IntPair; 27 a17 : IntPair; 30 a18 : IntPair; [all …]
|
H A D | rel_complex_3.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 z : SET OF IntPair; 7 r : SET OF IntPair; 8 w : SET OF IntPair; 11 f : IntPair; 15 g : IntPair; 19 h : IntPair; 26 e : IntPair;
|
H A D | rel_complex_4.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 z : SET OF IntPair; 7 r : SET OF IntPair; 8 w : SET OF IntPair; 11 f : IntPair; 15 g : IntPair; 19 h : IntPair; 26 e : IntPair;
|
H A D | rel_complex_5.cvc | 3 IntPair: TYPE = [INT, INT]; 5 x : SET OF IntPair; 6 y : SET OF IntPair; 7 z : SET OF IntPair; 8 r : SET OF IntPair; 9 w : SET OF IntPair; 12 f : IntPair; 16 g : IntPair; 20 h : IntPair; 28 e : IntPair;
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/tests/ |
H A D | test-froidure-pin-intpairs.cpp | 31 class IntPair { class 36 IntPair operator*(IntPair const& that) const { in operator *() 61 struct Complexity<IntPair> { 68 struct Degree<IntPair> { 76 IntPair operator()(IntPair const& x) const noexcept { in operator ()() 83 struct One<IntPair> { 84 constexpr IntPair operator()(IntPair) const noexcept { in operator ()() 85 return IntPair(); in operator ()() 90 struct Product<IntPair> { 91 void operator()(IntPair& xy, IntPair x, IntPair y, size_t = 0) const in operator ()() [all …]
|
/dports/math/libsemigroups/libsemigroups-1.3.7/tests/ |
H A D | test-froidure-pin-intpairs.cpp | 31 class IntPair { class 36 IntPair operator*(IntPair const& that) const { in operator *() 61 struct Complexity<IntPair> { 68 struct Degree<IntPair> { 76 IntPair operator()(IntPair const& x) const noexcept { in operator ()() 83 struct One<IntPair> { 84 constexpr IntPair operator()(IntPair) const noexcept { in operator ()() 85 return IntPair(); in operator ()() 90 struct Product<IntPair> { 92 operator()(IntPair& xy, IntPair x, IntPair y, size_t = 0) const noexcept { in operator ()() [all …]
|
/dports/biology/gatk/gatk-4.2.0.0/src/test/java/org/broadinstitute/hellbender/tools/spark/utils/ |
H A D | HopscotchMultiMapTest.java | 20 new IntPair(1,2), new IntPair(1,2), // repeated entries are legal in a multimap 21 new IntPair(1,3), // as are repeated keys 22 new IntPair(3,4), new IntPair(5,6)); 23 private static final IntPair notInTestVals = new IntPair(7,8); 28 for ( final IntPair entry : testVals ) { in addTest() 38 for ( final IntPair entry : testVals ) { in containsTest() 47 for ( final IntPair entry : testVals ) { in findTest() 66 for ( final IntPair entry : testVals ) { in removeTest() 89 hopscotchMultiMap.add(new IntPair(1, 1)); in removeEachBugTest() 91 hopscotchMultiMap.add(new IntPair(1, 2)); in removeEachBugTest() [all …]
|
H A D | HopscotchMapTest.java | 20 …private static final List<IntPair> testVals = Arrays.asList(new IntPair(1,2), new IntPair(3,4), ne… 21 private static final IntPair notInTestVals = new IntPair(7,8); 26 Assert.assertTrue(hopscotchMap.add(new IntPair(1,2))); in addTest() 37 for ( final IntPair entry : testVals ) { in containsTest() 46 for ( final IntPair entry : testVals ) { in findTest() 55 for ( final IntPair entry : testVals ) { in findEachTest() 64 for ( final IntPair entry : testVals ) { in removeTest() 74 for ( final IntPair entry : testVals ) { in removeEachTest() 85 IntPair( final int key, final int value ) { in IntPair() method in HopscotchMapTest.IntPair 105 if ( !(obj instanceof IntPair) ) return false; in equals() [all …]
|
/dports/math/cvc4/CVC4-1.7/test/regress/regress0/rels/ |
H A D | rel_tp_join_1.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 z : SET OF IntPair; 7 r : SET OF IntPair; 9 b : IntPair; 11 c : IntPair; 16 d : IntPair; 18 e : IntPair; 26 a : IntPair;
|
H A D | rel_join_7.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 7 w : SET OF IntPair; 9 z : IntPair; 11 zt : IntPair; 13 v : IntPair; 15 a : IntPair;
|
H A D | rel_join_4.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair; 17 b : IntPair;
|
H A D | rel_tp_join_0.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 9 z : IntPair; 11 zt : IntPair; 13 v : IntPair; 15 a : IntPair; 18 b : IntPair;
|
H A D | rel_join_0.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
H A D | rel_tp_join_eq_0.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 z : SET OF IntPair; 7 r : SET OF IntPair; 12 d : IntPair; 14 e : IntPair; 22 a : IntPair;
|
H A D | rel_join_0_1.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
H A D | rel_join_3.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
H A D | rel_join_3_1.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
H A D | rel_join_1.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
H A D | rel_join_1_1.cvc | 3 IntPair: TYPE = [INT, INT]; 4 x : SET OF IntPair; 5 y : SET OF IntPair; 6 r : SET OF IntPair; 8 z : IntPair; 10 zt : IntPair; 12 v : IntPair; 14 a : IntPair;
|
/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/tests/api/ |
H A D | join_test.cpp | 34 using IntPair = std::pair<size_t, size_t>; in TEST() typedef 47 auto key_ex = [](IntPair input) { in TEST() 51 auto join_fn = [](IntPair input1, IntPair input2) { in TEST() 79 using IntPair = std::pair<size_t, size_t>; in TEST() typedef 91 auto key_ex = [](const IntPair& input) { in TEST() 95 auto join_fn = [](const IntPair& input1, const IntPair& input2) { in TEST() 104 [](const IntPair& in1, const IntPair& in2) { in TEST() 140 auto key_ex = [](const IntPair& input) { in TEST() 144 auto join_fn = [](const IntPair& input1, const IntPair& input2) { in TEST() 153 [](const IntPair& in1, const IntPair& in2) { in TEST() [all …]
|
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-mapreduce-project/hadoop-mapreduce-examples/src/main/java/org/apache/hadoop/examples/ |
H A D | SecondarySort.java | 57 public static class IntPair class in SecondarySort 58 implements WritableComparable<IntPair> { 95 if (right instanceof IntPair) { in equals() 96 IntPair r = (IntPair) right; in equals() 105 super(IntPair.class); in Comparator() 119 public int compareTo(IntPair o) { in compareTo() 135 public int getPartition(IntPair key, IntWritable value, in getPartition() 146 implements RawComparator<IntPair> { 154 public int compare(IntPair o1, IntPair o2) { in compare() 168 private final IntPair key = new IntPair(); [all …]
|
/dports/devel/hadoop/hadoop-1.2.1/src/examples/org/apache/hadoop/examples/ |
H A D | SecondarySort.java | 57 public static class IntPair class in SecondarySort 58 implements WritableComparable<IntPair> { 95 if (right instanceof IntPair) { in equals() 96 IntPair r = (IntPair) right; in equals() 105 super(IntPair.class); in Comparator() 119 public int compareTo(IntPair o) { in compareTo() 135 public int getPartition(IntPair key, IntWritable value, in getPartition() 146 implements RawComparator<IntPair> { 154 public int compare(IntPair o1, IntPair o2) { in compare() 168 private final IntPair key = new IntPair(); [all …]
|
/dports/devel/functionalplus/FunctionalPlus-0.2.18-p0/test/ |
H A D | tree_test.cpp | 12 typedef std::pair<int, int> IntPair; typedef 14 typedef std::vector<IntPair> IntPairVector; 15 typedef fplus::tree<IntPair> IntPairTree; 46 const auto is_child_of = [](const IntPair& a, const IntPair& b) -> bool 61 REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result_2))); 64 REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result))); 82 const auto is_child_of = [](const IntPair& a, const IntPair& b) -> bool 107 REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result_2))); 110 REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result)));
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/geometry/test/unit/ |
H A D | regiontest.h | 17 typedef Region<1>::IntPair IntPair; typedef 137 IntPair(10, 30), in testFuse() 138 h.fuse(IntPair(10, 15), in testFuse() 139 IntPair(15, 30))); in testFuse() 141 IntPair(10, 30), in testFuse() 142 h.fuse(IntPair(15, 15), in testFuse() 143 IntPair(10, 30))); in testFuse() 145 IntPair(10, 30), in testFuse() 146 h.fuse(IntPair(20, 30), in testFuse() 162 expected += IntPair(40, 42); in testSubstract() [all …]
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/geometry/ |
H A D | region.h | 876 typedef Region<1>::IntPair IntPair; typedef 896 IntPair(c, 0), in operator() 930 typedef Region<1>::IntPair IntPair; typedef 961 typedef Region<1>::IntPair IntPair; typedef 1039 typedef Region<1>::IntPair IntPair; typedef 1085 inline bool intersectOrTouch(const IntPair& a, const IntPair& b) const in intersectOrTouch() 1092 inline IntPair fuse(const IntPair& a, const IntPair& b) const in fuse() 1103 typedef Region<1>::IntPair IntPair; typedef 1175 typedef Region<1>::IntPair IntPair; typedef 1228 inline bool intersect(const IntPair& a, const IntPair& b) const in intersect() [all …]
|