funds-cvs August 2007

funds-cvs@common-lisp.net

1 participants
113 discussions

[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

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

19 Aug '07

Author: abaine Date: Sun Aug 19 12:14:01 2007 New Revision: 158 Modified: trunk/funds/src/trees/tree-insert.lisp Log: Edited documentation of tree-insert. Modified: trunk/funds/src/trees/tree-insert.lisp ============================================================================== --- trunk/funds/src/trees/tree-insert.lisp (original) +++ trunk/funds/src/trees/tree-insert.lisp Sun Aug 19 12:14:01 2007 @@ -19,11 +19,12 @@ (defgeneric tree-insert (tree key value &key test order) (:documentation -"A new tree similar to the given tree except that the given key and value -are now associated with one another. If the given key is already contained -in the tree, according to the test function, then the old value is replaced -by the specified value. The order function specifies whether the given -key-value pair should be inserted to the left or right of the given tree.")) + "A new tree similar to the given tree except that the given key and +value are now associated with one another. If the given key is already +contained in the tree, according to the test function, then the old value +is replaced by the specified value in the returned tree. The order function +specifies whether the given key-value pair should be inserted to the left or +right of the given tree. The given tree is not modified.")) (defmethod tree-insert ((tree bt-leaf) key value &key test order) (declare (ignore test order))

1 0

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

19 Aug '07

Author: abaine Date: Sun Aug 19 12:09:48 2007 New Revision: 157 Modified: trunk/funds/src/trees/constructors.lisp Log: Added documentation to make-binary-tree and make-avl-tree. Modified: trunk/funds/src/trees/constructors.lisp ============================================================================== --- trunk/funds/src/trees/constructors.lisp (original) +++ trunk/funds/src/trees/constructors.lisp Sun Aug 19 12:09:48 2007 @@ -27,8 +27,10 @@ +avl-leaf+) (defun make-binary-tree () + "An empty binary tree." (make-bt-leaf)) (defun make-avl-tree () + "An empty AVL tree." (make-avl-leaf))

1 0

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

19 Aug '07

Author: abaine Date: Sun Aug 19 12:07:15 2007 New Revision: 156 Modified: trunk/funds/src/heap/heap.lisp trunk/funds/src/trees/tree-weight.lisp Log: Moved heap functions to heap folder. Modified: trunk/funds/src/heap/heap.lisp ============================================================================== --- trunk/funds/src/heap/heap.lisp (original) +++ trunk/funds/src/heap/heap.lisp Sun Aug 19 12:07:15 2007 @@ -5,7 +5,7 @@ () (:documentation "A leaf node of a heap.")) -(defconstant +heap-leaf+ (make-instance 'heap-leaf)) +(defvar +heap-leaf+ (make-instance 'heap-leaf)) (defun make-heap-leaf () +heap-leaf+) @@ -32,3 +32,6 @@ :value (bt-value root) :left left :right right)) + +(defmethod tree-weight ((tree heap)) + (heap-weight tree)) Modified: trunk/funds/src/trees/tree-weight.lisp ============================================================================== --- trunk/funds/src/trees/tree-weight.lisp (original) +++ trunk/funds/src/trees/tree-weight.lisp Sun Aug 19 12:07:15 2007 @@ -28,5 +28,3 @@ (+ 1 (tree-weight (bt-left tree)) (tree-weight (bt-right tree)))) -(defmethod tree-weight ((tree heap)) - (heap-weight tree))

1 0

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

19 Aug '07

Author: abaine Date: Sun Aug 19 11:53:04 2007 New Revision: 155 Modified: trunk/funds/src/heap/heap.lisp trunk/funds/src/trees/constructors.lisp Log: Moved +heap-leaf+ and make-heap-leaf from constructors.lisp to heap.lisp. Modified: trunk/funds/src/heap/heap.lisp ============================================================================== --- trunk/funds/src/heap/heap.lisp (original) +++ trunk/funds/src/heap/heap.lisp Sun Aug 19 11:53:04 2007 @@ -5,6 +5,11 @@ () (:documentation "A leaf node of a heap.")) +(defconstant +heap-leaf+ (make-instance 'heap-leaf)) + +(defun make-heap-leaf () + +heap-leaf+) + (defclass heap (binary-tree) ((key :initarg :priority :reader heap-priority) (left :initform (make-heap)) Modified: trunk/funds/src/trees/constructors.lisp ============================================================================== --- trunk/funds/src/trees/constructors.lisp (original) +++ trunk/funds/src/trees/constructors.lisp Sun Aug 19 11:53:04 2007 @@ -19,7 +19,6 @@ (defconstant +bt-leaf+ (make-instance 'bt-leaf)) (defconstant +avl-leaf+ (make-instance 'avl-leaf)) -(defconstant +heap-leaf+ (make-instance 'heap-leaf)) (defun make-bt-leaf () +bt-leaf+) @@ -27,9 +26,6 @@ (defun make-avl-leaf () +avl-leaf+) -(defun make-heap-leaf () - +heap-leaf+) - (defun make-binary-tree () (make-bt-leaf))

1 0

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

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

funds-cvs August 2007