The documentation is still in progress (so is the package).
CompressedStacks.jl is a Julia package that provides a framework for compressed stacks. The design of this package is based on the article of ... All data structures and algorithms are implemented in pure Julia, and thus they are portable.
The compressed stack structure used in CompressedStacks.jl requires conditions to be used optimally. If implemented with a classical stack, the problem requirements should be as follows:
html 1 : Initialize stack and auxiliary data structure DS with O(1) elements from I 2 : for all subsequent input a ∈ I do 3 : while pop-condition(a,DS,stack.top(1),. . . , stack.top(k)) do 4 : stack.pop 5 : end while 6 : if push-condition(a,DS,stack.top(1),. . . , stack.top(k)) then 7 : stack.push(a) 8 : end if 9 : end for 10: Report(stack)
The user is required to give the following functions (even for classical stacks)
For Compressed Stacks, the following parameters are also required
over 1 year ago