Uses of Interface
convex.core.data.IAssociative

Packages that use IAssociative

Package	Description
convex.core.data	Data structures and algorithms, including a complete set of classes required to implement immutable, decentralised data objects.

Uses of IAssociative in convex.core.data

Classes in convex.core.data that implement IAssociative

Modifier and Type	Class	Description
class	AHashSet<T extends ACell>
class	AList<T extends ACell>	Abstract base class for lists.
class	AMapEntry<K extends ACell,V extends ACell>
class	ASequence<T extends ACell>	Abstract base class for concrete sequential data structure (immutable persistent lists and vectors etc.)
class	ASet<T extends ACell>	Abstract based class for sets.
class	AVector<T extends ACell>	Abstract base class for vectors.
class	List<T extends ACell>	Implementation of a list wrapping a vector.
class	MapEntry<K extends ACell,V extends ACell>	Map.Entry implementation for persistent maps.
class	SetLeaf<T extends ACell>	Limited size Persistent Merkle Set implemented as a small sorted list of Values Must be sorted by Key hash value to ensure uniqueness of representation
class	SetTree<T extends ACell>	Persistent Set for large hash sets requiring tree structure.
class	VectorArray<T extends ACell>	Experimental: implementation of AVector backed by a Java array for temporary usage purposes.
class	VectorLeaf<T extends ACell>	A Persistent Vector implementation representing 0-16 elements with a packed Vector prefix.
class	VectorTree<T extends ACell>	Persistent Vector implemented as a merkle tree of chunks shift indicates the level of the tree: 4 = 1st level, 8 = second etc.