/external/chromium_org/third_party/skia/bench/ |
H A D | FontCacheBench.cpp | 41 const uint16_t* array = gUniqueGlyphIDs; variable 42 while (*array != gUniqueGlyphIDs_Sentinel) { 43 int count = count_glyphs(array); 45 paint.measureText(array, count * sizeof(uint16_t)); 47 array += count + 1; // skip the sentinel 79 static int count_collisions(const uint16_t array[], int count, HasherProc proc, argument 86 int index = proc(array[i]) & hashMask; 93 static void dump_array(const uint16_t array[], int count) { argument 95 SkDebugf(" %d,", array[i]); 125 const uint16_t* array variable [all...] |
H A D | SortBench.cpp | 15 static void rand_proc(int array[N]) { argument 18 array[i] = rand.nextS(); 22 static void randN_proc(int array[N]) { argument 26 array[i] = rand.nextU() % mod; 30 static void forward_proc(int array[N]) { argument 32 array[i] = i; 36 static void backward_proc(int array[N]) { argument 38 array[i] = -i; 42 static void same_proc(int array[N]) { argument 44 array[ 65 skqsort_sort(int array[N]) argument 70 skheap_sort(int array[N]) argument 82 qsort_sort(int array[N]) argument [all...] |
/external/skia/bench/ |
H A D | FontCacheBench.cpp | 40 const uint16_t* array = gUniqueGlyphIDs; variable 41 while (*array != gUniqueGlyphIDs_Sentinel) { 42 int count = count_glyphs(array); 44 paint.measureText(array, count * sizeof(uint16_t)); 46 array += count + 1; // skip the sentinel 89 static int count_collisions(const uint16_t array[], int count, HasherProc proc, argument 96 int index = proc(array[i]) & hashMask; 103 static void dump_array(const uint16_t array[], int count) { argument 105 SkDebugf(" %d,", array[i]); 135 const uint16_t* array variable [all...] |
H A D | SortBench.cpp | 15 static void rand_proc(int array[N]) { argument 18 array[i] = rand.nextS(); 22 static void randN_proc(int array[N]) { argument 26 array[i] = rand.nextU() % mod; 30 static void forward_proc(int array[N]) { argument 32 array[i] = i; 36 static void backward_proc(int array[N]) { argument 38 array[i] = -i; 42 static void same_proc(int array[N]) { argument 44 array[ 65 skqsort_sort(int array[N]) argument 70 skheap_sort(int array[N]) argument 82 qsort_sort(int array[N]) argument [all...] |
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
H A D | write_bits.h | 15 // Write bits into a byte array. 53 uint8_t * __restrict array) { 63 uint8_t *p = &array[*pos >> 3]; 70 uint8_t *array_pos = &array[*pos >> 3]; 85 inline void WriteBitsPrepareStorage(int pos, uint8_t *array) { argument 90 array[pos >> 3] = 0; 50 WriteBits(int n_bits, uint64_t bits, int * __restrict pos, uint8_t * __restrict array) argument
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | array-iteration.js | 28 // Tests for non-standard array iteration functions. 50 // Modify original array. 52 assertArrayEquals([42,42], a.filter(function(n, index, array) { array[index] = 43; return 42 == n; })); 55 // Only loop through initial part of array eventhough elements are 58 assertArrayEquals([], a.filter(function(n, index, array) { array.push(n+1); return n == 2; })); 90 // Modify original array. 93 a.forEach(function(n, index, array) { array[inde [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_first_aligned.cpp | 13 void test_eigen2_first_aligned_helper(Scalar *array, int size) argument 16 VERIFY(((std::size_t(array) + sizeof(Scalar) * ei_alignmentOffset(array, size)) % packet_size) == 0); 20 void test_eigen2_none_aligned_helper(Scalar *array, int size) argument 22 VERIFY(ei_packet_traits<Scalar>::size == 1 || ei_alignmentOffset(array, size) == size);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | AbstractCollectionTester.java | 52 * @return an array of the proper size with {@code null} inserted into the 56 E[] array = createSamplesArray(); 57 array[getNullLocation()] = null; 58 return array; 62 E[] array = createArrayWithNullElement(); 63 resetContainer(getSubjectGenerator().create(array));
|
/external/hamcrest/library/src/org/hamcrest/collection/ |
H A D | IsArray.java | 16 public boolean matchesSafely(T[] array) { argument 17 if (array.length != elementMatchers.length) return false; 19 for (int i = 0; i < array.length; i++) { 20 if (!elementMatchers[i].matches(array[i])) return false; 61 public static <T> IsArray<T> array(Matcher<T>... elementMatchers) { method in class:IsArray
|
/external/libcxx/test/containers/sequences/array/array.size/ |
H A D | size.pass.cpp | 10 // <array> 12 // template <class T, size_t N> constexpr size_type array<T,N>::size(); 14 #include <array> 21 typedef std::array<T, 3> C; 29 typedef std::array<T, 0> C; 38 typedef std::array<T, 3> C; 46 typedef std::array<T, 0> C;
|
/external/libcxx/test/containers/sequences/array/array.tuple/ |
H A D | get.pass.cpp | 10 // <array> 12 // template <size_t I, class T, size_t N> T& get(array<T, N>& a); 14 #include <array> 19 std::array<int, 3> a; 24 constexpr std::array<int, 2> getArr () { return { 3, 4 }; } 31 typedef std::array<T, 3> C; 41 typedef std::array<T, 3> C;
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
H A D | ClassNameReader.java | 38 final List array = new ArrayList(); 47 array.add( name.replace('/', '.') ); 49 array.add( superName.replace('/', '.') ); 52 array.add( interfaces[i].replace('/', '.') ); 60 return (String[])array.toArray( new String[]{} );
|
/external/mockito/src/org/mockito/internal/matchers/ |
H A D | ArrayEquals.java | 55 private void appendArray(Object[] array, Description description) { argument 57 for (int i = 0; i < array.length; i++) { 58 new Equals(array[i]).describeTo(description); 59 if (i != array.length - 1) { 66 public static Object[] createObjectArray(Object array) { argument 67 if (array instanceof Object[]) { 68 return (Object[]) array; 70 Object[] result = new Object[Array.getLength(array)]; 71 for (int i = 0; i < Array.getLength(array); i++) { 72 result[i] = Array.get(array, [all...] |
/external/chromium_org/v8/src/ |
H A D | transitions.cc | 17 Handle<FixedArray> array = local 19 array->set(kPrototypeTransitionsIndex, Smi::FromInt(0)); 20 return Handle<TransitionArray>::cast(array); 26 Handle<FixedArray> array = local 28 array->set(kSimpleTransitionTarget, *target); 29 return Handle<TransitionArray>::cast(array); 70 // A transition array may shrink during GC. 104 // The map's transition array may grown smaller during the allocation above as 109 TransitionArray* array = map->transitions(); local 110 if (array [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | markselection.js | 51 var array = cm.state.markedSelection; 58 if (addAt == null) array.push(mark); 59 else array.splice(addAt++, 0, mark); 66 var array = cm.state.markedSelection; 67 for (var i = 0; i < array.length; ++i) array[i].clear(); 68 array.length = 0; 84 var array = cm.state.markedSelection; 85 if (!array.length) return coverRange(cm, from, to); 87 var coverStart = array[ [all...] |
/external/chromium_org/mojo/python/tests/ |
H A D | async_wait_unittest.py | 17 self.array = [] 26 self.array = None 30 self.array.append(value) 41 self.assertEquals(len(self.array), 1) 42 self.assertEquals(system.RESULT_OK, self.array[0]) 47 self.assertEquals(len(self.array), 0) 52 self.assertEquals(len(self.array), 0)
|
/external/chromium_org/v8/test/webkit/ |
H A D | array-filter.js | 26 function passUndefined(element, index, array) { 40 function toObject(array) { 42 result.length = array.length; 43 for (var i in array) 44 result[i] = array[i]; 48 function reverseInsertionOrder(array) { 49 var obj = toObject(array);
|
H A D | array-holes.js | 26 function isHole(array, index) 28 if (index >= array.length) 32 var isHole = array[index] == "room"; 37 function showHoles(array) 40 for (i = 0; i < array.length; ++i) { 43 if (isHole(array, i)) 46 string += array[i];
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | ListRetainAllTester.java | 41 E[] array = createSamplesArray(); 42 array[1] = samples.e0; 43 collection = getSubjectGenerator().create(array); 46 expectContents(array); 53 E[] array = createSamplesArray(); 54 array[1] = samples.e0; 55 collection = getSubjectGenerator().create(array);
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | generate.sh | 136 * {@code array}. 138 * @param array an array of {@code primtyp} values, possibly empty 140 * @return {@code true} if {@code array[i] == target} for some value of {@code 143 public static boolean contains(primtyp[] array, primtyp target) { 144 for (primtyp value : array) { 154 * {@code array}. 156 * @param array an array of {@code primtyp} values, possibly empty 158 * @return the least index {@code i} for which {@code array[ [all...] |
/external/eigen/unsupported/test/ |
H A D | mpreal_support.cpp | 30 VERIFY(Eigen::internal::isApprox(A.array().abs2().sum(), A.squaredNorm())); 31 VERIFY_IS_APPROX(A.array().exp(), exp(A.array())); 32 VERIFY_IS_APPROX(A.array().abs2().sqrt(), A.array().abs()); 33 VERIFY_IS_APPROX(A.array().sin(), sin(A.array())); 34 VERIFY_IS_APPROX(A.array().cos(), cos(A.array()));
|
/external/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/ |
H A D | partial_sort_comp.pass.cpp | 38 int* array = new int[N]; local 40 array[i] = i; 41 std::random_shuffle(array, array+N); 42 std::partial_sort(array, array+M, array+N, std::greater<int>()); 44 assert(array[i] == N-i-1); 45 delete [] array;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | unistr_props.cpp | 33 UChar *array = getArrayStart(); local 44 U16_PREV(array, 0, i, c); 61 U16_NEXT(array, i, length, c);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 51 * Generic helper for growing an array that has separate size/count 66 #define memory_pool_array_reserve(pool, type, array, size, reserved, num) do { \ 74 memcpy(newarray, (array), (size) * sizeof(type)); \ 75 (array) = newarray; \
|
/external/clang/test/PCH/ |
H A D | objc_container.h | 14 NSMutableArray *array; local 15 id oldObject = array[10]; 17 array[10] = oldObject;
|