summaryrefslogtreecommitdiff
path: root/gnu/lib/libg++/include/gen/VHMap.hP
blob: ccc9328bcbae8077388a63e5daf90cb0f1f49857 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// 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>VHMap_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T><C>VHMap_h 1

#include "<T>.<C>.Map.h"


class <T><C>VHMap : public <T><C>Map
{
protected:
  <T>*           tab;
  <C>*           cont;
  char*          status;
  unsigned int   size;

public:
                <T><C>VHMap(<C&> dflt,unsigned int sz=DEFAULT_INITIAL_CAPACITY);
                <T><C>VHMap(<T><C>VHMap& a);
  inline               ~<T><C>VHMap();

  <C>&          operator [] (<T&> key);

  void          del(<T&> key);

  Pix           first();
  void          next(Pix& i);
  inline <T>&          key(Pix i);
  inline <C>&          contents(Pix i);

  Pix           seek(<T&> key);
  inline int           contains(<T&> key);

  void          clear(); 
  void          resize(unsigned int newsize = 0);

  int           OK();
};

inline <T><C>VHMap::~<T><C>VHMap()
{
  delete [] tab;
  delete [] cont;
  delete [] status;
}

inline int <T><C>VHMap::contains(<T&> key)
{
  return seek(key) != 0;
}

inline <T>& <T><C>VHMap::key(Pix i)
{
  if (i == 0) error("null Pix");
  return *((<T>*)i);
}

inline <C>& <T><C>VHMap::contents(Pix i)
{
  if (i == 0) error("null Pix");
  return cont[((unsigned)(i) - (unsigned)(tab)) / sizeof(<T>)];
}

#endif