Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I would strongly recommend using a 1D array, and map the values sequentially. You will need to convert from indeces <code>i</code>, <code>j</code>, <code>k</code>, <code>...</code> into the proper array index, which is done with the <code>Que()</code> function below, part of a generic array class <code>SeqArray&lt;T&gt;</code>.</p> <pre><code>// Test code first class Program { static void Main(string[] args) { /* 3 pages, of a 4x2 matrix * * |16 17| * | 8 9|19| * | 0 1|11|21| * | 2 3|13|23| * | 4 5|15| * | 6 7| * * shown above are the sequential indeces for a rank 3 array */ SeqArray&lt;double&gt; arr = new SeqArray&lt;double&gt;(3, 4, 2); // Initialize values to squential index "num" int num = 0; for (int i = 0; i &lt; 3; i++) { for (int j = 0; j &lt; 4; j++) { for (int k = 0; k &lt; 2; k++) { arr[i, j, k] = num++; } } } // Check that the array values correspond to the index sequence num = 0; for (int i = 0; i &lt; 3 * 4 * 2; i++) { Trace.Assert(arr.InnerArray[i] == num++); } // Initialize with value=π arr = new SeqArray&lt;double&gt;(Math.PI, 4, 5, 6); } } public class SeqArray&lt;T&gt; { T[] values; int[] lengths; public SeqArray(params int[] lengths) { this.lengths = lengths; int N = 1; for (int i = 0; i &lt; lengths.Length; i++) { N *= lengths[i]; } values = new T[N]; } public SeqArray(T value, params int[] lengths) : this(lengths) { for (int i = 0; i &lt; values.Length; i++) { values[i] = value; } } public int[] Lengths { get { return lengths; } } public int Size { get { return values.Length; } } internal T[] InnerArray { get { return values; } } public int Que(params int[] indeces) { // Check if indeces are omited like arr[4] instead of arr[4,0,0] if (indeces.Length &lt; lengths.Length) { // Make a new index array padded with zeros int[] temp = new int[lengths.Length]; indeces.CopyTo(temp, 0); indeces = temp; } // Count the elements for indeces int k = 0; for (int i = 0; i &lt; indeces.Length; i++) { k = lengths[i] * k + indeces[i]; } return k; } public T this[params int[] indeces] { get { return values[Que(indeces)]; } set { values[Que(indeces)] = value; } } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POGeneric initialization of multidimensional array
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USja72
    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
    1. COnice solution, looks promising in terms of performance!
      singulars
      1. PO
      1. USFlorian Storck
    2. COYou will have to create child classes for different numeric types in order to use the `+`, `-` operator overloading. To code a matrix multiplication would be a little work, but doable.
      singulars
      1. PO
      1. USja72
 

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