| /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...] |
| /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...] |
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| Pair.java | 23 public final S first; field in class:Pair
26 public Pair(S first, T second) {
27 this.first = first;
31 public static <S, T> Pair<S, T> create(S first, T second) {
32 return new Pair<S, T>(first, second);
39 result = PRIME * result + ((first == null) ? 0 : first.hashCode());
57 if (first == null && other.first != null)
[all...] |
| /external/webkit/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) { }
|
| /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:__anon5893
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...] |
| /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/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...] |
| /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...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-4/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...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/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...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/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...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/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...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/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...] |
| /libcore/luni/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 36 * for(int nodeHandle=myTraverser.first(myContext);
50 * an axis, the first function must be used to get the first node.
57 * @return the first node in the traversal.
59 public int first(int context) method in class:DTMAxisTraverser
67 * an axis, the first function must be used to get the first node.
76 * @return the first node in the traversal.
78 public int first(int context, int extendedTypeID) method in class:DTMAxisTraverser
90 * previous traversal step. For the first traversal step, contex
[all...] |
| /device/samsung/crespo/sec_mm/sec_omx/sec_osal/ |
| SEC_OSAL_Queue.c | 53 queue->first = (SEC_QElem *)SEC_OSAL_Malloc(sizeof(SEC_QElem));
54 if (queue->first == NULL)
57 SEC_OSAL_Memset(queue->first, 0, sizeof(SEC_QElem));
58 currentqelem = queue->last = queue->first;
64 while (queue->first != NULL) {
65 currentqelem = queue->first->qNext;
66 SEC_OSAL_Free((OMX_PTR)queue->first);
67 queue->first = currentqelem;
77 currentqelem->qNext = queue->first;
93 currentqelem = queue->first->qNext
[all...] |
| /frameworks/base/opengl/libagl/ |
| Tokenizer.cpp | 43 if (!mRanges.size() || mRanges[0].first) {
48 // just extend the first run
50 uint32_t token = run.first + run.length;
76 if ((token >= run.first) && (token < run.first+run.length)) {
79 if ((token == run.first) || (token == run.first+run.length-1)) {
80 if (token == run.first) {
81 run.first += 1;
91 new_run.first = token+1
[all...] |
