Method hpUpdateTree

src/Scheduler.cpp:264–293

}

void Scheduler::hpUpdateTree(){

	/* TODO:
	The tree should only contain processes that are active during the 
	current block. ProcessNodes still in the future should be kept in a 
	separate list and added to the tree when their time comes.
	In order to avoid scanning the whole list of future events, the events
	should be sorted according to their activation time. It is probably
	better to use absolute times rather than delta times so we don't
	have to perform any arithmetic to update timing status of the events.
	
	We should also avoid allocating memory for future ProcessNodes until when they
	are actually used. This will also allow us to use memory pools.
	*/

	while(!mAddCommands.empty()){
		Command& c = mAddCommands.front();
		
		switch(c.type){
		case Command::ADD_FIRST_CHILD:
			c.object->addFirstChild(c.other);
			break;
		case Command::ADD_LAST_CHILD:
			c.object->addLastChild(c.other);
			break;
		default:;
		}
		mAddCommands.pop();
	}	
}

void Scheduler::hpUpdateFreeList(){