| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.fortran/ |
| array-bounds-high.f90 | 17 integer(4) :: arr1(-4294967297_8:-4294967296_8) variable in program:main
19 arr1 = 11
21 print *, 'arr1 = ', arr1
|
| vla-array.f90 | 35 character (len=9) :: arr1 (3) variable in program:vla_array_main
39 arr1 = 'vlaaryvla'
43 call vla_array_func (arr3, arr2, arr1)
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/ |
| array-bounds-high.f90 | 17 integer(4) :: arr1(-4294967297_8:-4294967296_8) variable in program:main
19 arr1 = 11
21 print *, 'arr1 = ', arr1
|
| vla-array.f90 | 35 character (len=9) :: arr1 (3) variable in program:vla_array_main
39 arr1 = 'vlaaryvla'
43 call vla_array_func (arr3, arr2, arr1)
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/array/ |
| appending.d | 149 double[] arr1;
151 _d_arrayappendTImpl!(typeof(arr1))._d_arrayappendT(arr1, [cast(double)i]);
152 assert(arr1 == [0.0, 1.0, 2.0, 3.0]);
166 Item[] arr1 = [Item(), Item()];
170 _d_arrayappendTImpl!(typeof(arr1))._d_arrayappendT(arr1, arr2);
187 Item[][] arr1 = [[Item()]];
190 _d_arrayappendTImpl!(typeof(arr1))._d_arrayappendT(arr1, arr2)
[all...] |
| construction.d | 104 S[4] arr1;
106 _d_arrayctor(arr1[], arr2[]);
109 assert(arr1 == arr2);
127 S[4] arr1;
129 _d_arrayctor(arr1[], arr2[]);
132 assert(arr1 == arr2);
|
| equality.d | 119 auto arr1 = [A(0), A(2)];
123 assert(arr1 != arr2);
140 auto arr1 = [A(1, 0), A(0, 1)];
144 assert(arr1 != arr2);
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| util.d | 76 auto arr1 = make!(Array!dchar)();
77 assert(arr1.empty);
|
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/ |
| array.d | 568 Array!MyStruct arr1;
569 arr1.push(MyStruct(2));
570 arr1.push(MyStruct(4));
571 arr1.push(MyStruct(256));
572 arr1.push(MyStruct(42));
573 arr1.sort();
574 assert(arr1[0].a == 256);
575 assert(arr1[1].a == 42);
576 assert(arr1[2].a == 4);
577 assert(arr1[3].a == 2)
[all...] |
| /src/external/bsd/bzip2/dist/ |
| bzlib.c | 174 s->arr1 = NULL;
179 s->arr1 = BZALLOC( n * sizeof(UInt32) );
183 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) {
184 if (s->arr1 != NULL) BZFREE(s->arr1);
201 s->mtfv = (UInt16*)s->arr1;
203 s->ptr = (UInt32*)s->arr1;
478 if (s->arr1 != NULL) BZFREE(s->arr1);
|
| bzlib_private.h | 212 UInt32* arr1; member in struct:__anon6529
217 /* aliases for arr1 and arr2 */
|
| blocksort.c | 1025 arr1 exists for [0 .. nblock-1]
1031 arr1 [0 .. nblock-1] holds sorted order
1047 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1081 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/range/ |
| package.d | 1213 int[] arr1 = [ 1, 2, 3, 4 ];
1216 auto s = chain(arr1, arr2, arr3);
1231 int[] arr1 = [5, 2, 8];
1236 auto s = arr1.chain(arr2, arr3).sort;
1239 assert(arr1.equal([1, 2, 3]));
1283 int[] arr1 = [ 1, 2, 3, 4 ];
1287 auto s1 = chain(arr1);
1289 auto s2 = chain(arr1, arr2);
1293 auto s = chain(arr1, arr2, arr3);
1299 int[] arr1 = [ 1, 2, 3, 4 ]
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| exception.d | 928 auto arr1 = arr.assumeUnique;
929 static assert(is(typeof(arr1) == immutable(int)[]));
931 assert(arr1 == [0]);
938 auto arr1 = arr.assumeUnique;
939 static assert(is(typeof(arr1) == immutable(int[string])));
941 assert(arr1.keys == ["a"]);
1460 void[16] arr1 = void;
1463 return mayPointTo(arr1, var) && !doesPointTo(arr1, var) &&
|
| sumtype.d | 1059 static arr1 = staticArray([Field()]);
1062 auto a = MySum(Struct(arr1[]));
|
| /src/crypto/external/bsd/netpgp/dist/src/netpgpverify/ |
| bzlib_private.h | 216 UInt32* arr1; member in struct:__anon1078
221 /* aliases for arr1 and arr2 */
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| lifetime.d | 2615 S1[] arr1 = new S1[7];
2616 _d_delarray_t(cast(void[]*)&arr1, typeid(typeof(arr1[0]))); // delete arr1;
2723 auto arr1 = new SArr;
2724 arr1.data[] = p1;
2725 GC.free(arr1);
2729 if (cast(void*)arr1 is cast(void*)arr2.ptr) // reusage not guaranteed
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/math/ |
| operations.d | 1119 float[] arr1 = [ 1.0, 2.0, 3.0 ];
1121 assert(approxEqual(arr1, arr2));
1371 float[] arr1 = [ 1.0, 2.0, 3.0 ];
1373 assert(isClose(arr1, arr2));
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| mutation.d | 530 int[] arr1 = [10, 20, 30, 40, 50];
531 int[] arr2 = arr1.dup;
532 copy(arr1, arr2);
|
| iteration.d | 668 int[] arr1 = [ 1, 2, 3, 4 ];
669 const int[] arr1Const = arr1;
674 assert(equal(map!("a * a")(chain(arr1, arr2)), [ 1, 4, 9, 16, 25, 36 ][]));
688 assert(equal(map!("a * a")(chain(arr1, arr2)), [ 1, 4, 9, 16, 25, 36 ][]));
691 foreach (e; map!("a", "a * a")(arr1))
699 assert(map!"a * a"(chain(arr1, arr2)).length == 6);
7667 static immutable arr1 = [1, 2, 3];
7670 assert(arr1.mean.isClose(2));
7673 assert(arr1[0 .. 0].mean.isNaN);
|
| sorting.d | 1063 string[] arr1 = ["I", "have", "no", "chocolate"];
1064 auto index3 = new byte[arr1.length];
1065 makeIndex(arr1, index3);
1067 ((byte a, byte b){ return arr1[a] < arr1[b];})
|
| comparison.d | 2372 static immutable arr1 = [1, 2, 3];
2374 assert(isPermutation(arr1, arr2));
|
| searching.d | 4128 auto arr1 = InRange([5, 2, 3, 4, 5, 3, 6]);
4131 assert(arr1.minIndex == 1);
|
