Skip to content

SeaweedFS is a distributed storage system for object storage (S3), file systems, Iceberg table buckets, and Lance vector buckets, designed to handle billions of files with O(1) disk access and effortless horizontal scaling.

1.4 KB
Raw Blame
package util

import (
	"sync"
)

// A mostly for read map, which can thread-safely
// initialize the map entries.
type ConcurrentReadMap struct {
	sync.RWMutex

	items map[string]interface{}
}

func NewConcurrentReadMap() *ConcurrentReadMap {
	return &ConcurrentReadMap{items: make(map[string]interface{})}
}

func (m *ConcurrentReadMap) initMapEntry(key string, newEntry func() interface{}) (value interface{}) {
	m.Lock()
	defer m.Unlock()
	if value, ok := m.items[key]; ok {
		return value
	}
	value = newEntry()
	m.items[key] = value
	return value
}

func (m *ConcurrentReadMap) Get(key string, newEntry func() interface{}) interface{} {
	m.RLock()
	if value, ok := m.items[key]; ok {
		m.RUnlock()
		return value
	}
	m.RUnlock()
	return m.initMapEntry(key, newEntry)
}

func (m *ConcurrentReadMap) Find(key string) (interface{}, bool) {
	m.RLock()
	value, ok := m.items[key]
	m.RUnlock()
	return value, ok
}

func (m *ConcurrentReadMap) Items() (itemsCopy []interface{}) {
	m.RLock()
	for _, i := range m.items {
		itemsCopy = append(itemsCopy, i)
	}
	m.RUnlock()
	return itemsCopy
}

// Delete removes the key and returns what it held, so a caller that has to
// wind the entry down does not race another deleter for it.
func (m *ConcurrentReadMap) Delete(key string) (interface{}, bool) {
	m.Lock()
	value, ok := m.items[key]
	delete(m.items, key)
	m.Unlock()
	return value, ok
}