code.ivysaur.me/crowns
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

util: remove dead code

Browse Source
This commit is contained in:
mappu 2024-01-07 16:16:58 +13:00
parent 253ef9ce0a
commit 8edbe6ea98
1 changed files with 0 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
util.go
View File

@ -1,9 +1,5 @@
package main package main
import (
"sort"
)
func search(hand []Card, wildFace int, search Card) []int { func search(hand []Card, wildFace int, search Card) []int {
ret := []int{} ret := []int{}
for idx, c := range hand { for idx, c := range hand {
@ -18,36 +14,8 @@ func search(hand []Card, wildFace int, search Card) []int {
return ret return ret
} }
// take takes a single card out of a hand by its index, returning the remaining cards.
func take(hand []Card, index int) (Card, []Card) {
cc := hand[index]
rem := make([]Card, 0, len(hand)-1)
rem = append(rem, hand[0:index]...)
rem = append(rem, hand[index+1:]...)
return cc, rem
}
func forkPossibilities(in map[int]struct{}) map[int]struct{} {
ret := map[int]struct{}{}
for prev, _ := range in {
ret[prev] = struct{}{}
}
return ret
}
func forkHand(hand []Card) []Card { func forkHand(hand []Card) []Card {
ret := make([]Card, len(hand)) ret := make([]Card, len(hand))
copy(ret, hand) copy(ret, hand)
return ret return ret
} }
func flattenPossibility(in map[int]struct{}) []int {
flat := make([]int, 0, len(in))
for cidx, _ := range in {
flat = append(flat, cidx)
}
sort.Ints(flat)
return flat
}