We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b677558 commit f62b0c1Copy full SHA for f62b0c1
.gitignore
@@ -6,3 +6,7 @@ TestHashMap
6
7
# back ups
8
*.gch*
9
+
10
+# misc files
11
+..
12
src/hashmap.h
@@ -4,8 +4,9 @@
4
*
5
* Hashmap.h contains functions for creating and storing
* values in a fixed size hashmap where the key is a
- * string of arbitrary length and the data object is a
- * 32 bit reference (pointer).
+ * string of arbitrary length and the data object is a data reference
+ * pointer.
+ *
*/
#ifndef HASHMAP_h
@@ -15,13 +16,8 @@
15
16
#define SUCCESS 0
17
#define FAILURE 1
18
-#ifndef NULL
19
-#define NULL 0x00
20
-#endif
21
-
22
-/* is this a better way to utilize space? */
23
typedef struct HashNode {
24
- int occupied; /* FREE or OCCUPIED */
+ int occupied;
25
char * key;
26
void * data;
27
unsigned long hash;
0 commit comments