| /external/chromium_org/chrome/browser/ui/webui/options/chromeos/ |
| bluetooth_options_browsertest.js | 124 // layout of a list creates DOM elements only for visible elements in the
127 // elements in an auto-expanding list. This test ensures the problem stays
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | [all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/vbo/ |
| vbo_exec_array.c | 81 * Compute min and max elements by scanning the index buffer for
82 * glDraw[Range]Elements() calls.
184 * Compute min and max elements for nr_prims
287 const void *elements, GLint basevertex)
298 elements = ADD_POINTERS(elements, elemMap);
307 j = ((const GLubyte *) elements)[i];
310 j = ((const GLushort *) elements)[i];
313 j = ((const GLuint *) elements)[i];
320 for (k = 0; k < Elements(arrayObj->VertexAttrib); k++)
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| array-splice.js | 226 // performing ToInteger on arguments. However, v8 ignores elements
244 // Now check the case with array of holes and some elements on prototype.
294 // Now check the case with array of holes and some elements on prototype.
|
| array-literal-feedback.js | 63 // crankshafted code should de-opt on the unexpected elements kind
|
| /external/libvpx/libvpx/vp9/common/arm/neon/ |
| vp9_short_idct16x16_add_neon.asm | 48 ; idct16 stage1 - stage6 on all the elements loaded in q8-q15. The output
53 ; TODO(hkuang): Find a better way to load the elements.
54 ; load elements of 0, 2, 4, 6, 8, 10, 12, 14 into q8 - q15
294 ; idct16 stage1 - stage7 on all the elements loaded in q8-q15. The output
300 ; TODO(hkuang): Find a better way to load the elements.
301 ; load elements of 1, 3, 5, 7, 9, 11, 13, 15 into q8 - q15
798 ; idct16 stage1 - stage6 on all the elements loaded in q8-q15. The output
803 ; TODO(hkuang): Find a better way to load the elements.
804 ; load elements of 0, 2, 4, 6, 8, 10, 12, 14 into q8 - q15
[all...] |
| /external/mesa3d/src/mesa/vbo/ |
| vbo_exec_array.c | 81 * Compute min and max elements by scanning the index buffer for
82 * glDraw[Range]Elements() calls.
184 * Compute min and max elements for nr_prims
287 const void *elements, GLint basevertex)
298 elements = ADD_POINTERS(elements, elemMap);
307 j = ((const GLubyte *) elements)[i];
310 j = ((const GLushort *) elements)[i];
313 j = ((const GLuint *) elements)[i];
320 for (k = 0; k < Elements(arrayObj->VertexAttrib); k++)
[all...] |
| /external/v8/test/mjsunit/ |
| array-splice.js | 226 // performing ToInteger on arguments. However, v8 ignores elements
244 // Now check the case with array of holes and some elements on prototype.
294 // Now check the case with array of holes and some elements on prototype.
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3basetree.c | 219 /// Add all elements of the supplied list as children of this node
450 ANTLR3_FREE(newChildren->elements);
451 newChildren->elements = NULL;
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| resizableverticalsplitview.js | 47 * Repositions all of the elements to fit the window.
|
| /external/chromium_org/content/renderer/pepper/ |
| v8_var_converter.cc | 293 for (size_t i = 0; i < array_var->elements().size(); ++i) {
294 const PP_Var& child_var = array_var->elements()[i].get();
|
| v8_var_converter_unittest.cc | 81 if (v8_array->Length() != array_var->elements().size())
85 if (!Equals(array_var->elements()[i].get(), child_v8, visited_ids))
|
| /external/chromium_org/courgette/ |
| ensemble_create.cc | 9 // The idea is applied to pieces (or 'elements') of the whole (or 'ensemble').
10 // Each of the elements has to go through the same set of steps in lock-step.
104 // from 'old' is matched as the closest element to multiple elements from 'new'.
114 // size between matching elements.
127 // FindGenerators finds TransformationPatchGenerators for the elements of
130 // differential compression. The elements have to be the same kind so as to
141 std::vector<Element*> old_elements(old_ensemble->elements());
142 std::vector<Element*> new_elements(new_ensemble->elements());
144 VLOG(1) << "old has " << old_elements.size() << " elements";
145 VLOG(1) << "new has " << new_elements.size() << " elements";
[all...] |
| /external/chromium_org/ppapi/proxy/ |
| resource_creation_proxy.cc | 160 const PP_Resource elements[],
163 OBJECT_IS_PROXY, instance, elements, size);
|
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AccessibilityRenderObject.cpp | 486 // Widgets are the replaced elements that we represent to AX as attachments
507 // See https://wiki.mozilla.org/Accessibility/AT-Windows-API for the elements
625 // for this information for all elements.
713 // text elements that are just empty whitespace should not be returned
754 // problematic for platforms which have distinct roles for textual block elements.
817 // Don't ignore generic focusable elements like <div tabindex=0>
831 // Properties of static elements.
953 // Properties of interactive elements.
1077 Vector<Element*> elements; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pt.c | 326 #define PRIM_RESTART_LOOP(elements) \
329 if (elements[i] == info->restart_index) { \
350 * Scan for restart indexes and draw the runs of elements/vertices between
475 debug_printf("Elements:\n");
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-1692.js | 87 // Fast elements.
|
| regress-fast-literal-transition.js | 30 // Test that the elements kind of the boilerplate object is sufficiently
|
| /external/clang/lib/CodeGen/ |
| CGExprConstant.cpp | 43 SmallVector<llvm::Constant *, 32> Elements;
150 Elements.push_back(InitCst);
195 assert(!Elements.empty() && "Elements can't be empty!");
231 llvm::Value *LastElt = Elements.back();
252 Elements.pop_back();
257 assert(isa<llvm::UndefValue>(Elements.back()) &&
258 Elements.back()->getType()->isIntegerTy(CharWidth) &&
263 Elements.back() = llvm::ConstantInt::get(CGM.getLLVMContext(), Tmp);
283 Elements.push_back(llvm::ConstantInt::get(CGM.getLLVMContext(), Tmp))
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/configuration/org.eclipse.osgi/bundles/110/1/.cp/ant_tasks/ |
| publisher-ant.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/ |
| buildTools.jar | |
| /external/guava/guava/src/com/google/common/collect/ |
| ConcurrentHashMultiset.java | 45 * {@code Multiset} operations (exceptions where noted). Null elements are not supported.
85 * Creates a new {@code ConcurrentHashMultiset} containing the specified elements, using
88 * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
90 * @param elements the elements that the multiset should contain
92 public static <E> ConcurrentHashMultiset<E> create(Iterable<? extends E> elements) {
94 Iterables.addAll(multiset, elements);
125 * Creates an instance using {@code countMap} to store elements and their counts.
130 * @param countMap backing map for storing the elements in the multiset and
568 * @serialData the ConcurrentMap of elements and their counts
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultiset.java | 36 * A multiset which maintains the ordering of its elements, according to either
56 * Creates a new, empty multiset, sorted according to the elements' natural
57 * order. All elements inserted into the multiset must implement the
58 * {@code Comparable} interface. Furthermore, all such elements must be
60 * {@code ClassCastException} for any elements {@code e1} and {@code e2} in
63 * 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
96 * Creates an empty multiset containing the given initial elements, sorte
[all...] |
| /external/libffi/src/ia64/ |
| ffi.c | 196 ffi_type **ptr = &type->elements[0];
198 for (ptr = &type->elements[0]; *ptr ; ptr++)
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pt.c | 326 #define PRIM_RESTART_LOOP(elements) \
329 if (elements[i] == info->restart_index) { \
350 * Scan for restart indexes and draw the runs of elements/vertices between
475 debug_printf("Elements:\n");
|
