| /external/collada/include/1.4/dom/ |
| domInstance_physics_model.h | 58 protected: // Elements
61 * elements. @see domInstance_force_field
66 * elements. @see domInstance_rigid_body
71 * elements. @see domInstance_rigid_constraint
146 * @return Returns a reference to the array of instance_force_field elements.
151 * @return Returns a constant reference to the array of instance_force_field elements.
156 * @return Returns a reference to the array of instance_rigid_body elements.
161 * @return Returns a constant reference to the array of instance_rigid_body elements.
166 * @return Returns a reference to the array of instance_rigid_constraint elements.
171 * @return Returns a constant reference to the array of instance_rigid_constraint elements
[all...] |
| domPhysics_model.h | 45 protected: // Elements
51 * The physics_model may define any number of rigid_body elements. @see
56 * The physics_model may define any number of rigid_constraint elements.
61 * The physics_model may instance any number of other physics_model elements.
102 * @return Returns a reference to the array of rigid_body elements.
107 * @return Returns a constant reference to the array of rigid_body elements.
112 * @return Returns a reference to the array of rigid_constraint elements.
117 * @return Returns a constant reference to the array of rigid_constraint elements.
122 * @return Returns a reference to the array of instance_physics_model elements.
127 * @return Returns a constant reference to the array of instance_physics_model elements
[all...] |
| domPhysics_scene.h | 48 protected: // Elements
110 protected: // Elements
116 * There may be any number of instance_force_field elements. @see domInstance_force_field
120 * There may be any number of instance_physics_model elements. @see domInstance_physics_model
171 * @return Returns a reference to the array of instance_force_field elements.
176 * @return Returns a constant reference to the array of instance_force_field elements.
181 * @return Returns a reference to the array of instance_physics_model elements.
186 * @return Returns a constant reference to the array of instance_physics_model elements.
196 * @return Returns a reference to the array of technique elements.
201 * @return Returns a constant reference to the array of technique elements
[all...] |
| domCg_setarray_type.h | 32 protected: // Elements
35 * Nested array elements allow you to create multidemensional arrays. @see
44 * Used to preserve order in elements that do not specify strict sequencing of sub-elements.
48 * Used to preserve order in elements that have a complex content model.
72 * @return Returns a reference to the array of cg_param_type elements.
77 * @return Returns a constant reference to the array of cg_param_type elements.
82 * @return Returns a reference to the array of array elements.
87 * @return Returns a constant reference to the array of array elements.
92 * @return Returns a reference to the array of usertype elements
[all...] |
| domMorph.h | 49 protected: // Elements
63 * @return Returns a reference to the array of input elements.
68 * @return Returns a constant reference to the array of input elements.
73 * @return Returns a reference to the array of extra elements.
78 * @return Returns a constant reference to the array of extra elements.
122 protected: // Elements
124 * The morph element must contain at least two source elements. @see domSource
172 * @return Returns a reference to the array of source elements.
177 * @return Returns a constant reference to the array of source elements.
187 * @return Returns a reference to the array of extra elements
[all...] |
| domSpline.h | 48 protected: // Elements
62 * @return Returns a reference to the array of input elements.
67 * @return Returns a constant reference to the array of input elements.
72 * @return Returns a reference to the array of extra elements.
77 * @return Returns a constant reference to the array of extra elements.
112 protected: // Elements
114 * The mesh element must contain one or more source elements. @see domSource
141 * @return Returns a reference to the array of source elements.
146 * @return Returns a constant reference to the array of source elements.
156 * @return Returns a reference to the array of extra elements
[all...] |
| domProfile_GLES.h | 66 protected: // Elements
84 * @return Returns a reference to the array of annotate elements.
89 * @return Returns a constant reference to the array of annotate elements.
561 protected: // Elements
573 * Used to preserve order in elements that do not specify strict sequencing of sub-elements.
577 * Used to preserve order in elements that have a complex content model.
601 * @return Returns a reference to the array of annotate elements.
606 * @return Returns a constant reference to the array of annotate elements.
646 * @return Returns a reference to the array of gles_pipeline_settings elements
[all...] |
| /libcore/luni/src/main/java/java/sql/ |
| Array.java | 31 * @return A Java array containing the elements of this Array
40 * successive elements of the SQL array.
46 * the number of elements to retrieve.
47 * @return A Java array containing the desired set of elements from this Array
56 * successive elements of the SQL array.
62 * the number of elements to retrieve.
66 * @return A Java array containing the desired set of elements from this Array
79 * @return A Java array containing the elements of this array
109 * @return the elements of the array as a {@code ResultSet}.
124 * the number of elements to retrieve
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/processor/ |
| XSLTElementDef.java | 32 * mapping between Xalan classes and the markup elements in the XSLT instance.
33 * This actually represents both text nodes and elements.
50 * @param elements An array of allowed child element defs, or null.
56 XSLTElementDef[] elements, XSLTAttributeDef[] attributes,
59 build(namespace, name, nameAlias, elements, attributes, contentHandler,
78 * @param elements An array of allowed child element defs, or null.
82 * @param has_required true if this element has required elements by the XSLT specification.
85 XSLTElementDef[] elements, XSLTAttributeDef[] attributes,
89 build(namespace, name, nameAlias, elements, attributes, contentHandler,
109 * @param elements An array of allowed child element defs, or null
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Collection.java | 30 * initial collection but with the same elements. Implementations of {@code Collection}
81 * if null elements cannot be added to the {@code Collection}.
88 * is changed during the process of adding elements to this {@code Collection}, the
104 * contains {@code null} elements and this {@code Collection} does
105 * not support such elements.
110 * Removes all elements from this {@code Collection}, leaving it empty (optional).
135 * {@code Collection} doesn't support {@code null} elements.
148 * elements of this {@code Collection}, {@code false} otherwise.
150 * if one or more elements of {@code collection} isn't of the
155 * elements
[all...] |
| NavigableSet.java | 17 * {@code floor}, {@code ceiling}, and {@code higher} return elements
36 * implementations that permit {@code null} elements. However, even
40 * {@code null} elements. (Note that sorted sets of {@link
41 * Comparable} elements intrinsically do not permit {@code null}.)
55 * @param <E> the type of elements maintained by this set
67 * compared with the elements currently in the set
69 * and this set does not permit null elements
81 * compared with the elements currently in the set
83 * and this set does not permit null elements
95 * compared with the elements currently in the se
[all...] |
| HashSet.java | 27 * removing) are supported. The elements can be any objects.
68 * elements in the specified collection.
71 * the collection of elements to add.
99 * Removes all elements from this {@code HashSet}, leaving it empty.
110 * Returns a new {@code HashSet} with the same elements and size as this
142 * Returns true if this {@code HashSet} has no elements, false otherwise.
144 * @return {@code true} if this {@code HashSet} has no elements,
154 * Returns an Iterator on the elements of this {@code HashSet}.
156 * @return an Iterator on the elements of this {@code HashSet}.
177 * Returns the number of elements in this {@code HashSet}
[all...] |
| AbstractCollection.java | 49 * {@code Collection} does not support adding elements, an {@code
52 * If the passed {@code Collection} is changed during the process of adding elements
69 * {@code null} elements and this {@code Collection} does not support
70 * such elements.
84 * Removes all elements from this {@code Collection}, leaving it empty (optional).
87 * of elements, an {@code UnsupportedOperationException} is thrown.
93 * it the iterator does not support removing elements from
124 * {@code Collection} doesn't support {@code null} elements.
153 * elements of this {@code Collection}, {@code false} otherwise.
155 * if one or more elements of {@code collection} isn't of th
[all...] |
| List.java | 22 * A {@code List} is a collection which maintains an ordering for its elements. Every
25 * elements, as compared to Sets, where elements have to be unique.
33 * {@code List}, then all elements beyond the specified location are moved by one
111 * Removes all elements from this {@code List}, leaving it empty.
137 * elements of this {@code List}, {@code false} otherwise.
144 * {@code List}s, this means that they contain the same elements in exactly the same
186 * Returns whether this {@code List} contains no elements.
188 * @return {@code true} if this {@code List} has no elements, {@code false}
195 * Returns an iterator on the elements of this {@code List}. The elements ar
[all...] |
| TreeSet.java | 27 * and removing) are supported. The elements can be any objects which are
38 /** Keys are this set's elements. Values are always Boolean.TRUE */
57 * and containing the unique elements in the specified collection.
60 * the collection of elements to add.
63 * Comparable interface, or the elements in the collection
83 * Constructs a new instance of {@code TreeSet} containing the elements of
87 * the SortedSet of elements to add.
105 * when the object cannot be compared with the elements in this
125 * elements in this {@code TreeSet}.
136 * Removes all elements from this {@code TreeSet}, leaving it empty
[all...] |
| /external/guava/src/com/google/common/collect/ |
| Iterators.java | 70 // Casting to any type is safe since there are no actual elements.
97 // Casting to any type is safe since there are no actual elements.
118 * Returns the number of elements remaining in {@code iterator}. The iterator
157 * @param removeFrom the iterator to (potentially) remove elements from
158 * @param elementsToRemove the elements to remove
159 * @return {@code true} if any elements are removed from {@code iterator}
179 * @param removeFrom the iterator to (potentially) remove elements from
182 * @return {@code true} if any elements were removed from the iterator
203 * @param removeFrom the iterator to (potentially) remove elements from
204 * @param elementsToRetain the elements to retai
[all...] |
| TreeMultiset.java | 35 * A multiset which maintains the ordering of its elements, according to either
55 * Creates a new, empty multiset, sorted according to the elements' natural
56 * order. All elements inserted into the multiset must implement the
57 * {@code Comparable} interface. Furthermore, all such elements must be
59 * {@code ClassCastException} for any elements {@code e1} and {@code e2} in
62 * element to a set whose elements are integers), the {@code add(Object)}
76 * comparator. All elements inserted into the multiset must be <i>mutually
78 * e2)} must not throw a {@code ClassCastException} for any elements {@code
84 * null value indicates that the elements' <i>natural ordering</i> should
92 * Creates an empty multiset containing the given initial elements, sorte
[all...] |
| /external/flac/libFLAC/include/private/ |
| memory.h | 48 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer);
49 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer);
50 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer);
51 FLAC__bool FLAC__memory_alloc_aligned_unsigned_array(unsigned elements, unsigned **unaligned_pointer, unsigned **aligned_pointer);
53 FLAC__bool FLAC__memory_alloc_aligned_real_array(unsigned elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer);
|
| /external/qemu-pc-bios/bochs/bios/ |
| usage.cc | 45 double elements, ratio; local
85 elements = (1.0 + double(offset) - double(last_org));
89 elements = 0.0;
91 elements = 1.0;
94 ratio = elements / (double(org) - double(last_org));
|
| /hardware/invensense/mlsdk/mllite/ |
| mlFIFO.c | 166 static uint_fast16_t inv_set_fifo_accuracy(uint_fast16_t elements,
170 if (elements) {
189 * bit set in element. The value returned are the elements that should be sent
192 static uint_fast16_t inv_set_fifo_reference(uint_fast16_t elements,
201 if ((elements & 1)
205 elements >>= 1;
209 if (elements & 1)
211 elements >>= 1;
214 elements = 0;
217 elements |= (1 << kk)
1080 uint_fast16_t elements; local
1258 uint_fast16_t elements, kk; local
[all...] |
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationElementIteratorICU.java | 16 * Iterates over the collation elements of a data string.
50 * Reset the collation elements to their initial state.
61 * @return next collation elements ordering, or NULLORDER if the end of the
94 * Set the text containing the collation elements.
95 * @param source text containing the collation elements.
109 * collation elements.
190 * ICU constant primary order mask for collation elements
194 * ICU constant secondary order mask for collation elements
198 * ICU constant tertiary order mask for collation elements
202 * ICU constant primary order shift for collation elements
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| DelayQueue.java | 18 * <tt>Delayed</tt> elements, in which an element can only be taken
24 * than or equal to zero. Even though unexpired elements cannot be
26 * treated as normal elements. For example, the <tt>size</tt> method
27 * returns the count of both expired and unexpired elements.
28 * This queue does not permit null elements.
36 * @param <E> the type of elements held in this collection
76 * Creates a <tt>DelayQueue</tt> initially containing the elements of the
79 * @param c the collection of elements to initially contain
81 * of its elements are null
147 * if this queue has no elements with an expired delay
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_list.h | 374 * @brief A standard container with linear time access to elements,
386 * %list requires linear time, but adding and removing elements (or
401 * that after elements from %list<X,Alloc1> are spliced into
497 * @brief Default constructor creates no elements.
503 * @brief Creates a %list with no elements.
512 * @param n The number of elements to initially create.
551 * Create a %list consisting of copies of the elements in the
566 * Create a %list consisting of copies of the elements from
582 * things. The _Base dtor only erases the elements, and note
583 * that if the elements themselves are pointers, the pointed-t
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 374 * @brief A standard container with linear time access to elements,
386 * %list requires linear time, but adding and removing elements (or
401 * that after elements from %list<X,Alloc1> are spliced into
497 * @brief Default constructor creates no elements.
503 * @brief Creates a %list with no elements.
512 * @param n The number of elements to initially create.
551 * Create a %list consisting of copies of the elements in the
566 * Create a %list consisting of copies of the elements from
582 * things. The _Base dtor only erases the elements, and note
583 * that if the elements themselves are pointers, the pointed-t
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 374 * @brief A standard container with linear time access to elements,
386 * %list requires linear time, but adding and removing elements (or
401 * that after elements from %list<X,Alloc1> are spliced into
497 * @brief Default constructor creates no elements.
503 * @brief Creates a %list with no elements.
512 * @param n The number of elements to initially create.
551 * Create a %list consisting of copies of the elements in the
566 * Create a %list consisting of copies of the elements from
582 * things. The _Base dtor only erases the elements, and note
583 * that if the elements themselves are pointers, the pointed-t
[all...] |
