| 1 |
758 |
jeremybenn |
|
| 2 |
|
|
// DO NOT EDIT THIS FILE - it is machine generated -*- c++ -*-
|
| 3 |
|
|
|
| 4 |
|
|
#ifndef __java_util_concurrent_LinkedBlockingDeque__
|
| 5 |
|
|
#define __java_util_concurrent_LinkedBlockingDeque__
|
| 6 |
|
|
|
| 7 |
|
|
#pragma interface
|
| 8 |
|
|
|
| 9 |
|
|
#include <java/util/AbstractQueue.h>
|
| 10 |
|
|
#include <gcj/array.h>
|
| 11 |
|
|
|
| 12 |
|
|
|
| 13 |
|
|
class java::util::concurrent::LinkedBlockingDeque : public ::java::util::AbstractQueue
|
| 14 |
|
|
{
|
| 15 |
|
|
|
| 16 |
|
|
public:
|
| 17 |
|
|
LinkedBlockingDeque();
|
| 18 |
|
|
LinkedBlockingDeque(jint);
|
| 19 |
|
|
LinkedBlockingDeque(::java::util::Collection *);
|
| 20 |
|
|
private:
|
| 21 |
|
|
jboolean linkFirst(::java::lang::Object *);
|
| 22 |
|
|
jboolean linkLast(::java::lang::Object *);
|
| 23 |
|
|
::java::lang::Object * unlinkFirst();
|
| 24 |
|
|
::java::lang::Object * unlinkLast();
|
| 25 |
|
|
void unlink(::java::util::concurrent::LinkedBlockingDeque$Node *);
|
| 26 |
|
|
public:
|
| 27 |
|
|
virtual void addFirst(::java::lang::Object *);
|
| 28 |
|
|
virtual void addLast(::java::lang::Object *);
|
| 29 |
|
|
virtual jboolean offerFirst(::java::lang::Object *);
|
| 30 |
|
|
virtual jboolean offerLast(::java::lang::Object *);
|
| 31 |
|
|
virtual void putFirst(::java::lang::Object *);
|
| 32 |
|
|
virtual void putLast(::java::lang::Object *);
|
| 33 |
|
|
virtual jboolean offerFirst(::java::lang::Object *, jlong, ::java::util::concurrent::TimeUnit *);
|
| 34 |
|
|
virtual jboolean offerLast(::java::lang::Object *, jlong, ::java::util::concurrent::TimeUnit *);
|
| 35 |
|
|
virtual ::java::lang::Object * removeFirst();
|
| 36 |
|
|
virtual ::java::lang::Object * removeLast();
|
| 37 |
|
|
virtual ::java::lang::Object * pollFirst();
|
| 38 |
|
|
virtual ::java::lang::Object * pollLast();
|
| 39 |
|
|
virtual ::java::lang::Object * takeFirst();
|
| 40 |
|
|
virtual ::java::lang::Object * takeLast();
|
| 41 |
|
|
virtual ::java::lang::Object * pollFirst(jlong, ::java::util::concurrent::TimeUnit *);
|
| 42 |
|
|
virtual ::java::lang::Object * pollLast(jlong, ::java::util::concurrent::TimeUnit *);
|
| 43 |
|
|
virtual ::java::lang::Object * getFirst();
|
| 44 |
|
|
virtual ::java::lang::Object * getLast();
|
| 45 |
|
|
virtual ::java::lang::Object * peekFirst();
|
| 46 |
|
|
virtual ::java::lang::Object * peekLast();
|
| 47 |
|
|
virtual jboolean removeFirstOccurrence(::java::lang::Object *);
|
| 48 |
|
|
virtual jboolean removeLastOccurrence(::java::lang::Object *);
|
| 49 |
|
|
virtual jboolean add(::java::lang::Object *);
|
| 50 |
|
|
virtual jboolean offer(::java::lang::Object *);
|
| 51 |
|
|
virtual void put(::java::lang::Object *);
|
| 52 |
|
|
virtual jboolean offer(::java::lang::Object *, jlong, ::java::util::concurrent::TimeUnit *);
|
| 53 |
|
|
virtual ::java::lang::Object * remove();
|
| 54 |
|
|
virtual ::java::lang::Object * poll();
|
| 55 |
|
|
virtual ::java::lang::Object * take();
|
| 56 |
|
|
virtual ::java::lang::Object * poll(jlong, ::java::util::concurrent::TimeUnit *);
|
| 57 |
|
|
virtual ::java::lang::Object * element();
|
| 58 |
|
|
virtual ::java::lang::Object * peek();
|
| 59 |
|
|
virtual jint remainingCapacity();
|
| 60 |
|
|
virtual jint drainTo(::java::util::Collection *);
|
| 61 |
|
|
virtual jint drainTo(::java::util::Collection *, jint);
|
| 62 |
|
|
virtual void push(::java::lang::Object *);
|
| 63 |
|
|
virtual ::java::lang::Object * pop();
|
| 64 |
|
|
virtual jboolean remove(::java::lang::Object *);
|
| 65 |
|
|
virtual jint size();
|
| 66 |
|
|
virtual jboolean contains(::java::lang::Object *);
|
| 67 |
|
|
public: // actually package-private
|
| 68 |
|
|
virtual jboolean removeNode(::java::util::concurrent::LinkedBlockingDeque$Node *);
|
| 69 |
|
|
public:
|
| 70 |
|
|
virtual JArray< ::java::lang::Object * > * toArray();
|
| 71 |
|
|
virtual JArray< ::java::lang::Object * > * toArray(JArray< ::java::lang::Object * > *);
|
| 72 |
|
|
virtual ::java::lang::String * toString();
|
| 73 |
|
|
virtual void clear();
|
| 74 |
|
|
virtual ::java::util::Iterator * iterator();
|
| 75 |
|
|
virtual ::java::util::Iterator * descendingIterator();
|
| 76 |
|
|
private:
|
| 77 |
|
|
void writeObject(::java::io::ObjectOutputStream *);
|
| 78 |
|
|
void readObject(::java::io::ObjectInputStream *);
|
| 79 |
|
|
public: // actually package-private
|
| 80 |
|
|
static ::java::util::concurrent::locks::ReentrantLock * access$0(::java::util::concurrent::LinkedBlockingDeque *);
|
| 81 |
|
|
static ::java::util::concurrent::LinkedBlockingDeque$Node * access$1(::java::util::concurrent::LinkedBlockingDeque *);
|
| 82 |
|
|
static ::java::util::concurrent::LinkedBlockingDeque$Node * access$2(::java::util::concurrent::LinkedBlockingDeque *);
|
| 83 |
|
|
private:
|
| 84 |
|
|
static const jlong serialVersionUID = -387911632671998426LL;
|
| 85 |
|
|
::java::util::concurrent::LinkedBlockingDeque$Node * __attribute__((aligned(__alignof__( ::java::util::AbstractQueue)))) first;
|
| 86 |
|
|
::java::util::concurrent::LinkedBlockingDeque$Node * last;
|
| 87 |
|
|
jint count;
|
| 88 |
|
|
jint capacity;
|
| 89 |
|
|
::java::util::concurrent::locks::ReentrantLock * lock;
|
| 90 |
|
|
::java::util::concurrent::locks::Condition * notEmpty;
|
| 91 |
|
|
::java::util::concurrent::locks::Condition * notFull;
|
| 92 |
|
|
public:
|
| 93 |
|
|
static ::java::lang::Class class$;
|
| 94 |
|
|
};
|
| 95 |
|
|
|
| 96 |
|
|
#endif // __java_util_concurrent_LinkedBlockingDeque__
|