1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
|
package huh
import (
"time"
"github.com/mitchellh/hashstructure/v2"
)
// Eval is an evaluatable value, it stores a cached value and a function to
// recompute it. It's bindings are what we check to see if we need to recompute
// the value.
//
// By default it is also cached.
type Eval[T any] struct {
val T
fn func() T
bindings any
bindingsHash uint64
cache map[uint64]T
loading bool
loadingStart time.Time
}
const spinnerShowThreshold = 25 * time.Millisecond
func hash(val any) uint64 {
hash, _ := hashstructure.Hash(val, hashstructure.FormatV2, nil)
return hash
}
func (e *Eval[T]) shouldUpdate() (bool, uint64) {
if e.fn == nil {
return false, 0
}
newHash := hash(e.bindings)
return e.bindingsHash != newHash, newHash
}
func (e *Eval[T]) loadFromCache() bool {
val, ok := e.cache[e.bindingsHash]
if ok {
e.loading = false
e.val = val
}
return ok
}
func (e *Eval[T]) update(val T) {
e.val = val
e.cache[e.bindingsHash] = val
e.loading = false
}
type updateTitleMsg struct {
id int
hash uint64
title string
}
type updateDescriptionMsg struct {
id int
hash uint64
description string
}
type updatePlaceholderMsg struct {
id int
hash uint64
placeholder string
}
type updateSuggestionsMsg struct {
id int
hash uint64
suggestions []string
}
type updateOptionsMsg[T comparable] struct {
id int
hash uint64
options []Option[T]
}
|