Uses of Class
convex.core.data.ADataStructure
Packages that use ADataStructure
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.
CVM type system implementation.
Core CVM implementation
-
Uses of ADataStructure in convex.core
Subclasses of ADataStructure in convex.coreModifier and TypeClassDescriptionclassClass representing a Peer's view of the overall network consensus state.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 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 ADataStructure in convex.core.data
Subclasses of ADataStructure in convex.core.dataModifier and TypeClassDescriptionclassAbstract base class for a sorted radix-tree map of Blobs to values.classClass representing the current on-chain status of an account.classACollection<T extends ACell>Abstract base class for Persistent Merkle CollectionsclassclassclassAbstract 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 persistent lists and vectorsclassAbstract 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.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.Methods in convex.core.data that return ADataStructureModifier and TypeMethodDescriptionabstract ADataStructure<E>Associates a key with a value in this associative data structure.abstract <R extends ACell>
ADataStructure<R>ADataStructure.conj(R x)Adds an element to this data structure, in the natural manner defined by the general data structure type.<R extends ACell>
ADataStructure<R>AMap.conj(R x)Adds a new map entry to this map.<R extends ACell>
ADataStructure<R>ADataStructure.conjAll(ACollection<R> 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 general type as this data structure. -
Uses of ADataStructure in convex.core.data.type
Methods in convex.core.data.type that return ADataStructureModifier and TypeMethodDescriptionDataStructure.defaultValue()DataStructure.implicitCast(ACell a) -
Uses of ADataStructure in convex.core.lang
Fields in convex.core.lang with type parameters of type ADataStructureModifier and TypeFieldDescriptionstatic CoreFn<ADataStructure<ACell>>Core.ASSOCstatic CoreFn<ADataStructure<ACell>>Core.CONJstatic CoreFn<ADataStructure<ACell>>Core.INTOMethods in convex.core.lang that return ADataStructureModifier and TypeMethodDescriptionstatic <R extends ACell>
ADataStructure<R>RT.assoc(ADataStructure<R> coll, ACell key, ACell value)Associates a key with a given value in an associative data structurestatic ADataStructure<?>RT.ensureAssociative(ACell o)Ensures the argument is an IAssociative instance.static <E extends ACell>
ADataStructure<E>RT.ensureDataStructure(ACell a)Casts to an ADataStructure instanceMethods in convex.core.lang with parameters of type ADataStructureModifier and TypeMethodDescriptionstatic <R extends ACell>
ADataStructure<R>RT.assoc(ADataStructure<R> coll, ACell key, ACell value)Associates a key with a given value in an associative data structurestatic ACellRT.get(ADataStructure<?> coll, ACell key)Gets an element from a data structure using the given key.static ACellRT.get(ADataStructure<?> coll, ACell key, ACell notFound)Gets an element from a data structure using the given key.