mirror of
https://github.com/lxsang/ant-http
synced 2024-11-18 01:08:21 +01:00
129 lines
3.2 KiB
C
129 lines
3.2 KiB
C
/*
|
|
The MIT License (MIT)
|
|
|
|
Copyright (c) 2015 LE Xuan Sang xsang.le@gmail.com
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
*/
|
|
#include "dictionary.h"
|
|
|
|
dictionary dict()
|
|
{
|
|
dictionary d = (dictionary)malloc(HASHSIZE*sizeof(association));
|
|
for(int i=0; i< HASHSIZE;i++)
|
|
d[i] = NULL;
|
|
return d;
|
|
}
|
|
association dlookup(dictionary dic,const char* key)
|
|
{
|
|
association np;
|
|
if(dic == NULL) return NULL;
|
|
for (np = dic[hash(key,DHASHSIZE)]; np != NULL; np = np->next)
|
|
{
|
|
if(!np || !np->key)
|
|
{
|
|
return NULL;
|
|
}
|
|
if (strcmp(key, np->key) == 0)
|
|
return np; /* found */
|
|
}
|
|
return NULL; /* not found */
|
|
}
|
|
association __put_el_with_key(dictionary dic, const char* key)
|
|
{
|
|
association np;
|
|
unsigned hashval;
|
|
if(dic == NULL) return NULL;
|
|
if ((np = dlookup(dic,key)) == NULL) { /* not found */
|
|
np = (association) malloc(sizeof(*np));
|
|
np->value = NULL;
|
|
if (np == NULL || (np->key = strdup(key)) == NULL)
|
|
return NULL;
|
|
hashval = hash(key, DHASHSIZE);
|
|
np->next = dic[hashval];
|
|
dic[hashval] = np;
|
|
}
|
|
// found
|
|
return np;
|
|
}
|
|
association dput(dictionary dic,const char* key, void* value)
|
|
{
|
|
association np = __put_el_with_key(dic,key);
|
|
if(np == NULL)
|
|
{
|
|
if(value) free(value);
|
|
return NULL;
|
|
}
|
|
if(np->value && value) free(np->value);
|
|
np->value = value;
|
|
return np;
|
|
}
|
|
int dremove(dictionary dic, const char* key)
|
|
{
|
|
if(dic == NULL) return 0;
|
|
int hashval = hash(key, DHASHSIZE);
|
|
association np = dic[hashval];
|
|
if(np!=NULL && strcmp(key,np->key)==0)
|
|
{
|
|
dic[hashval] = np->next;
|
|
return 1;
|
|
}
|
|
for (np= dic[hashval]; np != NULL; np = np->next)
|
|
if (np->next!=NULL&&strcmp(key, np->next->key) == 0)
|
|
{
|
|
np->next = np->next->next; /* found */
|
|
return 1;
|
|
}
|
|
return 0; /* not found */
|
|
|
|
}
|
|
void* dvalue(dictionary dic, const char* key)
|
|
{
|
|
association as = dlookup(dic,key);
|
|
if(as == NULL) return NULL;
|
|
return as->value;
|
|
}
|
|
|
|
void free_association(association * asoc)
|
|
{
|
|
|
|
while( (*asoc) != NULL )
|
|
{
|
|
association a = *asoc;
|
|
(* asoc) = (*asoc) ->next;
|
|
|
|
if(a->key)
|
|
{
|
|
free(a->key);
|
|
if(a->value) free(a->value);
|
|
}
|
|
free(a);
|
|
}
|
|
|
|
}
|
|
|
|
void freedict(dictionary dic){
|
|
for(int i = 0; i < HASHSIZE; i++)
|
|
free_association(&(dic[i]));
|
|
free(dic);
|
|
|
|
}
|
|
|
|
|