50 lines
1.3 KiB
C++
50 lines
1.3 KiB
C++
/*
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#include <iostream>
|
|
#include <sstream>
|
|
#include "util/test.h"
|
|
#include "util/splay_map.h"
|
|
#include "util/name.h"
|
|
using namespace lean;
|
|
|
|
struct int_cmp { int operator()(int i1, int i2) const { return i1 < i2 ? -1 : (i1 > i2 ? 1 : 0); } };
|
|
|
|
typedef splay_map<int, name, int_cmp> int2name;
|
|
|
|
static void tst0() {
|
|
int2name m1;
|
|
m1[10] = name("t1");
|
|
m1[20] = name("t2");
|
|
int2name m2(m1);
|
|
m2[10] = name("t3");
|
|
lean_assert(m1[10] == name("t1"));
|
|
lean_assert(m1[20] == name("t2"));
|
|
lean_assert(m2[10] == name("t3"));
|
|
lean_assert(m2[20] == name("t2"));
|
|
lean_assert(m2.size() == 2);
|
|
lean_assert(m2[100] == name());
|
|
lean_assert(m2.size() == 3);
|
|
lean_assert(m2[100] == name());
|
|
lean_assert(m2.size() == 3);
|
|
}
|
|
|
|
static void tst1() {
|
|
int2name m;
|
|
m[10] = name("t1");
|
|
m[20] = name("t2");
|
|
lean_assert(fold(m, [](int k, name const &, int a) { return k + a; }, 0) == 30);
|
|
std::ostringstream out;
|
|
for_each(m, [&](int, name const & v) { out << v << " "; });
|
|
std::cout << out.str() << "\n";
|
|
lean_assert(out.str() == "t1 t2 ");
|
|
}
|
|
|
|
int main() {
|
|
tst0();
|
|
tst1();
|
|
return has_violations() ? 1 : 0;
|
|
}
|