ChoiceCondition(const std::vector<Type> &);
virtual ChoiceCondition<T> *clone() const;
+ virtual bool equals(const Condition &) const;
virtual bool can_merge(const Condition &, const CompoundCondition &) const;
- virtual ChoiceCondition<T> *merge(const std::vector<Condition *> &, const CompoundCondition &) const;
+ virtual ChoiceCondition<T> *merge(const std::vector<const Condition *> &, const CompoundCondition &) const;
virtual void add_lines(std::list<FilterStatement> &) const;
};
return new ChoiceCondition<T>(values);
}
+template<typename T>
+bool ChoiceCondition<T>::equals(const Condition &other) const
+{
+ const ChoiceCondition<T> *other_choice = dynamic_cast<const ChoiceCondition<T> *>(&other);
+ if(!other_choice || values.size()!=other_choice->values.size())
+ return false;
+
+ for(unsigned i=0; i<values.size(); ++i)
+ if(values[i]!=other_choice->values[i])
+ return false;
+
+ return true;
+}
+
template<typename T>
bool ChoiceCondition<T>::can_merge(const Condition &other, const CompoundCondition &parent) const
{
}
template<typename T>
-ChoiceCondition<T> *ChoiceCondition<T>::merge(const std::vector<Condition *> &conditions, const CompoundCondition &parent) const
+ChoiceCondition<T> *ChoiceCondition<T>::merge(const std::vector<const Condition *> &conditions, const CompoundCondition &parent) const
{
if(dynamic_cast<const OrCondition *>(&parent) && !conditions.empty())
{
ChoiceCondition<T> *result = new ChoiceCondition<T>(std::vector<Type>());
- for(std::vector<Condition *>::const_iterator i=conditions.begin(); i!=conditions.end(); ++i)
+ for(std::vector<const Condition *>::const_iterator i=conditions.begin(); i!=conditions.end(); ++i)
{
- const std::vector<Type> &v = static_cast<ChoiceCondition<T> *>(*i)->values;
+ const std::vector<Type> &v = static_cast<const ChoiceCondition<T> *>(*i)->values;
for(typename std::vector<Type>::const_iterator j=v.begin(); j!=v.end(); ++j)
if(Msp::find(result->values, *j)==result->values.end())
result->values.push_back(*j);