| /external/skia/src/pdf/ |
| SkTSet.h | 124 int pos = 0; local
125 int i = find(elem, &pos);
129 *fSetArray->insert(pos) = elem;
|
| /external/sonivox/arm-wt-22k/lib_src/ |
| jet.c | 257 static EAS_RESULT JetParseInfoChunk (EAS_DATA_HANDLE easHandle, EAS_I32 pos, EAS_I32 chunkSize)
264 result = EAS_HWFileSeek(easHandle->hwInstData, easHandle->jetHandle->jetFileHandle, pos);
321 EAS_I32 pos; local
352 pos = chunkSize = 8;
353 while ((result == EAS_SUCCESS) && (pos < dataSize))
357 result = EAS_HWFileSeek(easHandle->hwInstData, easHandle->jetHandle->jetFileHandle, pos);
369 pos += 8;
374 result = JetParseInfoChunk(easHandle, pos, chunkSize);
379 easHandle->jetHandle->segmentOffsets[smfChunkNum++] = pos;
386 result = DLSParser(easHandle->hwInstData, easHandle->jetHandle->jetFileHandle, pos, &easHandle->jetHandle->libHandles[dlsChunkNum++])
[all...] |
| /external/stressapptest/src/ |
| disk_blocks.cc | 73 sd->pos = nelems_;
94 int curr_pos = it->second->pos;
103 last_it->second->pos = curr_pos;
|
| /external/v8/src/ |
| splay-tree-inl.h | 298 int pos = 0; local
299 while (pos < nodes_to_visit.length()) {
300 Node* node = nodes_to_visit[pos++];
|
| /external/webp/src/utils/ |
| bit_reader.h | 228 const int pos = br->bits_; local
229 const range_t value = (range_t)(br->value_ >> pos);
232 br->value_ -= (bit_t)(split + 1) << pos;
|
| /frameworks/av/media/libstagefright/mpeg2ts/ |
| ESQueue.cpp | 585 const NALPosition &pos = nals.itemAt(i); local
587 unsigned nalType = mBuffer->data()[pos.nalOffset] & 0x1f;
601 mBuffer->data() + pos.nalOffset,
602 pos.nalSize);
604 dstOffset += pos.nalSize + 4;
609 const NALPosition &pos = nals.itemAt(nals.size() - 1); local
610 size_t nextScan = pos.nalOffset + pos.nalSize;
630 NALPosition pos; local
631 pos.nalOffset = nalStart - mBuffer->data()
[all...] |
| /frameworks/base/graphics/java/android/graphics/drawable/ |
| StateListDrawable.java | 291 final int pos = addChild(drawable); local
292 mStateSets[pos] = stateSet;
293 return pos;
|
| /frameworks/base/libs/androidfw/ |
| BackupData.cpp | 326 int pos = lseek(m_fd, m_dataEndPos, SEEK_SET); local
327 if (pos == -1) {
330 m_pos = pos;
|
| /libcore/xml/src/main/java/org/kxml2/io/ |
| KXmlParser.java | 528 int pos = 1; local
530 if (pos < attributeCount && "encoding".equals(attributes[2 + 4])) {
532 pos++;
535 if (pos < attributeCount && "standalone".equals(attributes[4 * pos + 2])) {
536 String st = attributes[3 + 4 * pos];
544 pos++;
547 if (pos != attributeCount) {
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_insert/ |
| iter_iter_iter.pass.cpp | 23 test(S s, typename S::difference_type pos, It first, It last, S expected)
25 typename S::const_iterator p = s.cbegin() + pos;
28 assert(i - s.begin() == pos);
|
| iter_size_char.pass.cpp | 21 test(S s, typename S::difference_type pos, typename S::size_type n,
24 typename S::const_iterator p = s.cbegin() + pos;
27 assert(i - s.begin() == pos);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_find/ |
| pointer_size.pass.cpp | 12 // size_type find(const charT* s, size_type pos = 0) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.find(str, pos) == x);
28 assert(pos <= x && x + n <= s.size());
|
| string_size.pass.cpp | 12 // size_type find(const basic_string& str, size_type pos = 0) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.find(str, pos) == x);
25 assert(pos <= x && x + str.size() <= s.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_find.first.not.of/ |
| pointer_size.pass.cpp | 12 // size_type find_first_not_of(const charT* s, size_type pos = 0) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.find_first_not_of(str, pos) == x);
26 assert(pos <= x && x < s.size());
|
| string_size.pass.cpp | 12 // size_type find_first_not_of(const basic_string& str, size_type pos = 0) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.find_first_not_of(str, pos) == x);
25 assert(pos <= x && x < s.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_find.first.of/ |
| pointer_size.pass.cpp | 12 // size_type find_first_of(const charT* s, size_type pos = 0) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.find_first_of(str, pos) == x);
26 assert(pos <= x && x < s.size());
|
| string_size.pass.cpp | 12 // size_type find_first_of(const basic_string& str, size_type pos = 0) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.find_first_of(str, pos) == x);
25 assert(pos <= x && x < s.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_find.last.not.of/ |
| pointer_size.pass.cpp | 12 // size_type find_last_not_of(const charT* s, size_type pos = npos) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.find_last_not_of(str, pos) == x);
26 assert(x <= pos && x < s.size());
|
| string_size.pass.cpp | 12 // size_type find_last_not_of(const basic_string& str, size_type pos = npos) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.find_last_not_of(str, pos) == x);
25 assert(x <= pos && x < s.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_find.last.of/ |
| pointer_size.pass.cpp | 12 // size_type find_last_of(const charT* s, size_type pos = npos) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.find_last_of(str, pos) == x);
26 assert(x <= pos && x < s.size());
|
| string_size.pass.cpp | 12 // size_type find_last_of(const basic_string& str, size_type pos = npos) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.find_last_of(str, pos) == x);
25 assert(x <= pos && x < s.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_rfind/ |
| string_size.pass.cpp | 12 // size_type rfind(const basic_string& str, size_type pos = npos) const;
21 test(const S& s, const S& str, typename S::size_type pos, typename S::size_type x)
23 assert(s.rfind(str, pos) == x);
25 assert(x <= pos && x + str.size() <= s.size());
|
| /packages/apps/Calculator/src/com/android/calculator2/ |
| CalculatorEditText.java | 114 int pos = 0; local
116 builder.put(key, descs[pos]);
117 pos++;
|
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlTreeBuilder.java | 99 int pos = findStartTag(element); local
100 if (pos >= 0) {
103 while (pos < stack.size() - 1) {
|
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTreeBuilder.java | 99 int pos = findStartTag(element); local
100 if (pos >= 0) {
103 while (pos < stack.size() - 1) {
|
