2004-03-22 15:56:32 +01:00
|
|
|
/*
|
|
|
|
|
|
|
|
|
|
Copyright (c) 2003, Magnus Jonsson
|
|
|
|
|
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_RESOURCE_REQUEST_HPP_INCLUDED
|
|
|
|
|
#define TORRENT_RESOURCE_REQUEST_HPP_INCLUDED
|
|
|
|
|
|
2004-08-08 23:26:40 +02:00
|
|
|
#ifdef min
|
|
|
|
|
#undef min
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifdef max
|
|
|
|
|
#undef max
|
|
|
|
|
#endif
|
|
|
|
|
|
2004-03-22 15:56:32 +01:00
|
|
|
namespace libtorrent
|
|
|
|
|
{
|
|
|
|
|
struct resource_request
|
|
|
|
|
{
|
2004-03-27 23:02:31 +01:00
|
|
|
resource_request()
|
|
|
|
|
: used(0)
|
|
|
|
|
, min(0)
|
|
|
|
|
, max(0)
|
|
|
|
|
, given(0)
|
|
|
|
|
{}
|
2004-03-22 15:56:32 +01:00
|
|
|
|
2004-03-28 19:45:37 +02:00
|
|
|
int left() const
|
|
|
|
|
{
|
2004-09-08 01:16:11 +02:00
|
|
|
assert(given <= max);
|
|
|
|
|
assert(given >= min);
|
2004-03-28 19:45:37 +02:00
|
|
|
assert(given >= used);
|
|
|
|
|
return given - used;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2004-03-22 15:56:32 +01:00
|
|
|
// I'm right now actively using:
|
|
|
|
|
int used;
|
2004-03-27 23:02:31 +01:00
|
|
|
|
|
|
|
|
// given cannot be smaller than min
|
|
|
|
|
// and not greater than max.
|
|
|
|
|
int min;
|
|
|
|
|
int max;
|
|
|
|
|
|
2004-03-22 15:56:32 +01:00
|
|
|
// Reply: Okay, you're allowed to use this much (a compromise):
|
|
|
|
|
int given;
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|
