StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
9550167
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-03-03T21:47:31.627
FavoriteCount
0
LastActivityDate
2012-03-03T21:53:05.273
LastEditDate
2012-03-03T21:53:05.273
LastEditorUserId
635998
OwnerUserId
635998
ParentId
9549991
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
I think you are confusing two different things. A <code>TreeMap</code> is implemented as a Red-Black Tree. Per the Java doc: <blockquote> A Red-Black tree based NavigableMap implementation. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on which constructor is used. This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to Algorithms. </blockquote> So, in essence if you want to have a predictable ordering of your keys you should either leave the TreeMap to order your keys by using natural ordering or implement the <code>Comparator</code> interface yourself. Again, from the Javadoc: <blockquote> Note that the ordering maintained by a tree map, like any sorted map, and whether or not an explicit comparator is provided, must be consistent with equals if this sorted map is to correctly implement the Map interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Map interface is defined in terms of the equals operation, but a sorted map performs all key comparisons using its compareTo (or compare) method, so two keys that are deemed equal by this method are, from the standpoint of the sorted map, equal. The behavior of a sorted map is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Map interface. </blockquote> Now, it isn't clear if you want to place your keys in the way that I mentioned (i.e natural ordering) or in another way (i.e. insertion order or something else?). For example, if you prefer insertion order the <a href="http://docs.oracle.com/javase/7/docs/api/java/util/LinkedHashMap.html" rel="nofollow">LinkedHashMap</a> might prove better for your case. If something else is the case please specify it :]. 
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POUnderstanding TreeMaps
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USKounavi
UserOwnerUserId
1. USKounavi
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.