Searched defs:array (Results 226 - 250 of 1079) sorted by relevance

1234567891011>>

/external/google-tv-pairing-protocol/java/src/com/google/polo/pairing/
H A DHexDump.java23 public static String dumpHexString(byte[] array) argument
25 return dumpHexString(array, 0, array.length);
28 public static String dumpHexString(byte[] array, int offset, int length) argument
61 byte b = array[i];
99 public static String toHexString(byte[] array) argument
101 return toHexString(array, 0, array.length);
104 public static String toHexString(byte[] array, int offset, int length) argument
111 byte b = array[
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DPlatform.java32 * Clone the given array using {@link Object#clone()}. It is factored out so
35 static <T> T[] clone(T[] array) { argument
36 return array.clone();
57 * Returns a new array of the given length with the specified component type.
60 * @param length the length of the new array
69 * Returns a new array of the given length with the same type as a reference
70 * array.
72 * @param reference any array of the desired type
73 * @param length the length of the new array
H A DSingletonImmutableSet.java81 @Override public <T> T[] toArray(T[] array) { argument
82 if (array.length == 0) {
83 array = ObjectArrays.newArray(array, 1);
84 } else if (array.length > 1) {
85 array[1] = null;
88 Object[] objectArray = array;
90 return array;
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DPlatform.java28 static <T> T[] clone(T[] array) { argument
29 return GwtPlatform.clone(array);
/external/libcxx/test/algorithms/alg.sorting/alg.sort/sort/
H A Dsort.pass.cpp79 // create array length N filled with M different numbers
80 int* array = new int[N]; local
84 array[i] = x;
89 std::sort(array, array+N);
90 assert(std::is_sorted(array, array+N));
92 std::random_shuffle(array, array+N);
93 std::sort(array, arra
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dstable_sort.pass.cpp79 // create array length N filled with M different numbers
80 int* array = new int[N]; local
84 array[i] = x;
89 std::stable_sort(array, array+N);
90 assert(std::is_sorted(array, array+N));
92 std::random_shuffle(array, array+N);
93 std::stable_sort(array, arra
[all...]
/external/lldb/test/functionalities/abbreviation/
H A Dmain.cpp55 int array[3]; local
57 array[0] = foo (1238, 78392);
58 array[1] = foo (379265, 23674);
59 array[2] = foo (872934, 234);
/external/lldb/test/functionalities/alias/
H A Dmain.cpp55 int array[3]; local
57 array[0] = foo (1238, 78392);
58 array[1] = foo (379265, 23674);
59 array[2] = foo (872934, 234);
/external/lldb/test/functionalities/breakpoint/breakpoint_ids/
H A Dmain.cpp58 int array[3]; local
60 array[0] = foo (1238, 78392);
61 array[1] = foo (379265, 23674);
62 array[2] = foo (872934, 234);
/external/lldb/test/functionalities/command_script/
H A Dmain.cpp56 int array[9]; local
57 memset(array,0,9*sizeof(int));
59 array[0] = foo (1238, 78392);
60 array[1] = foo (379265, 23674);
61 array[2] = foo (872934, 234);
62 array[3] = foo (1238, 78392);
63 array[4] = foo (379265, 23674);
64 array[5] = foo (872934, 234);
65 array[6] = foo (1238, 78392);
66 array[
[all...]
/external/lldb/test/functionalities/data-formatter/data-formatter-synth/
H A Dmain.cpp52 int* array; member in struct:Plenty
58 array(new int[N]),
63 array[j] = N-j;
/external/lldb/test/logging/
H A Dmain.cpp55 int array[3]; local
57 array[0] = foo (1238, 78392);
58 array[1] = foo (379265, 23674);
59 array[2] = foo (872934, 234);
/external/llvm/unittests/IR/
H A DTypeBuilderTest.cpp172 void *array[1]; member in struct:__anon26506::MyType
178 void *array[1]; member in struct:__anon26506::MyPortableType
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_surfaces.h40 struct pipe_surface **array; member in union:util_surfaces::__anon27199
59 if(likely((pt->target == PIPE_TEXTURE_2D || pt->target == PIPE_TEXTURE_RECT) && us->u.array))
61 struct pipe_surface *ps = us->u.array[level];
82 return us->u.array[level];
92 us->u.array[ps->u.tex.level] = 0;
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dutil_array.h34 struct array { struct
41 static INLINE struct array *array_create(VGint datatype_size)
43 struct array *array = CALLOC_STRUCT(array); local
44 array->datatype_size = datatype_size;
46 array->size = DEFAULT_ARRAY_SIZE;
47 array->data = malloc(array->size * array
55 struct array *array = CALLOC_STRUCT(array); local
64 array_destroy(struct array *array) argument
71 array_resize(struct array *array, int num) argument
83 array_append_data(struct array *array, const void *data, int num_elements) argument
97 array_change_data(struct array *array, const void *data, int start_idx, int num_elements) argument
107 array_remove_element(struct array *array, int idx) argument
117 array_reset(struct array *array) argument
[all...]
/external/proguard/src/proguard/obfuscate/
H A DAttributeShrinker.java49 // Compact the array for class attributes.
71 // Compact the attributes array.
88 // Compact the attributes array.
99 * from the given array.
102 private static int shrinkArray(VisitorAccepter[] array, int length) argument
109 if (AttributeUsageMarker.isUsed(array[index]))
111 array[counter++] = array[index];
115 // Clear the remaining array elements.
116 Arrays.fill(array, counte
[all...]
/external/proguard/src/proguard/util/
H A DArrayUtil.java33 * @param array1 the first array.
34 * @param array2 the second array.
54 * @param array1 the first array.
55 * @param array2 the second array.
75 * @param array1 the first array.
76 * @param array2 the second array.
96 * @param array1 the first array.
97 * @param array2 the second array.
116 * Returns a hash code for the elements of the given array.
117 * @param array th
121 hashCode(byte[] array, int size) argument
140 hashCode(short[] array, int size) argument
159 hashCode(int[] array, int size) argument
178 hashCode(Object[] array, int size) argument
330 extendArray(boolean[] array, int size) argument
357 ensureArraySize(boolean[] array, int size, boolean initialValue) argument
390 add(byte[] array, int size, byte element) argument
409 insert(byte[] array, int size, int index, byte element) argument
430 remove(byte[] array, int size, int index) argument
446 extendArray(byte[] array, int size) argument
473 ensureArraySize(byte[] array, int size, byte initialValue) argument
506 add(short[] array, int size, short element) argument
525 insert(short[] array, int size, int index, short element) argument
546 remove(short[] array, int size, int index) argument
562 extendArray(short[] array, int size) argument
589 ensureArraySize(short[] array, int size, short initialValue) argument
622 add(int[] array, int size, int element) argument
641 insert(int[] array, int size, int index, int element) argument
662 remove(int[] array, int size, int index) argument
678 extendArray(int[] array, int size) argument
705 ensureArraySize(int[] array, int size, int initialValue) argument
738 add(long[] array, int size, long element) argument
757 insert(long[] array, int size, int index, long element) argument
778 remove(long[] array, int size, int index) argument
794 extendArray(long[] array, int size) argument
821 ensureArraySize(long[] array, int size, long initialValue) argument
854 add(Object[] array, int size, Object element) argument
873 insert(Object[] array, int size, int index, Object element) argument
894 remove(Object[] array, int size, int index) argument
910 extendArray(Object[] array, int size) argument
937 ensureArraySize(Object[] array, int size, Object initialValue) argument
[all...]
/external/skia/tests/
H A DRefCntTest.cpp34 SkTRefArray<InstCounterClass>* array = SkTRefArray<InstCounterClass>::Create(N); local
36 REPORTER_ASSERT(reporter, 1 == array->getRefCnt());
37 REPORTER_ASSERT(reporter, N == array->count());
40 array->unref();
52 array = SkTRefArray<InstCounterClass>::Create(src, N);
53 REPORTER_ASSERT(reporter, 1 == array->getRefCnt());
54 REPORTER_ASSERT(reporter, N == array->count());
58 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
65 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
67 array
[all...]
/external/smack/src/org/jivesoftware/smack/util/
H A DDNSUtil.java220 private static int bisect(int[] array, double value) { argument
222 for (int element : array) {
/external/smack/src/org/xbill/DNS/
H A DTypeBitmap.java26 TypeBitmap(int [] array) { argument
28 for (int i = 0; i < array.length; i++) {
29 Type.check(array[i]);
30 types.add(new Integer(array[i]));
80 int [] array = new int[types.size()];
83 array[n++] = ((Integer)it.next()).intValue();
84 return array;
103 int [] array = new int[arraylength];
108 array[(typecode & 0xFF) / 8] |= (1 << ( 7 - typecode % 8));
111 out.writeU8(array[
[all...]
/external/stlport/test/unit/
H A Dmultiset_test.cpp63 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);
H A Dslist_test.cpp68 char array [] = { 'x', 'l', 'x', 't', 's', 's' }; local
71 slist<char> str(array+0, array + 6);
126 int array[] = { 0, 1, 2, 3, 4 }; local
127 slist<int> sl(array, array + 5);
137 sl.assign(array, array + 5);
154 int array[] = { 0, 1, 2, 3, 4 }; local
165 //sl.insert(sl.before_begin(), array, arra
201 int array[] = { 0, 1, 2, 3, 4 }; local
[all...]
/external/valgrind/main/drd/tests/
H A Dpth_barrier.c29 int8_t* array; member in struct:threadinfo
45 /** Single thread, which touches p->iterations elements of array p->array.
46 * Each modification of an element of p->array is a data race. */
50 int8_t* const array = p->array; local
59 pthread_self(), i + 1, &array[i]);
60 array[i] = i;
73 int8_t* array; local
76 array
[all...]
/external/valgrind/main/massif/tests/
H A Doverloaded-new.cpp14 int array[1000]; member in struct:__anon33006
/external/valgrind/main/memcheck/tests/
H A Dcustom_alloc.c111 int *array, *array3; local
114 array = custom_alloc(sizeof(int) * 10);
115 array[8] = 8;
116 array[9] = 8;
117 array[10] = 10; // invalid write (ok w/o MALLOCLIKE -- in superblock)
119 VALGRIND_RESIZEINPLACE_BLOCK(array, sizeof(int) * 10, sizeof(int) * 5, RZ);
120 array[4] = 7;
121 array[5] = 9; // invalid write
123 // Make the entire array defined again such that it can be verified whether
125 (void) VALGRIND_MAKE_MEM_DEFINED(array, sizeo
[all...]

Completed in 3735 milliseconds

1234567891011>>