|
|
◆ skiplist_splice()
| void skiplist_splice |
( |
SkipList * |
list, |
|
|
void ** |
values, |
|
|
int |
count, |
|
|
datum_func2 |
func, |
|
|
bool |
crossings |
|
) |
| |
Splice the skiplist with the array of values using the aggregation function.
- Note
- The complexity of this function is
- average: O(count*log(n)) (unless I'm mistaken)
- 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] | values | Array of values |
| [in] | count | Number of elements in the array |
| [in] | func | Function |
| [in] | crossings | True if turning points are added in the segments |
|
