úÎ »     $Constructors for the list instance. Constructors for the  instance. Constructors for the  instance.  BTreat the wrapped value as an atomic structure. This has the same  effect as a , but allows you to use the   < interface. This is also necessary for the leaves of most  structures. 7A structure type is one which represents any lazy data ' structure. With the exception of the   newtype wrapper, there , is little reason to define an instance of   for completely D strict types. This is because the entire thing must be defined at / once anyway, so you might as well just use a . !A type representing the structure's constructors by > themselves along with any strict data to go along with the  head of the structure. =The internal representation of the handle for writing values  in IO. =The result type from writing the head of the structure. This 0 is to access deeper levels of the structure. 7Create a new structure and a handle for writing to it. 8Write the specified constructor to the given handle and ? return whatever other handles are necessary to write deeper  levels of the structure. =Write the constructor for a structure with only one possible  structure, assuming that the   type for that type is  ().         !The impure back of a pure queue. A pure queue. -Create both ends of a procrastinating queue. Push to the back of an open  . If the  has  been closed, returns  . Close a . This finalizes the  and means that it / is safe to evaluate all the way to the end.  Get the value at the front of a  . Returns   if we  are at the end of a d .  Get the value at the front of a  and return the remainder  of the  . Returns   if we are at the end of a  d . !       !"#$%&'()*procrastinating-structure-1.0.1Data.PVar.StructureData.PVar.QueueListCConsCNilCEitherCRightCLeftCMaybeCJustCNothingCValuegetValue Structure Constructor PStructureInnernewStruc writeStruc writeSoleCon QueueBackQueuenewQueuepushclosepeekpopbase Data.EitherEither Data.MaybeMaybeprocrastinating-variable-1.0.2 Data.PVarPVarQBQF:$ghc-primGHC.BoolFalse