StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
5286918
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-03-13T01:58:11.513
FavoriteCount
0
LastActivityDate
2011-03-13T02:21:19.080
LastEditDate
2011-03-13T02:21:19.080
LastEditorUserId
657132
OwnerUserId
657132
ParentId
565430
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
I plan on releasing this code in the next version of <a href="http://jpaq.org/" rel="nofollow">jPaq</a>, but until then, you can use this if your goal is to do a deep copy of arrays: <pre><code>Array.prototype.clone = function(doDeepCopy) { if(doDeepCopy) { var encountered = [{ a : this, b : [] }]; var item, levels = [{a:this, b:encountered[0].b, i:0}], level = 0, i = 0, len = this.length; while(i < len) { item = levels[level].a[i]; if(Object.prototype.toString.call(item) === "[object Array]") { for(var j = encountered.length - 1; j >= 0; j--) { if(encountered[j].a === item) { levels[level].b.push(encountered[j].b); break; } } if(j < 0) { encountered.push(j = { a : item, b : [] }); levels[level].b.push(j.b); levels[level].i = i + 1; levels[++level] = {a:item, b:j.b, i:0}; i = -1; len = item.length; } } else { levels[level].b.push(item); } if(++i == len && level > 0) { levels.pop(); i = levels[--level].i; len = levels[level].a.length; } } return encountered[0].b; } else { return this.slice(0); } }; </code></pre> The following is an example of how to call this function to do a deep copy of a recursive array: <pre><code>// Create a recursive array to prove that the cloning function can handle it. var arrOriginal = [1,2,3]; arrOriginal.push(arrOriginal); // Make a shallow copy of the recursive array. var arrShallowCopy = arrOriginal.clone(); // Prove that the shallow copy isn't the same as a deep copy by showing that // arrShallowCopy contains arrOriginal. alert("It is " + (arrShallowCopy[3] === arrOriginal) + " that arrShallowCopy contains arrOriginal."); // Make a deep copy of the recursive array. var arrDeepCopy = arrOriginal.clone(true); // Prove that the deep copy really works by showing that the original array is // not the fourth item in arrDeepCopy but that this new array is. alert("It is " + (arrDeepCopy[3] !== arrOriginal && arrDeepCopy === arrDeepCopy[3]) + " that arrDeepCopy contains itself and not arrOriginal."); </code></pre> You can play around with this code <a href="http://jsbin.com/jPaq-Array.clone/2" rel="nofollow">here at JS Bin</a>.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PO(Deep) copying an array using jQuery
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USChris West
UserOwnerUserId
1. USChris West
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.