66 lines
2.2 KiB
C++
66 lines
2.2 KiB
C++
/*
|
|
|
|
Copyright (c) 2014, 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.
|
|
|
|
*/
|
|
|
|
#include "test.hpp"
|
|
#include "setup_transfer.hpp"
|
|
#include "libtorrent/random.hpp"
|
|
|
|
using namespace libtorrent;
|
|
|
|
TORRENT_TEST(random)
|
|
{
|
|
|
|
const int repetitions = 200000;
|
|
|
|
for (int byte = 0; byte < 4; ++byte)
|
|
{
|
|
int buckets[256];
|
|
memset(buckets, 0, sizeof(buckets));
|
|
|
|
for (int i = 0; i < repetitions; ++i)
|
|
{
|
|
boost::uint32_t val = libtorrent::random();
|
|
val >>= byte * 8;
|
|
++buckets[val & 0xff];
|
|
}
|
|
|
|
for (int i = 0; i < 256; ++i)
|
|
{
|
|
const int expected = repetitions / 256;
|
|
// expect each bucket to be within 15% of the expected value
|
|
fprintf(stderr, "%d: %f\n", i, float(buckets[i] - expected) * 100.f / expected);
|
|
TEST_CHECK(abs(buckets[i] - expected) < expected / 6);
|
|
}
|
|
}
|
|
}
|
|
|