StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
18899933
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-09-19T16:15:29.257
FavoriteCount
0
LastActivityDate
2013-09-19T16:28:19.533
LastEditDate
2013-09-19T16:28:19.533
LastEditorUserId
302221
OwnerUserId
302221
ParentId
13663011
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
<ol> <li>No they do not do the same. <pre><code>while (ridesIterator.hasNext()) { ridesIterator.next(); Corsa previous = ridesIterator.previous(); //rides.get(i-1) Corsa current = ridesIterator.next(); //rides.get(i) </code></pre> The variables previous and current would contain the same "Corsa" value, see the <a href="http://docs.oracle.com/javase/6/docs/api/java/util/ListIterator.html" rel="nofollow">ListIterator documentation</a> for details (iterators are "in between" positions). The correct code would look as follows: <pre><code>while (ridesIterator.hasNext()) { Corsa previous = ridesIterator.next(); //rides.get(i-1) if(!ridesIterator.hasNext()) break; // We are already at the last element Corsa current = ridesIterator.next(); //rides.get(i) ridesIterator.previous(); // going back 1, to start correctly next time </code></pre></li> <li>The code would actually look exactly the same, only the interpretation (as shown in the comments) would be different: <pre><code>while (ridesIterator.hasNext()) { Corsa previous = ridesIterator.next(); //rides.get(i) if(!ridesIterator.hasNext()) break; // We are already at the last element Corsa current = ridesIterator.next(); //rides.get(i+1) ridesIterator.previous(); // going back 1, to start correctly next time </code></pre></li> </ol> From a (premature?) optimization viewpoint the ListIterator implementation is better. <ul> <li>LinkedList is a doubly-linked list which means that each element links to both its predecessor (previous) as well as its successor (next). So it does 3 referals per loop. => 3*N</li> <li>Each get(i) needs to go through all previous elements to get to the i index position. So on average N/4 referals per loop. (You'd think N/2, but LinkedList starts from the beginning or the end of the list.) => 2 * N * N/4 == N^2 /2</li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POOptimization: replace for loop with ListIterator
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USSteven Geens
UserOwnerUserId
1. USSteven Geens
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
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.