StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8275084
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-11-25T23:25:49.623
FavoriteCount
0
LastActivityDate
2011-11-25T23:25:49.623
LastEditDate
LastEditorUserId
0
OwnerUserId
247533
ParentId
8274726
PostTypeId
2
Score
4
ViewCount
0
LastEditorDisplayName
text
Body
Don't overestimate how big <code>log(M)</code> is, for a large list of length <code>M</code>. For a list containing a billion items, <code>log(M)</code> is only 30. So sorting and taking is not such an unreasonable method after all. In fact, sorting an array of integers is far faster thank sorting a list (and the array takes less memory also), so I would say that your best (brief) bet (which is safe for short or empty lists thanks to <code>takeRight</code>) <pre><code>val arr = s.toArray java.util.Arrays.sort(arr) arr.takeRight(N).toList </code></pre> There are various other approaches one could take, but the implementations are less straightforward. You could use a partial quicksort, but you have the same problems with worst-case scenarios that quicksort does (e.g. if your list is already sorted, a naive algorithm might be <code>O(n^2)</code>!). You could save the top <code>N</code> in a ring buffer (array), but that would require <code>O(log N)</code> binary search every step as well as <code>O(N/4)</code> sliding of elements--only good if <code>N</code> is quite small. More complex methods (like something based upon dual pivot quicksort) are, well, more complex. So I recommend that you try array sorting and see if that's fast enough. (Answers differ if you're sorting objects instead of numbers, of course, but if your comparison can always be reduced to a number, you can <code>s.map(x => /* convert element to corresponding number*/).toArray</code> and then take the winning scores and run through the list again, counting off the number that you need to take of each score as you find them; it's a bit of bookkeeping, but doesn't slow things down much except for the map.)
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POTop n items in a List ( including duplicates )
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USRex Kerr
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.