| /external/llvm/include/llvm/ADT/ |
| SetVector.h | 16 // if the SetVector has less than a certain number of elements.
51 /// @brief Initialize a SetVector with a range of elements
62 /// @brief Determine the number of elements in the SetVector.
108 /// @brief Insert a range of elements into the SetVector.
130 /// @brief Count the number of elements of a given key in the SetVector.
168 /// @brief Initialize a SmallSetVector with a range of elements
|
| /external/llvm/test/TableGen/ |
| SetTheory.td | 9 dag Elements = d;
14 // Define some elements.
37 // Defs of Set class expand into their elements.
38 // Mixed sets and elements are flattened.
70 // The 'shl' operator removes the first N elements.
83 // The 'trunc' operator truncates after the first N elements.
|
| /external/v8/test/mjsunit/ |
| array-elements-from-array-prototype.js | 29 // Tests below verify that elements set on Array.prototype propagate
32 // array-elements-from-array-prototype.js
33 // array-elements-from-array-prototype-chain.js
34 // array-elements-from-object-prototype.js
35 // those ideally should be identical modulo host of elements and
36 // the way elements introduced.
|
| array-elements-from-object-prototype.js | 29 // Tests below verify that elements set on Object.prototype propagate
32 // array-elements-from-array-prototype.js
33 // array-elements-from-array-prototype-chain.js
34 // array-elements-from-object-prototype.js
35 // those ideally should be identical modulo host of elements and
36 // the way elements introduced.
|
| /system/core/nexus/ |
| Property.cpp | 37 StringProperty::StringProperty(const char *name, bool ro, int elements) :
38 Property(name, ro, Property::Type_STRING, elements) {
88 IntegerProperty::IntegerProperty(const char *name, bool ro, int elements) :
89 Property(name, ro, Property::Type_INTEGER, elements) {
139 IPV4AddressProperty::IPV4AddressProperty(const char *name, bool ro, int elements) :
140 Property(name, ro, Property::Type_IPV4, elements) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 28 * does not permit the use of {@code null} elements.
30 * <p>Iterators are <i>weakly consistent</i>, returning elements
40 * of elements requires a traversal of the elements.
57 * @param <E> the type of elements held in this collection
138 * links from the first node is equal to the elements found via
166 * traversal that runs out of elements will be able to see more
167 * elements later after enqueues at that end. Doing gc-unlinking
205 * possible for an observer iterating over the elements to observe
776 * Creates an array list and fills it with elements of this list
[all...] |
| LinkedBlockingDeque.java | 43 * @param <E> the type of elements held in this collection
155 * {@link Integer#MAX_VALUE}, initially containing the elements of
159 * @param c the collection of elements to initially contain
161 * of its elements are null
675 * Returns the number of additional elements that this deque can ideally
768 * Returns the number of elements in this deque.
770 * @return the number of elements in this deque
813 // * Adds all of the elements in the specified collection to this
819 // * @param c collection containing elements to be added to this queue
846 * Returns an array containing all of the elements in this deque, i
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| EnumSetTest.java | 101 // test enum type with more than 64 elements
123 // Test HugeEnumSet with 65 elements
131 // Test HugeEnumSet with 130 elements
195 // test enum with more than 64 elements
228 // test enum type with more than 64 elements
278 // test enum type with more than 64 elements
333 Enum[] elements = EmptyEnum.class.getEnumConstants(); local
334 for(int i = 0; i < elements.length; i++) {
335 emptySet.add(elements[i]);
375 elements = EnumWithInnerClass.class.getEnumConstants()
479 Enum[] elements = EnumFoo.class.getEnumConstants(); local
523 Enum[] elements = EnumFoo.class.getEnumConstants(); local
674 Enum[] elements = EnumFoo.class.getEnumConstants(); local
746 Enum[] elements = EnumFoo.class.getEnumConstants(); local
[all...] |
| IdentityHashMapTest.java | 197 assertEquals("did not remove all elements in the map", 0, map.size());
198 assertTrue("did not remove all elements in the entryset", set.isEmpty());
201 assertTrue("entrySet iterator still has elements", !it.hasNext());
216 assertEquals("did not remove all elements in the map", 0, map.size());
217 assertTrue("did not remove all elements in the keyset", set.isEmpty());
220 assertTrue("keySet iterator still has elements", !it.hasNext());
285 assertEquals("did not remove all elements in the map", 0, map.size());
286 assertTrue("did not remove all elements in the keyset", set.isEmpty());
289 assertTrue("keySet iterator still has elements", !it.hasNext());
302 // retain all the elements
[all...] |
| /external/icu4c/i18n/ |
| bmsearch.cpp | 90 UCollationElements *elements; member in class:Target
98 targetString(NULL), targetBuffer(NULL), targetLength(0), elements(NULL), charBreakIterator(NULL)
144 ucol_closeElements(elements);
153 ucol_closeElements(elements);
164 elements = ucol_openElements(coll, target->getBuffer(), target->length(), &status);
165 ucol_forceHanImplicit(elements, &status);
191 low = ucol_getOffset(elements);
192 order = ucol_next(elements, &status);
193 high = ucol_getOffset(elements);
241 high = ucol_getOffset(elements);
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| EnumSetTest.java | 101 // test enum type with more than 64 elements
123 // Test HugeEnumSet with 65 elements
131 // Test HugeEnumSet with 130 elements
195 // test enum with more than 64 elements
228 // test enum type with more than 64 elements
278 // test enum type with more than 64 elements
333 Enum[] elements = EmptyEnum.class.getEnumConstants(); local
334 for(int i = 0; i < elements.length; i++) {
335 emptySet.add(elements[i]);
375 elements = EnumWithInnerClass.class.getEnumConstants()
479 Enum[] elements = EnumFoo.class.getEnumConstants(); local
523 Enum[] elements = EnumFoo.class.getEnumConstants(); local
674 Enum[] elements = EnumFoo.class.getEnumConstants(); local
746 Enum[] elements = EnumFoo.class.getEnumConstants(); local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| LinkedList.java | 28 * All optional operations including adding, removing, and replacing elements are supported.
30 * <p>All elements are permitted, including null.
34 * ability to scale to slightly larger numbers of elements. In general, though, you should
252 * elements contained in the specified {@code collection}. The order of the
253 * elements in this new {@code LinkedList} will be determined by the
257 * the collection of elements to add.
350 Collection<? extends E> elements = (collection == this) ? local
364 for (E e : elements) {
390 Collection<? extends E> elements = (collection == this) ? local
394 for (E e : elements) {
[all...] |
| /external/collada/include/1.4/dom/ |
| domFx_surface_init_cube_common.h | 108 * of order elements will describe which face the index belongs too
170 * of order elements will describe which face the index belongs too @see domOrder
193 * @return Returns a reference to the array of order elements.
198 * @return Returns a constant reference to the array of order elements.
294 protected: // Elements
310 * Used to preserve order in elements that do not specify strict sequencing of sub-elements.
314 * Used to preserve order in elements that have a complex content model.
337 * @return Returns a reference to the array of face elements.
342 * @return Returns a constant reference to the array of face elements
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_multimap.h | 146 * @brief Default constructor creates no elements.
152 * @brief Creates a %multimap with no elements.
188 * Create a %multimap consisting of copies of the elements from
204 * Create a %multimap consisting of copies of the elements from
220 * Create a %multimap consisting of copies of the elements from
235 * The dtor only erases the elements, and note that if the elements
244 * All the elements of @a x are copied, but unlike the copy constructor,
275 * This function fills a %multimap with copies of the elements
280 * of elements assigned. Old data may be lost
[all...] |
| stl_map.h | 148 * @brief Default constructor creates no elements.
154 * @brief Creates a %map with no elements.
190 * Create a %map consisting of copies of the elements in the
207 * Create a %map consisting of copies of the elements from [first,last).
223 * Create a %map consisting of copies of the elements from [first,last).
238 * The dtor only erases the elements, and note that if the elements
247 * All the elements of @a x are copied, but unlike the copy constructor,
278 * This function fills a %map with copies of the elements in the
283 * of elements assigned. Old data may be lost
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_multimap.h | 146 * @brief Default constructor creates no elements.
152 * @brief Creates a %multimap with no elements.
188 * Create a %multimap consisting of copies of the elements from
204 * Create a %multimap consisting of copies of the elements from
220 * Create a %multimap consisting of copies of the elements from
235 * The dtor only erases the elements, and note that if the elements
244 * All the elements of @a x are copied, but unlike the copy constructor,
275 * This function fills a %multimap with copies of the elements
280 * of elements assigned. Old data may be lost
[all...] |
| stl_map.h | 148 * @brief Default constructor creates no elements.
154 * @brief Creates a %map with no elements.
190 * Create a %map consisting of copies of the elements in the
207 * Create a %map consisting of copies of the elements from [first,last).
223 * Create a %map consisting of copies of the elements from [first,last).
238 * The dtor only erases the elements, and note that if the elements
247 * All the elements of @a x are copied, but unlike the copy constructor,
278 * This function fills a %map with copies of the elements in the
283 * of elements assigned. Old data may be lost
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_multimap.h | 146 * @brief Default constructor creates no elements.
152 * @brief Creates a %multimap with no elements.
188 * Create a %multimap consisting of copies of the elements from
204 * Create a %multimap consisting of copies of the elements from
220 * Create a %multimap consisting of copies of the elements from
235 * The dtor only erases the elements, and note that if the elements
244 * All the elements of @a x are copied, but unlike the copy constructor,
275 * This function fills a %multimap with copies of the elements
280 * of elements assigned. Old data may be lost
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| BaseLayoutRule.java | 244 public void onPaste(INode targetNode, Object targetView, IDragElement[] elements) {
245 DropFeedback feedback = onDropEnter(targetNode, targetView, elements);
248 feedback = onDropMove(targetNode, elements, feedback, p);
250 onDropLeave(targetNode, elements, feedback);
251 onDropped(targetNode, elements, feedback, p);
267 * @param elements the elements being pasted
270 IDragElement[] elements) {
271 DropFeedback feedback = onDropEnter(parentNode, parentView, elements);
279 feedback = onDropMove(parentNode, elements, feedback, targetP)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| MoveGesture.java | 63 * The elements currently being dragged. This will always be non-null for a valid
176 // Get the dragged elements.
312 SimpleElement[] elements = null; local
318 elements = (SimpleElement[]) event.data;
322 if (elements == null || elements.length < 1) {
327 if (mCurrentDragElements != null && Arrays.equals(elements, mCurrentDragElements)) {
328 elements = mCurrentDragElements;
336 createDocumentRoot(elements);
354 final SimpleElement[] elementsFinal = elements;
[all...] |
| /external/v8/src/ |
| array.js | 76 var elements = new InternalArray(keys_length);
84 elements[elements_length++] = e;
88 return %StringBuilderConcat(elements, elements_length, '');
111 // Attempt to convert the elements.
124 // Construct an array for the elements.
125 var elements = new InternalArray(length);
134 elements[elements_length++] = e;
137 elements.length = elements_length;
138 var result = %_FastAsciiArrayJoin(elements, '');
140 return %StringBuilderConcat(elements, elements_length, '')
[all...] |
| /external/bluetooth/glib/gobject/ |
| gvaluearray.c | 42 * an array of #GValue elements in order for it to be used as a boxed
112 * for @n_prealloced elements. New arrays always contain 0 elements,
292 * @compare_func: function to compare elements
294 * Sort @value_array using @compare_func to compare the elements accoring to
318 * @compare_func: function to compare elements
321 * Sort @value_array using @compare_func to compare the elements accoring
|
| /external/collada/include/dae/ |
| daeMetaElementAttribute.h | 35 * correct order of child elements.
79 * Gets the number of elements associated with this attribute in instance <tt><i>e.</i></tt>
81 * @return Returns the number of elements associated with this attribute
90 * there is an array of elements rather than a singleton.
121 * except that this meta attribute describes an array of elements rather than a singleton.
131 * correct order of child elements.
163 * there is an array of elements rather than a singleton.
|
| /external/gtest/test/ |
| gtest_xml_test_utils.py | 55 elements and actual_node meets all of the following conditions:
62 * It has an equivalent set of child nodes (including elements and
104 children. For <testsuite> and <testcase> elements, the ID is the
105 value of their "name" attribute; for <failure> elements, it is the
108 above four is encountered, if two child elements with the same
136 * The "time" attribute of <testsuite> and <testcase> elements is
140 attribute of <failure> elements is replaced with a single asterisk.
|
| /external/icu4c/tools/toolutil/ |
| xmlparser.h | 106 * If there are multiple child elements with this name, then return
139 // concatenated even when there are intervening nested elements
143 // elements which are primarily containers for nested elements.
160 * root elements.
234 UStack fElementStack; // Stack holds the parent elements when nested
235 // elements are being parsed. All items on this
|
