How do i allocate multidimensional arrays by new?, C/C++ Programming

Assignment Help:

How do I allocate multidimensional arrays by new?

A: There are several ways to do this, based on how flexible you wish the array sizing to be. On one acute, if you know all the dimensions at compile-time, you can allocate statically multidimensional arrays (like in C):

class Fred { /*...*/ };                

void someFunction(Fred& fred);

void manipulateArray()

{

const unsigned nrows = 10; // Num rows is compile-time constant const unsigned ncols = 20; // Num columns is a compile-time constant Fred matrix[nrows][ncols];

for (unsigned i = 0; i < nrows; ++i) {

for (unsigned j = 0; j < ncols; ++j) {

// Here's the way you access the (i,j) element:

Some Function( matrix[i][j] );

// you can securely "return" without any special delete code:

if (today == "Tuesday" && moon.isFull())

return; // Quit early on Tuesdays while the moon is full

}

}

// No explicit delete code at the ending of the function either

}

Commonly, the size of the matrix isn't known till run-time but you know that this will be rectangular. In this case you have to use the heap ("freestore"), but at least you are capable to allocate all of the elements in one freestore chunk.

void manipulateArray(unsigned nrows, unsigned ncols)

{

Fred* matrix = new Fred[nrows * ncols];

// Since we utiized a simple pointer above, we have to be VERY

// careful to ignore skipping over the delete code.

// That's why we catch all exceptions:

try {

// Here's described how to access the (i,j) element:

for (unsigned i = 0; i < nrows; ++i) { for (unsigned j = 0; j < ncols; ++j) { some Function( matrix[i*ncols + j] );

}

}

// If you wish to quit early on Tuesdays while the moon is full,

// make sure to do the delete along with ALL return paths:

if (today == "Tuesday" && moon.isFull()) {

delete[] matrix;

return;

}

...insert code here to fiddle along with the matrix...

}

catch (...) {

// make sure to do the delete while an exception is thrown:

delete[] matrix;

throw; // Re-throw the current exception

}

// Make sure to do the delete at the ending of the function too:

delete[] matrix;

}

Lastly at the other extreme, you may not even be guaranteed that the matrix is rectangular. For instance, if each row could have a distinct length, you'll have to allocate each row individually. In following function, ncols[i] is the number of columns in row number i, where i varies among 0 and nrows-1 inclusive.

void manipulateArray(unsigned nrows, unsigned ncols[])

{

typedef Fred* FredPtr;

// There will not be leak if the following throws an exception: FredPtr* matrix = new FredPtr[nrows];

// Set each of element to NULL in case there is an exception later on.

// (See comments at the top of the try block for rationale.)

for (unsigned i = 0; i < nrows; ++i)

matrix[i] = NULL;

// Since we utilized a simple pointer above, we have to be

// VERY careful to ignore skipping over the delete code.

// That's why we catch all exceptions:

try {

// Next we populate the array. If one of these throws, all

// the allocated elements will be deleted for (unsigned i = 0; i < nrows; ++i)

matrix[i] = new Fred[ ncols[i] ];

// Here's how to access the (i,j) element:

for (unsigned i = 0; i < nrows; ++i) { for (unsigned j = 0; j < ncols[i]; ++j) { someFunction( matrix[i][j] );

}

}

// If you wish to quit early on Tuesdays while the moon is full,

// make sure to do the delete along with ALL return paths:

if (today == "Tuesday" && moon.isFull()) {

for (unsigned i = nrows; i > 0; --i)

delete[] matrix[i-1]; delete[] matrix; return;

}

...insert code here to fiddle with the matrix...

}

catch (...) {

// Make sure to do the delete while an exception is thrown:

// Note down that some of these matrix[...] pointers may be

// NULL, however that's okay since it's legal to delete NULL.

 for (unsigned i = nrows; i > 0; --i)

delete[] matrix[i-1];

delete[] matrix;

throw; // Re-throw current exception

}

// Make sure to do delete at the ending of the function too.

// Note down that deletion is the opposite order of allocation:

for (unsigned i = nrows; i > 0; --i)

delete[] matrix[i-1];

delete[] matrix;

}

Note down the funny use of matrix[i-1] in the deletion procedure. This prevents wrap-around of the unsigned value while i goes one step below zero.

Lastly, note down that pointers and arrays are evil. Normally it is much better to encapsulate your pointers in a class which has a safe and simple interface. The following


Related Discussions:- How do i allocate multidimensional arrays by new?

C program for function of count the interest , C Program for FUNCTION OF CO...

C Program for FUNCTION OF COUNT THE INTEREST float si(float,float,float); void main() {           float p=0,r=0,n=0,k=0;           clrscr();           printf("E

Storing street addresses with doubly linked lists, Write a C++ program with...

Write a C++ program with header and source files to store street addresses using the Doubly Linked List ADT. Modify the Node class from Lab Assignment 3 so that it becomes a node i

Guidelines or "rules of thumb" for overloading operators?, What are some gu...

What are some guidelines / "rules of thumb" for overloading operators? A: Here are a few guidelines / rules of thumb .Use common sense. If your overloaded operator makes life si

C programming a video player, FIT 3042 System Tools and Programming Languag...

FIT 3042 System Tools and Programming Languages Semester 1 2013 Assignment 1 An SDL video player for a custom video format Worth: 20% of final mark. Must be completed individually

Link list, For this program you will add and test 2 new member functions to...

For this program you will add and test 2 new member functions to the IntSLList class posted on the website. The two member functions are: insertByPosn(int el, int pos) Assuming t

What does it mean to declare a destructor as static, d) a "static destructo...

d) a "static destructor" is a static member function of the class which accepts one argument - a pointer to the object of that class to be cracked. It is probably utilized along wi

Linear iterative process, (a) Write a recursive procedure (digits n) that c...

(a) Write a recursive procedure (digits n) that computes the number of digits in the integer n using a linear recursive process. For example, (digits 42) should return 2 and (digit

Copy constructor, What is copy constructor? describe the concept of copy co...

What is copy constructor? describe the concept of copy constructor.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd