/external/guava/guava-tests/test/com/google/common/primitives/ |
H A D | LongArrayAsListTest.java | 85 @Override protected List<Long> create(Long[] elements) { argument 86 return asList(elements); 91 @Override protected List<Long> create(Long[] elements) { argument 93 Long[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Long> create(Long[] elements) { argument 101 Long[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Long> create(Long[] elements) { argument 110 Long[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Long[] elements) argument [all...] |
H A D | ShortArrayAsListTest.java | 85 @Override protected List<Short> create(Short[] elements) { argument 86 return asList(elements); 91 @Override protected List<Short> create(Short[] elements) { argument 93 Short[] all = concat(elements, suffix); 94 return asList(all).subList(0, elements.length); 99 @Override protected List<Short> create(Short[] elements) { argument 101 Short[] all = concat(prefix, elements); 102 return asList(all).subList(2, elements.length + 2); 107 @Override protected List<Short> create(Short[] elements) { argument 110 Short[] all = concat(concat(prefix, elements), suffi 130 create(Object... elements) argument 143 create(Short[] elements) argument [all...] |
/external/icu/icu4c/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/icu/icu4c/source/i18n/ |
H A D | collationrootelements.h | 25 * Container and access methods for collation elements and weights 34 : elements(rootElements), length(rootElementsLength) {} 54 * Same as the start of the compact root elements table. 79 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX]. 91 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; 98 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; 105 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; 113 return (elements[IX_SEC_TER_BOUNDARIE 247 const uint32_t *elements; member in class:CollationRootElements [all...] |
/external/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/components/bookmarks/browser/ |
H A D | bookmark_utils_unittest.cc | 471 std::vector<BookmarkNodeData::Element> elements; local 473 elements.push_back(node_data); 475 CloneBookmarkNode(model.get(), elements, folder, 0, false);
|
/external/chromium_org/content/common/ |
H A D | page_state_serialization.h | 36 std::vector<ExplodedHttpBodyElement> elements; member in struct:content::ExplodedHttpBody
|
/external/chromium_org/gpu/command_buffer/client/ |
H A D | transfer_buffer.h | 188 T* elements() { function in class:gpu::ScopedTransferBufferArray
|
/external/chromium_org/mojo/android/javatests/src/org/chromium/mojo/ |
H A D | HandleMock.java | 97 public int readData(ByteBuffer elements, argument 125 public int writeData(ByteBuffer elements, argument
|
/external/chromium_org/mojo/public/cpp/system/ |
H A D | data_pipe.h | 68 const void* elements, 71 return MojoWriteData(data_pipe_producer.value(), elements, num_bytes, flags); 88 void* elements, 91 return MojoReadData(data_pipe_consumer.value(), elements, num_bytes, flags); 67 WriteDataRaw(DataPipeProducerHandle data_pipe_producer, const void* elements, uint32_t* num_bytes, MojoWriteDataFlags flags) argument 87 ReadDataRaw(DataPipeConsumerHandle data_pipe_consumer, void* elements, uint32_t* num_bytes, MojoReadDataFlags flags) argument
|
/external/chromium_org/mojo/system/ |
H A D | core_unittest.cc | 1070 char elements[2] = {'A', 'B'}; local 1074 UserPointer<const void>(elements), 1088 elements[0] = -1; 1089 elements[1] = -1; 1093 UserPointer<void>(elements), 1096 EXPECT_EQ('A', elements[0]); 1097 EXPECT_EQ(-1, elements[1]); 1111 elements[0] = 'X'; 1115 UserPointer<const void>(elements),
|
H A D | data_pipe_consumer_dispatcher.cc | 54 UserPointer<void> elements, 63 DVLOG_IF(2, !elements.IsNull()) 64 << "Discard mode: ignoring non-null |elements|"; 71 DVLOG_IF(2, !elements.IsNull()) 72 << "Query mode: ignoring non-null |elements|"; 77 elements, num_bytes, (flags & MOJO_READ_DATA_FLAG_ALL_OR_NONE)); 53 ReadDataImplNoLock( UserPointer<void> elements, UserPointer<uint32_t> num_bytes, MojoReadDataFlags flags) argument
|
H A D | data_pipe_producer_dispatcher.cc | 54 UserPointer<const void> elements, 59 elements, num_bytes, (flags & MOJO_WRITE_DATA_FLAG_ALL_OR_NONE)); 53 WriteDataImplNoLock( UserPointer<const void> elements, UserPointer<uint32_t> num_bytes, MojoWriteDataFlags flags) argument
|
/external/chromium_org/third_party/WebKit/Source/core/plugins/ |
H A D | PluginOcclusionSupport.cpp | 45 // This file provides a utility function to support rendering certain elements above plugins. 85 // The 0'th elements of these RenderObject arrays represent the plugin node and 149 // page. In a nutshell, iframe elements should occlude plugins when 190 // Occlusions by top layer elements. 197 const WillBeHeapVector<RefPtrWillBeMember<Element> >& elements = document->topLayerElements(); local 198 size_t start = ancestor ? elements.find(ancestor) + 1 : 0; 199 for (size_t i = start; i < elements.size(); ++i) 200 addTreeToOcclusions(elements[i]->renderer(), frameRect, occlusions);
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | WebSearchableFormData.cpp | 203 const FormAssociatedElement::List& elements = form->associatedElements(); local 204 for (FormAssociatedElement::List::const_iterator i(elements.begin()); i != elements.end(); ++i) { 252 // Need a valid encoding to encode the form elements.
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/vl/ |
H A D | vl_vertex_buffers.c | 145 vl_vb_element_helper(struct pipe_vertex_element* elements, unsigned num_elements, argument 150 assert(elements && num_elements); 153 elements[i].src_offset = offset; 154 elements[i].instance_divisor = 1; 155 elements[i].vertex_buffer_index = vertex_buffer_index; 156 offset += util_format_get_blocksize(elements[i].src_format);
|
/external/chromium_org/third_party/mesa/src/src/mesa/vbo/ |
H A D | vbo_primitive_restart.c | 74 * Scan the elements array to find restart indexes. Return an array 79 find_sub_primitives(const void *elements, unsigned element_size, argument 101 #define IB_INDEX_READ(TYPE, INDEX) (((const GL##TYPE *) elements)[INDEX])
|
/external/chromium_org/third_party/skia/tests/ |
H A D | LListTest.cpp | 36 ListElement elements[4]) { 42 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); 43 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); 44 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); 45 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); 51 ListElement elements[4] = { local 59 check_list(list, reporter, true, 0, false, false, false, false, elements); 61 list.addToHead(&elements[0]); 63 check_list(list, reporter, false, 1, true, false, false, false, elements); 65 list.addToHead(&elements[ 31 check_list(const SkTInternalLList<ListElement>& list, skiatest::Reporter* reporter, bool empty, int numElements, bool in0, bool in1, bool in2, bool in3, ListElement elements[4]) argument [all...] |
/external/chromium_org/v8/src/ |
H A D | factory.h | 387 // Create a JSArray with no elements. 392 // Create a JSArray with a specified length and elements initialized 410 // Create a JSArray with the given elements. 412 Handle<FixedArrayBase> elements, 418 Handle<FixedArrayBase> elements, 422 elements, elements_kind, elements->length(), pretenure); 417 NewJSArrayWithElements( Handle<FixedArrayBase> elements, ElementsKind elements_kind = TERMINAL_FAST_ELEMENTS_KIND, PretenureFlag pretenure = NOT_TENURED) argument
|