mirror of
https://github.com/tiennm99/miti99bot.git
synced 2026-09-15 10:19:13 +00:00
tiennm99
ec77a24db7
The CF→AWS data migration (closed 2026-05-16) is long done and the tooling isn't wired into any production path. Remove the one-shot binary, its support package, and the migration runbook. In live code, replace 'JS-parity' / 'same shape as JS' / 'cross-runtime KV migration' comments with the real, stable reason for each behavior (wire-format invariant, null-vs-zero distinction, CloudWatch alarm field name, etc.). 24 files touched across lolschedule, loldle, wordle, twentyq, trading, misc, util, server, metrics, ai, keylock. - delete cmd/migrate_cf_data/ - delete internal/migration/ - delete docs/cf-to-aws-migration-runbook.md
51 lines
1.2 KiB
Go
51 lines
1.2 KiB
Go
package wordle
|
|
|
|
import (
|
|
_ "embed"
|
|
"strings"
|
|
)
|
|
|
|
// rawWords holds the raw words.txt bytes embedded at compile time. One word
|
|
// per line, lowercase, exactly WordLength a-z; see loadWords for validation.
|
|
//
|
|
//go:embed data/words.txt
|
|
var rawWords string
|
|
|
|
// loadWords parses the embedded list into a slice plus a membership set. Both
|
|
// outputs share the same backing strings, so memory is roughly the dict size
|
|
// (≈90 KiB) — well under the binary-size budget.
|
|
//
|
|
// Words are validated to be exactly WordLength a-z; any malformed line panics
|
|
// at startup so a bad regen of the data file is caught immediately, not on
|
|
// the first /wordle.
|
|
func loadWords() ([]string, map[string]struct{}) {
|
|
lines := strings.Split(strings.TrimSpace(rawWords), "\n")
|
|
words := make([]string, 0, len(lines))
|
|
set := make(map[string]struct{}, len(lines))
|
|
for _, w := range lines {
|
|
w = strings.TrimSpace(w)
|
|
if w == "" {
|
|
continue
|
|
}
|
|
if !validWord(w) {
|
|
panic("wordle: invalid word in embedded list: " + w)
|
|
}
|
|
words = append(words, w)
|
|
set[w] = struct{}{}
|
|
}
|
|
return words, set
|
|
}
|
|
|
|
func validWord(w string) bool {
|
|
if len(w) != WordLength {
|
|
return false
|
|
}
|
|
for i := 0; i < len(w); i++ {
|
|
c := w[i]
|
|
if c < 'a' || c > 'z' {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|