home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Geek Gadgets 1
/
ADE-1.bin
/
ade-dist
/
libg++-2.7.1-bin.lha
/
lib
/
g++-include
/
gen
/
Bag.hP
< prev
next >
Wrap
Text File
|
1996-10-12
|
2KB
|
80 lines
// 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, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef _<T>Bag_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>Bag_h 1
#include <Pix.h>
#include "<T>.defs.h"
class <T>Bag
{
protected:
int count;
public:
inline virtual ~<T>Bag();
int length(); // current number of items
int empty();
virtual Pix add(<T&> item) = 0; // add item; return Pix
virtual void del(<T&> item) = 0; // delete 1 occurrence of item
#undef remove
virtual void remove(<T&> item); // delete all occurrences
virtual void clear(); // delete all items
inline virtual int contains(<T&> item); // is item in Bag?
virtual int nof(<T&> item); // how many in Bag?
virtual Pix first() = 0; // Pix of first item or 0
virtual void next(Pix& i) = 0; // advance to next or 0
virtual <T>& operator () (Pix i) = 0; // access item at i
virtual Pix seek(<T&> item, Pix from=0); // Pix of next occurrence
virtual int owns(Pix i); // is i a valid Pix ?
void error(const char* msg);
virtual int OK() = 0; // rep invariant
};
inline <T>Bag::~<T>Bag() {}
inline int <T>Bag::length()
{
return count;
}
inline int <T>Bag::empty()
{
return count == 0;
}
inline int <T>Bag::contains(<T&> item)
{
return seek(item) != 0;
}
#endif