#include <QtCore/qhash.h>
#ifndef QHASH_H
template < typename Key, typename T > class QMutableHashIterator{
   private: QHash < Key, T >* c;
   private: inline bool item_exists() const
   private: typename QHash < Key, T >::iterator i;
   public: inline QMutableHashIterator(class QHash < Key, T >& container);
   private: typename QHash < Key, T >::iterator n;
   public: inline ~QMutableHashIterator();
   public: inline class QMutableHashIterator& operator =(class QHash < Key, T >& container);
   private: typedef typename QHash < Key, T >::iterator iterator;
   public: inline void toFront();
   private: typedef typename QHash < Key, T >::const_iterator const_iterator;
   public: inline void toBack();
   private: typedef typename QHash < Key, T >::iterator Item;
   public: inline bool hasNext() const
   public: inline typename QHash < Key, T >::iterator next();
   public: inline typename QHash < Key, T >::iterator peekNext() const
   public: inline bool hasPrevious() const
   public: inline typename QHash < Key, T >::iterator previous();
   public: inline typename QHash < Key, T >::iterator peekPrevious() const
   public: inline void remove();
   public: inline void setValue(T const & t);
   public: inline T& value();
   public: inline T const & value() const
   public: inline Key const & key() const
   public: inline bool findNext(T const & t);
   public: inline bool findPrevious(T const & t);
};
#endif // QHASH_H