libs/flake/KoPathPointData.h

0001 /* This file is part of the KDE project
0002    Copyright (C) 2006 Thorsten Zachmann <zachmann@kde.org>
0003    Copyright (C) 2007 Thomas Zander <zander@kde.org>
0004
0005    This library is free software; you can redistribute it and/or
0006    modify it under the terms of the GNU Library General Public
0007    License as published by the Free Software Foundation; either
0008    version 2 of the License, or (at your option) any later version.
0009
0010    This library is distributed in the hope that it will be useful,
0011    but WITHOUT ANY WARRANTY; without even the implied warranty of
0012    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
0013    Library General Public License for more details.
0014
0015    You should have received a copy of the GNU Library General Public License
0016    along with this library; see the file COPYING.LIB.  If not, write to
0017    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
0018  * Boston, MA 02110-1301, USA.
0019 */
0020
0021 #ifndef KOPATHPOINTDATA_H
0022 #define KOPATHPOINTDATA_H
0023
0024 #include "KoPathShape.h"
0025
0026 /**
0027  * @brief Describe a KoPathPoint by a KoPathShape and its indices
0028  */
0029 class KoPathPointData
0030 {
0031 public:
0032     /// constructor
0033     KoPathPointData(KoPathShape * path, const KoPathPointIndex & pointIndex)
0034             : pathShape(path)
0035             , pointIndex(pointIndex) {}
0036
0037     /// operator used for sorting
0038     bool operator<(const KoPathPointData & other) const {
0039         return pathShape < other.pathShape ||
0040                (pathShape == other.pathShape &&
0041                 (pointIndex.first < other.pointIndex.first ||
0042                  (pointIndex.first == other.pointIndex.first &&
0043                   pointIndex.second < other.pointIndex.second)));
0044
0045     }
0046     bool operator==(const KoPathPointData & other) const {
0047         return pathShape == other.pathShape &&
0048                pointIndex.first == other.pointIndex.first &&
0049                pointIndex.second == other.pointIndex.second;
0050     }
0051     /// path shape the path point belongs too
0052     KoPathShape *pathShape;
0053     /// position of the point in the path shape
0054     KoPathPointIndex pointIndex;
0055 };
0056
0057 #endif