forked from premiere/premiere-libtorrent
119 lines
3.3 KiB
C++
Executable File
119 lines
3.3 KiB
C++
Executable File
/*
|
|
|
|
Copyright (c) 2003, Arvid Norberg
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in
|
|
the documentation and/or other materials provided with the distribution.
|
|
* Neither the name of the author nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#ifndef TORRENT_PEER_ID_HPP_INCLUDED
|
|
#define TORRENT_PEER_ID_HPP_INCLUDED
|
|
|
|
#include <iostream>
|
|
#include <iomanip>
|
|
#include <cassert>
|
|
|
|
namespace libtorrent
|
|
{
|
|
|
|
class big_number
|
|
{
|
|
// the number of bytes of the number
|
|
enum { number_size = 20 };
|
|
public:
|
|
|
|
void clear()
|
|
{
|
|
std::fill(m_number,m_number+number_size,0);
|
|
}
|
|
|
|
bool is_all_zeros() const
|
|
{
|
|
return std::count(m_number,m_number+number_size,0) == number_size;
|
|
}
|
|
|
|
bool operator==(const big_number& n) const
|
|
{
|
|
return std::equal(n.m_number, n.m_number+number_size, m_number);
|
|
}
|
|
|
|
bool operator!=(const big_number& n) const
|
|
{
|
|
return !std::equal(n.m_number, n.m_number+number_size, m_number);
|
|
}
|
|
|
|
bool operator<(const big_number& n) const
|
|
{
|
|
for(int i = 0; i < number_size; ++i)
|
|
{
|
|
if (m_number[i] < n.m_number[i]) return true;
|
|
if (m_number[i] > n.m_number[i]) return false;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
unsigned char& operator[](int i)
|
|
{ assert(i >= 0 && i < number_size); return m_number[i]; }
|
|
|
|
unsigned char operator[](int i) const
|
|
{ assert(i >= 0 && i < number_size); return m_number[i]; }
|
|
|
|
typedef const unsigned char* const_iterator;
|
|
typedef unsigned char* iterator;
|
|
|
|
const_iterator begin() const { return m_number; }
|
|
const_iterator end() const { return m_number+number_size; }
|
|
|
|
iterator begin() { return m_number; }
|
|
iterator end() { return m_number+number_size; }
|
|
|
|
private:
|
|
|
|
unsigned char m_number[number_size];
|
|
|
|
};
|
|
|
|
typedef big_number peer_id;
|
|
typedef big_number sha1_hash;
|
|
|
|
inline std::ostream& operator<<(std::ostream& os, const big_number& peer)
|
|
{
|
|
for (big_number::const_iterator i = peer.begin();
|
|
i != peer.end();
|
|
++i)
|
|
{
|
|
os << std::hex << std::setw(2) << std::setfill('0')
|
|
<< static_cast<unsigned int>(*i);
|
|
}
|
|
os << std::dec << std::setfill(' ');
|
|
return os;
|
|
}
|
|
|
|
}
|
|
|
|
#endif // TORRENT_PEER_ID_HPP_INCLUDED
|