/external/clang/test/Index/ |
recursive-member-access.c | 2 struct rdar8650865 *first; member in struct:rdar8650865 7 return ((((((s->first)->first) 8 ->first) 9 ->first) 10 ->first) 11 ->first) 12 ->first 13 ->first 14 ->first [all...] |
/frameworks/base/core/tests/coretests/src/android/view/accessibility/ |
RecycleAccessibilityEventTest.java | 43 AccessibilityEvent first = local 45 assertNotNull(first); 47 first.setClassName(CLASS_NAME); 48 first.setPackageName(PACKAGE_NAME); 49 first.getText().add(TEXT); 50 first.setFromIndex(FROM_INDEX); 51 first.setAddedCount(ADDED_COUNT); 52 first.setRemovedCount(REMOVED_COUNT); 53 first.setChecked(true); 54 first.setContentDescription(CONTENT_DESCRIPTION) [all...] |
/development/ndk/samples/two-libs/jni/ |
first.c | 17 #include "first.h" 19 int first(int x, int y) function
|
first.h | 20 extern int first(int x, int y);
|
second.c | 17 #include "first.h" 26 return first(x, y);
|
/frameworks/base/graphics/java/android/graphics/ |
SumPathEffect.java | 23 * (e.g. first(path) + second(path)) 25 public SumPathEffect(PathEffect first, PathEffect second) { 26 native_instance = nativeCreate(first.native_instance, 30 private static native int nativeCreate(int first, int second);
|
/external/easymock/src/org/easymock/internal/matchers/ |
Not.java | 26 private final IArgumentMatcher first;
field in class:Not 28 public Not(IArgumentMatcher first) {
29 this.first = first;
33 return !first.matches(actual);
38 first.appendTo(buffer);
|
/system/extras/tests/bionic/libc/bionic/ |
lib_relocs.c | 6 struct foo { int first, second; }; member in struct:foo 9 int* FooPtr[] = { &Foo.first, &Foo.second };
|
/external/elfutils/lib/ |
list.h | 18 #define CDBL_LIST_ADD_REAR(first, newp) \ 23 if (unlikely ((first) == NULL)) \ 24 (first) = _newp->next = _newp->previous = _newp; \ 27 _newp->next = (first); \ 28 _newp->previous = (first)->previous; \ 34 #define CDBL_LIST_DEL(first, elem) \ 38 assert (first != NULL && _elem != NULL \ 39 && (first != elem \ 40 || ({ __typeof (elem) _runp = first->next; \ 41 while (_runp != first) \ [all...] |
/ndk/tests/device/multi-static-instances/jni/ |
main.cpp | 15 A* first = A::instance(); local 18 if (first != second) { 19 fprintf(stderr, "ERROR: instance() returned two distinct addresses: %p %p\n", first, second); 22 printf("OK: instance() returned the same address twice: %p\n", first);
|
/system/core/ |
Android.mk | 18 include $(call first-makefiles-under,$(LOCAL_PATH))
|
/external/mesa3d/src/glsl/ |
ir_basic_block.h | 25 void (*callback)(ir_instruction *first,
|
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
iterator.h | 61 iterator_pair(const Iterator1& first, const Iterator2& second) 62 : base_type(first, second) { } 68 ++base_type::first; member in class:__gnu_parallel::iterator_pair::base_type 76 { return type(base_type::first++, base_type::second++); } 82 --base_type::first; 90 { return type(base_type::first--, base_type::second--); } 99 base_type::first = other.first; member in class:__gnu_parallel::iterator_pair::base_type 106 { return type(base_type::first + delta, base_type::second + delta); } 110 { return base_type::first - other.first; 133 Iterator1 first; member in class:__gnu_parallel::iterator_triple [all...] |
unique_copy.h | 42 * @param first Begin iterator of input sequence. 51 parallel_unique_copy(InputIterator first, InputIterator last, 54 _GLIBCXX_CALL(last - first) 60 difference_type size = last - first; 65 // Let the first thread process two parts. 70 // First part contains at least one element. 96 *out++ = *first; 98 for (InputIterator iter = first + begin; iter < first + end; ++iter) 112 for (InputIterator iter = first + begin; iter < first + end; ++iter [all...] |
/external/webkit/Source/WebCore/css/ |
Pair.h | 40 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) 42 return adoptRef(new Pair(first, second)); 46 CSSPrimitiveValue* first() const { return m_first.get(); } function in class:WebCore::Pair 49 void setFirst(PassRefPtr<CSSPrimitiveValue> first) { m_first = first; } 54 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) 55 : m_first(first), m_second(second) { }
|
FontFamilyValue.cpp | 49 unsigned first = 0; local 52 first = i - 1; 54 if (!first) 56 length = first;
|
/frameworks/base/core/java/android/util/ |
Pair.java | 25 public final F first; field in class:Pair 31 * @param first the first object in the Pair 34 public Pair(F first, S second) { 35 this.first = first; 53 return first.equals(other.first) && second.equals(other.second); 62 result = 31 * result + first.hashCode(); 69 * @param a the first object in the Pai [all...] |
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
SDL_qsort.c | 92 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon9648 93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 95 #define doLeft {first=ffirst;llast=last;continue;} 96 #define doRight {ffirst=first;last=llast;continue;} 98 first=ffirst=stack[stacktop].first;\ 115 * 3. We choose a pivot by looking at the first, last 169 { size_t l=last-ffirst,r=llast-first; \ 307 char *first,*last; local 338 char *first,*last; local 369 char *first,*last; local [all...] |
/frameworks/ex/variablespeed/jni/ |
macros.h | 31 ForwardIterator min_element(ForwardIterator first, ForwardIterator last) { 32 ForwardIterator lowest = first; 33 if (first == last) return last; 34 while (++first != last) 35 if (*first < *lowest) 36 lowest = first;
|
/external/clang/test/SemaCXX/ |
non-empty-class-size-zero.cpp | 13 int first; member in struct:Y
|
/bionic/libstdc++/include/ |
stl_pair.h | 68 _T1 first; member in struct:pair 70 pair() : first(), second() {} 71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} 74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} 80 return __x.first == __y.first && __x.second == __y.second; 86 return __x.first < __y.first || 87 (!(__y.first < __x.first) && __x.second < __y.second) [all...] |
/ndk/sources/cxx-stl/gabi++/include/ |
stl_pair.h | 68 _T1 first; member in struct:pair 70 pair() : first(), second() {} 71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} 74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} 80 return __x.first == __y.first && __x.second == __y.second; 86 return __x.first < __y.first || 87 (!(__y.first < __x.first) && __x.second < __y.second) [all...] |
/ndk/sources/cxx-stl/system/include/ |
stl_pair.h | 68 _T1 first; member in struct:pair 70 pair() : first(), second() {} 71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} 74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} 80 return __x.first == __y.first && __x.second == __y.second; 86 return __x.first < __y.first || 87 (!(__y.first < __x.first) && __x.second < __y.second) [all...] |
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_indexing.cpp | 36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal) 44 s_point=source+first; 46 d_bottom=dest+first; 61 long first=0; local 76 for(;last-first>2;) 78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]); 79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal); 82 else if(last_equal<pos) first=last_equal+1; 95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]) [all...] |
/prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/ |
stl_pair.h | 68 _T1 first; member in struct:pair 70 pair() : first(), second() {} 71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} 74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} 80 return __x.first == __y.first && __x.second == __y.second; 86 return __x.first < __y.first || 87 (!(__y.first < __x.first) && __x.second < __y.second) [all...] |