Package convex.core.data
Class MapTree<K extends ACell,V extends ACell>
java.lang.Object
convex.core.data.AObject
convex.core.data.ACell
convex.core.data.ACountable<E>
convex.core.data.ADataStructure<MapEntry<K,V>>
convex.core.data.AMap<K,V>
convex.core.data.AHashMap<K,V>
convex.core.data.MapTree<K,V>
- Type Parameters:
K- Type of map keysV- Type of map values
- All Implemented Interfaces:
IValidated,IWriteable,Map<K,V>
Persistent Map for large hash maps requiring tree structure.
Internally implemented as a radix tree, indexed by key hash. Uses an array of
child Maps, with a bitmap mask indicating which hex digits are present, i.e.
have non-empty children.
-
Nested Class Summary
-
Field Summary
FieldsFields inherited from class convex.core.data.ADataStructure
countFields inherited from class convex.core.data.ACell
cachedRef, EMPTY_ARRAY -
Method Summary
Modifier and TypeMethodDescriptionprotected voidaccumulateEntrySet(HashSet<Map.Entry<K,V>> h)Accumulate all entries from this map in the given HashSet.protected voidaccumulateKeySet(HashSet<K> h)Accumulate all keys from this map in the given HashSet.protected voidaccumulateValues(ArrayList<V> al)Accumulate all values from this map in the given ArrayList.Associates the given key with the specified value.assocEntry(MapEntry<K,V> e)Associate the given map entry into the map.assocEntry(MapEntry<K,V> e, int shift)booleancontainsAllKeys(AHashMap<K,V> map)Returns true if this map contains all the same keys as another mapprotected booleancontainsAllKeys(MapTree<K,V> map)booleancontainsKey(ACell key)Checks if the data structure contains the specified keybooleancontainsValue(Object value)static intdigitForIndex(int index, short mask)Dissociates a key from this map, returning an updated map if the key was removed, or the same unchanged map if the key is not present.Dissoc given a Ref to the key value.intencode(byte[] bs, int pos)Writes this HashMap to a byte array.intencodeRaw(byte[] bs, int pos)Writes this Cell's encoding to a byte array, excluding the tag byteentryAt(long i)Gets the entry in this map at a specified index, according to the map-specific order.entrySet()booleanChecks this map for equality with another map.booleanequalsKeys(AMap<K,V> a)Returns true if this map has exactly the same keys as the other mapintEstimate the encoded data size for this Cell.voidforEach(BiConsumer<? super K,? super V> action)Get the value associated with a given key.Gets the MapEntry for the given keygetEntryByHash(Hash hash)Gets the map entry with the specified hashgetKeyRefEntry(Ref<ACell> ref)Get an entry given a Ref to the key value.getRef(int i)Gets a numbered child Ref from within this Cell.intGets the number of Refs contained within this Cell.bytegetTag()Gets the tag byte for this cell.booleanReturns true if this Cell is in a canonical format for message writing.booleanReturns true if this object represents a first class CVM Value.keySet()Maps a function over all entries in this Map to produce updated entries.mergeDifferences(AHashMap<K,V> b, MergeFunction<V> func)Merge this map with another map, using the given function for each key that is present in either map and has a different value The function is passed null for missing values in either map, and must return type V.mergeDifferences(AHashMap<K,V> b, MergeFunction<V> func, int shift)Merge this map with another map, using the given function for each key that is present in either map.read(ByteBuffer bb, long count)Reads a ListMap from the provided ByteBuffer Assumes the header byte and count is already read.<R> RreduceEntries(BiFunction<? super R,MapEntry<K,V>,? extends R> func, R initial)Reduce over all map entries in this map<R> RreduceValues(BiFunction<? super R,? super V,? extends R> func, R initial)Reduce over all values in this mapConverts this Cell to its canonical version.updateRefs(IRefFunction func)Updates all Refs in this object using the given function.voidvalidate()Validates the complete structure of this object.voidValidates the local structure and invariants of this cell.protected voidvalidateWithPrefix(String prefix)Validates the map with a given hex prefix.Methods inherited from class convex.core.data.AHashMap
empty, filterValues, getKeys, mergeMethods inherited from class convex.core.data.AMap
clear, conj, containsKey, containsKeyRef, entryVector, equals, get, get, get, getElementRef, getType, print, put, putAll, remove, valuesMethods inherited from class convex.core.data.ADataStructure
conjAll, count, isEmpty, sizeMethods inherited from class convex.core.data.ACell
announce, announce, attachMemorySize, attachRef, cachedEncoding, cachedHash, calcMemorySize, createAnnounced, createEncoding, createPersisted, createPersisted, createRef, equals, getChildRefs, getEncoding, getEncodingLength, getHash, getMemorySize, getRef, hashCode, isEmbedded, toString, writeMethods inherited from class convex.core.data.AObject
attachEncoding, printMethods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove, replace, replace, replaceAll, size
-
Field Details
-
MAX_ENCODING_LENGTH
public static int MAX_ENCODING_LENGTH
-
-
Method Details
-
create
-
containsKey
Description copied from class:ADataStructureChecks if the data structure contains the specified key -
getEntry
Description copied from class:AMapGets the MapEntry for the given key -
getKeyRefEntry
Description copied from class:AMapGet an entry given a Ref to the key value. This is more efficient than directly looking up using the key for some map types, and should be preferred if the caller already has a Ref available. -
containsValue
-
get
Description copied from class:ADataStructureGet the value associated with a given key. -
entryAt
Description copied from class:AMapGets the entry in this map at a specified index, according to the map-specific order. -
getEntryByHash
Description copied from class:AMapGets the map entry with the specified hash -
dissoc
Description copied from class:AMapDissociates a key from this map, returning an updated map if the key was removed, or the same unchanged map if the key is not present. -
dissocRef
Description copied from class:AHashMapDissoc given a Ref to the key value. -
digitForIndex
public static int digitForIndex(int index, short mask) -
assoc
Description copied from class:AMapAssociates the given key with the specified value. -
assocRef
-
assocRef
-
assocEntry
Description copied from class:AMapAssociate the given map entry into the map. May return null if the map entry is not valid for this map type. -
assocEntry
-
keySet
-
accumulateKeySet
Description copied from class:AMapAccumulate all keys from this map in the given HashSet. -
accumulateValues
Description copied from class:AMapAccumulate all values from this map in the given ArrayList. -
entrySet
-
accumulateEntrySet
Description copied from class:AMapAccumulate all entries from this map in the given HashSet. -
encode
public int encode(byte[] bs, int pos)Description copied from class:AHashMapWrites this HashMap to a byte array. Will include values by default. -
encodeRaw
public int encodeRaw(byte[] bs, int pos)Description copied from class:ACellWrites this Cell's encoding to a byte array, excluding the tag byte -
estimatedEncodingSize
public int estimatedEncodingSize()Description copied from interface:IWriteableEstimate the encoded data size for this Cell. Used for quickly sizing buffers. Implementations should try to return a size that is likely to contain the entire object when represented in binary format, including the tag byte.- Returns:
- The estimated size for the binary representation of this object.
-
read
public static <K extends ACell, V extends ACell> MapTree<K,V> read(ByteBuffer bb, long count) throws BadFormatExceptionReads a ListMap from the provided ByteBuffer Assumes the header byte and count is already read.- Parameters:
bb- ByteBuffer to read fromcount- Count of map entries- Returns:
- TreeMap instance as read from ByteBuffer
- Throws:
BadFormatException- If encoding is invalid
-
forEach
-
isCanonical
public boolean isCanonical()Description copied from class:ACellReturns true if this Cell is in a canonical format for message writing. Reading or writing a non-canonical value should be considered illegal, but non-canonical objects may be used on a temporary internal basis.- Specified by:
isCanonicalin classACell- Returns:
- true if the object is in canonical format, false otherwise
-
isCVMValue
public final boolean isCVMValue()Description copied from class:ACellReturns true if this object represents a first class CVM Value. Sub-structural cells that are not themselves first class values should return false. CVM values might not be in a canonical format, e.g. temporary data structures- Specified by:
isCVMValuein classACell- Returns:
- true if the object is a CVM Value, false otherwise
-
getRefCount
public int getRefCount()Description copied from class:ACellGets the number of Refs contained within this Cell. This number is final / immutable for any given instance. Contained Refs may be either external or embedded.- Specified by:
getRefCountin classACell- Returns:
- The number of Refs in this Cell
-
getRef
Description copied from class:ACellGets a numbered child Ref from within this Cell. -
updateRefs
Description copied from class:ACellUpdates all Refs in this object using the given function. The function *must not* change the hash value of Refs, in order to ensure structural integrity of modified data structures. This is a building block for a very sneaky trick that enables use to do a lot of efficient operations on large trees of smart references. Must return the same object if no Refs are altered. -
mergeWith
Description copied from class:AHashMapMerge this map with another map, using the given function for each key that is present in either map. The function is applied to the corresponding values with the same key. The function is passed null for missing values in either map, and must return type V. If the function returns null, the entry is removed. Returns the same map if no changes occurred. PERF WARNING: This method's contract requires calling the function on all values in both sets, which will cause a full data structure traversal. If the function will only return one or other of the compared values consider using mergeDifferences instead. -
mergeWith
-
mergeDifferences
Description copied from class:AHashMapMerge this map with another map, using the given function for each key that is present in either map and has a different value The function is passed null for missing values in either map, and must return type V. If the function returns null, the entry is removed. Returns the same map if no changes occurred. -
mergeDifferences
-
reduceValues
Description copied from class:AMapReduce over all values in this map -
reduceEntries
Description copied from class:AMapReduce over all map entries in this map -
equalsKeys
Description copied from class:AMapReturns true if this map has exactly the same keys as the other map -
equals
Description copied from class:AMapChecks this map for equality with another map. In general, maps should be considered equal if they have the same canonical representation, i.e. the same hash value. Subclasses may override this this they have a more efficient equals implementation or a more specific definition of equality. -
mapEntries
Description copied from class:AHashMapMaps a function over all entries in this Map to produce updated entries. May not change keys, but may return null to remove an entry. -
validate
Description copied from interface:IValidatedValidates the complete structure of this object. It is necessary to ensure all child Refs are validated, so the general contract for validate is:- Call super.validate() - which will indirectly call validateCell()
- Call validate() on any contained cells in this class
- Specified by:
validatein interfaceIValidated- Overrides:
validatein classACell- Throws:
InvalidDataException- If the data Valie is invalid in any way
-
validateWithPrefix
Description copied from class:AHashMapValidates the map with a given hex prefix. This is necessary to ensure that child maps are valid, in particular have the correct shift level and that all key hashes start with the correct prefix of hex characters. TODO: consider faster way of passing prefix than hex string, probably a byte[] stack.- Specified by:
validateWithPrefixin classAHashMap<K extends ACell,V extends ACell>- Throws:
InvalidDataException
-
validateCell
Description copied from class:ACellValidates the local structure and invariants of this cell. Called by validate() super implementation. Should validate directly contained data, but should not validate all other structure of this cell. In particular, should not traverse potentially missing child Refs.- Specified by:
validateCellin classACell- Throws:
InvalidDataException- If the Cell is invalid
-
containsAllKeys
Description copied from class:AHashMapReturns true if this map contains all the same keys as another map -
containsAllKeys
-
getTag
public byte getTag()Description copied from class:ACellGets the tag byte for this cell. The tag byte will be the first byte of the encoding -
toCanonical
Description copied from class:ACellConverts this Cell to its canonical version. Returns this if already canonical- Specified by:
toCanonicalin classACell- Returns:
- Canonical version of Cell
-