Searched refs:elements (Results 26 - 50 of 1018) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DRewriteRuleElementStream.js1 /** 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 = [];
67 this.elements
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duvector.cpp32 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[
[all...]
H A Duvectr32.cpp31 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[
[all...]
H A Duvectr64.cpp28 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[
[all...]
/external/chromium-trace/trace-viewer/src/
H A Dui.js10 * Decorates elements as an instance of a class.
13 * elements to decorate.
18 var elements;
20 elements = base.doc.querySelectorAll(source);
22 elements = [source];
24 for (var i = 0, el; el = elements[i]; i++) {
80 * You will need to call the parent elements decorate method from within
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DImmutableSet.java51 // Casting to any type is safe because the set will never hold any elements.
92 @Deprecated public static <E> ImmutableSet<E> of(E[] elements) { argument
93 return copyOf(elements);
96 public static <E> ImmutableSet<E> copyOf(E[] elements) { argument
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) { argument
109 Iterable<? extends E> iterable = elements;
113 copyOf(Iterable<? extends E> elements) argument
123 copyOf(Iterator<? extends E> elements) argument
155 create(E... elements) argument
196 add(E... elements) argument
203 addAll(Iterable<? extends E> elements) argument
212 addAll(Iterator<? extends E> elements) argument
[all...]
/external/icu4c/common/
H A Duvectr32.cpp31 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[
[all...]
H A Duvectr64.cpp28 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[
[all...]
/external/chromium_org/ppapi/tests/
H A Dtest_resource_array.cc61 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/
H A DSetGenerators.java57 @Override protected Set<String> create(String[] elements) { argument
58 return ImmutableSet.copyOf(elements);
69 public Set<Object> create(Object... elements) { argument
70 return ImmutableSet.copyOf(elements);
79 @Override protected Set<String> create(String[] elements) { argument
81 ImmutableSet.of(elements[0], elements[0]);
87 @Override protected SortedSet<String> create(String[] elements) { argument
88 return ImmutableSortedSet.copyOf(elements);
94 @Override protected SortedSet<String> create(String[] elements) { argument
104 create(String[] elements) argument
114 create(String[] elements) argument
129 create(String[] elements) argument
147 create(String[] elements) argument
162 create(String[] elements) argument
176 create( UnhashableObject[] elements) argument
184 create(String[] elements) argument
191 create(String[] elements) argument
201 create(String[] elements) argument
215 create(String[] elements) argument
228 create(String[] elements) argument
248 createExplicitComparator( String[] elements) argument
[all...]
/external/flac/libFLAC/
H A Dmemory.c74 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer) argument
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) argument
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) argument
140 FLAC__ASSERT(elements >
161 FLAC__memory_alloc_aligned_unsigned_array(unsigned elements, unsigned **unaligned_pointer, unsigned **aligned_pointer) argument
192 FLAC__memory_alloc_aligned_real_array(unsigned elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer) argument
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
H A DArrayUtils.java36 * 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];
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;
/external/guava/guava/src/com/google/common/collect/
H A DSortedIterables.java42 * Returns {@code true} if {@code elements} is a sorted collection using an ordering equivalent
45 public static boolean hasSameComparator(Comparator<?> comparator, Iterable<?> elements) { argument
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);
68 sortedUnique( Comparator<? super E> comparator, Iterator<E> elements) argument
80 sortedUnique( Comparator<? super E> comparator, Iterable<E> elements) argument
122 sortedCounts( Comparator<? super E> comparator, Iterator<E> elements) argument
133 sortedCounts( Comparator<? super E> comparator, Iterable<E> elements) argument
[all...]
H A DQueues.java70 * Creates an {@code ConcurrentLinkedQueue} instance containing the given elements.
72 * @param elements the elements that the queue should contain, in order
73 * @return a new {@code ConcurrentLinkedQueue} containing those elements
76 Iterable<? extends E> elements) {
77 if (elements instanceof Collection) {
78 return new ConcurrentLinkedQueue<E>(Collections2.cast(elements));
81 Iterables.addAll(queue, elements);
110 * Creates an {@code LinkedBlockingQueue} instance containing the given elements.
112 * @param elements th
75 newConcurrentLinkedQueue( Iterable<? extends E> elements) argument
115 newLinkedBlockingQueue(Iterable<? extends E> elements) argument
143 newPriorityBlockingQueue( Iterable<? extends E> elements) argument
170 newPriorityQueue(Iterable<? extends E> elements) argument
[all...]
/external/chromium_org/chrome/browser/ui/webui/options/
H A Dsettings_format_browsertest.js122 var elements = document.querySelectorAll(query);
123 assertTrue(elements.length > 0);
124 for (var i = 0; i < elements.length; i++) {
125 var element = elements[i];
136 var elements = document.querySelectorAll(query);
137 for (var i = 0; i < elements.length; i++) {
138 var element = elements[i];
148 var elements = document.querySelectorAll('input[type=radio]');
149 for (var i = 0; i < elements.length; i++) {
150 var element = elements[
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DSetEqualsTester.java39 "A Set should equal any other Set containing the same elements.",
45 Collection<E> elements = getSampleElements(getNumElements() - 1);
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);
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 ar
[all...]
/external/chromium_org/chrome/browser/bookmarks/
H A Dbookmark_node_data_views.cc29 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();
/external/guava/guava-tests/test/com/google/common/collect/
H A DMultisetCollectionTest.java69 protected Multiset<String> create(String[] elements) {
70 return TreeMultiset.create(Arrays.asList(elements));
88 protected Multiset<String> create(String[] elements) {
90 result.addAll(Arrays.asList(elements));
148 @Override protected Multiset<String> create(String[] elements) {
149 return HashMultiset.create(asList(elements));
156 @Override protected Multiset<String> create(String[] elements) {
158 TreeMultiset.create(asList(elements)));
169 @Override protected Multiset<String> create(String[] elements) {
171 TreeMultiset.create(asList(elements)));
[all...]
/external/libffi/testsuite/libffi.call/
H A Dpyobjc-tc.c50 point_type.elements = malloc(3 * sizeof(ffi_type*));
51 point_type.elements[0] = &ffi_type_float;
52 point_type.elements[1] = &ffi_type_float;
53 point_type.elements[2] = NULL;
58 size_type.elements = malloc(3 * sizeof(ffi_type*));
59 size_type.elements[0] = &ffi_type_float;
60 size_type.elements[1] = &ffi_type_float;
61 size_type.elements[2] = NULL;
66 rect_type.elements = malloc(3 * sizeof(ffi_type*));
67 rect_type.elements[
[all...]
/external/mockito/src/org/mockito/internal/util/collections/
H A DSets.java27 public static <T> Set<T> newSet(T ... elements) { argument
28 if (elements == null) {
29 throw new IllegalArgumentException("Expected an array of elements (or empty array) but received a null.");
31 return new LinkedHashSet<T>(asList(elements));
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_pasteboard_helper_mac.h17 // Writes a set of bookmark elements from a profile to the general pasteboard.
19 void WriteToClipboard(const std::vector<BookmarkNodeData::Element>& elements,
22 // Writes a set of bookmark elements from a profile to the dragging pasteboard
25 const std::vector<BookmarkNodeData::Element>& elements,
28 // Reads a set of bookmark elements from the general copy/paste clipboard.
29 bool ReadFromClipboard(std::vector<BookmarkNodeData::Element>& elements,
32 // Reads a set of bookmark elements from the drag and drop clipboard.
33 bool ReadFromDragClipboard(std::vector<BookmarkNodeData::Element>& elements,
37 // bookmark elements. It currently does not consider a plaintext url a
42 // elements
[all...]
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DIntSet.java55 * Returns the count of unique elements in this set.
57 * @return {@code > = 0;} count of unique elements
59 int elements(); method in interface:IntSet
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DMinimalIterable.java53 * Returns an iterable whose iterator returns the given elements in order.
55 public static <E> MinimalIterable<E> of(E... elements) { argument
57 return new MinimalIterable<E>(Arrays.asList(elements).iterator());
61 * Returns an iterable whose iterator returns the given elements in order.
62 * The elements are copied out of the source collection at the time this
66 public static <E> MinimalIterable<E> from(final Collection<E> elements) { argument
67 return (MinimalIterable) of(elements.toArray());
H A DTestEnumSetGenerator.java39 public Set<AnEnum> create(Object... elements) { argument
40 AnEnum[] array = new AnEnum[elements.length];
42 for (Object e : elements) {
48 protected abstract Set<AnEnum> create(AnEnum[] elements); argument
H A DTestListGenerator.java22 * Creates sets, containing sample elements, to be tested.
30 List<E> create(Object... elements); argument

Completed in 1356 milliseconds

1234567891011>>