Berkley DB CFFI-Bindings

Special Structures 

prev | up | next | toc

Unspecified structures 

prev | up | next | toc

Function QUEUE-CONTENTS

Function MAKE-QUEUE

Function ENQUEUE

Function DEQUEUE

Function FRONT

Function IN-QUEUE

Function EMPTY-QUEUE-P

Function QUEUE-NCONC 

(defstruct trie (value nil) (arcs nil))

Constant TRIE-DELETED

Function PUT-TRIE

Function GET-TRIE

Function DELETE-TRIE

Function FIND-TRIE

Function FOLLOW-ARC

Comparator 

prev | up | next | toc

Variable *COMPARATOR*

Function BUILD-COMPARATOR

Function COMP-=

Function COMP-<

Function COMP-> 

(setf (symbol-function 'comp-<=) (complement #'comp->))
(setf (symbol-function 'comp->=) (complement #'comp-<))
(setf (symbol-function 'comp-/=) (complement #'comp-=))

Macro WITH-COMPARATOR

Macro NUMBER-COMPARATOR

Macro CHAR-COMPARATOR

Macro STRING-COMPARATOR

Pipes 

prev | up | next | toc

Macro MAKE-PIPE

Function HEAD

Function TAIL

Constant EMPTY-PIPE

Function PIPE-NULL-P

Function PIPE-ELT

Function PIPE-MAP

Function PIPE-MAPC

Function PIPE-MAPPEND

Function PIPE->LIST

Function PIPE-FILTER

Function PIPE-REDUCE

Function PIPE-APPEND

Function PIPE-PERMUTATIONS

Function LIST->PIPE

Function INTEGERS

Binary trees 

prev | up | next | toc

Generic Function CREATE-NODE

Generic Function SEARCH-TREE

Generic Function SEARCH-NODE

Generic Function INSERT-TREE

Generic Function NODE-INSERT

Generic Function EMPTY-P

Generic Function CLEAR-TREE

Generic Function DELETE-TREE

Generic Function DELETE-FROM-NODE

Generic Function TREE-ROOT

Class BINARY-TREE

Class BINARY-TREE-NODE

Method (LEFT (EQL NIL))

Method (RIGHT (EQL NIL))

Class AVL-TREE-NODE

Function MAKE-BINARY-TREE

Function MAKE-AVL-TREE

Method (CREATE-NODE T)

Method (EMPTY-P T)

Method (SEARCH-TREE T T)

Method (INSERT-TREE T T T)

Method (CLEAR-TREE T)

Method (DELETE-TREE T T)

Method (CREATE-NODE BINARY-TREE-NODE)

Method (NODE-INSERT (EQL NIL) T T T)

Method (SEARCH-NODE T T)

Method (NODE-INSERT BINARY-TREE-NODE T T T)

Function REPLACE-WITH-MIN

Method (DELETE-FROM-NODE BINARY-TREE-NODE T T)

Function FIND-MIN-NODE

Function PRINT-TREE

Function PRINT-NODES

Method (CREATE-NODE AVL-TREE-NODE)

Method (NODE-INSERT AVL-TREE-NODE T T T)

Method (DELETE-FROM-NODE BINARY-TREE-NODE T T)

Function APPLY-RIGHT-ROTATIONS

Function APPLY-LEFT-ROTATIONS

Function NODE-HEIGHT

Function HEIGHT-DIFF

Function ADJUST-HEIGHT

Function SINGLE-ROTATE-LEFT

Function SINGLE-ROTATE-RIGHT

Function DOUBLE-ROTATE-LEFT

Function DOUBLE-ROTATE-RIGHT

Heap structure 

prev | up | next | toc
(defstruct heap
  (array (make-array 5 :adjustable t))
  (size 0)
  (key-fn #'identity)
  (value-fn #'identity)
  (array-increment 3/4) 
  (comparator (number-comparator)))

Function PARENT-INDEX

Function COMPUTE-SIZE

Function ADJUST-HEAP-ARRAY

Function HEAP-INSERT

Function HEAP-EMPTY-P

Function HEAP-FRONT

Function HEAP-DEQUEUE

Function HEAPIFY

Function ARRAY-SWAP

Function IS-IN-HEAP

Resource pools 

prev | up | next | toc
(defstruct pool
  (count 0)
  (store (make-queue))
  (add-strategie #'enqueue)
  (next-strategie (lambda (q)
		    (let ((data (front q)))
		      (dequeue q)
		      (values data
			      t)))))

Function EMPTY-POOL-P

Function POOL-ADD returns the number of elements of pool or nil if obj wasn't added to pool

Function CALL-ADD-STRATEGIE

Function POOL-NEXT returns the next object from the pool

Function CALL-NEXT-STRATEGIE

Function POOL-MAKE-MAX-SIZED

Function MAKE-MAX-RESOURCE-POOL

Function MAKE-PRIORITY-POOL

Function MAKE-MAX-SIZED-PRIORITY-POOL