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
|
/* -*- mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2010 Monty Taylor
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <config.h>
#include <string>
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include <drizzled/constrained_value.h>
#include <boost/lexical_cast.hpp>
using namespace drizzled;
namespace po= boost::program_options;
BOOST_AUTO_TEST_SUITE(ConstrainedValue)
BOOST_AUTO_TEST_CASE(raw_usage)
{
constrained_check<uint64_t,1024,1,10> val(1);
BOOST_REQUIRE_EQUAL(UINT64_C(1), (uint64_t)val);
BOOST_REQUIRE_THROW(val= 1025 , po::validation_error);
BOOST_REQUIRE_THROW(val= 0 , po::validation_error);
val= 25;
BOOST_REQUIRE_EQUAL(20, (uint64_t)val);
}
BOOST_AUTO_TEST_CASE(lexical_cast_usage)
{
constrained_check<uint64_t,1024,1,10> val(1);
std::string string_val= boost::lexical_cast<std::string>(val);
BOOST_REQUIRE_EQUAL(std::string("1"), string_val);
}
BOOST_AUTO_TEST_SUITE_END()
|