summaryrefslogtreecommitdiff
path: root/gnu/lib/libg++/include/gen/Map.hP
diff options
context:
space:
mode:
authorphil <phil@NetBSD.org>1996-03-09 00:00:51 +0000
committerphil <phil@NetBSD.org>1996-03-09 00:00:51 +0000
commit357744cd54478d5d74cb52cd1459eb7c26192abd (patch)
tree32a89fdf6e6be53376907dd269e63ad8a9584a79 /gnu/lib/libg++/include/gen/Map.hP
parent2c11ad408cd834f9e23a25702550639628396204 (diff)
Import of libg++-2.7.1.
Diffstat (limited to 'gnu/lib/libg++/include/gen/Map.hP')
-rw-r--r--gnu/lib/libg++/include/gen/Map.hP87
1 files changed, 87 insertions, 0 deletions
diff --git a/gnu/lib/libg++/include/gen/Map.hP b/gnu/lib/libg++/include/gen/Map.hP
new file mode 100644
index 00000000000..13a3fb14518
--- /dev/null
+++ b/gnu/lib/libg++/include/gen/Map.hP
@@ -0,0 +1,87 @@
+// 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><C>Map_h
+#ifdef __GNUG__
+#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);
+ inline virtual ~<T><C>Map();
+
+ int length() const; // current number of items
+ int empty() const;
+
+ 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
+};
+
+
+inline <T><C>Map::~<T><C>Map() {}
+
+inline int <T><C>Map::length() const
+{
+ return count;
+}
+
+inline int <T><C>Map::empty() const
+{
+ 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