Merge pull request #68 from myyrakle/fix/#67

[#67] fix HashSet bugs

README.md

@@ -1,6 +1,6 @@
 # gost
 
-![](https://img.shields.io/badge/language-Go-00ADD8) ![](https://img.shields.io/badge/version-v0.7.0-brightgreen) [![GitHub license](https://img.shields.io/badge/license-MIT-blue.svg)](./LICENSE)
+![](https://img.shields.io/badge/language-Go-00ADD8) ![](https://img.shields.io/badge/version-v0.7.1-brightgreen) [![GitHub license](https://img.shields.io/badge/license-MIT-blue.svg)](./LICENSE)
 
 ![](./etc/gorris.jpg)
 
@@ -11,7 +11,7 @@ Experience the true taste of Rust in Go
 ## Install
 
 ```
-go get github.com/myyrakle/[email protected].0
+go get github.com/myyrakle/[email protected].1
 ```
 
 ## Example

btree_map.go

@@ -1,6 +1,8 @@
 package gost
 
-import "strings"
+import (
+	"strings"
+)
 
 const _B = 6
 const _BTREE_CAPACITY = _B*2 - 1
@@ -283,7 +285,13 @@ func (self BTreeNode[K, V]) _Search(key K) (Option[*BTreeNode[K, V]], uint) {
 	}
 
 	// Go to the appropriate child
-	return self.childs.GetUnchecked(i)._Search(key)
+	child := self.childs.GetUnchecked(i)
+
+	if child != nil {
+		return child._Search(key)
+	} else {
+		return None[*BTreeNode[K, V]](), 0
+	}
 }
 
 // The main function that inserts a new key in this B-Tree

btree_set.go

@@ -3,7 +3,7 @@ package gost
 import "strings"
 
 type BTreeSet[K Ord[K]] struct {
-	_treemap *BTreeMap[K, struct{}]
+	_treemap BTreeMap[K, struct{}]
 }
 
 // Creates an empty BTreeSet.