[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
RE: [RDDL] Java Object Model
- From: Jonathan Borden <email@example.com>
- To: Jeff Rafter <firstname.lastname@example.org>
- Date: Mon, 29 Jan 2001 08:43:46 -0500
Jeff Rafter wrote:
> Potentially naive question:
potential not realized :-)
> Is the use of a SortedMap (TreeMap in general) simply for listing the keys
> or is there an explicit reason this interface was chosen. Reading the
> TreeMap JavaDoc it says that it sorts the keys in natural order but can be
> modified with a comparator. Is "natural order" the order by which the
> items were read into the cahce? Or are they typically going to
> sorted with
> an order of importance-- one schema type before another?
I've used SortedMap simply to allow selection of resources based on
alphanumberic order. For example suppose:
The only meaning of such nesting is how a fragment id for the rddl:resource
is generated i.e.
(these are xpointers / child seq's according to XPointer)
this allows the simple idiom for obtaining the 'members of a collection'
that's just an implementation detail. It is not normative to RDDL. It has to
do with how an XPointer is generated to any node in any XML document. I'm
simply using XPointer to create collections.
> I am looking to implement the API in another language and am trying to
> figure out what type of List I should return as I don't have a SortedMap
If the list inserts elements in alphanumeric order such an accessor is easy
to write. It just turns out that a Red-Black tree is the most efficient
mechanism I know to do this -- a pure hash map is great for key accession
but not good at range of key accession.
> Sorry if this message proves flammable... <grin/>
Not at all. This is all for the purpose of discussion.