Clean up stack pop functions
This commit is contained in:
parent
2f3e92c9be
commit
b1a696085a
2 changed files with 34 additions and 59 deletions
|
|
@ -87,7 +87,7 @@ StackPushResult ts_stack_push(Stack *, int head_index, TSTree *, bool,
|
|||
* which had previously been merged. It returns a struct that indicates the
|
||||
* index of each revealed head and the trees removed from that head.
|
||||
*/
|
||||
StackPopResult ts_stack_pop_count(Stack *, int head_index, int count);
|
||||
StackPopResult ts_stack_pop_count(Stack *, int head_index, size_t count);
|
||||
|
||||
StackPopResult ts_stack_pop_until(Stack *, int head_index, StackIterateCallback,
|
||||
void *);
|
||||
|
|
@ -96,11 +96,6 @@ StackPopResult ts_stack_pop_pending(Stack *, int head_index);
|
|||
|
||||
TreeArray ts_stack_pop_all(Stack *, int head_index);
|
||||
|
||||
/*
|
||||
* Remove the given number of entries from the given head of the stack.
|
||||
*/
|
||||
void ts_stack_shrink(Stack *, int head_index, int count);
|
||||
|
||||
/*
|
||||
* Split the given stack head into two heads, so that the stack can be
|
||||
* transformed from its current state in multiple alternative ways. Returns
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue