File: hybrid_map.hh

package info (click to toggle)
monotone 0.48-3
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 20,096 kB
  • ctags: 8,077
  • sloc: cpp: 81,000; sh: 6,402; perl: 1,241; lisp: 1,045; makefile: 655; python: 566; sql: 112; ansic: 52
file content (256 lines) | stat: -rw-r--r-- 6,029 bytes parent folder | download | duplicates (4)
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
// Copyright (C) 2007 Timothy Brownawell <tbrownaw@gmail.com>
//
// This program is made available under the GNU GPL version 2.0 or
// greater. See the accompanying file COPYING for details.
//
// This program is distributed WITHOUT ANY WARRANTY; without even the
// implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
// PURPOSE.

#ifndef __HYBRID_MAP_HH__
#define __HYBRID_MAP_HH__

#include "sanity.hh"
#include "hash_map.hh"
#include <map>

template<typename Key, typename Val>
class hybrid_map
{
  typedef std::map<Key, Val> omap;
  typedef hashmap::hash_map<Key, Val> umap;
  omap ordered;
  umap unordered;
public:
  typedef typename omap::value_type value_type;
  typedef typename omap::key_type key_type;
  typedef typename omap::mapped_type mapped_type;
  typedef typename omap::size_type size_type;
  class const_iterator;
  class iterator
  {
    friend class hybrid_map<Key, Val>;
    bool ordered;
    bool valid;
    typename omap::iterator o;
    typename umap::iterator u;
    hybrid_map<Key, Val> * n;
    friend class const_iterator;
  public:
    iterator(hybrid_map<Key, Val> * n, typename omap::iterator const & i)
      : ordered(true), valid(i != n->ordered.end()), o(i), n(n)
    {}
    iterator(hybrid_map<Key, Val> * n, typename umap::iterator const & i)
      : ordered(false), valid(i != n->unordered.end()), u(i), n(n)
    {}
    iterator()
      : valid(false)
    {}
    iterator & operator++()
    {
      I(valid);
      if (!ordered)
        {
          ordered = true;
          o = n->ordered.find(u->first);
        }
      ++o;
      valid = (o != n->ordered.end());
      return *this;
    }
    iterator operator++(int)
    {
      iterator out = *this;
      ++*this;
      return out;
    }
    value_type & operator*()
    {
      I(valid);
      if (ordered)
        return *o;
      else
        return *u;
    }
    value_type const & operator*() const
    {
      I(valid);
      if (ordered)
        return *o;
      else
        return *u;
    }
    value_type * operator->()
    {
      I(valid);
      if (ordered)
        return o.operator->();
      else
        return u.operator->();
    }
    value_type const * operator->() const
    {
      I(valid);
      if (ordered)
        return o.operator->();
      else
        return u.operator->();
    }
    bool operator==(iterator const & other) const
    {
      return (valid == other.valid) && (!valid || (*this)->first == other->first);
    }
    bool operator!=(iterator const & other) const
    {
      return !(*this == other);
    }
  };
  class const_iterator
  {
    friend class hybrid_map<Key, Val>;
    bool ordered;
    bool valid;
    typename omap::const_iterator o;
    typename umap::const_iterator u;
    hybrid_map<Key, Val> const * n;
  public:
    const_iterator(hybrid_map<Key, Val> const * n,
                   typename omap::const_iterator const & i)
      : ordered(true), valid(i != n->ordered.end()), o(i), n(n)
    {}
    const_iterator(hybrid_map<Key, Val> const * n,
                   typename umap::const_iterator const & i)
      : ordered(false), valid(i != n->unordered.end()), u(i), n(n)
    {}
    const_iterator(iterator const & i)
      : ordered(i.ordered), valid(i.valid), o(i.o), u(i.u), n(i.n)
    {}
    const_iterator()
      : valid(false)
    {}
    const_iterator & operator++()
    {
      I(valid);
      if (!ordered)
        {
          ordered = true;
          o = n->ordered.find(u->first);
        }
      ++o;
      valid = (o != n->ordered.end());
      return *this;
    }
    const_iterator operator++(int)
    {
      const_iterator out = *this;
      ++*this;
      return out;
    }
    value_type const & operator*() const
    {
      I(valid);
      if (ordered)
        return *o;
      else
        return *u;
    }
    value_type const * operator->() const
    {
      I(valid);
      if (ordered)
        return o.operator->();
      else
        return u.operator->();
    }
    bool operator==(const_iterator const & other) const
    {
      return (valid == other.valid) && (!valid || (*this)->first == other->first);
    }
    bool operator!=(const_iterator const & other) const
    {
      return !(*this == other);
    }
  };
  friend class iterator;
  friend class const_iterator;
  iterator begin()
  {
    return iterator(this, ordered.begin());
  }
  iterator end()
  {
    return iterator(this, ordered.end());
  }
  iterator find(key_type const & k)
  {
    return iterator(this, unordered.find(k));
  }
  const_iterator begin() const
  {
    return const_iterator(this, ordered.begin());
  }
  const_iterator end() const
  {
    return const_iterator(this, ordered.end());
  }
  const_iterator find(key_type const & k) const
  {
    return const_iterator(this, unordered.find(k));
  }
  size_t size() const
  {
    return ordered.size();
  }
  std::pair<iterator, bool> insert(value_type const & x)
  {
    std::pair<typename omap::iterator, bool> o = ordered.insert(x);
    unordered.insert(x);
    std::pair<iterator, bool> out;
    out.first = iterator(this, o.first);
    out.second = o.second;
    return out;
  }
  iterator insert(iterator const & where, value_type const & what)
  {
    unordered.insert(what);
    if (where.valid && where.ordered)
      {
        return iterator(this, ordered.insert(where.o, what));
      }
    else if (!where.valid)
      {
        return iterator(this, ordered.insert(ordered.end(), what));
      }
    else
      {
        std::pair<typename omap::iterator, bool> o = ordered.insert(what);
        return iterator(this, o.first);
      }
  }
  size_t erase(key_type const & x)
  {
    size_t out = ordered.erase(x);
    unordered.erase(x);
    return out;
  }
  bool empty() const
  {
    return ordered.empty();
  }
  void clear()
  {
    ordered.clear();
    unordered.clear();
  }
};


#endif

// Local Variables:
// mode: C++
// fill-column: 76
// c-file-style: "gnu"
// indent-tabs-mode: nil
// End:
// vim: et:sw=2:sts=2:ts=2:cino=>2s,{s,\:s,+s,t0,g0,^-2,e-2,n-2,p2s,(0,=s: