* [Caml-list] interface of sorted collections @ 2003-10-14 10:39 Christian Lindig 2003-10-15 7:23 ` Florian Hars 0 siblings, 1 reply; 3+ messages in thread From: Christian Lindig @ 2003-10-14 10:39 UTC (permalink / raw) To: Caml Mailing List I have noted that in sorted collections like the Map and Set modules (but also in SML/NJ's ORD_SET and ORD_MAP) it is impossible to find the previous or next element for a given element. This seems strange, given that the keys in these collections are sorted. In my particular application I like to store (nested) intervals in a map, sorted by their starting points. Given a point in an interval, I'd like to obtain it from a sorted collection. This requires either a find_less_equal function, that returns the key for an element if it exists or its predecessor, or a prev_key function, that returns a key's predecessor such that I can use the regular find afterwards. Is there a way to implement this in OCaml without making a copy of the Map module? -- Christian ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners ^ permalink raw reply [flat|nested] 3+ messages in thread
* Re: [Caml-list] interface of sorted collections 2003-10-14 10:39 [Caml-list] interface of sorted collections Christian Lindig @ 2003-10-15 7:23 ` Florian Hars 2003-10-15 9:56 ` Damien Doligez 0 siblings, 1 reply; 3+ messages in thread From: Florian Hars @ 2003-10-15 7:23 UTC (permalink / raw) To: Christian Lindig; +Cc: Caml Mailing List Christian Lindig wrote: > I have noted that in sorted collections like the Map and Set modules They are unsorted collections. If you observe some kind of sorting in these collections, it is just an implementation accident. Yours, Florian Hars. ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners ^ permalink raw reply [flat|nested] 3+ messages in thread
* Re: [Caml-list] interface of sorted collections 2003-10-15 7:23 ` Florian Hars @ 2003-10-15 9:56 ` Damien Doligez 0 siblings, 0 replies; 3+ messages in thread From: Damien Doligez @ 2003-10-15 9:56 UTC (permalink / raw) To: Caml Mailing List On Wednesday, October 15, 2003, at 09:23 AM, Florian Hars wrote: > Christian Lindig wrote: >> I have noted that in sorted collections like the Map and Set modules > > They are unsorted collections. If you observe some kind of sorting in > these collections, it is just an implementation accident. Not quite. Both Set and Map demand ordered types as arguments, and that's no accident. -- Damien ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners ^ permalink raw reply [flat|nested] 3+ messages in thread
end of thread, other threads:[~2003-10-15 9:55 UTC | newest] Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed) -- links below jump to the message on this page -- 2003-10-14 10:39 [Caml-list] interface of sorted collections Christian Lindig 2003-10-15 7:23 ` Florian Hars 2003-10-15 9:56 ` Damien Doligez
This is a public inbox, see mirroring instructions for how to clone and mirror all data and code used for this inbox; as well as URLs for NNTP newsgroup(s).