tree

Oct 18, 2017

Changes in this version

+ func Less(a *Elem, name string) int

+ type Color bool

+ type Elem struct

+ func (e *Elem) All() []dns.RR

+ func (e *Elem) Delete(rr dns.RR) (empty bool)

+ func (e *Elem) Empty() bool

+ func (e *Elem) Insert(rr dns.RR)

+ func (e *Elem) Name() string

+ func (e *Elem) Types(qtype uint16, qname ...string) []dns.RR

+ type Node struct

+ Color Color

+ Elem *Elem

+ Left *Node

+ Right *Node

+ type Tree struct

+ Count int

+ Root *Node

+ func (t *Tree) All() []*Elem

+ func (t *Tree) Delete(rr dns.RR)

+ func (t *Tree) DeleteMax()

+ func (t *Tree) DeleteMin()

+ func (t *Tree) Do(fn func(e *Elem) bool) bool

+ func (t *Tree) Insert(rr dns.RR)

+ func (t *Tree) Len() int

+ func (t *Tree) Max() *Elem

+ func (t *Tree) Min() *Elem

+ func (t *Tree) Next(qname string) (*Elem, bool)

+ func (t *Tree) Prev(qname string) (*Elem, bool)

+ func (t *Tree) Print()

+ func (t *Tree) Search(qname string) (*Elem, bool)