/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/** A class for constructing lists by appending elements. Modelled after
* java.lang.StringBuffer.
*
* <p><b>This is NOT part of any supported API.
* If you write code that depends on this, you do so at your own risk.
* This code and its internal interfaces are subject to change or
* deletion without notice.</b>
*/
return new ListBuffer<T>();
}
return lb;
}
/** The list of elements of this buffer.
*/
/** A pointer pointing to the last, sentinel element of `elems'.
*/
/** The number of element in this buffer.
*/
public int count;
/** Has a list been created from this buffer yet?
*/
public boolean shared;
/** Create a new initially empty list buffer.
*/
public ListBuffer() {
clear();
}
public final void clear() {
count = 0;
shared = false;
}
/** Return the number of elements in this buffer.
*/
public int length() {
return count;
}
public int size() {
return count;
}
/** Is buffer empty?
*/
public boolean isEmpty() {
return count == 0;
}
/** Is buffer not empty?
*/
public boolean nonEmpty() {
return count != 0;
}
/** Copy list and sets last.
*/
private void copy() {
while (true) {
p = tail;
}
last = p;
shared = false;
}
/** Prepend an element to buffer.
*/
count++;
return this;
}
/** Append an element to buffer.
*/
x.getClass(); // null check
count++;
return this;
}
/** Append all elements in a list to buffer.
*/
}
return this;
}
/** Append all elements in a list to buffer.
*/
}
/** Append all elements in an array to buffer.
*/
}
return this;
}
/** Convert buffer to a list of all its elements.
*/
shared = true;
return elems;
}
/** Does the list contain the specified element?
*/
}
/** Convert buffer to an array
*/
}
}
/** The first element in this buffer.
*/
public A first() {
}
/** Return first element in this buffer and remove
*/
public A next() {
count--;
}
return x;
}
/** An enumeration of all elements in this buffer.
*/
return new Iterator<A>() {
public boolean hasNext() {
}
public A next() {
throw new NoSuchElementException();
return elem;
}
public void remove() {
throw new UnsupportedOperationException();
}
};
}
public boolean add(A a) {
append(a);
return true;
}
throw new UnsupportedOperationException();
}
for (Object x: c) {
if (!contains(x))
return false;
}
return true;
}
for (A a: c)
append(a);
return true;
}
throw new UnsupportedOperationException();
}
throw new UnsupportedOperationException();
}
public boolean offer(A a) {
append(a);
return true;
}
public A poll() {
return next();
}
public A peek() {
return first();
}
}