Uses of Class
convex.core.data.AHashSet
Packages that use AHashSet
Package
Description
Data structures and algorithms, including a complete set of classes
required to implement immutable, decentralised data objects.
-
Uses of AHashSet in convex.core.data
Subclasses of AHashSet in convex.core.dataModifier and TypeClassDescriptionclass
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.Methods in convex.core.data that return AHashSetModifier and TypeMethodDescriptionAHashSet.applySelf
(int setOp) AHashSet.conjAll
(ACollection<? extends T> elements) Sets.createWithShift
(int shift, ArrayList<Ref<T>> values) AHashSet.excludeRef
(Ref<?> valueRef) SetTree.excludeRef
(Ref<?> keyRef) AHashSet.includeAll
(ASet<? extends T> elements) AHashSet.includeRef
(Ref<T> ref) AHashSet.includeRef
(Ref<T> e, int i) SetLeaf.includeRef
(Ref<T> ref) SetLeaf.includeRef
(Ref<T> e, int shift) SetTree.includeRef
(Ref<T> ref) SetTree.replaceChild
(int i, Ref<AHashSet<T>> newChild) Replaces the child ref at a given index position.AHashSet.toCanonical()
SetLeaf.toCanonical()
SetTree.toCanonical()
Methods in convex.core.data with parameters of type AHashSetModifier and TypeMethodDescriptionMethod parameters in convex.core.data with type arguments of type AHashSet -
Uses of AHashSet in convex.core.data.impl
Methods in convex.core.data.impl that return AHashSet