|
Hm. So then is retrieving a single element O(log n)? Or do you mean it
really is a HashMap (with O(1) retrieval) that is "bundled" with a
tree for ordered traversal?
On Wed, Jul 5, 2017 at 10:52 AM, jacobus erps <jacobus.erps@xxxxxxxxx>
wrote:
I'm working on a map implementation that is more like a Java TreeMap,
backed by a red-black binary tree implementation.
So the keys are sorted.
Hm. So then is retrieving a single element O(log n)? Or do you mean it
really is a HashMap (with O(1) retrieval) that is "bundled" with a
tree for ordered traversal?
It supports that the keys/items can be maps too.
How will you prevent duplicate keys, if the keys are mutable?
I will release it in a few months, with full documentation.
I'm sure it will be a welcome addition to the ecosystem.
John Y.
--
This is the IBMi Open Source Roundtable (OpenSource) mailing list
To post a message email: OpenSource@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/opensource
or email: OpenSource-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/opensource.
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.