Lines Matching defs:array
43 long[] array = new long[size];
44 for (int i = 0; i < array.length; i++) {
45 array[i] = i;
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l))));
53 nodes.add(fill(array, Nodes.longBuilder(array.length)));
54 nodes.add(fill(array, Nodes.longBuilder()));
57 params.add(new Object[]{array, node});
65 private static void assertEqualsListLongArray(List<Long> list, long[] array) {
66 assertEquals(list.size(), array.length);
67 for (int i = 0; i < array.length; i++)
68 assertEquals(array[i], (long) list.get(i));
90 private Node.OfLong fill(long[] array, Node.Builder.OfLong nb) {
91 nb.begin(array.length);
92 for (long i : array)
124 public void testAsArray(long[] array, Node.OfLong n) {
125 assertEquals(n.asPrimitiveArray(), array);
129 public void testFlattenAsArray(long[] array, Node.OfLong n) {
130 assertEquals(Nodes.flattenLong(n).asPrimitiveArray(), array);
134 public void testCopyTo(long[] array, Node.OfLong n) {
138 assertEquals(copy, array);
142 public void testForEach(long[] array, Node.OfLong n) {
148 assertEqualsListLongArray(l, array);
152 public void testStreams(long[] array, Node.OfLong n) {
161 public void testSpliterator(long[] array, Node.OfLong n) {
166 public void testTruncate(long[] array, Node.OfLong n) {
167 int[] nums = new int[] { 0, 1, array.length / 2, array.length - 1, array.length };
170 if (start < 0 || end < 0 || end < start || end > array.length)
175 assertEquals(array[k], asArray[k - start]);