StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
628319
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2009-03-09T22:41:52.637
FavoriteCount
0
LastActivityDate
2009-03-09T23:07:52.200
LastEditDate
2009-03-09T23:07:52.200
LastEditorUserId
9047
OwnerUserId
9047
ParentId
628192
PostTypeId
2
Score
4
ViewCount
0
LastEditorDisplayName
Ori Pessach
text
Body
If you're looking for an implementation of an efficient container type for Python implemented using something like a balanced search tree (A Red-Black tree for example) then it's not part of the standard library. I was able to find this, though: <a href="http://www.brpreiss.com/books/opus7/" rel="nofollow noreferrer">http://www.brpreiss.com/books/opus7/</a> The source code is available here: <a href="http://www.brpreiss.com/books/opus7/public/Opus7-1.0.tar.gz" rel="nofollow noreferrer">http://www.brpreiss.com/books/opus7/public/Opus7-1.0.tar.gz</a> I don't know how the source code is licensed, and I haven't used it myself, but it would be a good place to start looking if you're not interested in rolling your own container classes. There's <a href="http://linux.softpedia.com/get/Programming/Libraries/pyavl-43893.shtml" rel="nofollow noreferrer">PyAVL</a> which is a C module implementing an AVL tree. Also, <a href="http://mail.python.org/pipermail/python-list/2007-September/628938.html" rel="nofollow noreferrer">this thread</a> might be useful to you. It contains a lot of suggestions on how to use the bisect module to enhance the existing Python dictionary to do what you're asking. Of course, using insort() that way would be pretty expensive for insertion and deletion, so consider it carefully for your application. Implementing an appropriate data structure would probably be a better approach. In any case, to understand whether you should keep the data structure sorted or sort it when you iterate over it you'll have to know whether you intend to insert a lot or iterate a lot. Keeping the data structure sorted makes sense if you modify its content relatively infrequently but iterate over it a lot. Conversely, if you insert and delete members all the time but iterate over the collection relatively infrequently, sorting the collection of keys before iterating will be faster. There is no one correct approach. 
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POPython equivalent to java.util.SortedSet?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USOri Pessach
UserOwnerUserId
1. USOri Pessach
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.