blob: 35ecfff5d13430ef546581d9b82c9acfe8a30672 (
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
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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.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., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include <time.h>
#include <stdlib.h>
#include <tqcstring.h>
#include <util/constants.h>
#include "key.h"
using namespace bt;
namespace dht
{
Key::Key()
{}
Key::Key(const bt::SHA1Hash & k) : bt::SHA1Hash(k)
{
}
Key::Key(const Uint8* d) : bt::SHA1Hash(d)
{
}
Key::Key(const TQByteArray & ba)
{
for (Uint32 i = 0;i < 20 && i < ba.size();i++)
hash[i] = ba[i];
}
Key::~Key()
{}
bool Key::operator == (const Key & other) const
{
return bt::SHA1Hash::operator ==(other);
}
bool Key::operator != (const Key & other) const
{
return !operator == (other);
}
bool Key::operator < (const Key & other) const
{
for (int i = 0;i < 20;i++)
{
if (hash[i] < other.hash[i])
return true;
else if (hash[i] > other.hash[i])
return false;
}
return false;
}
bool Key::operator <= (const Key & other) const
{
return operator < (other) || operator == (other);
}
bool Key::operator > (const Key & other) const
{
for (int i = 0;i < 20;i++)
{
if (hash[i] < other.hash[i])
return false;
else if (hash[i] > other.hash[i])
return true;
}
return false;
}
bool Key::operator >= (const Key & other) const
{
return operator > (other) || operator == (other);
}
Key Key::distance(const Key & a,const Key & b)
{
return a ^ b;
}
Key Key::random()
{
srand(time(0));
Key k;
for (int i = 0;i < 20;i++)
{
k.hash[i] = (Uint8)rand() % 0xFF;
}
return k;
}
}
|
