[elephant-ticket] #53: BTree Sorting improvement for BDB

[elephant]

#53: BTree Sorting improvement for BDB
---------------------+------------------------------------------------------
 Reporter:  Ben Lee  |       Owner:  ieslick
     Type:  defect   |      Status:  new    
 Priority:  major    |   Milestone:         
Component:  db-bdb   |     Version:         
 Keywords:           |  
---------------------+------------------------------------------------------
 right now the sorted btree sorting function is a bit of nasty C code.  i
 have code somewhere which did callbacks instead, i can try to revive that.
 the issue is that the sorter needs to know the underlying lisp
 representation.  this is a screw for unicode strings and bignums.  the C
 code is a hack for 16 bit unicode strings for allegro / lispworks (using
 IBMs ICU stuff), and for the sbcl unicode stuff (using glibc wchar stuff.)
 also bignum sorting is by approximation via floats, which fails after some
 point.  but in hindsight maintaining all this is probably a lose.

-- 
Ticket URL: <http://trac.common-lisp.net/elephant/ticket/53>
elephant <http://common-lisp.net/project/elephant>
elephant