/macosx-10.10/CPAN-56/Modules/Mail-SPF-v2.8.0/ |
H A D | Makefile | 2 VERSION = v2.8.0
|
/macosx-10.10/CPAN-56/Modules/Mail-SPF-v2.9.0/ |
H A D | Makefile | 2 VERSION = v2.9.0
|
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/examples/ |
H A D | derived.py | 26 v2 = vw.select({'value':2},{'value':5}) variable 27 show(v2) 29 # a deletion in original "vw" affects derived "v2" 31 show(v2) 33 # deletion in derived "v2" affects both (new in 2.3) 34 v2.delete(1) 35 show(v2)
|
H A D | pair.py | 1 # Small demo of v1.pair(v2) 19 v2 = db.getas("two[i:I]") variable 24 v2.append(i=v) 26 metakit.dump(v1.pair(v2))
|
H A D | remap.py | 1 # Small demo of v1.remapwith(v2) 21 v2 = db.getas("map[i:I]") variable 26 v2.append(i=v) 28 metakit.dump(v1.remapwith(v2))
|
H A D | mkbug.cpp | 23 c4_View v2 = v1.Blocked(); local 24 printf("%d\n", v2.GetSize()); 26 v2.RemoveAt(pos_, len_); 27 printf("%d\n", v2.GetSize());
|
H A D | case.py | 16 v2 = db.getas('hi[hello:S]') variable 19 print v1.HeLLo, v2.hello
|
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/tests/ |
H A D | tcusto1.cpp | 18 c4_View v2 = v1.Slice(1, - 1, 2); local 19 A(v2.GetSize() == 2); 20 A(p1(v2[0]) == 234); 21 A(p1(v2[1]) == 456); 25 A(v2.GetSize() == 3); 26 A(p1(v2[2]) == 678); 40 c4_View v2 = v1.Slice(1, - 1, - 2); local 41 A(v2.GetSize() == 2); 42 A(p1(v2[0]) == 456); 43 A(p1(v2[ 64 c4_View v2 = v1.Slice(1, 5, - 1); local 86 c4_View v2; local 120 c4_View v2; local 144 c4_View v2; local 168 c4_View v2; local 191 c4_View v2 = v1.Rename(p1, p2); local 207 c4_View v1, v2, v3; local 247 c4_View v1, v2, v3; local [all...] |
H A D | tnotify.cpp | 18 c4_View v2 = v1.SelectRange(p1[200], p1[333]); local 19 A(v2.GetSize() == 3); 20 A(p1(v2[0]) == 222); 21 A(p1(v2[1]) == 333); 22 A(p1(v2[2]) == 234); 25 A(v2.GetSize() == 4); 26 A(p1(v2[0]) == 222); 27 A(p1(v2[1]) == 333); 28 A(p1(v2[2]) == 234); 29 A(p1(v2[ 50 c4_View v2 = v1.SelectRange(p1[200], p1[333]); local 78 c4_View v2 = v1.SelectRange(p1[200], p1[333]); local 102 c4_View v2 = v1.SelectRange(p1[200], p1[333]); local 124 c4_View v2 = v1.Sort(); local 154 c4_View v2 = v1.Sort(); local 180 c4_View v2 = v1.SortOn(p1); local 208 c4_View v2 = v1.Select(p2[1]); local 247 c4_View v2 = v1.SelectRange(p1[200], p1[333]); local 292 c4_View v2 = v1.Sort(); local 301 c4_View v2 = v1.SelectRange(p2[200], p2[333]); local 325 c4_View v2 = v1.Select(p1[1]); local 377 c4_View v2 = v1.ProjectWithout(p2); local 432 c4_View v2 = v1.Select(p1[1]); local [all...] |
H A D | tformat.cpp | 20 c4_View v2 = s1.GetAs("b[p2:I]"); local 22 v2.Add(p2[345]); 23 v2.Add(p2[567]); 34 c4_View v2 = s1.View("b"); local 35 A(v2.GetSize() == 2); 36 A(p2(v2[0]) == 345); 37 A(p2(v2[1]) == 567); 55 c4_View v2 = s1.View("b"); local 56 v2.Add(p2[345]); 57 v2 69 c4_View v2 = s1.View("b"); local 82 c4_View v2 = s1.View("b"); local 129 c4_View v2 = s1.View("b"); local 143 c4_View v2 = s1.View("b"); local 166 c4_View v2 = s1.View("b"); local 176 c4_View v2 = s1.View("b"); local 189 c4_View v2 = s1.View("b"); local 251 c4_View v2 = s1.GetAs("dict[p1:S,p2:S]"); local 272 c4_View v2 = s1.GetAs("a[p1:I,p2:I]"); local 302 c4_View v2 = s1.GetAs("a[p1:I,p2:I]"); local [all...] |
H A D | tcusto2.cpp | 12 c4_View v1, v2, v3; local 23 v2 = v1.Unique(); 24 A(v2.GetSize() == 5); 25 A(p1(v2[0]) == 1); 26 A(p1(v2[1]) == 1); 27 A(p1(v2[2]) == 2); 28 A(p1(v2[3]) == 3); 29 A(p1(v2[4]) == 4); 31 A(p2(v2[0]) == 11); 32 A(p2(v2[ 43 c4_View v1, v2, v3; local 67 c4_View v1, v2, v3; local 88 c4_View v1, v2, v3; local 110 c4_View v1, v2, v3; local 153 c4_View v1, v2, v3; local 225 c4_View v1, v2, v3; local 327 c4_View v2; local 368 c4_View v1, v2, v3; local 417 c4_View v2 = v1.GroupBy(p2, p4); local [all...] |
H A D | tbasic2.cpp | 22 c4_View v2 = v1.Sort(); local 23 A(v2.GetSize() == 6); 24 A(p1(v2[0]) == 111); 25 A(p1(v2[1]) == 123); 26 A(p1(v2[2]) == 222); 27 A(p1(v2[3]) == 234); 28 A(p1(v2[4]) == 333); 29 A(p1(v2[5]) == 345); 30 A(v2.Search(p1[123]) == 1); 31 A(v2 105 c4_View v2 = v1.Sort(); local 130 c4_View v2 = v1.Unique(); local 164 c4_View v2 = v1.Select(p1[222]); local [all...] |
/macosx-10.10/pyobjc-45/2.5/pyobjc/pyobjc-core/PyObjCTest/ |
H A D | test_pickle.py | 16 v2 = pickle.loads(s) 17 self.assertEquals(v2, v) 18 self.assert_(not isinstance(v2, OC_PythonInt)) 19 self.assert_(isinstance(v2, int)) 23 v2 = cPickle.loads(s) 24 self.assertEquals(v2, v) 25 self.assert_(not isinstance(v2, OC_PythonInt)) 26 self.assert_(isinstance(v2, int)) 34 v2 = pickle.loads(s) 35 self.assertEquals(v2, [all...] |
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/PyObjCTest/ |
H A D | test_pickle.py | 22 v2 = pickle.loads(s) 23 self.assertEquals(v2, v) 24 self.assertIsNotInstance(v2, number_type) 25 self.assertIsInstance(v2, int) 29 v2 = cPickle.loads(s) 30 self.assertEquals(v2, v) 31 self.assertIsNotInstance(v2, number_type) 32 self.assertIsInstance(v2, int) 40 v2 = pickle.loads(s) 41 self.assertEquals(v2, [all...] |
/macosx-10.10/pyobjc-45/pyobjc/pyobjc-core-2.5.1/PyObjCTest/ |
H A D | test_pickle.py | 32 v2 = pickle.loads(s) 33 self.assertEqual(v2, v) 34 self.assertIsNotInstance(v2, number_type) 35 self.assertIsInstance(v2, int) 40 v2 = cPickle.loads(s) 41 self.assertEqual(v2, v) 42 self.assertIsNotInstance(v2, number_type) 43 self.assertIsInstance(v2, int) 51 v2 = pickle.loads(s) 52 self.assertEqual(v2, [all...] |
/macosx-10.10/llvmCore-3425.0.34/utils/unittest/googletest/include/gtest/ |
H A D | gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 134 const T2& v2) { 135 if (pred(v1, v2)) return AssertionSuccess(); 141 << "\n" << e2 << " evaluates to " << v2; 146 #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ 147 GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ 152 #define GTEST_PRED2_(pred, v1, v2, on_failur 129 AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) argument 178 AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) argument 234 AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) argument 297 AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) argument [all...] |
/macosx-10.10/OpenLDAP-499.27/OpenLDAP/libraries/liblutil/ |
H A D | memcmp.c | 24 (lutil_memcmp)(const void *v1, const void *v2, size_t n) argument 27 const unsigned char *s1=v1, *s2=v2;
|
/macosx-10.10/bind9-45.101/bind9/contrib/zkt/ |
H A D | debug.h | 48 # define dbg_val2(fmt, v1, v2) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2) 49 # define dbg_val3(fmt, v1, v2, v3) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3) 50 # define dbg_val4(fmt, v1, v2, v3, v4) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3, v4) 51 # define dbg_val5(fmt, v1, v2, v3, v4, v5) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v3, v4, v5) 52 # define dbg_val6(fmt, v1, v2, v3, v4, v5, v6) fprintf (stderr, "DBG: %s(%d) " fmt, __FILE__, __LINE__, v1, v2, v [all...] |
/macosx-10.10/dtrace-147/libdwarf/ |
H A D | bldDWindex.sh | 1 sed -n -e '/^%%Page.*/p' -e '/.*DW_.*/p' <dwarf.v2.ps |
|
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/tcl/tests/ |
H A D | object.test | 120 mk::view open db.b v2 125 fill v2 i 3 4 5 6 7 138 set v [v1 view concat v2] 142 set v [v1 view different v2] 146 set v [v1 view minus v2] 150 set v [v1 view intersect v2] 154 set v [v1 view union v2] 162 set v [v2 view range 2 3] 166 set v [v2 view range 3 end] 170 set v [v2 vie [all...] |
/macosx-10.10/ntp-92/scripts/ |
H A D | calc_tickadj.in | 13 $v2=""; 19 ($v1, $v2) = split;
|
/macosx-10.10/bzip2-36/bzip2/arm64/ |
H A D | crc32vec.s | 36 let there be at least 8 128-bit vectors v0, v1, v2, v3, v4, v5, v6, v7 37 we can apply the folding to (v0,x4), (v1,v5), (v2,v6), (v3,v7), respectively, with T = 512 56 b. v1 = H'(x)*x^64 + L'(x), a P(x) congruen vector is v2 = H'(x) * (x^64 mod P(x)) + L'(x), which is 64-bit. 57 c. use Barrett Reduction to divide 64-bit v2 by P(x) into the final 32-bit crc. 58 i. T1 = floor(v2/x^32) * u; // u is actually 1/P(x) 60 iii. crc = (v2 + T2) mod x^32; 77 st1.4s {v0,v1,v2,v3},[x3],#4*16 111 ld1.4s {v1,v2,v3}, [buf], #48 113 rev64.16b v2, v2 [all...] |
/macosx-10.10/libarchive-30/libarchive/libarchive/test/ |
H A D | test.h | 142 #define assertEqualInt(v1,v2) \ 143 assertion_equal_int(__FILE__, __LINE__, (v1), #v1, (v2), #v2, NULL) 145 #define assertEqualString(v1,v2) \ 146 assertion_equal_string(__FILE__, __LINE__, (v1), #v1, (v2), #v2, NULL) 147 /* As above, but v1 and v2 are wchar_t * */ 148 #define assertEqualWString(v1,v2) \ 149 assertion_equal_wstring(__FILE__, __LINE__, (v1), #v1, (v2), #v2, NUL [all...] |
/macosx-10.10/groff-38/groff/src/roff/troff/ |
H A D | number.cpp | 292 units v2; local 293 if (!parse_term(&v2, scale_indicator, parenthesised, rigid)) 298 *v = *v < v2; 301 *v = *v > v2; 304 *v = *v <= v2; 307 *v = *v >= v2; 310 if (*v > v2) 311 *v = v2; 314 if (*v < v2) 315 *v = v2; [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/runtime/ |
H A D | Operations.h | 110 ALWAYS_INLINE bool jsLess(CallFrame* callFrame, JSValue v1, JSValue v2) argument 112 if (v1.isInt32() && v2.isInt32()) 113 return v1.asInt32() < v2.asInt32(); 115 if (v1.isNumber() && v2.isNumber()) 116 return v1.asNumber() < v2.asNumber(); 118 if (isJSString(v1) && isJSString(v2)) 119 return codePointCompareLessThan(asString(v1)->value(callFrame), asString(v2)->value(callFrame)); 129 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); 131 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); 144 ALWAYS_INLINE bool jsLessEq(CallFrame* callFrame, JSValue v1, JSValue v2) argument 183 jsAdd(CallFrame* callFrame, JSValue v1, JSValue v2) argument [all...] |