StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8812027
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-01-10T23:21:30.730
FavoriteCount
0
LastActivityDate
2012-01-11T23:27:44.700
LastEditDate
2012-01-11T23:27:44.700
LastEditorUserId
35902
OwnerUserId
35902
ParentId
8720073
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
I'm going to give you a general solution for these kind of problems. Most loops can be done effortlessly with a strait forward map, filter or reduce, and if your data structure is recursive, naturally the loop will be a recursion. Your loop, however, is a different kind of loop. Your loop accumulates a result -- which would suggests using reduce -- but the loop also carries a local variable along (pc), so it's not a strait reduce. It's a reasonably common kind of loop. If this was <a href="http://racket-lang.org" rel="nofollow">Racket</a>, I would use <a href="http://planet.plt-scheme.org/package-source/untyped/unlib.plt/3/24/planet-docs/unlib/for.html#%28form._%28%28planet._for..ss._%28untyped._unlib..plt._3._23%29%29._for/fold1%29%29" rel="nofollow">for/fold1</a>, but since it's not, we will have to shoehorn your loop onto reduce. Let's define a function called load which returns two things, the processed code and the processed labels. I will also use a helper function called is-label?. <pre><code>(defn load [asm] (defn is-label? [x] (= (first x) :label)) {:code <<< CODE GOES HERE >>> :labels <<< CODE GOES HERE >>> }) </code></pre> Right now, your loop does two things, it processes the code, and it processes the labels. As much as possible, I try to keep loops to a single task. It makes them easier to understand, and it often reveals opportunities for using the simpler loop constructs. To get the code, we simply need to remove the labels. That's a call to filter. <pre><code> {:code (filter (complement is-label?) asm) :labels <<< CODE GOES HERE >>> } </code></pre> Reduce normally has only one accumulator, but your loop needs two: the result, and the local variable pc. I will package these two into a vector which will be immediately deconstructed by the body of the loop. The two slots of the vector will be my two local variables. The initial values for these two variables appear as the 2nd argument to reduce. <pre><code> (first (reduce (fn [[result, pc] inst] << MORE CODE >> [{} 0] asm)) </code></pre> (Note how the initial values for the variables are placed far from their declaration. If the body is long this can be hard to read. That's the problem Racket's for/fold1 solves.) Once reduce returns, I call first to discard to the local variable pc and keep just the result. Filling the body of the loop is straight forward. If the instruction is a label, assoc into the result, otherwise increase pc by one. In either case, I construct a vector containing new values for all the local variables. <pre><code> (fn [[result, pc] [_ arg :as inst]] (if (is-label? inst) [(assoc result arg pc) pc] [result (inc pc)])) </code></pre> This technique can be used to convert any accumulator-with-locals loop into a reduce. Here's the full code. <pre><code>(defn load [asm] (defn is-label? [x] (= (first x) :label)) {:code (filter (complement is-label?) asm) :labels (first (reduce (fn [[result, pc] [_ arg :as inst]] (if (is-label? inst) [(assoc result arg pc) pc] [result (inc pc)])) [{} 0] asm))}) </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POIdiomatic Clojure equivalent of this Python code?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USGuillaume Marceau
UserOwnerUserId
1. USGuillaume Marceau
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.