mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
There's no real need for this to be included in the standard build, or even to avoid bit-rot; but if someone messes around with the data structure, this is a good way to stress-test it. Swift SVN r14494
77 lines
2.2 KiB
C++
77 lines
2.2 KiB
C++
#include "swift/Basic/SuccessorMap.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <map>
|
|
#include <random>
|
|
|
|
const unsigned RandomSpread = 10;
|
|
|
|
int main(int argc, char **argv) {
|
|
std::random_device randomDevice; // used for seeding
|
|
std::default_random_engine generator(randomDevice());
|
|
std::uniform_int_distribution<unsigned> distribution(0,RandomSpread);
|
|
|
|
swift::SuccessorMap<unsigned, unsigned> map;
|
|
std::map<unsigned, unsigned> stdMap;
|
|
|
|
if (argc < 0) map.dump(); // force this to be used
|
|
|
|
auto next = [&] { return distribution(generator); };
|
|
auto nextUnmappedKey = [&] {
|
|
unsigned key;
|
|
do {
|
|
key = next();
|
|
} while (stdMap.find(key) != stdMap.end());
|
|
return key;
|
|
};
|
|
|
|
while (true) {
|
|
auto operation = next();
|
|
|
|
// Find.
|
|
if (operation >= .7 * RandomSpread) {
|
|
unsigned key = nextUnmappedKey();
|
|
auto iter = stdMap.upper_bound(key);
|
|
auto stdResult = (iter == stdMap.end() ? nullptr : &iter->second);
|
|
|
|
llvm::outs() << " EXPECT_EQ(";
|
|
if (stdResult) {
|
|
llvm::outs() << *stdResult << ", *";
|
|
} else {
|
|
llvm::outs() << "InvalidValue, ";
|
|
}
|
|
llvm::outs() << "map.findLeastUpperBound(" << key << "));\n";
|
|
|
|
auto result = map.findLeastUpperBound(key);
|
|
if (result && stdResult && *result != *stdResult) {
|
|
llvm::outs() << "FAILURE: found " << *result
|
|
<< ", but should have found " << *stdResult << "\n";
|
|
abort();
|
|
} else if (!result && stdResult) {
|
|
llvm::outs() << "FAILURE: found nothing, but should have found "
|
|
<< *stdResult << "\n";
|
|
abort();
|
|
} else if (result && !stdResult) {
|
|
llvm::outs() << "FAILURE: found " << *result
|
|
<< ", but should have found nothing\n";
|
|
abort();
|
|
}
|
|
|
|
} else if (operation >= .05 * RandomSpread) {
|
|
unsigned key = nextUnmappedKey();
|
|
unsigned value = next();
|
|
|
|
llvm::outs() << " map.insert(" << key << ", " << value << ");\n";
|
|
|
|
map.insert((unsigned) key, (unsigned) value);
|
|
stdMap.insert(std::make_pair(key, value));
|
|
} else {
|
|
llvm::outs() << " map.clear();\n";
|
|
map.clear();
|
|
stdMap.clear();
|
|
}
|
|
|
|
llvm::outs() << " map.validate();\n";
|
|
map.validate();
|
|
}
|
|
}
|