| /external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11tri/ |
| d3d11tri.cpp | 64 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/ |
| GrClipMaskManager.h | 107 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/remoting/webapp/ |
| l10n.js | 59 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/ |
| resource_request_body.h | 41 const std::vector<Element>* elements() const { return &elements_; } function in class:webkit_glue::ResourceRequestBody
43 void swap_elements(std::vector<Element>* elements) {
44 elements_.swap(*elements);
|
| /external/guava/guava/src/com/google/common/collect/ |
| HashMultiset.java | 47 * 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) {
66 create(Multisets.inferDistinctElements(elements));
67 Iterables.addAll(multiset, elements);
80 * @serialData the number of distinct elements, the first element, its count
[all...] |
| LinkedHashMultiset.java | 29 * 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);
[all...] |
| ImmutableSortedMultiset.java | 31 * 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 sorted by their natura
575 Object[] elements; field in class:ImmutableSortedMultiset.SerializedForm
[all...] |
| /external/guava/guava-gwt/src/com/google/common/collect/ |
| ImmutableAsList_CustomFieldSerializer.java | 43 List<Object> elements = new ArrayList<Object>(); local
44 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
45 ImmutableList<Object> asImmutableList = ImmutableList.copyOf(elements);
|
| RegularImmutableSortedSet_CustomFieldSerializer.java | 48 List<Object> elements = new ArrayList<Object>(); local
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/ |
| EnumMultiset.java | 38 * 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) {
47 Iterator<E> iterator = elements.iterator();
50 Iterables.addAll(multiset, elements);
|
| /packages/inputmethods/LatinIME/tools/make-keyboard-text/src/com/android/inputmethod/keyboard/tools/ |
| ArrayInitializerFormatter.java | 46 final String[] elements = mBuffer.toString().split(" "); local
49 mIndent, mBufferedIndex, elements[0],
50 mIndent, lastIndex, elements[1]);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/common/layout/ |
| BaseLayoutRuleTest.java | 42 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local
52 return elements;
57 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local
60 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements);
70 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local
75 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements);
103 * Test {@link BaseLayoutRule#collectIds}: Check that with multiple elements and
109 IDragElement[] elements = createSampleElements(); local
110 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements);
128 IDragElement[] elements = createSampleElements() local
150 IDragElement[] elements = createSampleElements(); local
[all...] |
| /external/icu4c/common/ |
| bytestriebuilder.cpp | 128 : 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[i].getString(*strings)
[all...] |
| ucharstriebuilder.cpp | 87 : 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[i].getString(strings)
[all...] |
| uvectr32.h | 67 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 (index >= 0 && count > 0 && count - index > 0) ? elements[index] : 0;
228 elements[count] = elem;
237 int32_t *rp = elements+count;
248 return elements+count-size
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTreeWizard.java | 131 final List elements = new ArrayList(); local
134 elements.add(t);
137 String found = elements.toString();
145 final List elements = new ArrayList(); local
149 elements.add(t);
152 String found = elements.toString();
160 final List elements = new ArrayList(); local
164 elements.add(t);
167 String found = elements.toString();
175 final List elements = new ArrayList() local
190 final List elements = new ArrayList(); local
207 final List elements = new ArrayList(); local
224 final List elements = new ArrayList(); local
239 final List elements = new ArrayList(); local
256 final List elements = new ArrayList(); local
396 List elements = subtrees; local
[all...] |
| /external/javassist/src/main/javassist/bytecode/annotation/ |
| ArrayMemberValue.java | 45 * @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) {
106 values = elements;
107 if (elements != null && elements.length > 0)
108 type = elements[0]
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| FrameLayoutRule.java | 56 final @Nullable IDragElement[] elements) {
57 if (elements.length == 0) {
65 drawFeedback(gc, node, elements, feedback);
73 IDragElement[] elements,
90 Rect be = elements[0].getBounds();
95 // for all dropped elements with valid bounds, offset at
97 for (IDragElement it : elements) {
106 // We don't have bounds for new elements. In this case
119 public DropFeedback onDropMove(@NonNull INode targetNode, @NonNull IDragElement[] elements,
127 public void onDropLeave(@NonNull INode targetNode, @NonNull IDragElement[] elements,
[all...] |
| /external/chromium_org/chrome_frame/ |
| urlmon_upload_data_stream.cc | 17 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/ |
| unittest_utils.cc | 111 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/ |
| uvectr32.h | 67 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+count-size
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| ucol_cnt.cpp | 60 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[i]->position
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| opt-elements-kind.js | 32 // assumptions made about how elements transitions work because transition stubs
52 fast_smi_only : 'fast smi only elements',
53 fast : 'fast elements',
54 fast_double : 'fast double elements',
55 dictionary : 'dictionary elements',
56 external_byte : 'external byte elements',
57 external_unsigned_byte : 'external unsigned byte elements',
58 external_short : 'external short elements',
59 external_unsigned_short : 'external unsigned short elements',
60 external_int : 'external int elements',
[all...] |
| osr-elements-kind.js | 32 // assumptions made about how elements transitions work because transition stubs
52 fast_smi_only : 'fast smi only elements',
53 fast : 'fast elements',
54 fast_double : 'fast double elements',
55 dictionary : 'dictionary elements',
56 external_byte : 'external byte elements',
57 external_unsigned_byte : 'external unsigned byte elements',
58 external_short : 'external short elements',
59 external_unsigned_short : 'external unsigned short elements',
60 external_int : 'external int elements',
[all...] |
| /external/icu4c/i18n/ |
| ucol_cnt.cpp | 60 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[i]->position
[all...] |
