File: SBinHashtable.h

package info (click to toggle)
yudit 3.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 18,472 kB
  • sloc: cpp: 76,344; perl: 5,630; makefile: 989; ansic: 823; sh: 441
file content (76 lines) | stat: -rw-r--r-- 2,562 bytes parent folder | download
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
/** 
 *  Yudit Unicode Editor Source File
 *
 *  GNU Copyright (C) 1997-2023  Gaspar Sinai <gaspar@yudit.org>  
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License, version 2,
 *  dated June 1991. See file COPYYING for details.
 *
 *  This program 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */
 
#ifndef SBinHashtable_h
#define SBinHashtable_h

/**
 * @author: Gaspar Sinai <gaspar@yudit.org>
 * @version: 2000-04-23
 */
#include "SBHashtable.h"
#include "SString.h"
#include "SExcept.h"

/**
 * This is my vector. stoolkit as that. There is no code,
 * just this.
 */
template <class Type> class SBinHashtable : public SBHashtable
{
public:
  SBinHashtable (void) : SBHashtable () { }
  virtual ~SBinHashtable () { } // SBHashtable cleanup will be automatically called.  
  SBinHashtable (const SBinHashtable<Type>& v) : SBHashtable (v) { }
  virtual SObject* clone() const 
  { SBinHashtable* n = new SBinHashtable (*this); CHECK_NEW(n); return n;}

  SBinHashtable<Type>& operator=(const SBinHashtable<Type>& v)
    { refer(v); return *this; }

  void put (const SString& key, Type e, bool replace=true)
    {
      SBHashtable::put (key, (const char*) &e, sizeof (Type), replace);
    }
  void put (unsigned int row, unsigned int sub, Type e)
    {
      SBHashtable::put (row, sub, (const char*) &e, sizeof (Type));
    }
  void remove (const SString& key)
    {
      SBHashtable::remove (key); 
    }
  // This will dlete
  void  clear () 
     { SBHashtable::clear(); }
  unsigned int size () const
    { return SBHashtable::size(); }
  unsigned int size (unsigned int subb) const
    { return SBHashtable::size(subb); }
  Type get (const SString& key) const
    { return (Type) (*(Type*)SBHashtable::get(key)); }
  Type operator[] (const SString& key)  const
    { return (Type) (*(Type*)SBHashtable::get(key)); }
  Type get (unsigned int row, unsigned int column) const
    { return (Type) (*(Type*)SBHashtable::get(row, column)); }
  const SString& key (unsigned int row, unsigned int column) const
    { return SBHashtable::key(row, column); }
};

#endif /* SBinHashtable_h _h*/