func main() { tree := llrb.New() tree.ReplaceOrInsert(llrb.Int(1)) tree.ReplaceOrInsert(llrb.Int(2)) tree.ReplaceOrInsert(llrb.Int(3)) tree.ReplaceOrInsert(llrb.Int(4)) tree.DeleteMin() tree.Delete(llrb.Int(4)) tree.AscendGreaterOrEqual(tree.Min(), Print) }
func main() { tree := llrb.New() tree.ReplaceOrInsert(llrb.Int(1)) tree.InsertNoReplace(llrb.Int(1)) tree.ReplaceOrInsert(llrb.Int(2)) tree.ReplaceOrInsert(llrb.Int(3)) tree.InsertNoReplace(llrb.Int(3)) tree.InsertNoReplace(llrb.Int(2)) tree.ReplaceOrInsert(llrb.Int(4)) tree.DeleteMin() tree.Delete(llrb.Int(4)) tree.AscendGreaterOrEqual(tree.Min(), func(item llrb.Item) bool { i, ok := item.(llrb.Int) if !ok { return false } fmt.Println(int(i)) return true }) }
func main() { flag.Parse() vals := rand.Perm(*size) var t, v interface{} v = vals var stats runtime.MemStats for i := 0; i < 10; i++ { runtime.GC() } fmt.Println("-------- BEFORE ----------") runtime.ReadMemStats(&stats) fmt.Printf("%+v\n", stats) start := time.Now() if *gollrb { tr := llrb.New() for _, v := range vals { tr.ReplaceOrInsert(llrb.Int(v)) } t = tr // keep it around } else { tr := btree.New(*degree) for _, v := range vals { tr.ReplaceOrInsert(btree.Int(v)) } t = tr // keep it around } fmt.Printf("%v inserts in %v\n", *size, time.Since(start)) fmt.Println("-------- AFTER ----------") runtime.ReadMemStats(&stats) fmt.Printf("%+v\n", stats) for i := 0; i < 10; i++ { runtime.GC() } fmt.Println("-------- AFTER GC ----------") runtime.ReadMemStats(&stats) fmt.Printf("%+v\n", stats) if t == v { fmt.Println("to make sure vals and tree aren't GC'd") } }