File: CID.h

package info (click to toggle)
linuxdcpp 1.0.3-1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 2,388 kB
  • ctags: 5,088
  • sloc: cpp: 33,725; makefile: 15
file content (63 lines) | stat: -rw-r--r-- 2,057 bytes parent folder | download | duplicates (2)
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
/*
 * Copyright (C) 2001-2006 Jacek Sieka, arnetheduck on gmail point com
 *
 * 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.
 */

#if !defined(CID_H)
#define CID_H

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "Encoder.h"
#include "Util.h"

class CID {
public:
	enum { SIZE = 192 / 8 };

	struct Hash {
		size_t operator()(const CID& c) const { return c.toHash(); }
	};
	CID() { memset(cid, 0, sizeof(cid)); }
	explicit CID(const uint8_t* data) { memcpy(cid, data, sizeof(cid)); }
	explicit CID(const string& base32) { Encoder::fromBase32(base32.c_str(), cid, sizeof(cid)); }

	bool operator==(const CID& rhs) const { return memcmp(cid, rhs.cid, sizeof(cid)) == 0; }
	bool operator<(const CID& rhs) const { return memcmp(cid, rhs.cid, sizeof(cid)) < 0; }

	string toBase32() const { return Encoder::toBase32(cid, sizeof(cid)); }
	string& toBase32(string& tmp) const { return Encoder::toBase32(cid, sizeof(cid), tmp); }

	size_t toHash() const { return *reinterpret_cast<const size_t*>(cid); }
	const uint8_t* data() const { return cid; }

	bool isZero() const { return find_if(cid, cid+SIZE, bind2nd(not_equal_to<uint8_t>(), 0)) == (cid+SIZE); }

	static CID generate() {
		uint8_t data[CID::SIZE];
		for(size_t i = 0; i < sizeof(data); ++i) {
			data[i] = (uint8_t)Util::rand();
		}
		return CID(data);
	}

private:
	uint8_t cid[SIZE];
};

#endif // !defined(CID_H)