úÎC6> *      !"#$%&'() non-portable experimentallibraries@haskell.orgNone*,An abstract unique object. Objects of type * may be 4 compared for equality and ordering and hashed into +. ,Creates a new object of type *. The value returned will . not compare equal to any other value of type * returned by  previous calls to ,&. There is no limit on the number of  times , may be called. - Hashes a * into an +. Two *s may hash to the 9 same value, although in practice this is unlikely. The + ! returned makes a good hash key. *./,0-*,0-*./,0-NonePThis a reference for incremental computation. Not only does it include a value, D But is also has a list of actions to execute when it is updated. The cached value of the the  9A collection of actions to execute when the value of the  is updated %This is so to references to the same  are not added to   collection The container for a  s dependent s. The type of update actions a 1 for the cached ref a 10 for the unique identifier associated with this  -Recursively call update on the children of a  like thing  Create a new . See  for the 2 version.  Create a new . See  for the 3 version. Read the cached value of a . See  for an 2 version Read the cached value of a . See  for an 3 version  Modify a  and update the children.  See  for the 3 version  Modify a  and update the children.  See  for the 2 version Write a new value into a " and update all of the children.  See  for the 3 version Write a new value into a " and update all of the children.  See  for the 2 version Add a dependent child to the !s children, or any type that has  like  Children  See  for the 2 version Add a dependent child to the !s children, or any type that has  like  Children  See  for the 3 version 40Just checks pointer equality not value equality # 5678 9The input that contains the reference to add children to  The child 3 existentially wrapped up. The important info here  is the unique  id. 5The update action to call when the input is updated. 9The input that contains the reference to add children to  The child 3 existentially wrapped up. The important info here  is the unique  id. 5The update action to call when the input is updated. 9:;<=>4    5678 9:;<=>4None2An expression that can be incrementally updated.   is basically an simple  Applicative  with a cached value. Get the cache i.e. the  from the Tweakable Get the cache and put in an  existential wrapper Read the cache of a . This is nothing more than  + readCache = atomically . readCacheSTM Read the cache of a . See  for an IO version. ??None## is the @ used to create  expressions  Use the @ interface or the @ helpers  ( and ) &Turn a  into a # so it can be combined  with other #s (This is slight variation on A. Use ( and ) avoid explicit  calls to & and . RUnlike Functor the input and output * -> * type can change. There is no reasoning & or laws behind it, it is just sugar. GThe Funktor type class is closed and private. There are only instances  for #, , and . )This is slight variation on B. Use ( and ) avoid explicit  calls to & and . HUnlike Apply, with Comply the input and output * -> * type can change. J Like Funktor, there is no reasoning or laws behind it, it is just sugar. FThe Comply type class is closed and private. There are only instances  for #, , and .  !"#$%&'()CDEFGHIJ  !"#$%&'() #$%&'!"()  !"#$%&'()CDEFGHIJNone0@KLMNOPQBRSTUVWXYZ[\]^_`abcAd#%&()#%%&()e       !"#$%&''()*+,-./012-3456789:./;<=>?@ABCDEFG8HI8JK8HLMNOPQRST8HU8HV8HW8HX8HY8HZ8H[8H\8H]8H^8H_8H`8Ha8Hb8Hc8Hc8Hd8He8Hf8Hg8Hh8Hi8Hj8Hk8Hk8lmn tweak-0.1.0.1Control.Tweak.VarControl.Tweak.TweakableControl.Tweak.InternalData.UniqueSTM Control.Tweak CacheablechildrenAnyVarVar_output _children _identifierChildrenUpdateoutput identifierupdatenewVar newVarSTMreadVar readVarSTM modifyVarSTM modifyVar writeVarSTMwriteVaraddChild addChildSTM TweakablePureAppgetVar getAnyVar readCache readCacheSTMComplyconnectFunktorfcrapMakerrunmakermakeapply.$..*.Uniqueghc-prim GHC.TypesInt newUnique hashUnique uniqSource newUniqueSTM lens-3.9.2Control.Lens.TypeLensbase GHC.Conc.SyncSTMIO$fEqVarRenderrendervarEq varCompare$fCacheableAnyVar$fCacheableVar $fOrdAnyVar $fEqAnyVar $fRenderVar$fOrdVar$fCacheableTweakableControl.Applicative Applicative Data.Functor<$><*>$fComplyMakerMaker$fComplyMakerTweakable$fComplyMakerVar$fFunktorMakerMaker$fFunktorMakerTweakable$fFunktorMakerVar$fApplicativeMaker$fFunctorMakeroptionalliftA3liftA2liftA<**><**>puremanysome<|>empty AlternativegetConstConst unwrapMonad WrapMonad WrappedMonad unwrapArrow WrapArrow WrappedArrow getZipListZipListGHC.Base<$