Calculation of memory requirements

The memory space required by each recipe (in KB) is derived from the sum of D1 + D2 + D3.

Valid is:

• D1 = (number of entries x 5 + M + 8):1024

  Applies to M:

  M = Accumulated length of all tag names = sum of characters in all tag names (UTF8 coded, max. 255 bytes per tag name) used in the entries.

• D2 = [(number of data records x 12) + 4]:1024

• D3 = [number of data records x (data record length + N) + 4]:1024

  Applies to N:

The total length of the name of the corresponding data record in all languages (max. 255 bytes per language) + overhead per data record (1 byte + number of languages * 3 bytes).

D1, D2 and D3 are rounded to the next higher number.

Memory requirements for using arrays

The memory required by each recipe (in KB) is derived from the sum of D1 + D2 + D3.

Valid is:

• D1 = (number of entries x 5 + M + 8):1024

  Each element of the tag array used counts as a single entry.

  Applies to M:

  M = (length of the array tag name + K) x number of array elements

  Applies to K:

  K = 3: 2 to 9 elements in the array

  K = 4: 10 to 99 elements in the array

  K = 5: 100 to 999 elements in the array

  K = 6: 1000 to 9999 elements in the array

  K = 7: 10000 to 12000 elements in the array

• D2 = [(number of data records x 12) + 4] : 1024

• D3 = [number of data records x (data record length + N) + 4] : 1024

  Applies to N:

The total length of the name of the corresponding data record in all languages (max. 255 bytes per language) + overhead per data record (1 byte + number of languages * 3 bytes).

D1, D2 and D3 are rounded to the next higher number.

Sorry but i have notmore informations for you...
The best way is to try it ..and please let me now your results.

Regards
Manfred