Lines Matching defs:array1
25 Scalar* array1 = internal::aligned_new<Scalar>(size);
31 Map<VectorType, AlignedMax>(array1, size) = VectorType::Random(size);
32 Map<VectorType, AlignedMax>(array2, size) = Map<VectorType,AlignedMax>(array1, size);
33 Map<VectorType>(array3unaligned, size) = Map<VectorType>(array1, size);
34 Map<VectorType>(array4, size) = Map<VectorType,AlignedMax>(array1, size);
35 VectorType ma1 = Map<VectorType, AlignedMax>(array1, size);
47 internal::aligned_delete(array1, size);
60 // array1 and array2 -> aligned heap allocation
61 Scalar* array1 = internal::aligned_new<Scalar>(size);
62 for(int i = 0; i < size; i++) array1[i] = Scalar(1);
73 Map<MatrixType> map1(array1, rows, cols);
117 internal::aligned_delete(array1, size);
129 Scalar* array1 = internal::aligned_new<Scalar>(size);
134 VectorType::MapAligned(array1, size) = VectorType::Random(size);
135 VectorType::Map(array2, size) = VectorType::Map(array1, size);
136 VectorType::Map(array3unaligned, size) = VectorType::Map(array1, size);
137 VectorType ma1 = VectorType::Map(array1, size);
143 internal::aligned_delete(array1, size);
168 Scalar* array1 = internal::aligned_new<Scalar>((size+1)*(size+1)+1);
169 Scalar* array2 = reinterpret_cast<Scalar*>(sizeof(Scalar)/2+std::size_t(array1));
181 internal::aligned_delete(array1, (size+1)*(size+1)+1);
