X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Frangecondition.h;h=7d85125b6dae6392be187bf4932bf14b54f57867;hb=HEAD;hp=d4d11fa852605bb4f93b13be0e97c14ea5dc8c5c;hpb=51ea3d1cf0f411f0a41367bf218e28f9c16d86e0;p=poefilter.git

diff --git a/source/rangecondition.h b/source/rangecondition.h
index d4d11fa..7d85125 100644
--- a/source/rangecondition.h
+++ b/source/rangecondition.h
@@ -20,8 +20,9 @@ public:
 	RangeCondition(Type, Type);
 
 	virtual RangeCondition<T> *clone() const;
+	virtual bool equals(const Condition &) const;
 	virtual bool can_merge(const Condition &, const CompoundCondition &) const;
-	virtual RangeCondition<T> *merge(const std::vector<Condition *> &, const CompoundCondition &) const;
+	virtual RangeCondition<T> *merge(const std::vector<const Condition *> &, const CompoundCondition &) const;
 	virtual bool is_viable() const { return min<=max; }
 	virtual void add_lines(std::list<FilterStatement> &) const;
 };
@@ -71,6 +72,17 @@ struct DropLevelTraits
 typedef RangeCondition<DropLevelTraits> DropLevelCondition;
 
 
+struct MapTierTraits
+{
+	typedef unsigned Type;
+	static unsigned get_min() { return 1; }
+	static unsigned get_max() { return 17; }
+	static const char *get_keyword() { return "MapTier"; }
+};
+
+typedef RangeCondition<MapTierTraits> MapTierCondition;
+
+
 struct WidthTraits
 {
 	typedef unsigned Type;
@@ -133,28 +145,58 @@ RangeCondition<T> *RangeCondition<T>::clone() const
 	return new RangeCondition<T>(min, max);
 }
 
+template<typename T>
+bool RangeCondition<T>::equals(const Condition &other) const
+{
+	const RangeCondition<T> *other_range = dynamic_cast<const RangeCondition<T> *>(&other);
+	if(!other_range)
+		return false;
+
+	return (min==other_range->min && max==other_range->max);
+}
+
 template<typename T>
 bool RangeCondition<T>::can_merge(const Condition &other, const CompoundCondition &parent) const
 {
-	return dynamic_cast<const RangeCondition<T> *>(&other) && dynamic_cast<const AndCondition *>(&parent);
+	const RangeCondition<T> *other_range = dynamic_cast<const RangeCondition<T> *>(&other);
+	if(!other_range)
+		return false;
+
+	if(dynamic_cast<const AndCondition *>(&parent))
+		return true;
+	else if(dynamic_cast<const OrCondition *>(&parent))
+		return min<=other_range->max+1 && max+1>=other_range->min;
+	else
+		return false;
 }
 
 template<typename T>
-RangeCondition<T> *RangeCondition<T>::merge(const std::vector<Condition *> &conditions, const CompoundCondition &parent) const
+RangeCondition<T> *RangeCondition<T>::merge(const std::vector<const Condition *> &conditions, const CompoundCondition &parent) const
 {
-	if(dynamic_cast<const AndCondition *>(&parent) && !conditions.empty())
+	if(conditions.empty())
+		return 0;
+
+	bool intersect = dynamic_cast<const AndCondition *>(&parent);
+	RangeCondition<T> *result;
+	if(intersect)
+		result = new RangeCondition<T>(Traits::get_min(), Traits::get_max());
+	else
+		result = new RangeCondition<T>(Traits::get_max(), Traits::get_min());
+	for(std::vector<const Condition *>::const_iterator i=conditions.begin(); i!=conditions.end(); ++i)
 	{
-		RangeCondition<T> *result = new RangeCondition<T>(Traits::get_min(), Traits::get_max());
-		for(std::vector<Condition *>::const_iterator i=conditions.begin(); i!=conditions.end(); ++i)
+		const RangeCondition<T> *c = static_cast<const RangeCondition<T> *>(*i);
+		if(intersect)
 		{
-			const RangeCondition<T> *c = static_cast<RangeCondition<T> *>(*i);
 			result->min = std::max(result->min, c->min);
 			result->max = std::min(result->max, c->max);
 		}
-		return result;
+		else
+		{
+			result->min = std::min(result->min, c->min);
+			result->max = std::max(result->max, c->max);
+		}
 	}
-	else
-		return 0;
+	return result;
 }
 
 template<typename T>