cc2e93cff0
Fixes a small omission in libcxx that prevents libcxx being built when -DLIBCXX_ENABLE_EXCEPTIONS=0 is specified. This patch adds XFAILS to all those tests that are currently failing on the new -fno-exceptions library variant. Follow-up patches will update the tests (progressively) to cope with the new library variant. Change-Id: I4b801bd8d8e4fe7193df9e55f39f1f393a8ba81a git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@252598 91177308-0d34-0410-b5e6-96231b3b80d8
156 lines
3.7 KiB
C++
156 lines
3.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// XFAIL: libcpp-no-exceptions
|
|
// <map>
|
|
|
|
// class map
|
|
|
|
// mapped_type& at(const key_type& k);
|
|
// const mapped_type& at(const key_type& k) const;
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
|
|
#include "min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1.5),
|
|
V(2, 2.5),
|
|
V(3, 3.5),
|
|
V(4, 4.5),
|
|
V(5, 5.5),
|
|
V(7, 7.5),
|
|
V(8, 8.5),
|
|
};
|
|
std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 7);
|
|
assert(m.at(1) == 1.5);
|
|
m.at(1) = -1.5;
|
|
assert(m.at(1) == -1.5);
|
|
assert(m.at(2) == 2.5);
|
|
assert(m.at(3) == 3.5);
|
|
assert(m.at(4) == 4.5);
|
|
assert(m.at(5) == 5.5);
|
|
try
|
|
{
|
|
m.at(6);
|
|
assert(false);
|
|
}
|
|
catch (std::out_of_range&)
|
|
{
|
|
}
|
|
assert(m.at(7) == 7.5);
|
|
assert(m.at(8) == 8.5);
|
|
assert(m.size() == 7);
|
|
}
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1.5),
|
|
V(2, 2.5),
|
|
V(3, 3.5),
|
|
V(4, 4.5),
|
|
V(5, 5.5),
|
|
V(7, 7.5),
|
|
V(8, 8.5),
|
|
};
|
|
const std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 7);
|
|
assert(m.at(1) == 1.5);
|
|
assert(m.at(2) == 2.5);
|
|
assert(m.at(3) == 3.5);
|
|
assert(m.at(4) == 4.5);
|
|
assert(m.at(5) == 5.5);
|
|
try
|
|
{
|
|
m.at(6);
|
|
assert(false);
|
|
}
|
|
catch (std::out_of_range&)
|
|
{
|
|
}
|
|
assert(m.at(7) == 7.5);
|
|
assert(m.at(8) == 8.5);
|
|
assert(m.size() == 7);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1.5),
|
|
V(2, 2.5),
|
|
V(3, 3.5),
|
|
V(4, 4.5),
|
|
V(5, 5.5),
|
|
V(7, 7.5),
|
|
V(8, 8.5),
|
|
};
|
|
std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 7);
|
|
assert(m.at(1) == 1.5);
|
|
m.at(1) = -1.5;
|
|
assert(m.at(1) == -1.5);
|
|
assert(m.at(2) == 2.5);
|
|
assert(m.at(3) == 3.5);
|
|
assert(m.at(4) == 4.5);
|
|
assert(m.at(5) == 5.5);
|
|
try
|
|
{
|
|
m.at(6);
|
|
assert(false);
|
|
}
|
|
catch (std::out_of_range&)
|
|
{
|
|
}
|
|
assert(m.at(7) == 7.5);
|
|
assert(m.at(8) == 8.5);
|
|
assert(m.size() == 7);
|
|
}
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1.5),
|
|
V(2, 2.5),
|
|
V(3, 3.5),
|
|
V(4, 4.5),
|
|
V(5, 5.5),
|
|
V(7, 7.5),
|
|
V(8, 8.5),
|
|
};
|
|
const std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 7);
|
|
assert(m.at(1) == 1.5);
|
|
assert(m.at(2) == 2.5);
|
|
assert(m.at(3) == 3.5);
|
|
assert(m.at(4) == 4.5);
|
|
assert(m.at(5) == 5.5);
|
|
try
|
|
{
|
|
m.at(6);
|
|
assert(false);
|
|
}
|
|
catch (std::out_of_range&)
|
|
{
|
|
}
|
|
assert(m.at(7) == 7.5);
|
|
assert(m.at(8) == 8.5);
|
|
assert(m.size() == 7);
|
|
}
|
|
#endif
|
|
}
|