// Copyright 2003, Trustees of Indiana University
// Please see the license in the file ../LICENSE

// Simple FIFO queue class

import java.util.*;

public class queue<T> implements Buffer<T> {
  private LinkedList<T> data;

  public queue() {
    data = new LinkedList<T>();
  }

  public void push(T v) {
    data.addLast(v);
  }

  public T pop() {
    return data.removeFirst();
  }

  public boolean empty() {
    return data.isEmpty();
  }
}