🚀 go-pugleaf

Your Name wrote:
>In article <4io1ks$nr1@solutions.solon.com>, dmills@eng.umd.edu says...

[...]


> >nodedata = (Node ***)malloc(sizeof(Node **) * xnodes);
> >for(i = 0;i < xnodes;i++){
> >    nodedata[i] = (Node **)malloc(sizeof(Node *) * ynodes);
> >    for(j = 0;j < ynodes;j++)
> >       nodedata[i][j] = (Node *)malloc(sizeof(Node) * znodes);

[...]


>I've never seen anything like that before!  Assuming all you need is
>a 3D array, why not:

>nodedata = (Node *) malloc(sizeof(Node) * x_dim * y_dim * z_dim);

>then refer to each element as nodedata[i][j][k]?


The size of x_dim, y_dim and z_dim might not be known at compile-time, in
which case the bracket operators would be unusable (only the outer-most
depth may be unknown at compile-time for multi-dimensional arrays without
indirection tables).  Furthermore, third-level depth would need to be
passed along with the pointer to any functions operating on data within a
plane of the 3 dimensional data set.



---
Brian Valters McGroarty -- brianmcg@bix.com
phone/fax (847) 439-7714