| |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Description | |||||||||||||||||||||||||||
A module containing unsafe ByteString operations. This exposes the ByteString representation and low level construction functions. Modules which extend the ByteString system will need to use this module while ideally most users will be able to make do with the public interface modules. | |||||||||||||||||||||||||||
Synopsis | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Unchecked access | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
A variety of head for non-empty ByteStrings. unsafeHead omits the check for the empty case, so there is an obligation on the programmer to provide a proof that the ByteString is non-empty. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
A variety of tail for non-empty ByteStrings. unsafeTail omits the check for the empty case. As with unsafeHead, the programmer must provide a separate proof that the ByteString is non-empty. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Unsafe ByteString index (subscript) operator, starting from 0, returning a Word8 This omits the bounds check, which means there is an accompanying obligation on the programmer to ensure the bounds are checked in some other way. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
A variety of take which omits the checks on n so there is an obligation on the programmer to provide a proof that 0 <= n <= length xs. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
A variety of drop which omits the checks on n so there is an obligation on the programmer to provide a proof that 0 <= n <= length xs. | |||||||||||||||||||||||||||
Low level interaction with CStrings | |||||||||||||||||||||||||||
Using ByteStrings with functions for CStrings | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(1) construction Use a ByteString with a function requiring a CString. This function does zero copying, and merely unwraps a ByteString to appear as a CString. It is unsafe in two ways:
| |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(1) construction Use a ByteString with a function requiring a CStringLen. This function does zero copying, and merely unwraps a ByteString to appear as a CStringLen. It is unsafe:
| |||||||||||||||||||||||||||
Converting CStrings to ByteStrings | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(n) Build a ByteString from a CString. This value will have no finalizer associated to it, and will not be garbage collected by Haskell. The ByteString length is calculated using strlen(3), and thus the complexity is a O(n). This function is unsafe. If the CString is later modified, this change will be reflected in the resulting ByteString, breaking referential transparency. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(1) Build a ByteString from a CStringLen. This value will have no finalizer associated with it, and will not be garbage collected by Haskell. This operation has O(1) complexity as we already know the final size, so no strlen(3) is required. This funtion is unsafe. If the original CStringLen is later modified, this change will be reflected in the resulting ByteString, breaking referential transparency. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(n) Build a ByteString from a malloced CString. This value will have a free(3) finalizer associated to it. This funtion is unsafe. If the original CStringLen is later modified, this change will be reflected in the resulting ByteString, breaking referential transparency. This function is also unsafe if you call its finalizer twice, which will result in a double free error. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(n) Pack a null-terminated sequence of bytes, pointed to by an Addr# (an arbitrary machine address assumed to point outside the garbage-collected heap) into a ByteString. A much faster way to create an Addr# is with an unboxed string literal, than to pack a boxed string. A unboxed string literal is compiled to a static char [] by GHC. Establishing the length of the string requires a call to strlen(3), so the Addr# must point to a null-terminated buffer (as is the case with "string"# literals in GHC). Use unsafePackAddress if you know the length of the string statically. An example: literalFS = packAddress "literal"# This function is unsafe. If you modify the buffer pointed to by the original Addr# this modification will be reflected in the resulting ByteString, breaking referential transparency. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(1) unsafePackAddressLen provides constant-time construction of ByteStrings which is ideal for string literals. It packs a null-terminated sequence of bytes into a ByteString, given a raw Addr to the string, and the length of the string. This function is unsafe in two ways:
If in doubt, don't use these functions. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
O(1) Construct a ByteString given a Ptr Word8 to a buffer, a length, and an IO action representing a finalizer. This function is not available on Hugs. This function is unsafe, it is possible to break referential transparency by modifying the underlying buffer pointed to by the first argument. Any changes to the original buffer will be reflected in the resulting ByteString. | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
Explicitly run the finaliser associated with a ByteString. References to this value after finalisation may generate invalid memory references. This function is unsafe, as there may be other ByteStrings referring to the same underlying pages. If you use this, you need to have a proof of some kind that all ByteStrings ever generated from the underlying byte array are no longer live. | |||||||||||||||||||||||||||
Produced by Haddock version 0.9 |