homepage: ''
changelog-type: ''
hash: f8362b4a68562b9afbcd727ff64c1a303970df3a032e0033d2f4c094c3501df3
test-bench-deps:
  bytestring: '>=0.10.4 && <0.11'
  base: '>=4.5 && <4.15'
  xor: -any
  criterion: ^>=1.5.6
  ghc-byteorder: '>=4.11.0.0 && <4.12'
  tasty-quickcheck: ^>=0.10
  tasty-hunit: ^>=0.10
  tasty: ^>=1.2.3
  QuickCheck: ^>=2.14
maintainer: hvr@gnu.org
synopsis: Efficient XOR masking
changelog: ''
basic-deps:
  bytestring: ^>=0.10.4
  base: '>=4.5 && <4.15'
  ghc-byteorder: ^>=4.11.0.0
all-versions:
- 0.0.1.0
author: Herbert Valerio Riedel
latest: 0.0.1.0
description-type: haddock
description: |-
  This package provides efficient implementations of routines for applying <https://en.wikipedia.org/wiki/Bitwise_operation#XOR bitwise XOR> masks to binary data.

  The currently supported operations (see "Data.XOR" API documentation for more details) are applying

  * 8-bit  wide XOR masks or
  * 32-bit wide XOR masks

  to binary data represented by

  * Strict @ByteString@s,
  * Lazy @ByteString@s,
  * @ShortByteString@s (i.e. @ByteArray#@s), or
  * @CStringLen@ (i.e. @Ptr@s).

  The performance is comparable to portable ISO C99 implementations but this library is implemented as pure Haskell and is thereby compatible with compile targets such as <https://github.com/ghcjs/ghcjs GHCJS>.
license-name: GPL-2.0-or-later

Update from Hackage at 2020-05-17T22:30:00Z
Update from Hackage at 2020-05-17T22:30:00Z
