// A simple database
// database.h
// by 
// K. J. Rock
// November 11, 2018
// for
// Bacona Design LLC

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

char *man[100];	// array of pointers to 100 men's names
char *woman[100]; // array of pointers to 100 women's names	
char str[80];		// string buffer allocated from stack and uses 80 chars
int dummy;			// throw away excess digit in each record of the file
char *s;				// allocated from heap and can be quite large

struct data			// create an employee record
	{
	int id;
	int age;      	// min 20  max 70
	float salary;	// min $30,000 max $95,000
	int seniority;	// years of service  0 - 45
	char *name;		// first name so we can install string tools
	// need names, dates, telephone numbers, text information
	};

struct node    	// create a node structure for the linked list
	{
	struct data *data;   				// these two data's are not the same.
	struct node *next, *prev;     	// for doubly linked list
	struct node *Tnext, *Tprev;   	// for creating temp lists for storage
//  struct node *left, *right;  		// for tree in the future
	};

struct node *head, *tail, *ep;  		// head, tail, & employee pointers
struct node *Thead, *Ttail, *Tep; 	// pointers for alternate list thread