blob: eafe6c5119582562ec2babe86e889d32aa5554ef (
plain)
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
|
// Copyright Joakim Karlsson & Kim Gräsman 2010-2012.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef IGLOO_CONTRAINTOPERATOR_H
#define IGLOO_CONTRAINTOPERATOR_H
#include "invalidexpressionexception.h"
namespace snowhouse {
struct ConstraintOperator
{
#if __cplusplus > 199711L
#else
virtual ~ConstraintOperator() {}
#endif
virtual void PerformOperation(ResultStack& result) = 0;
virtual int Precedence() const = 0;
template <typename ConstraintListType, typename ActualType>
static bool EvaluateElementAgainstRestOfExpression(ConstraintListType& list, const ActualType& actual)
{
ResultStack innerResult;
OperatorStack innerOperators;
EvaluateConstraintList(list.m_tail, innerResult, innerOperators, actual);
EvaluateAllOperatorsOnStack(innerOperators, innerResult);
if(innerResult.empty())
{
throw InvalidExpressionException("The expression after \"" + snowhouse::Stringize(list.m_head) + "\" operator does not yield any result");
}
return innerResult.top();
}
static void EvaluateOperatorsWithLessOrEqualPrecedence(const ConstraintOperator& op, OperatorStack& operators, ResultStack& result)
{
while(!operators.empty())
{
ConstraintOperator* op_from_stack = operators.top();
if(op_from_stack->Precedence() > op.Precedence())
{
break;
}
op_from_stack->PerformOperation(result);
operators.pop();
}
}
static void EvaluateAllOperatorsOnStack(OperatorStack& operators, ResultStack& result)
{
while(!operators.empty())
{
ConstraintOperator* op = operators.top();
op->PerformOperation(result);
operators.pop();
}
}
};
}
#endif
|
