Searched refs:first (Results 276 - 300 of 2550) sorted by relevance

<<11121314151617181920>>

/external/libcxx/test/std/containers/unord/unord.multimap/
H A Dlocal_iterators.pass.cpp55 assert(i->first == 1);
58 assert(i->first == 1);
65 assert(i->first == 2);
68 assert(i->first == 2);
75 assert(i->first == 3);
82 assert(i->first == 4);
119 assert(i->first == 1);
122 assert(i->first == 1);
129 assert(i->first == 2);
132 assert(i->first
[all...]
/external/mesa3d/src/gallium/state_trackers/clover/core/
H A Dqueue.cpp51 auto first = queued_events.begin(); local
57 std::for_each(first, last, [&](event_ptr &ev) { ev->fence(fence); });
59 queued_events.erase(first, last);
/external/protobuf/src/google/protobuf/compiler/cpp/
H A Dcpp_generator.cc85 if (options[i].first == "dllexport_decl") {
87 } else if (options[i].first == "safe_boundary_check") {
90 *error = "Unknown generator option: " + options[i].first;
/external/skia/src/svg/parser/
H A DSkSVGElements.cpp18 SkString* first = (SkString*) ((char*) this + sizeof(SkSVGElement)); local
19 first += attrIndex;
20 first->set(attrValue, attrLength);
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/
H A DAnnotationFormatter.java46 boolean first = true;
48 if (!first) {
51 first = false;
/external/icu/icu4c/source/common/
H A Dnormalizer2.cpp75 normalizeSecondAndAppend(UnicodeString &first, argument
79 if(&first!=&second) {
80 first.append(second);
85 return first;
88 append(UnicodeString &first, argument
92 if(&first!=&second) {
93 first.append(second);
98 return first;
313 UChar *first, int32_t firstLength, int32_t firstCapacity,
321 (first
312 normalizeSecondAndAppend(const UNormalizer2 *norm2, UChar *first, int32_t firstLength, int32_t firstCapacity, const UChar *second, int32_t secondLength, UBool doNormalize, UErrorCode *pErrorCode) argument
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_linkage.c120 int first = -1; local
128 if(first < 0)
129 first = i;
138 else if((last - first) < efficient_slots)
141 layout[i - first] = i;
/external/protobuf/src/google/protobuf/compiler/java/
H A Djava_generator.cc76 if (options[i].first == "output_list_file") {
78 } else if (options[i].first == "immutable") {
80 } else if (options[i].first == "mutable") {
82 } else if (options[i].first == "shared") {
85 *error = "Unknown generator option: " + options[i].first;
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/Format/
H A DPackedSwitchMethodItem.java53 boolean first = true;
58 if (first) {
60 first = false;
69 if (first) {
71 first = false;
/external/guava/guava/src/com/google/common/collect/
H A DRegularContiguousSet.java71 return contains(target) ? (int) domain.distance(first(), (C) target) : -1;
75 return new AbstractSequentialIterator<C>(first()) {
88 final C first = first();
92 return equalsOrThrow(previous, first) ? null : domain.previous(previous);
105 @Override public C first() { method in class:RegularContiguousSet
114 long distance = domain.distance(first(), last());
143 C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
166 return this.first()
[all...]
/external/marisa-trie/lib/marisa/
H A Dtail.cc157 pairs[i].first = RString(keys[i]);
173 while ((match < cur.first.length()) && (match < last->first.length()) &&
174 last->first[match] == cur.first[match]) {
177 if ((match == cur.first.length()) && (last->first.length() != 0)) {
179 + (last->first.length() - match));
182 for (std::size_t j = 1; j <= cur.first.length(); ++j) {
183 buf.push_back(cur.first[cu
[all...]
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dtail.cc157 pairs[i].first = RString(keys[i]);
173 while ((match < cur.first.length()) && (match < last->first.length()) &&
174 last->first[match] == cur.first[match]) {
177 if ((match == cur.first.length()) && (last->first.length() != 0)) {
179 + (last->first.length() - match));
182 for (std::size_t j = 1; j <= cur.first.length(); ++j) {
183 buf.push_back(cur.first[cu
[all...]
/external/zlib/src/contrib/blast/
H A Dblast.c53 int first; /* true to check distances (for first 4K) */ member in struct:state
118 * - The first code for the shortest length is all ones. Subsequent codes of
129 int first; /* first code of length len */ local
131 int index; /* index of first code of length len in symbol table */
138 code = first = index = 0;
146 if (code < first + count) { /* if length len, return symbol */
149 return h->symbol[index + (code - first)];
152 first
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DRegularContiguousSet.java68 return new AbstractSequentialIterator<C>(first()) {
86 @Override public C first() { method in class:RegularContiguousSet
95 long distance = domain.distance(first(), last());
124 C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
147 return this.first().equals(that.first())
/external/llvm/tools/llvm-mc/
H A DDisassembler.cpp39 ArrayRef<uint8_t> Data(Bytes.first.data(), Bytes.first.size());
45 for (Index = 0; Index < Bytes.first.size(); Index += Size) {
120 ByteArray.first.clear();
125 ByteArray.first.push_back(ByteVal);
174 ByteArray.first.clear();
200 if (!ByteArray.first.empty())
/external/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h75 if (I != Seqs.end() && isSuffix(Seq, I->first))
81 if (I != Seqs.begin() && isSuffix((--I)->first, Seq))
100 Entries += I->first.size() + 1;
108 assert(I != Seqs.end() && isSuffix(Seq, I->first) &&
109 "get() called with sequence that wasn't added first");
110 return I->second + (I->first.size() - Seq.size());
122 for (typename SeqT::const_iterator SI = I->first.begin(),
123 SE = I->first.end(); SI != SE; ++SI) {
/external/eigen/Eigen/src/Core/arch/SSE/
H A DPacketMath.h254 // so we could also enable it for MSVC08 but first we have to make this later does not generate crap when doing so...
620 static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) argument
623 first = _mm_castsi128_ps(_mm_alignr_epi8(_mm_castps_si128(second), _mm_castps_si128(first), Offset*4));
630 static EIGEN_STRONG_INLINE void run(Packet4i& first, const Packet4i& second) argument
633 first = _mm_alignr_epi8(second,first, Offset*4);
640 static EIGEN_STRONG_INLINE void run(Packet2d& first, const Packet2d& second) argument
643 first = _mm_castsi128_pd(_mm_alignr_epi8(_mm_castpd_si128(second), _mm_castpd_si128(first),
651 run(Packet4f& first, const Packet4f& second) argument
674 run(Packet4i& first, const Packet4i& second) argument
697 run(Packet2d& first, const Packet2d& second) argument
[all...]
/external/tcpdump/
H A Dprint-bootp.c135 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:
373 int first, idx; local
451 first = 1;
457 if (!first)
460 first = 0;
475 first = 1;
495 if (!first)
507 first
[all...]
/external/linux-tools-perf/src/include/linux/
H A Dlist.h216 struct list_head *first; local
219 first = head->next;
220 list_move_tail(first, head);
277 struct list_head *first = list->next; local
280 first->prev = prev;
281 prev->next = first;
290 * @head: the place to add it in the first list.
302 * @head: the place to add it in the first list.
314 * @head: the place to add it in the first list.
330 * @head: the place to add it in the first lis
612 struct hlist_node *first = h->first; local
[all...]
/external/llvm/lib/LTO/
H A DLTOModule.cpp290 NameAndAttributes &info = IterBool.first->second;
291 info.name = IterBool.first->first().data();
301 auto Iter = _defines.insert(className).first;
304 info.name = Iter->first().data();
329 NameAndAttributes &info = IterBool.first->second;
330 info.name = IterBool.first->first().data();
348 NameAndAttributes &info = IterBool.first->second;
349 info.name = IterBool.first
[all...]
/external/pdfium/core/src/fxge/agg/agg23/
H A Dfx_agg_rasterizer_scanline_aa.cpp169 int delta, p, first, dx; local
181 first = poly_base_size;
186 first = 0;
196 m_cur_cell.add_cover(delta, (fx1 + first) * delta);
223 m_cur_cell.add_cover(delta, (fx2 + poly_base_size - first) * delta);
241 int p, rem, mod, lift, delta, first, incr; local
251 first = poly_base_size;
253 first = 0;
257 delta = first - fy1;
261 delta = first
[all...]
/external/bison/build-aux/
H A Dylwrap120 first=yes
157 # parser itself (the first file) should always be updated,
161 if test $first = no; then
186 if test $first = no; then
196 # A missing file is only an error for the first file. This
200 if test $first = yes; then
206 first=no
/external/guava/guava/src/com/google/common/base/
H A DConverter.java293 final Converter<A, B> first; field in class:Converter.ConverterComposition
296 ConverterComposition(Converter<A, B> first, Converter<B, C> second) { argument
297 this.first = first;
321 return second.correctedDoForward(first.correctedDoForward(a));
327 return first.correctedDoBackward(second.correctedDoBackward(c));
334 return this.first.equals(that.first)
342 return 31 * first.hashCode() + second.hashCode();
347 return first
[all...]
/external/harfbuzz_ng/test/api/
H A Dtest-set.c164 hb_codepoint_t next, first, last; local
191 first = last = HB_SET_VALUE_INVALID;
192 g_assert (hb_set_next_range (s, &first, &last));
193 g_assert_cmpint (first, ==, 6);
195 g_assert (hb_set_next_range (s, &first, &last));
196 g_assert_cmpint (first, ==, 10);
198 g_assert (hb_set_next_range (s, &first, &last));
199 g_assert_cmpint (first, ==, 20005);
201 g_assert (!hb_set_next_range (s, &first, &last));
202 g_assert_cmpint (first,
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DPluralRanges.java91 StandardPluralCategories first = null;
97 if (first == null) {
98 first = item;
101 if (first != item) {
105 return first;
115 StandardPluralCategories first = null;
121 if (first == null) {
122 first = item;
125 if (first != item) {
133 return first;
[all...]

Completed in 3623 milliseconds

<<11121314151617181920>>