ConstHashIterator.h

Go to the documentation of this file.

/*
 * Copyright (C) 2019 Niek Linnenbank
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef __LIBSTD_CONSTHASHITERATOR_H
#define __LIBSTD_CONSTHASHITERATOR_H
 
#include "Macros.h"
#include "Types.h"
#include "ConstIterator.h"
#include "ListIterator.h"
#include "HashTable.h"
#include "Assert.h"
 
template <class K, class V> class ConstHashIterator : public ConstIterator<V>
{
  public:
 
    ConstHashIterator(const HashTable<K, V> & hash)
        : m_hash(hash), m_keys(hash.keys()), m_iter(m_keys)
    {
    }
 
    virtual ~ConstHashIterator()
    {
    }
 
    virtual void reset()
    {
        m_iter.reset();
    }
 
    virtual bool hasNext() const
    {
        return m_iter.hasNext();
    }
 
    virtual bool hasCurrent() const
    {
        return m_iter.hasCurrent();
    }
 
    virtual const V & current() const
    {
        return m_hash[m_iter.current()];
    }
 
    virtual const K & key() const
    {
        return m_iter.current();
    }
 
    virtual const V & next()
    {
        return m_hash[m_iter.next()];
    }
 
    virtual void operator ++(int num)
    {
        m_iter++;
    }
 
  private:
 
    const HashTable<K, V> & m_hash;
 
    List<K> m_keys;
 
    ListIterator<K> m_iter;
};
 
#endif /* __LIBSTD_HASHITERATOR_H */