HomeSort by relevance Sort by last modified time
    Searched refs:elements (Results 126 - 150 of 471) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/v8/src/
array.js 76 var elements = new $Array(keys_length);
84 elements[elements_length++] = e;
88 return %StringBuilderConcat(elements, elements_length, '');
111 // Attempt to convert the elements.
126 // Construct an array for the elements.
127 var elements;
132 elements = new $Array(length);
137 elements[elements_length++] = e;
141 elements = new $Array(length << 1);
144 if (i != 0) elements[elements_length++] = separator
    [all...]
objects-debug.cc 446 FixedArray* p = FixedArray::cast(elements());
455 PixelArray* p = PixelArray::cast(elements());
462 ExternalByteArray* p = ExternalByteArray::cast(elements());
470 ExternalUnsignedByteArray::cast(elements());
477 ExternalShortArray* p = ExternalShortArray::cast(elements());
485 ExternalUnsignedShortArray::cast(elements());
492 ExternalIntArray* p = ExternalIntArray::cast(elements());
500 ExternalUnsignedIntArray::cast(elements());
507 ExternalFloatArray* p = ExternalFloatArray::cast(elements());
514 elements()->Print()
    [all...]
  /cts/tools/dasm/src/java_cup/
terminal.java 60 /** Table of all terminals. Elements are stored using name strings as
66 public static Enumeration all() {return _all.elements();};
  /dalvik/tools/
dex-preopt 50 # of bootstrap classpath elements, colon-separated. Order is significant
289 # Split the boot classpath into separate elements and iterate over them,
291 elements=`echo "${BOOTCLASSPATH}" | sed 's/:/ /g'`
293 for inputFile in $elements; do
  /external/apache-http/src/org/apache/http/message/
BasicHeaderValueParser.java 47 * Basic implementation for parsing header values into elements.
85 * Parses elements with the given parser.
90 * @return array holding the header elements, never <code>null</code>
123 List elements = new ArrayList(); local
127 elements.add(element);
131 elements.toArray(new HeaderElement[elements.size()]);
  /external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/
NameConstraints.java 65 Enumeration e = subtree.elements();
  /external/dbus/dbus/
dbus-mempool.c 56 * We just cast freed elements to this so we can
65 * The dummy size of the variable-length "elements"
87 /* this is a long so that "elements" is aligned */
88 long used_so_far; /**< bytes of this block already allocated as elements. */
90 unsigned char elements[ELEMENT_PADDING]; /**< the block data, actually allocated to required size */ member in struct:DBusMemBlock
100 unsigned int zero_elements : 1; /**< whether to zero-init allocated elements */
102 DBusFreedElement *free_elements; /**< a free list of elements to recycle */
104 int allocated_elements; /**< Count of outstanding allocated elements */
132 * @param zero_elements whether to zero-initialize elements
178 * Frees a memory pool (and all elements allocated from it)
    [all...]
  /external/expat/amiga/
Makefile 31 ELEMENTS = $(DESTDIR)/elements
52 staticlib: $(STATICLIB) $(XMLWF) $(ELEMENTS) $(OUTLINE) $(RUNTESTS) $(BENCHMARK) check
55 sharedlib: $(SHAREDLIB) $(XMLWF) $(ELEMENTS) $(OUTLINE) $(RUNTESTS) $(BENCHMARK) check
154 $(ELEMENTS): $(DESTDIR)/elements.o $(LAUNCH)
158 $(DESTDIR)/elements.o: elements.c
  /external/guava/src/com/google/common/collect/
ImmutableSortedSetFauxverideShim.java 123 * non-{@code Comparable} elements.</b> Proper calls will resolve to the
130 @Deprecated public static <E> ImmutableSortedSet<E> of(E... elements) {
147 * non-Comparable elements. We have not discovered a better solution. In
Multiset.java 31 * may have duplicate elements. A multiset is also sometimes called a
34 * <p>Elements of a multiset that are equal to one another (see "Note on
51 * #elementSet} contains the distinct elements of the multiset "with duplicates
60 * given initial elements. This is simply a refinement of {@code Collection}'s
114 * implementation does not permit null elements. Note that if {@code
144 * implementation does not permit null elements. Note that if {@code
165 * implementation does not permit null elements. Note that if {@code
174 * Returns the set of distinct elements contained in this multiset. The
176 * either is immediately reflected in the other. The order of the elements in
185 * elements in the multiset: {@code elementSet().size()}
    [all...]
  /external/kernel-headers/original/linux/
mempool.h 16 int min_nr; /* nr of elements at *elements */
17 int curr_nr; /* Current nr of elements at *elements */
18 void **elements; member in struct:mempool_s
  /external/libffi/testsuite/libffi.call/
struct1.c 36 ts1_type.elements = ts1_type_elements;
struct2.c 35 ts2_type.elements = ts2_type_elements;
struct4.c 35 ts4_type.elements = ts4_type_elements;
struct5.c 33 ts5_type.elements = ts5_type_elements;
struct6.c 33 ts6_type.elements = ts6_type_elements;
struct7.c 35 ts7_type.elements = ts7_type_elements;
struct9.c 34 ts9_type.elements = ts9_type_elements;
  /libcore/luni/src/main/java/java/io/
SequenceInputStream.java 56 e = inVector.elements();
61 * Constructs a new SequenceInputStream using the elements returned from
68 * if any of the elements in {@code e} is {@code null}.
  /libcore/luni/src/main/java/java/security/
AllPermissionCollection.java 62 public Enumeration<Permission> elements() { method in class:AllPermissionCollection
  /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/
DictionaryTest.java 36 public Enumeration elements() { method in class:DictionaryTest.Mock_Dictionary
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/ui/
ResourceChooser.java 106 Object[] elements = getSelectedElements(); local
107 if (elements.length == 1 && elements[0] instanceof ResourceItem) {
108 ResourceItem item = (ResourceItem)elements[0];
  /external/chromium/third_party/icu/source/common/
uhash.c 19 /* This hashtable is implemented as a double hash. All elements are
59 * coordinated with the ratio between successive elements of the
221 p = hash->elements = (UHashElement*)
224 if (hash->elements == NULL) {
337 UHashElement *elements = hash->elements; local
343 tableHash = elements[theIndex].hashcode;
345 if ((*hash->keyComparator)(key, elements[theIndex].key)) {
346 return &(elements[theIndex]);
379 return &(elements[theIndex])
    [all...]
  /external/icu4c/common/
uhash.c 19 /* This hashtable is implemented as a double hash. All elements are
59 * coordinated with the ratio between successive elements of the
221 p = hash->elements = (UHashElement*)
224 if (hash->elements == NULL) {
337 UHashElement *elements = hash->elements; local
343 tableHash = elements[theIndex].hashcode;
345 if ((*hash->keyComparator)(key, elements[theIndex].key)) {
346 return &(elements[theIndex]);
379 return &(elements[theIndex])
    [all...]
  /frameworks/base/tools/aidl/
generate_java.cpp 75 this->elements.push_back(descriptor);
87 this->elements.push_back(ctor);
99 this->elements.push_back(asBinder);
116 this->elements.push_back(onTransact);
180 this->elements.push_back(m);
208 this->elements.push_back(new Field(PRIVATE, mRemote));
217 this->elements.push_back(ctor);
226 this->elements.push_back(asBinder);
332 stubClass->elements.push_back(transactCode);
352 interface->elements.push_back(decl)
    [all...]

Completed in 1175 milliseconds

1 2 3 4 56 7 8 91011>>