Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Each pair of square brackets is a dereferencing operation (when applied to a pointer). As an example, the following pairs of lines of code are equivalent:</p> <pre><code>x = myArray[4]; x = *(myArray+4); </code></pre> <p>&nbsp;</p> <pre><code>x = myArray[2][7]; x = *((*(myArray+2))+7); </code></pre> <p>To use your suggested syntax you are simply dereferencing the value returned from the first dereference.</p> <pre><code>int*** myArray = (some allocation method, keep reading); // // All in one line: int value = myArray[x][y][z]; // // Separated to multiple steps: int** deref1 = myArray[x]; int* deref2 = deref1[y]; int value = deref2[z]; </code></pre> <p>To go about allocating this array, you simply need to recognise that you don't actually have a three-dimensional array of integers. You have an array of arrays of arrays of integers.</p> <pre><code>// Start by allocating an array for array of arrays int*** myArray = new int**[X_MAXIMUM]; // Allocate an array for each element of the first array for(int x = 0; x &lt; X_MAXIMUM; ++x) { myArray[x] = new int*[Y_MAXIMUM]; // Allocate an array of integers for each element of this array for(int y = 0; y &lt; Y_MAXIMUM; ++y) { myArray[x][y] = new int[Z_MAXIMUM]; // Specify an initial value (if desired) for(int z = 0; z &lt; Z_MAXIMUM; ++z) { myArray[x][y][z] = -1; } } } </code></pre> <p>Deallocating this array follows a similar process to allocating it:</p> <pre><code>for(int x = 0; x &lt; X_MAXIMUM; ++x) { for(int y = 0; y &lt; Y_MAXIMUM; ++y) { delete[] myArray[x][y]; } delete[] myArray[x]; } delete[] myArray; </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POThree dimensional arrays of integers in C++
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USZooba
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COyes, you can do that, but you can also do it in one memory chunk and only one allocation. It's also usually much faster to use one memory chunk that many small ones, memory indirection has a price. The method you show is mostly usefull for sparse matrixes when full inner arrays are not used and you can completely avoid to allocate them.
      singulars
      1. PO
      1. USkriss
    2. CO@kriss I agree completely, and I personally tend to use single arrays (allocated by page for big stuff). The reason I set it up this way here is for the syntax requested (as I noted). The performance difference for access is trivial, though for a big enough array and known cache behaviour I can certainly create degenerate use cases (for both), and the performance for initialisation is irrelevant (if it matters, you're initialising it in the wrong place - do it earlier).
      singulars
      1. PO
      1. USZooba
    3. COyou also can easily do it with the syntax asked for poster in one memory chunk. I posted an answer showing (one way, there is many) how to do just that using C++, and variable length arrays are now a feature of C99 (too bad it didn't got his way to C++). I will +1 your answer anyway as it works fine.
      singulars
      1. PO
      1. USkriss
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload