+protected:
+ bool match_same_type(const basic & other) const;
+
+ // non-virtual functions in this class
+public:
+ /** Check whether the index is dotted. */
+ bool is_dotted() const {return dotted;}
+
+ /** Check whether the index is not dotted. */
+ bool is_undotted() const {return !dotted;}
+
+ /** Make a new index with the same value and variance but the opposite
+ * dottedness. */
+ ex toggle_dot() const;
+
+ /** Make a new index with the same value but opposite variance and
+ * dottedness. */
+ ex toggle_variance_dot() const;
+
+protected:
+ void do_print(const print_context & c, unsigned level) const;
+ void do_print_latex(const print_latex & c, unsigned level) const;
+ void do_print_tree(const print_tree & c, unsigned level) const;
+
+ // member variables
+protected:
+ bool dotted;
+};
+
+
+// utility functions
+
+/** Specialization of is_exactly_a<idx>(obj) for idx objects. */
+template<> inline bool is_exactly_a<idx>(const basic & obj)
+{
+ return obj.tinfo()==TINFO_idx;
+}
+
+/** Specialization of is_exactly_a<varidx>(obj) for varidx objects. */
+template<> inline bool is_exactly_a<varidx>(const basic & obj)
+{
+ return obj.tinfo()==TINFO_varidx;
+}
+
+/** Specialization of is_exactly_a<spinidx>(obj) for spinidx objects. */
+template<> inline bool is_exactly_a<spinidx>(const basic & obj)
+{
+ return obj.tinfo()==TINFO_spinidx;
+}
+
+/** Check whether two indices form a dummy pair. */
+bool is_dummy_pair(const idx & i1, const idx & i2);
+
+/** Check whether two expressions form a dummy index pair. */
+bool is_dummy_pair(const ex & e1, const ex & e2);
+
+/** Given a vector of indices, split them into two vectors, one containing
+ * the free indices, the other containing the dummy indices (numeric
+ * indices are neither free nor dummy ones).
+ *
+ * @param it Pointer to start of index vector
+ * @param itend Pointer to end of index vector
+ * @param out_free Vector of free indices (returned, sorted)
+ * @param out_dummy Vector of dummy indices (returned, sorted) */
+void find_free_and_dummy(exvector::const_iterator it, exvector::const_iterator itend, exvector & out_free, exvector & out_dummy);
+
+/** Given a vector of indices, split them into two vectors, one containing
+ * the free indices, the other containing the dummy indices (numeric
+ * indices are neither free nor dummy ones).
+ *
+ * @param v Index vector
+ * @param out_free Vector of free indices (returned, sorted)
+ * @param out_dummy Vector of dummy indices (returned, sorted) */
+inline void find_free_and_dummy(const exvector & v, exvector & out_free, exvector & out_dummy)
+{
+ find_free_and_dummy(v.begin(), v.end(), out_free, out_dummy);
+}
+
+/** Given a vector of indices, find the dummy indices.
+ *
+ * @param v Index vector
+ * @param out_dummy Vector of dummy indices (returned, sorted) */
+inline void find_dummy_indices(const exvector & v, exvector & out_dummy)
+{
+ exvector free_indices;
+ find_free_and_dummy(v.begin(), v.end(), free_indices, out_dummy);
+}
+
+/** Count the number of dummy index pairs in an index vector. */
+inline size_t count_dummy_indices(const exvector & v)
+{
+ exvector free_indices, dummy_indices;
+ find_free_and_dummy(v.begin(), v.end(), free_indices, dummy_indices);
+ return dummy_indices.size();
+}
+
+/** Count the number of dummy index pairs in an index vector. */
+inline size_t count_free_indices(const exvector & v)
+{
+ exvector free_indices, dummy_indices;
+ find_free_and_dummy(v.begin(), v.end(), free_indices, dummy_indices);
+ return free_indices.size();
+}