#include <QtCore/qhash.h>
#ifndef QHASH_H
template < typename Key, typename T > class QHashIterator{
   private: class QHash < Key, T > c;
   private: inline bool item_exists() const
   private: typename QHash < Key, T >::const_iterator i;
   public: inline QHashIterator(class QHash < Key, T > const & container);
   private: typename QHash < Key, T >::const_iterator n;
   public: inline class QHashIterator& operator =(class QHash < Key, T > const & container);
   public: inline void toFront();
   private: typedef typename QHash < Key, T >::const_iterator const_iterator;
   public: inline void toBack();
   private: typedef typename QHash < Key, T >::const_iterator Item;
   public: inline bool hasNext() const
   public: inline typename QHash < Key, T >::const_iterator next();
   public: inline typename QHash < Key, T >::const_iterator peekNext() const
   public: inline bool hasPrevious() const
   public: inline typename QHash < Key, T >::const_iterator previous();
   public: inline typename QHash < Key, T >::const_iterator peekPrevious() const
   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