StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
6255574
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-06-06T17:12:37.013
FavoriteCount
0
LastActivityDate
2011-06-06T18:11:29.363
LastEditDate
2011-06-06T18:11:29.363
LastEditorUserId
224465
OwnerUserId
224465
ParentId
6254962
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
If you need super-fast sorting, then it might be worthwhile not using an array at all and instead using a linked-list. There are different advantages to each. Primarily, with a linked-list, index-access is slow, while iterating through the list is fast, and linked-lists are not native to AS3 so you'll have to roll your own. On the upside, you may well be able to use some of Polygonal Labs' code: <a href="http://lab.polygonal.de/as3ds/" rel="nofollow">http://lab.polygonal.de/as3ds/</a>. Sorting is very, very fast for nearly-sorted data with a linked list, as this article discusses: <a href="http://lab.polygonal.de/2007/11/26/data-structures-more-on-linked-lists/" rel="nofollow">http://lab.polygonal.de/2007/11/26/data-structures-more-on-linked-lists/</a>. This solution gives you lots more work, but will eventually give you lots more sort-speed too. Hope this helps. -- additional -- I noticed your question in the comments of another answer about "One question however is unanswered - how to perform greedy computations in Flash without hanging it?" For this, essentially the answer is to break your computation over multiple frames, something like this: <pre><code>public function sort():void { addEventListener(Event.ENTER_FRAME, iterateSort); } private function iterateSort():void { var time:int = getTimer() + TARGET_MILLISECONDS_PER_FRAME; var isFinished:Boolean = false; while (!isFinished && getTimer() < time) isFinished = continueSort(); if (isFinished) removeEventListener(Event.ENTER_FRAME, iterateSort); } function continueSort():Boolean { ... implement an 'atom of sort' here, whatever that means ... } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POCustom sorting function bottleneck
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USalecmce
UserOwnerUserId
1. USalecmce
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
CommentsPostId
1. COTo locate a length look up is O(n) and scales linear, as linked lists don't normally cache the length - although it does seem that polygonal does every effort to try and keep it in sync. So if he has 20000+ elements he would need to go from 0-20000+ elements to find the length.
 singulars
 PostPostId
 PO
 UserUserId
 USsimonrichardson

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.