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 TypeClassDescriptionclassClass representing a Peer's view of the overall network consensus state.final classA Block contains an ordered collection of signed transactions that may be applied collectively as part of a state update.classClass representing the result of applying a Block to a State.classClass representing an Ordering of transactions, along with the consensus position.final classClass representing the result of a Query or Transaction.classClass 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 TypeClassDescriptionclassAbstract base class for BlobMaps: a sorted radix-tree map of Blobs to Values.classClass representing the current on-chain status of an account.classclassclassAbstract base class for lists.classAbstract base class for maps.classclassBase class for Record data types.classAbstract base class for generic records.classAbstract base class for concrete sequential data structure (immutable persistent lists and vectors etc.)classAbstract based class for sets.classAbstract base class for vectors.classBlobMap node implementation supporting: An optional prefix string An optional entry with this prefix Up to 16 child entries at the next level of depthclassImplementation of a list wrapping a vector.classMap.Entry implementation for persistent maps.classLimited 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 representationclassPersistent Map for large hash maps requiring tree structure.classClass describing the on-chain state of a Peer declared on the network.classLimited size Persistent Merkle Set implemented as a small sorted list of Values Must be sorted by Key hash value to ensure uniqueness of representationclassPersistent Set for large hash sets requiring tree structure.final classSignedData<T extends ACell>Node representing a signed data object.classVectorArray<T extends ACell>Experimental: implementation of AVector backed by a Java array for temporary usage purposes.classVectorLeaf<T extends ACell>A Persistent Vector implementation representing 0-16 elements with a packed Vector prefix.classVectorTree<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 TypeClassDescriptionclassAbstract base class for immutable transactions Transactions may modify the on-chain State according to the rules of the specific transaction type.classTransaction representing a Call to an Actor.classTransaction class representing the Invoke of an on-chain operation.classThe Multi class enables multiple child transactions to be grouped into a single wrapper transaction with useful joint execution semantics.classTransaction class representing a coin Transfer from one account to another