| /external/webkit/Source/WebCore/rendering/ |
| InlineBox.cpp | 171 // Paint all phases of replaced elements atomically, as though the replaced element established its
172 // own stacking context. (See Appendix E.2, section 6.4 on inline block/table elements in the CSS2.1
192 // Hit test all phases of replaced elements atomically, as though the replaced element established its
193 // own stacking context. (See Appendix E.2, section 6.4 on inline block/table elements in the CSS2.1
271 // Non-replaced elements can always accommodate an ellipsis.
|
| /external/webkit/Source/WebCore/svg/animation/ |
| SMILTimeContainer.cpp | 159 // FIXME: This should also consider possible timing relations between the elements.
162 // Frozen elements need to be prioritized based on their previous interval.
251 // Sort according to priority. Elements with later begin time have higher priority.
253 // FIXME: This should also consider timing relationships between the elements. Dependents
309 // Apply results to target elements.
|
| /frameworks/base/docs/html/guide/tutorials/views/ |
| hello-tabwidget.jd | 50 A TabHost requires two descendant elements: a {@link android.widget.TabWidget} and a {@link android.widget.FrameLayout}.
51 In order to properly layout these elements, we've put them inside a vertical {@link android.widget.LinearLayout}.
55 <p>Notice that the TabWidget and the FrameLayout elements have specific <code>android</code> namespace IDs. These are necessary
60 make these child views as large as complex as you'd like — instead of the TextView elements,
92 our content is an ID reference to the TextView elements we inserted in the FrameLayout.</p>
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| workstealing.h | 69 /** @brief Number of elements, i. e. @c last-first+1.
86 * processed elements (depends on functionality).
89 * @param bound Maximum number of elements processed (e. g. for
166 // Number of elements to steal in one attempt.
265 // Number of elements to steal (at least one).
|
| multiway_merge.h | 138 /** @brief Compare two elements referenced by guarded iterators.
154 /** @brief Compare two elements referenced by guarded iterators.
233 /** @brief Compare two elements referenced by unguarded iterators.
246 /** @brief Compare two elements referenced by unguarded iterators.
280 * total number of elements available.
400 * total number of elements available.
524 * total number of elements available.
599 * @pre No input will run out of elements during the merge.
606 * total number of elements available.
694 * total number of elements available
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| DomUtilities.java | 177 * @return a pair of parent and child elements, where either the parent or the child
287 * Returns a range of elements for the given caret range. Note that the two elements
294 * @return a pair of begin+end elements, or null
510 * @return a list of child elements, possibly empty but never null
530 * Returns true iff the given elements are contiguous siblings
532 * @param elements the elements to be tested
533 * @return true if the elements are contiguous siblings with no gaps
535 public static boolean isContiguous(List<Element> elements) {
[all...] |
| /external/v8/src/ia32/ |
| ic-ia32.cc | 100 // Probe the string dictionary in the |elements| register. Jump to the
107 Register elements,
118 __ mov(r1, FieldOperand(elements, kCapacityOffset));
143 __ cmp(name, Operand(elements, r0, times_4,
164 Register elements,
171 // elements - holds the property dictionary on entry and is unchanged.
189 elements,
202 __ test(Operand(elements, r0, times_4, kDetailsOffset - kHeapObjectTag),
208 __ mov(result, Operand(elements, r0, times_4, kValueOffset - kHeapObjectTag));
221 Register elements,
[all...] |
| /external/guava/javadoc/com/google/common/collect/ |
| ImmutableSortedSet.Builder.html | 156 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html#add(E...)">add</A></B>(<A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="type parameter in ImmutableSortedSet.Builder">E</A>... elements)</CODE>
159 Adds each element of <code>elements</code> to the <code>ImmutableSortedSet</code>,
160 ignoring duplicate elements (only the first duplicate element is added).</TD>
173 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html#addAll(java.lang.Iterable)">addAll</A></B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</A><? extends <A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="type parameter in ImmutableSortedSet.Builder">E</A>> elements)</CODE>
176 Adds each element of <code>elements</code> to the <code>ImmutableSortedSet</code>,
177 ignoring duplicate elements (only the first duplicate element is added).</TD>
182 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html#addAll(java.util.Iterator)">addAll</A></B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/util/Iterator.html?is-external=true" title="class or interface in java.util">Iterator</A><? extends <A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="type parameter in ImmutableSortedSet.Builder">E</A>> elements)</CODE>
185 Adds each element of <code>elements</code> to the <code>ImmutableSortedSet</code>,
186 ignoring duplicate elements (only the first duplicate element is added).</TD>
265 public <A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="class in com.google.common.collect">ImmutableSortedSet.Builder</A><<A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="type parameter in ImmutableSortedSet.Builder">E</A>> <B>add</B>(<A HREF="../../../../com/google/common/collect/ImmutableSortedSet.Builder.html" title="type parameter in ImmutableSortedSet.Builder">E</A>... elements)</PRE
[all...] |
| ImmutableList.Builder.html | 154 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html#add(E...)">add</A></B>(<A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="type parameter in ImmutableList.Builder">E</A>... elements)</CODE>
157 Adds each element of <code>elements</code> to the <code>ImmutableList</code>.</TD>
170 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html#addAll(java.lang.Iterable)">addAll</A></B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</A><? extends <A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="type parameter in ImmutableList.Builder">E</A>> elements)</CODE>
173 Adds each element of <code>elements</code> to the <code>ImmutableList</code>.</TD>
178 <TD><CODE><B><A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html#addAll(java.util.Iterator)">addAll</A></B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/util/Iterator.html?is-external=true" title="class or interface in java.util">Iterator</A><? extends <A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="type parameter in ImmutableList.Builder">E</A>> elements)</CODE>
181 Adds each element of <code>elements</code> to the <code>ImmutableList</code>.</TD>
257 public <A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="class in com.google.common.collect">ImmutableList.Builder</A><<A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="type parameter in ImmutableList.Builder">E</A>> <B>addAll</B>(<A HREF="http://java.sun.com/javase/6/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</A><? extends <A HREF="../../../../com/google/common/collect/ImmutableList.Builder.html" title="type parameter in ImmutableList.Builder">E</A>> elements)</PRE>
259 <DD>Adds each element of <code>elements</code> to the <code>ImmutableList</code>.
265 <DT><B>Parameters:</B><DD><CODE>elements</CODE> - the <code>Iterable</code> to add to the <code>ImmutableList</code>
268 <DD><CODE><A HREF="http://java.sun.com/javase/6/docs/api/java/lang/NullPointerException.html?is-external=true" title="class or interface in java.lang">NullPointerException</A></CODE> - if <code>elements</code> is null or contains
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| HashtableTest.java | 159 Enumeration el = h.elements();
229 Enumeration e = elmVector.elements();
245 * java.util.Hashtable#elements()
248 // Test for method java.util.Enumeration java.util.Hashtable.elements()
249 Enumeration elms = ht10.elements();
263 // * java.util.Hashtable#elements()
269 // // these three elements hash to the same bucket in a 7 element Hashtable
276 // Enumeration en = ht.elements();
308 Enumeration e = elmVector.elements();
467 Enumeration e = keyVector.elements();
[all...] |
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| hooks.sgml | 30 @hook_size: the size of the #GHookList elements, in bytes
163 Removes all the #GHook elements from a #GHookList.
213 @func: the comparison function used to sort the #GHook elements
218 Defines the type of function used to compare #GHook elements in
229 Compares the ids of two #GHook elements, returning a negative value
254 @need_valids: %TRUE if #GHook elements which have been destroyed should be
278 @need_valids: %TRUE if #GHook elements which have been destroyed should be
291 @need_valids: %TRUE if #GHook elements which have been destroyed should be
304 @need_valids: %TRUE if #GHook elements which have been destroyed should be
|
| /external/guava/src/com/google/common/collect/ |
| ConcurrentHashMultiset.java | 41 * elements are not supported.
79 * elements, using the default initial capacity, load factor, and concurrency
82 * @param elements the elements that the multiset should contain
85 Iterable<? extends E> elements) {
87 Iterables.addAll(multiset, elements);
92 * Creates an instance using {@code countMap} to store elements and their
98 * @param countMap backing map for storing the elements in the multiset and
468 * @serialData the number of distinct elements, the first element, its count,
|
| /external/qemu/ |
| qemu-queue.h | 48 * pointers for a hash table header). The elements are doubly linked
50 * traverse the list. New elements can be added to the list before
55 * list and the other to the tail of the list. The elements are singly
56 * linked to save space, so elements can only be removed from the
57 * head of the list. New elements can be added to the list after
62 * list and the other to the tail of the list. The elements are doubly
64 * traverse the list. New elements can be added to the list before or
69 * list and the other to the tail of the list. The elements are doubly
71 * traverse the list. New elements can be added to the list before or after
|
| /external/v8/tools/ |
| generate-ten-powers.scm | 91 (nb-elements (+ (- from) to 1))
92 (vec (make-vector nb-elements))
154 (nb-elements 0)
162 (print "// nb elements (" n "): " nb-elements))
168 (+ nb-elements 1)
194 "// thus hold all elements. The higher i the fewer elements it has.\n"
198 "// binary exponent distance between all elements of a given cache.\n"
|
| /external/webkit/Source/WebCore/platform/network/mac/ |
| FormDataStreamMac.mm | 244 // Append in reverse order since we remove elements from the end.
245 size_t size = formData->elements().size();
248 newInfo->remainingElements.append(formData->elements()[size - i - 1]);
391 size_t count = formData->elements().size();
395 const FormDataElement& element = formData->elements()[0];
408 const FormDataElement& element = formData->elements()[i];
421 const FormDataElement& element = formData->elements()[i];
443 count = formData->elements().size();
450 const FormDataElement& element = formData->elements()[i];
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/grid/ |
| GridLayoutPainter.java | 43 * @param elements the dragged elements
47 IDragElement[] elements) {
48 return new DropFeedbackPainter(rule, elements);
113 * A painter which can paint the drop feedback for elements being dragged into or
122 * @param elements the elements to draw */
123 public DropFeedbackPainter(GridLayoutRule rule, IDragElement[] elements) {
125 mElements = elements;
|
| /external/v8/src/mips/ |
| virtual-frame-mips.h | 47 // as random access to the expression stack elements, locals, and
117 // The number of elements on the virtual frame.
153 // Add extra in-memory elements to the top of the frame to match an actual
158 // Forget elements from the top of the frame to match an actual frame (eg,
229 // Prepare for returning from the frame by elements in the virtual frame.
325 // Drop a number of elements from the top of the expression stack. May
353 // Duplicate the two elements on top of stack.
374 // Takes the top two elements and puts them in a0 (top element) and a1
442 // The number of elements on the stack frame.
451 // by the number of elements on the not-very-virtual stack frame
[all...] |
| /external/v8/src/ |
| string.js | 246 var builder_elements = builder.elements;
541 // If the separator string is empty then return the elements in the subject.
826 this.elements = %_Arguments(1);
828 this.elements = new InternalArray();
836 if (str.length > 0) this.elements.push(str);
844 this.elements.push((start << 11) | len);
848 var elements = this.elements;
849 elements.push(-len);
850 elements.push(start)
[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...] |
| /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...] |
| /external/llvm/lib/VMCore/ |
| Type.cpp | 188 // Okay, our struct is sized if all of the elements are.
400 void StructType::setBody(ArrayRef<Type*> Elements, bool isPacked) {
408 TypeAllocator.Allocate<Type*>(Elements.size());
409 memcpy(Elts, Elements.data(), sizeof(Elements[0])*Elements.size());
412 NumContainedTys = Elements.size();
469 assert(type != 0 && "Cannot create a struct type with no elements with this");
482 ArrayRef<Type*> Elements, bool isPacked) {
484 ST->setBody(Elements, isPacked)
[all...] |
| /external/webkit/Source/WebCore/svg/ |
| SVGUseElement.cpp | 287 // Update whole subtree, scanning for shadow container elements, that correspond to <svg>/<symbol> tags
340 // Update whole subtree, scanning for shadow container elements, marking a cloned use subtree
514 // Do not build the shadow/instance tree for <use> elements living in a shadow tree.
570 // Expand all <use> elements in the shadow tree.
574 // Expand all <symbol> elements in the shadow tree.
580 // shadow tree elements <-> instances in the instance tree.
595 // Transfer event listeners assigned to the referenced element to our shadow tree elements.
720 // Spec: If the 'use' element references a 'g' which contains two 'rect' elements, then the instance tree
808 // case where <use> doesn't contain disallowed elements (ie. <foreignObject>).
809 // Though if there are disallowed elements in the subtree, we have to remove them
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| VectorTest.java | 120 assertTrue("Vector does not contain correct elements", myVector
171 assertTrue("Failed to add all elements",
221 assertTrue("Failed to add all elements", tVector.equals(v));
226 assertTrue("Failed to add elements correctly", v.get(counter) == v
297 Enumeration e = orgVector.elements();
299 assertTrue("a) Cleared vector contained elements", !tVector
305 e = orgVector.elements();
307 assertTrue("b) Cleared vector contained elements", !tVector
319 Enumeration orgNum = tVector.elements();
320 Enumeration cnum = v.elements();
[all...] |
| /external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/ |
| X509Extensions.java | 297 e = ordering.elements();
305 e = this.ordering.elements();
326 Enumeration e = objectIDs.elements();
335 e = this.ordering.elements();
352 return ordering.elements();
391 Enumeration e = ordering.elements();
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 176 // The nodes don't know how many elements they contain - that information is
200 /// copy - Copy elements from another node.
201 /// @param Other Node elements are copied from.
204 /// @param Count Number of elements to copy.
216 /// moveLeft - Move elements to the left.
219 /// @param Count Number of elements to copy.
221 assert(j <= i && "Use moveRight shift elements right");
225 /// moveRight - Move elements to the right.
228 /// @param Count Number of elements to copy.
230 assert(i <= j && "Use moveLeft shift elements left")
[all...] |
