Data processing apparatus, method, and non-transitory tangible machine-readable medium thereof for recursively structured data

A data processing method for use in an electronic apparatus, comprising the following steps of:

• accessing a piece of recursively structured data, wherein the piece of recursively structured data has a Location Independent Structure (LIS);
• and
• arranging the piece of recursively structured data in a one-dimensional memory space in the following way:
• LIS:=e0∘e1∘ . . . ∘ep−1∘LIS0∘LIS1∘ . . . ∘LISp−1,
• wherein the variable p is a positive integer, the notation ei represents an element of the piece of recursively structured data, the notation LISi represents a sub-LIS of the recursively structured data and corresponds to the element ei, the variable i is an index of the elements and is between 0 and p−1, the operator ‘∘’ indicates “contiguous to” in the one-dimensional memory space, each of the sub-LISs is of an LIS size, a depth associated to each sub-LIS is a number of recursions from the top LIS, the depth of each of the LISi equals the depth of the LIS plus one, and the depth of the top LIS is zero,
• wherein each of the elements is of an element size, the element sizes are the same, and the LIS sizes of the sub-LISs within the same depth are the same,
• wherein the piece of recursively structured data arranged in the one-dimensional memory space defines an array as LIS T X[D0, D1, D2, . . . , Dn],
• wherein X is the name of the piece of recursively structured data, the variable n is the maximum LIS depth and is a nonnegative integer, the array is of n+1 dimensions, each of the dimensions corresponds to a dimension size, the notation T represents a data type of the elements, the variable Dj represents the dimension size of the j-th dimension, the j-th dimension corresponds to the j-th depth of the piece of recursively structured data, and the variable j is an index of the dimension between 0 and n,
• wherein each of the elements is denoted as X[I0, . . . , Im], the variable m is an integer between 0 and n, the variable Im represents an index corresponding to the m-th dimension, Im is between 0 and Dm−1, the notation X[I0] is the I0-th element of the LIS, the notation X[I0, . . . , Im−1, Im] is the Im-th element of LISmIm−1, and the notation LISmIm−1 represents the Im−1-th sub-LIS of the depth m.

A non-transitory tangible machine-readable medium, being stored with a computer program, the computer program comprising a plurality of codes, the codes being able to execute a data processing method when the computer program is loaded into an electronic apparatus, the data processing method comprising the steps of:

• accessing a piece of recursively structured data, wherein the piece of recursively structured data has a Location Independent Structure (LIS);
• and
• arranging the piece of recursively structured data in an LIS in a one-dimensional memory space in the following way:
• LIS:=e0∘e1∘ . . . ∘ep−1∘LIS0∘LIS1∘ . . . ∘LISp−1,
• wherein the variable p is a positive integer, the notation ei represents an element of the piece of recursively structured data, the notation LISi represents a sub-LIS of the recursively structured data and corresponds to the element ei, the variable i is an index of the elements and is between 0 and p−1, the operator ‘∘’ indicates “contiguous to” in the one-dimensional memory space, each of the sub-LISs is of an LIS size, a depth associated to each sub-LIS is a number of recursions from the top LIS, the depth of each of the LISi equals the depth of the LB plus one, and the depth of the top LIS is zero,
• wherein each of the elements is of an element size, the element sizes are the same, and the LB sizes of the sub-LISs within the same depth are the same,
• wherein the piece of recursively structured data arranged in the one-dimensional memory space defines an array as LIS T X[D0, D1, D2, . . . , Dn],
• wherein X is the name of the piece of recursively structured data, the variable n is the maximum LIS depth and is a nonnegative integer, the array is of n+1 dimensions, each of the dimensions corresponds to a dimension size, the notation T represents a data type of the elements, the variable Dj represents the dimension size of the j-th dimension, the j-th dimension corresponds to the j-th depth of the piece of recursively structured data, and the variable j is an index of the dimension between 0 and n,
• wherein each of the elements is denoted as X[I0, . . . , Im], the variable m is an integer between 0 and n, the variable Im represents an index corresponding to the m-th dimension, Im is between 0 and Dm−1, the notation X[I0] is the I0-th element of the LIS, the notation X[I0, . . . , Im−1, Im] is the Im-th element of LISmIm−1, and the notation LISmIm−1 represents the Im−1-th sub-LIS of the depth m.