multipath.cpp

// © Copyright 2010 - 2016 BlackTopp Studios Inc.
/* This file is part of The Mezzanine Engine.

    The Mezzanine Engine 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.

    The Mezzanine Engine 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 The Mezzanine Engine.  If not, see <http://www.gnu.org/licenses/>.
*/
/* The original authors have included a copy of the license specified above in the
   'Docs' folder. See 'gpl.txt'
*/
/* We welcome the use of the Mezzanine engine to anyone, including companies who wish to
   Build professional software and charge for their product.

   However there are some practical restrictions, so if your project involves
   any of the following you should contact us and we will try to work something
   out:
    - DRM or Copy Protection of any kind(except Copyrights)
    - Software Patents You Do Not Wish to Freely License
    - Any Kind of Linking to Non-GPL licensed Works
    - Are Currently In Violation of Another Copyright Holder's GPL License
    - If You want to change our code and not add a few hundred MB of stuff to
        your distribution

   These and other limitations could cause serious legal problems if you ignore
   them, so it is best to simply contact us or the Free Software Foundation, if
   you have any questions.

   Joseph Toppi - toppij@gmail.com
   John Blackwood - makoenergy02@gmail.com
*/
/*
 -----------------------------------------------------------------------------
 This source file is part of ogre-procedural

 For the latest info, see http://code.google.com/p/ogre-procedural/

 Copyright (c) 2010-2013 Michael Broutin

 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
 in the Software without restriction, including without limitation the rights
 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:

 The above copyright notice and this permission notice shall be included in
 all copies or substantial portions of the Software.

 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 -----------------------------------------------------------------------------
 */
#ifndef _graphicsproceduralmultipath_cpp
#define _graphicsproceduralmultipath_cpp

#include "Graphics/Procedural/multipath.h"
#include "Graphics/Procedural/path.h"

namespace Mezzanine
{
    namespace Graphics
    {
        namespace Procedural
        {
            ///////////////////////////////////////////////////////////////////////////////
            // PathCoordinate Methods

            PathCoordinate::PathCoordinate() :
                PathIndex(0),
                PointIndex(0)
                {  }

            PathCoordinate::PathCoordinate(const Whole Path, const Whole Point) :
                PathIndex(Path),
                PointIndex(Point)
                {  }

            PathCoordinate::~PathCoordinate()
                { }

            ///////////////////////////////////////////////////////////////////////////////
            // Comparison

            Boole PathCoordinate::operator<(const PathCoordinate& Other) const
            {
                if( this->PathIndex == Other.PathIndex ) return this->PointIndex < Other.PointIndex;
                else return this->PathIndex < Other.PathIndex;
            }

            ///////////////////////////////////////////////////////////////////////////////
            // MultiPath Methods

            MultiPath::MultiPath()
                {  }

            MultiPath::~MultiPath()
                {  }

            ///////////////////////////////////////////////////////////////////////////////
            // Utility

            MultiPath& MultiPath::SetPath(const Whole PathIndex, const Path& ToSet)
            {
                this->Paths.at(PathIndex) = ToSet;
                return *this;
            }

            MultiPath& MultiPath::CalculateIntersections()
            {
                this->Intersections.clear();
                this->UniqueIntersections.clear();
                std::map< Vector3, PathIntersection, Vector3LengthCompare > IntersectionMap;
                for( PathIterator PathIt = this->Paths.begin() ; PathIt != this->Paths.end() ; ++PathIt )
                {
                    const Point3DContainer& PathPoints = (*PathIt).GetPoints();
                    for( ConstPoint3DIterator PointIt = PathPoints.begin() ; PointIt != PathPoints.end() ; ++PointIt )
                    {
                        PathCoordinate Coord(PathIt - this->Paths.begin(),PointIt - PathPoints.begin());
                        if( IntersectionMap.find(*PointIt) == IntersectionMap.end() ) {
                            PathIntersection Intersect;
                            Intersect.push_back(Coord);
                            IntersectionMap[*PointIt] = Intersect;
                        }else{
                            IntersectionMap[*PointIt].push_back(Coord);
                        }
                    }
                }
                for( std::map< Vector3, PathIntersection, Vector3LengthCompare >::iterator IntersectionIt = IntersectionMap.begin() ; IntersectionIt != IntersectionMap.end() ; ++IntersectionIt )
                {
                    if( IntersectionIt->second.size() > 1 ) {
                        for( PathIntersection::iterator PointIt = IntersectionIt->second.begin() ; PointIt != IntersectionIt->second.end() ; ++PointIt )
                        {
                            this->UniqueIntersections[ *PointIt ] = IntersectionIt->second;
                        }
                        this->Intersections.push_back( IntersectionIt->second );
                    }
                }
                return *this;
            }

            MultiPath::PathSegmentContainer MultiPath::GetNoIntersectionParts(const Whole PathIndex) const
            {
                const Path& RetPath = this->Paths[PathIndex];
                PathSegmentContainer RetSegments;
                std::vector<Integer> TempIntersections;
                for( IntersectionMap::const_iterator IntersectIt = this->UniqueIntersections.begin() ; IntersectIt != this->UniqueIntersections.end() ; ++IntersectIt )
                {
                    if( (*IntersectIt).first.PathIndex == PathIndex ) {
                        TempIntersections.push_back( (*IntersectIt).first.PointIndex );
                    }
                }
                std::sort(TempIntersections.begin(),TempIntersections.end());
                Integer BeginIndex = 0;
                for( std::vector<Integer>::iterator IntersectIt = TempIntersections.begin() ; IntersectIt != TempIntersections.end() ; ++IntersectIt )
                {
                    if( (*IntersectIt) - 1 > BeginIndex ) {
                        RetSegments.push_back( PathSegment(BeginIndex,(*IntersectIt) - 1) );
                    }
                    BeginIndex = (*IntersectIt) + 1;
                }
                if( RetPath.GetSegCount() > BeginIndex ) {
                    RetSegments.push_back( PathSegment(BeginIndex,RetPath.GetSegCount()) );
                }
                return RetSegments;
            }

            ///////////////////////////////////////////////////////////////////////////////
            // Path Management

            MultiPath& MultiPath::AddPath(const Path& ToAdd)
            {
                this->Paths.push_back(ToAdd);
                return *this;
            }

            MultiPath& MultiPath::AddMultiPath(const MultiPath& Other)
            {
                for( ConstPathIterator PathIt = Other.Paths.begin() ; PathIt != Other.Paths.end() ; ++PathIt )
                {
                    this->Paths.push_back( *PathIt );
                }
                return *this;
            }

            Path& MultiPath::GetPath(const Whole Index)
            {
                return this->Paths.at(Index);
            }

            const Path& MultiPath::GetPath(const Whole Index) const
            {
                return this->Paths.at(Index);
            }

            Whole MultiPath::GetNumPaths() const
            {
                return this->Paths.size();
            }

            void MultiPath::RemoveAllPaths()
            {
                this->Paths.clear();
                this->Intersections.clear();
                this->UniqueIntersections.clear();
            }

            ///////////////////////////////////////////////////////////////////////////////
            // Intersection Management

            const MultiPath::IntersectionVector& MultiPath::GetIntersections() const
            {
                return this->Intersections;
            }

            const MultiPath::IntersectionMap& MultiPath::GetIntersectionsMap() const
            {
                return this->UniqueIntersections;
            }
        }//Procedural
    }//Graphics
}//Mezzanine

#endif