/libcore/luni/src/main/java/java/lang/annotation/ |
ElementType.java | 21 * Defines an enumeration for Java program elements. It is used in conjunction 23 * to certain program elements.
|
/libcore/luni/src/main/java/java/nio/ |
BufferUnderflowException.java | 20 * A <code>BufferUnderflowException</code> is thrown when elements are read 21 * from a buffer but there are not enough remaining elements in the buffer.
|
/packages/apps/Email/emailcommon/src/org/apache/james/mime4j/decoder/ |
UnboundedFifoByteBuffer.java | 31 * order; elements are removed in the same order in which they were added.
62 * Constructs an UnboundedFifoByteBuffer with the default number of elements.
74 * Constructs an UnboundedFifoByteBuffer with the specified number of elements.
90 * Returns the number of elements stored in the buffer.
215 * Returns an iterator over this buffer's elements.
217 * @return an iterator over this buffer's elements
251 // Other elements require us to shift the subsequent elements
|
/packages/apps/Email/tests/src/com/android/email/ |
VendorPolicyLoaderTest.java | 122 String[] elements = id.split("\""); local 123 assertEquals(0, elements.length % 4); 124 for (int i = 0; i < elements.length; ) { 131 assertTrue(elements[i] == null || elements[i].startsWith(" ")); 132 assertTrue(elements[i+1].charAt(0) != ' '); 133 assertTrue(elements[i+2].startsWith(" ")); 134 assertTrue(elements[i+3].charAt(0) != ' ');
|
/packages/apps/Mms/src/org/w3c/dom/smil/ |
ElementExclusiveTimeContainer.java | 35 * paused elements (the paused stack) at a given point in time. 36 * @return All paused elements at the current time.
|
ElementTimeContainer.java | 31 * Returns a list of child elements active at the specified invocation. 34 * @return List of timed child-elements active at instant.
|
/packages/apps/Phone/res/values/ |
ids.xml | 18 <!-- IDs used with events from in-call touch UI elements. 20 handler even though the UI elements may not actually be buttons.) -->
|
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/common/layout/ |
BaseLayoutRuleTest.java | 42 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local 52 return elements; 57 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local 60 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements); 70 IDragElement[] elements = TestDragElement.create(TestDragElement.create( local 75 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements); 103 * Test {@link BaseLayoutRule#collectIds}: Check that with multiple elements and 109 IDragElement[] elements = createSampleElements(); local 110 Map<String, Pair<String, String>> ids = new BaseLayoutRule().collectIds(idMap, elements); 128 IDragElement[] elements = createSampleElements() local 150 IDragElement[] elements = createSampleElements(); local [all...] |
/external/antlr/src/org/antlr/runtime/tree/ |
RewriteRuleSubtreeStream.java | 49 List elements) 51 super(adaptor, elementDescription, elements); 68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree()); 71 // if out of elements and size is 1, dup (at most a single node
|
/external/collada/include/1.4/dom/ |
domVertices.h | 44 protected: // Elements 82 * @return Returns a reference to the array of input elements. 87 * @return Returns a constant reference to the array of input elements. 92 * @return Returns a reference to the array of extra elements. 97 * @return Returns a constant reference to the array of extra elements.
|
domInstance_rigid_body.h | 281 protected: // Elements 285 * Used to preserve order in elements that do not specify strict sequencing of sub-elements. 289 * Used to preserve order in elements that have a complex content model. 302 * @return Returns a reference to the array of translate elements. 307 * @return Returns a constant reference to the array of translate elements. 312 * @return Returns a reference to the array of rotate elements. 317 * @return Returns a constant reference to the array of rotate elements. 449 protected: // Elements 470 * Used to preserve order in elements that do not specify strict sequencing of sub-elements [all...] |
/external/collada/include/dae/ |
domAny.h | 19 * The domAny class allows for weakly typed xml elements. This class is used anywhere in the 36 * Used to preserve order in elements that do not specify strict sequencing of sub-elements. 40 * Used to preserve order in elements that have a complex content model. 130 * @remarks Unlike other dom* elements, domAny will always create a new daeMetaElement when this
|
/external/expat/ |
MANIFEST | 14 bcb5/elements.bpf 15 bcb5/elements.bpr 16 bcb5/elements.mak 64 examples/elements.c 65 examples/elements.dsp
|
/libcore/luni/src/main/java/java/util/ |
Dictionary.java | 38 * Returns an enumeration on the elements of this dictionary. 45 public abstract Enumeration<V> elements(); method in class:Dictionary 71 * @see #elements 88 * @see #elements 111 * @see #elements
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/formatting/ |
XmlFormatStyle.java | 27 * newline between successive elements, whereas in a manifest file there is typically only 28 * newlines between different types of elements. As another example, in resource files, 34 /** Layout formatting style: blank lines between elements, attributes on separate lines */ 41 * Similar to layout style, but no newlines between related elements such as 43 * the second level elements (so an {@code <activity>} declaration appears as a
|
/external/bluetooth/glib/docs/reference/glib/tmpl/ |
datasets.sgml | 5 associate groups of data elements with particular memory locations 9 Datasets associate groups of data elements with particular memory locations. 13 any number of data elements with it. 17 The first form uses strings to identify the data elements associated with 25 soon as you add elements to it. 28 To add data elements to a dataset use g_dataset_id_set_data(), 33 To get data elements from a dataset use g_dataset_id_get_data() and 37 To iterate over all data elements in a dataset use g_dataset_foreach() (not thread-safe). 40 To remove data elements from a dataset use g_dataset_id_remove_data() and 207 destroy functions set for data elements [all...] |
linked_lists_single.sgml | 28 List elements are allocated from the <link linkend="glib-Memory-Slices">slice 29 allocator</link>, which is more efficient than allocating elements 34 the first element in the list. The functions which insert elements return 42 To add elements, use g_slist_append(), g_slist_prepend(), g_slist_insert() 46 To remove elements, use g_slist_remove(). 49 To find elements in the list use g_slist_last(), g_slist_next(), 303 @Returns: the next element, or %NULL if there are no more elements. 369 Sets the allocator to use to allocate #GSList elements. 377 @dummy: the #GAllocator to use when allocating #GSList elements. 384 Restores the previous #GAllocator, used when allocating #GSList elements [all...] |
/external/icu4c/common/ |
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[count] [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentLinkedQueue.java | 22 * This queue orders elements FIFO (first-in-first-out). 26 * queue the shortest time. New elements 28 * operations obtain elements at the head of the queue. 32 * does not permit the use of {@code null} elements. 40 * <p>Iterators are <i>weakly consistent</i>, returning elements 44 * with other operations. Elements contained in the queue since the creation 50 * of elements requires a traversal of the elements. 64 * @param <E> the type of elements held in this collection 90 * - The elements contained in the queue are the non-null items i [all...] |
BlockingQueue.java | 63 * <p>A <tt>BlockingQueue</tt> does not accept <tt>null</tt> elements. 71 * additional elements can be <tt>put</tt> without blocking. 91 * only some of the elements in <tt>c</tt>. 150 * @param <E> the type of elements held in this collection 252 * Returns the number of additional elements that this queue can ideally 270 * elements. 296 * Removes all available elements from this queue and adds them 299 * encountered while attempting to add elements to 300 * collection <tt>c</tt> may result in elements being in neither, 307 * @param c the collection to transfer elements int [all...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_multiset.h | 66 * @brief A standard container made up of elements, which can be retrieved 127 * @brief Default constructor creates no elements. 133 * @brief Creates a %multiset with no elements. 147 * Create a %multiset consisting of copies of the elements from 163 * Create a %multiset consisting of copies of the elements from 201 * Create a %multiset consisting of copies of the elements from 216 * All the elements of @a x are copied, but unlike the copy constructor, 247 * This function fills a %multiset with copies of the elements in the 252 * of elements assigned. Old data may be lost. 371 * This exchanges the elements between two multisets in constant time [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_multiset.h | 66 * @brief A standard container made up of elements, which can be retrieved 127 * @brief Default constructor creates no elements. 133 * @brief Creates a %multiset with no elements. 147 * Create a %multiset consisting of copies of the elements from 163 * Create a %multiset consisting of copies of the elements from 201 * Create a %multiset consisting of copies of the elements from 216 * All the elements of @a x are copied, but unlike the copy constructor, 247 * This function fills a %multiset with copies of the elements in the 252 * of elements assigned. Old data may be lost. 371 * This exchanges the elements between two multisets in constant time [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_multiset.h | 66 * @brief A standard container made up of elements, which can be retrieved 127 * @brief Default constructor creates no elements. 133 * @brief Creates a %multiset with no elements. 147 * Create a %multiset consisting of copies of the elements from 163 * Create a %multiset consisting of copies of the elements from 201 * Create a %multiset consisting of copies of the elements from 216 * All the elements of @a x are copied, but unlike the copy constructor, 247 * This function fills a %multiset with copies of the elements in the 252 * of elements assigned. Old data may be lost. 371 * This exchanges the elements between two multisets in constant time [all...] |
/external/clang/lib/CodeGen/ |
CGObjCGNU.cpp | 191 /// Generates a global structure, initialized by the elements in the vector. 192 /// The element types must match the types of the structure elements in the 204 /// elements that the array type declares, of the type specified as the array [all...] |
/external/clang/test/Sema/ |
array-init.c | 23 int x4 = { 1, 2 }; // expected-warning{{excess elements in scalar initializer}} 40 { 5 }, // expected-warning{{excess elements in array initializer}} 56 { 1, 2, 3 } // expected-warning{{braces around scalar initializer}} expected-warning{{excess elements in scalar initializer}} 63 { }, // expected-warning{{use of GNU empty initializer extension}} expected-warning{{excess elements in array initializer}} 66 { 1, 3, 5, 2 }, // expected-warning{{excess elements in array initializer}} 151 static char const test3[] = { "test", "excess stuff" }; // expected-warning{{excess elements in char array initializer}} 159 char c2[] = { "Hello", "Good bye" }; //expected-warning{{excess elements in char array initializer}} 180 float r4[1][2] = {1,{2},3,4}; //expected-warning{{braces around scalar initializer}} expected-warning{{excess elements in array initializer}} 209 struct bittest bittestvar = {1, 2, 3, 4}; //expected-warning{{excess elements in struct initializer}} 222 // expected-error{{initializer for aggregate with no elements}} [all...] |