/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrClipMaskManager.cpp | 85 bool GrClipMaskManager::useSWOnlyPath(const ElementList& elements) { argument 92 for (ElementList::Iter iter(elements.headIter()); iter.get(); iter.next()) { 114 ElementList elements(16); 133 &elements, 137 if (elements.isEmpty()) { 161 if (this->useSWOnlyPath(elements)) { 166 elements, 171 elements, 210 elements, 424 const ElementList& elements, 422 createAlphaClipMask(int32_t clipStackGenID, InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds) argument 568 createStencilClipMask(InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds, const SkIPoint& clipSpaceToStencilOffset) argument 920 createSoftwareClipMask(int32_t clipStackGenID, GrReducedClip::InitialState initialState, const GrReducedClip::ElementList& elements, const SkIRect& clipSpaceIBounds) argument [all...] |
/external/chromium_org/v8/src/ |
H A D | json-stringifier.h | 383 FixedArray* elements = FixedArray::cast(stack_->elements()); local 385 if (elements->get(i) == *object) { 390 FixedArray::cast(stack_->elements())->set(length, *object); 548 Handle<FixedArray> elements( 549 FixedArray::cast(object->elements()), isolate_); 552 SerializeSmi(Smi::cast(elements->get(i))); 557 Handle<FixedDoubleArray> elements( 558 FixedDoubleArray::cast(object->elements()), isolate_); 561 SerializeDouble(elements [all...] |
/external/freetype/src/psaux/ |
H A D | psobjs.c | 60 /* count :: The table size = the maximum number of elements. */ 77 if ( FT_NEW_ARRAY( table->elements, count ) || 92 FT_FREE( table->elements ); 103 FT_Byte** offset = table->elements; 131 /* copy elements and shift offsets */ 214 table->elements[idx] = table->block + table->cursor; 272 FT_FREE( table->elements ); 719 /* the number of array elements */ 1300 T1_TokenRec elements[T1_MAX_TABLE_ELEMENTS]; local 1314 ps_parser_to_token_array( parser, elements, [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | Iterators.java | 81 // Casting to any type is safe since there are no actual elements. 108 // Casting to any type is safe since there are no actual elements. 145 * Returns the number of elements remaining in {@code iterator}. The iterator 184 * @param removeFrom the iterator to (potentially) remove elements from 185 * @param elementsToRemove the elements to remove 206 * @param removeFrom the iterator to (potentially) remove elements from 209 * @return {@code true} if any elements were removed from the iterator 230 * @param removeFrom the iterator to (potentially) remove elements from 231 * @param elementsToRetain the elements to retain 248 * Determines whether two iterators contain equal elements i 444 cycle(T... elements) argument [all...] |
H A D | MinMaxPriorityQueue.java | 45 * natural order of elements is used. 59 * queues, which either block or reject new elements when full. 64 * it stores elements in a single array, as compact as the traditional heap data 67 * <p>This class is not thread-safe, and does not accept null elements. 102 * and initially containing the given elements. 112 * least and greatest elements. 121 * expectedSize} elements. 131 * elements. Each time a queue grows beyond this bound, it immediately 181 * that are limited to {@code maximumSize} elements. Each time a queue grows 201 * options, and having the given initial elements 805 containsExact(Iterable<E> elements, E target) argument [all...] |
H A D | Multisets.java | 328 * elements. 468 * Returns the expected number of distinct elements given the specified 469 * elements. The number of distinct elements is only computed if {@code 470 * elements} is an instance of {@code Multiset}; otherwise the default value 473 static int inferDistinctElements(Iterable<?> elements) { argument 474 if (elements instanceof Multiset) { 475 return ((Multiset<?>) elements).elementSet().size(); 569 * all occurrences of elements that appear at all in {@code 570 * multisetToRetain}, and deletes all occurrences of all other elements 731 addAllImpl( Multiset<E> self, Collection<? extends E> elements) argument [all...] |
H A D | Sets.java | 68 * Returns an immutable set instance containing the given enum elements. 72 * order, not the order in which the elements are provided to the method. 74 * @param anElement one of the elements the set should contain 75 * @param otherElements the rest of the elements the set should contain 76 * @return an immutable set containing those elements, minus duplicates 86 * Returns an immutable set instance containing the given enum elements. 90 * order, not the order in which the elements appear in the given collection. 92 * @param elements the elements, all of the same {@code enum} type, that the 94 * @return an immutable set containing those elements, minu 98 immutableEnumSet( Iterable<E> elements) argument 174 newHashSet(E... elements) argument 210 newHashSet(Iterable<? extends E> elements) argument 229 newHashSet(Iterator<? extends E> elements) argument 281 newLinkedHashSet( Iterable<? extends E> elements) argument 323 newTreeSet( Iterable<? extends E> elements) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterators.java | 79 // Casting to any type is safe since there are no actual elements. 106 // Casting to any type is safe since there are no actual elements. 143 * Returns the number of elements remaining in {@code iterator}. The iterator 182 * @param removeFrom the iterator to (potentially) remove elements from 183 * @param elementsToRemove the elements to remove 204 * @param removeFrom the iterator to (potentially) remove elements from 207 * @return {@code true} if any elements were removed from the iterator 228 * @param removeFrom the iterator to (potentially) remove elements from 229 * @param elementsToRetain the elements to retain 246 * Determines whether two iterators contain equal elements i 426 cycle(T... elements) argument [all...] |
H A D | Sets.java | 65 * Returns an immutable set instance containing the given enum elements. 69 * order, not the order in which the elements are provided to the method. 71 * @param anElement one of the elements the set should contain 72 * @param otherElements the rest of the elements the set should contain 73 * @return an immutable set containing those elements, minus duplicates 83 * Returns an immutable set instance containing the given enum elements. 87 * order, not the order in which the elements appear in the given collection. 89 * @param elements the elements, all of the same {@code enum} type, that the 91 * @return an immutable set containing those elements, minu 95 immutableEnumSet( Iterable<E> elements) argument 171 newHashSet(E... elements) argument 207 newHashSet(Iterable<? extends E> elements) argument 226 newHashSet(Iterator<? extends E> elements) argument 278 newLinkedHashSet( Iterable<? extends E> elements) argument 320 newTreeSet( Iterable<? extends E> elements) argument [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ImmutableListTest.java | 93 @Override protected List<String> create(String[] elements) { 95 ImmutableList.copyOf(elements)); 432 elements(), 437 elements(), 442 elements(), 447 elements(), 452 elements(1), 457 elements(1), 462 elements(1, 2), 467 elements( 487 elements(Integer... elements) argument 491 ops(ListFrobber... elements) argument [all...] |
H A D | OrderingTest.java | 167 // comparing any pair of elements gives the answer we expect. 185 // Don't let the elements be in such a predictable order 191 // comparing any pair of elements gives the answer we expect. 528 int iterations, int elements, int seeds) { 534 for (int j = 0; j < elements; j++) { 527 runLeastOfComparison( int iterations, int elements, int seeds) argument
|
/external/icu4c/common/ |
H A D | uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are 60 * coordinated with the ratio between successive elements of the 222 p = hash->elements = (UHashElement*) 225 if (hash->elements == NULL) { 338 UHashElement *elements = hash->elements; local 344 tableHash = elements[theIndex].hashcode; 346 if ((*hash->keyComparator)(key, elements[theIndex].key)) { 347 return &(elements[theIndex]); 380 return &(elements[theInde [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 170 ArrayRef<SUnit*> elements() { return Queue; } function in class:llvm::ReadyQueue
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_context.c | 335 const struct pipe_vertex_element *elements) 343 memcpy(draw->pt.vertex_element, elements, count * sizeof(elements[0])); 609 * Tell the draw module where vertex indexes/elements are located, and 617 const void *elements, unsigned elem_size) 623 draw->pt.user.elts = elements; 333 draw_set_vertex_elements(struct draw_context *draw, unsigned count, const struct pipe_vertex_element *elements) argument 616 draw_set_indexes(struct draw_context *draw, const void *elements, unsigned elem_size) argument
|
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11app/ |
H A D | d3d11u.h | 91 const D3D11_INPUT_ELEMENT_DESC *elements, unsigned num_elements, 97 dev->CreateInputLayout(elements, num_elements, vs, vs_size, &layout); 166 D3D11_INPUT_ELEMENT_DESC elements[2] = local 173 elements, 2, 90 mesh(ID3D11Device* dev, D3D11_PRIMITIVE_TOPOLOGY topology, const D3D11_INPUT_ELEMENT_DESC *elements, unsigned num_elements, const void* vs, unsigned vs_size, const void* vertices, unsigned vertex_size, unsigned num_vertices, const void* indices = 0, unsigned index_size = 0, unsigned num_indices = 0) argument
|
/external/mesa3d/src/mesa/vbo/ |
H A D | vbo_exec_array.c | 81 * Compute min and max elements by scanning the index buffer for 184 * Compute min and max elements for nr_prims 287 const void *elements, GLint basevertex) 298 elements = ADD_POINTERS(elements, elemMap); 307 j = ((const GLubyte *) elements)[i]; 310 j = ((const GLushort *) elements)[i]; 313 j = ((const GLuint *) elements)[i]; 286 check_draw_elements_data(struct gl_context *ctx, GLsizei count, GLenum elemType, const void *elements, GLint basevertex) argument
|
/external/qemu/distrib/sdl-1.2.15/src/joystick/darwin/ |
H A D | SDL_sysjoystick.c | 88 long elements; /* number of total elements (shouldbe total of above) (calculated, not reported by device) */ member in struct:joystick_hwdata 278 /* examines CF dictionary vlaue in device element hierarchy to determine if it is element of interest or a collection of more elements 280 * if collection then pass on to deconstruction collection into additional individual elements 354 pDevice->elements++; 381 /* handles retrieval of element information from arrays of elements in device IO registry information */ 537 /* disposes of a single device, closing and releaseing interface, freeing memory fro device and elements, setting device pointer to NULL
|
/external/skia/src/gpu/ |
H A D | GrClipMaskManager.cpp | 85 bool GrClipMaskManager::useSWOnlyPath(const ElementList& elements) { argument 92 for (ElementList::Iter iter(elements.headIter()); iter.get(); iter.next()) { 114 ElementList elements(16); 133 &elements, 137 if (elements.isEmpty()) { 161 if (this->useSWOnlyPath(elements)) { 166 elements, 171 elements, 210 elements, 424 const ElementList& elements, 422 createAlphaClipMask(int32_t clipStackGenID, InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds) argument 568 createStencilClipMask(InitialState initialState, const ElementList& elements, const SkIRect& clipSpaceIBounds, const SkIPoint& clipSpaceToStencilOffset) argument 920 createSoftwareClipMask(int32_t clipStackGenID, GrReducedClip::InitialState initialState, const GrReducedClip::ElementList& elements, const SkIRect& clipSpaceIBounds) argument [all...] |
/external/chromium/chrome/browser/webdata/ |
H A D | autofill_table.cc | 401 bool AutofillTable::AddFormFieldValues(const std::vector<FormField>& elements, argument 403 return AddFormFieldValuesTime(elements, changes, Time::Now()); 465 // Query for the pair_id, name, and value of all form elements that 481 AutofillElementList elements; local 483 elements.push_back(MakeTuple(s.ColumnInt64(0), 493 for (AutofillElementList::iterator itr = elements.begin(); 494 itr != elements.end(); itr++) { 661 const std::vector<FormField>& elements, 670 itr = elements.begin(); 671 itr != elements 660 AddFormFieldValuesTime( const std::vector<FormField>& elements, std::vector<AutofillChange>* changes, base::Time time) argument [all...] |
/external/chromium/net/http/ |
H A D | http_auth_gssapi_posix.cc | 222 if (0 != memcmp(oid->elements, 223 predefined_oid->elements, 263 if (!oid->elements) { 267 const unsigned char* elements = local 268 reinterpret_cast<const unsigned char*>(oid->elements); 272 output += base::StringPrintf("\\x%02X", elements[i]);
|
/external/chromium/net/third_party/gssapi/ |
H A D | gssapi.h | 151 void *elements; member in struct:gss_OID_desc_struct 158 gss_OID elements; member in struct:gss_OID_set_desc_struct
|
/external/chromium_org/chrome_frame/ |
H A D | urlmon_url_request.cc | 1081 ScopedVector<net::UploadElement>* elements = local 1083 for (size_t i = 0; i < elements->size(); ++i) { 1084 net::UploadElement* element = (*elements)[i]; 1095 if (i == elements->size() - 1) {
|
/external/chromium_org/net/http/ |
H A D | http_auth_gssapi_posix.cc | 219 if (0 != memcmp(oid->elements, 220 predefined_oid->elements, 255 if (!oid->elements) { 259 const unsigned char* elements = local 260 reinterpret_cast<const unsigned char*>(oid->elements); 264 output += base::StringPrintf("\\x%02X", elements[i]);
|
/external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
H A D | AccessibilityNodeObject.cpp | 90 String AccessibilityNodeObject::accessibilityDescriptionForElements(Vector<Element*> &elements) const 93 unsigned size = elements.size(); 95 Element* idElement = elements[i]; 132 void AccessibilityNodeObject::ariaLabeledByElements(Vector<Element*>& elements) const 134 elementsFromAttribute(elements, aria_labeledbyAttr); 135 if (!elements.size()) 136 elementsFromAttribute(elements, aria_labelledbyAttr); 246 void AccessibilityNodeObject::elementsFromAttribute(Vector<Element*>& elements, const QualifiedName& attribute) const argument 269 elements.append(idElement); 751 // If it has any children that are elements, w 972 Vector<Element*> elements; local 981 Vector<Element*> elements; local 1551 Vector<Element*> elements; local [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | UserMetrics.js | 82 elements: 1,
|