hashed array tree data structure


                                 
                                                InsertAt (
                                Rank rank
                ,                                Value value
                                                )

Insert the given value in the given rank (index) holding old value (probably shifting)

Removes the value from the given rank (index). Decreases dynamic array size (Probably by shifting)


                                Positive Integral 
                                                Size (
                                 
                                                )

Returns the size of the elements in the container (Most likely it is the count of the elements)

Returns true if the capacity has no elements, false otherwise.


                                Boolean 
                                                ContainsValue (
                                Value value
                                                )

Checks if the container contains the given value or not