townarray.cpp

/***************************************************************************
                           townarray.cpp
                           -------------------
    begin                : 2005-01-16
    copyright            : (C) 2005 by Dominik Haumann
    email                : dhaumann@users.sourceforge.net
 ***************************************************************************/

/***************************************************************************
 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 2
 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, write to the Free Software
 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 ***************************************************************************/

#include "townarray.h"

namespace WDS
{

CTownArray::CTownArray()
{
}

CTownArray::~CTownArray()
{
    clear();
}

CTown* CTownArray::get(int x, int y)
{
    TownArray::iterator it1 =  m_towns.find(x);

    if ( it1 != m_towns.end() ) {
        map <int, CTown*>::iterator it2 = it1->second.find(y);

        if ( it2 != it1->second.end() ) {
            return it2->second;
        }
    }

    return 0L;
}

void CTownArray::set(int x, int y, CTown town)
{
    CTown* entry = m_towns[x][y];

    if ( entry == 0L )
        m_towns[x][y] = new CTown(town);
    else *m_towns[x][y] = town;
}

void CTownArray::erase(int x, int y)
{
    TownArray::iterator it1 = m_towns.find(x);

    if ( it1 != m_towns.end() ) {
        map <int, CTown*>::iterator it2 = it1->second.find(y);

        if ( it2 != it1->second.end() ) {
            delete it2->second;

            it1->second.erase(it2);

            if ( it1->second.size() == 0 ) {
                m_towns.erase(it1);
            }
        }
    }
}

void CTownArray::clear()
{
    TownArray::iterator it1 = m_towns.begin();

    while ( it1 != m_towns.end() ) {
        map <int, CTown*>::iterator it2 = it1->second.begin();

        while ( it2 != it1->second.end() ) {
            delete it2->second;

            it2++;
        }

        it1++;
    }
    m_towns.clear();
}

unsigned int CTownArray::size()
{
    int s = 0;

    TownArray::iterator it1 = m_towns.begin();

    while ( it1 != m_towns.end() ) {
        s += it1->second.size();

        it1++;
    }

    return s;
}

CTown* CTownArray::firstSibling()
{
    m_first = m_towns.begin();
    while ( m_first != m_towns.end() ) {
        m_second = m_first->second.begin();

        if ( m_second != m_first->second.end() ) {
            return m_second->second;
        }

        m_first++;
    }

    return 0L;
}

CTown* CTownArray::nextSibling()
{
    if ( m_first == m_towns.end() ) {
        return 0L;
    } else {
        if ( m_second != m_first->second.end() ) {
            m_second++;
            if ( m_second != m_first->second.end() ) {
                return m_second->second;
            } else {
                return nextSibling();
            }
        } else {
            m_first++;
            if ( m_first != m_towns.end() ) {
                m_second = m_first->second.begin();
                if ( m_second != m_first->second.end() ) {
                    return m_second->second;
                } else {
                    return nextSibling();
                }
            } else {
                return 0L;
            }
        }
    }

    return 0L;
}

}

// kate: space-indent off; tab-width 4; replace-tabs off;

---