Package convex.core.data
package convex.core.data
Data structures and algorithms, including a complete set of classes
required to implement immutable, decentralised data objects.
-
Interface SummaryInterfaceDescriptionInterface for associative data structuresInterface for CVM Numeric typesFunctional interface for operations on Cell Refs that may throw a MissingDataException In general, IRefFunction is used to provide a visitor for data objects containing nested Refs.Interface for classes that can be validated
-
Class SummaryClassDescriptionAbstract base class for binary data stored in Java arrays.Abstract base class for data objects containing immutable chunks of binary data.Abstract base class for a sorted radix-tree map of Blobs to values.Immutable class representing an Ed25519 Public Key for an AccountClass representing the current on-chain status of an account.Abstract base class for Cells.ACollection<T extends ACell>Abstract base class for Persistent Merkle CollectionsACountable<E extends ACell>Abstract base class for Countable objects.ADataStructure<E extends ACell>Abstract base class for Persistent data structures.Immutable class representing an Address.Abstract base class for lists.Abstract base class for maps.Base class for Blobs which represent an integral numeric valueBase class for record data types.Abstract base class for generic records.Abstract base class for persistent lists and vectorsAbstract based class for sets.Class representing a CVM StringAbstract based class for symbolic objects (Keywords, Symbols)Abstract base class for vectors.General purpose immutable wrapper for byte array data.BlobMap node implementation supporting: An optional prefix string An optional entry with this prefix Up to 16 child entries at the next level of depthImplementation of a large Blob data structure consisting of 2 or more chunks.Static utility class for message format encoding "Standards are always out of date.Class used to represent an immutable 32-byte Hash value.Keyword data type.Static Keyword values for configuration maps, records etc.Implementation of a list wrapping a vector.Wrapper for an 8-byte long blob We use this for efficient management of indexes using longs in BlobMaps.Map.Entry implementation for persistent maps.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 representationUtility class for map functionsPersistent Map for large hash maps requiring tree structure.Class describing the on-chain state of a Peer declared on the network.Class representing a smart reference to a decentralised data object.Ref subclass for direct in-memory references.Reference class implemented via a soft reference and store lookup.Limited size Persistent Merkle Set implemented as a small sorted list of Values Must be sorted by Key hash value to ensure uniqueness of representationPersistent Set for large hash sets requiring tree structure.SignedData<T extends ACell>Node representing a signed data object.Class representing a short CVM string.AString subclass representing a subsequence of another charsequenceClass representing a Symbol.Class representing a Syntax Object.Class containing constant Tag values.VectorArray<T extends ACell>Experimental: implementation of AVector backed by a Java array for temporary usage purposes.VectorLeaf<T extends ACell>A Persistent Vector implementation representing 0-16 elements with a packed Vector prefix.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.