// ====== this is in data.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "data.h"

// Input: ’in_name’: a string ends with ’\0’
//        ’in_id’: an integer
// Output: a pointer of type pointer to Key,
//         pointing to an allocated memory containing a Key
// Effect: dynamically allocate memory to hold a Key
//         set Key’s id to be in_id
//         dynamically allocate memory for the Key’s name
//         so that name will contain what is in ’in_name’.
// Note: do not use strdup(), use malloc(), strlen(), and strcpy()
Key *key_construct(char *in_name, int in_id) {
    /*
        - first use malloc(sizeof(Key))
            - This dynamically allocate memory the size of the Key
        - next use malloc((strlen(in_name)+1)*sizeof(char))
            - This dynamically allocates memory the size of the in_name string
        - then use strcpy()

    */

    Key* keyPoint = (Key*)malloc((sizeof(Key)));

    if (keyPoint == NULL) {
        printf("Error: Memory Allocation Failure\n");
        exit(EXIT_FAILURE);
    }
    else {
        keyPoint->id = in_id;
        keyPoint->name = (char*)malloc((strlen(in_name) + 1) * sizeof(char));
        strcpy(&keyPoint->name, in_name);
    }

    return keyPoint;



}

// Input: ’key1’ and ’key2’ are two pointers to Key
// Output: if return value < 0, then *key1 < *key2,
//         if return value = 0, then *key1 = *key2,
//         if return value > 0, then *key1 > *key2,
// Note: use strcmp() to compare key1->name and key2->name
//       if key1->name == key2->name, then compare key1->id with key2->id
int key_comp(Key *key1, Key *key2) {
    int value = strcmp(key1->name, key2->name);

    if (value < 0) {
        return -1;
    }
    else if (value > 0) {
        return 1;
    }
    else {
        if (key1->id < key2->id) {
            return -1;
        }
        else if (key1->id == key2->id) {
            return 0;
        }
        else {
            return 1;
        }
    }
}

// Input: ’key’: a pointer to Key
// Effect: ( key->name key->id ) is printed
void print_key(Key *key) {
    printf("(%s %i)", key->name, key->id);
}

// Input: ’node’: a node
// Effect: node.key is printed and then the node.data is printed
void print_node(Node node) {
    print_key(node.key);
    printf(" %i", node.data);
}