HomeSort by relevance Sort by last modified time
    Searched defs:eq (Results 1 - 25 of 783) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/icu/icu4c/source/i18n/
number_decimfmtprops.cpp 60 bool eq = true; local
61 eq = eq && compactStyle == other.compactStyle;
62 eq = eq && currency == other.currency;
63 eq = eq && currencyPluralInfo.fPtr.getAlias() == other.currencyPluralInfo.fPtr.getAlias();
64 eq = eq && currencyUsage == other.currencyUsage;
65 eq = eq && decimalPatternMatchRequired == other.decimalPatternMatchRequired
    [all...]
pluralaffix.h 163 return affixes.equals(rhs.affixes, &eq);
169 static UBool eq(const DigitAffix &x, const DigitAffix &y) { function in class:PluralAffix
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
lex_test.go 12 func eq(a, b []string) bool { func
44 if !eq(got, tt.want) {
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/
lex_test.go 12 func eq(a, b []string) bool { func
44 if !eq(got, tt.want) {
  /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/
lower_bound.pass.cpp 25 TEST_CONSTEXPR bool eq(int a, int b) { return a == b; } function
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue10253.go 12 if !eq() {
20 func eq() bool { func
  /prebuilts/go/linux-x86/test/fixedbugs/
issue10253.go 12 if !eq() {
20 func eq() bool { func
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/
adjacent_find_pred.pass.cpp 26 TEST_CONSTEXPR bool eq (int a, int b) { return a == b; } function
32 return (std::adjacent_find(std::begin(ia), std::end(ia), eq) == ia+2)
33 && (std::adjacent_find(std::begin(ib), std::end(ib), eq) == std::end(ib))
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
init_size.pass.cpp 54 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
55 Eq eq = c.equal_range(1); local
56 assert(std::distance(eq.first, eq.second) == 2);
57 C::const_iterator i = eq.first;
63 eq = c.equal_range(2);
64 assert(std::distance(eq.first, eq.second) == 2);
65 i = eq.first
110 Eq eq = c.equal_range(1); local
    [all...]
init_size_hash.pass.cpp 55 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
56 Eq eq = c.equal_range(1); local
57 assert(std::distance(eq.first, eq.second) == 2);
58 C::const_iterator i = eq.first;
64 eq = c.equal_range(2);
65 assert(std::distance(eq.first, eq.second) == 2);
66 i = eq.first
112 Eq eq = c.equal_range(1); local
    [all...]
init_size_hash_equal.pass.cpp 57 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
58 Eq eq = c.equal_range(1); local
59 assert(std::distance(eq.first, eq.second) == 2);
60 C::const_iterator i = eq.first;
66 eq = c.equal_range(2);
67 assert(std::distance(eq.first, eq.second) == 2);
68 i = eq.first
115 Eq eq = c.equal_range(1); local
    [all...]
init_size_hash_equal_allocator.pass.cpp 58 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
59 Eq eq = c.equal_range(1); local
60 assert(std::distance(eq.first, eq.second) == 2);
61 C::const_iterator i = eq.first;
67 eq = c.equal_range(2);
68 assert(std::distance(eq.first, eq.second) == 2);
69 i = eq.first
117 Eq eq = c.equal_range(1); local
176 Eq eq = c.equal_range(1); local
    [all...]
range_size.pass.cpp 57 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
58 Eq eq = c.equal_range(1); local
59 assert(std::distance(eq.first, eq.second) == 2);
60 C::const_iterator i = eq.first;
66 eq = c.equal_range(2);
67 assert(std::distance(eq.first, eq.second) == 2);
68 i = eq.first
116 Eq eq = c.equal_range(1); local
    [all...]
range_size_hash.pass.cpp 59 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
60 Eq eq = c.equal_range(1); local
61 assert(std::distance(eq.first, eq.second) == 2);
62 C::const_iterator i = eq.first;
68 eq = c.equal_range(2);
69 assert(std::distance(eq.first, eq.second) == 2);
70 i = eq.first
119 Eq eq = c.equal_range(1); local
    [all...]
range_size_hash_equal.pass.cpp 60 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
61 Eq eq = c.equal_range(1); local
62 assert(std::distance(eq.first, eq.second) == 2);
63 C::const_iterator i = eq.first;
69 eq = c.equal_range(2);
70 assert(std::distance(eq.first, eq.second) == 2);
71 i = eq.first
121 Eq eq = c.equal_range(1); local
    [all...]
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
insert_init.pass.cpp 45 typedef std::pair<C::iterator, C::iterator> Eq;
46 Eq eq = c.equal_range(1); local
47 assert(std::distance(eq.first, eq.second) == 2);
48 C::iterator k = eq.first;
54 eq = c.equal_range(2);
55 assert(std::distance(eq.first, eq.second) == 2);
56 k = eq.first
92 Eq eq = c.equal_range(1); local
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/testdata/
append.go 22 func eq(a, b []int) bool { func
35 if eq(got, want) {
  /prebuilts/go/darwin-x86/test/method4.dir/
prog.go 41 func eq(v1, v2 int) { func
52 eq(t1.Sum(a, 5), 15)
53 eq(t2.Sum(a, 6), 16)
55 eq(T1.Sum(t1, a, 7), 17)
56 eq((*T2).Sum(t2, a, 8), 18)
59 eq(f1(t1, a, 9), 19)
61 eq(f2(t2, a, 10), 20)
63 eq(I1.Sum(t1, a, 11), 21)
64 eq(I1.Sum(t2, a, 12), 22)
67 eq(f3(t1, a, 13), 23
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/testdata/
append.go 22 func eq(a, b []int) bool { func
35 if eq(got, want) {
  /prebuilts/go/linux-x86/test/method4.dir/
prog.go 41 func eq(v1, v2 int) { func
52 eq(t1.Sum(a, 5), 15)
53 eq(t2.Sum(a, 6), 16)
55 eq(T1.Sum(t1, a, 7), 17)
56 eq((*T2).Sum(t2, a, 8), 18)
59 eq(f1(t1, a, 9), 19)
61 eq(f2(t2, a, 10), 20)
63 eq(I1.Sum(t1, a, 11), 21)
64 eq(I1.Sum(t2, a, 12), 22)
67 eq(f3(t1, a, 13), 23
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.count/
count_if.pass.cpp 23 struct eq { struct
24 eq (int val) : v(val) {} function in struct:eq
36 eq(2)) == 3);
39 eq(7)) == 0);
42 eq(2)) == 0);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find/
find_if.pass.cpp 23 struct eq { struct
24 eq (int val) : v(val) {} function in struct:eq
35 eq(3));
39 eq(10));
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
init_size.pass.cpp 54 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
55 Eq eq = c.equal_range(1); local
56 assert(std::distance(eq.first, eq.second) == 2);
57 C::const_iterator i = eq.first;
63 eq = c.equal_range(2);
64 assert(std::distance(eq.first, eq.second) == 2);
65 i = eq.first
110 Eq eq = c.equal_range(1); local
    [all...]
init_size_hash.pass.cpp 55 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
56 Eq eq = c.equal_range(1); local
57 assert(std::distance(eq.first, eq.second) == 2);
58 C::const_iterator i = eq.first;
64 eq = c.equal_range(2);
65 assert(std::distance(eq.first, eq.second) == 2);
66 i = eq.first
112 Eq eq = c.equal_range(1); local
    [all...]
init_size_hash_equal.pass.cpp 57 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
58 Eq eq = c.equal_range(1); local
59 assert(std::distance(eq.first, eq.second) == 2);
60 C::const_iterator i = eq.first;
66 eq = c.equal_range(2);
67 assert(std::distance(eq.first, eq.second) == 2);
68 i = eq.first
115 Eq eq = c.equal_range(1); local
    [all...]

Completed in 936 milliseconds

1 2 3 4 5 6 7 8 91011>>