How to use ContainsNodeID method of internal Package

...874				})875			})876		})877	})878	Describe("ContainsNodeID", func() {879		Context("when there is a node with the matching ID", func() {880			It("returns true", func() {881				nodes := Nodes{N(), N(), N()}882				Ω(nodes.ContainsNodeID(nodes[1].ID)).Should(BeTrue())883			})884		})885		Context("when there is no node with matching ID", func() {886			It("returns false", func() {887				nodes := Nodes{N(), N(), N()}888				Ω(nodes.ContainsNodeID(nodes[2].ID + 1)).Should(BeFalse())889			})890		})891	})892	Describe("HasNodeMarkedPending", func() {893		Context("when there is a node marked pending", func() {894			It("returns true", func() {895				nodes := Nodes{N(), N(), N(Pending), N()}896				Ω(nodes.HasNodeMarkedPending()).Should(BeTrue())897			})898		})899		Context("when there is no node marked pending", func() {900			It("returns false", func() {901				nodes := Nodes{N(), N(), N()}902				Ω(nodes.HasNodeMarkedPending()).Should(BeFalse())...

...533		}534	}535	return ""536}537func (n Nodes) ContainsNodeID(id uint) bool {538	for i := range n {539		if n[i].ID == id {540			return true541		}542	}543	return false544}545func (n Nodes) HasNodeMarkedPending() bool {546	for i := range n {547		if n[i].MarkedPending {548			return true549		}550	}551	return false...

1import (2func main() {3    fmt.Println(roachpb.ContainsNodeID(roachpb.NodeID(1), roachpb.NodeIDList{1, 2, 3}))4}5func ContainsNodeID(id NodeID, l NodeIDList) bool {6    for _, n := range l {7        if n == id {8        }9    }10}11func ContainsNodeID(id NodeID, l NodeIDList) bool {12    for _, n := range l {13        if n == id {14        }15    }16}

1func main() {2    nodeID := NodeID{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}3    nodeIDs = append(nodeIDs, nodeID)4    fmt.Println(nodeIDs.ContainsNodeID(nodeID))5}6func main() {7    nodeID := NodeID{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}8    nodeIDs = append(nodeIDs, nodeID)9    fmt.Println(nodeIDs.ContainsNodeID(nodeID))10}11func main() {12    nodeID := NodeID{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}13    nodeIDs = append(nodeIDs, nodeID)14    fmt.Println(nodeIDs.ContainsNodeID(nodeID))15}16func main() {17    nodeID := NodeID{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}18    nodeIDs = append(nodeIDs, nodeID)19    fmt.Println(nodeIDs.ContainsNodeID(nodeID))20}21func main() {22    nodeID := NodeID{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}

1func main() {2    list := NewList()3    list.Add(1)4    list.Add(2)5    list.Add(3)6    list.Add(4)7    list.Add(5)8    list.Add(6)9    node := list.Add(7)10    if list.ContainsNodeID(node.ID()) {11        fmt.Println("Node is in the list")12    } else {13        fmt.Println("Node is not in the list")14    }15}

1func main() {2    list := list.New()3    node := list.PushBack(1)4    node1 := list.PushBack(2)5    node2 := list.PushBack(3)6    node3 := list.PushBack(4)7    node4 := list.PushBack(5)8    node5 := list.PushBack(6)9    node6 := list.PushBack(7)10    node7 := list.PushBack(8)11    node8 := list.PushBack(9)12    node9 := list.PushBack(10)13    node10 := list.PushBack(11)14    node11 := list.PushBack(12)15    node12 := list.PushBack(13)16    node13 := list.PushBack(14)17    node14 := list.PushBack(15)18    node15 := list.PushBack(16)19    node16 := list.PushBack(17)20    node17 := list.PushBack(18)21    node18 := list.PushBack(19)22    node19 := list.PushBack(20)23    node20 := list.PushBack(21)24    node21 := list.PushBack(22)25    node22 := list.PushBack(23)26    node23 := list.PushBack(24)27    node24 := list.PushBack(25)28    node25 := list.PushBack(26)29    node26 := list.PushBack(27)30    node27 := list.PushBack(28)

1import (2func main() {3	t = btree.New(3)4	t.ReplaceOrInsert(btree.Int(1))5	t.ReplaceOrInsert(btree.Int(2))6	t.ReplaceOrInsert(btree.Int(3))7	t.ReplaceOrInsert(btree.Int(4))8	t.ReplaceOrInsert(btree.Int(5))9	t.ReplaceOrInsert(btree.Int(6))10	t.ReplaceOrInsert(btree.Int(7))11	t.ReplaceOrInsert(btree.Int(8))12	t.ReplaceOrInsert(btree.Int(9))13	t.ReplaceOrInsert(btree.Int(10))14	t.ReplaceOrInsert(btree.Int(11))15	t.ReplaceOrInsert(btree.Int(12))16	t.ReplaceOrInsert(btree.Int(13))17	t.ReplaceOrInsert(btree.Int(14))18	t.ReplaceOrInsert(btree.Int(15))19	t.ReplaceOrInsert(btree.Int(16))20	t.ReplaceOrInsert(btree.Int(17))21	t.ReplaceOrInsert(btree.Int(18))22	t.ReplaceOrInsert(btree.Int(19))23	t.ReplaceOrInsert(btree.Int(20))24	t.ReplaceOrInsert(btree.Int(21))25	t.ReplaceOrInsert(btree.Int(22))26	t.ReplaceOrInsert(btree.Int(23))27	t.ReplaceOrInsert(btree.Int(24))28	t.ReplaceOrInsert(btree.Int(25))29	t.ReplaceOrInsert(btree.Int(26))30	t.ReplaceOrInsert(btree.Int(27))31	t.ReplaceOrInsert(btree.Int(28))32	t.ReplaceOrInsert(btree.Int(29))33	t.ReplaceOrInsert(btree.Int(30))34	t.ReplaceOrInsert(btree.Int(31))35	t.ReplaceOrInsert(btree.Int(32))36	t.ReplaceOrInsert(btree.Int(33))37	t.ReplaceOrInsert(btree.Int(34))38	t.ReplaceOrInsert(btree.Int(35))39	t.ReplaceOrInsert(btree.Int(36))40	t.ReplaceOrInsert(btree.Int(37))41	t.ReplaceOrInsert(btree.Int(38))42	t.ReplaceOrInsert(btree.Int(39))43	t.ReplaceOrInsert(btree.Int(40))44	t.ReplaceOrInsert(btree.Int(41))45	t.ReplaceOrInsert(btree.Int(42))46	t.ReplaceOrInsert(btree.Int(43))47	t.ReplaceOrInsert(btree.Int(44))

1if (g.ContainsNodeID(id)) {2	if (g.ContainsNodeID(id)) {3		if (g.ContainsNodeID(id)) {4			if (g.ContainsNodeID(id)) {5				if (g.ContainsNodeID(id)) {6					if (g.ContainsNodeID(id)) {7						if (g.ContainsNodeID(id)) {8							if (g.ContainsNodeID(id)) {9								if (g.ContainsNodeID(id)) {10									if (g.ContainsNodeID(id)) {11										if (g.ContainsNodeID(id)) {12											if (g.ContainsNodeID(id)) {