| /external/collada/include/1.4/dom/ |
| domLibrary_physics_models.h | 22 * The library_physics_models element declares a module of physics_model elements.
42 protected: // Elements
89 * @return Returns a reference to the array of physics_model elements.
94 * @return Returns a constant reference to the array of physics_model elements.
99 * @return Returns a reference to the array of extra elements.
104 * @return Returns a constant reference to the array of extra elements.
|
| domLibrary_physics_scenes.h | 22 * The library_physics_scenes element declares a module of physics_scene elements.
42 protected: // Elements
89 * @return Returns a reference to the array of physics_scene elements.
94 * @return Returns a constant reference to the array of physics_scene elements.
99 * @return Returns a reference to the array of extra elements.
104 * @return Returns a constant reference to the array of extra elements.
|
| domLibrary_visual_scenes.h | 22 * The library_visual_scenes element declares a module of visual_scene elements.
42 protected: // Elements
89 * @return Returns a reference to the array of visual_scene elements.
94 * @return Returns a constant reference to the array of visual_scene elements.
99 * @return Returns a reference to the array of extra elements.
104 * @return Returns a constant reference to the array of extra elements.
|
| domCg_surface_type.h | 121 protected: // Elements
146 * Used to preserve order in elements that do not specify strict sequencing of sub-elements.
150 * Used to preserve order in elements that have a complex content model.
163 * @return Returns a reference to the array of annotate elements.
168 * @return Returns a constant reference to the array of annotate elements.
173 * @return Returns a reference to the array of code elements.
178 * @return Returns a constant reference to the array of code elements.
183 * @return Returns a reference to the array of include elements.
188 * @return Returns a constant reference to the array of include elements
[all...] |
| domGlsl_surface_type.h | 121 protected: // Elements
147 * Used to preserve order in elements that do not specify strict sequencing of sub-elements.
151 * Used to preserve order in elements that have a complex content model.
164 * @return Returns a reference to the array of annotate elements.
169 * @return Returns a constant reference to the array of annotate elements.
174 * @return Returns a reference to the array of code elements.
179 * @return Returns a constant reference to the array of code elements.
184 * @return Returns a reference to the array of include elements.
189 * @return Returns a constant reference to the array of include elements
[all...] |
| /external/icu4c/common/ |
| uenumimp.h | 48 * This function should count the number of elements
53 * @return number of elements in enumeration
62 * or NULL after all elements haven been enumerated.
68 * or NULL after all elements haven been enumerated
79 * or NULL after all elements haven been enumerated.
85 * or NULL after all elements haven been enumerated
|
| /external/junit/src/junit/framework/ |
| TestResult.java | 35 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
45 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
71 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
85 return fErrors.elements();
97 return fFailures.elements();
150 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
|
| /libcore/junit/src/main/java/junit/framework/ |
| TestResult.java | 35 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
45 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
71 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
85 return fErrors.elements();
97 return fFailures.elements();
150 for (Enumeration e= cloneListeners().elements(); e.hasMoreElements(); ) {
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_ListTest.java | 54 "ListTest - b) add with index failed--did not move following elements",
57 "ListTest - c) add with index failed--affected previous elements",
63 assertTrue("ListTest - b) set failed--affected following elements",
65 assertTrue("ListTest - c) set failed--affected previous elements", list
72 "ListTest - b) remove with index failed--did not move following elements",
75 "ListTest - c) remove with index failed--affected previous elements",
91 "ListTest - d) addAll with index failed--did not move following elements",
94 "ListTest - e) addAll with index failed--affected previous elements",
100 "ListTest - a) sublist Failed--does not contain correct elements",
103 "ListTest - b) sublist Failed--does not contain correct elements",
[all...] |
| /external/stlport/test/unit/ |
| deque_test.cpp | 118 //Insertion of several elements before begin
124 //Insertion of several elements after begin
125 //There is more elements to insert than elements before insertion position
131 //There is less elements to insert than elements before insertion position
137 //Insertion of several elements at end:
143 //Insertion of several elements before last:
144 //There is more elements to insert than elements after insertion positio
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| Support_ListTest.java | 54 "ListTest - b) add with index failed--did not move following elements",
57 "ListTest - c) add with index failed--affected previous elements",
63 assertTrue("ListTest - b) set failed--affected following elements",
65 assertTrue("ListTest - c) set failed--affected previous elements", list
72 "ListTest - b) remove with index failed--did not move following elements",
75 "ListTest - c) remove with index failed--affected previous elements",
91 "ListTest - d) addAll with index failed--did not move following elements",
94 "ListTest - e) addAll with index failed--affected previous elements",
100 "ListTest - a) sublist Failed--does not contain correct elements",
103 "ListTest - b) sublist Failed--does not contain correct elements",
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| deque_test.cpp | 118 //Insertion of several elements before begin
124 //Insertion of several elements after begin
125 //There is more elements to insert than elements before insertion position
131 //There is less elements to insert than elements before insertion position
137 //Insertion of several elements at end:
143 //Insertion of several elements before last:
144 //There is more elements to insert than elements after insertion positio
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| deque_test.cpp | 118 //Insertion of several elements before begin
124 //Insertion of several elements after begin
125 //There is more elements to insert than elements before insertion position
131 //There is less elements to insert than elements before insertion position
137 //Insertion of several elements at end:
143 //Insertion of several elements before last:
144 //There is more elements to insert than elements after insertion positio
[all...] |
| /bionic/libc/kernel/common/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /dalvik/dx/tests/072-dex-switch-edge-cases/ |
| Blort.java | 57 // Two elements: 0 and Integer.MIN_VALUE.
67 // Two elements: 0 and Integer.MAX_VALUE.
77 // Two elements: Integer.MIN_VALUE and Integer.MAX_VALUE.
87 // Two elements: Large enough to be packed but such that 32 bit
|
| /development/ndk/platforms/android-3/include/linux/ |
| mempool.h | 26 void **elements; member in struct:mempool_s
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractQueueTest.java | 37 private Object[] elements = new Object[CAPACITY]; field in class:AbstractQueueTest.MockAbstractQueue
53 return (E) elements[currentIndex];
61 elements[i] = elements[i + 1];
81 elements[size++] = o;
89 E e = (E) elements[0];
91 elements[i] = elements[i + 1];
101 return (E) elements[0];
|
| /external/bluetooth/glib/tests/markups/ |
| expected-1 | 17 TEXT 'nested elements'
|
| valid-1.gmarkup | 5 <e2:foo> Text <childfree/> with some <nested>nested elements</nested> and entities "& < >> ' and whitespace </e2:foo>
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_node_data.h | 39 // // data is valid, contents are in elements.
92 // Writes elements to the clipboard.
106 // Writes elements to data. If there is only one element and it is a URL
134 bool is_valid() const { return !elements.empty(); }
137 bool has_single_url() const { return is_valid() && elements[0].is_url; }
139 // Number of elements.
140 size_t size() const { return elements.size(); }
153 // The actual elements written to the clipboard.
154 std::vector<Element> elements; member in struct:BookmarkNodeData
|
| /external/chromium/chrome/browser/ui/views/ |
| accelerator_table_gtk.h | 28 // The numbers of elements in kAcceleratorMap.
|
| /external/chromium/chrome/browser/ui/webui/ |
| value_helper.h | 13 // Used to convert TabRestoreService elements to values for JSON processing.
|
| /external/doclava/res/assets/templates/components/ |
| api_filter.cs | 7 <!-- option elements added by buildApiLevelSelector() -->
|
| /external/expat/bcb5/ |
| elements.bpf | 1 USEUNIT("..\examples\elements.c");
|
| /external/llvm/include/llvm/ADT/ |
| SmallVector.h | 30 // additional overloads so that elements with pointer types are recognized as
58 // Allocate raw space for N elements of type T. If T has a ctor or dtor, we
140 /// capacity - Return the total number of elements in the currently allocated
188 /// starting with "Dest", constructing elements into it as needed.
209 // Copy the elements over.
212 // Destroy the original elements.
236 /// starting with "Dest", constructing elements into it as needed.
244 /// starting with "Dest", constructing elements into it as needed.
279 // Destroy the constructed elements in the vector.
355 // Copy the new elements over
[all...] |
