Added unit tests for random number generator functions.

Author: steven-schronk

Makefile

@@ -1,6 +1,6 @@
 CC = gcc
 
-OBJS = lib_test.o lib_ll.o lib_sort.o lib_vbtree.o
+OBJS = lib_test.o lib_hash.o lib_ll.o lib_random.o lib_sort.o lib_vbtree.o
 PROG = dstruct
 INSTALLDIR = /usr/local/bin
 

lib_hash.c

@@ -0,0 +1,114 @@
+#include <assert.h>
+#include <limits.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "lib_hash.h"
+
+int is_prime(int num)
+{
+	int i;
+	assert(num >= 0);
+	if(num == 1 || num == 0) return 0;
+	for(i = 2 ; i <= num / 2; i++)
+		if(num % i == 0) return 0;
+	return 1;
+}
+
+int next_twinprime(int num)
+{
+	assert(num >= 2);
+	while(num < INT_MAX) {
+		num++;
+		if(is_prime(num) && is_prime(num-2))return num;
+	}
+	return -1;
+}
+
+Hash hash_new(int len)
+{
+	Hash h;
+	assert(len >= 2);
+	h.size = len;
+	h.data = malloc(sizeof(int)*len);
+	return h;
+}
+
+Hash hash_new_prime(int len)
+{
+	Hash h;
+	assert(len >= 2);
+	len = next_twinprime(len);
+	h.size = len;
+	h.data = malloc(sizeof(int)*len);
+	return h;
+}
+
+int hash_insert(Hash h, void * data, size_t length)
+{
+	assert(data != NULL);
+
+	return 0;
+}
+
+void * hash_search(Hash h, void * data, size_t length)
+{
+	return NULL;
+}
+
+int hash_remove(Hash h, void * data, size_t length)
+{
+	assert(data != NULL);
+	return 0;
+}
+
+int hash_empty(Hash h)
+{
+	return 0;
+}
+
+int hash_full(Hash h)
+{
+	return 0;
+}
+
+void hash_clear(Hash h)
+{
+
+}
+
+void hash_print(Hash h)
+{
+
+}
+
+void hash_delete(Hash h)
+{
+	free(&h);
+}
+
+
+/*
+
+int main()
+{
+	int j, loc, distinct, key, num[N + 1];
+	FILE * in = fopen("numbers.in", "r");
+	for(j = 1; j <= N; j++)
+		num[j] = Empty;
+	distinct = 0;
+	while(fscanf(in, "%d", &key) == 1) {
+		loc = loc % N + 1;
+		if(num[loc] == Empty) {
+			if(distinct == MaxNumbers) {
+				printf("\nTable Full: %d not added\n", key);
+				exit(1);
+			}
+			num[loc] = key;
+			distinct++;
+		}
+	}
+	printf("\nThere are %d distinct numbers\n", distinct);
+	fclose(in);
+}
+*/

lib_hash.h

@@ -0,0 +1,54 @@
+#ifndef LIB_HASH_H_
+#define LIB_HASH_H_
+
+#define EMPTY 0
+
+typedef struct hash {
+	int * data;
+	int size;
+} Hash;
+
+/*
+	create new hash with len length
+	returns null pointer when hash could not be created.
+*/
+Hash hash_new(int len);
+
+/*
+	same as hash_new accept:
+	tests input length - determine if number is double prime.
+	If not, finds next larger double prime for size of hash.
+*/
+Hash hash_new_prime(int len);
+
+/* insert data into hash, must be sent with size of data */
+int hash_insert(Hash h, void * data, size_t length);
+
+/* search hash for data value, return address of data */
+void * hash_search(Hash h, void * data, size_t length);
+
+/* remove data from hash, must be sent with size of data removed */
+int hash_remove(Hash h, void * data, size_t length);
+
+/* test for empty hash - no data stored */
+int hash_empty(Hash h);
+
+/* test for hash that is completely full */
+int hash_full(Hash h);
+
+/* remove all data from hash */
+void hash_clear(Hash h);
+
+/* print hash contents to stdout - used for debugging */
+void hash_print(Hash h);
+
+/* delete hash and all its contents */
+void hash_delete(Hash h);
+
+/* find next double prime number - used for lenth of arrays */
+int is_prime(int num);
+
+/* find next prime number where number-2 is also prime */
+int next_twinprime(int num);
+
+#endif /* LIB_HASH_H_ */

lib_ll.h

@@ -1,6 +1,16 @@
 #ifndef LIB_LL_H_
 #define LIB_LL_H_
 
+typedef struct list_node {
+	void *pData;
+	struct list_node *pNext;
+} List_Node;
+
+typedef struct {
+	struct list_node *pNext;
+	int count;
+} List_Head;
+
 /* return address of next node in list */
 #define list_next(element) ((element)->pNext)
 
@@ -22,18 +32,6 @@
 /* return integer value of the size of the list */
 #define list_size(list) ((list)->count)
 
-typedef struct list_node {
-	void *pData;
-	struct list_node *pNext;
-} List_Node;
-
-
-
-typedef struct {
-	struct list_node *pNext;
-	int count;
-} List_Head;
-
 /* create new empty list */
 List_Head *list_new(void);
 

lib_random.c

@@ -0,0 +1,19 @@
+#include <assert.h>
+#include <limits.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "lib_random.h"
+
+int random_int(int min, int max)
+{
+	assert(min > INT_MIN);
+	assert(max < INT_MAX / 2);
+	assert(max >= min);
+	return rand() % max + min;
+}
+
+void random_seed()
+{
+	srand(time(0));
+}

lib_random.h

@@ -0,0 +1,10 @@
+#ifndef LIB_RANDOM_H_
+#define LIB_RANDOM_H_
+
+/* generate random number from min to max */
+int random_int(int min, int max);
+
+/* use clock in system to create random seed for number generator */
+void random_seed();
+
+#endif /* LIB_RANDOM_H_ */