Question

It’s quite simple with only two operations, you can either push a value, or get all values, clearing all these values from the structure. Can be easily implemented with a queue aggregate.

• push(value)
• get() -> list of values, clears contents

Answer 1

In my opinion, there is no common name for a data structure which provides this functionality. Depending on the list order provided by get() it is similar to a stack or a queue.

Assuming Java, this could work for you (not tested):

import java.util.ArrayList;
import java.util.Collection;
import java.util.Stack;

public class FlushStack<E> extends Stack<E> {

    public Collection<E> get() {
        ArrayList<E> elements = new ArrayList<E>(this);
        this.clear();
        return elements;
    }

}