If you are creating it one and not adding much (mostly iterating and
reading) then create a sorted-set locally and put it into
Hazelcast-Queue for sorted iteration. (removes are fine but you should
not be adding as it will break the sorting)
If you are updating the set a lot then you will have to work with
existing Hazelcast Set (unsorted) and sort them locally each time you
use it. (reads are expensive).
Neither of the two sounds good but distributed sorted set is quite
challenging by definition.
twitter @oztalip
> --
> You received this message because you are subscribed to the Google Groups "Hazelcast" group.
> To post to this group, send email to haze...@googlegroups.com.
> To unsubscribe from this group, send email to hazelcast+...@googlegroups.com.
> For more options, visit this group at http://groups.google.com/group/hazelcast?hl=en.
>
>