StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
5773136
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-04-24T20:45:06.383
FavoriteCount
0
LastActivityDate
2011-04-24T20:45:06.383
LastEditDate
LastEditorUserId
0
OwnerUserId
83805
ParentId
5773070
PostTypeId
2
Score
31
ViewCount
0
LastEditorDisplayName
text
Body
<blockquote> How are arrays, having O(1) time to access or modify an indexed element, implemented in Haskell </blockquote> They are implemented via primitive operations in the runtime system for memory reads and writes. The safety of the side effecting action of destructively writing to memory is ensured via the use of monads to linearize access to the mutable state. Looking at the <a href="http://hackage.haskell.org/package/primitive" rel="noreferrer"><code>primitive</code></a> package for Haskell arrays (in <code>IO</code> or <code>ST</code>), you can see that the implementations is in terms of <a href="http://hackage.haskell.org/trac/ghc/wiki/Commentary/PrimOps" rel="noreferrer">GHC's primops</a>: <pre><code>-- | Create a new mutable array of the specified size and initialise all -- elements with the given value. newArray :: PrimMonad m => Int -> a -> m (MutableArray (PrimState m) a) newArray (I# n#) x = primitive (\s# -> case newArray# n# x s# of (# s'#, arr# #) -> (# s'#, MutableArray arr# #)) -- | Read a value from the array at the given index. readArray :: PrimMonad m => MutableArray (PrimState m) a -> Int -> m a readArray (MutableArray arr#) (I# i#) = primitive (readArray# arr# i#) -- | Write a value to the array at the given index. writeArray :: PrimMonad m => MutableArray (PrimState m) a -> Int -> a -> m () writeArray (MutableArray arr#) (I# i#) x = primitive_ (writeArray# arr# i# x) </code></pre> That is, in terms of: <ul> <li>newArray#</li> <li>readArray#</li> <li>writeArray#</li> </ul> which are primitive (hardware accelerated ;) services for operating on memory provided by the language runtime. Mechanisms for giving type safety to destructive memory effects were introduced to Haskell by the Launchbury and Peyton-Jones paper, <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3299" rel="noreferrer">Lazy Functional State Threads</a>, which introduces the <code>ST</code> monad and primitives for mutable arrays.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow are mutable arrays implemented in Haskell?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USDon Stewart
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POHow are mutable arrays implemented in Haskell?
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
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. 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.