dictionary.h File Reference

#include <stdarg.h>
#include "windef.h"
#include "winbase.h"

Include dependency graph for dictionary.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs
typedef int(*	comparefunc) (const void *a, const void *b, void *extra)
typedef void(*	destroyfunc) (void *k, void *v, void *extra)
typedef BOOL(*	enumeratefunc) (const void *k, const void *v, void *extra, void *closure)

Functions
struct dictionary *	dictionary_create (comparefunc c, destroyfunc d, void *extra) DECLSPEC_HIDDEN
void	dictionary_destroy (struct dictionary *d) DECLSPEC_HIDDEN
UINT	dictionary_num_entries (struct dictionary *d) DECLSPEC_HIDDEN
void	dictionary_insert (struct dictionary *d, const void *k, const void *v) DECLSPEC_HIDDEN
BOOL	dictionary_find (struct dictionary *d, const void *k, void **v) DECLSPEC_HIDDEN
void	dictionary_remove (struct dictionary *d, const void *k) DECLSPEC_HIDDEN
void	dictionary_enumerate (struct dictionary *d, enumeratefunc e, void *closure) DECLSPEC_HIDDEN

Typedef Documentation

comparefunc

typedef int(* comparefunc) (const void *a, const void *b, void *extra)

Definition at line 35 of file dictionary.h.

destroyfunc

typedef void(* destroyfunc) (void *k, void *v, void *extra)

Definition at line 40 of file dictionary.h.

enumeratefunc

typedef BOOL(* enumeratefunc) (const void *k, const void *v, void *extra, void *closure)

Definition at line 45 of file dictionary.h.

Function Documentation

dictionary_create()

struct dictionary * dictionary_create	(	comparefunc	c,
		destroyfunc	d,
		void *	extra
	)

Definition at line 45 of file dictionary.c.

{
    struct dictionary *ret;
 
    TRACE("(%p, %p, %p)\n", c, d, extra);
    if (!c)
        return NULL;
    ret = HeapAlloc(GetProcessHeap(), 0, sizeof(struct dictionary));
    if (ret)
    {
        ret->comp = c;
        ret->destroy = d;
        ret->extra = extra;
        ret->head = NULL;
        ret->num_entries = 0;
    }
    TRACE("returning %p\n", ret);
    return ret;
}

Referenced by PropertyStorage_CreateDictionaries().

dictionary_destroy()

void dictionary_destroy

(

struct dictionary *

d

)

Definition at line 65 of file dictionary.c.

{
    TRACE("(%p)\n", d);
    if (d)
    {
        struct dictionary_entry *p;
 
        for (p = d->head; p; )
        {
            struct dictionary_entry *next = p->next;
 
            if (d->destroy)
                d->destroy(p->key, p->value, d->extra);
            HeapFree(GetProcessHeap(), 0, p);
            p = next;
        }
        HeapFree(GetProcessHeap(), 0, d);
    }
}

Referenced by PropertyStorage_DestroyDictionaries(), and PropertyStorage_ReadFromStream().

dictionary_enumerate()

void dictionary_enumerate	(	struct dictionary *	d,
		enumeratefunc	e,
		void *	closure
	)

Definition at line 179 of file dictionary.c.

{
    struct dictionary_entry *p;
 
    TRACE("(%p, %p, %p)\n", d, e, closure);
    if (!d)
        return;
    if (!e)
        return;
    for (p = d->head; p; p = p->next)
        if (!e(p->key, p->value, d->extra, closure))
            break;
}

Referenced by create_EnumSTATPROPSTG(), PropertyStorage_WriteDictionaryToStream(), and PropertyStorage_WritePropertiesToStream().

dictionary_find()

BOOL dictionary_find	(	struct dictionary *	d,
		const void *	k,
		void **	v
	)

Definition at line 142 of file dictionary.c.

{
    struct dictionary_entry **prior;
    BOOL ret = FALSE;
 
    TRACE("(%p, %p, %p)\n", d, k, value);
    if (!d)
        return FALSE;
    if (!value)
        return FALSE;
    if ((prior = dictionary_find_internal(d, k)))
    {
        *value = (*prior)->value;
        ret = TRUE;
    }
    TRACE("returning %d (%p)\n", ret, *value);
    return ret;
}

Referenced by IPropertyStorage_fnDeleteMultiple(), IPropertyStorage_fnDeletePropertyNames(), prop_enum_copy_cb(), PropertyStorage_FindProperty(), PropertyStorage_FindPropertyByName(), and PropertyStorage_FindPropertyNameById().

dictionary_insert()

void dictionary_insert	(	struct dictionary *	d,
		const void *	k,
		const void *	v
	)

Definition at line 113 of file dictionary.c.

{
    struct dictionary_entry **prior;
 
    TRACE("(%p, %p, %p)\n", d, k, v);
    if (!d)
        return;
    if ((prior = dictionary_find_internal(d, k)))
    {
        if (d->destroy)
            d->destroy((*prior)->key, (*prior)->value, d->extra);
        (*prior)->key = (void *)k;
        (*prior)->value = (void *)v;
    }
    else
    {
        struct dictionary_entry *elem = HeapAlloc(GetProcessHeap(), 0,
                                            sizeof(struct dictionary_entry));
 
        if (!elem)
            return;
        elem->key = (void *)k;
        elem->value = (void *)v;
        elem->next = d->head;
        d->head = elem;
        d->num_entries++;
    }
}

Referenced by PropertyStorage_StoreNameWithId(), and PropertyStorage_StorePropWithId().

dictionary_num_entries()

UINT dictionary_num_entries

(

struct dictionary *

d

)

Definition at line 85 of file dictionary.c.

{
    return d ? d->num_entries : 0;
}

Referenced by IPropertyStorage_fnWriteMultiple(), PropertyStorage_WriteDictionaryToStream(), and PropertyStorage_WriteToStream().

dictionary_remove()

void dictionary_remove	(	struct dictionary *	d,
		const void *	k
	)

Definition at line 161 of file dictionary.c.

{
    struct dictionary_entry **prior, *temp;
 
    TRACE("(%p, %p)\n", d, k);
    if (!d)
        return;
    if ((prior = dictionary_find_internal(d, k)))
    {
        temp = *prior;
        if (d->destroy)
            d->destroy((*prior)->key, (*prior)->value, d->extra);
        *prior = (*prior)->next;
        HeapFree(GetProcessHeap(), 0, temp);
        d->num_entries--;
    }
}

Referenced by IPropertyStorage_fnDeleteMultiple(), and IPropertyStorage_fnDeletePropertyNames().