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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include <igraph.h>
#include <stdio.h>
#include "test_utilities.h"
void print_array(const igraph_array3_t *a) {
igraph_integer_t i, j, k;
for (k = 0; k < igraph_array3_n(a, 3); k++) {
for (i = 0; i < igraph_array3_n(a, 1); i++) {
for (j = 0; j < igraph_array3_n(a, 2); j++) {
printf(" %g", (double) ARRAY3(*a, i, j, k));
}
printf("\n");
}
printf("\n");
}
}
int main(void) {
igraph_array3_t a;
igraph_integer_t i, j, k;
igraph_integer_t s = 1;
igraph_array3_init(&a, 5, 4, 3);
igraph_array3_destroy(&a);
igraph_array3_init(&a, 5, 4, 3);
print_array(&a);
IGRAPH_ASSERT(igraph_array3_n(&a, 1) == 5);
IGRAPH_ASSERT(igraph_array3_n(&a, 2) == 4);
IGRAPH_ASSERT(igraph_array3_n(&a, 3) == 3);
igraph_array3_destroy(&a);
igraph_array3_init(&a, 5, 4, 3);
for (k = 0; k < igraph_array3_n(&a, 3); k++) {
for (j = 0; j < igraph_array3_n(&a, 2); j++) {
for (i = 0; i < igraph_array3_n(&a, 1); i++) {
ARRAY3(a, i, j, k) = s++;
}
}
}
print_array(&a);
print_vector_format(&a.data, stdout, "%g");
igraph_array3_destroy(&a);
VERIFY_FINALLY_STACK();
return 0;
}
|
