funds-cvs

funds-cvs@common-lisp.net

225 discussions

[funds-cvs] r168 - trunk/funds/src/stack
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:40:17 2007 New Revision: 168 Removed: trunk/funds/src/stack/ Log: Removed stack directory.

1 0

[funds-cvs] r167 - trunk/funds/src
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:38:18 2007 New Revision: 167 Modified: trunk/funds/src/queue.lisp Log: Documented queue functions. Modified: trunk/funds/src/queue.lisp ============================================================================== --- trunk/funds/src/queue.lisp (original) +++ trunk/funds/src/queue.lisp Sun Aug 19 12:38:18 2007 @@ -23,20 +23,25 @@ (heap (make-heap))) (defun queue-first (q) + "The value at the head of the given queue." (heap-first (queue-heap q))) (defun queue-enqueue (q item) + "The queue that results when the given item is equeued on the given queue." (make-queue :next-priority (1+ (queue-next-priority q)) :heap (heap-insert (queue-heap q) item (queue-next-priority q)))) (defun queue-dequeue (q) + "The queue that results when the first item is removed from the given queue." (if (queue-empty-p q) q (make-queue :next-priority (1- (queue-next-priority q)) :heap (heap-remove (queue-heap q))))) (defun queue-size (q) + "The number of items in the given queue." (tree-weight (queue-heap q))) (defun queue-empty-p (q) + "Whether the given queue does not contain any items." (tree-empty-p (queue-heap q)))

1 0

[funds-cvs] r166 - trunk/funds/src/trees
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:36:10 2007 New Revision: 166 Modified: trunk/funds/src/trees/tree-empty-p.lisp Log: Edited documentation. Modified: trunk/funds/src/trees/tree-empty-p.lisp ============================================================================== --- trunk/funds/src/trees/tree-empty-p.lisp (original) +++ trunk/funds/src/trees/tree-empty-p.lisp Sun Aug 19 12:36:10 2007 @@ -19,8 +19,7 @@ (defgeneric tree-empty-p (tree) (:documentation -"Whether this tree has any key-value pairs.")) - +"Whether the given tree does not contain key-value pairs.")) (defmethod tree-empty-p ((tree t)) nil)

1 0

[funds-cvs] r165 - trunk/funds/src
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:30:28 2007 New Revision: 165 Modified: trunk/funds/src/queue.lisp Log: Documented queue. Modified: trunk/funds/src/queue.lisp ============================================================================== --- trunk/funds/src/queue.lisp (original) +++ trunk/funds/src/queue.lisp Sun Aug 19 12:30:28 2007 @@ -18,6 +18,7 @@ (in-package :funds) (defstruct queue + "A FIFO queue." (next-priority 0) (heap (make-heap)))

1 0

[funds-cvs] r164 - trunk/funds/src/heap
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:27:37 2007 New Revision: 164 Modified: trunk/funds/src/heap/heap-remove.lisp Log: Documented heap-remove. Modified: trunk/funds/src/heap/heap-remove.lisp ============================================================================== --- trunk/funds/src/heap/heap-remove.lisp (original) +++ trunk/funds/src/heap/heap-remove.lisp Sun Aug 19 12:27:37 2007 @@ -17,6 +17,10 @@ (in-package :funds) +(defgeneric heap-remove (heap &key order) + (:documentation "The heap that results when first value is removed +from the given heap.")) + (defmethod heap-remove ((heap heap-leaf) &key order) (declare (ignore order)) heap)

1 0

[funds-cvs] r163 - trunk/funds/src/heap
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:22:02 2007 New Revision: 163 Modified: trunk/funds/src/heap/heap-insert.lisp Log: Documented heap-insert. Modified: trunk/funds/src/heap/heap-insert.lisp ============================================================================== --- trunk/funds/src/heap/heap-insert.lisp (original) +++ trunk/funds/src/heap/heap-insert.lisp Sun Aug 19 12:22:02 2007 @@ -25,6 +25,9 @@ :value value)) (defmethod heap-insert (heap value priority &key (order #'<)) + "A new heap, similar to the given heap, except that the priority-value +pair is inserted into the retured heap according to the standard heap +insertion algorithm." (let* ((side (next-direction heap)) (other-side (other-side side)) (h1 (heap-insert (tree-child heap :side side) value priority

1 0

[funds-cvs] r162 - trunk/funds/src/heap
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:20:17 2007 New Revision: 162 Modified: trunk/funds/src/heap/heap-first.lisp Log: Documented heap-first. Modified: trunk/funds/src/heap/heap-first.lisp ============================================================================== --- trunk/funds/src/heap/heap-first.lisp (original) +++ trunk/funds/src/heap/heap-first.lisp Sun Aug 19 12:20:17 2007 @@ -18,4 +18,5 @@ (in-package :funds) (defun heap-first (heap) + "The first value on the given heap." (bt-value heap))

1 0

[funds-cvs] r161 - trunk/funds/src/heap
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:18:32 2007 New Revision: 161 Modified: trunk/funds/src/heap/heap-empty-p.lisp Log: Documented heap-empty-p. Modified: trunk/funds/src/heap/heap-empty-p.lisp ============================================================================== --- trunk/funds/src/heap/heap-empty-p.lisp (original) +++ trunk/funds/src/heap/heap-empty-p.lisp Sun Aug 19 12:18:32 2007 @@ -18,4 +18,5 @@ (in-package :funds) (defun heap-empty-p (heap) + "Whether the given heap has any elements." (tree-empty-p heap)) \ No newline at end of file

1 0

[funds-cvs] r160 - trunk/funds/src/heap
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:17:35 2007 New Revision: 160 Modified: trunk/funds/src/heap/heap.lisp Log: Added documentation to make-heap. Modified: trunk/funds/src/heap/heap.lisp ============================================================================== --- trunk/funds/src/heap/heap.lisp (original) +++ trunk/funds/src/heap/heap.lisp Sun Aug 19 12:17:35 2007 @@ -18,6 +18,7 @@ (defun make-heap (&key (priority 0 p-p) value (left (make-heap-leaf)) (right (make-heap-leaf))) + "An empty binary heap." (if p-p (make-instance 'heap :priority priority

1 0

[funds-cvs] r159 - trunk/funds/src/trees
by abaine＠common-lisp.net 19 Aug '07

19 Aug '07

Author: abaine Date: Sun Aug 19 12:15:37 2007 New Revision: 159 Modified: trunk/funds/src/trees/tree-find.lisp Log: Edited documentation of tree-find. Modified: trunk/funds/src/trees/tree-find.lisp ============================================================================== --- trunk/funds/src/trees/tree-find.lisp (original) +++ trunk/funds/src/trees/tree-find.lisp Sun Aug 19 12:15:37 2007 @@ -28,7 +28,6 @@ if k maps to nil. But (find t k) -> nil nil - if there is no mapping for k in the tree.")) (defmethod tree-find ((tree leaf) key &key test order)

1 0

← Newer
1
2
3
4
5
6
7
8
9
...
23
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

funds-cvs