/external/chromium_org/tools/memory_inspector/memory_inspector/frontends/www_content/css/ |
H A D | mmap.css | 28 #mm-tools tr:first-of-type { 53 #mm-stats th:first-of-type { 57 #mm-stats tr:first-of-type th {
|
/external/chromium_org/ui/gfx/image/ |
H A D | image_family.cc | 76 greater_or_equal->first.aspect() == desired_aspect) { 80 // No exact match; |greater_or_equal| will point to the first image with 87 float thinner_aspect = less_than->first.aspect(); 91 float wider_aspect = greater_or_equal->first.aspect(); 100 float wider_aspect = greater_or_equal->first.aspect(); 116 greater_or_equal->first.aspect() == aspect) { 125 DCHECK_EQ(less_than->first.aspect(), aspect);
|
/external/chromium_org/v8/src/ |
H A D | harmony-string.js | 133 var first = %_StringCharCodeAt(string, pos); 134 if (first < 0xD800 || first > 0xDBFF || pos + 1 == size) { 135 return first; 139 return first; 141 return (first - 0xD800) * 0x400 + second + 0x2400;
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-node-algorithm.cc | 235 CHECK(n0->id() == visitor.edges_[0].first); 240 CHECK(-n0->id() == visitor.edges_[1].first); 241 CHECK(n0->id() == visitor.edges_[2].first); 244 CHECK(n2->id() == visitor.edges_[3].first); 248 CHECK(n3->id() == visitor.edges_[4].first); 251 CHECK(n0->id() == visitor.edges_[5].first); 257 CHECK(-n0->id() == visitor.edges_[6].first); 258 CHECK(n0->id() == visitor.edges_[7].first); 261 CHECK(n2->id() == visitor.edges_[8].first); 264 CHECK(n3->id() == visitor.edges_[9].first); [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | MapVector.h | 78 unsigned &I = Result.first->second; 92 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0); 94 unsigned &I = Result.first->second; 96 Vector.push_back(std::make_pair(KV.first, KV.second)); 122 typename MapType::iterator Pos = Map.find(Vector.back().first); 131 typename MapType::iterator MapIterator = Map.find(Iterator->first);
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticParameterization.cpp | 95 * lazily compute the coefficients, comparing the easiest to compute first. 96 * xx and yy first; then xy; and so on. 99 int first = 0; local 102 first += first == index; 105 if (first == index) { 108 if (!AlmostEqualUlps(p[index] * p2.p[first], p[first] * p2.p[index])) {
|
/external/valgrind/main/drd/tests/ |
H A D | annotate_hb_err.stderr.exp | 5 mutex 0x........ was first observed at: 12 cond 0x........ was first observed at: 19 order annotation 0x........ was first observed at:
|
/external/valgrind/main/helgrind/tests/ |
H A D | locked_vs_unlocked2.stderr.exp | 17 Lock at 0x........ was first observed 21 Lock at 0x........ was first observed 25 Lock at 0x........ was first observed
|
/external/valgrind/main/memcheck/tests/ |
H A D | unit_oset.c | 433 Addr first; member in struct:__anon33069 444 sprintf(buf, "<(%d) %lu..%lu (%d)>", b->b1, b->first, b->last, b->b2); 453 assert(elem->first <= elem->last); 454 if (key < elem->first) return -1; 469 OSet* oset = VG_(OSetGen_Create)(offsetof(Block, first), 485 vs[i]->first = i*10 + 1; 486 vs[i]->last = vs[i]->first + 2; 509 a = vs[i]->first + 0; assert( VG_(OSetGen_Contains)(oset, &a) ); 510 a = vs[i]->first + 1; assert( VG_(OSetGen_Contains)(oset, &a) ); 511 a = vs[i]->first [all...] |
/external/chromium_org/chrome/browser/extensions/ |
H A D | global_shortcut_listener.cc | 77 UnregisterAccelerator(to_remove->first, observer); 99 UnregisterAcceleratorImpl(it->first); 101 RegisterAcceleratorImpl(it->first);
|
/external/chromium_org/extensions/common/ |
H A D | extension_icon_set.cc | 33 if (iter->first <= size) { 44 if (iter->first >= size) { 67 return iter->first;
|
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/ |
H A D | AnimatableDoubleTest.cpp | 74 RefPtrWillBeRawPtr<AnimatableDouble> first = AnimatableDouble::create(-1.5); local 78 EXPECT_DOUBLE_EQ(3.75, AnimatableValue::distance(first.get(), second.get())); 80 EXPECT_DOUBLE_EQ(4.5, AnimatableValue::distance(third.get(), first.get()));
|
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | MergeIdenticalElementsCommand.cpp | 35 MergeIdenticalElementsCommand::MergeIdenticalElementsCommand(PassRefPtrWillBeRawPtr<Element> first, PassRefPtrWillBeRawPtr<Element> second) argument 36 : SimpleEditCommand(first->document()) 37 , m_element1(first)
|
/external/chromium_org/third_party/WebKit/Source/core/html/canvas/ |
H A D | WebGLTexture.cpp | 72 // Target is finalized the first time bindTexture() is called. 287 const LevelInfo& first = m_info[0][0]; local 291 || info.width != first.width || info.height != first.height 292 || info.internalFormat != first.internalFormat || info.type != first.type 330 const LevelInfo& first = m_info[0][0]; local 331 GLint levelCount = computeLevelCount(first.width, first.height); 338 || info0.width != first [all...] |
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGEnumeration.cpp | 65 if (m_value == it->first) 96 ASSERT(it->first); 97 m_value = it->first;
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | DequeTest.cpp | 176 OwnPtr<DestructCounter>& counter0 = deque.first(); 200 EXPECT_EQ(0, deque.first()->get()); 202 EXPECT_EQ(1, deque.first()->get()); 206 OwnPtr<DestructCounter> ownCounter1 = deque.first().release(); 283 EXPECT_EQ(2, dequeA.first().get()); 285 EXPECT_EQ(1, dequeB.first().get()); 293 EXPECT_EQ(1, dequeA.first().get()); 295 EXPECT_EQ(2, dequeB.first().get()); 301 EXPECT_EQ(2, dequeA.first().get()); 303 EXPECT_EQ(1, dequeB.first() [all...] |
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-set.h | 90 hb_codepoint_t first, 99 hb_codepoint_t first, 145 /* Pass -1 for first and last to get started. */ 148 hb_codepoint_t *first,
|
/external/chromium_org/third_party/sqlite/src/ext/fts1/ |
H A D | ft_hash.c | 50 pNew->first = 0; 66 elem = pH->first; 67 pH->first = 0; 214 else { pH->first = pNew; } 217 pNew->next = pH->first; 218 if( pH->first ){ pH->first->prev = pNew; } 220 pH->first = pNew; 243 for(elem=pH->first, pH->first [all...] |
H A D | fts1_hash.c | 57 pNew->first = 0; 73 elem = pH->first; 74 pH->first = 0; 172 else { pH->first = pNew; } 175 pNew->next = pH->first; 176 if( pH->first ){ pH->first->prev = pNew; } 178 pH->first = pNew; 201 for(elem=pH->first, pH->first [all...] |
/external/chromium_org/third_party/sqlite/src/ext/fts2/ |
H A D | fts2_hash.c | 64 pNew->first = 0; 78 elem = pH->first; 79 pH->first = 0; 177 else { pH->first = pNew; } 180 pNew->next = pH->first; 181 if( pH->first ){ pH->first->prev = pNew; } 183 pH->first = pNew; 206 for(elem=pH->first, pH->first [all...] |
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
H A D | fts3_hash.c | 64 pNew->first = 0; 78 elem = pH->first; 79 pH->first = 0; 177 else { pH->first = pNew; } 180 pNew->next = pH->first; 181 if( pH->first ){ pH->first->prev = pNew; } 183 pH->first = pNew; 208 for(elem=pH->first, pH->first [all...] |
/external/harfbuzz_ng/src/ |
H A D | hb-set.h | 90 hb_codepoint_t first, 99 hb_codepoint_t first, 145 /* Pass -1 for first and last to get started. */ 148 hb_codepoint_t *first,
|
/external/lldb/source/Target/ |
H A D | PathMappingList.cpp | 160 index, m_pairs[index].first.GetCString(), m_pairs[index].second.GetCString()); 166 m_pairs[pair_index].first.GetCString(), m_pairs[pair_index].second.GetCString()); 191 const size_t prefixLen = pos->first.GetLength(); 193 if (::strncmp (pos->first.GetCString(), path_cstr, prefixLen) == 0) 213 const size_t prefix_len = pos->first.GetLength(); 215 if (::strncmp (pos->first.GetCString(), path, prefix_len) == 0) 238 const size_t prefix_len = pos->first.GetLength(); 242 if (::strncmp (pos->first.GetCString(), orig_path, prefix_len) == 0) 299 if (pos->first == path) 314 if (pos->first [all...] |
/external/lldb/source/Utility/ |
H A D | SharingPtr.cpp | 101 if (ptr == NULL || pos->second.first == ptr) 104 printf ("\nsp(%p): %p\n", pos->first, pos->second.first);
|
/external/oprofile/libutil++/ |
H A D | sparse_array.h | 53 container[it->first] += it->second; 67 container[it->first] -= it->second; 82 return last->first + 1;
|