xpset.hp

早期freebsd实现

// This may look like C code, but it is really -*- C++ -*-
/* 
Copyright (C) 1988 Free Software Foundation
    written by Doug Lea ([e-mail])

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.
*/


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

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

class <T>XPSet : public <T>Set
{
protected:
  <T>XPlex              p;

public:
                <T>XPSet(int chunksize = DEFAULT_INITIAL_CAPACITY);
                <T>XPSet(const <T>XPSet&);

  Pix           add(<T&> item);
  void          del(<T&> item);
  int           contains(<T&> item);

  void          clear();

  Pix           first();
  void          next(Pix& i);
  <T>&          operator () (Pix i);
  int           owns(Pix i);
  Pix           seek(<T&> item);

  int           OK();
};


inline <T>XPSet::<T>XPSet(int chunksize) 
     : p(chunksize) { count = 0; }

inline <T>XPSet::<T>XPSet(const <T>XPSet& s) : p(s.p) { count = s.count; }

inline Pix <T>XPSet::first()
{
  return p.first();
}

inline void <T>XPSet::next(Pix  & idx)
{
  p.next(idx);
}

inline <T>& <T>XPSet::operator ()(Pix   idx)
{
  return p(idx);
}

inline void <T>XPSet::clear()
{
  count = 0;  p.clear();
}

inline int <T>XPSet::contains (<T&> item)
{
  return seek(item) != 0;
}

inline int <T>XPSet::owns (Pix   idx)
{
  return p.owns(idx);
}

#endif