本文整理汇总了C++中KoPathShape::moveSubpath方法的典型用法代码示例。如果您正苦于以下问题：C++ KoPathShape::moveSubpath方法的具体用法？C++ KoPathShape::moveSubpath怎么用？C++ KoPathShape::moveSubpath使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类KoPathShape的用法示例。
在下文中一共展示了KoPathShape::moveSubpath方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: redo
void KoSubpathJoinCommand::redo()
{
KUndo2Command::redo();
KoPathShape * pathShape = m_pointData1.pathShape;
bool closeSubpath = m_pointData1.pointIndex.first == m_pointData2.pointIndex.first;
KoPathPoint * point1 = pathShape->pointByIndex(m_pointData1.pointIndex);
KoPathPoint * point2 = pathShape->pointByIndex(m_pointData2.pointIndex);
// if the endpoint is has a control point create a contol point for the new segment to be
// at the symetric position to the exiting one
if (m_reverse & ReverseFirst || closeSubpath) {
if (point1->activeControlPoint2())
point1->setControlPoint1(2.0 * point1->point() - point1->controlPoint2());
} else if (point1->activeControlPoint1())
point1->setControlPoint2(2.0 * point1->point() - point1->controlPoint1());
if (m_reverse & ReverseSecond || closeSubpath) {
if (point2->activeControlPoint1())
point2->setControlPoint2(2.0 * point2->point() - point2->controlPoint1());
} else if (point2->activeControlPoint2())
point2->setControlPoint1(2.0 * point2->point() - point2->controlPoint2());
if (closeSubpath) {
pathShape->closeSubpath(m_pointData1.pointIndex);
} else {
if (m_reverse & ReverseFirst) {
pathShape->reverseSubpath(m_pointData1.pointIndex.first);
}
if (m_reverse & ReverseSecond) {
pathShape->reverseSubpath(m_pointData2.pointIndex.first);
}
pathShape->moveSubpath(m_pointData2.pointIndex.first, m_pointData1.pointIndex.first + 1);
m_splitIndex = m_pointData1.pointIndex;
m_splitIndex.second = pathShape->subpathPointCount(m_pointData1.pointIndex.first) - 1;
pathShape->join(m_pointData1.pointIndex.first);
}
pathShape->normalize();
pathShape->update();
}示例2: undo
void KoSubpathJoinCommand::undo()
{
KUndo2Command::undo();
KoPathShape * pathShape = m_pointData1.pathShape;
pathShape->update();
if (m_pointData1.pointIndex.first == m_pointData2.pointIndex.first) {
pathShape->openSubpath(m_pointData1.pointIndex);
} else {
pathShape->breakAfter(m_splitIndex);
pathShape->moveSubpath(m_pointData1.pointIndex.first + 1, m_pointData2.pointIndex.first);
if (m_reverse & ReverseSecond) {
pathShape->reverseSubpath(m_pointData2.pointIndex.first);
}
if (m_reverse & ReverseFirst) {
pathShape->reverseSubpath(m_pointData1.pointIndex.first);
}
}
KoPathPoint * point1 = pathShape->pointByIndex(m_pointData1.pointIndex);
KoPathPoint * point2 = pathShape->pointByIndex(m_pointData2.pointIndex);
// restore the old end points
if (m_reverse & ReverseFirst)
point1->setControlPoint1(pathShape->documentToShape(m_oldControlPoint1));
else
point1->setControlPoint2(pathShape->documentToShape(m_oldControlPoint1));
point1->setProperties(m_oldProperties1);
if (m_reverse & ReverseSecond)
point2->setControlPoint1(pathShape->documentToShape(m_oldControlPoint2));
else
point2->setControlPoint2(pathShape->documentToShape(m_oldControlPoint2));
point2->setProperties(m_oldProperties2);
pathShape->normalize();
pathShape->update();
}