/external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d11/ |
H A D | InputLayoutCache.h | 56 InputLayoutElement elements[gl::MAX_VERTEX_ATTRIBS]; member in struct:rx::InputLayoutCache::InputLayoutKey 65 return reinterpret_cast<const char*>(&elements[elementCount]);
|
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d9/ |
H A D | VertexDeclarationCache.cpp | 92 D3DVERTEXELEMENT9 elements[gl::MAX_VERTEX_ATTRIBS + 1]; local 93 D3DVERTEXELEMENT9 *element = &elements[0]; 182 if (memcmp(entry->cachedElements, elements, (element - elements) * sizeof(D3DVERTEXELEMENT9)) == 0 && entry->vertexDeclaration) 212 memcpy(lastCache->cachedElements, elements, (element - elements) * sizeof(D3DVERTEXELEMENT9)); 213 HRESULT result = device->CreateVertexDeclaration(elements, &lastCache->vertexDeclaration);
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uhash.h | 23 * storage space. As elements are added to it, it grows to accomodate 24 * them. By default, the table never shrinks, even if all elements 91 /* Reorder these elements to pack nicely if necessary */ 135 UHashElement *elements; member in struct:UHashtable 270 * before any elements are added to the hashtable and should not be 283 * once before any elements are added to the hashtable and should not 488 * Iterate through the elements of a UHashtable. The caller must not
|
H A D | uvector.h | 57 * zero, then it is assumed that the caller will delete elements as 86 UElement* elements; member in class:UVector 111 * equal if they are of the same size and all elements are equal, 178 * elements for i >= newSize. If newSize is larger, grow the 184 * Fill in the given array with all elements of this vector. 210 * Returns true if this vector contains none of the elements 219 * as defined by 'compare'. The current elements are assumed to 226 * as defined by 'compare'. The current elements are assumed to
|
H A D | 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[coun [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/progs/d3d10tri/ |
H A D | d3d10tri.cpp | 64 D3D10_INPUT_ELEMENT_DESC elements[] = local 70 ensure(dev->CreateInputLayout(elements, sizeof(elements) / sizeof(elements[0]), g_vs, sizeof(g_vs), &layout));
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/progs/d3d11tri/ |
H A D | 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/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | link_uniform_initializers.cpp | 53 const unsigned int elements) 55 for (unsigned int i = 0; i < elements; i++) { 123 const unsigned int elements = val->array_elements[0]->type->components(); local 131 elements); 133 idx += elements; 50 copy_constant_to_storage(union gl_constant_value *storage, const ir_constant *val, const enum glsl_base_type base_type, const unsigned int elements) argument
|
/external/chromium_org/third_party/mesa/src/src/glsl/tests/ |
H A D | set_uniform_initializer_tests.cpp | 96 * \param type Type for the elements of the actual storage slot 105 const unsigned elements = MAX2(1, array_size); local 106 const unsigned data_components = elements * type->components(); 322 /* The constant value generated may have more array elements than the 325 * elements are not used. In this case, the type of the uniform will be
|
/external/chromium_org/ui/base/l10n/ |
H A D | l10n_util_collator.h | 62 // Sorts the objects in |elements| using the method |method|, which must return 67 std::vector<T*>* elements, 73 sort(elements->begin(), elements->end(), 78 std::sort(elements->begin(), elements->end(), 82 // Compares two elements' string keys and returns true if the first element's 121 // In place sorting of |elements| of a vector according to the string key of 123 // |begin_index| points to the start position of elements in the vector which 124 // want to be sorted. |end_index| points to the end position of elements i 66 SortStringsUsingMethod(const std::string& locale, std::vector<T*>* elements, Method method) argument 127 SortVectorWithStringKey(const std::string& locale, std::vector<Element>* elements, unsigned int begin_index, unsigned int end_index, bool needs_stable_sort) argument 150 SortVectorWithStringKey(const std::string& locale, std::vector<Element>* elements, bool needs_stable_sort) argument [all...] |
/external/chromium_org/ui/gl/android/ |
H A D | surface_texture.cc | 84 jfloat* elements = env->GetFloatArrayElements(jmatrix.obj(), &is_copy); local 86 mtx[i] = static_cast<float>(elements[i]); 88 env->ReleaseFloatArrayElements(jmatrix.obj(), elements, JNI_ABORT);
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-unique.cc | 381 static UniqueSet<T>* MakeSet(Zone* zone, int which, Unique<T>* elements) { argument 384 if ((which & (1 << i)) != 0) set->Add(elements[i], zone); 399 Unique<String> elements[] = { local 403 // Exhaustively test all sets with <= 6 elements. 406 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); 407 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); 463 Unique<String> elements[] = { local 467 // Exhaustively test all sets with <= 6 elements. 470 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); 471 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); 531 Unique<String> elements[] = { local [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/annotation/ |
H A D | Annotation.java | 43 private final TreeMap<CstString, NameValuePair> elements; field in class:Annotation 46 * Construct an instance. It initially contains no elements. 62 this.elements = new TreeMap<CstString, NameValuePair>(); 79 return elements.equals(otherAnnotation.elements); 85 hash = (hash * 31) + elements.hashCode(); 104 Iterator<NameValuePair> thisIter = elements.values().iterator(); 105 Iterator<NameValuePair> otherIter = other.elements.values().iterator(); 142 for (NameValuePair pair : elements.values()) { 189 elements [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ObjectArrays.java | 61 * @param first the first array of elements to concatenate 62 * @param second the second array of elements to concatenate 77 * @param array the array of elements to append 80 * elements of {@code array} occupying the remaining elements. 92 * @param array the array of elements to prepend 113 * Returns an array containing all of the elements in the specified 120 * the array has more elements than the collection), the element in the array 123 * the caller knows that the collection does not contain any null elements. 125 * <p>This method returns the elements i 166 fillArray(Iterable<?> elements, Object[] array) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | 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) { 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...] |
H A D | ObjectArrays.java | 50 * @param array the array of elements to append 53 * elements of {@code array} occupying the remaining elements. 65 * @param array the array of elements to prepend 86 * Returns an array containing all of the elements in the specified 93 * the array has more elements than the collection), the element in the array 96 * the caller knows that the collection does not contain any null elements. 98 * <p>This method returns the elements in the order they are returned by the 103 * @param c the collection for which to return an array of elements 104 * @param array the array in which to place the collection elements 139 fillArray(Iterable<?> elements, Object[] array) argument [all...] |
/external/guava/guava-gwt/src-super/java/util/super/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 137 public Enumeration<V> elements() { method in class:ConcurrentHashMap
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | MapGenerators.java | 48 @Override protected Set<String> create(String[] elements) { argument 50 for (String key : elements) { 66 public Collection<String> create(Object... elements) { argument 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) { argument 130 for (int i = 0; i < elements 88 create( UnhashableObject[] elements) argument [all...] |
H A D | SortedMapGenerators.java | 59 @Override protected Set<String> create(String[] elements) { argument 61 for (String key : elements) { 81 public Collection<String> create(Object... elements) { argument 83 for (int i = 0; i < elements.length; i++) { 84 builder.put(i, toStringOrNull(elements[i])); 128 @Override protected Set<String> create(String[] elements) { argument 131 for (String key : elements) { 152 public Collection<String> create(Object... elements) { argument 155 for (int i = 0; i < elements.length; i++) { 156 builder.put(i, toStringOrNull(elements[ [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | CollectionIteratorTester.java | 96 IteratorTester.KnownOrder knownOrder, Iterable<E> elements) { 97 new IteratorTester<E>(Platform.collectionIteratorTesterNumIterations(), features, elements, 109 @Override protected void verify(List<E> elements) { 110 expectContents(elements); 95 runIteratorTest(Set<IteratorFeature> features, IteratorTester.KnownOrder knownOrder, Iterable<E> elements) argument
|
/external/guava/guava-tests/test/com/google/common/primitives/ |
H A D | ByteArrayAsListTest.java | 85 @Override protected List<Byte> create(Byte[] elements) { argument 86 return asList(elements); 91 @Override protected List<Byte> create(Byte[] elements) { argument 93 Byte[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Byte> create(Byte[] elements) { argument 101 Byte[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Byte> create(Byte[] elements) { argument 110 Byte[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Byte[] elements) argument [all...] |
H A D | CharArrayAsListTest.java | 85 @Override protected List<Character> create(Character[] elements) { argument 86 return asList(elements); 91 @Override protected List<Character> create(Character[] elements) { argument 93 Character[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Character> create(Character[] elements) { argument 101 Character[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Character> create(Character[] elements) { argument 110 Character[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Character[] elements) argument [all...] |
H A D | DoubleArrayAsListTest.java | 85 @Override protected List<Double> create(Double[] elements) { argument 86 return asList(elements); 91 @Override protected List<Double> create(Double[] elements) { argument 93 Double[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Double> create(Double[] elements) { argument 101 Double[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Double> create(Double[] elements) { argument 110 Double[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Double[] elements) argument [all...] |
H A D | FloatArrayAsListTest.java | 85 @Override protected List<Float> create(Float[] elements) { argument 86 return asList(elements); 91 @Override protected List<Float> create(Float[] elements) { argument 93 Float[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Float> create(Float[] elements) { argument 101 Float[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Float> create(Float[] elements) { argument 110 Float[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Float[] elements) argument [all...] |
H A D | IntArrayAsListTest.java | 86 @Override protected List<Integer> create(Integer[] elements) { argument 87 return asList(elements); 92 @Override protected List<Integer> create(Integer[] elements) { argument 94 Integer[] all = concat(elements, suffix); 95 return asList(all).subList(0, elements.length); 100 @Override protected List<Integer> create(Integer[] elements) { argument 102 Integer[] all = concat(prefix, elements); 103 return asList(all).subList(2, elements.length + 2); 108 @Override protected List<Integer> create(Integer[] elements) { argument 111 Integer[] all = concat(concat(prefix, elements), suffi 131 create(Object... elements) argument 144 create(Integer[] elements) argument [all...] |