var_p_t key;

var_p_t value;

struct Node *left, *right;

int result = 0;

for (int i = 0;; i++) {

if (i == s1n || i == s2n) {

result = s1n < s2n ? -1 : s1n > s2n ? 1 : 0;

break;

}

char c1 = s1[i];

char c2 = s2[i];

if (c1 != c2) {

c1 = tolower(c1);

c2 = tolower(c2);

if (c1 != c2) {

result = c1 < c2 ? -1 : 1;

break;

}

}

}

return result;

int len1 = length;

if (len1 && key[len1 - 1] == '\0') {

len1--;

}

int len2 = vkey->v.p.length;

if (len2 && vkey->v.p.ptr[len2 - 1] == '\0') {

len2--;

}

return str_compare(key, len1, vkey->v.p.ptr, len2);

int hash = 1, i;

for (i = 0; i < length && key[i] != '\0'; i++) {

hash += tolower(key[i]);

hash <<= 3;

hash ^= (hash >> 3);

}

return hash;

map->type = V_MAP;

map->v.m.count = 0;

map->v.m.id = -1;

map->v.m.lib_id = -1;

map->v.m.cls_id = -1;

if (size == 0) {

map->v.m.size = MAP_SIZE;

} else {

map->v.m.size = (size * 100) / 75;

}

map->v.m.map = calloc(map->v.m.size, sizeof(Node *));

assert(key->type == V_STR);

Node *node = hashmap_search(map, key->v.p.ptr, key->v.p.length);

assert(node->key == nullptr);

node->key = key;

node->value = v_new();

map->v.m.count++;

return node->value;

var_p_t result;

Node *node = hashmap_find(map, key);

if (node != nullptr) {

result = node->value;

} else {

result = nullptr;

}

return result;