func (c *Cavern) Pop() interface{} {
	old := *c
	n := old[len(old)-1]
	old[len(old)-1] = nil
	*c = old[:len(old)-1]
	return n
}
// Pop the last element from queue
// Always pop LAST element. Less() will determine whether it's smallest or biggest
// DO NOT USE directly. Use heap.Pop instead
Pop the last element from queue
Always pop LAST element. Less() will determine whether it's smallest or biggest
DO NOT USE directly. Use heap.Pop instead
// Pop the last element from queue // Always pop LAST element . Less () will determine whether it ' s smallest or biggest // DO NOT USE directly . Use heap . Pop instead
func (c *Cavern) Pop() interface{} {
	old := *c
	n := old[len(old)-1]
	old[len(old)-1] = nil
	*c = old[:len(old)-1]
	return n
}
func ( c * Cavern ) Pop ( ) interface { } { old := * c n := old [ len ( old ) - 1 ] old [ len ( old ) - 1 ] = nil * c = old [ : len ( old ) - 1 ] return n }
Pop the last element from queue
Always pop LAST element.
Pop the last element from queue Always pop LAST element .