The base class of the container implements some common methods for the container

Doubly linked list. Refer to the golang standard library implementation

linked list element

A queue implemented using fixed-length arrays

Fix re-establishes the heap ordering after the element at index i has changed its value.

Initialize array to heap

Pop removes and returns the minimum element (according to cf or <) from the heap.

Push pushes the element x onto the heap.

Remove removes and returns the element at index i from the heap.

container interface

Container Creation Options