|
|
|
|
|
| Description |
| Packed vectors : use these whenever possible. The regular vector type is
just a gussied up linked list, but when vector functions are applied to
these types, bracketed by pack and unpack, then things unfold into
perfectly optimized code.
|
|
| Synopsis |
|
|
|
|
| Packed Vector Types
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
|
| Constructors | | Instances | |
|
|
| Packed Matrix Types.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| pack a matrix
|
|
|
| unpack a matrix
|
|
| class PackedVec pv v | pv -> v where | Source |
|
| PackedVec class : relates a packed vector type to its unpacked type For
now, the fundep is not bijective -- It may be advantageous to have multiple
packed representations for a canonical vector type. This may change. In the
meantime, you may have to annotate return types.
| | | Methods | | | Instances | |
|
|
| Produced by Haddock version 2.3.0 |