Represents a queue of Int values sorted according to a score value.
Represents a queue of Int values sorted according to a score value.
Scores are Double value and initialized to 0, while the elements are initialized from 0 to length-1.
Elements are fixed, taking value from 0 to maxSize-1.
When an element is removed, the queue remembers its score, it is still possible to augment its score, and when the element is added back, it takes a position according to its current score.
Implements a stack of Int of fixed maximum size.
Implements a stack of Int of fixed maximum size.
This is an efficient data structure for representing the trail in a SAT solver. Though it can be used to represent a stack of Int with a fixed maximum size.
IllegalArgumentException
if maxSize < 0
Provides common data structure and algorithms useful for the whole scope of CafeSat.