@@ -42,7 +42,7 @@ func (t *ipTree) trimLeft(top *ipTree) *ipTree {
4242 return nil
4343 }
4444
45- if containsNet (top .net , t .net ) {
45+ if ContainsNet (top .net , t .net ) {
4646 return t .left .trimLeft (top )
4747 }
4848 t .setRight (t .right .trimLeft (top ))
@@ -55,7 +55,7 @@ func (t *ipTree) trimRight(top *ipTree) *ipTree {
5555 return nil
5656 }
5757
58- if containsNet (top .net , t .net ) {
58+ if ContainsNet (top .net , t .net ) {
5959 return t .right .trimRight (top )
6060 }
6161 t .setLeft (t .left .trimRight (top ))
@@ -71,11 +71,11 @@ func (t *ipTree) insert(newNode *ipTree) *ipTree {
7171 return newNode
7272 }
7373
74- if containsNet (t .net , newNode .net ) {
74+ if ContainsNet (t .net , newNode .net ) {
7575 return t
7676 }
7777
78- if containsNet (newNode .net , t .net ) {
78+ if ContainsNet (newNode .net , t .net ) {
7979 // Replace the current top node and trim the tree
8080 newNode .setLeft (t .left .trimLeft (newNode ))
8181 newNode .setRight (t .right .trimRight (newNode ))
@@ -98,10 +98,10 @@ func (t *ipTree) contains(newNode *ipTree) bool {
9898 return false
9999 }
100100
101- if containsNet (t .net , newNode .net ) {
101+ if ContainsNet (t .net , newNode .net ) {
102102 return true
103103 }
104- if containsNet (newNode .net , t .net ) {
104+ if ContainsNet (newNode .net , t .net ) {
105105 return false
106106 }
107107 if bytes .Compare (newNode .net .IP , t .net .IP ) < 0 {
@@ -161,10 +161,10 @@ func (t *ipTree) removeNet(net *net.IPNet) (top *ipTree) {
161161 }
162162
163163 top = t
164- if containsNet (net , t .net ) {
164+ if ContainsNet (net , t .net ) {
165165 // Remove the current node
166166 top = t .remove ()
167- } else if containsNet (t .net , net ) {
167+ } else if ContainsNet (t .net , net ) {
168168 diff = netDifference (t .net , net )
169169 t .net = diff [0 ]
170170 for _ , n := range diff [1 :] {
0 commit comments