迭代删除

for (Iter1 = m_ElemList.begin(); Iter1 != m_ElemList.end(); Iter1++)
{
LineList *lst=NULL;
if (i == iRow)
{
lst = &(*Iter1);
int j = 0;
for (Iter2 = lst->begin(); Iter2 != lst->end(); Iter2++)
{
if (j == iCol)
{
if ((*Iter2)->m_ElemType == PRE)//当为PRE时，向前找到该元素
{
do {
Iter2--;
j--;
} while ((*Iter2)->m_ElemType == PRE);
}
int iunit = (*Iter2)->m_iUnitSize;

int iSize = lst->size();
if (iSize == j + iunit)//当前元素为最后元素，则删除
{
for (int i = 0; i<iunit; i++) //删除后面空元素
{
if (lst->size()>0)
{ Iter2 = lst->erase(Iter2);}

}

if (lst->size()>0)
Iter2--;
while (lst->size()>0 && (*Iter2)->m_ElemType == NONE) //删除前面空元素
{
Iter2 = lst->erase(Iter2);
if (lst->size()>0)
{
Iter2--;
}

}
SR_SetRungEdit(i, true);
SR_CalRungSM();
return true;
}
else //不是最后元素，则置空
{
QLadderDiagramItem ee;
(*Iter2)->Copy(&ee);
for (int i = 1; i<iunit; i++)
{
Iter2++;
(*Iter2)->Copy(&ee);

}
// SR_SetRungEdit(i, true);
// SR_CalRungSM();
return true;
}
}
j++;
}
}
i++;
}

转载于:https://www.cnblogs.com/ShiShouTHS/p/11237681.html