File size: 3,015 Bytes
7b7496d | 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 | // Copyright (c) 2022, ETH Zurich and UNC Chapel Hill.
// 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 ETH Zurich and UNC Chapel Hill 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 HOLDERS 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.
//
// Author: Johannes L. Schoenberger (jsch-at-demuc-dot-de)
#define TEST_NAME "optim/combination_sampler"
#include "util/testing.h"
#include <unordered_set>
#include "optim/combination_sampler.h"
#include "util/math.h"
using namespace colmap;
BOOST_AUTO_TEST_CASE(TestLessSamples) {
CombinationSampler sampler(2);
sampler.Initialize(5);
BOOST_CHECK_EQUAL(sampler.MaxNumSamples(), 10);
std::vector<std::unordered_set<size_t>> sample_sets;
for (size_t i = 0; i < 10; ++i) {
const auto samples = sampler.Sample();
BOOST_CHECK_EQUAL(samples.size(), 2);
sample_sets.emplace_back(samples.begin(), samples.end());
BOOST_CHECK_EQUAL(sample_sets.back().size(), 2);
for (size_t j = 0; j < i; ++j) {
BOOST_CHECK(sample_sets[j].count(samples[0]) == 0 ||
sample_sets[j].count(samples[1]) == 0);
}
}
const auto samples = sampler.Sample();
BOOST_CHECK(sample_sets[0].count(samples[0]) == 1 &&
sample_sets[0].count(samples[1]) == 1);
}
BOOST_AUTO_TEST_CASE(TestEqualSamples) {
CombinationSampler sampler(5);
sampler.Initialize(5);
BOOST_CHECK_EQUAL(sampler.MaxNumSamples(), 1);
for (size_t i = 0; i < 100; ++i) {
const auto samples = sampler.Sample();
BOOST_CHECK_EQUAL(samples.size(), 5);
BOOST_CHECK_EQUAL(
std::unordered_set<size_t>(samples.begin(), samples.end()).size(), 5);
}
}
|