X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fpolynomial%2Fcollect_vargs.h;h=a927c3f5ed1f410d67eb256bef2e9b09172f4fbf;hp=44c3d72cae16b654c0b53e8f5a6e4585fa624aeb;hb=6201dc3c6562e0b8c174129af382fd5745de048f;hpb=c28e61da33905ddc69abf893aaffec98aa30d053

diff --git a/ginac/polynomial/collect_vargs.h b/ginac/polynomial/collect_vargs.h
index 44c3d72c..a927c3f5 100644
--- a/ginac/polynomial/collect_vargs.h
+++ b/ginac/polynomial/collect_vargs.h
@@ -28,10 +28,34 @@
 #include <cln/integer.h>
 #include <utility> // for std::pair
 #include <vector>
+#include <algorithm> // std::lexicographical_compare
 
 namespace GiNaC {
 
 typedef std::vector<int> exp_vector_t;
+
+static inline bool operator<(const exp_vector_t& v1, const exp_vector_t& v2)
+{
+	return std::lexicographical_compare(v1.rbegin(), v1.rend(),
+					    v2.rbegin(), v2.rend());
+}
+
+static inline bool operator>(const exp_vector_t& v1, const exp_vector_t& v2)
+{
+	if (v1 == v2)
+		return false;
+	return !(v1 < v2);
+}
+
+static inline bool zerop(const exp_vector_t& v)
+{
+	for (exp_vector_t::const_reverse_iterator i = v.rbegin(); i != v.rend(); ++i) {
+		if (*i != 0) 
+			return false;
+	}
+	return true;
+}
+
 typedef std::vector<std::pair<exp_vector_t, ex> > ex_collect_t;
 
 extern void
@@ -46,6 +70,13 @@ ex_collect_to_ex(const ex_collect_t& ec, const exvector& x);
  */
 extern ex lcoeff_wrt(ex e, const exvector& x);
 
+
+/**
+ * Degree vector of a leading term of a multivariate polynomial.
+ * (generalization of degree(expr, var))
+ */
+extern exp_vector_t degree_vector(ex e, const exvector& vars);
+
 /**
  * Leading coefficient c \in R (where R = Z or Z_p) of a multivariate
  * polynomial e \in R[x_0, \ldots, x_n]