number of elements in the array
returns smallest element ( O(1) )
returns index of smallest element ( O(1) )
number of elements in the array
read-only access to the i'th element
set element at i to value v ( O(log n) )
read-only access to all elements
Array-like structure with fast access to the smallest element.
Implemented using a segment tree. TODO: more array-like operations (e.g. pushBack, popBack, maybe iteration)