| /external/webkit/Source/WebCore/platform/ |
| ThreadTimers.cpp | 84 m_sharedTimer->setFireTime(m_timerHeap.first()->m_nextFireTime);
103 while (!m_timerHeap.isEmpty() && m_timerHeap.first()->m_nextFireTime <= fireTime) {
104 TimerBase* timer = m_timerHeap.first();
|
| /frameworks/base/core/java/android/util/ |
| TimingLogger.java | 137 final long first = mSplits.get(0); local
138 long now = first;
146 Log.d(mTag, mLabel + ": end, " + (now - first) + " ms");
|
| /development/tools/emulator/opengl/host/libs/Translator/EGL/ |
| EglGlobalInfo.cpp | 56 if((*it).second == dpy) return (*it).first;
70 if(static_cast<EGLDisplay>((*it).first) == dpy) {
71 delete (*it).first;
82 if((*it).second == dpy) return (*it).first;
90 return (it != m_displays.end() ? (*it).first : NULL);
|
| /external/astl/include/ |
| algorithm | 79 __copy_move(_InputIterator first, _InputIterator last, _OutputIterator res) {
80 for (; first != last; ++res, ++first) {
81 *res = *first;
93 __copy_move(_InputIterator first, _InputIterator last, _OutputIterator res) {
97 for (difference_type n = last - first; n > 0; --n) {
98 *res = *first;
99 ++first;
108 // copy elements in the range [first, last) into the range [result,
109 // result + (last - first)) starting from first and proceeding t
[all...] |
| /external/chromium/chrome/browser/history/ |
| top_sites_cache.cc | 63 return i == canonical_urls_.end() ? url : i->first.first->url;
77 if (IsKnownURL(i->first)) {
104 entry.first = &(top_sites_[destination]);
116 entry.first = &most_visited_url;
|
| /external/guava/src/com/google/common/collect/ |
| ObjectArrays.java | 62 * @param first the first array of elements to concatenate
67 public static <T> T[] concat(T[] first, T[] second, Class<T> type) {
68 T[] result = newArray(type, first.length + second.length);
69 Platform.unsafeArrayCopy(first, 0, result, 0, first.length);
70 Platform.unsafeArrayCopy(second, 0, result, first.length, second.length);
80 * {@code element} occupying the first position, and the
|
| Lists.java | 218 * Returns an unmodifiable list containing the specified first element and
229 * @param first the first element
233 public static <E> List<E> asList(@Nullable E first, E[] rest) {
234 return new OnePlusArrayList<E>(first, rest);
240 final E first; field in class:Lists.OnePlusArrayList
243 OnePlusArrayList(@Nullable E first, E[] rest) {
244 this.first = first;
253 return (index == 0) ? first : rest[index - 1]
283 final E first; field in class:Lists.TwoPlusArrayList
[all...] |
| /external/icu4c/common/unicode/ |
| normalizer2.h | 141 * Appends the normalized form of the second string to the first string
142 * (merging them at the boundary) and returns the first string.
143 * The result is normalized if the first string was normalized.
144 * The first and second strings must be different objects.
145 * @param first string, should be normalized
151 * @return first
155 normalizeSecondAndAppend(UnicodeString &first,
159 * Appends the second string to the first string
160 * (merging them at the boundary) and returns the first string.
162 * The first and second strings must be different objects
[all...] |
| /external/llvm/lib/Support/ |
| TargetRegistry.cpp | 99 return ((const pair_ty*)LHS)->first.compare(((const pair_ty*)RHS)->first);
109 Width = std::max(Width, Targets.back().first.size());
116 OS << " " << Targets[i].first;
117 OS.indent(Width - Targets[i].first.size()) << " - "
|
| /frameworks/base/core/tests/coretests/src/android/net/http/ |
| HttpResponseCacheTest.java | 53 HttpResponseCache first = HttpResponseCache.install(cacheDir, 10 * 1024 * 1024); local
55 assertSame(first, another);
59 HttpResponseCache first = HttpResponseCache.install(cacheDir, 10 * 1024 * 1024); local
61 assertNotSame(first, another);
63 first.flush();
|
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/asymmetric/ec/ |
| Signature.java | 290 byte[] first = makeUnsigned(r);
294 if (first.length > second.length)
296 res = new byte[first.length * 2];
303 System.arraycopy(first, 0, res, res.length / 2 - first.length, first.length);
332 byte[] first = new byte[encoding.length / 2];
335 System.arraycopy(encoding, 0, first, 0, first.length);
336 System.arraycopy(encoding, first.length, second, 0, second.length)
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveRangeCalc.cpp | 123 if (VNInfo *VNI = LiveOut[Pred].first) {
134 // First time we see Pred. Try to determine the live-out value, but set
204 if (IDomValue.first && !IDomValue.second)
206 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
211 if (!Value.first || Value.first == IDomValue.first)
217 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
253 } else if (IDomValue.first) {
255 I->Value = IDomValue.first;
[all...] |
| /external/zlib/contrib/blast/ |
| blast.c | 23 * 1.0 12 Feb 2003 - First version
51 int first; /* true to check distances (for first 4K) */ member in struct:state
116 * - The first code for the shortest length is all ones. Subsequent codes of
127 int first; /* first code of length len */ local
129 int index; /* index of first code of length len in symbol table */
136 code = first = index = 0;
144 if (code < first + count) { /* if length len, return symbol */
147 return h->symbol[index + (code - first)];
[all...] |
| /external/chromium/chrome/browser/ |
| browser_commands_unittest.cc | 31 // Navigate to the first tab using an accelerator.
39 // Navigate back to the first tab using the previous accelerators.
124 // The new tab should be like the first one but navigated back.
125 TabContents* first = browser()->GetTabContentsAt(1); local
127 EXPECT_FALSE(first->controller().CanGoBack());
128 EXPECT_TRUE(first->controller().CanGoForward());
136 CommitPendingLoad(&first->controller());
141 EXPECT_EQ(url1, first->GetURL());
142 EXPECT_FALSE(first->controller().CanGoBack());
143 EXPECT_TRUE(first->controller().CanGoForward())
[all...] |
| /external/chromium/chrome/browser/password_manager/ |
| password_form_data.cc | 75 const std::vector<PasswordForm*>& first,
77 if (first.size() != second.size())
79 SetOfForms expectations(first.begin(), first.end());
101 std::vector<webkit_glue::PasswordForm>& first,
104 for (unsigned int i = 0; i < first.size(); ++i) {
105 first_ptr.push_back(&first[i]);
|
| /external/chromium/chrome/browser/prefs/ |
| pref_value_map.cc | 114 const int diff = this_pref->first.compare(other_pref->first);
117 differing_keys->push_back(this_pref->first);
121 differing_keys->push_back(this_pref->first);
124 differing_keys->push_back(other_pref->first);
131 differing_keys->push_back(this_pref->first);
133 differing_keys->push_back(other_pref->first);
|
| /external/icu4c/i18n/ |
| bocsu.c | 148 u_writeIdenticalLevelRunTwoChars(UChar32 first, UChar32 second, uint8_t *p) {
150 if(first<0x4e00 || first>=0xa000) {
151 first=(first&~0x7f)-SLOPE_REACH_NEG_1;
157 first=0x9fff-SLOPE_REACH_POS_2;
160 p=u_writeDiff(second-first, p);
|
| /external/valgrind/unittest/ |
| old_test_suite.cc | 94 printf("*RESULT %s: time= %s ms\n", it->first.c_str(), join_str(it->second).c_str());
102 bool first = true; local
110 if (first) {
111 first = false;
140 tests_to_run.push_back(it->first);
146 tests_to_run.push_back(it->first);
189 tests_to_run.push_back(it->first);
|
| /external/tcpdump/ |
| print-bootp.c | 135 TCHECK2(bp->bp_sname[0], 1); /* check first char only */
145 TCHECK2(bp->bp_file[0], 1); /* check first char only */
178 * The first character specifies the format to print:
369 int first, idx; local
447 first = 1;
453 if (!first)
456 first = 0;
471 first = 1;
491 if (!first)
503 first = 0
[all...] |
| /external/kernel-headers/original/linux/ |
| list.h | 309 struct list_head *first = list->next; local
313 first->prev = head;
314 head->next = first;
323 * @head: the place to add it in the first list.
334 * @head: the place to add it in the first list.
593 struct hlist_node *first; member in struct:hlist_head
600 #define HLIST_HEAD_INIT { .first = NULL }
601 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
602 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
616 return !h->first;
691 struct hlist_node *first = h->first; local
722 struct hlist_node *first = h->first; local
[all...] |
| /external/freetype/src/base/ |
| ftoutln.c | 68 FT_UInt first; /* index of first point in contour */ local
80 first = 0;
94 v_start = outline->points[first];
104 point = outline->points + first;
105 tags = outline->tags + first;
112 /* check first point to determine origin */
115 /* first point is conic control. Yes, this happens. */
124 /* if both first and last points are conic, */
278 first = last + 1
538 FT_Int first, last; local
888 FT_Int c, n, first; local
986 FT_Vector* first; local
[all...] |
| /external/stlport/test/unit/ |
| map_test.cpp | 1 //Has to be first for StackAllocator swap overload to be taken
66 CPPUNIT_ASSERT( p.first != m.end() );
67 CPPUNIT_ASSERT( (*p.first).first == 'c' );
68 CPPUNIT_ASSERT( (*p.first).second == 100 );
72 CPPUNIT_ASSERT( p.first != m.end() );
73 CPPUNIT_ASSERT( (*p.first).first == 'c' );
74 CPPUNIT_ASSERT( (*p.first).second == 100 );
90 mmap::iterator i = m.find('X'); // Find first match
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-969.js | 40 function first(x, y) { return x; } function
48 function test0() { return first((y = 1, typeof x0), 2); }
57 function test1() { return first((y += 1, typeof x1), 2); }
64 function test2() { return first((++y, typeof x2), 2); }
70 function test3() { return first((y++, typeof x3), 2); }
79 function test4() { return first((o.x = 1, typeof x4), 2); }
85 function test5() { return first((o.x += 1, typeof x5), 2); }
91 function test6() { return first((++o.x, typeof x6), 2); }
97 function test7() { return first((o.x++, typeof x7), 2); }
106 function test8(index) { return first((o[index] = 1, typeof x8), 2);
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| map_test.cpp | 1 //Has to be first for StackAllocator swap overload to be taken
66 CPPUNIT_ASSERT( p.first != m.end() );
67 CPPUNIT_ASSERT( (*p.first).first == 'c' );
68 CPPUNIT_ASSERT( (*p.first).second == 100 );
72 CPPUNIT_ASSERT( p.first != m.end() );
73 CPPUNIT_ASSERT( (*p.first).first == 'c' );
74 CPPUNIT_ASSERT( (*p.first).second == 100 );
90 mmap::iterator i = m.find('X'); // Find first match
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| map_test.cpp | 1 //Has to be first for StackAllocator swap overload to be taken
66 CPPUNIT_ASSERT( p.first != m.end() );
67 CPPUNIT_ASSERT( (*p.first).first == 'c' );
68 CPPUNIT_ASSERT( (*p.first).second == 100 );
72 CPPUNIT_ASSERT( p.first != m.end() );
73 CPPUNIT_ASSERT( (*p.first).first == 'c' );
74 CPPUNIT_ASSERT( (*p.first).second == 100 );
90 mmap::iterator i = m.find('X'); // Find first match
[all...] |
