Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Creating immutable sorted sets from already-ordered data #14

Closed
GoogleCodeExporter opened this issue Apr 7, 2015 · 10 comments
Closed

Comments

@GoogleCodeExporter
Copy link

Occasionally you have a List of elements which you already know to be in
sorted order. The canonical example is the results from a SQL query with an
ORDER BY clause.

You know the data to be sorted, yet you have no way to offer the niceties
of the SortedSet/NavigableSet APIs to your callers. In order to construct a
TreeSet/etc., you must re-engineer the appropriate comparator that can be
used to sort the data -- but the data is already sorted!

I believe the way out of this is a method Sets.immutablePreSortedSet(List).
 This method would copy the elements out of the list, assuming that
whatever order they come out in is the order you want.  It would not demand
a comparator from you (although, if you can provide one, perhaps it should
accept it, as this could speed up some of the operations.  and if you don't
provide one, what should the set's comparator() return?  Should it return a
Comparators.givenOrder()?).

This idea is not fully-formed, but it's a shame to see methods forced to
use List to model data which is often known to be dup-free and is ordered,
not indexed.

Original issue reported on code.google.com by kevin...@gmail.com on 23 Oct 2007 at 4:22

@GoogleCodeExporter
Copy link
Author

This idea needs a lot more thought.

Case 1: you can provide a comparator. In this case, you should provide it -- 
and just
create an ImmutableSortedSet.  Creating that will cause a sort() to happen 
which will
be a no-op, and that's not great but not terrible.  It's possible we could 
provide
another way to create an ISS where you declare your data is already increasing, 
thus
the factory only has to check that each element is higher than the one before 
it, and
doesn't have to call sort().  Meh.

Case 2: you can't provide a comparator. Some complicated database sort was 
done, for
instance. So your comparator becomes an Ordering.givenOrder() over the elements 
you
have. ImmutableSortedSet.inGivenOrder().addAll(list).build(). I kind of like 
this,
but I haven't heard a loud demand for it. (then again, many people are not 
loudly
demanding it but are still returning List from APIs that really should be Sets.)


Original comment by kevin...@gmail.com on 17 Mar 2009 at 5:09

  • Changed title: Creating immutable sorted sets from already-ordered data

@GoogleCodeExporter
Copy link
Author

There's a problem with Case 2. Without a comparator, you can't implement the 
comparator(), headSet(), tailSet(), and subSet() methods. 

Original comment by jared.l....@gmail.com on 13 Aug 2009 at 2:06

@GoogleCodeExporter
Copy link
Author

Could you elaborate on that a bit? E.g. why Ordering.givenOrder()/.explicit() 
wouldn't 
do?

Original comment by jim.andreou on 13 Aug 2009 at 2:20

@GoogleCodeExporter
Copy link
Author

Yeah, those methods would only be able to accept values that are elements in 
the set,
so they'd be a bit crippled, but I'm not sure it's a deal-breaker.

This whole idea still lacks real motivation from users.


Original comment by kevin...@gmail.com on 13 Aug 2009 at 2:43

@GoogleCodeExporter
Copy link
Author

Hmm, alright. Though it wouldn't be any more "crippled" than 
Ordering.explicit() 
itself. And you already decided that it doesn't pay off enough to allow 
defining what 
happens with elements not contained in the list (with something similar to 
nullsFirst()/nullsLast()), with which I agree, so I don't see this as a big 
issue - but 
the real deal-breaker would be indeed lack of enough demand :)

Original comment by jim.andreou on 13 Aug 2009 at 3:05

@GoogleCodeExporter
Copy link
Author

ImmutableSortedSet should guarantee that its items are ordered using the 
comparator() 
order, so it's a good idea to accept the client assumption (that items are 
already 
ordered). But, I think, an acceptable case when the order is checked at the 
construction phase - so ImmutableSortedSet.copyOfSorted(List<E> list) can check 
the 
given list to be correct, and accept it if correct or throw an exception if not.

Original comment by leonidos on 3 Sep 2009 at 7:21

@GoogleCodeExporter
Copy link
Author

[erratum]
In the previous message - I meant "it's not a good idea accept the client 
assumption".

Original comment by leonidos on 10 Sep 2009 at 1:36

@GoogleCodeExporter
Copy link
Author

[deleted comment]

@GoogleCodeExporter
Copy link
Author

Original comment by kevin...@gmail.com on 17 Sep 2009 at 6:02

  • Added labels: Milestone-Post1.0

@GoogleCodeExporter
Copy link
Author

This issue has been moved to the Guava project (keeping the same id number). 
Simply replace 'google-collections' with 'guava-libraries' in your address 
bar and it should take you there.

Original comment by kevinb@google.com on 5 Jan 2010 at 11:09

  • Changed state: Moved

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant