Inputs

Outer Scope

This input is useful when linking different Nodes that are to have equal hierarchical dependency on each other.

...}

This port is important if you want to use the Node within a program loop, e.g., if you want to execute the Node with a connected Area Node several times in one cycle. This connection then ensures that this circuit area is first completely processed before the results of the Node are passed on to the subsequent circuit or the higher-level loop.

Data Type

This setting normally does not need to be changed. The Node itself can determine the data type of a connected Array and transfer it to the output Array accordingly. Use this setting only if you want to change the data type of the connected Array. You have to make sure yourself that a conversion of the introduced data type is plausibly possible.

Array

Here you direct the Array to the Node where elements are to be removed. This automatically changes the length of the Array as well.

Index[0..2147483647]

Here you define the index number of the first array element to be removed. The total number of elements to be removed can then still be set via the Number value. Therefore, to remove only the element specified via Index from the Array, use the Number value 1.

Count[0..2147483647]

Here you define the total number of elements in the Array to be removed. From which index entry of the array this number is valid, can be defined with the Index value. With the combination Index 2 and Count 2, the elements 2 and 3 would be removed from the Array and replaced by the last two values of the Array.

Keep Order

This function can be used to control how the gap in the Array created by deleting elements is filled. By default, this option is disabled, which causes elements from the end of the Array to be copied into the gap created.
When the option is enabled, all the elements move up after the gap to keep the original order of the elements. However, this bears the disadvantage that all elements that move up must be changed in their indexing accordingly. This process, therefore, requires more computing time, especially for large Arrays, compared to the method described first. The following image makes both modes clearer with a simple example.

Here, an Array with the letters A to F serves as the basis. The second element of the Array, in this case the letter B, was removed. On the left, the elements move up; on the right, the previously last element of the Array fills the gap.