Uses of Class
convex.core.data.ACountable

Packages that use ACountable

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.lang	Core CVM implementation

Uses of ACountable in convex.core

Subclasses of ACountable in convex.core

Modifier and Type	Class	Description
class	Belief	Class representing a Peer's view of the overall network consensus state.
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	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 ACountable in convex.core.data

Subclasses of ACountable in convex.core.data

Modifier and Type	Class	Description
class	AArrayBlob	Abstract base class for binary data stored in Java arrays.
class	ABlob	Abstract base class for data objects containing immutable chunks of binary data.
class	ABlobMap<K extends ABlob,V extends ACell>	Abstract base class for a sorted radix-tree map of Blobs to values.
class	AccountKey	Immutable class representing an Ed25519 Public Key for an Account
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	ADataStructure<E extends ACell>	Abstract base class for Persistent data structures.
class	Address	Immutable class representing an Address, generally used to uniquely identify an Account.
class	AHashMap<K extends ACell,V extends ACell>
class	AHashSet<T extends ACell>
class	AList<T extends ACell>	Abstract base class for lists.
class	ALongBlob
class	AMap<K extends ACell,V extends ACell>	Abstract base class for maps.
class	AMapEntry<K extends ACell,V extends ACell>
class	ANumericBlob	Base class for Blobs which represent an integral numeric value
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 persistent lists and vectors
class	ASet<T extends ACell>	Abstract based class for sets.
class	AString	Class representing a CVM String
class	AVector<T extends ACell>	Abstract base class for vectors.
class	Blob	General purpose immutable wrapper for byte array data.
class	BlobMap<K extends ABlob,V extends ACell>	BlobMap node implementation supporting: An optional prefix string An optional entry with this prefix Up to 16 child entries at the next level of depth
class	BlobTree	Implementation of a large Blob data structure consisting of 2 or more chunks.
class	Hash	Class used to represent an immutable 32-byte Hash value.
class	List<T extends ACell>	Implementation of a list wrapping a vector.
class	LongBlob	Wrapper for an 8-byte long blob We use this for efficient management of indexes using longs in BlobMaps.
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.
class	StringShort	Class representing a short CVM string.
class	StringSlice	AString subclass representing a subsequence of another charsequence
class	StringTree
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.

Methods in convex.core.data with parameters of type ACountable

Modifier and Type	Method	Description
static <T extends ACell> ASet<T>	Sets.create(ACountable<T> source)	Creates a set of all the elements in the given data structure

Uses of ACountable in convex.core.lang

Methods in convex.core.lang that return ACountable

Modifier and Type	Method	Description
static <E extends ACell> ACountable<E>	RT.ensureCountable(ACell a)	Casts to an ACountable instance