dict.h File Reference

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

Go to the source code of this file.

Classes
struct	DictNode
struct	Dict

Macros
#define	DictKey   DictListKey
#define	Dict   DictList
#define	DictNode   DictListNode
#define	dictNewDict(frame, leq)   __gl_dictListNewDict(frame,leq)
#define	dictDeleteDict(dict)   __gl_dictListDeleteDict(dict)
#define	dictSearch(dict, key)   __gl_dictListSearch(dict,key)
#define	dictInsert(dict, key)   __gl_dictListInsert(dict,key)
#define	dictInsertBefore(dict, node, key)   __gl_dictListInsertBefore(dict,node,key)
#define	dictDelete(dict, node)   __gl_dictListDelete(dict,node)
#define	dictKey(n)   __gl_dictListKey(n)
#define	dictSucc(n)   __gl_dictListSucc(n)
#define	dictPred(n)   __gl_dictListPred(n)
#define	dictMin(d)   __gl_dictListMin(d)
#define	dictMax(d)   __gl_dictListMax(d)
#define	__gl_dictListKey(n)   ((n)->key)
#define	__gl_dictListSucc(n)   ((n)->next)
#define	__gl_dictListPred(n)   ((n)->prev)
#define	__gl_dictListMin(d)   ((d)->head.next)
#define	__gl_dictListMax(d)   ((d)->head.prev)
#define	__gl_dictListInsert(d, k)   (dictInsertBefore((d),&(d)->head,(k)))

Typedefs
typedef void *	DictKey
typedef struct Dict	Dict
typedef struct DictNode	DictNode

Functions
Dict *	dictNewDict (void *frame, int(*leq)(void *frame, DictKey key1, DictKey key2))
void	dictDeleteDict (Dict *dict)
DictNode *	dictSearch (Dict *dict, DictKey key)
DictNode *	dictInsertBefore (Dict *dict, DictNode *node, DictKey key)
void	dictDelete (Dict *dict, DictNode *node)

---

Class Documentation

DictNode

struct DictNode

Collaboration diagram for DictNode:

Class Members
DictKey	key
DictNode *	next
DictNode *	prev

Macro Definition Documentation

__gl_dictListInsert

#define __gl_dictListInsert	(		d,
			k
	)		(dictInsertBefore((d),&(d)->head,(k)))

__gl_dictListKey

#define __gl_dictListKey

(

n

)

((n)->key)

__gl_dictListMax

#define __gl_dictListMax

(

d

)

((d)->head.prev)

__gl_dictListMin

#define __gl_dictListMin

(

d

)

((d)->head.next)

__gl_dictListPred

#define __gl_dictListPred

(

n

)

((n)->prev)

__gl_dictListSucc

#define __gl_dictListSucc

(

n

)

((n)->next)

Dict

#define Dict   DictList

dictDelete

#define dictDelete	(		dict,
			node
	)		__gl_dictListDelete(dict,node)

dictDeleteDict

#define dictDeleteDict

(

dict

)

__gl_dictListDeleteDict(dict)

dictInsert

#define dictInsert	(		dict,
			key
	)		__gl_dictListInsert(dict,key)

dictInsertBefore

#define dictInsertBefore	(		dict,
			node,
			key
	)		__gl_dictListInsertBefore(dict,node,key)

DictKey

#define DictKey   DictListKey

dictKey

#define dictKey

(

n

)

__gl_dictListKey(n)

dictMax

#define dictMax

(

d

)

__gl_dictListMax(d)

dictMin

#define dictMin

(

d

)

__gl_dictListMin(d)

dictNewDict

#define dictNewDict	(		frame,
			leq
	)		__gl_dictListNewDict(frame,leq)

DictNode

#define DictNode   DictListNode

dictPred

#define dictPred

(

n

)

__gl_dictListPred(n)

dictSearch

#define dictSearch	(		dict,
			key
	)		__gl_dictListSearch(dict,key)

dictSucc

#define dictSucc

(

n

)

__gl_dictListSucc(n)

Typedef Documentation

Dict

typedef struct Dict Dict

DictKey

typedef void* DictKey

DictNode

typedef struct DictNode DictNode

Function Documentation

dictDelete()

void dictDelete	(	Dict *	dict,
		DictNode *	node
	)

{
  node->next->prev = node->prev;
  node->prev->next = node->next;
  memFree( node );
}

dictDeleteDict()

void dictDeleteDict

(

Dict *

dict

)

{
  DictNode *node, *next;
 
  for( node = dict->head.next; node != &dict->head; node = next ) {
    next = node->next;
    memFree( node );
  }
  memFree( dict );
}

dictInsertBefore()

DictNode * dictInsertBefore	(	Dict *	dict,
		DictNode *	node,
		DictKey	key
	)

{
  DictNode *newNode;
 
  do {
    node = node->prev;
  } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
 
  newNode = (DictNode *) memAlloc( sizeof( DictNode ));
  if (newNode == NULL) return NULL;
 
  newNode->key = key;
  newNode->next = node->next;
  node->next->prev = newNode;
  newNode->prev = node;
  node->next = newNode;
 
  return newNode;
}

dictNewDict()

Dict * dictNewDict	(	void *	frame,
		int(*)(void *frame, DictKey key1, DictKey key2)	leq
	)

{
  Dict *dict = (Dict *) memAlloc( sizeof( Dict ));
  DictNode *head;
 
  if (dict == NULL) return NULL;
 
  head = &dict->head;
 
  head->key = NULL;
  head->next = head;
  head->prev = head;
 
  dict->frame = frame;
  dict->leq = leq;
 
  return dict;
}

dictSearch()

DictNode * dictSearch	(	Dict *	dict,
		DictKey	key
	)

{
  DictNode *node = &dict->head;
 
  do {
    node = node->next;
  } while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
 
  return node;
}