Uses of Class
convex.core.data.ADataStructure

Packages that use ADataStructure

Package	Description
convex.core	Fundamental Convex classes used for the decentralised network
convex.core.data	Data structures and algorithms, including a complete set of classes required to implement immutable, decentralised data objects.
convex.core.data.impl
convex.core.data.type	CVM type system implementation.
convex.core.lang	Core CVM implementation
convex.core.transactions	Convex network transaction types.

Uses of ADataStructure in convex.core

Subclasses of ADataStructure in convex.core

Modifier and Type	Class	Description
class	Belief	Class representing a Peer's view of the overall network consensus state.
final class	Block	A Block contains an ordered collection of signed transactions that may be applied collectively as part of a state update.
class	BlockResult	Class representing the result of applying a Block to a State.
class	Order	Class representing an Ordering of transactions, along with the consensus position.
class	Receipt	Transaction Receipt record.
final class	Result	Class representing the result of a Query or Transaction.
class	State	Class representing the immutable state of the CVM State transitions are represented by blocks of transactions, according to the logic: s[n+1] = s[n].applyBlock(b[n]) State contains the following elements - Map of AccountStatus for every Address - Map of PeerStatus for every Peer Address - Global values - Schedule data structure "State.

Uses of ADataStructure in convex.core.data

Subclasses of ADataStructure in convex.core.data

Modifier and Type	Class	Description
class	AccountStatus	Class representing the current on-chain status of an account.
class	ACollection<T extends ACell>	Abstract base class for Persistent Merkle Collections
class	AHashMap<K extends ACell,V extends ACell>
class	AHashSet<T extends ACell>
class	AIndex<K extends ABlobLike<?>,V extends ACell>	Abstract base class for Indexes: a sorted radix-tree map of Blobs to Values.
class	AList<T extends ACell>	Abstract base class for lists.
class	AMap<K extends ACell,V extends ACell>	Abstract base class for maps.
class	AMapEntry<K extends ACell,V extends ACell>
class	ARecord	Base class for Record data types.
class	ARecordGeneric	Abstract base class for generic records.
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	ASpecialVector<T extends ACell>	BAse class for specialised vector implementations
class	AVector<T extends ACell>	Abstract base class for vectors.
final class	Index<K extends ABlobLike<?>,V extends ACell>	Index node implementation, providing an efficient radix tree based immutable data structure for indexed access and sorting.
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	MapLeaf<K extends ACell,V extends ACell>	Limited size Persistent Merkle Map implemented as a small sorted list of Key/Value pairs Must be sorted by Key hash value to ensure uniqueness of representation
class	MapTree<K extends ACell,V extends ACell>	Persistent Map for large hash maps requiring tree structure.
class	PeerStatus	Class describing the on-chain state of a Peer declared on the network.
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.
final class	SignedData<T extends ACell>	Node representing a signed data object.
class	VectorArray<T extends ACell>	Non-canonical vector implementation designed to make operations on small temporary vectors more efficient.
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.

Methods in convex.core.data that return ADataStructure

Modifier and Type	Method	Description
abstract ADataStructure<E>	ADataStructure.assoc(ACell key, ACell value)	Associates a key with a value in this associative data structure.
abstract ADataStructure<E>	ADataStructure.conj(ACell x)	Adds an element to this data structure, in the natural manner defined by the general data structure type.
ADataStructure<E>	ADataStructure.conjAll(ACollection<? extends E> xs)	Adds multiple elements to this data structure, in the natural manner defined by the general data structure type.
abstract ADataStructure<E>	ADataStructure.empty()	Returns an empty instance of the same Type as this data structure.

Uses of ADataStructure in convex.core.data.impl

Subclasses of ADataStructure in convex.core.data.impl

Modifier and Type	Class	Description
class	ADerivedSet<T extends ACell,K extends ACell,V extends ACell>	Abstract base class for non-canonical sets derived off maps Useful for cases where we want a Set instance, but don't want to construct a whole new data structure
class	KeySet<K extends ACell,V extends ACell>

Uses of ADataStructure in convex.core.data.type

Methods in convex.core.data.type that return ADataStructure

Modifier and Type	Method	Description
ADataStructure<?>	DataStructure.defaultValue()
ADataStructure<?>	DataStructure.implicitCast(ACell a)

Uses of ADataStructure in convex.core.lang

Fields in convex.core.lang with type parameters of type ADataStructure

Modifier and Type	Field	Description
static final CoreFn<ADataStructure<ACell>>	Core.ASSOC
static final CoreFn<ADataStructure<ACell>>	Core.CONJ
static final CoreFn<ADataStructure<ACell>>	Core.INTO
static final CoreFn<ADataStructure<?>>	Core.MAP

Methods in convex.core.lang that return ADataStructure

Modifier and Type	Method	Description
static <R extends ACell> ADataStructure<R>	RT.assoc(ADataStructure<R> coll, ACell key, ACell value)	Associates a key position with a given value in an associative data structure
static ADataStructure<?>	RT.ensureAssociative(ACell o)	Ensures the argument is an associative data structure instance.
static <E extends ACell> ADataStructure<E>	RT.ensureDataStructure(ACell a)	Casts to an ADataStructure instance

Methods in convex.core.lang with parameters of type ADataStructure

Modifier and Type	Method	Description
static <R extends ACell> ADataStructure<R>	RT.assoc(ADataStructure<R> coll, ACell key, ACell value)	Associates a key position with a given value in an associative data structure
static ACell	RT.get(ADataStructure<?> coll, ACell key)	Gets an element from a data structure using the given key.
static ACell	RT.get(ADataStructure<?> coll, ACell key, ACell notFound)	Gets an element from a data structure using the given key.

Uses of ADataStructure in convex.core.transactions

Subclasses of ADataStructure in convex.core.transactions

Modifier and Type	Class	Description
class	ATransaction	Abstract base class for immutable transactions Transactions may modify the on-chain State according to the rules of the specific transaction type.
class	Call	Transaction representing a Call to an Actor.
class	Invoke	Transaction class representing the Invoke of an on-chain operation.
class	Multi	The Multi class enables multiple child transactions to be grouped into a single wrapper transaction with useful joint execution semantics.
class	Transfer	Transaction class representing a coin Transfer from one account to another