95aa370a7e
* BUG: Do not use GB.ReturnNull() when returning a void string anymore. Use the new GB.ReturnVoidString() API instead. git-svn-id: svn://localhost/gambas/trunk@4216 867c0c6c-44f3-4631-809d-bfa615b0a4ec
345 lines
6.9 KiB
C
345 lines
6.9 KiB
C
/***************************************************************************
|
|
|
|
gbx_c_collection.c
|
|
|
|
(c) 2000-2011 Benoît Minisini <gambas@users.sourceforge.net>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
|
MA 02110-1301, USA.
|
|
|
|
***************************************************************************/
|
|
|
|
#define __GBX_C_COLLECTION_C
|
|
|
|
#include "gbx_info.h"
|
|
|
|
#ifndef GBX_INFO
|
|
|
|
#include "gb_common.h"
|
|
#include "gb_error.h"
|
|
|
|
#include "gbx_variant.h"
|
|
#include "gambas.h"
|
|
#include "gbx_api.h"
|
|
#include "gbx_class.h"
|
|
#include "gbx_object.h"
|
|
|
|
#include "gbx_c_collection.h"
|
|
|
|
|
|
static void clear(CCOLLECTION *col)
|
|
{
|
|
VARIANT *value;
|
|
HASH_ENUM iter;
|
|
|
|
CLEAR(&iter);
|
|
col->locked = TRUE;
|
|
|
|
for(;;)
|
|
{
|
|
value = HASH_TABLE_next(col->hash_table, &iter);
|
|
if (value == NULL)
|
|
break;
|
|
|
|
VARIANT_free(value);
|
|
value->type = T_NULL;
|
|
}
|
|
|
|
HASH_TABLE_delete(&col->hash_table);
|
|
col->locked = FALSE;
|
|
}
|
|
|
|
#define get_key(_col, _key, _len) HASH_TABLE_lookup((_col)->hash_table, (_key), (_len))
|
|
|
|
#define add_key(_col, _key, _len) ((_len) == 0 ? (GB_Error((char *)E_VKEY), NULL) : HASH_TABLE_insert(((CCOLLECTION *)(_col))->hash_table, (_key), (_len)))
|
|
|
|
static void remove_key(CCOLLECTION *col, const char *key, int len)
|
|
{
|
|
void *value;
|
|
HASH_NODE *last;
|
|
|
|
if (len == 0)
|
|
{
|
|
GB_Error((char *)E_VKEY);
|
|
return;
|
|
}
|
|
|
|
value = HASH_TABLE_lookup(col->hash_table, key, len);
|
|
if (value == NULL)
|
|
return;
|
|
|
|
last = col->hash_table->last;
|
|
|
|
GB_ListEnum(col);
|
|
while (!GB_NextEnum())
|
|
{
|
|
HASH_ENUM *iter = (HASH_ENUM *)GB_GetEnum();
|
|
if (iter->next == last)
|
|
iter->next = iter->next->snext;
|
|
}
|
|
|
|
VARIANT_free((VARIANT *)value);
|
|
|
|
if (!col->locked)
|
|
HASH_TABLE_remove(col->hash_table, key, len);
|
|
else // Prevent the freed variant to be freed twice if the collection is locked (i.e. being destroyed)
|
|
((VARIANT *)value)->type = T_NULL;
|
|
}
|
|
|
|
|
|
BEGIN_METHOD(Collection_new, GB_INTEGER mode)
|
|
|
|
int mode = MISSING(mode) ? 0 : VARG(mode);
|
|
|
|
HASH_TABLE_create(&THIS->hash_table, TYPE_sizeof(T_VARIANT), mode);
|
|
THIS->last = NULL;
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD_VOID(Collection_free)
|
|
|
|
clear(THIS);
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_PROPERTY(Collection_Count)
|
|
|
|
GB_ReturnInt(CCOLLECTION_get_count(THIS));
|
|
|
|
END_PROPERTY
|
|
|
|
|
|
BEGIN_PROPERTY(Collection_Key)
|
|
|
|
char *key;
|
|
int len;
|
|
|
|
if (HASH_TABLE_get_last_key(THIS->hash_table, &key, &len))
|
|
GB_ReturnVoidString();
|
|
else
|
|
GB_ReturnNewString(key, len);
|
|
|
|
END_PROPERTY
|
|
|
|
|
|
BEGIN_METHOD(Collection_Add, GB_VARIANT value; GB_STRING key)
|
|
|
|
void *data;
|
|
|
|
data = add_key(THIS, STRING(key), LENGTH(key));
|
|
if (!data)
|
|
return;
|
|
|
|
GB_StoreVariant(ARG(value), data);
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD(Collection_Exist, GB_STRING key)
|
|
|
|
GB_ReturnBoolean(get_key(THIS, STRING(key), LENGTH(key)) != NULL);
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD(Collection_Remove, GB_STRING key)
|
|
|
|
remove_key(THIS, STRING(key), LENGTH(key));
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD_VOID(Collection_Clear)
|
|
|
|
int mode = THIS->hash_table->mode;
|
|
|
|
/* Stops all iterators */
|
|
GB_StopAllEnum(THIS);
|
|
|
|
clear(THIS);
|
|
HASH_TABLE_create(&THIS->hash_table, TYPE_sizeof(T_VARIANT), mode);
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD_VOID(Collection_next)
|
|
|
|
void *value;
|
|
HASH_TABLE *hash_table = OBJECT(CCOLLECTION)->hash_table;
|
|
HASH_ENUM *iter = (HASH_ENUM *)GB_GetEnum();
|
|
|
|
value = HASH_TABLE_next(hash_table, iter);
|
|
|
|
if (value == NULL)
|
|
GB_StopEnum();
|
|
else
|
|
GB_ReturnVariant(value);
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD(Collection_get, GB_STRING key)
|
|
|
|
GB_ReturnVariant(get_key(THIS, STRING(key), LENGTH(key)));
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD(Collection_put, GB_VARIANT value; GB_STRING key)
|
|
|
|
void *data;
|
|
|
|
if (VARIANT_is_null((VARIANT *)&VARG(value)))
|
|
remove_key(THIS, STRING(key), LENGTH(key));
|
|
else
|
|
{
|
|
data = add_key(THIS, STRING(key), LENGTH(key));
|
|
if (!data)
|
|
return;
|
|
GB_StoreVariant(ARG(value), data);
|
|
}
|
|
|
|
END_METHOD
|
|
|
|
|
|
BEGIN_METHOD_VOID(Collection_Copy)
|
|
|
|
GB_COLLECTION col;
|
|
GB_COLLECTION_ITER iter;;
|
|
GB_VARIANT value;
|
|
char *key;
|
|
int len;
|
|
|
|
GB_CollectionNew(&col, THIS->mode);
|
|
|
|
CLEAR(&iter);
|
|
|
|
for(;;)
|
|
{
|
|
if (GB_CollectionEnum(THIS, &iter, &value, &key, &len))
|
|
break;
|
|
|
|
GB_CollectionSet(col, key, len, &value);
|
|
}
|
|
|
|
GB_ReturnObject(col);
|
|
|
|
END_METHOD
|
|
|
|
#endif
|
|
|
|
|
|
GB_DESC NATIVE_Collection[] =
|
|
{
|
|
GB_DECLARE("Collection", sizeof(CCOLLECTION)),
|
|
|
|
GB_METHOD("_new", NULL, Collection_new, "[(Mode)i]"),
|
|
GB_METHOD("_free", NULL, Collection_free, NULL),
|
|
|
|
GB_PROPERTY_READ("Count", "i", Collection_Count),
|
|
GB_PROPERTY_READ("Length", "i", Collection_Count),
|
|
GB_PROPERTY_READ("Key", "s", Collection_Key),
|
|
|
|
GB_METHOD("Add", NULL, Collection_Add, "(Value)v(Key)s"),
|
|
GB_METHOD("Exist", "b", Collection_Exist, "(Key)s"),
|
|
GB_METHOD("Remove", NULL, Collection_Remove, "(Key)s"),
|
|
GB_METHOD("Clear", NULL, Collection_Clear, NULL),
|
|
/*GB_METHOD("_first", NULL, collection_first, NULL),*/
|
|
GB_METHOD("_next", "v", Collection_next, NULL),
|
|
GB_METHOD("_get", "v", Collection_get, "(Key)s"),
|
|
GB_METHOD("_put", NULL, Collection_put, "(Value)v(Key)s"),
|
|
GB_METHOD("Copy", "Collection", Collection_Copy, NULL),
|
|
|
|
GB_END_DECLARE
|
|
};
|
|
|
|
#ifndef GBX_INFO
|
|
|
|
void GB_CollectionNew(GB_COLLECTION *col, int mode)
|
|
{
|
|
VALUE param;
|
|
|
|
param._integer.type = GB_T_INTEGER;
|
|
param._integer.value = mode;
|
|
|
|
*col = OBJECT_create_native(CLASS_Collection, ¶m);
|
|
}
|
|
|
|
int GB_CollectionCount(GB_COLLECTION col)
|
|
{
|
|
return HASH_TABLE_size(((CCOLLECTION *)col)->hash_table);
|
|
}
|
|
|
|
bool GB_CollectionSet(GB_COLLECTION col, const char *key, int len, GB_VARIANT *value)
|
|
{
|
|
VARIANT *data;
|
|
|
|
if (VARIANT_is_null((VARIANT *)&value->value))
|
|
remove_key((CCOLLECTION *)col, key, len);
|
|
else
|
|
{
|
|
data = (VARIANT *)add_key((CCOLLECTION *)col, key, len);
|
|
if (!data)
|
|
return TRUE;
|
|
GB_StoreVariant(value, data);
|
|
}
|
|
return FALSE;
|
|
}
|
|
|
|
bool GB_CollectionGet(GB_COLLECTION col, const char *key, int len, GB_VARIANT *value)
|
|
{
|
|
VARIANT *var;
|
|
|
|
var = (VARIANT *)get_key((CCOLLECTION *)col, key, len);
|
|
value->type = T_VARIANT;
|
|
if (var)
|
|
{
|
|
value->value.type = var->type;
|
|
value->value.value.data = var->value.data;
|
|
return FALSE;
|
|
}
|
|
else
|
|
{
|
|
value->value.type = GB_T_NULL;
|
|
return TRUE;
|
|
}
|
|
}
|
|
|
|
bool GB_CollectionEnum(GB_COLLECTION col, GB_COLLECTION_ITER *iter, GB_VARIANT *value, char **key, int *len)
|
|
{
|
|
VARIANT *val;
|
|
HASH_TABLE *hash_table = ((CCOLLECTION *)col)->hash_table;
|
|
|
|
if (!value || !key)
|
|
{
|
|
CLEAR(iter);
|
|
return FALSE;
|
|
}
|
|
|
|
val = HASH_TABLE_next(hash_table, (HASH_ENUM *)iter);
|
|
if (!val)
|
|
return TRUE;
|
|
|
|
value->type = T_VARIANT;
|
|
value->value.type = val->type;
|
|
value->value.value.data = val->value.data;
|
|
|
|
HASH_TABLE_get_last_key(hash_table, key, len);
|
|
return FALSE;
|
|
}
|
|
|
|
#endif
|