itreap | immutable ordered list with position

itreap is a Go library. itreap has no bugs, it has no vulnerabilities and it has low support. However itreap has a Non-SPDX License. You can download it from GitHub.

package itreap import "github.com/glenn-brown/itreap". type fast interface { less(interface{}) bool score(interface{}) float64 }. type slow interface { less(interface{}) bool } an itreap can hold any type that implements the slow interface, but the fast interface is faster. method less(b) must return true iff the value of the receiver is less than b. type t struct { // contains filtered or unexported fields } type t is an immutable ordered list. func new() *t return nil, the empty immutable list. func (a *t) contains(value interface{}) bool contains returns true iff the tree contains the specified value, in o(log(n)) time. func (t *t) getn(n int) (value interface{}) return the value at position n in the list. the index n must be in the interval [0,t.len()). func (t *t) insert(value interface{}) *t insert