StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4450007
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-12-15T12:46:23.213
FavoriteCount
0
LastActivityDate
2010-12-15T13:17:31.530
LastEditDate
2010-12-15T13:17:31.530
LastEditorUserId
381744
OwnerUserId
381744
ParentId
4448803
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
You could think about each function as a sequence of steps: <blockquote> by functions How can I duplicate every element of a list with itself twice. </blockquote> To duplicate each element of a list xs, you need to apply a function which, given an argument x, returns the list [x, x], to each element of the list; since this produces a list of lists, you will need to concatenates the results. The concatenated list is the list with each element duplicated: <pre><code>k :: a -> [a] k x = [x,x] g :: (a -> b) -> [a] -> [b] g f [] = [] g f (x:xs) = f x : g f xs duplicate :: [a] -> [a] duplicate = concat . (g k) </code></pre> Since <code>g = map</code> and <code>concat . g = concatMap</code>, the function you are looking for is: <pre><code>duplicate :: [a] -> [a] duplicate = concatMap (\x -> [x,x]) => concatMap (replicate 2) </code></pre> To replace an element a by a value b, iterate over the list with a function which exchanges b for a: <pre><code>f :: Eq a => a -> a -> a -> a f o r x = if x == o then r else x replaceOn :: Eq a => a -> a -> [a] -> [a] replaceOn o r [] = [] replaceOn o r (x:xs) = f o r x : h o r xs </code></pre> Since <code>h = map f</code>, you have: <pre><code>replaceOn :: a -> a -> [a] -> [a] replaceOn o r = map (\x -> if x == o then r else x) </code></pre> I'm not a Haskell expert. However, it helps me to break Haskell problems into sequences of "returned values". These are like "steps" in an imperative language. The steps are composed using combinators, higher order functions, and ordering of functions. You can think about sequencing like: do f to get x; to g with f x to get x', etc.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PODuplicate each element in a Haskell List
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USdanportin
UserOwnerUserId
1. USdanportin
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.