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 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
|
/*
* Trompeloeil C++ mocking framework
*
* Copyright (C) Björn Fahller
* Copyright (C) Andrew Paxie
*
* Use, modification and distribution is subject to the
* Boost Software License, Version 1.0. (See accompanying
* file LICENSE_1_0.txt or copy atl
* http://www.boost.org/LICENSE_1_0.txt)
*
* Project home: https://github.com/rollbear/trompeloeil
*/
#ifndef TROMPELOEIL_SEQUENCE_HPP
#define TROMPELOEIL_SEQUENCE_HPP
#ifndef TROMPELOEIL_MOCK_HPP_
#include "mock.hpp"
#endif
namespace trompeloeil {
class sequence_type
{
public:
sequence_type() noexcept = default;
sequence_type(sequence_type&&) noexcept = delete;
sequence_type(const sequence_type&) = delete;
sequence_type& operator=(sequence_type&&) noexcept = delete;
sequence_type& operator=(const sequence_type&) = delete;
~sequence_type();
bool
is_completed()
const
noexcept;
bool
is_first(
sequence_matcher const *m)
const
noexcept;
unsigned
cost(
sequence_matcher const *m)
const
noexcept;
void
retire_until(
sequence_matcher const* m)
noexcept;
void
add_last(
sequence_matcher *m)
noexcept;
void
validate_match(
severity s,
sequence_matcher const *matcher,
char const *seq_name,
char const *match_name,
location loc)
const;
private:
list<sequence_matcher> matchers;
};
class sequence
{
public:
sequence_type& operator*() { return *obj; }
bool is_completed() const { return obj->is_completed(); }
private:
std::unique_ptr<sequence_type> obj{detail::make_unique<sequence_type>()};
};
class sequence_matcher : public list_elem<sequence_matcher>
{
public:
using init_type = std::pair<char const*, sequence&>;
sequence_matcher(
char const *exp,
location loc,
const sequence_handler_base& handler,
init_type i)
noexcept
: seq_name(i.first)
, exp_name(exp)
, exp_loc(loc)
, sequence_handler(handler)
, seq(*i.second)
{
auto lock = get_lock();
seq.add_last(this);
}
void
validate_match(
severity s,
char const *match_name,
location loc)
const
{
seq.validate_match(s, this, seq_name, match_name, loc);
}
unsigned
cost()
const
noexcept
{
return seq.cost(this);
}
bool
is_satisfied()
const
noexcept;
bool
is_optional()
const
noexcept;
void
retire()
noexcept
{
this->unlink();
}
void
retire_predecessors()
noexcept
{
seq.retire_until(this);
}
void
print_expectation(std::ostream& os)
const
{
os << exp_name << " at " << exp_loc;
}
char const*
sequence_name()
const
noexcept
{
return seq_name;
}
private:
char const *seq_name;
char const *exp_name;
location exp_loc;
const sequence_handler_base& sequence_handler;
sequence_type& seq;
};
inline
bool
sequence_type::is_completed()
const
noexcept
{
for (const auto& matcher : matchers)
{
if (!matcher.is_satisfied())
{
return false;
}
}
return true;
}
inline
bool
sequence_type::is_first(
sequence_matcher const *m)
const
noexcept
{
return !matchers.empty() && &*matchers.begin() == m;
}
inline
unsigned
sequence_type::cost(
sequence_matcher const* m)
const
noexcept
{
unsigned sequence_cost = 0U;
for (auto const& e : matchers)
{
if (&e == m) return sequence_cost;
if (!e.is_satisfied())
{
return ~0U;
}
++sequence_cost;
}
return ~0U;
}
inline
void
sequence_type::retire_until(
sequence_matcher const* m)
noexcept
{
while (!matchers.empty())
{
auto first = &*matchers.begin();
if (first == m) return;
first->retire();
}
}
inline
void
sequence_type::validate_match(
severity s,
sequence_matcher const *matcher,
char const* seq_name,
char const* match_name,
location loc)
const
{
if (is_first(matcher)) return;
if (matchers.empty())
{
std::ostringstream os;
os << "Sequence mismatch for sequence \"" << seq_name
<< "\" with matching call of " << match_name
<< " at " << loc
<< ". Sequence \"" << seq_name
<< "\" has no more pending expectations\n";
send_report<specialized>(s, loc, os.str());
}
bool first = true;
std::ostringstream os;
os << "Sequence mismatch for sequence \"" << seq_name
<< "\" with matching call of " << match_name
<< " at " << loc << ".\n";
for (auto const& m : matchers)
{
if (first || !m.is_optional())
{
if (first)
{
os << "Sequence \"" << seq_name << "\" has ";
}
else
{
os << "and has ";
}
m.print_expectation(os);
if (m.is_optional())
{
os << " first in line\n";
}
else
{
os << " as first required expectation\n";
break;
}
}
first = false;
}
send_report<specialized>(s, loc, os.str());
}
inline
sequence_type::~sequence_type()
{
bool touched = false;
std::ostringstream os;
while (!matchers.empty())
{
auto m = matchers.begin();
if (!touched)
{
os << "Sequence expectations not met at destruction of sequence object \""
<< m->sequence_name() << "\":";
touched = true;
}
os << "\n missing ";
m->print_expectation(os);
m->unlink();
}
if (touched)
{
os << "\n";
send_report<specialized>(severity::nonfatal, location{}, os.str());
}
}
inline
void
sequence_type::add_last(
sequence_matcher *m)
noexcept
{
matchers.push_back(m);
}
inline
bool
sequence_matcher::is_satisfied()
const
noexcept
{
return sequence_handler.is_satisfied();
}
inline
bool
sequence_matcher::is_optional()
const
noexcept
{
return sequence_handler.get_min_calls() == 0;
}
template <size_t N>
struct sequence_matchers
{
void
validate(
severity s,
char const *match_name,
location loc)
{
for (auto& e : matchers)
{
e.validate_match(s, match_name, loc);
}
}
unsigned
order()
const
noexcept
{
unsigned highest_order = 0U;
for (auto &m: matchers) {
auto cost = m.cost();
if (cost > highest_order) {
highest_order = cost;
}
}
return highest_order;
}
void
retire()
noexcept
{
for (auto& e : matchers)
{
e.retire();
}
}
void
retire_predecessors()
noexcept
{
for (auto& e : matchers)
{
e.retire_predecessors();
}
}
std::array<sequence_matcher, N> matchers;
};
}
#define TROMPELOEIL_IN_SEQUENCE(...) \
in_sequence(TROMPELOEIL_INIT_WITH_STR(::trompeloeil::sequence_matcher::init_type, __VA_ARGS__))
#ifndef TROMPELOEIL_LONG_MACRCOS
#define IN_SEQUENCE TROMPELOEIL_IN_SEQUENCE
#endif
#endif //TROMPELOEIL_SEQUENCE_HPP
|