some more paperwork

Author: daTokenizer

API.md

@@ -47,30 +47,27 @@ Remove and return the element with the closest expiration datetime
 return a queue of all exired element nodes.
 
 
-## QUEUE UTILITIES
-
-
-
-
-
-
+## Queue Utilities
 
 `void freeQueue(ElementQueue* queue);`
 
 Free all data and memory of a queue retuned from the `pop_expired` method.
 
 
+
 `void queuePush(ElementQueue* queue, ElementQueueNode* node);`
 
 Add a given `ElementQueueNode` to a queue retuned from the `pop_expired` method.
 
 
+
 `ElementQueueNode* queuePop(ElementQueue* queue);`
 
 Remove and return the first `ElementQueueNode` from a queue retuned from the `pop_expired` method.
 
 
-## ELEMENT NODE UTILITIES
+
+## Element Node Utilities
 
 `ElementQueueNode* NewNode(char* element, size_t element_len, mstime_t ttl);`
 

package.json

@@ -5,5 +5,7 @@
 	  "description": "Unbound Low Latancy Timer Data-Structure for Large Scale Systems",
 	  "keywords": ["lawn", "timer", "ttl", "stream", "stream-proccessing", "timer-wheel", "real-time"],
 	  "license": "Apache2",
-	  "src": ["src/lawn.c", "src/lawn.h"]
+	  "src": ["src/lawn.c", "src/lawn.h",
+		  "src/utils/millisecond_time.c","src/utils/millisecond_time.h",
+		  "src/trie/triemap.c","src/trie/triemap.h"]
 }