File: preexisting.cpp

package info (click to toggle)
blitz%2B%2B 1%3A1.0.2%2Bds-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 8,568 kB
  • sloc: cpp: 57,803; python: 1,941; fortran: 1,510; f90: 852; makefile: 833; sh: 321
file content (37 lines) | stat: -rw-r--r-- 707 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include "testsuite.h"
#include <blitz/array.h>

using namespace blitz;

// tests that preexisting memory constructors work with padding
int main()
{
  Array<int,2> b(3,3);
  b = 1,2,3,4,5,6,7,8,9;

  {
    int p[] = {1,2,3,4,5,6,7,8,9};
    Array<int,2> a(p, shape(3,3), neverDeleteData);
    BZTEST(all(a==b));
  }

  {
    int* pp;
    pp = new int[3*3];
    Array<int,2> a(pp, shape(3,3), deleteDataWhenDone);
    a = 1,2,3,4,5,6,7,8,9;
    BZTEST(all(a==b));
  }


  const int w =simdTypes<int>::vecWidth;
  if(w>1) {
    int p[] = {1,2,3,4,5,6,7,8,9};
    beginCheckAssert();
    Array<int,2> a(p, shape(3,3), neverDeleteData, FortranArray<2>(paddedData));
    endCheckAssert();
  }

    return 0;
}