source: mainline/uspace/lib/cpp/include/internal/test/test.hpp@ cf51eae

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since cf51eae was 323ae805, checked in by Dzejrou <dzejrou@…>, 7 years ago

cpp: added unordered_set tests

  • Property mode set to 100644
File size: 5.5 KB
RevLine 
[604038c]1/*
[96ae12b]2 * Copyright (c) 2018 Jaroslav Jindrak
[604038c]3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
[b946b052]29#ifndef LIBCPP_TEST_TEST
30#define LIBCPP_TEST_TEST
31
[604038c]32#include <utility>
[96ae12b]33#include <iterator>
[c075647a]34#include <type_traits>
[604038c]35
36namespace std::test
37{
38 class test_suite
39 {
40 public:
[96ae12b]41 virtual bool run(bool) = 0;
[604038c]42 virtual const char* name() = 0;
43
44 virtual ~test_suite() = default;
45
[471e313]46 unsigned int get_failed() const noexcept;
47
48 unsigned int get_succeeded() const noexcept;
49
[604038c]50 protected:
51 void report(bool, const char*);
[509738fd]52 void start();
53 bool end();
54
55 unsigned int failed_{};
56 unsigned int succeeded_{};
57 bool ok_{true};
[96ae12b]58 bool report_{true};
[604038c]59
60 template<class... Args>
61 void test_eq(const char* tname, Args&&... args)
62 {
63 if (!assert_eq(std::forward<Args>(args)...))
[509738fd]64 {
[604038c]65 report(false, tname);
[509738fd]66 ++failed_;
67 ok_ = false;
68 }
[604038c]69 else
[509738fd]70 {
[604038c]71 report(true, tname);
[509738fd]72 ++succeeded_;
73 }
[604038c]74 }
75
[d93f01a6]76 template<class T, class U>
77 bool assert_eq(const T& lhs, const U& rhs)
[604038c]78 {
79 return lhs == rhs;
80 }
81
82 template<class Iterator1, class Iterator2>
83 bool assert_eq(Iterator1 first1, Iterator1 last1,
84 Iterator2 first2, Iterator2 last2)
85 {
[c075647a]86 auto len1 = std::distance(first1, last1);
87 auto len2 = std::distance(first2, last2);
88
89 using common_t = std::common_type_t<decltype(len1), decltype(len2)>;
90 auto len1_common = static_cast<common_t>(len1);
91 auto len2_common = static_cast<common_t>(len2);
92
93 if (len1_common != len2_common)
[604038c]94 return false;
95
96 while (first1 != last1)
97 {
98 if (*first1++ != *first2++)
99 return false;
100 }
101
102 return true;
103 }
[323ae805]104
105 template<class Iterator, class Container>
106 void test_contains(const char* tname, Iterator first,
107 Iterator last, const Container& cont)
108 {
109 if (!assert_contains(first, last, cont))
110 {
111 report(false, tname);
112 ++failed_;
113 ok_ = false;
114 }
115 else
116 {
117 report(true, tname);
118 ++succeeded_;
119 }
120 }
121
122 template<class Iterator1, class Iterator2, class Container>
123 void test_contains_multi(const char* tname, Iterator1 first1,
124 Iterator1 last1, Iterator2 first2,
125 const Container& cont)
126 {
127 if (!assert_contains_multi(first1, last1, first2, cont))
128 {
129 report(false, tname);
130 ++failed_;
131 ok_ = false;
132 }
133 else
134 {
135 report(true, tname);
136 ++succeeded_;
137 }
138 }
139
140 template<class Iterator, class Container>
141 bool assert_contains(Iterator first, Iterator last, const Container& cont)
142 {
143 while (first != last)
144 {
145 if (cont.find(*first++) == cont.end())
146 return false;
147 }
148
149 return true;
150 }
151
152 template<class Iterator1, class Iterator2, class Container>
153 bool assert_contains_multi(Iterator1 first1, Iterator1 last1,
154 Iterator2 first2, const Container& cont)
155 {
156 while (first1 != last1)
157 {
158 if (cont.count(*first1++) != *first2++)
159 return false;
160 }
161
162 return true;
163 }
[604038c]164 };
165}
[b946b052]166
167#endif
Note: See TracBrowser for help on using the repository browser.