/frameworks/base/graphics/java/android/graphics/ |
H A D | SumPathEffect.java | 23 * (e.g. first(path) + second(path)) 25 public SumPathEffect(PathEffect first, PathEffect second) { argument 26 native_instance = nativeCreate(first.native_instance, 30 private static native int nativeCreate(int first, int second); argument
|
/frameworks/base/libs/surfaceflinger/ |
H A D | Tokenizer.h | 43 run_t(uint32_t f, uint32_t l) : first(f), length(l) {} 44 uint32_t first; member in struct:android::Tokenizer::run_t
|
/frameworks/base/opengl/libagl/ |
H A D | Tokenizer.h | 45 run_t(uint32_t f, uint32_t l) : first(f), length(l) {} 46 uint32_t first; member in struct:android::Tokenizer::run_t
|
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
H A D | upair.h | 28 inline pair (void) : first (T1()), second (T2()) {} 30 inline pair (const T1& a, const T2& b) : first (a), second (b) {} 31 inline pair& operator= (const pair<T1, T2>& p2) { first = p2.first; second = p2.second; return (*this); } 33 inline pair& operator= (const pair<T3, T4>& p2) { first = p2.first; second = p2.second; return (*this); } 35 first_type first; member in class:ustl::pair 43 return (p1.first == p2.first && p1.second == p2.second); 50 return (p1.first < p [all...] |
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) 23 init += *first++; 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) 34 init = binary_op (init, *first++); 38 /// Assigns range [value, value + (last - first)) to [first, las 42 iota(ForwardIterator first, ForwardIterator last, T value) argument 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 51 /// *result = *first, *(result + 1) = *(first + 1), and so on. [1] Generally, 52 /// for every integer n from 0 to last - first, copy performs the assignment 53 /// *(result + n) = *(first + n). Assignments are performed in forward order, 58 inline OutputIterator copy (InputIterator first, InputIterator last, OutputIterator result) argument 60 for (; first != last; ++result, ++first) 61 *result = *first; 74 copy_n(InputIterator first, size_t count, OutputIterator result) argument 86 copy_backward(InputIterator first, InputIterator last, OutputIterator result) argument 100 for_each(InputIterator first, InputIterator last, UnaryFunction f) argument 113 fill(ForwardIterator first, ForwardIterator last, const T& value) argument 125 fill_n(OutputIterator first, size_t count, const T& value) argument 141 copy_backward_fast(const void* first, const void* last, void* result) argument 144 memmove (advance (result, -nBytes), first, nBytes); local 173 unrolled_copy(const T* first, size_t count, T* 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 32 RandomAccessIterator iChild (first); 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 49 const value_type v (*first); 50 uoff_t iChild, iHole = 0, iEnd (distance (first, las 67 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) argument 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 65 if (!first) 66 first = l.begin(); 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) { 83 construct (&*first); 84 ++ first; 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) 116 destroy (&*first); 143 /// Copies [first, las 147 uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator result) argument 161 uninitialized_copy_n(InputIterator first, size_t n, ForwardIterator result) argument 175 uninitialized_fill(ForwardIterator first, ForwardIterator last, const T& v) argument 187 uninitialized_fill_n(ForwardIterator first, size_t n, const T& v) argument [all...] |
H A D | ualgobase.cpp | 152 void copy_backward_fast (const void* first, const void* last, void* result) argument 154 prefetch (first, 0, 0); 156 size_t nBytes (distance (first, last)); 234 /// Exchanges ranges [first, middle) and [middle, last) 235 void rotate_fast (void* first, void* middle, void* last) argument 238 const size_t half1 (distance (first, middle)), half2 (distance (middle, last)); 247 copy_backward_fast (first, middle, last); 248 copy_n_fast (buf, half2, first); 250 copy_n_fast (first, half1, buf); 251 copy_n_fast (middle, half2, first); [all...] |
H A D | uctralgo.h | 22 /// Copy copies elements from the range [first, last) to the range 23 /// [result, result + (last - first)). That is, it performs the assignments 24 /// *result = *first, *(result + 1) = *(first + 1), and so on. [1] Generally, 25 /// for every integer n from 0 to last - first, copy performs the assignment 26 /// *(result + n) = *(first + n). Assignments are performed in forward order, 36 /// Copy_if copies elements from the range [first, last) to the range 37 /// [result, result + (last - first)) if pred(*i) returns true. 47 /// [first, last); f's return value, if any, is ignored. Applications are 48 /// performed in forward order, i.e. from first t 161 transform(Container& ctr, InputIterator first, OutputIterator result, BinaryFunction op) 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); 80 if (mid->first < k) 81 first = advance (mid, 1); 85 return (first); 93 return ((i < end() && k < i->first) 98 find_data(const_data_ref v, const_iterator first, const_iterator last) const argument 108 find_data(const_data_ref v, iterator first, iterator last) argument [all...] |
/frameworks/base/core/java/android/view/ |
H A D | ContextThemeWrapper.java | 84 * @param first Set to true if this is the first time a style is being 87 protected void onApplyThemeResource(Resources.Theme theme, int resid, boolean first) { argument 92 final boolean first = mTheme == null; 93 if (first) { 100 onApplyThemeResource(mTheme, mThemeResource, first);
|
/frameworks/base/core/java/android/text/style/ |
H A D | DrawableMarginSpan.java | 38 public int getLeadingMargin(boolean first) { argument 45 boolean first, Layout layout) { 42 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout layout) argument
|
H A D | IconMarginSpan.java | 38 public int getLeadingMargin(boolean first) { argument 45 boolean first, Layout layout) { 42 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout layout) argument
|
H A D | BulletSpan.java | 73 public int getLeadingMargin(boolean first) { argument 80 boolean first, Layout l) { 77 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout l) argument
|
H A D | LeadingMarginSpan.java | 29 public int getLeadingMargin(boolean first); argument 34 boolean first, Layout layout); 39 public Standard(int first, int rest) { argument 40 mFirst = first; 66 public int getLeadingMargin(boolean first) { argument 67 return first ? mFirst : mRest; 74 boolean first, Layout layout) { 30 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout layout) argument 70 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout layout) argument
|
H A D | QuoteSpan.java | 62 public int getLeadingMargin(boolean first) { argument 69 boolean first, Layout layout) { 66 drawLeadingMargin(Canvas c, Paint p, int x, int dir, int top, int baseline, int bottom, CharSequence text, int start, int end, boolean first, Layout layout) argument
|
/frameworks/base/test-runner/android/test/ |
H A D | ViewAsserts.java | 113 * @param first The first view 116 static public void assertBaselineAligned(View first, View second) { argument 118 first.getLocationOnScreen(xy); 119 int firstTop = xy[1] + first.getBaseline(); 131 * @param first The first view 134 static public void assertRightAligned(View first, View second) { argument 136 first.getLocationOnScreen(xy); 137 int firstRight = xy[0] + first 153 assertRightAligned(View first, View second, int margin) argument 171 assertLeftAligned(View first, View second) argument 190 assertLeftAligned(View first, View second, int margin) argument 208 assertBottomAligned(View first, View second) argument 227 assertBottomAligned(View first, View second, int margin) argument 245 assertTopAligned(View first, View second) argument 264 assertTopAligned(View first, View second, int margin) argument [all...] |
/frameworks/base/core/jni/android/graphics/ |
H A D | PathEffect.cpp | 24 SkPathEffect* first, SkPathEffect* second) { 25 return new SkSumPathEffect(first, second); 23 Sum_constructor(JNIEnv* env, jobject, SkPathEffect* first, SkPathEffect* second) argument
|
/frameworks/base/services/java/com/android/server/status/ |
H A D | Ticker.java | 32 boolean first; field in class:Ticker.Segment 71 this.first = false; 114 this.first = true; 166 seg.first = false; 200 if (seg.first) { 201 // this makes the icon slide in for the first one for a given
|
/frameworks/base/include/utils/ |
H A D | List.h | 145 * Return the first element or one past the last element. The 169 void insert(iterator posn, const_iterator first, const_iterator last) { argument 170 for ( ; first != last; ++first) 171 insert(posn, *first); 185 iterator erase(iterator first, iterator last) { argument 186 while (first != last) 187 erase(first++); // don't erase than incr later! 206 * Measure the distance between two iterators. On exist, "first" 215 unsigned int distance(iterator first, iterato argument 223 distance(const_iterator first, const_iterator last) const argument [all...] |
/frameworks/base/libs/utils/ |
H A D | BufferedTextOutput.cpp | 168 const char* first = txt; local 174 // Special cases for first data on a line. 193 vec.iov_base = (void*)first; 194 vec.iov_len = lastLine-first; 203 err = b->append(first, txt-first);
|