Loader.cxx

#include <fstream>
#include <algorithm>
#include <iostream>

#include "Loader.hxx"

/**
 * Constructor
 */
Loader::Loader(std::list<Task*>* taskList, std::string fileName) :
                                    loadedTasks(taskList) {
    std::ifstream inFile;
    inFile.open(fileName);
    inFile.ignore(512,'\n');

    //start time, length, deadline, priority, block period, blcok length
    unsigned long start, length, deadline, priority, blockPeriod, blockLength;

    while(inFile>>start) {
        inFile>>length;
        inFile>>deadline;
        inFile>>priority;
        inFile>>blockPeriod;
        inFile>>blockLength;
        unloadedTasks.push_back(new Task(length, start,deadline,
                                         priority,blockPeriod,blockLength));
    }
    unloadedTasks.sort(
        [](Task* a,Task* b){ return a->getSpawnTime() < b->getSpawnTime();});
}

/**
 * Destructor
 * Cleans up any unloaded tasks
 */
Loader::~Loader() {
    std::for_each(unloadedTasks.begin(),unloadedTasks.end(),
        [](Task* a){delete a;});
}


/**
 * Iterates through unloaded tasks to check if any need to be loaded to active list
 */
void Loader::update(int time) {
    //std::cout<<unloadedTasks.size()<<std::endl;
    while(unloadedTasks.size() && (*unloadedTasks.begin())->getSpawnTime() <= time){        //non empty and first should spawn
        (*unloadedTasks.begin())->setTimeStarted(time); 
        (*unloadedTasks.begin())->setTimeLastRun(time);                                     //set task time started
        loadedTasks->push_back(*unloadedTasks.begin());                                     //push task onto scheduler's queue

        unloadedTasks.pop_front();                                                          //pop from unloaded
    }
}