Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

Standard Haskell arrays library.

4.75
   
  0 reviews  |  13 users  |  -27,603 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

A C-compatible array library for Haskell. Provides both an immutable and mutable (in the IO monad) interface. Includes utilities for multi-dimensional arrays, slicing and norms. Memory is 16-byte aligned by default to enable use of SIMD instructions.

5.0
 
  0 reviews  |  3 users  |  1,093 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

This package provides the standard Haskell list library reimplemented to allow stream fusion. This should in general provide faster list operations, and faster code for list-heavy programs. See the paper Stream Fusion: From Lists to Streams to Nothing at All, Coutts, Leshchinskiy and Stewart, 2007. ... [More] To use, simply import Data.List.Stream in place of Data.List, and hide list functions from the Prelude. [Less]

5.0
 
  0 reviews  |  3 users  |  7,677 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

HList is a record system providing strongly typed heterogenous lists, records, type-indexed products (TIP) and co-products.

0
 
  0 reviews  |  2 users  |  3,239 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

These lists manage events that are associated with times. Times may be given as difference between successive events or as absolute time values. Pauses before the first and after the last event are supported. The underlying data structures are lists of elements of alternating types, that is ... [More] [b,a,b,...,a,b] or [a,b,a,...,a,b]. The data structures can be used to represent MIDI files, OpenSoundControl message streams, music performances etc. [Less]

0
 
  0 reviews  |  1 user  |  3,633 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

This package provides strict versions of some standard Haskell data types (pairs, Maybe and Either). It also contains strict IO operations.

5.0
 
  0 reviews  |  1 user  |  151 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

An efficient, lazy suffix tree implementation.

3.5
   
  0 reviews  |  1 user  |  280 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

This package provides the core Edison data structure implementations, including multiple sequence, set, bag, and finite map concrete implementations with various performance characteristics. The implementations in this package have no dependencies other than those commonly bundled with Haskell compilers.

5.0
 
  0 reviews  |  1 user  |  12,548 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

A data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.

5.0
 
  0 reviews  |  1 user  |  251 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.