1 /*
   2  * Copyright (c) 2000, 2003, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any
  23  * questions.
  24  */
  25 package com.sun.corba.se.impl.encoding;
  26 
  27 import java.util.LinkedList;
  28 import java.util.NoSuchElementException;
  29 import java.util.LinkedList;
  30 
  31 /**
  32  * Simple unsynchronized queue implementation for ByteBufferWithInfos.
  33  */
  34 // XREVISIT - Should be in orbutil or package private
  35 public class BufferQueue
  36 {
  37     private LinkedList list = new LinkedList();
  38 
  39     public void enqueue(ByteBufferWithInfo item)
  40     {
  41         list.addLast(item);
  42     }
  43 
  44     public ByteBufferWithInfo dequeue() throws NoSuchElementException
  45     {
  46         return (ByteBufferWithInfo)list.removeFirst();
  47     }
  48 
  49     public int size()
  50     {
  51         return list.size();
  52     }
  53 
  54     // Adds the given ByteBufferWithInfo to the front
  55     // of the queue.
  56     public void push(ByteBufferWithInfo item)
  57     {
  58         list.addFirst(item);
  59     }
  60 }