StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

USWill Ness
primarykey
Id
849891
data
Age
CreationDate
2011-07-18T11:05:00.550
DownVotes
369
LastAccessDate
2018-09-01T22:27:50.047
Reputation
39772
UpVotes
8212
Views
5209
AccountId
453089
DisplayName
Will Ness
EmailHash
text
Location
AboutMe
<a href="http://en.wikipedia.org/wiki/Analysis_of_algorithms#Empirical_orders_of_growth" rel="nofollow noreferrer"> O Gℎ, !</a> YOUR LANGUAGE IS NOT high-level ENOUGH <a href="http://stackoverflow.com/questions/2211990/how-to-implement-an-efficient-infinite-generator-of-prime-numbers-in-python/10733621#10733621"><code>primes =</code></a><a href="http://stackoverflow.com/questions/12559788/parallel-algorithms-for-generating-prime-numbers-possibly-using-hadoops-map-re/12563800#12563800"><code>[2..] \</code></a><a href="http://stackoverflow.com/questions/622/most-efficient-code-for-the-first-10000-prime-numbers/10302076#10302076"><code>[[p², p²+p..] | p <- primes]</code></a> <a href="http://stackoverflow.com/questions/11234632/monads-with-join-instead-of-bind/11249714#11249714"><code>((g<=<f)=<<) = (g=<<) . (f=<<) = join . (g<$>) . join . (f<$>)</code></a> <a href="https://stackoverflow.com/questions/34545818/is-monad-bind-operator-closer-to-function-composition-chaining-or-functi/34561605#34561605"><code>(<$>) :: (a -> b) -> f a -> f b ; (<*>) :: f (a -> b) -> f a -> f b ; (=<<) :: (a -> m b) -> m a -> m b ; ($) :: (a -> b) -> a -> b</code></a> <blockquote> in a declarative language, <code>length(a) == 0</code> is the same as <code>null(a)</code>, and <code>[y | x <- [1..], y <- []]</code> is just <code>[]</code>. </blockquote> <a href="http://stackoverflow.com/questions/34888245/alan-kays-eval-apply-einstein-moment/34910496#34910496"><code>apply (FUNARG lambda env) xs a = apply lambda xs env</code></a> <a href="http://stackoverflow.com/questions/10843563/conda-condi-conde-condu/10848902#10848902"><code>(g ~~>! h) f x = case g x of [] -> f x; (y:_) -> h y</code></a> <a href="http://stackoverflow.com/questions/12480291/new-state-of-the-art-in-unlimited-generation-of-hamming-sequence/12482897#12482897"><code>1:foldr (\n s->fix (merge s.(n:).map (n*))) [] [2,3,5]</code></a> <a href="http://stackoverflow.com/questions/29992904/enumerate-factors-of-a-number-directly-in-ascending-order-without-sorting/29997557#29997557"><code>ordfactors = foldr g [1] . reverse . primePowers where</code></a> <a href="http://stackoverflow.com/questions/10126285/generating-integers-in-ascending-order-using-a-set-of-prime-numbers/10160054#10160054"><code>slice hi w = (c, sortBy (compare `on` fst) b) where</code></a> <hr> <a href="http://stackoverflow.com/questions/20622945/how-to-do-a-powerset-in-drracket/20623487#20623487">What's in a powerset? A set's subsets...</a> <hr> <a href="http://stackoverflow.com/questions/9050725/call-cc-implementation/9068928#9068928"><code>(define (call/cc-cps proc k) (proc k k))</code></a> <code>(define (list . xs) xs)</code> <hr> <a href="https://stackoverflow.com/questions/39438091/how-monads-are-considered-pure/39647091#39647091">How Monads are considered Pure?</a> <a href="https://stackoverflow.com/questions/44117197/why-does-haskells-bind-function-take-a-function-from-non-monadic-to-monadic/44118041#44118041">Monads are EDSLs</a>: <code>do { [1,2,3] ; [4,5] } => do { x <- [1,2,3] ; do { y <- [4,5] ; return y }} => {for x in [1,2,3] : {for y in [4,5] : {yield y}}} => [4,5,4,5,4,5]</code>
WebsiteUrl
plurals
PostsLastEditorUserIdLastEditDate
1. PO
 singulars
 PostTypePostTypeId
 PTTagWiki
2. PO
 singulars
 PostTypePostTypeId
 PTTagWikiExerpt
3. PO
 singulars
 PostTypePostTypeId
 PTTagWiki
PostsOwnerUserIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesUserIdCreationDate
CommentsUserIdCreationDate

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.