HomeSort by relevance Sort by last modified time
    Searched refs:array (Results 501 - 525 of 1532) sorted by null

<<21222324252627282930>>

  /external/v8/test/mjsunit/
array-join.js 28 // Test that array join calls toString on subarrays.
36 // Replace array.prototype.toString.
37 Array.prototype.toString = function() { return "array"; }
38 assertEquals('array*3*4*array*array', a.join('*'));
40 Array.prototype.toString = function() { throw 42; }
43 Array.prototype.toString = function() { return "array"; }
    [all...]
array-iteration.js 28 // Tests for non-standard array iteration functions.
32 // <http://developer.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Global_Objects:Array>
37 // Array.prototype.filter
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; }));
62 a = new Array(20)
    [all...]
array-functions-prototype-misc.js 61 return new Array(length);
63 the_prototype = Array.prototype;
64 push_function = function(array, elt) {
65 return array.push(elt);
67 concat_function = function(array, other) {
68 return array.concat(other);
70 slice_function = function(array, start, len) {
71 return array.slice(start, len);
73 splice_function = function(array, start, len) {
74 return array.splice(start, len)
    [all...]
  /external/e2fsprogs/e2fsck/
dirinfo.c 20 struct dir_info *array; member in struct:dir_info_db
80 db->array = 0;
98 db->array = (struct dir_info *)
129 &ctx->dir_info->array);
151 * the dir_info array needs to be sorted by inode number for
155 ctx->dir_info->array[ctx->dir_info->count-1].ino >= ino) {
157 if (ctx->dir_info->array[i-1].ino < ino)
159 dir = &ctx->dir_info->array[i];
162 ctx->dir_info->array[j] = ctx->dir_info->array[j-1]
    [all...]
  /external/guava/src/com/google/common/collect/
ImmutableSet.java 318 Object[] array = new Object[size()]; local
319 Platform.unsafeArrayCopy(elements, 0, array, 0, size());
320 return array;
323 @Override public <T> T[] toArray(T[] array) {
325 if (array.length < size) {
326 array = ObjectArrays.newArray(array, size);
327 } else if (array.length > size) {
328 array[size] = null;
330 Platform.unsafeArrayCopy(elements, 0, array, 0, size)
    [all...]
  /dalvik/libcore/nio/src/main/java/java/nio/
FloatBuffer.java 25 * <li>{@link #allocate(int) Allocate} a new float array and create a buffer
27 * <li>{@link #wrap(float[]) Wrap} an existing float array to create a new
37 * Creates a float buffer based on a newly allocated float array.
53 * Creates a new float buffer by wrapping the given float array.
56 * {@code wrap(array, 0, array.length)}.
58 * @param array
59 * the float array which the new buffer will be based on.
62 public static FloatBuffer wrap(float[] array) {
63 return wrap(array, 0, array.length)
122 public final float[] array() { method in class:FloatBuffer
    [all...]
IntBuffer.java 25 * <li>{@link #allocate(int) Allocate} a new int array and create a buffer
27 * <li>{@link #wrap(int[]) Wrap} an existing int array to create a new buffer;</li>
35 * Creates an int buffer based on a newly allocated int array.
51 * Creates a new int buffer by wrapping the given int array.
54 * {@code wrap(array, 0, array.length)}.
56 * @param array
57 * the int array which the new buffer will be based on.
60 public static IntBuffer wrap(int[] array) {
61 return wrap(array, 0, array.length)
119 public final int[] array() { method in class:IntBuffer
    [all...]
LongBuffer.java 25 * <li>{@link #allocate(int) Allocate} a new long array and create a buffer
27 * <li>{@link #wrap(long[]) Wrap} an existing long array to create a new
37 * Creates a long buffer based on a newly allocated long array.
53 * Creates a new long buffer by wrapping the given long array.
56 * {@code wrap(array, 0, array.length)}.
58 * @param array
59 * the long array which the new buffer will be based on.
62 public static LongBuffer wrap(long[] array) {
63 return wrap(array, 0, array.length)
121 public final long[] array() { method in class:LongBuffer
    [all...]
ShortBuffer.java 25 * <li>{@link #allocate(int) Allocate} a new short array and create a buffer
27 * <li>{@link #wrap(short[]) Wrap} an existing short array to create a new
37 * Creates a short buffer based on a newly allocated short array.
53 * Creates a new short buffer by wrapping the given short array.
56 * {@code wrap(array, 0, array.length)}.
58 * @param array
59 * the short array which the new buffer will be based on.
62 public static ShortBuffer wrap(short[] array) {
63 return wrap(array, 0, array.length)
121 public final short[] array() { method in class:ShortBuffer
    [all...]
DoubleBuffer.java 25 * <li>{@link #allocate(int) Allocate} a new double array and create a buffer
27 * <li>{@link #wrap(double[]) Wrap} an existing double array to create a new
38 * Creates a double buffer based on a newly allocated double array.
54 * Creates a new double buffer by wrapping the given double array.
57 * {@code wrap(array, 0, array.length)}.
59 * @param array
60 * the double array which the new buffer will be based on.
63 public static DoubleBuffer wrap(double[] array) {
64 return wrap(array, 0, array.length)
120 public final double[] array() { method in class:DoubleBuffer
    [all...]
  /external/bluetooth/glib/gthread/
gthread-win32.c 93 GPtrArray *array; member in struct:_GCond
187 retval->array = g_ptr_array_new ();
198 if (cond->array->len > 0)
200 SetEvent (g_ptr_array_index (cond->array, 0));
201 g_ptr_array_remove_index (cond->array, 0);
213 for (i = 0; i < cond->array->len; i++)
214 SetEvent (g_ptr_array_index (cond->array, i));
216 g_ptr_array_set_size (cond->array, 0);
239 g_ptr_array_add (cond->array, event);
252 g_ptr_array_remove (cond->array, event)
352 gpointer* array = TlsGetValue (g_private_tls); local
370 gpointer* array = TlsGetValue (g_private_tls); local
419 gpointer *array = TlsGetValue (g_private_tls); local
    [all...]
  /external/icu4c/tools/toolutil/
toolutil.c 156 void *array; member in struct:UToolMemory
173 mem->array=mem->staticArray;
186 if(mem->array!=mem->staticArray) {
187 uprv_free(mem->array);
196 return (char *)mem->array;
216 /* try to allocate a larger array */
225 if(mem->array==mem->staticArray) {
226 mem->array=uprv_malloc(newCapacity*mem->size);
227 if(mem->array!=NULL) {
228 uprv_memcpy(mem->array, mem->staticArray, mem->idx*mem->size)
    [all...]
  /dalvik/libcore/nio/src/test/java/org/apache/harmony/nio/tests/java/nio/
WrappedCharBufferTest2.java 88 method = "array",
93 buf.array();
120 char array[] = new char[1]; local
122 buf.put(array, 0, array.length);
140 buf.put(array, -1, array.length);
CharBufferTest.java 77 assertNotNull(testBuf.array());
84 assertNotNull(testBuf.array());
102 method = "array",
106 char array[] = buf.array(); local
107 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
109 loadTestData1(array, buf.arrayOffset(), buf.capacity());
110 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
112 loadTestData2(array, buf.arrayOffset(), buf.capacity());
113 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity())
129 char array[] = buf.array(); local
422 char array[] = new char[1]; local
459 char array[] = new char[buf.capacity()]; local
602 char array[] = new char[1]; local
637 char array[] = new char[buf.capacity()]; local
1007 char array[] = new char[buf.capacity()]; local
1046 assertEquals(buf.get(i), array[offset + i]); local
1423 char array[] = new char[BUFFER_LENGTH]; local
1456 char array[] = new char[BUFFER_LENGTH]; local
    [all...]
ReadOnlyCharBufferTest.java 61 method = "array",
66 buf.array();
134 char array[] = new char[1]; local
136 buf.put(array);
156 char array[] = new char[1]; local
158 buf.put(array, 0, array.length);
176 buf.put(array, -1, array.length);
ReadOnlyDoubleBufferTest.java 61 method = "array",
66 buf.array();
134 double array[] = new double[1]; local
136 buf.put(array);
156 double array[] = new double[1]; local
158 buf.put(array, 0, array.length);
176 buf.put(array, -1, array.length);
ReadOnlyFloatBufferTest.java 60 method = "array",
65 buf.array();
135 float array[] = new float[1]; local
137 buf.put(array);
157 float array[] = new float[1]; local
159 buf.put(array, 0, array.length);
177 buf.put(array, -1, array.length);
ReadOnlyIntBufferTest.java 60 method = "array",
65 buf.array();
135 int array[] = new int[1]; local
137 buf.put(array);
157 int array[] = new int[1]; local
159 buf.put(array, 0, array.length);
177 buf.put(array, -1, array.length);
ReadOnlyLongBufferTest.java 60 method = "array",
65 buf.array();
135 long array[] = new long[1]; local
137 buf.put(array);
157 long array[] = new long[1]; local
159 buf.put(array, 0, array.length);
177 buf.put(array, -1, array.length);
ReadOnlyShortBufferTest.java 60 method = "array",
65 buf.array();
135 short array[] = new short[1]; local
137 buf.put(array);
157 short array[] = new short[1]; local
159 buf.put(array, 0, array.length);
177 buf.put(array, -1, array.length);
  /packages/apps/Gallery3D/src/com/cooliris/media/
ArrayUtils.java 36 // Build the intersection array.
56 public static final boolean contains(Object[] array, Object object) {
60 int length = array.length;
62 if (object.equals(array[i])) {
69 public static void clear(Object[] array) {
70 int length = array.length;
72 array[i] = null;
  /cts/tests/tests/graphics/src/android/graphics/drawable/cts/
LayerDrawableTest.java 67 Drawable[] array = new Drawable[] { bitmapDrawable, colorDrawable }; local
68 LayerDrawable layerDrawable = new LayerDrawable(array);
69 assertEquals(array.length, layerDrawable.getNumberOfLayers());
73 array = new Drawable[0];
74 layerDrawable = new LayerDrawable(array);
93 Drawable[] array = new Drawable[0]; local
94 LayerDrawable layerDrawable = new LayerDrawable(array);
112 layerDrawable = new LayerDrawable(array);
155 Drawable[] array = new Drawable[] { bitmapDrawable, colorDrawable }; local
156 LayerDrawable layerDrawable = new LayerDrawable(array);
191 Drawable[] array = new Drawable[] { new BitmapDrawable(), new ColorDrawable(Color.BLUE) }; local
236 Drawable[] array = new Drawable[] { new BitmapDrawable(), new ColorDrawable(Color.BLUE) }; local
270 Drawable[] array = new Drawable[] { bitmapDrawable, colorDrawable }; local
311 Drawable[] array = new Drawable[] { new BitmapDrawable(), new ColorDrawable(Color.BLUE) }; local
350 Drawable[] array = new Drawable[0]; local
375 Drawable[] array = new Drawable[0]; local
403 Drawable[] array = new Drawable[0]; local
468 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
499 Drawable[] array = new Drawable[] { bitmapDrawable, colorDrawable }; local
514 Drawable[] array = new Drawable[] { new ShapeDrawable(), new ShapeDrawable() }; local
548 Drawable[] array = new Drawable[] { new BitmapDrawable(), new ColorDrawable(Color.BLUE) }; local
572 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
594 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
616 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
636 Drawable[] array = new Drawable[0]; local
668 Drawable[] array = new Drawable[0]; local
689 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
723 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
758 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
805 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
837 Drawable[] array = new Drawable[] { mockDrawable1, mockDrawable2 }; local
868 Drawable[] array = new Drawable[] { new BitmapDrawable(), new ColorDrawable(Color.BLUE) }; local
    [all...]
  /build/tools/apriori/
rangesort.c 8 range_t *array; member in struct:range_list_t
19 ranges->array = (range_t *)MALLOC(PARALLEL_ARRAY_SIZE*sizeof(range_t));
31 if (ranges->array[idx].user_dtor) {
32 ASSERT(ranges->array[idx].user);
33 ranges->array[idx].user_dtor(ranges->array[idx].user);
36 FREE(ranges->array);
111 ranges->array = REALLOC(ranges->array,
114 ranges->array[ranges->num_ranges].start = start
    [all...]
  /external/elfcopy/
rangesort.c 8 range_t *array; member in struct:range_list_t
19 ranges->array = (range_t *)MALLOC(PARALLEL_ARRAY_SIZE*sizeof(range_t));
31 if (ranges->array[idx].user_dtor) {
32 ASSERT(ranges->array[idx].user);
33 ranges->array[idx].user_dtor(ranges->array[idx].user);
36 FREE(ranges->array);
129 ranges->array = REALLOC(ranges->array,
132 ranges->array[ranges->num_ranges].start = start
    [all...]
  /external/stlport/test/unit/
multiset_test.cpp 63 int array [] = { 3, 6, 1, 2, 3, 2, 6, 7, 9 }; local
66 mset s(array, array + 9);
101 int array [] = { 3, 6, 1, 9 }; local
108 fn_mset s1(array+0, array + 4 , f );
118 fn_mset s2(array, array + 4, g);

Completed in 513 milliseconds

<<21222324252627282930>>