Merge lp:~tangent-org/libmemcached/1.0-build/ Build: jenkins-Libmemcached-187
[m6w6/libmemcached] / libhashkit-1.0 / hashkit.hpp
1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
2 *
3 * HashKit library
4 *
5 * Copyright (C) 2011-2012 Data Differential, http://datadifferential.com/
6 * Copyright (C) 2006-2010 Brian Aker All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
10 * met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * * Redistributions in binary form must reproduce the above
16 * copyright notice, this list of conditions and the following disclaimer
17 * in the documentation and/or other materials provided with the
18 * distribution.
19 *
20 * * The names of its contributors may not be used to endorse or
21 * promote products derived from this software without specific prior
22 * written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
28 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
30 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
34 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 *
36 */
37
38
39 #pragma once
40
41 #include <libhashkit-1.0/hashkit.h>
42 #include <string>
43
44 class Hashkit {
45
46 public:
47
48 Hashkit()
49 {
50 hashkit_create(&self);
51 }
52
53 Hashkit(const Hashkit& source)
54 {
55 hashkit_clone(&self, &source.self);
56 }
57
58 Hashkit& operator=(const Hashkit& source)
59 {
60 hashkit_free(&self);
61 hashkit_clone(&self, &source.self);
62
63 return *this;
64 }
65
66 friend bool operator==(const Hashkit &left, const Hashkit &right)
67 {
68 return hashkit_compare(&left.self, &right.self);
69 }
70
71 uint32_t digest(std::string& str)
72 {
73 return hashkit_digest(&self, str.c_str(), str.length());
74 }
75
76 uint32_t digest(const char *key, size_t key_length)
77 {
78 return hashkit_digest(&self, key, key_length);
79 }
80
81 hashkit_return_t set_function(hashkit_hash_algorithm_t hash_algorithm)
82 {
83 return hashkit_set_function(&self, hash_algorithm);
84 }
85
86 hashkit_return_t set_distribution_function(hashkit_hash_algorithm_t hash_algorithm)
87 {
88 return hashkit_set_function(&self, hash_algorithm);
89 }
90
91 ~Hashkit()
92 {
93 hashkit_free(&self);
94 }
95 private:
96
97 hashkit_st self;
98 };