Home
last modified time | relevance | path

Searched refs:one (Results 1 - 25 of 908) sorted by relevance

12345678910>>...37

/third_party/musl/libc-test/src/functionalext/supplement/string/
H A Dmemmove.c19 char one[50]; variable
29 memset(one, 0, sizeof(one)); in memmove_0100()
31 strcpy(one, "abcdefgh"); in memmove_0100()
32 memmove(one, one, 9); in memmove_0100()
33 if (strcmp(one, "abcdefgh")) { in memmove_0100()
45 memset(one, 0, sizeof(one)); in memmove_0200()
48 strcpy(one, "helloWorl in memmove_0200()
[all...]
/third_party/protobuf/src/google/protobuf/stubs/
H A Dint128_unittest.cc47 uint128 one(1); in TEST()
57 EXPECT_LT(one, two); in TEST()
58 EXPECT_GT(two, one); in TEST()
59 EXPECT_LT(one, big); in TEST()
60 EXPECT_LT(one, big); in TEST()
61 EXPECT_EQ(one, one_2arg); in TEST()
62 EXPECT_NE(one, two); in TEST()
63 EXPECT_GT(big, one); in TEST()
75 EXPECT_EQ(one, one | on in TEST()
438 constexpr uint128 one = 1; TEST() local
[all...]
/third_party/typescript/tests/baselines/reference/
H A DreadonlyPropertySubtypeRelationDirected.js3 //// [one.ts]
7 const one: { readonly a: string } = { a: 'one' };
10 // when `one` comes first in the conditional check, the return type of `doSomething` is inferred as `a` is readonly, but `a` is
11 // only treated as readonly (i.e. it will produce a diagnostic if you try to assign to it) based on the order of declarations of `one` and `two` above
12 const three = (condition) ? one : two;
16 // the inferred (displayed?) type of `a` also depends on the order of the condition above. When `one` comes first, the displayed type is `any`
26 const one: { readonly a: string } = { a: 'one' };
30 // based on the declaration order of `one` an
[all...]
H A DassignmentCompatability40.js3 export interface interfaceWithPublicAndOptional<T,U> { one: T; two?: U; }; var obj4: interfaceWithPublicAndOptional<number,string> = { one: 1 };;
7 export class classWithPrivate<T> { constructor(private one: T) {} } var x5 = new classWithPrivate(1);;
16 var obj4 = { one: 1 };
23 function classWithPrivate(one) {
24 this.one = one;
H A DassignmentCompatability8.js3 export interface interfaceWithPublicAndOptional<T,U> { one: T; two?: U; }; var obj4: interfaceWithPublicAndOptional<number,string> = { one: 1 };;
7 export class classWithPublic<T> { constructor(public one: T) {} } var x1 = new classWithPublic(1);;
16 var obj4 = { one: 1 };
23 function classWithPublic(one) {
24 this.one = one;
H A DassignmentCompatability9.js3 export interface interfaceWithPublicAndOptional<T,U> { one: T; two?: U; }; var obj4: interfaceWithPublicAndOptional<number,string> = { one: 1 };;
7 export class classWithOptional<T> { constructor(public one?: T) {} } var x3 = new classWithOptional<number>();;
16 var obj4 = { one: 1 };
23 function classWithOptional(one) {
24 this.one = one;
/third_party/skia/src/pathops/
H A DSkIntersections.cpp34 int SkIntersections::insert(double one, double two, const SkDPoint& pt) { in insert() argument
35 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { in insert()
44 if (one == oldOne && two == oldTwo) { in insert()
47 if (more_roughly_equal(oldOne, one) && more_roughly_equal(oldTwo, two)) { in insert()
48 if ((!precisely_zero(one) || precisely_zero(oldOne)) in insert()
49 && (!precisely_equal(one, 1) || precisely_equal(oldOne, 1)) in insert()
54 SkASSERT(one >= 0 && one <= 1); in insert()
69 SkDebugf("%s t=%1.9g pts roughly equal\n", __FUNCTION__, one); in insert()
74 if (fT[0][index] > one) { in insert()
107 insertNear(double one, double two, const SkDPoint& pt1, const SkDPoint& pt2) insertNear() argument
116 insertCoincident(double one, double two, const SkDPoint& pt) insertCoincident() argument
[all...]
/third_party/python/Lib/test/test_importlib/
H A Dtest_namespace_pkgs.py75 import foo.one namespace
76 self.assertEqual(foo.one.attr, 'portion1 foo one')
83 import foo.one namespace
94 # Make sure only 'foo.one' can be imported
95 import foo.one namespace
96 self.assertEqual(foo.one.attr, 'portion1 foo one')
113 import foo.one namespace
115 self.assertEqual(foo.one
123 import foo.one global() namespace
138 import foo.one global() namespace
167 import foo.one global() namespace
174 import foo.one global() namespace
181 import foo.one global() namespace
190 import foo.one global() namespace
202 import foo.one global() namespace
214 import foo.one global() namespace
226 import foo.one global() namespace
239 import foo.one global() namespace
250 import parent.child.one global() namespace
267 import parent.child.one global() namespace
308 import foo.one global() namespace
330 import foo.one global() namespace
343 import foo.one global() namespace
[all...]
/third_party/skia/gm/
H A Darithmode.cpp93 constexpr SkScalar one = SK_Scalar1; variable
96 0, 0, 0, one,
97 0, one, 0, 0,
98 0, 0, one, 0,
99 0, one, one, 0,
100 0, one, -one, 0,
101 0, one/2, one/
[all...]
/third_party/skia/docs/examples/
H A DPath_equal_operator.cpp8 SkDebugf("%s one %c= two\n", prefix, a == b ? '=' : '!'); in REG_FIDDLE()
10 SkPath one; in REG_FIDDLE() local
12 debugster("empty", one, two); in REG_FIDDLE()
13 one.moveTo(0, 0); in REG_FIDDLE()
14 debugster("moveTo", one, two); in REG_FIDDLE()
15 one.rewind(); in REG_FIDDLE()
16 debugster("rewind", one, two); in REG_FIDDLE()
17 one.moveTo(0, 0); in REG_FIDDLE()
18 one.reset(); in REG_FIDDLE()
19 debugster("reset", one, tw in REG_FIDDLE()
[all...]
H A Dpathops.cpp11 SkColor blend(SkColor one, SkColor two) { in REG_FIDDLE() argument
15 canvas.drawColor(one); in REG_FIDDLE()
40 SkPath one, two; in REG_FIDDLE() local
48 one.reset(); in REG_FIDDLE()
49 one.setFillType(oneF); in REG_FIDDLE()
51 one.moveTo(10, 10); in REG_FIDDLE()
52 one.conicTo(0, 90, 50, 50, 3); in REG_FIDDLE()
53 one.conicTo(90, 0, 90, 90, 2); in REG_FIDDLE()
54 one.close(); in REG_FIDDLE()
62 canvas->drawPath(one, fOnePain in REG_FIDDLE()
[all...]
/third_party/gn/src/gn/
H A Dmetadata_walk_unittest.cc16 TestTarget one(setup, "//foo:one", Target::SOURCE_SET); in TEST()
19 one.metadata().contents().insert( in TEST()
24 one.metadata().contents().insert( in TEST()
27 one.metadata().set_source_dir(SourceDir("/usr/home/files/")); in TEST()
43 targets.push_back(&one); in TEST()
66 expected_walked_targets.insert(&one); in TEST()
74 TestTarget one(setup, "//foo:one", Target::SOURCE_SET); in TEST()
77 one in TEST()
[all...]
/third_party/mesa3d/src/compiler/nir/tests/
H A Dcore_tests.cpp96 nir_ssa_def *one = nir_imm_int(b, 1); in TEST_F() local
97 nir_ssa_def *add01 = nir_iadd(b, zero, one); in TEST_F()
98 nir_ssa_def *add11 = nir_iadd(b, one, one); in TEST_F()
104 ASSERT_TRUE(shader_contains_def(one)); in TEST_F()
113 nir_ssa_def *one = nir_imm_int(b, 1); in TEST_F() local
114 nir_ssa_def *add = nir_iadd(b, one, one); in TEST_F()
118 ASSERT_FALSE(shader_contains_def(one)); in TEST_F()
127 nir_ssa_def *one in TEST_F() local
[all...]
H A Dcomparison_pre_tests.cpp96 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); in TEST_F() local
99 nir_ssa_def *flt = nir_flt(&bld, a, one); in TEST_F()
103 nir_fadd(&bld, nir_fneg(&bld, a), one); in TEST_F()
148 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); in TEST_F() local
151 nir_ssa_def *flt = nir_flt(&bld, one, b); in TEST_F()
155 nir_fadd(&bld, one, nir_fneg(&bld, b)); in TEST_F()
201 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); in TEST_F() local
204 nir_ssa_def *flt = nir_flt(&bld, nir_fneg(&bld, a), one); in TEST_F()
208 nir_fadd(&bld, a, one); in TEST_F()
253 nir_ssa_def *one in TEST_F() local
305 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); TEST_F() local
358 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); TEST_F() local
412 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); TEST_F() local
465 nir_ssa_def *one = nir_imm_float(&bld, 1.0f); TEST_F() local
[all...]
/third_party/jerryscript/jerry-libm/
H A Dtanh.c41 * 2. 0 <= x <= 2**-55 : tanh(x) := x * (one + x)
57 #define one 1.0 macro
77 return one / x + one; in tanh()
82 return one / x - one; in tanh()
93 return x * (one + x); in tanh()
99 z = one - two / (t + two); in tanh()
110 z = one - tiny; /* raised inexact flag */ in tanh()
115 #undef one macro
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dlistformattertest.cpp114 one("Alice", -1, US_INV), two("Bob", -1, US_INV), in ListFormatterTest()
129 void ListFormatterTest::CheckFourCases(const char* locale_string, UnicodeString one, UnicodeString two, in CheckFourCases() argument
137 UnicodeString input1[] = {one}; in CheckFourCases()
140 UnicodeString input2[] = {one, two}; in CheckFourCases()
143 UnicodeString input3[] = {one, two, three}; in CheckFourCases()
146 UnicodeString input4[] = {one, two, three, four}; in CheckFourCases()
150 UBool ListFormatterTest::RecordFourCases(const Locale& locale, UnicodeString one, UnicodeString two, in RecordFourCases() argument
158 UnicodeString input1[] = {one}; in RecordFourCases()
160 UnicodeString input2[] = {one, two}; in RecordFourCases()
162 UnicodeString input3[] = {one, tw in RecordFourCases()
[all...]
/third_party/python/Lib/distutils/tests/
H A Dtest_dep_util.py37 one = os.path.join(sources, 'one')
41 self.write_file(one)
45 self.assertEqual(newer_pairwise([one, two], [three, four]),
46 ([one],[three]))
52 one = os.path.join(sources, 'one')
59 self.write_file(one)
62 self.assertTrue(newer_group([one, two, three], old_file))
63 self.assertFalse(newer_group([one, tw
[all...]
/third_party/node/deps/v8/src/base/numbers/
H A Dfast-dtoa.cc88 // and v (the input number). They are guaranteed to be precise up to one unit. in RoundWeed()
89 // In fact the error is guaranteed to be strictly less than one unit. in RoundWeed()
101 // representations, and one is closer to both w_low and w_high, then we know in RoundWeed()
129 // representations close to w, but we cannot decide which one is closer. in RoundWeed()
335 // * if more than one decimal representation gives the minimal number of
336 // decimal digits then the one closest to W (where W is the correct value
362 // low, w and high are imprecise, but by less than one ulp (unit in the last
386 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e()); local
387 // Division by one is a shift.
388 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one
489 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e()); global() local
[all...]
/third_party/icu/icu4c/source/test/cintltst/
H A Dchashtst.c103 static const char one[4] = {0x6F, 0x6E, 0x65, 0}; /* "one" */ in TestBasic() local
123 _put(hash, one, 1, 0); in TestBasic()
127 _put(hash, one, -1, 1); in TestBasic()
130 _put(hash, one, 100, -1); in TestBasic()
134 _get(hash, one, 100); in TestBasic()
142 if(_compareChars((void*)one, (void*)three) == true || in TestBasic()
143 _compareChars((void*)one, (void*)one2) != true || in TestBasic()
144 _compareChars((void*)one, (void*)one) ! in TestBasic()
212 static const UChar one[4] = {0x006F, 0x006E, 0x0065, 0}; /* L"one" */ TestOtherAPI() local
[all...]
/third_party/icu/icu4c/source/samples/ustring/
H A Dustring.cpp438 UnicodeString one((UChar32)0x24001); in demoUnicodeStringStorage()
440 UnicodeString two=one; in demoUnicodeStringStorage()
442 // set "one" to contain the 3 UChars from readonly in demoUnicodeStringStorage()
444 one.setTo(readonly, UPRV_LENGTHOF(readonly)); in demoUnicodeStringStorage()
448 one+=UnicodeString(writeable, UPRV_LENGTHOF(writeable)); in demoUnicodeStringStorage()
449 one+=one; in demoUnicodeStringStorage()
450 one+=one; in demoUnicodeStringStorage()
451 printf("length of longer string: %d\n", one in demoUnicodeStringStorage()
[all...]
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dfast-dtoa.cc111 // and v (the input number). They are guaranteed to be precise up to one unit. in RoundWeed()
112 // In fact the error is guaranteed to be strictly less than one unit. in RoundWeed()
124 // representations, and one is closer to both w_low and w_high, then we know in RoundWeed()
152 // representations close to w, but we cannot decide which one is closer. in RoundWeed()
278 // * if more than one decimal representation gives the minimal number of
279 // decimal digits then the one closest to W (where W is the correct value
309 // low, w and high are imprecise, but by less than one ulp (unit in the last
333 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
334 // Division by one is a shift.
335 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one
[all...]
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-fast-dtoa.cpp125 // and v (the input number). They are guaranteed to be precise up to one unit. in RoundWeed()
126 // In fact the error is guaranteed to be strictly less than one unit. in RoundWeed()
138 // representations, and one is closer to both w_low and w_high, then we know in RoundWeed()
166 // representations close to w, but we cannot decide which one is closer. in RoundWeed()
292 // * if more than one decimal representation gives the minimal number of
293 // decimal digits then the one closest to W (where W is the correct value
323 // low, w and high are imprecise, but by less than one ulp (unit in the last
347 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
348 // Division by one is a shift.
349 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-fast-dtoa.cpp125 // and v (the input number). They are guaranteed to be precise up to one unit. in RoundWeed()
126 // In fact the error is guaranteed to be strictly less than one unit. in RoundWeed()
138 // representations, and one is closer to both w_low and w_high, then we know in RoundWeed()
166 // representations close to w, but we cannot decide which one is closer. in RoundWeed()
292 // * if more than one decimal representation gives the minimal number of
293 // decimal digits then the one closest to W (where W is the correct value
323 // low, w and high are imprecise, but by less than one ulp (unit in the last
347 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
348 // Division by one is a shift.
349 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-fast-dtoa.cpp125 // and v (the input number). They are guaranteed to be precise up to one unit. in RoundWeed()
126 // In fact the error is guaranteed to be strictly less than one unit. in RoundWeed()
138 // representations, and one is closer to both w_low and w_high, then we know in RoundWeed()
166 // representations close to w, but we cannot decide which one is closer. in RoundWeed()
292 // * if more than one decimal representation gives the minimal number of
293 // decimal digits then the one closest to W (where W is the correct value
323 // low, w and high are imprecise, but by less than one ulp (unit in the last
347 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
348 // Division by one is a shift.
349 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one
[all...]
/third_party/skia/third_party/externals/icu/source/samples/ustring/
H A Dustring.cpp438 UnicodeString one((UChar32)0x24001); in demoUnicodeStringStorage()
440 UnicodeString two=one; in demoUnicodeStringStorage()
442 // set "one" to contain the 3 UChars from readonly in demoUnicodeStringStorage()
444 one.setTo(readonly, UPRV_LENGTHOF(readonly)); in demoUnicodeStringStorage()
448 one+=UnicodeString(writeable, UPRV_LENGTHOF(writeable)); in demoUnicodeStringStorage()
449 one+=one; in demoUnicodeStringStorage()
450 one+=one; in demoUnicodeStringStorage()
451 printf("length of longer string: %d\n", one in demoUnicodeStringStorage()
[all...]

Completed in 14 milliseconds

12345678910>>...37