Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
bijections with multiple implementations. Bijections between sets of values.
-
Bin: binary natural numbers. This package provides binary natural numbers (Data.Bin); also utilities to work on the type level with DataKinds (Data.Type.Bin).
data Bin = BZ -- ^ zero | BP BinP -- ^ non-zero data BinP = BE -- ^ one | B0 BinP -- ^ double | B1 BinP -- ^ double plus 1
There are ordinals in Data.Bin.Pos module, as well as fixed width integers in Data.Wrd. Another implementation is at https://hackage.haskell.org/package/nat, this differs in naming, and provides promoted variant. -
Generate CSV Exports of your Binance Trade History. binance-exports is a CLI program that queries the Binance.us API for your Trade History & exports all trades to a CSV file. Sometime during February 2022, Binance removed their Trade History page, along with the ability to export your completed trades. The Order History export is still available, but the format is more difficult to parse. This package contains a replacement executable for the Trade History export, generating CSVs with an almost-identical format. There are two differences: we split the trade symbol into two separate asset columns & include the trade ID. You can install binance-exports with Stack: stack install --resolver nightly binance-exports. Then run the following to print out your trades for a given symbol:
$ binance-exports -k <API_KEY> -s <API_SECRET> SOLUSD time,base-asset,quote-asset,type,price,quantity,total,fee,fee-currency,trade-id 2022-03-01 21:20:44,SOL,USD,BUY,42.2424,0.42,42.90010000,0.0009001,BNB,9001
See binance-exports --help for additional options. package
binary-generic-combinators Combinators and utilities to make Generic-based deriving of Binary easier and more expressive Please see the README on GitHub at https://github.com/0xd34df00d/binary-generic-combinators#readme
-
Lists of length a power of two. Implementation of lists whose number of elements is a power of two. Binary lists have this property by definition, so it is impossible to build a value with other kind of length. The implementation take advantage of this property to get additional performance. Some algorithms are designed to work only when the input list has length a power of two. Use binary lists to ensure this property in the input. In addition, this library exports some useful functions for this kind of algorithms. An example implementing the Fast Fourier Transform is provided in the Data.BinaryList module. The package contains an additional module with utilities for the (de)serialization of binary lists.
-
Extends binary with parsec/attoparsec style parsing combinators. Extends binary with parsec/attoparsec style parsing combinators.
-
Haskell bindings to binaryen Haskell bindings to binaryen. Provides complete bindings to the C API, which can be useful for building WebAssembly toolchains in Haskell.
-
Useful bitwise operations Please see the README on Github at https://github.com/haskell-works/bits-extra#readme
-
Bitwise operations on bounded enumerations Bitwise operations on bounded enumerations.
- Data.Enum.Set Constant-time sets using bit flags.
- Data.Enum.Memo Constant-time lookup memoization for functions on enumerated types.
-
HTML5 Canvas Graphics Library blank-canvas is a Haskell binding to the complete HTML5 Canvas API. blank-canvas allows Haskell users to write, in Haskell, interactive images onto their web browsers. blank-canvas gives the user a single full-window canvas, and provides many well-documented functions for rendering images.
{-# LANGUAGE OverloadedStrings #-} module Main where import Graphics.Blank -- import the blank canvas main = blankCanvas 3000 $ \ context -> do -- start blank canvas on port 3000 send context $ do -- send commands to this specific context moveTo(50,50) lineTo(200,100) lineWidth 10 strokeStyle "red" stroke() -- this draws the ink into the canvasFor more details, read the blank-canvas wiki.