35 return m ? m->
count : 0;
47 i = prev - m->elems + 1;
51 for (; i < m->count; i++) {
52 const char *
s = m->elems[i].key;
54 for (j = 0; s[j] == key[j] && key[j]; j++)
106 int len = strlen(oldval) + strlen(value) + 1;
127 const char *key_val_sep,
const char *pairs_sep,
134 if (key && *key && strspn(*buf, key_val_sep)) {
139 if (key && *key && val && *val)
151 const char *key_val_sep,
const char *pairs_sep,