func (m *SortedDictionary[KT, VT]) Values() []VT {
	m.lock.RLock()
	defer m.lock.RUnlock()
	if len(m.items) < 1 {
		return []VT{}
	}
	m2 := make([]VT, len(m.items))
	for k, v := range m.items {
		m2[k] = v.val
	}
	return m2
}
// Values returns a slice copy of the values.
Values returns a slice copy of the values.
// Values returns a slice copy of the values .
func (m *SortedDictionary[KT, VT]) Values() []VT {
	m.lock.RLock()
	defer m.lock.RUnlock()
	if len(m.items) < 1 {
		return []VT{}
	}
	m2 := make([]VT, len(m.items))
	for k, v := range m.items {
		m2[k] = v.val
	}
	return m2
}
func ( m * SortedDictionary [ KT , VT ] ) Values ( ) [ ] VT { m . lock . RLock ( ) defer m . lock . RUnlock ( ) if len ( m . items ) < 1 { return [ ] VT { } } m2 := make ( [ ] VT , len ( m . items ) ) for k , v := range m . items { m2 [ k ] = v . val } return m2 }
Values returns a slice copy of the values.
Values returns a slice copy of the values .