<s>
A	O
monoque	B-Data_Structure
is	O
a	O
linear	O
data	O
structure	O
which	O
provides	O
dynamic	B-Data_Structure
array	I-Data_Structure
semantics	O
.	O
</s>
<s>
A	O
monoque	B-Data_Structure
is	O
similar	O
in	O
structure	O
to	O
a	O
deque	B-Application
but	O
is	O
limited	O
to	O
operations	O
on	O
one	O
end	O
.	O
</s>
<s>
A	O
monoque	B-Data_Structure
offers	O
O(1 )	O
random	O
access	O
and	O
O(1 )	O
push_back/pop_back	O
.	O
</s>
<s>
Unlike	O
C++'s	O
deque	B-Application
,	O
the	O
O(1 )	O
performance	O
guarantee	O
includes	O
the	O
time	O
complexity	O
of	O
working	O
with	O
the	O
block	O
list	O
,	O
whereas	O
the	O
C++	O
standard	O
only	O
guarantees	O
the	O
deque	B-Application
to	O
be	O
O(1 )	O
in	O
terms	O
of	O
operations	O
on	O
the	O
underlying	O
value	O
type	O
.	O
</s>
<s>
The	O
monoque	B-Data_Structure
consists	O
of	O
a	O
size	O
variable	O
and	O
a	O
fixed	O
size	O
block	O
list	O
of	O
blocks	O
with	O
exponentially	O
increasing	O
sizes	O
.	O
</s>
<s>
Thus	O
,	O
the	O
size	O
of	O
the	O
monoque	B-Data_Structure
in	O
bits	O
is	O
roughly	O
proportional	O
to	O
the	O
square	O
of	O
the	O
system	O
pointer	O
size	O
.	O
</s>
