MCPcopy
hub / github.com/google/mangle / Insert

Method Insert

factstore/interval_tree.go:48–57  ·  view source on GitHub ↗

Insert adds an interval to the tree. Returns true if the interval was added, false if it was a duplicate.

(interval ast.Interval)

Source from the content-addressed store, hash-verified

46// Insert adds an interval to the tree.
47// Returns true if the interval was added, false if it was a duplicate.
48func (t *IntervalTree) Insert(interval ast.Interval) bool {
49 // Check for duplicate
50 if t.contains(interval) {
51 return false
52 }
53
54 t.root = t.insert(t.root, interval)
55 t.size++
56 return true
57}
58
59// insert recursively inserts an interval and rebalances.
60func (t *IntervalTree) insert(node *treeNode, interval ast.Interval) *treeNode {

Callers 10

TestIntervalTree_InsertFunction · 0.95
TestIntervalTree_BalanceFunction · 0.95
TestIntervalTree_AllFunction · 0.95
TestIntervalTree_ClearFunction · 0.95
TestIntervalTree_RebuildFunction · 0.95
RebuildMethod · 0.95
AddMethod · 0.80

Calls 2

containsMethod · 0.95
insertMethod · 0.95

Tested by 8

TestIntervalTree_InsertFunction · 0.76
TestIntervalTree_BalanceFunction · 0.76
TestIntervalTree_AllFunction · 0.76
TestIntervalTree_ClearFunction · 0.76
TestIntervalTree_RebuildFunction · 0.76