Merge pull request #1 from bamless/hashmap-rework

- Breaking changes on hashmap implementation:
  Reworked the hashmap implementation to make possible the usage of `ext_hmap_get` and
  `ext_hmap_get_default` family of functions as expressions. Now it is possible to do
  things like:
   ```c
  Entry* e = hmap_get_cstr(&hmap, "key");
  if(e != NULL) {
       ...
  }
  ```
- Added `Ext_Array` and `Ext_HashMap`/`Ext_Entry` macros to define required struct layout
  for both dynamic arrays and hashmap in-line.
  This makes it possible to skip declaring the full struct by hand when we do not need
  to reference it by name (i.e. create variables to it, pass it to functions, etc.):
  ```c
  Array(int) int_array = {0};
  HashMap(char*, int) int_map = {0};
  ```
  Declaring full struct layout by hand is still supported.
- Breaking change: removed deprecated functions and macros:
         1. `ext_strdup_alloc` and `ext_memdup_alloc`
         2. `EXT_DEFER_LOOP`

Author: bamless

examples/01_dynamic_array.c

@@ -11,6 +11,8 @@
 #define EXTLIB_IMPL
 #include "../extlib.h"
 
+// Could also create this typedef with `Array` utility macro:
+//     typedef Array(StringSlice) Lines;
 typedef struct {
     StringSlice *items;
     size_t size, capacity;
@@ -22,6 +24,8 @@ static int qsort_cmp(const void *a, const void *b) {
 }
 
 int main(void) {
+    // Could also define this dynamic array inline with:
+    //     Array(StringSlice) lines = {0};
     Lines lines = {0};
     StringBuffer file = {0};
 

examples/02_hashmap.c

@@ -121,8 +121,7 @@ int main(int argc, char **argv) {
         StringSlice word = ss_split_once_ws(&file_slice);
         if(word.size == 0) continue;
 
-        WordFreq *e;
-        hmap_get_default_ss(&words_freq, word, 0, &e);
+        WordFreq *e = hmap_get_default_ss(&words_freq, word, 0);
         ASSERT(e != NULL, "default entry shouldn't be NULL");
 
         e->value++;