Access time for small array versus small structure in C #

Question

I need to process about 500,000 data points, each of which consists of 4 decimal places. I would like to use an array of structures for this. Will it be much slower than using an array of arrays? It seems that memory will not be a problem, but there will be speed - it should be fast.

A quick code example of two options:

Option 1:

public struct Struct
{
    public decimal A { get; set; }
    public decimal B { get; set; }
    public decimal C { get; set; }
    public decimal D { get; set; }
}

Using:

private Struct[] data;

Option 2:

private decimal [][] data;

Also using the decimalcorrect data type to use? Data points are money ...

Thanks! Brian

Answer 1

A, B, C, D , structs - , ( ) . A, B .., , .

, , . , , , , , .

Answer 2

:

( ) , , , .

, .

Answer 3

• - , , .
• .

, , (, ), . , C 4 , :

MyStruct val = array[5];
val.C = newValue;
array[5] = val;

, . , ...

Answer 4

hmm... , :

private Struct[] data = new Struct[x];
private decimal[,] data = new decimal[x,4];

...

Answer 5

, , .

Answer 6

Struct , .

public struct Struct
{
    // Unless you're filling your get/set blocks with anything,
    // these properties will be in-lined in compilation time
    // and will have the same performance/behavior as using public fields

    public decimal A { get; set; }
    public decimal B { get; set; }
    public decimal C { get; set; }
    public decimal D { get; set; }
}

. , , .

, . decimal - 128- , , . - , , . , . , float.

, 32- ( ), .

, !