| /libcore/luni/src/main/java/java/util/concurrent/ |
| CopyOnWriteArrayList.java | 77 private transient volatile Object[] elements; field in class:CopyOnWriteArrayList
83 elements = EmptyArray.OBJECT;
87 * Creates a new instance containing the elements of {@code collection}.
95 * Creates a new instance containing the elements of {@code array}.
98 this.elements = Arrays.copyOf(array, array.length, Object[].class);
104 result.elements = result.elements.clone();
112 return elements.length;
117 return (E) elements[index];
125 Object[] snapshot = elements;
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableCollection.java | 28 * An immutable collection. Does not permit null elements.
31 * #asList()} method, which returns a list view of the collection's elements.
50 * Returns an unmodifiable iterator across the elements in this collection.
219 private final E[] elements; field in class:ImmutableCollection.ArrayImmutableCollection
221 ArrayImmutableCollection(E[] elements) {
222 this.elements = elements;
227 return elements.length;
235 return Iterators.forArray(elements);
239 return elements.length == 1 ? new SingletonImmutableList<E>(elements[0]
253 final Object[] elements; field in class:ImmutableCollection.SerializedForm
[all...] |
| ImmutableSet.java | 37 * iteration order. Does not permit null elements.
75 // Casting to any type is safe because the set will never hold any elements.
92 * Returns an immutable set containing the given elements, in order. Repeated
103 * Returns an immutable set containing the given elements, in order. Repeated
114 * Returns an immutable set containing the given elements, in order. Repeated
125 * Returns an immutable set containing the given elements, in order. Repeated
136 * Returns an immutable set containing the given elements, in order. Repeated
146 Object[] elements = new Object[paramCount + others.length]; local
147 elements[0] = e1;
148 elements[1] = e2
[all...] |
| SortedIterables.java | 42 * Returns {@code true} if {@code elements} is a sorted collection using an ordering equivalent
45 public static boolean hasSameComparator(Comparator<?> comparator, Iterable<?> elements) {
47 checkNotNull(elements);
49 if (elements instanceof SortedSet) {
50 SortedSet<?> sortedSet = (SortedSet<?>) elements;
55 } else if (elements instanceof SortedIterable) {
56 comparator2 = ((SortedIterable<?>) elements).comparator();
64 * Returns a sorted collection of the unique elements according to the specified comparator. Does
69 Comparator<? super E> comparator, Iterator<E> elements) {
71 Iterators.addAll(sortedSet, elements);
[all...] |
| /external/icu4c/common/ |
| uvector.cpp | 33 elements(0),
43 elements(0),
53 elements(0),
63 elements(0),
78 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity);
79 if (elements == 0) {
88 uprv_free(elements);
89 elements = 0;
101 if (elements[i].pointer != 0 && deleter != 0) {
102 (*deleter)(elements[i].pointer)
[all...] |
| uvectr32.cpp | 31 elements(NULL)
40 elements(0)
58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
59 if (elements == 0) {
67 uprv_free(elements);
68 elements = 0;
78 elements[i] = other.elements[i];
88 if (elements[i] != other.elements[i])
[all...] |
| uvectr64.cpp | 28 elements(NULL)
37 elements(0)
55 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity);
56 if (elements == 0) {
64 uprv_free(elements);
65 elements = 0;
75 elements[i] = other.elements[i];
85 if (elements[i] != other.elements[i])
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.js | 1 /** A generic list of elements tracked in an alternative to be used in
6 * Once you start next()ing, do not try to add more elements. It will
16 * which bumps it to 1 meaning no more elements.
35 this.elements = el;
44 * not consumed any of its elements. Elements themselves are untouched.
57 if ( this.elements ) { // if in list, just add
58 this.elements.push(el);
61 if ( !org.antlr.lang.isValue(this.singleElement) ) { // no elements yet, track w/o list
66 this.elements = []
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uvector.cpp | 32 elements(0),
42 elements(0),
52 elements(0),
62 elements(0),
77 elements = (UHashTok *)uprv_malloc(sizeof(UHashTok)*initialCapacity);
78 if (elements == 0) {
87 uprv_free(elements);
88 elements = 0;
100 if (elements[i].pointer != 0 && deleter != 0) {
101 (*deleter)(elements[i].pointer)
[all...] |
| uvectr32.cpp | 31 elements(NULL)
40 elements(0)
58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
59 if (elements == 0) {
67 uprv_free(elements);
68 elements = 0;
78 elements[i] = other.elements[i];
88 if (elements[i] != other.elements[i])
[all...] |
| uvectr64.cpp | 28 elements(NULL)
37 elements(0)
55 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity);
56 if (elements == 0) {
64 uprv_free(elements);
65 elements = 0;
75 elements[i] = other.elements[i];
85 if (elements[i] != other.elements[i])
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableSet.java | 51 // Casting to any type is safe because the set will never hold any elements.
92 @Deprecated public static <E> ImmutableSet<E> of(E[] elements) {
93 return copyOf(elements);
96 public static <E> ImmutableSet<E> copyOf(E[] elements) {
97 checkNotNull(elements);
98 switch (elements.length) {
102 return of(elements[0]);
104 return create(elements);
108 public static <E> ImmutableSet<E> copyOf(Collection<? extends E> elements) {
109 Iterable<? extends E> iterable = elements;
[all...] |
| /frameworks/base/core/java/com/google/android/collect/ |
| Sets.java | 50 * Creates a {@code HashSet} instance containing the given elements.
62 * @param elements the elements that the set should contain
63 * @return a newly-created {@code HashSet} containing those elements (minus
66 public static <E> HashSet<E> newHashSet(E... elements) {
67 int capacity = elements.length * 4 / 3 + 1;
69 Collections.addAll(set, elements);
83 * Creates a {@code SortedSet} instance containing the given elements.
85 * @param elements the elements that the set should contai
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| RewriteRuleElementStream.cs | 38 * A generic list of elements tracked in an alternative to be used in
45 * Once you start next()ing, do not try to add more elements. It will
58 * which bumps it to 1 meaning no more elements.
63 /** <summary>Track single elements w/o creating a list. Upon 2nd add, alloc list */
67 protected IList elements; field in class:Antlr.Runtime.Tree.RewriteRuleElementStream
98 public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription, IList elements)
101 this.elements = elements;
106 * not consumed any of its elements. Elements themselves are untouched
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| RewriteRuleElementStream.cs | 39 * A generic list of elements tracked in an alternative to be used in
46 * Once you start next()ing, do not try to add more elements. It will
60 * which bumps it to 1 meaning no more elements.
65 /** <summary>Track single elements w/o creating a list. Upon 2nd add, alloc list */
69 protected IList elements; field in class:Antlr.Runtime.Tree.RewriteRuleElementStream
102 public RewriteRuleElementStream( ITreeAdaptor adaptor, string elementDescription, IList elements )
106 this.elements = elements;
111 * not consumed any of its elements. Elements themselves are untouched
[all...] |
| /external/chromium_org/ppapi/tests/ |
| test_resource_array.cc | 61 PP_Resource elements[] = { local
66 size_t size = sizeof(elements) / sizeof(elements[0]);
68 pp::ResourceArray_Dev resource_array(instance_, elements, size);
72 ASSERT_EQ(elements[index], resource_array[index]);
84 PP_Resource elements[] = { local
89 size_t size = sizeof(elements) / sizeof(elements[0]);
91 pp::ResourceArray_Dev resource_array(instance_, elements, size);
109 PP_Resource elements[] = local
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| SetGenerators.java | 57 @Override protected Set<String> create(String[] elements) {
58 return ImmutableSet.copyOf(elements);
69 public Set<Object> create(Object... elements) {
70 return ImmutableSet.copyOf(elements);
79 @Override protected Set<String> create(String[] elements) {
81 ImmutableSet.of(elements[0], elements[0]);
87 @Override protected SortedSet<String> create(String[] elements) {
88 return ImmutableSortedSet.copyOf(elements);
94 @Override protected SortedSet<String> create(String[] elements) {
[all...] |
| /external/flac/libFLAC/ |
| memory.c | 74 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer)
82 FLAC__ASSERT(elements > 0);
87 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */
90 pu = (FLAC__int32*)FLAC__memory_alloc_aligned(sizeof(*pu) * (size_t)elements, &u.pv);
103 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer)
111 FLAC__ASSERT(elements > 0);
116 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */
119 pu = (FLAC__uint32*)FLAC__memory_alloc_aligned(sizeof(*pu) * elements, &u.pv);
132 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer)
140 FLAC__ASSERT(elements > 0)
[all...] |
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
| ArrayUtils.java | 36 * Utility method to sort two related arrays - that is, two arrays where the elements are related to each other
39 * array is sorted by it's related item in the first array, so that the same elements are still related to each
58 element[] elements = new element[firstArray.length]; local
60 Arrays.sort(elements, new Comparator<element>(){
66 for (int i=0; i<elements.length; i++) {
67 firstArray[i] = elements[i].first;
68 secondArray[i] = elements[i].second;
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| asdl.h | 22 void *elements[1]; member in struct:__anon62225
27 int elements[1]; member in struct:__anon62226
33 #define asdl_seq_GET(S, I) (S)->elements[(I)]
39 (S)->elements[_asdl_i] = (V); \
42 #define asdl_seq_SET(S, I, V) (S)->elements[I] = (V)
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| asdl.h | 22 void *elements[1]; member in struct:__anon62348
27 int elements[1]; member in struct:__anon62349
33 #define asdl_seq_GET(S, I) (S)->elements[(I)]
39 (S)->elements[_asdl_i] = (V); \
42 #define asdl_seq_SET(S, I, V) (S)->elements[I] = (V)
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| SetEqualsTester.java | 39 "A Set should equal any other Set containing the same elements.",
45 Collection<E> elements = getSampleElements(getNumElements() - 1); local
46 elements.add(getSubjectGenerator().samples().e3);
49 "A Set should not equal another Set containing different elements.",
50 getSet().equals(MinimalSet.from(elements))
57 Collection<E> elements = getSampleElements(getNumElements() - 1); local
58 elements.add(null);
60 collection = getSubjectGenerator().create(elements.toArray());
61 assertTrue("A Set should equal any other Set containing the same elements,"
62 + " even if some elements are null."
68 Collection<E> elements = getSampleElements(getNumElements() - 1); local
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| for-in-special-cases.js | 75 var elements = Accumulate("abcd");
76 // We do not assume that for-in enumerates elements in order.
77 assertTrue(-1 != elements.indexOf("0"));
78 assertTrue(-1 != elements.indexOf("1"));
79 assertTrue(-1 != elements.indexOf("2"));
80 assertTrue(-1 != elements.indexOf("3"));
81 assertEquals(4, elements.length);
97 var elements = Accumulate(y);
99 // If for-in returns elements in a different order on multiple calls, this
101 assertEquals(elements, elements1, "For-in elements not the same both times.")
[all...] |
| /external/v8/test/mjsunit/ |
| for-in-special-cases.js | 75 var elements = Accumulate("abcd");
76 // We do not assume that for-in enumerates elements in order.
77 assertTrue(-1 != elements.indexOf("0"));
78 assertTrue(-1 != elements.indexOf("1"));
79 assertTrue(-1 != elements.indexOf("2"));
80 assertTrue(-1 != elements.indexOf("3"));
81 assertEquals(4, elements.length);
97 var elements = Accumulate(y);
99 // If for-in returns elements in a different order on multiple calls, this
101 assertEquals(elements, elements1, "For-in elements not the same both times.")
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_node_data_views.cc | 29 if (elements.size() == 1 && elements[0].is_url) {
30 if (elements[0].url.SchemeIs(chrome::kJavaScriptScheme)) {
31 data->SetString(UTF8ToUTF16(elements[0].url.spec()));
33 data->SetURL(elements[0].url, elements[0].title);
44 elements.clear();
|
