diff options
Diffstat (limited to 'gnu/lib/libg++/g++-include/Set.hP')
-rw-r--r-- | gnu/lib/libg++/g++-include/Set.hP | 78 |
1 files changed, 78 insertions, 0 deletions
diff --git a/gnu/lib/libg++/g++-include/Set.hP b/gnu/lib/libg++/g++-include/Set.hP new file mode 100644 index 000000000000..6c2192262711 --- /dev/null +++ b/gnu/lib/libg++/g++-include/Set.hP @@ -0,0 +1,78 @@ +// 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. +*/ + + +#ifndef _<T>Set_h +#ifdef __GNUG__ +#pragma interface +#endif +#define _<T>Set_h 1 + +#include <Pix.h> +#include "<T>.defs.h" + +class <T>Set +{ +protected: + + int count; + +public: + virtual ~<T>Set(); + + 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 item + virtual int contains(<T&> item); // is item in set? + + virtual void clear(); // delete all items + + 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 int owns(Pix i); // is i a valid Pix ? + virtual Pix seek(<T&> item); // Pix of item + + void operator |= (<T>Set& b); // add all items in b + void operator -= (<T>Set& b); // delete items also in b + void operator &= (<T>Set& b); // delete items not in b + + int operator == (<T>Set& b); + int operator != (<T>Set& b); + int operator <= (<T>Set& b); + + void error(const char* msg); + virtual int OK() = 0; // rep invariant +}; + +inline <T>Set::~<T>Set() {} + +inline int <T>Set::length() +{ + return count; +} + +inline int <T>Set::empty() +{ + return count == 0; +} + +#endif |