public void copy(agelist in_agelist)
{
if (in_agelist == null)
{
return;
}
this.copy(in_agelist.agevector);
}
//Kill all trees bounded by l and h if and only if the age is present in a.
public void kill(int l, int h, agelist a)
{
int num = (int)TimeStep;
for (int i = l; i <= h; i += num)
{
if (a.query(i))
{
reset(i);
}
}
}
public agelist(agelist in_agelist)
{
this.copy(in_agelist);
}
