| /prebuilts/ndk/9/platforms/android-14/arch-mips/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-14/arch-x86/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-18/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-18/arch-mips/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-18/arch-x86/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-3/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-4/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-5/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-8/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-9/arch-arm/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-9/arch-mips/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /prebuilts/ndk/9/platforms/android-9/arch-x86/usr/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /external/chromium_org/third_party/icu/source/common/ |
| uvectr64.h | 66 int64_t* elements; member in class:UVector64
83 * equal if they are of the same size and all elements are equal,
136 * elements for i >= newSize. If newSize is larger, grow the
159 * Units are vector elements (64 bits each), not bytes.
211 return (0 <= index && index < count) ? elements[index] : 0;
217 elements[count] = elem;
226 int64_t *rp = elements+count;
237 return elements+count-size;
255 return elements;
270 result = elements[count]
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableMultiset.java | 37 * An immutable hash-based multiset. Does not permit null elements.
39 * <p>Its iterator orders elements according to the first appearance of the
74 * Returns an immutable multiset containing the given elements, in order.
85 * Returns an immutable multiset containing the given elements, in order.
96 * Returns an immutable multiset containing the given elements, in order.
107 * Returns an immutable multiset containing the given elements, in order.
118 * Returns an immutable multiset containing the given elements, in order.
134 * Returns an immutable multiset containing the given elements.
138 * elements in the order {@code 2, 3, 3, 1}.
140 * @throws NullPointerException if any of {@code elements} is nul
458 final Object[] elements; field in class:SerializedForm
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ContiguousSetNonGwtTest.java | 52 protected Set<Integer> create(Integer[] elements) {
57 Collections.addAll(set, elements);
58 checkArgument(set.size() == elements.length);
83 @Override public Set<Integer> create(Object... elements) {
84 Integer[] array = new Integer[elements.length];
86 for (Object e : elements) {
92 protected abstract Set<Integer> create(Integer[] elements);
|
| /external/icu4c/common/ |
| uvectr64.h | 66 int64_t* elements; member in class:UVector64
83 * equal if they are of the same size and all elements are equal,
136 * elements for i >= newSize. If newSize is larger, grow the
159 * Units are vector elements (64 bits each), not bytes.
211 return (0 <= index && index < count) ? elements[index] : 0;
217 elements[count] = elem;
226 int64_t *rp = elements+count;
237 return elements+count-size;
255 return elements;
270 result = elements[count]
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractQueueTest.java | 37 private Object[] elements = new Object[CAPACITY]; field in class:AbstractQueueTest.MockAbstractQueue
53 return (E) elements[currentIndex];
61 elements[i] = elements[i + 1];
81 elements[size++] = o;
89 E e = (E) elements[0];
91 elements[i] = elements[i + 1];
101 return (E) elements[0];
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MapGenerators.java | 48 @Override protected Set<String> create(String[] elements) {
50 for (String key : elements) {
66 public Collection<String> create(Object... elements) {
68 for (Object key : elements) {
89 UnhashableObject[] elements) {
92 for (UnhashableObject value : elements) {
111 // elements. Those tests aren't useful in testing entry sets
112 // because entry sets never have null elements.
128 public List<String> create(Object... elements) {
130 for (int i = 0; i < elements.length; i++)
[all...] |
| /external/chromium/net/base/ |
| upload_data_stream_unittest.cc | 64 std::vector<UploadData::Element> elements; local
68 elements.push_back(element);
69 upload_data_->SetElements(elements);
91 std::vector<UploadData::Element> elements; local
94 elements.push_back(element);
95 upload_data_->SetElements(elements);
|
| /hardware/invensense/60xx/mlsdk/mllite/ |
| mlFIFO.c | 166 static uint_fast16_t inv_set_fifo_accuracy(uint_fast16_t elements,
170 if (elements) {
189 * bit set in element. The value returned are the elements that should be sent
192 static uint_fast16_t inv_set_fifo_reference(uint_fast16_t elements,
201 if ((elements & 1)
205 elements >>= 1;
209 if (elements & 1)
211 elements >>= 1;
214 elements = 0;
217 elements |= (1 << kk)
1080 uint_fast16_t elements; local
1258 uint_fast16_t elements, kk; local
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| APLRecord.java | 90 private List elements; field in class:APLRecord
111 * @param elements The list of APL elements.
114 APLRecord(Name name, int dclass, long ttl, List elements) {
116 this.elements = new ArrayList(elements.size());
117 for (Iterator it = elements.iterator(); it.hasNext(); ) {
128 this.elements.add(element);
146 elements = new ArrayList(1);
168 elements.add(element)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| RewriteRuleNodeStream.cs | 61 IList<object> elements
62 ) : base(adaptor, elementDescription, elements) {
|
| RewriteRuleTokenStream.cs | 63 IList<object> elements
64 ) : base(adaptor, elementDescription, elements) {
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| RewriteRuleNodeStream.cs | 59 public RewriteRuleNodeStream( ITreeAdaptor adaptor, string elementDescription, IList elements )
60 : base( adaptor, elementDescription, elements )
|
| RewriteRuleTokenStream.cs | 54 public RewriteRuleTokenStream( ITreeAdaptor adaptor, string elementDescription, IList elements )
55 : base( adaptor, elementDescription, elements )
|
