úÎj          provisionalvirkony@gmail.com Each  " data should implement this using  of   class from Data.Digest.TigerHash.Internal. But usually  there is enough to just call  for data which already  have instance for  . AInstant caluculation of Tiger Hash with stack allocated context. Same as tgerHash(, but with Tiger Tree hashing algorithm ECalculate sequence of hashes where each next is calculated on-demand  and only after previous one) using one context for all calculations. - Be sure to prepare sequence wich contains only required for hashing  entries. Same as (, but with Tiger Tree hashing algorithm render  to  as hex-dump render  to : using Base32 encoding (as used in magnet-links and etc.)             !"#$% TigerHash-0.2Data.Digest.TigerHash.InternalData.Digest.TigerHash Data.Digest.TigerHash.ByteStringTigerTreeState TigerState TigerContext initContext updateContext resetContextfinalizeContext TigerHashnewTigerContextnewTigerTreeContextwithTigerContextwithTigerTreeContext TigerHashabletigerHashUpdate tigerHash tigerTreeHash tigerHashListtigerTreeHashList hexTigerHash b32TigerHashresetTigerTreeContext_finalizeTigerTreeContext_updateTigerTreeContext_initTigerTreeContext_sizeofTigerTreeContextresetTigerContext_finalizeTigerContext_updateTigerContext_initTigerContext_sizeofTigerContextbaseGHC.BaseString