add convinience methods

Author: shijinglu

Diff for: hashmap.h

@@ -36,7 +36,7 @@ typedef any_t map_t;
 /*
  * Return an empty hashmap. Returns NULL if empty.
 */
-extern map_t hashmap_new();
+extern map_t hashmap_new(void);
 
 /*
  * Iteratively call f with argument (item, data) for

Diff for: lure.c

@@ -51,11 +51,14 @@ Node *lure_compile(const char *s) {
     return xp;
 }
 
-bool lure_eval(ContextPtr ctx, const char *s) {
-    Node *node = lure_compile(s);
+bool lure_compile_eval(Node *node, ContextPtr ctx) {
     Data *data = node->evaluate(node, ctx);
     bool flag = data->toBoolean(data);
-    data->clean(data); free(data); data = NULL;
-    free_node_deep(node);
+    data->clean(data); free(data);
     return flag;
 }
+
+bool lure_eval(ContextPtr ctx, const char *s) {
+    Node *node = lure_compile(s);
+    return lure_compile_eval(node, ctx);
+}

Diff for: lure.h

@@ -78,6 +78,13 @@ void setCustomContext(ContextPtr ctx, char *key,  char *val, char *typeDesc);
  */
 Node *lure_compile(const char *s);
 
+/**
+ * Eval with pre-compiled AST.
+ * @param node root of the compiled ast
+ * @param ctx map of context
+ */
+bool lure_compile_eval(Node *node, ContextPtr ctx);
+
 /**
  * Evaluate expression with ctx, return false in case of error.
  * @param ctx a map of context objects

Diff for: node_function.c

@@ -14,7 +14,7 @@ Data *node_function_evaluate(Node *node, map_t context) {
     LURE_ASSERT(node->list != NULL, "function parameter list must not be NULL");
     int n_params = node->list->n_all;
     Data **params = (Data **)calloc(n_params, sizeof(Data *));
-    for(size_t i = 0; i < n_params; i++) {
+    for(size_t i = 0; i < (size_t)n_params; i++) {
         Node *pnode = node->list->all[i];
         params[i] = pnode->evaluate(pnode, context);
     }
@@ -23,7 +23,7 @@ Data *node_function_evaluate(Node *node, map_t context) {
     Data *ret = function_derive(fname, params, n_params);
     leftRes->clean(leftRes);
     free(leftRes);
-    for(size_t i = 0; i < n_params; i++) {
+    for(size_t i = 0; i < (size_t)n_params; i++) {
         params[i]->clean(params[i]);
         free(params[i]);
     }