summaryrefslogtreecommitdiff
path: root/gnu/lib/libg++/include/gen/XPDeque.hP
blob: a73d8fdada8c9f6b7a0442088d7092d002491471 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
// This may look like C code, but it is really -*- C++ -*-
/* 
Copyright (C) 1988 Free Software Foundation
    written by Doug Lea (dl@rocky.oswego.edu)
    based on code by Marc Shapiro (shapiro@sor.inria.fr)

This file is part of the GNU C++ Library.  This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.  This library 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 Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/


#ifndef _<T>XPDeque_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>XPDeque_h

#include "<T>.XPlex.h"
#include "<T>.Deque.h"

class <T>XPDeque : public <T>Deque
{
  <T>XPlex     p;

public:
               <T>XPDeque(int chunksize = DEFAULT_INITIAL_CAPACITY);
               <T>XPDeque(const <T>XPDeque& d);
  inline              ~<T>XPDeque();

  void          operator = (const <T>XPDeque&);

  inline void          push(<T&> item); // insert at front
  inline void          enq(<T&> item);  // insert at rear

  inline <T>&          front();
  inline <T>&          rear();

  inline <T>           deq();
  inline void          del_front();
  inline void          del_rear();               

  inline void          clear();
  inline int           empty();
  inline int           full();
  inline int           length();
               
  inline int           OK();
};

inline <T>XPDeque::<T>XPDeque(int chunksize) 
     : p(chunksize) {}
inline <T>XPDeque::<T>XPDeque(const <T>XPDeque& d) : p(d.p) {}

inline <T>XPDeque::~<T>XPDeque() {}

inline void <T>XPDeque::push(<T&>item)
{
  p.add_low(item);
}

inline void <T>XPDeque::enq(<T&>item)
{
  p.add_high(item);
}

inline <T> <T>XPDeque::deq()
{
  <T> res = p.low_element();
  p.del_low();
  return res;
}

inline <T>& <T>XPDeque::front()
{
  return p.low_element();
}

inline <T>& <T>XPDeque::rear()
{
  return p.high_element();
}

inline void <T>XPDeque::del_front()
{
  p.del_low();
}

inline void <T>XPDeque::del_rear()
{
  p.del_high();
}

inline void <T>XPDeque::operator =(const <T>XPDeque& s)
{
  p.operator = (s.p);
}


inline int <T>XPDeque::empty()
{
  return p.empty();
}

inline int <T>XPDeque::full()
{
  return p.full();
}

inline int <T>XPDeque::length()
{
  return p.length();
}

inline int <T>XPDeque::OK()
{
  return p.OK();
}

inline void <T>XPDeque::clear()
{
  p.clear();
}

#endif