Îõ³h$U+      !"#$%&'()* Safe-InferredÝ Safe-Inferred  Safe-Inferred;   Safe-Inferredq Safe-Inferred§+,-./012 Safe-InferredÖ3456789: Safe-InferredË'storable-recordãWarning: It uses Foldable class and will certainly access the data structure and thus will fail on ;.?You may call it on the record, after re-constructing it lazily: ÁsizeOf . lazy lazy :: Complex a -> Complex a lazy ~(r:+i) = r:+i(storable-recordpeek skeleton ptr fills the skeleton) with data read from memory beginning at ptr,. The skeleton is needed formally for using <Ò. For instance when reading a list, it is not clear, how many elements shall be read. Using the skeleton you can give this information and you also provide information that is not contained in the element type a. For example you can call peek (replicate 10 ()) ptr0for reading 10 elements from memory starting at ptr.)storable-recordLike ( but uses =! for construction of the result. = would be in class Pointed: if that would exist. Thus we use the closest approximate >.&'()*&'(*) Safe-Inferredû?@ABÃ       !"#$%  &'(&)*&+,&+-.+storable-record-0.0.6-pPGzHtovLxHvUfCtNOHczForeign.Storable.FixedArrayForeign.Storable.NewtypeForeign.Storable.RecordForeign.Storable.Record.TupleForeign.Storable.Traversable"Foreign.Storable.RecordMinimalSize Foreign.Storable.RecordReaderPtr(Foreign.Storable.TraversableUnequalSizesroundUp sizeOfArraypokeNextpeekNextrunsizeOf alignmentpeekpokeAccess Dictionaryelement$fApplicativeBox $fFunctorBox$fMonoidAlignment$fSemigroupAlignment$fApplicativeAccess$fFunctorAccessStorableTuplegetTuple$fArbitraryTuple$fStorable(,,,)$fStorable(,,) $fStorable(,)$fStorableTuple $fEqTuple $fShowTuplepeekApplicativebaseGHC.Err undefinedData.Traversable TraversableGHC.Basepure Applicative