home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
NeXTSTEP 3.2 (Developer)
/
NS_dev_3.2.iso
/
NextDeveloper
/
Headers
/
g++
/
gen
/
Map.hP
< prev
next >
Wrap
Text File
|
1993-06-29
|
2KB
|
88 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, 675 Mass Ave, Cambridge, MA 02139, 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);
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
};
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