diff options
| author | phil <phil@NetBSD.org> | 1996-03-09 00:25:38 +0000 |
|---|---|---|
| committer | phil <phil@NetBSD.org> | 1996-03-09 00:25:38 +0000 |
| commit | 03548c36c3f96968009a233cd45832cae5d87b10 (patch) | |
| tree | 5f1f5a371875653a19e51e0ee3eb29db4a8481e4 /gnu/lib/libg++/g++-include/gen/Map.hP | |
| parent | 30eeb2255537476e771a88a6c4bf6b20b53e5577 (diff) | |
Deleting old libg++.
Diffstat (limited to 'gnu/lib/libg++/g++-include/gen/Map.hP')
| -rw-r--r-- | gnu/lib/libg++/g++-include/gen/Map.hP | 96 |
1 files changed, 0 insertions, 96 deletions
diff --git a/gnu/lib/libg++/g++-include/gen/Map.hP b/gnu/lib/libg++/g++-include/gen/Map.hP deleted file mode 100644 index 301a4ab8094..00000000000 --- a/gnu/lib/libg++/g++-include/gen/Map.hP +++ /dev/null @@ -1,96 +0,0 @@ -// 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 GNU CC. - -GNU CC is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY. No author or distributor -accepts responsibility to anyone for the consequences of using it -or for whether it serves any particular purpose or works at all, -unless he says so in writing. Refer to the GNU CC General Public -License for full details. - -Everyone is granted permission to copy, modify and redistribute -GNU CC, but only under the conditions described in the -GNU CC General Public License. A copy of this license is -supposed to have been given to you along with GNU CC so you -can know your rights and responsibilities. It should be in a -file named COPYING. Among other things, the copyright notice -and this notice must be preserved on all copies. -*/ - - -#ifndef _<T><C>Map_h -#ifdef __GNUG__ -#pragma once -#pragma interface -#endif -#define _<T><C>Map_h 1 - -#include <Pix.h> -#include "<T>.defs.h" - -class <T><C>Map -{ -protected: - int count; - <C> def; - -public: - <T><C>Map(<C&> dflt); - virtual ~<T><C>Map(); - - int length(); // current number of items - int empty(); - - virtual int contains(<T&> key); // is key mapped? - - virtual void clear(); // delete all items - - virtual <C>& operator [] (<T&> key) = 0; // access contents by key - - virtual void del(<T&> key) = 0; // delete entry - - virtual Pix first() = 0; // Pix of first item or 0 - virtual void next(Pix& i) = 0; // advance to next or 0 - virtual <T>& key(Pix i) = 0; // access key at i - virtual <C>& contents(Pix i) = 0; // access contents at i - - virtual int owns(Pix i); // is i a valid Pix ? - virtual Pix seek(<T&> key); // Pix of key - - <C>& dflt(); // access default val - - void error(const char* msg); - virtual int OK() = 0; // rep invariant -}; - -#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) - -inline <T><C>Map::~<T><C>Map() {} - -inline int <T><C>Map::length() -{ - return count; -} - -inline int <T><C>Map::empty() -{ - return count == 0; -} - -inline <C>& <T><C>Map::dflt() -{ - return def; -} - -inline <T><C>Map::<T><C>Map(<C&> dflt) :def(dflt) -{ - count = 0; -} - - -#endif -#endif |
