public void InitData()
{
TBaseWorkShape WS;
TBaseShape TFE;
TGlsBinaryTree BTree = new TGlsBinaryTree(OPM_CompareNode);
for (int i = 0; i <= MassWork.Count - 1; i++)
{
WS = (TBaseWorkShape)(MassWork.GetItems(i));
for (int j = 0; j <= WS.WorkShapesCount - 1; j++)
{
TFE = (TBaseShape)(WS.GetWorkShape(j));
BTree.insert(TFE);
}
}
MassWork.Clear();
BTree.inorder(OPM_Inorder);
// delete BTree;
CheckCol();
}
void DoCreateBasis()
{
TGlsBinaryTree mTree;
TAlternativeParserGrpItemTFS Tfs;
TAlternativeParserGrpItemList Item;
TDynamicArray D = new TDynamicArray();
SharedConst.lc = new List <object>();
f_Basis.Clear();
for (int i = 0; i <= Count - 1; i++)
{
Item = GetItems(i);
for (int j = 0; j <= Item.Count - 1; j++)
{
Tfs = Item.GetItems(j);
if (D.Find(Tfs.TFS) == null)
{
MessageBox.Show("ДЕЛАЮ на УГАД, эту строчку НУЖНО ДЕБАЖИТЬ", "Ошибка", MessageBoxButtons.OK, MessageBoxIcon.Warning);
}
// D.AppendInteger((int)Tfs, Tfs.TFS); // ХЗ ДЕЛАЮ на УГАД, эту строчку НУЖНО ДЕБАЖИТЬ
}
}
mTree = new TGlsBinaryTree(SharedConst.APC_CompareNode);
for (int i = 0; i <= D.Count - 1; i++)
{
object tmp = D.GetPosition(i).Int_Value;
Tfs = (TAlternativeParserGrpItemTFS)tmp;
mTree.insert(Tfs);
}
mTree.inorder(SharedConst.APC_Inorder);
for (int i = 0; i <= SharedConst.lc.Count - 1; i++)
{
Tfs = (TAlternativeParserGrpItemTFS)(SharedConst.lc.ElementAt(i));
f_Basis.Add(Tfs);
}
mTree = null;
D = null;
SharedConst.lc = null;
}
public TGraphTFEConvertor()
{
f_Item = new TGraphTFEConvertorItem();
f_BTree = new TGlsBinaryTree(SharedConst.CompareNode);
f_Tran = new TGraphTFEConvertorTransNum();
}
