StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4927499
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-02-07T22:40:16.070
FavoriteCount
0
LastActivityDate
2011-02-07T22:40:16.070
LastEditDate
LastEditorUserId
0
OwnerUserId
237428
ParentId
4927387
PostTypeId
2
Score
3
ViewCount
0
LastEditorDisplayName
text
Body
<p>A list comprehension is guaranteed to look at every element of the list. You want <a href="http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#v%3atakeWhile" rel="nofollow"><code>takeWhile :: (a -> Bool) -> [a] -> [a]</code></a>. With it, your list is simply <code>takeWhile (< 1000000) $ map fib [1..]</code>. The <code>takeWhile</code> function simply returns the leading portion of the list which satisfies the given predicate; there's also a similar <a href="http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#v%3adropWhile" rel="nofollow"><code>dropWhile</code></a> function which drops the leading portion of the list which satisfies the given predicate, as well as <a href="http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#v%3aspan" rel="nofollow"><code>span :: (a -> Bool) -> [a] -> ([a], [a])</code></a>, which is just <code>(takeWhile p xs, dropWhile p xs)</code>, and the similar <a href="http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#v%3abreak" rel="nofollow"><code>break</code></a>, which breaks the list in two when the predicate is true (and is equivalent to <code>span (not . p)</code>. Thus, for instance:</p> <ul> <li><code>takeWhile (< 3) [1,2,3,4,5,4,3,2,1] == [1,2]</code></li> <li><code>dropWhile (< 3) [1,2,3,4,5,4,3,2,1] == [3,4,5,4,3,2,1]</code></li> <li><code>span (< 3) [1,2,3,4,5,4,3,2,1] == ([1,2],[3,4,5,4,3,2,1])</code></li> <li><code>break (> 3) [1,2,3,4,5,4,3,2,1] == ([1,2,3],[4,5,4,3,2,1])</code></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSetting upper limit to the input set according to the output function
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USAntal Spector-Zabusky
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
3. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
CommentsPostId
1. COMany thanks. I hadn't gotten to this part of Haskell yet. It's something I've just started with, and I like it already.
  singulars
  PostPostId
  PO
  UserUserId
  USAeveus

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.