gost v0.7.2

https://github.com/myyrakle/gost/releases/tag/v0.7.2
https://pkg.go.dev/github.com/myyrakle/gost
이번에는 좀 많은 기능이 추가되었다.

BTreeMap[K,V]

자료구조 BTreeMap이 추가되었다.
B-Tree 기반으로 작성된 맵이고, 차수는 Rust를 계승해서 12다. 어련히 맞춰서 정한거겠지...

package main

import (
	"fmt"

	gost "github.com/myyrakle/gost"
)

func main() {
	tree := gost.BTreeMap[gost.String, gost.I32]{}
	tree.Insert(gost.String("asdf"), gost.I32(3))
	tree.Insert(gost.String("qwer"), gost.I32(4))
	tree.Insert(gost.String("zxcv"), gost.I32(5))
	tree.Insert(gost.String("uiop"), gost.I32(6))
	tree.Insert(gost.String("hjkl"), gost.I32(7))
	tree.Insert(gost.String("bnm,"), gost.I32(8))
	tree.Insert(gost.String("yuiop"), gost.I32(9))
	tree.Insert(gost.String("asdfg"), gost.I32(10))
	tree.Insert(gost.String("qwert"), gost.I32(11))
	tree.Insert(gost.String("zxcvb"), gost.I32(12))
	tree.Insert(gost.String("uiop["), gost.I32(13))
	tree.Insert(gost.String("hjkl;"), gost.I32(14))
	tree.Insert(gost.String("bnm,."), gost.I32(15))
	tree.Insert(gost.String("yuiop["), gost.I32(16))
	tree.Insert(gost.String("asdfgh"), gost.I32(17))
	tree.Insert(gost.String("asdfgh"), gost.I32(99999))

	fmt.Println(tree.ContainsKey(gost.String("asdf")))
	fmt.Println(tree.ContainsKey(gost.String("not_found")))

	tree.Remove(gost.String("asdf"))
	fmt.Println(tree.ContainsKey(gost.String("asdf")))

	gost.Println("{}", tree)
}

BTreeSet[K]

BTree 기반의 집합 타입이다.
집합 연산은 아직 없고, 구현 예정이다.

package main

import (
	"fmt"

	gost "github.com/myyrakle/gost"
)

func main() {
	set := gost.BTreeSet[gost.I32]{}
	set.Insert(gost.I32(3))
	set.Insert(gost.I32(4))
	set.Insert(gost.I32(5))
	set.Insert(gost.I32(6))
	set.Insert(gost.I32(7))

	set.Insert(gost.I32(8))
	set.Insert(gost.I32(9))
	set.Insert(gost.I32(10))
	set.Insert(gost.I32(11))
	set.Insert(gost.I32(12))

	set.Insert(gost.I32(13))
	set.Insert(gost.I32(14))
	set.Insert(gost.I32(15))

	fmt.Println(set.Contains(gost.I32(33)))
	fmt.Println(set.Contains(gost.I32(3)))

	gost.Println("{}", set)
}

HashSet[K]

해시셋이다.

package main

import (
	"fmt"

	gost "github.com/myyrakle/gost"
)

func main() {
	set := gost.HashSetNew[gost.I32\]()
	set.Insert(gost.I32(3))
	set.Insert(gost.I32(4))
	set.Insert(gost.I32(5))
	set.Insert(gost.I32(6))
	set.Insert(gost.I32(7))

	set.Insert(gost.I32(8))
	set.Insert(gost.I32(9))
	set.Insert(gost.I32(10))
	set.Insert(gost.I32(11))
	set.Insert(gost.I32(12))

	set.Insert(gost.I32(13))
	set.Insert(gost.I32(14))
	set.Insert(gost.I32(15))

	fmt.Println(set.Contains(gost.I32(33)))
	fmt.Println(set.Contains(gost.I32(3)))

	gost.Println("{}", set)
}

이제 컬렉션은 VecDeque와 Heap만 추가하면 될 것 같다.