https://sourceforge.net/p/cl-btree/news/2011-03-20T20:53:49ZRecent posts to news2011-03-20T20:53:49Z2011-03-20T20:53:49Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.net3cc91e415a34dbc246677d4689739dfebcf7b015

<div class="markdown_content"><p>Added cursor-{set, set-range, delete, put} API calls.<br /> Bug fix to b-tree-cursor-value, exists-p was true even if B-tree was empty.<br /> Cursor still does not work properly with non-unique B-trees.</p></div>

2011-03-13T20:05:05Z2011-03-13T20:05:05Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.neta7e3b4df5e5fbb55e4c5239d744e333063cd4d45

<div class="markdown_content"><p>Bug fix to cursor-first. Did not descend to child nodes to find min value.<br /> Added cursor-prev and cursor-prev-p API functions.</p></div>

2011-03-12T14:01:17Z2011-03-12T14:01:17Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.net8606014aad8ea5ad6b3616a7f1ef9287be4d8c52

<div class="markdown_content"><p>Contains initial cursor implementation. API has currently following functions b-tree:cursor-{open, first, next-p, next, peek}. Cursor does not work with non-unique B-trees as expected right now. Cursor does not iterate over multiple values associated with the key.</p></div>

2011-02-04T22:08:56Z2011-02-04T22:08:56Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.nete0594176d2ff18a727898e55ef495d764898db03

<div class="markdown_content"><p>Added :unique option to b-tree:open/create, if t<br /> (default) creates unique B-tree and if false non-unique. Unique B-tree<br /> replaces old value with new. Non-unique stores values as a list, newest<br /> value is first in a list.</p></div>

2011-02-03T21:26:36Z2011-02-03T21:26:36Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.net1176180fe7f0fbf734a2efb3746975ad2220f2af

<div class="markdown_content"><p>New features:<br /> * b-tree:map has :from and :to keyword parameters to set lower (inclusive) and upper (exclusive) bounds,<br /> * b-tree:search&gt;= finds item greater or equal than given key.</p> <p>Known issues:<br /> * B-tree is not unique, key may have several values but the b-tree:search returns only one value. Thanks for Tzaddi for finding the bug!</p></div>

2011-01-28T21:25:56Z2011-01-28T21:25:56Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.netf5361194993863c3bc0adbd90822b6c65d82ebaf

<div class="markdown_content"><p>Contains fix delete operation.<br /> Added simple performance tester and B-tree validator.</p></div>

2011-01-02T09:54:48Z2011-01-02T09:54:48Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.net5124effd796cfcee3820b782ff298f30d49f483d

<div class="markdown_content"><p>asdf-install installable release. cl-btree depends on cl-unit-test which must be installed first. In SBCL cl-btree can be installed with following commands:</p> <p>(require 'asdf-install)<br /> (asdf-install:install 'cl-unit-test)<br /> (asdf-install:install 'cl-btree-0.3)</p></div>

2010-12-05T20:58:11Z2010-12-05T20:58:11Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.net795c5361979762fb26e9431898b6d64d5fca0d65

<div class="markdown_content"><p>The cl-btree-0.2.tgz package contained dependencies package which is removed from the release. Please checkout those dependencies from<br /> the SourceForge subversion or download packages separately as well.</p></div>

2010-12-05T20:54:58Z2010-12-05T20:54:58Zsmohttps://sourceforge.net/u/sami-makinen/https://sourceforge.netd5b9e7c968f8dde7134f1ba4a3be7d9f872e2983

<div class="markdown_content"><p>This is a complete implementation of disk based B-Tree data structure and has high code coverage with unit tests. </p></div>