StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
2839101
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-05-15T06:04:05.010
FavoriteCount
0
LastActivityDate
2010-05-15T06:04:05.010
LastEditDate
LastEditorUserId
0
OwnerUserId
157882
ParentId
2839003
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
As polygenelubricants nicely explained, a <code>SortedMap</code> is sorted by the key, not by the value. However, it's with help of <a href="http://java.sun.com/javase/6/docs/api/java/util/LinkedHashMap.html" rel="nofollow noreferrer"><code>LinkedHashMap</code></a> possible to reorder a <code>Map</code> the way you want. A <code>LinkedHashMap</code> maintains insertion order like a <code>List</code> does. First step is to get hold of the key/value pairs in a sortable data structure, e.g. <code>List<Entry<K, V>></code> which you in turn sort using <a href="http://java.sun.com/javase/6/docs/api/java/util/Collections.html#sort%28java.util.List,%20java.util.Comparator%29" rel="nofollow noreferrer"><code>Collections#sort()</code></a> with help of a <code>Compatator<Entry<K, V>></code> and finally repopulate a <code>LinkedHashMap</code> with it (not a <code>HashMap</code> or you will lose the ordering again). Here's a basic example (leaving obvious runtime exception handling aside): <pre><code>// Prepare. Map<String, String> map = new HashMap<String, String>(); map.put("foo", "bar"); map.put("bar", "waa"); map.put("waa", "foo"); System.out.println(map); // My JVM shows {waa=foo, foo=bar, bar=waa} // Get entries and sort them. List<Entry<String, String>> entries = new ArrayList<Entry<String, String>>(map.entrySet()); Collections.sort(entries, new Comparator<Entry<String, String>>() { public int compare(Entry<String, String> e1, Entry<String, String> e2) { return e1.getValue().compareTo(e2.getValue()); } }); // Put entries back in an ordered map. Map<String, String> orderedMap = new LinkedHashMap<String, String>(); for (Entry<String, String> entry : entries) { orderedMap.put(entry.getKey(), entry.getValue()); } System.out.println(orderedMap); // {foo=bar, waa=foo, bar=waa} </code></pre> Needless to say that this is after all not the right datastructure for your purpose ;)
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSorting in Hash Maps
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USBalusC
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. This table or related slice is empty.
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.