merger

type Btree ¶

type Btree struct {
	// contains filtered or unexported fields
}

Btree attempts so sort and extend to reduce the memory consumption without requiring the full list to be in memory while processing. Processing is O(n*log(n)), Memory is O(n)

func NewBtree() *Btree

func (m *Btree) MergeInterval(i *model.Interval)

func (m *Btree) Result() []*model.Interval

type Item ¶

type Item struct {
	*model.Interval
}

func (i Item) Less(bi btree.Item) bool

type Noop ¶

type Noop struct {
	// contains filtered or unexported fields
}

func (m *Noop) MergeInterval(i *model.Interval)

func (m *Noop) Result() []*model.Interval

type Simple ¶

type Simple struct {
	// contains filtered or unexported fields
}

Simple ignores memory and cpu constraints. Alg should be O(n*log(n)) due the use of search search. Memory can be max O(2n) since the new list is created next to the existing list.

func NewSimple() *Simple

func (m *Simple) MergeInterval(i *model.Interval)

func (m *Simple) Result() []*model.Interval