From: Robert Klemme Date: 2004-08-31T05:30:25+09:00 Subject: Re: Flexible operations for a collection class "Robert Klemme" schrieb im Newsbeitrag news:2phgo8Fks0f8U1@uni-berlin.de... The example I presented is not complete: it lacks proper hash and equals methods. > However, if you need to sort often compared to insert and delete operations, > then a sorted data structure (like an ordered tree) is more efficient. An additional note: if you change the sorting criterium often, then a collection that maintains order is likely to be not so efficient since you need to resort the whole thing on every sort criterium change. Kind regards robert