Package minicp.state
package minicp.state
State Management
-
ClassDescriptionStateManager that will store the state of every created elements at each
Copier.saveState()call.Copy<T>Implementation ofStatewith copy strategyImplementation ofStateIntwith copy strategyCopyMap<K,V> Implementation ofStateMapwith copy strategyState<T>Object that wraps a reference and can be saved and restored through theStateManager.saveState()/StateManager.restoreState()methods.A StateEntry is aimed to be stored by a StateManager to revert some stateObject that wraps an integer value that can be saved and restored through theStateManager.saveState()/StateManager.restoreState()methods.Implementation of an interval that can saved and restored through theStateManager.saveState()/StateManager.restoreState()methods.A sparse-set that lazily switch from an dense interval representation to a sparse-set representation when a hole is created in the interval.The StateManager exposes all the mechanisms and data-structures needed to implement a depth-first-search with reversible states.StateMap<K,V> A generic map that can revert its state withStateManager.saveState()/StateManager.restoreState()methods.Class to represent a bit-set that can be saved and restored through theStateManager.saveState()/StateManager.restoreState()Set implemented using a sparse-set data structure that can be saved and restored through theStateManager.saveState()/StateManager.restoreState()methods.StateStack<E>Generic Stack that can be saved and restored through theStateManager.saveState()/StateManager.restoreState()methods.Object that can be saved by theCopier.Trail<T>Implementation ofStatewith trail strategyStateManager that will lazily store the state of state object at eachTrailer.saveState()call.Implementation ofStateIntwith trail strategyTrailMap<K,V> Implementation ofStateMapwith trail strategy