All Classes and Interfaces

Class	Description
Alt	Interface for Alt stores.
Alt2<V1,V2>	This interface is conceptually just a pair just like Map.Entry However, reusing Map.Entry for storage nodes (schema) is very confusing in debugging, because Entry is especially used on the stores (often Maps).
Alt3<V1,V2,V3>
CMap<K,V,X>
CMapImpl<K,V,X>	A completable map.
CMapSupplier<X>	Helper interface for creating new map instances with automatically inferred types
CSet<T,X>
CSetImpl<T,X>
CSetSupplier<X>	Helper interface for creating new set instances with automatically inferred types
CStorageComposers
HasData<T>
ListSupplier	Helper interface for creating new set instances with automatically inferred types
MapSupplier	Helper interface for creating new map instances with automatically inferred types
MapSuppliers
MapSuppliers.MapSupplierTreeMap<T>
SetSupplier	Helper interface for creating new set instances with automatically inferred types
SetSuppliers
SetSuppliers.SetSupplierTreeSet<X>
StorageComposers	A collection of static methods for composing storage structures such as arbitrarily nested maps
StorageNode<D,C,V>	A StorageNode can express nested storage such as nested maps, lists and sets for tuples.
StorageNodeAlt2<D,C,V1,V2>
StorageNodeAlt3<D,C,V1,V2,V3>
StorageNodeAltBase<D,C,V>	Base class for index nodes that do not index by a key - or rather: index by a single key that is a zero-sized tuple
StorageNodeAltN<D,C>
StorageNodeBase<D,C,V>
StorageNodeBased<D,C,V>	Interface for store-based objects to expose both store and storage.
StorageNodeCompoundBase<D,C,V>
StorageNodeDictionary<D1,C1,D2,C2,V,X>	A wrapper for a storage node that adds a dictionary for the components Can be used to map e.g.
StorageNodeDomainWrapping<D,C,V,X>
StorageNodeForwarding<D,C,V,X>
StorageNodeInnerMap<D,C,K,V,M>
StorageNodeLeafComponentSet<D,C,V,S>	Essentially a view of a Set as a Mapinvalid input: '<'K, Void>
StorageNodeLeafDomainList<D,C,V>	Essentially a view of a Set as a Mapinvalid input: '<'Void, Set>
StorageNodeLeafDomainSet<D,C,V,S>	Essentially a view of a List<D> as a Map<EMPTY_LIST, List<D>> where there for a non-empty List<D> there is exactly a single key that is the empty list.
StorageNodeLeafMap<D,C,K,V,M>
StorageNodeMutable<D,C,V>
StorageNodeMutableForwarding<D,C,V,X>
StorageNodeMutableForwardingBase<D,C,V,X>
StorageNodeWrapperCodec<D,C,V,X>
TupleCodec<D1,C1,D2,C2>	Component-wise tuple codec.
TupleCodecBased<D1,C1,D2,C2>
TupleCodecCanonical<D,C>
TupleCodecDictionary<D1,C1,D2,C2>
TupleValueFunction<ComponentType, ValueType>	Map a tuple-like object to a value