summaryrefslogtreecommitdiff
path: root/src/maps/hashmap.tmpl
blob: b3524b96ac0d9e6bf6204ec5246b4d7a2431de5a (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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/*:*
 *: File: ./src/maps/hashmap.tmpl
 *: 
 *: yChat; Homepage: www.yChat.org; Version 0.8.3-CURRENT
 *: 
 *: Copyright (C) 2003 Paul C. Buetow, Volker Richter
 *: Copyright (C) 2004 Paul C. Buetow
 *: Copyright (C) 2005 EXA Digital Solutions GbR
 *: 
 *: This program is free software; you can redistribute it and/or
 *: modify it under the terms of the GNU General Public License
 *: as published by the Free Software Foundation; either version 2
 *: of the License, or (at your option) any later version.
 *: 
 *: 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *:*/

template<class key_type_>
bool
compare_allocator<key_type_>::operator()(key_type_ t_key_1, key_type_ t_key_2) const
{
  return t_key_1.compare(t_key_2) == 0;
}

template<class key_type_>
bool
equals_allocator<key_type_>::operator()(key_type_ t_key_1, key_type_ t_key_2) const
{
  return t_key_1 == t_key_2;
}

template<class key_type_>
int
size_hash<key_type_>::operator()(key_type_ t_key) const
{
  int i_hash = 0;
  int i_size = t_key.size();

  for( size_t i = 0; i < i_size; ++i )
    i_hash =  ( i_hash << 5 ) ^ t_key.at(i) ^ i_hash;

  return i_hash;
}

template<class key_type_>
int
self_hash<key_type_>::operator()(key_type_ t_key) const
{
  return t_key;
}


template<class obj_type, class key_type_, class hash_type, class alloc_type>
obj_type
hashmap<obj_type, key_type_, hash_type, alloc_type>::get_set_elem(obj_type t_obj, key_type_ t_key)
{
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter = this->find(t_key);

  if ( iter == this->end() )
  {
    set_elem(t_obj, t_key);
    return obj_type();
  }

  obj_type t_ret = iter->second;
  iter->second = t_obj;

  return t_ret;
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
obj_type
hashmap<obj_type, key_type_, hash_type, alloc_type>::get_or_callback_set
(obj_type (*func)(void*), void* p_void, key_type_ t_key)
{
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter = this->find(t_key);

  if ( iter == this->end() )
  {
    obj_type t_obj = (*func) (p_void);
    set_elem(t_obj, t_key);
    return t_obj;
  }

  return iter->second;
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
void
hashmap<obj_type, key_type_, hash_type, alloc_type>::set_elem(obj_type t_obj, key_type_ t_key)
{
  (*this)[t_key] = t_obj;
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
obj_type
hashmap<obj_type, key_type_, hash_type, alloc_type>::get_elem(key_type_ t_key)
{
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter = this->find(t_key);

  if ( iter != this->end() )
    return iter->second;

  return obj_type();
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
vector<key_type_>*
hashmap<obj_type, key_type_, hash_type, alloc_type>::get_key_vector()
{
  vector<key_type_>* p_vec = new vector<key_type_>;
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter;

  for ( iter = this->begin(); iter != this->end(); ++iter )
    p_vec->push_back(iter->first);

  return p_vec;
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
bool
hashmap<obj_type, key_type_, hash_type, alloc_type>::exists(key_type_ t_key)
{
  return this->find(t_key) != this->end();
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
void
hashmap<obj_type, key_type_, hash_type, alloc_type>::run_func( void (*func)(obj_type) )
{
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter;
  for ( iter = this->begin(); iter != this->end(); ++iter )
    ( *func ) ( iter->second );
}

template<class obj_type, class key_type_, class hash_type, class alloc_type>
void
hashmap<obj_type, key_type_, hash_type, alloc_type>::run_func( void (*func)(obj_type, void*), void* v_arg )
{
  typename hashmap<obj_type, key_type_, hash_type, alloc_type>::iterator iter;
  for ( iter = this->begin(); iter != this->end(); ++iter )
    ( *func ) ( iter->second, v_arg );
}