/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
iter_iter_size_char.pass.cpp | 30 typename S::const_iterator last = s.begin() + pos1 + n1; local 31 typename S::size_type xlen = last - first; 32 s.replace(first, last, n2, c);
|
iter_iter_string.pass.cpp | 29 typename S::const_iterator last = s.begin() + pos1 + n1; local 30 typename S::size_type xlen = last - first; 31 s.replace(first, last, str);
|
/ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/ |
test_fallback_malloc.cpp | 44 const size_t *last = first + len; local 47 for ( const size_t *iter = first; iter != last; ++iter ) {
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
for_each.hpp | 98 typedef typename end<Sequence>::type last; typedef 100 aux::for_each_impl< boost::is_same<first,last>::value > 101 ::execute(static_cast<first*>(0), static_cast<last*>(0), static_cast<TransformOp*>(0), f);
|
/packages/apps/OMA-DM/engine/dmlib/dmengine/dm_ssession/src/ |
SYNCML_DM_MultipleChoiceAlert.cc | 73 int last = atoi(pdSegment); local 82 if((first >=0) && (last >= 0)) 84 for ( first; first <= last; first++ ) {
|
/system/extras/ext4_utils/ |
allocate.h | 28 struct region *last; member in struct:region_list
|
/external/chromium_org/v8/test/mjsunit/ |
cyrillic.js | 35 LAST: "\u042f", // YA 36 last: "\u044f", // ya 50 LAST: "\u03a9", // OMEGA 51 last: "\u03c9", // omega 71 var last = lc ? chars.last : chars.LAST; 74 var last_other_case = lc ? chars.LAST : chars.last; 76 assertTrue(Range(first, last).test(first), 1) [all...] |
string-slices.js | 126 var last = x; variable 129 var z = last.substring(i); 130 last = z;
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
GroupedLinkedMap.java | 50 LinkedEntry<K, V> last = head.prev; local 52 while (last != head) { 53 V removed = last.removeLast(); 61 removeEntry(last); 62 keyToEntry.remove(last.key); 63 last.key.offer(); 66 last = last.prev;
|
/bionic/libc/upstream-netbsd/lib/libc/gen/ |
popen.c | 193 struct pid *cur, *last; local 202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) 213 if (last == NULL) 216 last->next = cur->next;
|
/development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
GLFace.java | 51 int last = mVertexList.size() - 1; local 52 if (last < 2) { 55 GLVertex vertex = mVertexList.get(last); 61 mVertexList.remove(last + 1); 62 vertex = mVertexList.get(last); 77 int last = mVertexList.size() - 1; local 80 GLVertex vn = mVertexList.get(last); 83 for (int i = 1; i < last; i++) {
|
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
InsertionPoint.h | 66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.last().get(); } function in class:WebCore::InsertionPoint
|
/external/chromium_org/third_party/WebKit/Source/core/events/ |
EventPath.h | 58 const NodeEventContext& last() const { return m_nodeEventContexts[size() - 1]; } function in class:WebCore::EventPath
|
/external/chromium_org/third_party/freetype/src/cache/ |
ftcmru.c | 37 FTC_MruNode last = first->prev; local 59 last->next = node; 61 node->prev = last; 83 FTC_MruNode prev, next, last; local 108 last = first->prev; 110 last->next = node; 114 node->prev = last;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
u_linkage.c | 121 int last = -1; local 130 last = i; 133 if(last < efficient_slots) 138 else if((last - first) < efficient_slots)
|
/external/chromium_org/third_party/re2/util/ |
stringpiece.cc | 22 // Test last byte in case strings share large common prefix 65 const char* last = ptr_ + min(ulen - s.length_, pos) + s.length_; local 66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); 67 return result != last ? result - ptr_ : npos;
|
/external/e2fsprogs/lib/ext2fs/ |
kernel-list.h | 92 struct list_head *last = list->prev; local 98 last->next = at; 99 at->prev = last;
|
/external/freetype/src/cache/ |
ftcmru.c | 37 FTC_MruNode last = first->prev; local 59 last->next = node; 61 node->prev = last; 83 FTC_MruNode prev, next, last; local 108 last = first->prev; 110 last->next = node; 114 node->prev = last;
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
iter_iter_iter_iter.pass.cpp | 28 typename S::const_iterator last = s.begin() + pos1 + n1; local 29 typename S::size_type xlen = last - first; 30 s.replace(first, last, f, l); [all...] |
iter_iter_pointer_size.pass.cpp | 30 typename S::const_iterator last = s.begin() + pos1 + n1; local 31 typename S::size_type xlen = last - first; 32 s.replace(first, last, str, n2); [all...] |
/external/libedit/src/ |
hist.h | 50 Char *last; /* The last character */ member in struct:el_history_t
|
/external/mesa3d/src/gallium/auxiliary/util/ |
u_linkage.c | 121 int last = -1; local 130 last = i; 133 if(last < efficient_slots) 138 else if((last - first) < efficient_slots)
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
TwoSecondIntersectionFinder.java | 74 long last = samples + 1; local 78 fragments[i] = last ; 80 last = fragments[i];
|
/external/owasp/sanitizer/src/main/org/owasp/html/ |
ElementPolicy.java | 70 ElementPolicy last = null; field in class:ElementPolicy.Util.PolicyJoiner 81 } else if (p != last) { 82 last = p;
|
/external/regex-re2/util/ |
stringpiece.cc | 22 // Test last byte in case strings share large common prefix 65 const char* last = ptr_ + min(ulen - s.length_, pos) + s.length_; local 66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); 67 return result != last ? result - ptr_ : npos;
|