úÎ!63i     None"#@AEMXmt dataflowerMutable state that holds an a. dataflower( is the type of all dataflow operations. dataflower erases the type it wraps. dataflower1Class of entities that can be incremented by one. dataflowerAn < is a typed reference to a computational vertex that takes as as its input. dataflower,s represent instants in the causal timeline. dataflowerGet the next input Epoch. dataflower%Retrieve the vertex for a given edge. dataflower&Store a provided vertex and obtain an  that refers to it. dataflowerStore a provided finalizer. dataflower Create a  initialized to the provided a. dataflowerRead the value stored in the . dataflower"Overwrite the value stored in the . dataflowerUpdate the value stored in . dataflowerSend an . item to be worked on to the indicated vertex. !"#$%&None Xm" dataflower-Construct a vertex with internal state. Like  , I requires a procedure to invoke on each input. It also needs an initial state< value and a procedure to call when all inputs for a given  value have been delivered. NB: Until the finalizer has been called for a particular timestamp, a stateful vertex must be capable of accepting data for multiple timestamps simultaneously.  dataflowerXConstruct a vertex with no internal state. The given procedure is invoked on each input.‡ing to a stateless vertex is effectively a function call and will execute in the caller's thread. By design this is a cheap operation.  dataflower?Construct an output vertex that stores items into the provided 'F. The first argument is an update function so that, for example, the ' could contain a list of o&s and the update function could then cons new items onto the list.  dataflowerNConstruct a vertex that pretty-prints items and passes them through unchanged.  dataflower5Construct a vertex that discards anything sent to it. dataflowerThe initial state value. dataflowerThe input handler. dataflowerThe finalizer. Timely Dataflow for Haskell (c) Double Crown Gaming Co. 2020BSD3jesse.kempf@doublecrown.co experimentalNonem*_  dataflower<Construct a stateless vertex that sends each input to every  in the output list. dataflowersConstruct a stateless vertex that applies the provided function to every input and sends the result to the output. dataflower1Construct a stateful vertex with two input edges. dataflower3Construct a stateful vertex with three input edges.  Timely Dataflow for Haskell (c) Double Crown Gaming Co. 2020BSD3jesse.kempf@doublecrown.co experimentalNone"#m1Q dataflowerA ! represents a fully-preprocessed & that may be executed against inputs. dataflowerTake a  which takes i!s as input and compile it into a . dataflower-Feed a traversable collection of inputs to a *. All inputs provided will have the same  associated with them.  Safem2()*+,-./Nonem3] dataflower%Run a dataflow with a list of inputs.0      !"#$%& '()*+,-./012345)dataflower-0.2.0.0-1hHBSN1bKEvBdQLh1VezSgDataflowDataflow.Operators Test.DataflowDataflow.PrimitivesDataflow.VerticesPaths_dataflowerStateRefEdge Timestamp readState writeState modifyStatesendstatefulVertexstatelessVertex outputTVartracediscardfanoutmapjoin2join3Programcompileexecute runDataflow ErasedType IncrementableincrementEpoch lookupVertexregisterVertexregisterFinalizernewStateinputVertexStatefulVertexStatelessVertex DataflowStateinitDataflowStateduplicateDataflowStatefinalizebase GHC.Conc.SyncTVarversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName