Updating for 1.0.2 release
[awesomized/libmemcached] / libhashkit-1.0 / hashkit.hpp
1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
2 *
3 * Libmemcached library
4 *
5 * Copyright (C) 2011 Data Differential, http://datadifferential.com/
6 * Copyright (C) 2006-2009 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 #pragma once
39
40 #include <libhashkit-1.0/hashkit.h>
41 #include <string>
42
43 class Hashkit {
44
45 public:
46
47 Hashkit()
48 {
49 hashkit_create(&self);
50 }
51
52 Hashkit(const Hashkit& source)
53 {
54 hashkit_clone(&self, &source.self);
55 }
56
57 Hashkit& operator=(const Hashkit& source)
58 {
59 hashkit_free(&self);
60 hashkit_clone(&self, &source.self);
61
62 return *this;
63 }
64
65 friend bool operator==(const Hashkit &left, const Hashkit &right)
66 {
67 return hashkit_compare(&left.self, &right.self);
68 }
69
70 uint32_t digest(std::string& str)
71 {
72 return hashkit_digest(&self, str.c_str(), str.length());
73 }
74
75 uint32_t digest(const char *key, size_t key_length)
76 {
77 return hashkit_digest(&self, key, key_length);
78 }
79
80 hashkit_return_t set_function(hashkit_hash_algorithm_t hash_algorithm)
81 {
82 return hashkit_set_function(&self, hash_algorithm);
83 }
84
85 hashkit_return_t set_distribution_function(hashkit_hash_algorithm_t hash_algorithm)
86 {
87 return hashkit_set_function(&self, hash_algorithm);
88 }
89
90 ~Hashkit()
91 {
92 hashkit_free(&self);
93 }
94 private:
95
96 hashkit_st self;
97 };