| /external/chromium_org/net/http/ |
| http_util.cc | 177 bool eq = !mime_type->empty() && LowerCaseEqualsASCII(begin + type_val, member in namespace:__anon11219
180 if (!eq) {
184 if ((!eq && *had_charset) || type_has_charset) {
|
| /external/chromium_org/v8/test/mjsunit/ |
| compare-known-objects-slow.js | 34 function eq(a, b) { function
44 assertTrue(eq(a, a));
45 assertTrue(eq(b, b));
46 assertFalse(eq(a, b));
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2250.js | 40 function eq(a, b) { function
52 for (var i = 0; !eq(i, 10); i++)
56 eq({}, {});
57 eq({}, {});
58 eq(1, 1);
59 eq(1, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| init.pass.cpp | 48 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
49 Eq eq = c.equal_range(1); local
50 assert(std::distance(eq.first, eq.second) == 2);
51 C::const_iterator i = eq.first;
57 eq = c.equal_range(2);
58 assert(std::distance(eq.first, eq.second) == 2);
59 i = eq.first
103 Eq eq = c.equal_range(1); local
[all...] |
| init_size.pass.cpp | 50 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
51 Eq eq = c.equal_range(1); local
52 assert(std::distance(eq.first, eq.second) == 2);
53 C::const_iterator i = eq.first;
59 eq = c.equal_range(2);
60 assert(std::distance(eq.first, eq.second) == 2);
61 i = eq.first
107 Eq eq = c.equal_range(1); local
[all...] |
| init_size_hash.pass.cpp | 51 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
52 Eq eq = c.equal_range(1); local
53 assert(std::distance(eq.first, eq.second) == 2);
54 C::const_iterator i = eq.first;
60 eq = c.equal_range(2);
61 assert(std::distance(eq.first, eq.second) == 2);
62 i = eq.first
109 Eq eq = c.equal_range(1); local
[all...] |
| init_size_hash_equal.pass.cpp | 53 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
54 Eq eq = c.equal_range(1); local
55 assert(std::distance(eq.first, eq.second) == 2);
56 C::const_iterator i = eq.first;
62 eq = c.equal_range(2);
63 assert(std::distance(eq.first, eq.second) == 2);
64 i = eq.first
112 Eq eq = c.equal_range(1); local
[all...] |
| init_size_hash_equal_allocator.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
114 Eq eq = c.equal_range(1); local
[all...] |
| range.pass.cpp | 52 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
53 Eq eq = c.equal_range(1); local
54 assert(std::distance(eq.first, eq.second) == 2);
55 C::const_iterator i = eq.first;
61 eq = c.equal_range(2);
62 assert(std::distance(eq.first, eq.second) == 2);
63 i = eq.first
109 Eq eq = c.equal_range(1); local
[all...] |
| range_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
113 Eq eq = c.equal_range(1); local
[all...] |
| range_size_hash.pass.cpp | 56 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
57 Eq eq = c.equal_range(1); local
58 assert(std::distance(eq.first, eq.second) == 2);
59 C::const_iterator i = eq.first;
65 eq = c.equal_range(2);
66 assert(std::distance(eq.first, eq.second) == 2);
67 i = eq.first
116 Eq eq = c.equal_range(1); local
[all...] |
| range_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
118 Eq eq = c.equal_range(1); local
[all...] |
| range_size_hash_equal_allocator.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
121 Eq eq = c.equal_range(1); local
[all...] |
| assign_init.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
112 Eq eq = c.equal_range(1); local
[all...] |
| assign_move.pass.cpp | 63 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
64 Eq eq = c.equal_range(1); local
65 assert(std::distance(eq.first, eq.second) == 2);
66 C::const_iterator i = eq.first;
72 eq = c.equal_range(2);
73 assert(std::distance(eq.first, eq.second) == 2);
74 i = eq.first
129 Eq eq = c.equal_range(1); local
194 Eq eq = c.equal_range(1); local
260 Eq eq = c.equal_range(1); local
[all...] |
| move.pass.cpp | 92 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
93 Eq eq = c.equal_range(1); local
94 assert(std::distance(eq.first, eq.second) == 2);
95 C::const_iterator i = eq.first;
101 eq = c.equal_range(2);
102 assert(std::distance(eq.first, eq.second) == 2);
103 i = eq.first
193 Eq eq = c.equal_range(1); local
[all...] |
| move_alloc.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
124 Eq eq = c.equal_range(1); local
189 Eq eq = c.equal_range(1); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_key.pass.cpp | 41 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
42 Eq eq = c.equal_range(1); local
43 assert(std::distance(eq.first, eq.second) == 2);
44 C::const_iterator k = eq.first;
50 eq = c.equal_range(2);
51 assert(std::distance(eq.first, eq.second) == 2);
52 k = eq.first
205 Eq eq = c.equal_range(1); local
[all...] |
| insert_init.pass.cpp | 43 typedef std::pair<C::iterator, C::iterator> Eq;
44 Eq eq = c.equal_range(1); local
45 assert(std::distance(eq.first, eq.second) == 2);
46 C::iterator k = eq.first;
52 eq = c.equal_range(2);
53 assert(std::distance(eq.first, eq.second) == 2);
54 k = eq.first
91 Eq eq = c.equal_range(1); local
[all...] |
| erase_const_iter.pass.cpp | 43 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
44 Eq eq = c.equal_range(1); local
45 assert(std::distance(eq.first, eq.second) == 2);
46 C::const_iterator k = eq.first;
52 eq = c.equal_range(2);
53 assert(std::distance(eq.first, eq.second) == 1);
54 k = eq.first
90 Eq eq = c.equal_range(1); local
[all...] |
| erase_range.pass.cpp | 44 typedef std::pair<C::iterator, C::iterator> Eq;
45 Eq eq = c.equal_range(1); local
46 assert(std::distance(eq.first, eq.second) == 2);
47 k = eq.first;
53 eq = c.equal_range(2);
54 assert(std::distance(eq.first, eq.second) == 2);
55 k = eq.first
122 Eq eq = c.equal_range(1); local
[all...] |
| insert_range.pass.cpp | 43 typedef std::pair<C::iterator, C::iterator> Eq;
44 Eq eq = c.equal_range(1); local
45 assert(std::distance(eq.first, eq.second) == 2);
46 C::iterator k = eq.first;
52 eq = c.equal_range(2);
53 assert(std::distance(eq.first, eq.second) == 2);
54 k = eq.first
91 Eq eq = c.equal_range(1); local
[all...] |
| /hardware/broadcom/wlan/bcmdhd/dhdutil/ |
| miniopt.c | 60 char *p, *eq, *valstr, *endptr = NULL; local
94 eq = strchr(p, '=');
95 if (eq == NULL && !t->longflags) {
101 keylen = eq ? (eq - (p + 2)) : (int)strlen(p) - 2;
105 if (eq) {
106 valstr = eq + 1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| rehash.pass.cpp | 29 typedef std::pair<typename C::const_iterator, typename C::const_iterator> Eq;
30 Eq eq = c.equal_range(1); local
31 assert(std::distance(eq.first, eq.second) == 2);
32 typename C::const_iterator i = eq.first;
38 eq = c.equal_range(2);
39 assert(std::distance(eq.first, eq.second) == 2);
40 i = eq.first
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| stack_trace_table.cc | 46 const bool eq = (this->hash == h && this->trace.depth == t.depth); local
47 for (int i = 0; eq && i < t.depth; ++i) {
52 return eq;
|
