StaticdefaultFinds the index of the low element for the given value which should not be part of the array.
Low element is the greatest element which still has a lower value than the provided one.
Low elements are used in non-membership proofs.
Returns the low element for the given value and the next value for that low element. Low element is the greatest element which still has lower value than the provided one. Low elements are used in non-membership proofs.
Returns the hash of the given element. That hash consists of:
nextIndex of the given element.nextIndex.Appends a new element with the given value to the indexed array. It finds the low element index and uses it to append the new element correctly.
The value of the new element to append.
The new element and its low element after insertion.
Appends a new element with the given value to the indexed array using a specific low element index. This method ensures the new element is placed correctly relative to the low element.
The index of the low element.
The value of the new element to append.
The new element and its updated low element.
Finds the lowest element in the array.
The lowest element or undefined if the array is empty.
Creates a new element with the specified value and updates the low element index accordingly.
The index of the low element.
The value for the new element.
A bundle containing the new element, the updated low element, and the value of the next element.
Creates a new element with the specified value by first finding the appropriate low element index.
The value for the new element.
A bundle containing the new element, the updated low element, and the value of the next element.
This indexed array implementation mirrors the rust implementation of the indexed merkle tree. It stores the elements of the indexed merkle tree.