// Code generated by github.com/gobuffalo/mapgen. DO NOT EDIT.

package pkger

import (
	"sort"
	"sync"
)

// filesMap wraps sync.Map and uses the following types:
// key:   Path
// value: *File
type filesMap struct {
	data *sync.Map
	init sync.Once
}

func (m *filesMap) Data() *sync.Map {
	m.init.Do(func() {
		if m.data == nil {
			m.data = &sync.Map{}
		}
	})
	return m.data
}

// Delete the key from the map
func (m *filesMap) Delete(key Path) {
	m.Data().Delete(key)
}

// Load the key from the map.
// Returns *File or bool.
// A false return indicates either the key was not found
// or the value is not of type *File
func (m *filesMap) Load(key Path) (*File, bool) {
	i, ok := m.Data().Load(key)
	if !ok {
		return nil, false
	}
	s, ok := i.(*File)
	return s, ok
}

// LoadOrStore will return an existing key or
// store the value if not already in the map
func (m *filesMap) LoadOrStore(key Path, value *File) (*File, bool) {
	i, _ := m.Data().LoadOrStore(key, value)
	s, ok := i.(*File)
	return s, ok
}

// LoadOr will return an existing key or
// run the function and store the results
func (m *filesMap) LoadOr(key Path, fn func(*filesMap) (*File, bool)) (*File, bool) {
	i, ok := m.Load(key)
	if ok {
		return i, ok
	}
	i, ok = fn(m)
	if ok {
		m.Store(key, i)
		return i, ok
	}
	return i, false
}

// Range over the *File values in the map
func (m *filesMap) Range(f func(key Path, value *File) bool) {
	m.Data().Range(func(k, v interface{}) bool {
		key, ok := k.(Path)
		if !ok {
			return false
		}
		value, ok := v.(*File)
		if !ok {
			return false
		}
		return f(key, value)
	})
}

// Store a *File in the map
func (m *filesMap) Store(key Path, value *File) {
	m.Data().Store(key, value)
}

// Keys returns a list of keys in the map
func (m *filesMap) Keys() []Path {
	var keys []Path
	m.Range(func(key Path, value *File) bool {
		keys = append(keys, key)
		return true
	})
	sort.Slice(keys, func(a, b int) bool {
		return keys[a].String() <= keys[b].String()
	})
	return keys
}