CAvlTree

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. val Colls: CollBuilder

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. val builder: CostingSigmaDslBuilder.type

   

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def contains(key: Coll[Byte], proof: Coll[Byte]): Boolean

   

   Checks if an entry with key key exists in this tree using proof proof.

   Checks if an entry with key key exists in this tree using proof proof. Throws exception if proof is incorrect

   key

   a key of an element of this authenticated dictionary.

   Definition Classes

   CAvlTree → AvlTree

   Note

   CAUTION! Does not support multiple keys check, use getMany instead. Return true if a leaf with the key key exists Return false if leaf with provided key does not exist.

9. def digest: Coll[Byte]

   

   Returns digest of the state represented by this tree.

   Returns digest of the state represented by this tree. Authenticated tree digest = root hash bytes ++ tree height

   Definition Classes

   CAvlTree → AvlTree

   Since

   2.0

10. def enabledOperations: Byte

    

    Flags of enabled operations packed in single byte.

    Flags of enabled operations packed in single byte. isInsertAllowed == (enabledOperations & 0x01) != 0 isUpdateAllowed == (enabledOperations & 0x02) != 0 isRemoveAllowed == (enabledOperations & 0x04) != 0

    Definition Classes

    CAvlTree → AvlTree

11. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. def get(key: Coll[Byte], proof: Coll[Byte]): Option[Coll[Byte]]

    

    Perform a lookup of key key in this tree using proof proof.

    Perform a lookup of key key in this tree using proof proof. Throws exception if proof is incorrect

    key

    a key of an element of this authenticated dictionary.

    Definition Classes

    CAvlTree → AvlTree

    Note

    CAUTION! Does not support multiple keys check, use getMany instead. Return Some(bytes) of leaf with key key if it exists Return None if leaf with provided key does not exist.

14. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

15. def getMany(keys: Coll[Coll[Byte]], proof: Coll[Byte]): Coll[Option[Coll[Byte]]]

    

    Perform a lookup of many keys keys in this tree using proof proof.

    Perform a lookup of many keys keys in this tree using proof proof.

    keys

    keys of elements of this authenticated dictionary.

    Definition Classes

    CAvlTree → AvlTree

    Note

    CAUTION! Keys must be ordered the same way they were in lookup before proof was generated. For each key return Some(bytes) of leaf if it exists and None if is doesn't.

16. def insert(entries: Coll[(Coll[Byte], Coll[Byte])], proof: Coll[Byte]): Option[AvlTree]

    

    Perform insertions of key-value entries into this tree using proof proof.

    Perform insertions of key-value entries into this tree using proof proof. Throws exception if proof is incorrect

    Definition Classes

    CAvlTree → AvlTree

    Note

    CAUTION! Pairs must be ordered the same way they were in insert ops before proof was generated. Return Some(newTree) if successful Return None if operations were not performed.

17. def isInsertAllowed: Boolean

    

    Checks if Insert operation is allowed for this tree instance.

    Checks if Insert operation is allowed for this tree instance.

    Definition Classes

    CAvlTree → AvlTree

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

19. def isRemoveAllowed: Boolean

    

    Checks if Remove operation is allowed for this tree instance.

    Checks if Remove operation is allowed for this tree instance.

    Definition Classes

    CAvlTree → AvlTree

20. def isUpdateAllowed: Boolean

    

    Checks if Update operation is allowed for this tree instance.

    Checks if Update operation is allowed for this tree instance.

    Definition Classes

    CAvlTree → AvlTree

21. def keyLength: Int

    

    All the elements under the tree have the same length of the keys

    All the elements under the tree have the same length of the keys

    Definition Classes

    CAvlTree → AvlTree

22. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

23. final def notify(): Unit

    

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

25. def remove(operations: Coll[Coll[Byte]], proof: Coll[Byte]): Option[AvlTree]

    

    Perform removal of entries into this tree using proof proof.

    Perform removal of entries into this tree using proof proof. Throws exception if proof is incorrect Return Some(newTree) if successful Return None if operations were not performed.

    operations

    collection of keys to remove from this authenticated dictionary.

    Definition Classes

    CAvlTree → AvlTree

    Note

    CAUTION! Keys must be ordered the same way they were in remove ops before proof was generated.

26. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

27. val treeData: AvlTreeData

    

28. def update(operations: Coll[(Coll[Byte], Coll[Byte])], proof: Coll[Byte]): Option[AvlTree]

    

    Perform updates of key-value entries into this tree using proof proof.

    Perform updates of key-value entries into this tree using proof proof. Throws exception if proof is incorrect

    operations

    collection of key-value pairs to update in this authenticated dictionary.

    Definition Classes

    CAvlTree → AvlTree

    Note

    CAUTION! Pairs must be ordered the same way they were in update ops before proof was generated. Return Some(newTree) if successful Return None if operations were not performed.

29. def updateDigest(newDigest: Coll[Byte]): AvlTree

    

    Replace digest of this tree producing a new tree.

    Replace digest of this tree producing a new tree. Since AvlTree is immutable, this tree instance remains unchanged.

    newDigest

    a new digest

    returns

    a copy of this AvlTree instance where this.digest replaced by newDigest

    Definition Classes

    CAvlTree → AvlTree

30. def updateOperations(newOperations: Byte): AvlTree

    

    Enable/disable operations of this tree producing a new tree.

    Enable/disable operations of this tree producing a new tree. Since AvlTree is immutable, this tree instance remains unchanged.

    newOperations

    a new flags which specify available operations on a new tree.

    returns

    a copy of this AvlTree instance where this.enabledOperations replaced by newOperations

    Definition Classes

    CAvlTree → AvlTree

31. def valueLengthOpt: Option[Int]

    

    If non-empty, all the values under the tree are of the same length.

    If non-empty, all the values under the tree are of the same length.

    Definition Classes

    CAvlTree → AvlTree

32. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

34. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35. def wrappedValue: AvlTreeData

    

    The data value wrapped by this wrapper.

    The data value wrapped by this wrapper.

    Definition Classes

    CAvlTree → WrapperOf