No. Sorted collection maintains order of its elements, and I'm talking about order on [the set of] sequencable collections On 02.08.2015 15:46, jtuchel [via Smalltalk] wrote:
Am 02.08.15 um 14:11 schrieb webwarrior:
I was surprised when discovered that in Pharo comparison is not defined for lists, arrays and similar datastructures.
Because in almost every programming language (F#, Python, Javascript just to name few) you can compare lists, arrays, etc. By convention, the ordering is lexicographical, just like in strings.
BTW: This would be SortedCollection, not OrderedCollection or its superclass. Still I am not convinced that I really need an implementation of #< in SequencableCollection. Too many ways to interpret what greater or equal or lower could mean...
------------------------------------------------------------------------ If you reply to this email, your message will be added to the discussion below: http://forum.world.st/Comparison-for-SequencableCollection-tp4840704p4840706...
To unsubscribe from Comparison for SequencableCollection, click here <http://forum.world.st/template/NamlServlet.jtp?macro=unsubscribe_by_code&nod...>. NAML <http://forum.world.st/template/NamlServlet.jtp?macro=macro_viewer&id=instant...>
-- View this message in context: http://forum.world.st/Comparison-for-SequencableCollection-tp4840704p4840709... Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com.