dict.c File Reference

#include <stddef.h>
#include "dict-list.h"
#include "memalloc.h"

Include dependency graph for dict.c:

Go to the source code of this file.

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

Function Documentation

dictDelete()

void dictDelete	(	Dict *	dict,
		DictNode *	node
	)

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

References memFree, DictNode::next, and DictNode::prev.

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 );
}

References Dict::head, memFree, and DictNode::next.

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;
}

References Dict::frame, DictNode::key, Dict::leq, memAlloc, DictNode::next, and DictNode::prev.

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;
}

References Dict::frame, head(), Dict::head, Dict::leq, and memAlloc.

Here is the call graph for this function:

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;
}

References Dict::frame, Dict::head, DictNode::key, Dict::leq, and DictNode::next.