// Schedule ADT implementation

#include <stdio.h>
#include <stdlib.h>

#include "Schedule.h"
#include "Time.h"
#include "Tree.h"

struct schedule {
    Tree times;
    int  count;
};

// Creates a new schedule
Schedule ScheduleNew(void) {
    Schedule s = malloc(sizeof(*s));
    if (s == NULL) {
        fprintf(stderr, "Insufficient memory!\n");
        exit(EXIT_FAILURE);
    }

    s->times = TreeNew();
    s->count = 0;
    return s;
}

// Frees all memory associated with a given schedule
void ScheduleFree(Schedule s) {
    TreeFree(s->times);
    free(s);
}

// Gets the number of times added to the schedule
int  ScheduleCount(Schedule s) {
    return s->count;
}

// Attempts to schedule a new landing time. Returns true if the time was
// successfully added, and false otherwise.
bool ScheduleAdd(Schedule s, Time t) {
    Time lower = TimeSubtractMinutes(t, 10);
    Time upper = TimeAddMinutes(t, 10);

    Time floor = TreeFloor(s->times, t);
    Time ceiling = TreeCeiling(s->times, t);
    
    bool result;
	
	if (floor != NULL && TimeCmp(floor, lower) >= 0) {
		result = false;
	} else if (ceiling != NULL && TimeCmp(ceiling, upper) <= 0) {
		result = false;
	} else {
		TreeInsert(s->times, t);
        s->count++;
        result = true;
	}

    TimeFree(lower);
    TimeFree(upper);
    return result;
}

// Shows  all  the landing times in the schedule. If mode is 1, only the
// times are shown. If mode is 2, the underlying data structure is shown
// as well.
void ScheduleShow(Schedule s, int mode) {
    if (mode == 1) {
        TreeList(s->times);
    } else if (mode == 2) {
        TreeShow(s->times);
    }
}