name:                 unagi-chan
version:              0.4.1.4
visibility:           public
id:                   unagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba
key:                  unagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba
license:              BSD-3-Clause
maintainer:           brandon.m.simmons@gmail.com
author:               Brandon Simmons
synopsis:             Fast concurrent queues with a Chan-like API, and more
description:
    This library provides implementations of concurrent FIFO queues (for both
    general boxed and primitive unboxed values) that are fast, perform well
    under contention, and offer a Chan-like interface. The library may be of
    limited usefulness outside of x86 architectures where the fetch-and-add
    instruction is not available.

    We export several variations of our design; some support additional
    functionality while others try for lower latency by removing features or
    making them more restrictive (e.g. in the @Unboxed@ variants).

    - @Unagi@: a general-purpose near drop-in replacement for @Chan@.

    - @Unagi.Unboxed@: like @Unagi@ but specialized for primitive types; this
    may perform better if a queue grows very large.

    - @Unagi.Bounded@: a bounded variant with blocking and non-blocking writes,
    and other functionality where a notion of the queue's capacity is
    required.

    - @Unagi.NoBlocking@: lowest latency implementations for when blocking
    reads aren't required.

    - @Unagi.NoBlocking.Unboxed@: like @Unagi.NoBlocking@ but for primitive
    types.

    Some of these may be deprecated in the future if they are found to provide
    little performance benefit, or no unique features; you should benchmark and
    experiment with them for your use cases, and please submit pull requests
    for additions to the benchmark suite that reflect what you find.

    Here is an example benchmark measuring the time taken to concurrently write
    and read 100,000 messages, with work divided amongst increasing number of
    readers and writers, comparing against the top-performing queues in the
    standard libraries. The inset graph shows a zoomed-in view on the
    implementations here.

    <<http://i.imgur.com/J5rLUFn.png>>

category:             Concurrency
abi:                  4ba0747074472638cc48800566278a66
exposed:              True
exposed-modules:
    Control.Concurrent.Chan.Unagi Control.Concurrent.Chan.Unagi.Bounded
    Control.Concurrent.Chan.Unagi.NoBlocking
    Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed
    Control.Concurrent.Chan.Unagi.Unboxed

hidden-modules:
    Control.Concurrent.Chan.Unagi.Internal
    Control.Concurrent.Chan.Unagi.Unboxed.Internal
    Control.Concurrent.Chan.Unagi.Bounded.Internal
    Control.Concurrent.Chan.Unagi.NoBlocking.Internal
    Control.Concurrent.Chan.Unagi.NoBlocking.Types
    Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed.Internal
    Control.Concurrent.Chan.Unagi.Constants Utilities
    Data.Atomics.Counter.Fat

import-dirs:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba

library-dirs:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba

library-dirs-static:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba

dynamic-library-dirs: /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1
data-dir:             /usr/pkg/share/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4
hs-libraries:         HSunagi-chan-0.4.1.4-EuHbMbYcDVO7hCTOQuucba
depends:
    atomic-primops-0.8.8-655tLyXFc745MjenXKh1hk base-4.20.0.0-inplace
    ghc-prim-0.11.0-inplace primitive-0.9.0.0-E3mDWyaMF4OIki7z5jah63

haddock-interfaces:
    /usr/pkg/share/doc/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4/html/unagi-chan.haddock

haddock-html:
    /usr/pkg/share/doc/aarch64-netbsd-ghc-9.10.1/unagi-chan-0.4.1.4/html
