func (q *UniqueQueue) Get() (TimedValue, bool) {
	q.lock.Lock()
	defer q.lock.Unlock()
	if len(q.queue) == 0 {
		return TimedValue{}, false
	}
	result := heap.Pop(&q.queue).(*TimedValue)
	q.set.Delete(result.Value)
	return *result, true
}
// Get returns the oldest added value that wasn't returned yet.
Get returns the oldest added value that wasn't returned yet.
// Get returns the oldest added value that wasn ' t returned yet .
func (q *UniqueQueue) Get() (TimedValue, bool) {
	q.lock.Lock()
	defer q.lock.Unlock()
	if len(q.queue) == 0 {
		return TimedValue{}, false
	}
	result := heap.Pop(&q.queue).(*TimedValue)
	q.set.Delete(result.Value)
	return *result, true
}
func ( q * UniqueQueue ) Get ( ) ( TimedValue , bool ) { q . lock . Lock ( ) defer q . lock . Unlock ( ) if len ( q . queue ) == 0 { return TimedValue { } , false } result := heap . Pop ( & q . queue ) . ( * TimedValue ) q . set . Delete ( result . Value ) return * result , true }
Get returns the oldest added value that wasn't returned yet.
Get returns the oldest added value that wasn ' t returned yet .