/*
Copyright 2022 The Kubernetes Authors.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

// Package cached provides a cache mechanism based on etags to lazily
// build, and/or cache results from expensive operation such that those
// operations are not repeated unnecessarily. The operations can be
// created as a tree, and replaced dynamically as needed.
//
// All the operations in this module are thread-safe.
//
// # Dependencies and types of caches
//
// This package uses a source/transform/sink model of caches to build
// the dependency tree, and can be used as follows:
//   - [Func]: A source cache that recomputes the content every time.
//   - [Once]: A source cache that always produces the
//     same content, it is only called once.
//   - [Transform]: A cache that transforms data from one format to
//     another. It's only refreshed when the source changes.
//   - [Merge]: A cache that aggregates multiple caches in a map into one.
//     It's only refreshed when the source changes.
//   - [MergeList]: A cache that aggregates multiple caches in a list into one.
//     It's only refreshed when the source changes.
//   - [Atomic]: A cache adapter that atomically replaces the source with a new one.
//   - [LastSuccess]: A cache adapter that caches the last successful and returns
//     it if the next call fails. It extends [Atomic].
//
// # Etags
//
// Etags in this library is a cache version identifier. It doesn't
// necessarily strictly match to the semantics of http `etags`, but are
// somewhat inspired from it and function with the same principles.
// Hashing the content is a good way to guarantee that your function is
// never going to be called spuriously. In Kubernetes world, this could
// be a `resourceVersion`, this can be an actual etag, a hash, a UUID
// (if the cache always changes), or even a made-up string when the
// content of the cache never changes.
package cached

import (
	"fmt"
	"sync"
	"sync/atomic"
)

// Value is wrapping a value behind a getter for lazy evaluation.
type Value[T any] interface {
	Get() (value T, etag string, err error)
}

// Result is wrapping T and error into a struct for cases where a tuple is more
// convenient or necessary in Golang.
type Result[T any] struct {
	Value T
	Etag  string
	Err   error
}

func (r Result[T]) Get() (T, string, error) {
	return r.Value, r.Etag, r.Err
}

// Func wraps a (thread-safe) function as a Value[T].
func Func[T any](fn func() (T, string, error)) Value[T] {
	return valueFunc[T](fn)
}

type valueFunc[T any] func() (T, string, error)

func (c valueFunc[T]) Get() (T, string, error) {
	return c()
}

// Static returns constant values.
func Static[T any](value T, etag string) Value[T] {
	return Result[T]{Value: value, Etag: etag}
}

// Merge merges a of cached values. The merge function only gets called if any of
// the dependency has changed.
//
// If any of the dependency returned an error before, or any of the
// dependency returned an error this time, or if the mergeFn failed
// before, then the function is run again.
//
// Note that this assumes there is no "partial" merge, the merge
// function will remerge all the dependencies together everytime. Since
// the list of dependencies is constant, there is no way to save some
// partial merge information either.
//
// Also note that Golang map iteration is not stable. If the mergeFn
// depends on the order iteration to be stable, it will need to
// implement its own sorting or iteration order.
func Merge[K comparable, T, V any](mergeFn func(results map[K]Result[T]) (V, string, error), caches map[K]Value[T]) Value[V] {
	list := make([]Value[T], 0, len(caches))

	// map from index to key
	indexes := make(map[int]K, len(caches))
	i := 0
	for k := range caches {
		list = append(list, caches[k])
		indexes[i] = k
		i++
	}

	return MergeList(func(results []Result[T]) (V, string, error) {
		if len(results) != len(indexes) {
			panic(fmt.Errorf("invalid result length %d, expected %d", len(results), len(indexes)))
		}
		m := make(map[K]Result[T], len(results))
		for i := range results {
			m[indexes[i]] = results[i]
		}
		return mergeFn(m)
	}, list)
}

// MergeList merges a list of cached values. The function only gets called if
// any of the dependency has changed.
//
// The benefit of ListMerger over the basic Merger is that caches are
// stored in an ordered list so the order of the cache will be
// preserved in the order of the results passed to the mergeFn.
//
// If any of the dependency returned an error before, or any of the
// dependency returned an error this time, or if the mergeFn failed
// before, then the function is reran.
//
// Note that this assumes there is no "partial" merge, the merge
// function will remerge all the dependencies together everytime. Since
// the list of dependencies is constant, there is no way to save some
// partial merge information either.
func MergeList[T, V any](mergeFn func(results []Result[T]) (V, string, error), delegates []Value[T]) Value[V] {
	return &listMerger[T, V]{
		mergeFn:   mergeFn,
		delegates: delegates,
	}
}

type listMerger[T, V any] struct {
	lock      sync.Mutex
	mergeFn   func([]Result[T]) (V, string, error)
	delegates []Value[T]
	cache     []Result[T]
	result    Result[V]
}

func (c *listMerger[T, V]) prepareResultsLocked() []Result[T] {
	cacheResults := make([]Result[T], len(c.delegates))
	ch := make(chan struct {
		int
		Result[T]
	}, len(c.delegates))
	for i := range c.delegates {
		go func(index int) {
			value, etag, err := c.delegates[index].Get()
			ch <- struct {
				int
				Result[T]
			}{index, Result[T]{Value: value, Etag: etag, Err: err}}
		}(i)
	}
	for i := 0; i < len(c.delegates); i++ {
		res := <-ch
		cacheResults[res.int] = res.Result
	}
	return cacheResults
}

func (c *listMerger[T, V]) needsRunningLocked(results []Result[T]) bool {
	if c.cache == nil {
		return true
	}
	if c.result.Err != nil {
		return true
	}
	if len(results) != len(c.cache) {
		panic(fmt.Errorf("invalid number of results: %v (expected %v)", len(results), len(c.cache)))
	}
	for i, oldResult := range c.cache {
		newResult := results[i]
		if newResult.Etag != oldResult.Etag || newResult.Err != nil || oldResult.Err != nil {
			return true
		}
	}
	return false
}

func (c *listMerger[T, V]) Get() (V, string, error) {
	c.lock.Lock()
	defer c.lock.Unlock()
	cacheResults := c.prepareResultsLocked()
	if c.needsRunningLocked(cacheResults) {
		c.cache = cacheResults
		c.result.Value, c.result.Etag, c.result.Err = c.mergeFn(c.cache)
	}
	return c.result.Value, c.result.Etag, c.result.Err
}

// Transform the result of another cached value. The transformFn will only be called
// if the source has updated, otherwise, the result will be returned.
//
// If the dependency returned an error before, or it returns an error
// this time, or if the transformerFn failed before, the function is
// reran.
func Transform[T, V any](transformerFn func(T, string, error) (V, string, error), source Value[T]) Value[V] {
	return MergeList(func(delegates []Result[T]) (V, string, error) {
		if len(delegates) != 1 {
			panic(fmt.Errorf("invalid cache for transformer cache: %v", delegates))
		}
		return transformerFn(delegates[0].Value, delegates[0].Etag, delegates[0].Err)
	}, []Value[T]{source})
}

// Once calls Value[T].Get() lazily and only once, even in case of an error result.
func Once[T any](d Value[T]) Value[T] {
	return &once[T]{
		data: d,
	}
}

type once[T any] struct {
	once   sync.Once
	data   Value[T]
	result Result[T]
}

func (c *once[T]) Get() (T, string, error) {
	c.once.Do(func() {
		c.result.Value, c.result.Etag, c.result.Err = c.data.Get()
	})
	return c.result.Value, c.result.Etag, c.result.Err
}

// Replaceable extends the Value[T] interface with the ability to change the
// underlying Value[T] after construction.
type Replaceable[T any] interface {
	Value[T]
	Store(Value[T])
}

// Atomic wraps a Value[T] as an atomic value that can be replaced. It implements
// Replaceable[T].
type Atomic[T any] struct {
	value atomic.Pointer[Value[T]]
}

var _ Replaceable[[]byte] = &Atomic[[]byte]{}

func (x *Atomic[T]) Store(val Value[T])      { x.value.Store(&val) }
func (x *Atomic[T]) Get() (T, string, error) { return (*x.value.Load()).Get() }

// LastSuccess calls Value[T].Get(), but hides errors by returning the last
// success if there has been any.
type LastSuccess[T any] struct {
	Atomic[T]
	success atomic.Pointer[Result[T]]
}

var _ Replaceable[[]byte] = &LastSuccess[[]byte]{}

func (c *LastSuccess[T]) Get() (T, string, error) {
	success := c.success.Load()
	value, etag, err := c.Atomic.Get()
	if err == nil {
		if success == nil {
			c.success.CompareAndSwap(nil, &Result[T]{Value: value, Etag: etag, Err: err})
		}
		return value, etag, err
	}

	if success != nil {
		return success.Value, success.Etag, success.Err
	}

	return value, etag, err
}