本文整理汇总了C++中OrderedTaskPoint::IsSuccessorAllowed方法的典型用法代码示例。如果您正苦于以下问题：C++ OrderedTaskPoint::IsSuccessorAllowed方法的具体用法？C++ OrderedTaskPoint::IsSuccessorAllowed怎么用？C++ OrderedTaskPoint::IsSuccessorAllowed使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类OrderedTaskPoint的用法示例。
在下文中一共展示了OrderedTaskPoint::IsSuccessorAllowed方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: SetNeighbours
bool
OrderedTask::Replace(const OrderedTaskPoint &new_tp, const unsigned position)
{
if (position >= task_points.size())
return false;
if (task_points[position]->Equals(new_tp))
// nothing to do
return true;
/* is the new_tp allowed in this context? */
if ((position > 0 && !new_tp.IsPredecessorAllowed()) ||
(position + 1 < task_points.size() && !new_tp.IsSuccessorAllowed()))
return false;
delete task_points[position];
task_points[position] = new_tp.Clone(task_behaviour, ordered_behaviour);
if (position)
SetNeighbours(position - 1);
SetNeighbours(position);
if (position + 1 < task_points.size())
SetNeighbours(position + 1);
UpdateGeometry();
return true;
}示例2: Append
bool
OrderedTask::Insert(const OrderedTaskPoint &new_tp, const unsigned position)
{
if (position >= task_points.size())
return Append(new_tp);
if (/* is the new_tp allowed in this context? */
(position > 0 && !new_tp.IsPredecessorAllowed()) ||
!new_tp.IsSuccessorAllowed() ||
/* can a tp be inserted at this position? */
(position > 0 && !task_points[position - 1]->IsSuccessorAllowed()) ||
!task_points[position]->IsPredecessorAllowed())
return false;
if (active_task_point >= position)
active_task_point++;
task_points.insert(task_points.begin() + position,
new_tp.Clone(task_behaviour, ordered_behaviour));
if (position)
SetNeighbours(position - 1);
SetNeighbours(position);
SetNeighbours(position + 1);
UpdateGeometry();
return true;
}