func (m *Manager) Dump() map[string]sets.String {
	m.Lock()
	defer m.Unlock()
	if len(m.queues) == 0 {
		return nil
	}
	dump := make(map[string]sets.String, len(m.queues))
	for key, cq := range m.clusterQueues {
		if len(cq.heap.items) == 0 {
			continue
		}
		elements := make(sets.String, len(cq.heap.items))
		for _, e := range cq.heap.items {
			elements.Insert(e.obj.Obj.Name)
		}
		dump[key] = elements
	}
	if len(dump) == 0 {
		return nil
	}
	return dump
}
// Dump is a dump of the queues and it's elements (unordered).
// Only use for testing purposes.
Dump is a dump of the queues and it's elements (unordered).
Only use for testing purposes.
// Dump is a dump of the queues and it ' s elements ( unordered ) . // Only use for testing purposes .
func (m *Manager) Dump() map[string]sets.String {
	m.Lock()
	defer m.Unlock()
	if len(m.queues) == 0 {
		return nil
	}
	dump := make(map[string]sets.String, len(m.queues))
	for key, cq := range m.clusterQueues {
		if len(cq.heap.items) == 0 {
			continue
		}
		elements := make(sets.String, len(cq.heap.items))
		for _, e := range cq.heap.items {
			elements.Insert(e.obj.Obj.Name)
		}
		dump[key] = elements
	}
	if len(dump) == 0 {
		return nil
	}
	return dump
}
func ( m * Manager ) Dump ( ) map [ string ] sets . String { m . Lock ( ) defer m . Unlock ( ) if len ( m . queues ) == 0 { return nil } dump := make ( map [ string ] sets . String , len ( m . queues ) ) for key , cq := range m . clusterQueues { if len ( cq . heap . items ) == 0 { continue } elements := make ( sets . String , len ( cq . heap . items ) ) for _ , e := range cq . heap . items { elements . Insert ( e . obj . Obj . Name ) } dump [ key ] = elements } if len ( dump ) == 0 { return nil } return dump }
Dump is a dump of the queues and it's elements (unordered).
Dump is a dump of the queues and it ' s elements ( unordered ) .