1
0
mirror of https://github.com/osmarks/mycorrhiza.git synced 2024-10-30 03:36:16 +00:00
mycorrhiza/categories/files.go
Timur Ismagilov 6cf59f5e2d Categories: Keep them sorted
* The input from the disk is sorted in-memory, because an admin might want to fiddle with categories.json directly and break the sorted order.
* Insertion/deletion preserve order, thanks to a new dependency.
* The dependency is an official golang package, so I think it's safe to have it.
2022-04-17 16:07:33 +03:00

146 lines
3.2 KiB
Go

package categories
import (
"encoding/json"
"github.com/bouncepaw/mycorrhiza/files"
"github.com/bouncepaw/mycorrhiza/util"
"golang.org/x/exp/slices"
"log"
"os"
"sort"
"sync"
)
var categoryToHyphae = map[string]*categoryNode{}
var hyphaToCategories = map[string]*hyphaNode{}
// Init initializes the category system. Call it after the Structure is initialized. This function might terminate the program in case of a bad mood or filesystem faults.
func Init() {
var (
record, err = readCategoriesFromDisk()
)
if err != nil {
log.Fatalln(err)
}
for _, cat := range record.Categories {
if len(cat.Hyphae) == 0 {
continue
}
cat.Name = util.CanonicalName(cat.Name)
for i, hyphaName := range cat.Hyphae {
cat.Hyphae[i] = util.CanonicalName(hyphaName)
}
sort.Strings(cat.Hyphae)
categoryToHyphae[cat.Name] = &categoryNode{hyphaList: cat.Hyphae}
}
for cat, hyphaeInCat := range categoryToHyphae {
for _, hyphaName := range hyphaeInCat.hyphaList {
if node, ok := hyphaToCategories[hyphaName]; ok {
node.storeCategory(cat)
} else {
hyphaToCategories[hyphaName] = &hyphaNode{categoryList: []string{cat}}
}
}
}
log.Println("Found", len(categoryToHyphae), "categories")
}
type categoryNode struct {
hyphaList []string
}
func (cn *categoryNode) storeHypha(hypname string) {
i, found := slices.BinarySearch(cn.hyphaList, hypname)
if found {
return
}
cn.hyphaList = slices.Insert(cn.hyphaList, i, hypname)
}
func (cn *categoryNode) removeHypha(hypname string) {
i, found := slices.BinarySearch(cn.hyphaList, hypname)
if !found {
return
}
cn.hyphaList = slices.Delete(cn.hyphaList, i, i+1)
}
type hyphaNode struct {
categoryList []string
}
// inserts sorted
func (hn *hyphaNode) storeCategory(cat string) {
i, found := slices.BinarySearch(hn.categoryList, cat)
if found {
return
}
hn.categoryList = slices.Insert(hn.categoryList, i, cat)
}
func (hn *hyphaNode) removeCategory(cat string) {
i, found := slices.BinarySearch(hn.categoryList, cat)
if !found {
return
}
hn.categoryList = slices.Delete(hn.categoryList, i, i+1)
}
type catFileRecord struct {
Categories []catRecord `json:"categories"`
}
type catRecord struct {
Name string `json:"name"`
Hyphae []string `json:"hyphae"`
}
func readCategoriesFromDisk() (catFileRecord, error) {
var (
record catFileRecord
categoriesFile = files.CategoriesJSON()
fileContents, err = os.ReadFile(categoriesFile)
)
if os.IsNotExist(err) {
return record, nil
}
if err != nil {
return record, err
}
err = json.Unmarshal(fileContents, &record)
if err != nil {
return record, err
}
return record, nil
}
var fileMutex sync.Mutex
func saveToDisk() {
var (
record catFileRecord
)
for name, node := range categoryToHyphae {
record.Categories = append(record.Categories, catRecord{
Name: name,
Hyphae: node.hyphaList,
})
}
data, err := json.MarshalIndent(record, "", "\t")
if err != nil {
log.Fatalln(err) // Better fail now, than later
}
// TODO: make the data safer somehow?? Back it up before overwriting?
fileMutex.Lock()
err = os.WriteFile(files.CategoriesJSON(), data, 0666)
if err != nil {
log.Fatalln(err)
}
fileMutex.Unlock()
}