|Anonymous | Login||10-21-2020 19:12 UTC|
|Main | My View | View Issues | Change Log | Docs|
|Viewing Issue Advanced Details [ Jump to Notes ]||[ View Simple ] [ Issue History ] [ Print ]|
|ID||Category||Severity||Reproducibility||Date Submitted||Last Update|
|0001555||[Squeak] Collections||minor||always||07-26-05 21:30||10-07-05 18:11|
|ETA||none||Fixed in Version||3.9||Product Version||3.9|
|Summary||0001555: [ENH] for Skiplist|
This is an old changeset from 2002 that might be interesting...
Mon Feb 18 08:17:21 CET 2002
This is a ** severe ** refactoring of Skiplists. They are *required* for
Full Text indexing.
If you're using the old skip lists, this changeset will probably do bad
things. You have been warned.
I add comments and make the skiplists act dictionarylike, supporting
key-value and the 'next' operations. They can also act set-like with the
'add' operation. Thus, these skiplists are probably more reusable.
They may be faster than OrderedCollections, so try them out if you don't
like the performance of large OrderedCollections.
This skiplist implementation can handle random inserts into a collection
containing tens of thousands of elements at a rate of .5-2k/sec.
Someone who knows the squeak collections better should try to figure out
whether it should be resubclassed under OrderedCollection or something
|Steps To Reproduce|
|Attached Files||sciplists.cs [^] (7,122 bytes) 07-26-05 21:30|
|07-26-05 21:30||MarcusDenker||New Issue|
|07-26-05 21:30||MarcusDenker||File Added: sciplists.cs|
|10-07-05 18:11||MarcusDenker||Status||new => closed|
|10-07-05 18:11||MarcusDenker||Note Added: 0002801|
|10-07-05 18:11||MarcusDenker||Resolution||open => fixed|
|10-07-05 18:11||MarcusDenker||Fixed in Version||=> 3.9|
| Mantis 1.0.8[^]
Copyright © 2000 - 2007 Mantis Group
36 total queries executed.|
29 unique queries executed.