<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en" xmlns="http://www.w3.org/2005/Atom"><title>Recent changes to feature-requests</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/" rel="alternate"/><link href="https://sourceforge.net/p/cl-btree/feature-requests/feed.atom" rel="self"/><id>https://sourceforge.net/p/cl-btree/feature-requests/</id><updated>2013-09-26T08:33:01.372000Z</updated><subtitle>Recent changes to feature-requests</subtitle><entry><title>#2 Add latest release to Quicklisp</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/2/?limit=25#59d2" rel="alternate"/><published>2013-09-26T08:33:01.372000Z</published><updated>2013-09-26T08:33:01.372000Z</updated><author><name>Victor Anyakin</name><uri>https://sourceforge.net/u/anyakin/</uri></author><id>https://sourceforge.net8d8db8023ee1dea446d39883e0e0ca01f9313389</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Hi Sami,&lt;/p&gt;
&lt;p&gt;After submitting this feature request I realized that it might be really reasonable to maintain different releases in separate packages/systems for not breaking software if the file format changes between different versions.&lt;/p&gt;
&lt;p&gt;If you've got nothing against this, I can submit a request to the Quicklisp projects repository to add &lt;a class="" href="https://sourceforge.net/p/cl-btree/code/HEAD/tree/0.12/"&gt;0.12&lt;/a&gt; as &lt;code&gt;cl-btree-0.12&lt;/code&gt;.&lt;/p&gt;
&lt;p&gt;But of course, I think that having a single &lt;code&gt;cl-btree&lt;/code&gt; system to load is preferable to creating a new Quicklisp project for each release. Probably creating a &lt;code&gt;current-release&lt;/code&gt; directory in the repository and using it as a place where the latest release sources are copied to would do the trick.&lt;/p&gt;
&lt;p&gt;Thanks!&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#2 Add latest release to Quicklisp</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/2/?limit=25#6430" rel="alternate"/><published>2013-09-26T07:47:33.583000Z</published><updated>2013-09-26T07:47:33.583000Z</updated><author><name>smo</name><uri>https://sourceforge.net/u/sami-makinen/</uri></author><id>https://sourceforge.net3937ca4c2f8371a09ac06d52236d0ede18a2caf0</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Hi! &lt;/p&gt;
&lt;p&gt;Thank you for your request and instructions. I'll try the instructions as soon as possible. &lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#2 Add latest release to Quicklisp</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/2/?limit=25#47a7" rel="alternate"/><published>2013-09-25T13:49:59.946000Z</published><updated>2013-09-25T13:49:59.946000Z</updated><author><name>Victor Anyakin</name><uri>https://sourceforge.net/u/anyakin/</uri></author><id>https://sourceforge.net88eeb3c164a2d35167d4a3621de2be097552c385</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;I am sorry, not &lt;code&gt;ql:quicklisp&lt;/code&gt; but &lt;code&gt;ql:quickload&lt;/code&gt;:&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;ql&lt;/span&gt;&lt;span class="o"&gt;:&lt;/span&gt;&lt;span class="n"&gt;quickload&lt;/span&gt; &lt;span class="o"&gt;:&lt;/span&gt;&lt;span class="n"&gt;cl&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;btree&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;Thanks!&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>Add latest release to Quicklisp</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/2/" rel="alternate"/><published>2013-09-25T13:48:58.370000Z</published><updated>2013-09-25T13:48:58.370000Z</updated><author><name>Victor Anyakin</name><uri>https://sourceforge.net/u/anyakin/</uri></author><id>https://sourceforge.net3377547aece1ffdcfec3929083754b33e4c72e9a</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Make it possible to install the latest release using Quicklisp quickload like&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;ql&lt;/span&gt;&lt;span class="o"&gt;:&lt;/span&gt;&lt;span class="n"&gt;quicklisp&lt;/span&gt; &lt;span class="o"&gt;:&lt;/span&gt;&lt;span class="n"&gt;cl&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;btree&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;Instead of the just only current situation when only 0.5 is available.&lt;/p&gt;
&lt;p&gt;Thanks&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>Return multiple values for the same key</title><link href="https://sourceforge.net/p/cl-btree/feature-requests/1/" rel="alternate"/><published>2011-02-03T06:22:56Z</published><updated>2011-02-03T06:22:56Z</updated><author><name>Tzaddi</name><uri>https://sourceforge.net/u/tzaddi/</uri></author><id>https://sourceforge.net11322b2482a68ab2c43d68715addafb270166640</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;It would be great to expose a function that returned all values associated with a particular key.  I see that it is possible to add many values for one key, but I can only retrieve the most recently inserted value.&lt;/p&gt;
&lt;p&gt;Thanks!&lt;/p&gt;&lt;/div&gt;</summary></entry></feed>