/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
H A D | unumeric.h | 16 /// Returns the sum of all elements in [first, last) added to \p init. 20 inline T accumulate (InputIterator first, InputIterator last, T init) argument 22 while (first < last) 27 /// Returns the sum of all elements in [first, last) via \p op, added to \p init. 31 inline T accumulate (InputIterator first, InputIterator last, T init, BinaryFunction binary_op) argument 33 while (first < last) 38 /// Assigns range [value, value + (last - first)) to [first, last) 42 inline void iota (ForwardIterator first, ForwardIterator last, T value) argument 44 while (first < last) 77 partial_sum(InputIterator first, InputIterator last, OutputIterator result) argument 90 partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation sumOp) argument 103 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result) argument 116 adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation differenceOp) argument [all...] |
H A D | cmemlink.h | 63 inline void link (const void* first, const void* last) { link (first, distance (first, last)); } argument
|
H A D | memlink.h | 68 inline void link (const void* first, const void* last) { link (first, distance (first, last)); } argument 69 inline void link (void* first, void* last) { link (first, distance (first, last)); } argument
|
H A D | ualgobase.h | 49 /// Copy copies elements from the range [first, last) to the range 50 /// [result, result + (last - first)). That is, it performs the assignments 52 /// for every integer n from 0 to last - first, copy performs the assignment 58 inline OutputIterator copy (InputIterator first, InputIterator last, OutputIterator result) argument 60 for (; first != last; ++result, ++first) 81 /// \brief Copy copies elements from the range (last, first] to result. 83 /// Copies elements starting at last, decrementing both last and result. 86 inline OutputIterator copy_backward (InputIterator first, InputIterator last, OutputIterator result) argument 88 while (first != last) 100 for_each(InputIterator first, InputIterator last, UnaryFunction f) argument 113 fill(ForwardIterator first, ForwardIterator last, const T& value) argument 141 copy_backward_fast(const void* first, const void* last, void* result) argument 180 copy_backward(const uint8_t* first, const uint8_t* last, uint8_t* result) argument [all...] |
H A D | uheap.h | 30 bool is_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 33 for (; ++iChild < last; ++first) 34 if (comp (*first, *iChild) || (++iChild < last && comp (*first, *iChild))) 39 /// \brief make_heap turns the range [first, last) into a heap 40 /// At completion, is_heap (first, last, comp) is true. 46 void make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 50 uoff_t iChild, iHole = 0, iEnd (distance (first, last)); 63 /// \brief Inserts the *--last into the preceeding range assumed to be a heap. 67 void push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 69 if (last < 88 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 100 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument [all...] |
H A D | ulist.h | 49 void splice (iterator ip, list<T>& l, iterator first = NULL, iterator last = NULL); 61 /// Moves the range [first, last) from \p l to this list at \p ip. 63 void list<T>::splice (iterator ip, list<T>& l, iterator first, iterator last) argument 67 if (!last) 68 last = l.end(); 69 insert (ip, first, last); 70 l.erase (first, last);
|
H A D | umemory.h | 78 inline void construct (ForwardIterator first, ForwardIterator last) argument 82 while (first < last) { 107 /// Calls the destructor on elements in range [first, last) without calling delete. 111 inline void destroy (ForwardIterator first, ForwardIterator last) throw() argument 115 for (; first < last; ++ first) 143 /// Copies [first, last) into result by calling copy constructors in result. 147 ForwardIterator uninitialized_copy (InputIterator first, InputIterator last, ForwardIterator result) argument 149 while (first < last) { 171 /// Calls construct on all elements in [first, last) with value \p v. 175 void uninitialized_fill (ForwardIterator first, ForwardIterator last, cons argument [all...] |
H A D | ualgobase.cpp | 152 void copy_backward_fast (const void* first, const void* last, void* result) argument 156 size_t nBytes (distance (first, last)); 158 size_t nHeadBytes = uintptr_t(last) % 4; 159 last = advance (last, -1); 161 movsb (last, nHeadBytes, result); 165 last = advance (last, -3); 167 movsd (last, nMiddleBlocks, result); 170 movsb (last, nByte 235 rotate_fast(void* first, void* middle, void* last) argument [all...] |
H A D | umap.h | 61 inline const_iterator find_data (const_data_ref v, const_iterator first = NULL, const_iterator last = NULL) const; 62 inline iterator find_data (const_data_ref v, iterator first = NULL, iterator last = NULL); 77 const_iterator first (begin()), last (end()); 78 while (first != last) { 79 const_iterator mid = advance (first, distance (first,last) / 2); 83 last = mid; 96 /// Returns the pair<K,V> where V = \p v, occuring in range [first,last). 98 inline typename map<K,V>::const_iterator map<K,V>::find_data (const_data_ref v, const_iterator first, const_iterator last) const 101 if (!last) last 108 find_data(const_data_ref v, iterator first, iterator last) argument [all...] |
H A D | ualgo.h | 27 /// Swaps corresponding elements of [first, last) and [result,) 31 inline ForwardIterator2 swap_ranges (ForwardIterator1 first, ForwardIterator2 last, ForwardIterator2 result) argument 33 for (; first != last; ++first, ++result) 38 /// Returns the first iterator i in the range [first, last) such that 39 /// *i == value. Returns last if no such iterator exists. 43 inline InputIterator find (InputIterator first, InputIterator last, const EqualityComparable& value) argument 45 while (first != last && !(*first == value)) 54 ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last) argument 56 if (first != last) 57 for (ForwardIterator prev = first; ++first != last; 91 count(InputIterator first, InputIterator last, const EqualityComparable& value) argument 111 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryFunction op) argument 144 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value) argument 160 replace_copy(InputIterator first, InputIterator last, OutputIterator result, const T& old_value, const T& new_value) argument 172 generate(ForwardIterator first, ForwardIterator last, Generator gen) argument 198 reverse(BidirectionalIterator first, BidirectionalIterator last) argument 208 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result) argument 219 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last) argument 233 rotate(T* first, T* middle, T* last) argument 244 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result) argument 272 inplace_merge(InputIterator first, InputIterator middle, InputIterator last) argument 290 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value) argument 310 remove_copy(InputIterator first, InputIterator last, OutputIterator result, RInputIterator rfirst, RInputIterator rlast) argument 333 remove(ForwardIterator first, ForwardIterator last, const T& value) argument 346 unique_copy(InputIterator first, InputIterator last, OutputIterator result) argument 369 unique(ForwardIterator first, ForwardIterator last) argument 380 lower_bound(ForwardIterator first, ForwardIterator last, const LessThanComparable& value) argument 397 binary_search(ForwardIterator first, ForwardIterator last, const LessThanComparable& value) argument 408 upper_bound(ForwardIterator first, ForwardIterator last, const LessThanComparable& value) argument 425 equal_range(ForwardIterator first, ForwardIterator last, const LessThanComparable& value) argument 438 random_shuffle(RandomAccessIterator first, RandomAccessIterator last) argument 460 sort(RandomAccessIterator first, RandomAccessIterator last, Compare) argument 472 sort(RandomAccessIterator first, RandomAccessIterator last) argument 483 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 495 stable_sort(RandomAccessIterator first, RandomAccessIterator last) argument 522 search_n(Iterator first, Iterator last, size_t count, const T& value) argument 590 is_sorted(ForwardIterator first, ForwardIterator last) argument 609 next_permutation(BidirectionalIterator first, BidirectionalIterator last) argument 619 prev_permutation(BidirectionalIterator first, BidirectionalIterator last) argument 628 max_element(ForwardIterator first, ForwardIterator last) argument 637 min_element(ForwardIterator first, ForwardIterator last) argument 647 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last) argument 660 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last) argument 668 partial_sort_copy(InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last) argument [all...] |
H A D | upredalgo.h | 20 /// Copy_if copies elements from the range [first, last) to the range 21 /// [result, result + (last - first)) if pred(*i) returns true. 26 inline OutputIterator copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred) argument 28 for (; first != last; ++first) { 37 /// Returns the first iterator i in the range [first, last) such that 38 /// pred(*i) is true. Returns last if no such iterator exists. 43 inline InputIterator find_if (InputIterator first, InputIterator last, Predicate pred) argument 45 while (first != last && !pred (*first)) 55 inline ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate p) argument 57 if (first != last) 95 count_if(InputIterator first, InputIterator last, Predicate pred) argument 111 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value) argument 128 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value) argument 143 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred) argument 162 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred) argument 179 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate binary_pred) argument 203 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate binary_pred) argument 215 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, StrictWeakOrdering comp) argument 233 binary_search(ForwardIterator first, ForwardIterator last, const T& value, StrictWeakOrdering comp) argument 245 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, StrictWeakOrdering comp) argument 263 equal_range(ForwardIterator first, ForwardIterator last, const T& value, StrictWeakOrdering comp) argument 280 nth_element(RandomAccessIterator first, RandomAccessIterator, RandomAccessIterator last, Compare comp) argument 322 search_n(Iterator first, Iterator last, size_t count, const T& value, BinaryPredicate comp) argument 437 is_sorted(ForwardIterator first, ForwardIterator last, StrictWeakOrdering comp) argument 465 next_permutation(BidirectionalIterator first, BidirectionalIterator last, StrictWeakOrdering comp) argument 489 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, StrictWeakOrdering comp) argument 512 max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp) argument 525 min_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp) argument 539 partial_sort(RandomAccessIterator first, RandomAccessIterator, RandomAccessIterator last, StrictWeakOrdering comp) argument 548 partial_sort_copy(InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, StrictWeakOrdering comp) argument 567 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred) argument 589 partition(ForwardIterator first, ForwardIterator last, Predicate pred) argument [all...] |
H A D | ustring.cpp | 178 void string::insert (const uoff_t ip, const wchar_t* first, const wchar_t* last, const size_type n) argument 181 size_type nti = distance (first, last), bti = 0; 209 /// Inserts [first,last] \p n times. 210 string::iterator string::insert (iterator start, const_pointer first, const_pointer last, size_type n) argument 212 assert (first <= last); 214 assert ((first < begin() || first >= end() || size() + abs_distance(first,last) < capacity()) && "Insertion of self with autoresize is not supported"); 215 start = iterator (memblock::insert (memblock::iterator(start), distance(first, last) * n)); 216 fill (memblock::iterator(start), first, distance(first, last), n); 242 void string::replace (iterator first, iterator last, const_pointer s) argument 246 replace (first, last, 250 replace(iterator first, iterator last, const_pointer i1, const_pointer i2, size_type n) argument 415 hash(const char* first, const char* last) argument [all...] |
H A D | ustring.h | 130 void insert (const uoff_t ip, const_wpointer first, const_wpointer last, const size_type n = 1); 133 iterator insert (iterator start, const_pointer first, const_iterator last, size_type n = 1); 139 inline iterator erase (iterator first, const_iterator last) { return (erase (first, size_type(distance(first,last)))); } argument 144 void replace (iterator first, iterator last, const_pointer s); 145 void replace (iterator first, iterator last, const_pointer i1, const_pointer i2, size_type n = 1); 146 inline void replace (iterator first, iterator last, const string& s) { replace (first, last, s.begin(), s.end()); } argument 147 inline void replace (iterator first, iterator last, const_pointer s, size_type slen) { replace (first, last, argument 148 replace(iterator first, iterator last, size_type n, value_type c) argument [all...] |
/frameworks/base/tests/AndroidTests/src/com/android/unit_tests/ |
H A D | HeapTest.java | 123 private static <T> int checkRefs(SoftReference<T> refs[], int last) { argument 132 if (numCleared != last) {
|
/frameworks/base/tools/localize/ |
H A D | file_utils.cpp | 26 mkdirs(const char* last) argument 29 const char* s = last-1; 33 if (s > last && (*s == '.' || *s == 0)) { 34 String8 part(last, s-last); 44 last = s+1;
|
/frameworks/base/libs/surfaceflinger/ |
H A D | BlurFilter.cpp | 80 inline uint16_t to(int shift, int last, int dither) const { argument 84 if (UNLIKELY(last)) { 127 inline uint32_t to(int shift, int last, int dither) const { argument 131 if (UNLIKELY(last)) { 170 inline uint16_t to(int shift, int last, int dither) const { argument 172 if (UNLIKELY(last)) { 202 inline uint32_t to(int shift, int last, int dither) const { argument 205 if (UNLIKELY(last)) {
|
/frameworks/base/core/java/android/webkit/ |
H A D | CookieManager.java | 560 * @param last The given time in millisec 563 synchronized ArrayList<Cookie> getUpdatedCookiesSince(long last) { argument 572 if (cookie.lastUpdateTime > last) {
|
/frameworks/base/include/utils/ |
H A D | List.h | 189 * Return the first element or one past the last element. The 222 void insert(iterator posn, const_iterator first, const_iterator last) { argument 223 for ( ; first != last; ++first) 238 iterator erase(iterator first, iterator last) { argument 239 while (first != last) 241 return iterator(last); 260 * will be equal to "last". The iterators must refer to the same 274 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 277 while (first != last) {
|
/frameworks/base/media/libstagefright/ |
H A D | MPEG4Writer.cpp | 648 int64_t last = (*it).timestamp; local 652 mOwner->writeInt32((*it).timestamp - last); 654 last = (*it).timestamp;
|
/frameworks/base/core/java/android/text/ |
H A D | Html.java | 231 boolean last) { 342 String p = last ? "" : "</p>\n<p>"; 425 // If the last line of the range is blank, back off by one. 566 * This knows that the last returned object from getSpans() 229 withinParagraph(StringBuilder out, Spanned text, int start, int end, int nl, boolean last) argument
|
H A D | StaticLayout.java | 789 // Log.e("text", "output last " + bufend); 939 int dir, boolean easy, boolean last, 949 // Log.e("text", "line " + start + " to " + end + (last ? "===" : "")); 995 if (last) { 933 out(CharSequence text, int start, int end, int above, int below, int top, int bottom, int v, float spacingmult, float spacingadd, LineHeightSpan[] chooseht, int[] choosehtv, Paint.FontMetricsInt fm, boolean tab, boolean needMultiply, int pstart, byte[] chdirs, int dir, boolean easy, boolean last, boolean includepad, boolean trackpad, float[] widths, int widstart, int widoff, TextUtils.TruncateAt ellipsize, float ellipsiswidth, float textwidth, TextPaint paint) argument
|
H A D | TextUtils.java | 130 public static int lastIndexOf(CharSequence s, char ch, int last) { argument 134 return ((String) s).lastIndexOf(ch, last); 136 return lastIndexOf(s, ch, 0, last); 140 int start, int last) { 141 if (last < 0) 143 if (last >= s.length()) 144 last = s.length() - 1; 146 int end = last + 1; 838 // happens when ^ is the last character in the string. 139 lastIndexOf(CharSequence s, char ch, int start, int last) argument
|
/frameworks/base/libs/rs/ |
H A D | rsContext.cpp | 198 uint64_t last = mTimeLast; local 200 mTimers[mTimerActive] += mTimeLast - last;
|
/frameworks/base/opengl/libs/EGL/ |
H A D | egl.cpp | 352 T const sortedArray[], int first, int last, T key) 354 while (first <= last) { 355 int mid = (first + last) / 2; 359 last = mid - 1; 351 binarySearch( T const sortedArray[], int first, int last, T key) argument
|
/frameworks/base/tools/aapt/ |
H A D | Resource.cpp | 1612 const char* last = pkg.string(); local 1613 const char* s = last-1; 1616 if (s > last && (*s == '.' || *s == 0)) { 1617 String8 part(last, s-last); 1624 last = s+1;
|