forked from premiere/premiere-libtorrent
67 lines
2.3 KiB
C++
67 lines
2.3 KiB
C++
|
/*
|
||
|
|
|
||
|
|
Copyright (c) 2016, 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_PIECE_BLOCK_HPP_INCLUDED
|
||
|
|
#define TORRENT_PIECE_BLOCK_HPP_INCLUDED
|
||
|
|
|
||
|
|
namespace libtorrent
|
||
|
|
{
|
||
|
|
struct TORRENT_EXTRA_EXPORT piece_block
|
||
|
|
{
|
||
|
|
static const piece_block invalid;
|
||
|
|
|
||
|
|
piece_block() {}
|
||
|
|
piece_block(int p_index, int b_index)
|
||
|
|
: piece_index(p_index)
|
||
|
|
, block_index(b_index)
|
||
|
|
{
|
||
|
|
}
|
||
|
|
int piece_index;
|
||
|
|
int block_index;
|
||
|
|
|
||
|
|
bool operator<(piece_block const& b) const
|
||
|
|
{
|
||
|
|
if (piece_index < b.piece_index) return true;
|
||
|
|
if (piece_index == b.piece_index) return block_index < b.block_index;
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool operator==(piece_block const& b) const
|
||
|
|
{ return piece_index == b.piece_index && block_index == b.block_index; }
|
||
|
|
|
||
|
|
bool operator!=(piece_block const& b) const
|
||
|
|
{ return piece_index != b.piece_index || block_index != b.block_index; }
|
||
|
|
};
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|