Insert a new set of values to the skiplist while performing the aggregation between the new values that overlap with the values in the list.
The complexity of this function is
- average: O(count*log(n))
- worst case: O(n + count*log(n)) (when period spans the whole list so everything has to be deleted)
- Parameters
-
[in,out] | list | Skiplist |
[in] | keys | Array of keys |
[in] | values | Array of values |
[in] | count | Number of elements in the array |
[in] | func | Function used when aggregating temporal values, may be NULL for the merge aggregate function |
[in] | crossings | True if turning points are added in the segments when aggregating temporal value |
[in] | sktype | Type of the skiplist |