blob: ac8dbd5ef57a2a484cca66ee98397999be4e0b47 (
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
|
/*
* Copyright (C) 2007-2011 Xagasoft, All rights reserved.
*
* This file is part of the libbu++ library and is released under the
* terms of the license contained in the file LICENSE.
*/
#ifndef BU_SET_H
#define BU_SET_H
#include <stddef.h>
#include <string.h>
#include <memory>
#include <iostream>
#include <list>
#include <utility>
#include "bu/exceptionbase.h"
#include "bu/list.h"
#include "bu/archive.h"
#define bitsToBytes( n ) (n/32+(n%32>0 ? 1 : 0))
namespace Bu
{
subExceptionDecl( SetException )
/**
*@todo Set should be rewritten, possibly using a b-tree as ordered storage
* in the backend. It should use either a b-tree or array for storage and
* allow set intersections, unions, etc.
*@param key (typename) The datatype of the hashtable keys
*@param sizecalc (typename) Functor to compute new table size on rehash
*@param keyalloc (typename) Memory allocator for hashtable keys
*@param challoc (typename) Byte allocator for bitflags
*@ingroup Containers
*/
template<typename key, typename sizecalc, typename keyalloc, typename challoc >
class Set
{
public:
};
}
#endif
|
