Checksum

Checksum

Object Hierarchy:

Description:

[ Compact ]
[ Version ( since = "2.16" ) ]
[ CCode ( free_function = "g_checksum_free" , type_id = "G_TYPE_CHECKSUM" ) ]
public class 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 [ctor@GLib.Checksum.new]. To free a `GChecksum`, use [method@GLib.Checksum.free].

GLib supports incremental checksums using the `GChecksum` data structure, by calling [method@GLib.Checksum.update] as long as there’s data available and then using [method@GLib.Checksum.get_string] or [method@GLib.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 [func@GLib.compute_checksum_for_data] and [func@GLib.compute_checksum_for_string], respectively.

Namespace: GLib

Package: glib-2.0

Content:

Static methods:

public static string compute_for_bytes (ChecksumType checksum_type, Bytes data)
Computes the checksum for a binary data.
public static string compute_for_data (ChecksumType checksum_type, uchar[] data)
Computes the checksum for a binary data of data.length.
public static string compute_for_string (ChecksumType checksum_type, string str, size_t length = -1)
Computes the checksum of a string.

Creation methods:

public Checksum (ChecksumType checksum_type)
Creates a new Checksum, using the checksum algorithm checksum_type.

Methods:

public Checksum copy ()
Copies a Checksum.
public void get_digest (uint8[] buffer, ref size_t digest_len)
Gets the digest from this as a raw binary vector and places it into buffer.
public unowned string get_string ()
Gets the digest as a hexadecimal string.
public void update (uchar[] data, size_t length)
Feeds data into an existing Checksum .