Uses of Interface
convex.core.data.IAssociative
Packages that use IAssociative
Package
Description
Fundamental Convex classes used for the decentralised network
Data structures and algorithms, including a complete set of classes
required to implement immutable, decentralised data objects.
Convex network transaction types.
-
Uses of IAssociative in convex.core
Classes in convex.core that implement IAssociativeModifier and TypeClassDescriptionclass
Class representing a Peer's view of the overall network consensus state.final class
A Block contains an ordered collection of signed transactions that may be applied collectively as part of a state update.class
Class representing the result of applying a Block to a State.class
Class representing an Ordering of transactions, along with the consensus position.final class
Class representing the result of a Query or Transaction.class
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 IAssociative in convex.core.data
Classes in convex.core.data that implement IAssociativeModifier and TypeClassDescriptionclass
Abstract base class for BlobMaps: a sorted radix-tree map of Blobs to Values.class
Class representing the current on-chain status of an account.class
class
class
Abstract base class for lists.class
Abstract base class for maps.class
class
Base class for Record data types.class
Abstract base class for generic records.class
Abstract base class for concrete sequential data structure (immutable persistent lists and vectors etc.)class
Abstract based class for sets.class
Abstract base class for vectors.class
BlobMap node implementation supporting: An optional prefix string An optional entry with this prefix Up to 16 child entries at the next level of depthclass
Implementation of a list wrapping a vector.class
Map.Entry implementation for persistent maps.class
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 representationclass
Persistent Map for large hash maps requiring tree structure.class
Class describing the on-chain state of a Peer declared on the network.class
Limited size Persistent Merkle Set implemented as a small sorted list of Values Must be sorted by Key hash value to ensure uniqueness of representationclass
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>
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. -
Uses of IAssociative in convex.core.transactions
Classes in convex.core.transactions that implement IAssociativeModifier and TypeClassDescriptionclass
Abstract base class for immutable transactions Transactions may modify the on-chain State according to the rules of the specific transaction type.class
Transaction representing a Call to an Actor.class
Transaction class representing the Invoke of an on-chain operation.class
The Multi class enables multiple child transactions to be grouped into a single wrapper transaction with useful joint execution semantics.class
Transaction class representing a coin Transfer from one account to another