HomeSort by relevance Sort by last modified time
    Searched refs:elements (Results 676 - 700 of 1581) sorted by null

<<21222324252627282930>>

  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/progs/d3d11spikysphere/
d3d11spikysphere.cpp 112 D3D11_INPUT_ELEMENT_DESC elements[1] = local
118 ensure(dev->CreateInputLayout(elements, 1, g_vs, sizeof(g_vs), &layout));
  /external/chromium_org/v8/src/
code-stubs-hydrogen.cc 355 HValue* elements = AddLoadElements(boilerplate, NULL); local
358 if_fixed_cow.If<HCompareMap>(elements, factory->fixed_cow_array_map());
368 if_fixed.If<HCompareMap>(elements, factory->fixed_array_map());
460 // Store the payload (smi elements kind)
636 HInstruction* elements = Add<HArgumentsElements>(false); local
638 new(zone()) HAccessArgumentsAt(elements, constant_one, constant_zero));
677 HValue* elements = array_builder->GetElementsLocation(); local
678 ASSERT(elements != NULL);
680 // Now populate the elements correctly.
690 Add<HStoreKeyed>(elements, key, argument, kind)
    [all...]
  /external/chromium_org/v8/test/mjsunit/
elements-transition-hoisting.js 46 // Make sure that a simple elements array transitions inside a loop before
95 // depend on an elements transition before them and it's not possible to hoist
137 a.foo = object; // This map check should be hoistable because all elements
176 // TODO(verwaest) With current changes the elements transition gets hoisted
stress-array-push.js 29 // to stress test pushing elements to an array.
  /external/chromium_org/v8/test/webkit/
array-tostring-and-join.js 26 "This test checks that toString and join share the same HashSet for visited elements."
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/configuration/org.eclipse.osgi/bundles/34/1/.cp/ant_tasks/
pde-ant.jar 
  /external/eigen/blas/
chbmv.f 88 * Note that the imaginary parts of the diagonal elements need
105 * On entry, INCX specifies the increment for the elements of
119 * On entry, INCY specifies the increment for the elements of
195 * Start the operations. In this version the elements of the array A
chpmv.f 58 * Note that the imaginary parts of the diagonal elements need
69 * On entry, INCX specifies the increment for the elements of
85 * On entry, INCY specifies the increment for the elements of
157 * Start the operations. In this version the elements of the array AP
chpr2.f 53 * On entry, INCX specifies the increment for the elements of
64 * On entry, INCY specifies the increment for the elements of
84 * Note that the imaginary parts of the diagonal elements need
159 * Start the operations. In this version the elements of the array AP
ctbmv.f 106 * Note that when DIAG = 'U' or 'u' the elements of the array A
107 * corresponding to the diagonal elements of the matrix are not
124 * On entry, INCX specifies the increment for the elements of
201 * Start the operations. In this version the elements of A are
dtbmv.f 106 * Note that when DIAG = 'U' or 'u' the elements of the array A
107 * corresponding to the diagonal elements of the matrix are not
124 * On entry, INCX specifies the increment for the elements of
200 * Start the operations. In this version the elements of A are
stbmv.f 106 * Note that when DIAG = 'U' or 'u' the elements of the array A
107 * corresponding to the diagonal elements of the matrix are not
124 * On entry, INCX specifies the increment for the elements of
200 * Start the operations. In this version the elements of A are
zhbmv.f 88 * Note that the imaginary parts of the diagonal elements need
105 * On entry, INCX specifies the increment for the elements of
119 * On entry, INCY specifies the increment for the elements of
195 * Start the operations. In this version the elements of the array A
zhpmv.f 58 * Note that the imaginary parts of the diagonal elements need
69 * On entry, INCX specifies the increment for the elements of
85 * On entry, INCY specifies the increment for the elements of
157 * Start the operations. In this version the elements of the array AP
zhpr2.f 53 * On entry, INCX specifies the increment for the elements of
64 * On entry, INCY specifies the increment for the elements of
84 * Note that the imaginary parts of the diagonal elements need
159 * Start the operations. In this version the elements of the array AP
ztbmv.f 106 * Note that when DIAG = 'U' or 'u' the elements of the array A
107 * corresponding to the diagonal elements of the matrix are not
124 * On entry, INCX specifies the increment for the elements of
201 * Start the operations. In this version the elements of A are
  /external/freetype/src/psaux/
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
    [all...]
  /external/guava/guava/src/com/google/common/collect/
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) {
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
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
ImmutableClassToInstanceMapTest.java 51 public Map<Class, Number> create(Object... elements) {
54 for (Object object : elements) {
PeekingIteratorTest.java 47 * a given collection of elements (used as the reference iterator)
53 * same elements as the reference's iterator {@code #remove()}.
70 @Override protected void verify(List<T> elements) {
72 assertEquals(elements, targetList);
188 * This Iterator claims to have more elements than the underlying
189 * iterable, but when you try to fetch the extra elements, it throws
220 * If the PeekingIterator is caching elements too aggressively,
  /external/libffi/src/cris/
ffi.c 41 FFI_ASSERT (arg->elements != NULL);
45 ptr = &(arg->elements[0]);
  /external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11spikysphere/
d3d11spikysphere.cpp 112 D3D11_INPUT_ELEMENT_DESC elements[1] = local
118 ensure(dev->CreateInputLayout(elements, 1, g_vs, sizeof(g_vs), &layout));
  /external/openssh/
gss-serv.c 259 (memcmp(supported_mechs[i]->oid.elements,
260 ctx->oid->elements, ctx->oid->length) == 0))
  /external/skia/bench/
bench_graph_svg.py 364 elements = expectation.strip().split(',')
365 if not elements[0] or elements[0].startswith('#'):
367 if len(elements) != 5:
370 bench_entry = elements[0] + ',' + elements[1]
375 expectations[bench_entry] = (float(elements[-2]),
376 float(elements[-1]))
639 var elements = node.getElementsByTagName(tag);
641 for (var i = 0, elementsFound = 0; i < elements.length; ++i)
    [all...]
  /external/v8/test/mjsunit/
array-unshift.js 41 // filling the holes with elements from the prototype
80 // Now check the case with array of holes and some elements on prototype.
119 // filling the holes with elements from the prototype
157 // Now check the case with array of holes and some elements on prototype.

Completed in 419 milliseconds

<<21222324252627282930>>