views:

97

answers:

7

hi, I'm new to C/C++ and I've been cracking my head but still got no idea how to make an "structure" like this

alt text

It's supposed to be a 3D dynamic array using pointers.

I started like this, but got stuck there

  int x=5,y=4,z=3;
  int ***sec=new int **[x];

It would be enough to know how to make it for a static size of y and z;

Please, I'd appreciate that you help me.

Thanks in advance.

A: 

If it's the actual arrays you'r having problems with look here: http://stackoverflow.com/questions/3904224/declaring-a-pointer-to-multidimensional-array-c

Not sure exactly what you want but you might want to read up on about linked lists.

dutt
A: 

OK let us take your beginnings

int ***sec = new int**[x]; 

sec is now an array of int**s of length x, so now I am just going to focus on making the zeroeth element be what you want

sec[0] = new int*[y];

Now sec[0] points to array of int*s of length y, now just need to get the last bit of the tree done, so

sec[0][0] = new int[z];

And finally to get it to the form in your diagram

sec[0][0][z-1] = 0;

This does seem a little like a homework question, make sure you actually understand the answer and why it works.

Aurojit Panda
`sec` is not an array. It's a pointer that points to the first element of an array.
sellibitze
That is rather semantic. To be fair in cases like int x[10]; x is really a pointer to the first element of an array, and an array both. There really isn't a difference between being a pointer to the first element of an array and being an array.
Aurojit Panda
+1  A: 

You can try:

for(int i=0;i<x;i++) {
  sec[i] = new int *[y];
  for(int j=0;j<y;j++) {
    sec[i][j] = new int [z];
  }
}

And once you are done using this memory you can deallocate it as:

for(int i=0;i<x;i++) {
  for(int j=0;j<y;j++) {
    delete [] sec[i][j];
  }
  delete [] sec[i];
}
delete [] sec;
codaddict
+6  A: 
// one-liner
typedef std::vector<std::vector<std::vector<int> > > ThreeDimensions;
// expanded
typedef std::vector<int> OneDimension;
typedef std::vector<OneDimension> TwoDimensions;
typedef std::vector<TwoDimension> ThreeDimensions;

(this is tagged c++, after all)

Justin
+1 for the way to go *if* this memory layout is really what the OP wants
sellibitze
+1  A: 

Comprehensive answers.

If you are really writing this in C++ (not rough C) I think you should take another look at this complicated data structure. IMO redesign while keeping in mind what you are trying to do would be better.

Keynslug
+3  A: 

To create dynamically 3D array of integers, its better you understand 1D and 2D array first.

1D array: You can do this very easily by

const int MAX_SIZE=128;
int *arr1D = new int[MAX_SIZE];

Here, we are creating a int-pointer which will point to a chunk of memory where integers can be stored.

2D array: You may use solution of above 1D array to create 2D array. First crate a pointer which should point to a memory block where only other integeral pointers are hold which ultimately points to actual data. since our first pointer point to a array of pointer so this will be called as pointer-to-pointer (double pointer).

const int HEIGHT=20;
const int WIDTH=20;

int **arr2D = new int*[WIDTH];  //create an array of int pointers (int*), that will point to 
                                //data as described in 1D array.
for(int i = 0;i < WIDTH; i++){
      arr2D[i] = new int[HEIGHT]; 
}

3D Array: This is what you want to do. Here you may try both the scheme used in above two. Apply the same logic as 2D array. Diagram in question explains all. First array will be pointer-to-pointer-to-pointer (int*** - since it points to double pointers). Solution is as below:

const int X=20;
const int Y=20;
const int z=20;

int ***arr3D = new int**[X];
for(int i =0; i<X; i++){
   arr3D[i] = new int*[Y];
   for(int j =0; j<Y; j++){
       arr3D[i][j] = new int[Z];
       for(int k = 0; k<Z;k++){
          arr3D[i][j][k] = 0;
       }
   }
}
Manish Shukla
Also you can use this method for N-Dimension arrays with N-1 for loops.
Green Code
maybe mention the corresponding delete functionality as well..
stijn
+1  A: 

What you're trying to do is not idiomatic in C++. Of course, you can use a int***pointer for this, but this is strongly discouraged. In C++ we have better ways to get there.

vector<vector<vector<int> > > foo (5,vector<vector<int> >(4, vector<int>(3)));

This will result in something with the memory layout similar to what you asked for. It supports dynamic resizing and inner vectors to have different sizes just like in your picture. In addition, you don't have to worry about manual allocation / deletion of any of it. Also, the vectors know their size so you don't have to remember it somewhere.

But if you just want a "rectangular" 3D array where all the elements are consecutivly stored in the same memory block, you could use a boost::multiarray.

sellibitze