Searched refs:last (Results 276 - 300 of 1636) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/cc/trees/
H A Dlayer_sorter.h82 void Sort(LayerImplList::iterator first, LayerImplList::iterator last);
106 LayerImplList::iterator last);
/external/chromium_org/chrome/browser/download/
H A Ddownload_query.h123 // Filters DownloadItem*s from |iter| to |last| into |results|, sorts
126 void Search(InputIterator iter, const InputIterator last, argument
129 for (; iter != last; ++iter) {
/external/chromium_org/chrome/browser/resources/media/
H A Dwebrtc_logs.css41 #log-list > div:not(:last-child) {
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DShapeOps.cpp30 Angle* last = angles.end() - 1; local
31 nextStart = last->start();
32 nextEnd = last->end();
38 return last->segment();
196 Span* last = current->markAndChaseDoneBinary(index, endIndex); local
197 if (last && !last->fLoop) {
198 *chaseArray.append() = last;
H A DCubicParameterizationCode.cpp214 char last = backSkipSpace(str, endCoeff); local
215 if (last == '2' || last == '3') {
216 last = str[endCoeff - 3]; // skip ^2
218 if (last == 'x' || last == 'y') {
/external/freetype/src/base/
H A Dftbbox.c39 FT_Vector last; member in struct:TBBox_Rec_
53 /* in `user->last'; no further computations are necessary since we */
69 user->last = *to;
162 BBox_Conic_Check( user->last.x,
169 BBox_Conic_Check( user->last.y,
175 user->last = *to;
367 BBox_Cubic_Check( user->last.x,
376 BBox_Cubic_Check( user->last.y,
383 user->last = *to;
/external/libcxxabi/test/
H A Dtest_exception_storage.cpp47 void print_sizes ( size_t *first, size_t *last ) {
49 for ( size_t *iter = first; iter != last; ++iter )
/external/skia/experimental/Intersection/
H A DShapeOps.cpp30 Angle* last = angles.end() - 1; local
31 nextStart = last->start();
32 nextEnd = last->end();
38 return last->segment();
196 Span* last = current->markAndChaseDoneBinary(index, endIndex); local
197 if (last && !last->fLoop) {
198 *chaseArray.append() = last;
H A DCubicParameterizationCode.cpp214 char last = backSkipSpace(str, endCoeff); local
215 if (last == '2' || last == '3') {
216 last = str[endCoeff - 3]; // skip ^2
218 if (last == 'x' || last == 'y') {
/external/stlport/test/eh/
H A Dtest_construct.h92 const typename T::value_type* last )
93 : fItems( first ), fEnd( last ) {
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Daes-gcm.c124 /* Add zero padded last block */
125 size_t last = x + xlen - xpos; local
126 os_memcpy(tmp, xpos, last);
127 os_memset(tmp + last, 0, sizeof(tmp) - last);
145 size_t i, n, last; local
165 last = x + xlen - xpos;
166 if (last) {
169 for (i = 0; i < last; i++)
/external/wpa_supplicant_8/src/crypto/
H A Daes-gcm.c124 /* Add zero padded last block */
125 size_t last = x + xlen - xpos; local
126 os_memcpy(tmp, xpos, last);
127 os_memset(tmp + last, 0, sizeof(tmp) - last);
145 size_t i, n, last; local
165 last = x + xlen - xpos;
166 if (last) {
169 for (i = 0; i < last; i++)
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Daes-gcm.c124 /* Add zero padded last block */
125 size_t last = x + xlen - xpos; local
126 os_memcpy(tmp, xpos, last);
127 os_memset(tmp + last, 0, sizeof(tmp) - last);
145 size_t i, n, last; local
165 last = x + xlen - xpos;
166 if (last) {
169 for (i = 0; i < last; i++)
/external/chromium_org/cc/base/
H A Dscoped_ptr_vector.h99 void erase(iterator first, iterator last) {
100 DCHECK(first <= last);
101 for (iterator it = first; it != last; ++it) {
107 data_.erase(first, last);
144 typename std::vector<T*>::iterator last = end();
145 return static_cast<iterator>(std::partition(first, last, predicate));
/external/chromium_org/components/domain_reliability/
H A Dscheduler.cc162 base::DictionaryValue* last = new base::DictionaryValue(); local
163 last->SetInteger("start_time", (now - last_upload_start_time_).InSeconds());
164 last->SetInteger("end_time", (now - last_upload_end_time_).InSeconds());
165 last->SetInteger("collector_index",
167 last->SetBoolean("success", last_upload_success_);
168 data->Set("last_upload", last);
/external/chromium_org/net/base/
H A Dlinked_hash_map.h57 // Returns an iterator beyond the last element.
65 // Returns an iterator to the last (insertion-ordered) element. Like a map,
139 // Erases values between first and last, not including last.
140 void erase(iterator first, iterator last) { argument
141 while (first != last && first != end()) {
206 typename ListType::iterator last = list_.end(); local
207 --last;
209 CHECK(map_.insert(std::make_pair(pair.first, last)).second)
212 return std::make_pair(last, tru
[all...]
/external/chromium_org/third_party/skia/experimental/AndroidPathRenderer/
H A DAndroidPathRenderer.cpp122 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
125 lastNormal.set(current->position[1] - last->position[1],
126 last->position[0] - current->position[0]);
146 last = current;
213 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
216 lastNormal.set(current->position[1] - last->position[1],
217 last->position[0] - current->position[0]);
241 last = current;
290 const Vertex* last = &(vertices[0]); local
293 lastNormal.set(current->position[1] - last
448 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsCubicToQuadsTest.cpp63 int last = quads.count() - 1; local
64 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
65 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {
86 int last = quads.count() - 1; local
87 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
88 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {
/external/chromium_org/third_party/zlib/
H A Dinffast.c73 unsigned char FAR *last; /* while in < last, enough input available */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
/external/chromium_org/v8/src/
H A Dsafepoint-table.cc73 int last = entry_size_ - 1; local
74 for (int i = first; i < last; i++) PrintBits(os, bits[i], kBitsPerByte);
75 int last_bits = code_->stack_slots() - ((last - first) * kBitsPerByte);
76 PrintBits(os, bits[last], last_bits);
123 return Safepoint(indexes_.last(), registers_.last());
/external/guava/guava-tests/test/com/google/common/hash/
H A DHashingTest.java52 int last = 0;
55 if (b != last) {
57 last = b;
75 int last = 0;
78 if (chosen != last) {
80 last = chosen;
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dfx_zlib_inffast.c73 z_const unsigned char FAR *last; /* have enough input while in < last */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
/external/qemu/distrib/zlib-1.2.8/
H A Dinffast.c73 z_const unsigned char FAR *last; /* have enough input while in < last */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
/external/skia/experimental/AndroidPathRenderer/
H A DAndroidPathRenderer.cpp122 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
125 lastNormal.set(current->position[1] - last->position[1],
126 last->position[0] - current->position[0]);
146 last = current;
213 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
216 lastNormal.set(current->position[1] - last->position[1],
217 last->position[0] - current->position[0]);
241 last = current;
290 const Vertex* last = &(vertices[0]); local
293 lastNormal.set(current->position[1] - last
448 const Vertex* last = &(perimeter[perimeter.count() - 1]); local
[all...]
/external/skia/tests/
H A DPathOpsCubicToQuadsTest.cpp63 int last = quads.count() - 1; local
64 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
65 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {
86 int last = quads.count() - 1; local
87 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
88 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {

Completed in 938 milliseconds

<<11121314151617181920>>