edge.h

Go to the documentation of this file.

/*
 * edge.h
 *
 * Copyright (C) 2011 Atomic Blue (info@planeshift.it, http://www.atomicblue.org) 
 *
 *
 * 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 (version 2 of the License)
 * 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.
 *
 */
#ifndef __EDGE_H__
#define __EDGE_H__

#include "util/pspath.h"
#include "util/pspathnetwork.h"

// Forward declaration of types
class psPathPoint;

class Edge
{
private:

    psPath*            path;          
    psPath::Direction  direction;     

    Waypoint*          startWaypoint; 
    Waypoint*          endWaypoint;   

public:

    Edge(psPath* path, psPath::Direction direction);
    

    virtual ~Edge();


    psPathPoint* GetStartPoint();

    psPathPoint* GetEndPoint();

    psPath* GetPath() { return path; }

    psPath::Direction GetDirection() { return direction; }
    
    Waypoint* GetStartWaypoint();

    Waypoint* GetEndWaypoint();

    Edge* GetRandomEdge(const psPathNetwork::RouteFilter* routeFilter);

    bool IsTeleport() const;

    bool NoWander() const;

    class Iterator
    {
      public:
        Iterator(){};

        virtual ~Iterator(){};

        virtual bool HasNext() = 0;

        virtual psPathPoint* Next() = 0;
    };

    Iterator* GetIterator();

protected:

    class ForwardIterator: public Iterator
    {
      private:
        psPath::PathPointArray::Iterator pointIterator;
      public:

        ForwardIterator(Edge* edge):
            pointIterator(edge->path->points.GetIterator())
        {
        }

        virtual bool HasNext()
        {
            return pointIterator.HasNext();
        }

        virtual psPathPoint* Next()
        {
            return pointIterator.Next();
        }
    };

    class ReverseIterator: public Iterator
    {
      private:
        psPath::PathPointArray::ReverseIterator pointIterator;
      public:

        ReverseIterator(Edge* edge):
            pointIterator(edge->path->points.GetReverseIterator())
        {
        }

        virtual bool HasNext()
        {
            return pointIterator.HasNext();
        }

        virtual psPathPoint* Next()
        {
            return pointIterator.Next();
        }
    };

};

#endif