⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 test_source.c

📁 This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY without ev
💻 C
📖 第 1 页 / 共 2 页
字号:
    }    {      size_t imax =  FUNCTION(gsl_vector, max_index) (v) ;      TEST (imax != exp_imax, "_max_index returns correct maximum i");    }    {      size_t imin = FUNCTION(gsl_vector, min_index) (v) ;      TEST (imin != exp_imin, "_min_index returns correct minimum i");    }    {      size_t imin, imax;      FUNCTION(gsl_vector, minmax_index) (v,  &imin, &imax);      TEST (imax != exp_imax, "_minmax_index returns correct maximum i");      TEST (imin != exp_imin, "_minmax_index returns correct minimum i");    }  }  {    int status = 0;        QUALIFIED_VIEW(gsl_vector,view) v1 = FUNCTION(gsl_vector, view_array) (v->data, N*stride);        for (i = 0; i < N; i++)      {        if (FUNCTION (gsl_vector, get) (&v1.vector, i*stride) != FUNCTION (gsl_vector, get) (v, i))           status = 1;      };    TEST (status, "_view_array" DESC);  }  {    int status = 0;        QUALIFIED_VIEW(gsl_vector,view) v1 = FUNCTION(gsl_vector, view_array_with_stride) (v->data, stride, N*stride);        for (i = 0; i < N; i++)      {        if (FUNCTION (gsl_vector, get) (&v1.vector, i) != FUNCTION (gsl_vector, get) (v, i))           status = 1;      };    TEST (status, "_view_array_with_stride" DESC);  }  {    int status = 0;        QUALIFIED_VIEW(gsl_vector,view) v1 = FUNCTION(gsl_vector, subvector) (v, N/3, N/2);        for (i = 0; i < N/2; i++)      {        if (FUNCTION (gsl_vector, get) (&v1.vector, i) != FUNCTION (gsl_vector, get) (v, (N/3) + i))           status = 1;      };    TEST (status, "_view_subvector" DESC);  }  {    int status = 0;        QUALIFIED_VIEW(gsl_vector,view) v1 = FUNCTION(gsl_vector, subvector_with_stride) (v, N/5, 3, N/4);        for (i = 0; i < N/4; i++)      {        if (FUNCTION (gsl_vector, get) (&v1.vector, i) != FUNCTION (gsl_vector, get) (v, (N/5) + 3*i))           status = 1;      };    TEST (status, "_view_subvector_with_stride" DESC);  }  FUNCTION (gsl_vector, free) (v0);      /* free whatever is in v */}voidFUNCTION (test, ops) (size_t stride1, size_t stride2, size_t N){  size_t i;  TYPE (gsl_vector) * a = FUNCTION (create, vector) (stride1, N);  TYPE (gsl_vector) * b = FUNCTION (create, vector) (stride2, N);  TYPE (gsl_vector) * v = FUNCTION (create, vector) (stride1, N);    for (i = 0; i < N; i++)    {      FUNCTION (gsl_vector, set) (a, i, (BASE)(3 + i));      FUNCTION (gsl_vector, set) (b, i, (BASE)(3 + 2 * i));    }    FUNCTION(gsl_vector, memcpy) (v, a);  FUNCTION(gsl_vector, add) (v, b);    {    int status = 0;        for (i = 0; i < N; i++)      {        BASE r = FUNCTION(gsl_vector,get) (v,i);        BASE x = FUNCTION(gsl_vector,get) (a,i);        BASE y = FUNCTION(gsl_vector,get) (b,i);        BASE z = x + y;        if (r != z)          status = 1;      }    TEST2 (status, "_add vector addition");  }  {    int status = 0;        FUNCTION(gsl_vector, swap) (a, b);    for (i = 0; i < N; i++)      {        status |= (FUNCTION (gsl_vector, get) (a, i) != (BASE)(3 + 2 * i));        status |= (FUNCTION (gsl_vector, get) (b, i) != (BASE)(3 + i));      }    FUNCTION(gsl_vector, swap) (a, b);    for (i = 0; i < N; i++)      {        status |= (FUNCTION (gsl_vector, get) (a, i) != (BASE)(3 + i));        status |= (FUNCTION (gsl_vector, get) (b, i) != (BASE)(3 + 2 * i));      }    TEST2 (status, "_swap exchange vectors");  }    FUNCTION(gsl_vector, memcpy) (v, a);  FUNCTION(gsl_vector, sub) (v, b);    {    int status = 0;        for (i = 0; i < N; i++)      {        BASE r = FUNCTION(gsl_vector,get) (v,i);        BASE x = FUNCTION(gsl_vector,get) (a,i);        BASE y = FUNCTION(gsl_vector,get) (b,i);        BASE z = x - y;        if (r != z)          status = 1;      }    TEST2 (status, "_sub vector subtraction");  }    FUNCTION(gsl_vector, memcpy) (v, a);  FUNCTION(gsl_vector, mul) (v, b);    {    int status = 0;        for (i = 0; i < N; i++)      {        BASE r = FUNCTION(gsl_vector,get) (v,i);        BASE x = FUNCTION(gsl_vector,get) (a,i);        BASE y = FUNCTION(gsl_vector,get) (b,i);        BASE z = x * y;        if (r != z)          status = 1;      }    TEST2 (status, "_mul multiplication");  }    FUNCTION(gsl_vector, memcpy) (v, a);  FUNCTION(gsl_vector, div) (v, b);    {    int status = 0;        for (i = 0; i < N; i++)      {        BASE r = FUNCTION(gsl_vector,get) (v,i);        BASE x = FUNCTION(gsl_vector,get) (a,i);        BASE y = FUNCTION(gsl_vector,get) (b,i);        BASE z = x / y;        if (fabs(r - z) > 2 * GSL_FLT_EPSILON * fabs(z))          status = 1;      }    TEST2 (status, "_div division");  }  FUNCTION(gsl_vector, free) (a);  FUNCTION(gsl_vector, free) (b);  FUNCTION(gsl_vector, free) (v);}voidFUNCTION (test, file) (size_t stride, size_t N){  TYPE (gsl_vector) * v = FUNCTION (create, vector) (stride, N);  TYPE (gsl_vector) * w = FUNCTION (create, vector) (stride, N);  size_t i;  {    FILE *f = fopen ("test.dat", "wb");    for (i = 0; i < N; i++)      {        FUNCTION (gsl_vector, set) (v, i, (ATOMIC) (N - i));      };    FUNCTION (gsl_vector, fwrite) (f, v);    fclose (f);  }  {    FILE *f = fopen ("test.dat", "rb");    FUNCTION (gsl_vector, fread) (f, w);    status = 0;    for (i = 0; i < N; i++)      {        if (w->data[i*stride] != (ATOMIC) (N - i))          status = 1;      };    TEST (status, "_write and read");    fclose (f);  }  FUNCTION (gsl_vector, free) (v);      /* free whatever is in v */  FUNCTION (gsl_vector, free) (w);      /* free whatever is in w */}#if USES_LONGDOUBLE && ! HAVE_PRINTF_LONGDOUBLE/* skip this test */#elsevoidFUNCTION (test, text) (size_t stride, size_t N){  TYPE (gsl_vector) * v = FUNCTION (create, vector) (stride, N);  TYPE (gsl_vector) * w = FUNCTION (create, vector) (stride, N);  size_t i;  {    FILE *f = fopen ("test.txt", "w");    for (i = 0; i < N; i++)      {        FUNCTION (gsl_vector, set) (v, i, (ATOMIC) i);      };    FUNCTION (gsl_vector, fprintf) (f, v, OUT_FORMAT);    fclose (f);  }  {    FILE *f = fopen ("test.txt", "r");    FUNCTION (gsl_vector, fscanf) (f, w);    status = 0;    for (i = 0; i < N; i++)      {        if (w->data[i*stride] != (ATOMIC) i)          status = 1;      };    gsl_test (status, NAME (gsl_vector) "_fprintf and fscanf");    fclose (f);  }  FUNCTION (gsl_vector, free) (v);  FUNCTION (gsl_vector, free) (w);}#endifvoidFUNCTION (test, trap) (size_t stride, size_t N){  double x;  size_t j = 0;  TYPE (gsl_vector) * v = FUNCTION (create, vector) (stride, N);  v->size = N;  v->stride = stride;  status = 0;  FUNCTION (gsl_vector, set) (v, j - 1, (ATOMIC)0);  TEST (!status, "_set traps index below lower bound");  status = 0;  FUNCTION (gsl_vector, set) (v, N + 1, (ATOMIC)0);  TEST (!status, "_set traps index above upper bound");  status = 0;  FUNCTION (gsl_vector, set) (v, N, (ATOMIC)0);  TEST (!status, "_set traps index at upper bound");  status = 0;  x = FUNCTION (gsl_vector, get) (v, j - 1);  TEST (!status, "_get traps index below lower bound");  TEST (x != 0, "_get returns zero for index below lower bound");  status = 0;  x = FUNCTION (gsl_vector, get) (v, N + 1);  TEST (!status, "_get traps index above upper bound");  TEST (x != 0, "_get returns zero for index above upper bound");  status = 0;  x = FUNCTION (gsl_vector, get) (v, N);  TEST (!status, "_get traps index at upper bound");  TEST (x != 0, "_get returns zero for index at upper bound");  FUNCTION (gsl_vector, free) (v);      /* free whatever is in v */}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -