Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. ChecksumTypeSha384 :: ChecksumType

   gi-glib	GI.GLib.Enums

   Use the SHA-384 hashing algorithm (Since: 2.51)

2. ChecksumTypeSha512 :: ChecksumType

   gi-glib	GI.GLib.Enums

   Use the SHA-512 hashing algorithm (Since: 2.36)

3. computeChecksumForBytes :: (HasCallStack, MonadIO m) => ChecksumType -> Bytes -> m (Maybe Text)

   gi-glib	GI.GLib.Functions

   Computes the checksum for a binary data. This is a convenience wrapper for checksumNew, checksumGetString and checksumFree. The hexadecimal string returned will be in lower case. Since: 2.34

4. computeChecksumForData :: (HasCallStack, MonadIO m) => ChecksumType -> ByteString -> m (Maybe Text)

   gi-glib	GI.GLib.Functions

   Computes the checksum for a binary data of length. This is a convenience wrapper for checksumNew, checksumGetString and checksumFree. The hexadecimal string returned will be in lower case. Since: 2.16

5. computeChecksumForString :: (HasCallStack, MonadIO m) => ChecksumType -> Text -> Int64 -> m (Maybe Text)

   gi-glib	GI.GLib.Functions

   Computes the checksum of a string. The hexadecimal string returned will be in lower case. Since: 2.16

6. testSummary :: (HasCallStack, MonadIO m) => Text -> m ()

   gi-glib	GI.GLib.Functions

   Set the summary for a test, which describes what the test checks, and how it goes about checking it. This may be included in test report output, and is useful documentation for anyone reading the source code or modifying a test in future. It must be a single line. This should be called at the top of a test function. For example:

   C code

   static void
   test_array_sort (void)
   {
   g_test_summary ("Test my_array_sort() sorts the array correctly and stably, "
   "including testing zero length and one-element arrays.");
   
   …
   }
   

   Since: 2.62

7. module GI.GLib.Structs.Checksum

   GLib provides a generic API for computing checksums (or ‘digests’) for a sequence of arbitrary bytes, using various hashing algorithms like MD5, SHA-1 and SHA-256. Checksums are commonly used in various environments and specifications. To create a new GChecksum, use checksumNew. To free a GChecksum, use checksumFree. GLib supports incremental checksums using the GChecksum data structure, by calling checksumUpdate as long as there’s data available and then using checksumGetString or Checksum.get_digest() to compute the checksum and return it either as a string in hexadecimal form, or as a raw sequence of bytes. To compute the checksum for binary blobs and nul-terminated strings in one go, use the convenience functions computeChecksumForData and computeChecksumForString, respectively. Since: 2.16

8. newtype Checksum

   gi-glib	GI.GLib.Structs.Checksum

   Memory-managed wrapper type.

9. Checksum :: ManagedPtr Checksum -> Checksum

   gi-glib	GI.GLib.Structs.Checksum

   No documentation available.

10. checksumCopy :: (HasCallStack, MonadIO m) => Checksum -> m Checksum

    gi-glib	GI.GLib.Structs.Checksum

    Copies a Checksum. If checksum has been closed, by calling checksumGetString or g_checksum_get_digest(), the copied checksum will be closed as well. Since: 2.16

Page 103 of many | Previous | Next