// 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)
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, 675 Mass Ave, Cambridge, MA 02139, USA.
Pix <T>OXPBag::seek(<T&> item, Pix i)
int cmp = <T>CMP(item, p[mid]);
while (mid > p.low() && <T>EQ(item, p[mid - 1])) --mid;
return p.index_to_Pix(mid);
int cmp = <T>CMP(item, p(i));
return (<T>EQ(item, p(i)))? i : 0;
int ind = p.Pix_to_index(i);
cmp = <T>CMP(item, p[mid]);
while (mid > ind && <T>EQ(item, p[mid - 1])) --mid;
return p.index_to_Pix(mid);
int <T>OXPBag::nof(<T&> item)
int cmp = <T>CMP(item, p[mid]);
while (l > p.low() && <T>EQ(item, p[l - 1])) --l;
while (h < p.high() && <T>EQ(item, p[h + 1])) ++h;
Pix <T>OXPBag::add(<T&> item)
return p.index_to_Pix(p.add_high(item));
int cmp = <T>CMP(item, p[mid]);
// add on whichever side is shortest
return p.index_to_Pix(p.add_high(item));
return p.index_to_Pix(p.add_low(item));
if (p.high() - l < l - p.low())
h = p.add_high(p.high_element());
for (int i = h - 1; i > l; --i) p[i] = p[i-1];
h = p.add_low(p.low_element());
for (int i = h + 1; i < l; ++i) p[i] = p[i+1];
return p.index_to_Pix(l);
void <T>OXPBag::del(<T&> item)
int cmp = <T>CMP(item, p[mid]);
if (p.high() - mid < mid - p.low())
for (int i = mid; i < p.high(); ++i) p[i] = p[i+1];
for (int i = mid; i > p.low(); --i) p[i] = p[i-1];
void <T>OXPBag::remove(<T&> item)
int cmp = <T>CMP(item, p[mid]);
while (l > p.low() && <T>EQ(item, p[l - 1])) --l;
while (h < p.high() && <T>EQ(item, p[h + 1])) ++h;
if (p.high() - h < l - p.low())
for (int i = l; i <= h; ++i) p[i] = p[i+n];
while (n-- > 0) p.del_high();
for (int i = h; i >= l; --i) p[i] = p[i-n];
while (n-- > 0) p.del_low();
v &= count == p.length();
for (int i = p.low(); i < p.high(); ++i) v &= <T>CMP(p[i], p[i+1]) <= 0;
if (!v) error("invariant failure");