internal Section(Section original, Section parent, CuttingScheme scheme)
{
m_data = original.m_data;
m_nestedSections = new LinkedList <Section>();
foreach (Section nsec in original.m_nestedSections)
{
m_nestedSections.AddLast(new Section(nsec, this, scheme));
}
m_parent = parent;
m_scheme = scheme;
}
public CuttingScheme(CuttingScheme orig)
{
m_rootSection = new Section(orig.m_rootSection, null, this);
if (orig.m_parameters != null)
{
m_parameters = orig.m_parameters.Clone();
}
if (orig.m_material != null)
{
m_material = (Material)orig.m_material.Clone();
}
if (orig.m_sheet != null)
{
m_sheet = (Sheet)orig.m_sheet.Clone();
}
}
public CuttingScheme(CuttingScheme orig)
{
m_rootSection = new Section(orig.m_rootSection, null, this);
if (orig.m_parameters != null)
{
m_parameters = orig.m_parameters.Clone();
}
if (orig.m_material != null)
{
m_material = (Material)orig.m_material.Clone();
}
if (orig.m_sheet != null)
{
m_sheet = (Sheet)orig.m_sheet.Clone();
}
}
unsafe public void LoadSections(_Layout * input, CuttingScheme output)
{
m_result = output;
Recursive(input, output.RootSection);
}
internal Section(Section original, Section parent, CuttingScheme scheme)
{
m_data = original.m_data;
m_nestedSections = new LinkedList<Section>();
foreach (Section nsec in original.m_nestedSections)
{
m_nestedSections.AddLast(new Section(nsec, this, scheme));
}
m_parent = parent;
m_scheme = scheme;
}
internal Section(CuttingScheme scheme)
{
m_nestedSections = new LinkedList<Section>();
m_scheme = scheme;
}
public bool BetterThan(CuttingScheme best_result)
{
throw new NotImplementedException();
}
internal Section(CuttingScheme scheme)
{
m_nestedSections = new LinkedList <Section>();
m_scheme = scheme;
}
public bool BetterThan(CuttingScheme best_result)
{
throw new NotImplementedException();
}
