Searched refs:elements (Results 151 - 175 of 1018) sorted by relevance

1234567891011>>

/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DOneSizeGenerator.java55 public T create(Object... elements) { argument
56 return generator.create(elements);
66 Collection<E> elements = getSampleElements(
68 return generator.create(elements.toArray());
H A DTestContainerGenerator.java25 * elements. Such things include both {@link Collection} and {@link Map}; since
35 * Returns the sample elements that this generate populates its container
41 * Creates a new container containing the given elements. TODO: would be nice
45 T create(Object ... elements); argument
54 * Returns the iteration ordering of elements, given the order in
H A DTestStringSortedSetGenerator.java33 @Override protected abstract SortedSet<String> create(String[] elements); argument
35 /** Sorts the elements by their natural ordering. */
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DTestMultisetGenerator.java24 * Creates multisets, containing sample elements, to be tested.
31 Multiset<E> create(Object... elements); argument
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d10tri/
H A Dd3d10tri.cpp64 D3D10_INPUT_ELEMENT_DESC elements[] = local
70 ensure(dev->CreateInputLayout(elements, sizeof(elements) / sizeof(elements[0]), g_vs, sizeof(g_vs), &layout));
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11tri/
H A Dd3d11tri.cpp64 D3D11_INPUT_ELEMENT_DESC elements[] = local
71 ensure(dev->CreateInputLayout(elements, sizeof(elements) / sizeof(elements[0]), g_vs, sizeof(g_vs), &layout));
/external/skia/src/gpu/
H A DGrClipMaskManager.h107 const GrReducedClip::ElementList& elements,
110 // Creates an alpha mask of the clip. The mask is a rasterization of elements through the
114 const GrReducedClip::ElementList& elements,
119 const GrReducedClip::ElementList& elements,
129 bool useSWOnlyPath(const GrReducedClip::ElementList& elements);
/external/chromium_org/net/base/
H A Dupload_data.h50 const ScopedVector<UploadElement>& elements() const { function in class:net::UploadData
58 void swap_elements(ScopedVector<UploadElement>* elements) { argument
59 elements_.swap(*elements);
/external/chromium_org/remoting/webapp/
H A Dl10n.js59 var elements = document.querySelectorAll('[i18n-content]');
60 for (var i = 0; i < elements.length; ++i) {
61 /** @type {Element} */ var element = elements[i];
/external/chromium_org/webkit/common/
H A Dresource_request_body.h41 const std::vector<Element>* elements() const { return &elements_; } function in class:webkit_glue::ResourceRequestBody
43 void swap_elements(std::vector<Element>* elements) { argument
44 elements_.swap(*elements);
/external/guava/guava/src/com/google/common/collect/
H A DHashMultiset.java47 * number of distinct elements.
49 * @param distinctElements the expected number of distinct elements
57 * Creates a new {@code HashMultiset} containing the specified elements.
59 * <p>This implementation is highly efficient when {@code elements} is itself
62 * @param elements the elements that the multiset should contain
64 public static <E> HashMultiset<E> create(Iterable<? extends E> elements) { argument
66 create(Multisets.inferDistinctElements(elements));
67 Iterables.addAll(multiset, elements);
80 * @serialData the number of distinct elements, th
[all...]
H A DLinkedHashMultiset.java29 * iterator orders elements according to when the first occurrence of the
53 * number of distinct elements.
55 * @param distinctElements the expected number of distinct elements
63 * Creates a new {@code LinkedHashMultiset} containing the specified elements.
65 * <p>This implementation is highly efficient when {@code elements} is itself
68 * @param elements the elements that the multiset should contain
71 Iterable<? extends E> elements) {
73 create(Multisets.inferDistinctElements(elements));
74 Iterables.addAll(multiset, elements);
70 create( Iterable<? extends E> elements) argument
[all...]
H A DImmutableSortedMultiset.java31 * An immutable {@code SortedMultiset} that stores its elements in a sorted array. Some instances
33 * elements. Either way, null elements are not supported.
49 * {@code ImmutableSortedMultiset} doesn't use {@link Object#equals} to determine if two elements
51 * elements {@code x} and {@code y} are equivalent:
57 * With natural ordering of elements, the following relation determines whether two elements are
101 * Returns an immutable sorted multiset containing the given elements sorted by their natural
112 * Returns an immutable sorted multiset containing the given elements sorted by their natural
123 * Returns an immutable sorted multiset containing the given elements sorte
174 copyOf(E[] elements) argument
200 copyOf(Iterable<? extends E> elements) argument
218 copyOf(Iterator<? extends E> elements) argument
232 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
248 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
532 add(E... elements) argument
545 addAll(Iterable<? extends E> elements) argument
558 addAll(Iterator<? extends E> elements) argument
575 Object[] elements; field in class:ImmutableSortedMultiset.SerializedForm
[all...]
/external/guava/guava-gwt/src/com/google/common/collect/
H A DImmutableAsList_CustomFieldSerializer.java43 List<Object> elements = new ArrayList<Object>();
44 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
45 ImmutableList<Object> asImmutableList = ImmutableList.copyOf(elements);
H A DRegularImmutableSortedSet_CustomFieldSerializer.java48 List<Object> elements = new ArrayList<Object>();
49 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
53 * RegularImmutableSortedSet always have one or more elements,
57 ImmutableSortedSet.copyOf(comparator, elements);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DEnumMultiset.java38 * Creates a new {@code EnumMultiset} containing the specified elements.
40 * <p>This implementation is highly efficient when {@code elements} is itself a {@link
43 * @param elements the elements that the multiset should contain
44 * @throws IllegalArgumentException if {@code elements} is empty
46 public static <E extends Enum<E>> EnumMultiset<E> create(Iterable<E> elements) { argument
47 Iterator<E> iterator = elements.iterator();
50 Iterables.addAll(multiset, elements);
/external/icu4c/common/
H A Dbytestriebuilder.cpp128 : strings(NULL), elements(NULL), elementsCapacity(0), elementsLength(0),
141 delete[] elements;
151 // Cannot add elements after building.
168 uprv_memcpy(newElements, elements, elementsLength*sizeof(BytesTrieElement));
170 delete[] elements;
171 elements=newElements;
174 elements[elementsLength++].setTo(s, value, *strings, errorCode);
230 uprv_sortArray(elements, elementsLength, (int32_t)sizeof(BytesTrieElement),
238 StringPiece prev=elements[0].getString(*strings);
240 StringPiece current=elements[
[all...]
H A Ducharstriebuilder.cpp87 : elements(NULL), elementsCapacity(0), elementsLength(0),
91 delete[] elements;
101 // Cannot add elements after building.
118 uprv_memcpy(newElements, elements, elementsLength*sizeof(UCharsTrieElement));
120 delete[] elements;
121 elements=newElements;
124 elements[elementsLength++].setTo(s, value, strings, errorCode);
187 uprv_sortArray(elements, elementsLength, (int32_t)sizeof(UCharsTrieElement),
195 UnicodeString prev=elements[0].getString(strings);
197 UnicodeString current=elements[
[all...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTreeWizard.java131 final List elements = new ArrayList();
134 elements.add(t);
137 String found = elements.toString();
145 final List elements = new ArrayList();
149 elements.add(t);
152 String found = elements.toString();
160 final List elements = new ArrayList();
164 elements.add(t);
167 String found = elements.toString();
175 final List elements
[all...]
/external/javassist/src/main/javassist/bytecode/annotation/
H A DArrayMemberValue.java45 * @param t the type of the array elements.
58 "no array elements found: " + method.getName());
87 * Obtains the type of the elements.
96 * Obtains the elements of the array.
103 * Sets the elements of the array.
105 public void setValue(MemberValue[] elements) { argument
106 values = elements;
107 if (elements != null && elements.length > 0)
108 type = elements[
[all...]
/external/chromium_org/chrome_frame/
H A Durlmon_upload_data_stream.cc17 const ScopedVector<net::UploadElement>& elements = upload_data->elements(); local
24 for (size_t i = 0; i < elements.size(); ++i) {
25 const net::UploadElement& element = *elements[i];
27 i == elements.size() - 1 && upload_data->last_chunk_appended();
35 for (size_t i = 0; i < elements.size(); ++i) {
36 const net::UploadElement& element = *elements[i];
/external/chromium_org/ppapi/shared_impl/
H A Dunittest_utils.cc111 if (expected_var->elements().size() != actual_var->elements().size()) {
112 LOG(ERROR) << "expected: " << expected_var->elements().size() <<
113 " actual: " << actual_var->elements().size();
116 for (size_t i = 0; i < expected_var->elements().size(); ++i) {
117 if (!Equals(expected_var->elements()[i].get(),
118 actual_var->elements()[i].get(),
/external/chromium_org/third_party/icu/source/common/
H A Duvectr32.h67 int32_t* elements; member in class:UVector32
84 * equal if they are of the same size and all elements are equal,
137 * elements for i >= newSize. If newSize is larger, grow the
147 * Returns true if this vector contains none of the elements
157 * The current elements are assumed to be sorted already.
170 * Units are vector elements (32 bits each), not bytes.
222 return (0 <= index && index < count) ? elements[index] : 0;
228 elements[count] = elem;
237 int32_t *rp = elements+count;
248 return elements
[all...]
H A Duvectr64.h66 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[coun
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Ducol_cnt.cpp60 tbl->elements = (ContractionTable **)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(ContractionTable *));
61 if(tbl->elements == NULL) {
67 uprv_memset(tbl->elements, 0, INIT_EXP_TABLE_SIZE*sizeof(ContractionTable *));
98 table->elements[table->size] = el;
100 //uhash_put(table->elements, (void *)table->size, el, status);
107 /* table->elements = (ContractionTable **)realloc(table->elements, table->capacity*2*sizeof(ContractionTable *));*/
113 ContractionTable **oldElements = table->elements;
117 table->elements = newElements;
151 table->position += table->elements[
[all...]

Completed in 769 milliseconds

1234567891011>>