Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. isAbsoluteOnAnyPlatform :: FilePath -> Bool

    Cabal-syntax Distribution.Utils.Generic

    isAbsoluteOnAnyPlatform and isRelativeOnAnyPlatform are like isAbsolute and isRelative but have platform independent heuristics. The System.FilePath exists in two versions, Windows and Posix. The two versions don't agree on what is a relative path and we don't know if we're given Windows or Posix paths. This results in false positives when running on Posix and inspecting Windows paths, like the hackage server does. System.FilePath.Posix.isAbsolute "C:\hello" == False System.FilePath.Windows.isAbsolute "/hello" == False This means that we would treat paths that start with "/" to be absolute. On Posix they are indeed absolute, while on Windows they are not. The portable versions should be used when we might deal with paths that are from another OS than the host OS. For example, the Hackage Server deals with both Windows and Posix paths while performing the PackageDescription checks. In contrast, when we run 'cabal configure' we do expect the paths to be correct for our OS and we should not have to use the platform independent heuristics.

  2. isRelativeOnAnyPlatform :: FilePath -> Bool

    Cabal-syntax Distribution.Utils.Generic

    isRelativeOnAnyPlatform = not . isAbsoluteOnAnyPlatform
    

  3. transformCaret :: VersionRange -> VersionRange

    Cabal-syntax Distribution.Version

    Rewrite ^>= x.y.z into >= x.y.z && < x.(y+1)

  4. transformCaretLower :: VersionRange -> VersionRange

    Cabal-syntax Distribution.Version

    Rewrite ^>= x.y.z into <x.(y+1)

  5. transformCaretUpper :: VersionRange -> VersionRange

    Cabal-syntax Distribution.Version

    Rewrite ^>= x.y.z into >= x.y.z

  6. ExplicitForAll :: KnownExtension

    Cabal-syntax Language.Haskell.Extension

    Make forall a keyword in types, which can be used to give the generalisation explicitly.

  7. GHCForeignImportPrim :: KnownExtension

    Cabal-syntax Language.Haskell.Extension

    Allow GHC primops, written in C--, to be imported into a Haskell file.

  8. TransformListComp :: KnownExtension

    Cabal-syntax Language.Haskell.Extension

    Enable generalized list comprehensions, supporting operations such as sorting and grouping.

  9. package comfort-array

    Arrays where the index type is a function of the shape type Arrays from the basic array package are already very powerful compared with arrays in other languages. They may have any number of dimensions, are type safe and defined in a uniform way using the Ix class with free choice of the lower bounds (0, 1, or whatever you like). This package goes one step further: The shape and the index type are different, but the index type is a type function of the shape type. This offers much more flexibility and type safety. Some Shape example types are:

    • Range: Allow dynamic choice of lower and upper array bounds such as in the Arrays from the array package. You can combine it with other shapes in other dimensions. It allows you to describe the bounds of each dimension individually.
    • Shifted: Describe array bounds by start index and length. It is sometimes more natural to use these parameters. E.g. a non-negative index type like Word cannot represent -1 and thus cannot encode an empty range starting with index 0.
    • ZeroBased, OneBased: Arrays with fixed lower bound, either 0 or 1, respectively.
    • Cyclic: Indices with wrap-around semantics.
    • Zero, (): Arrays with fixed size 0 or 1, respectively.
    • Enumeration: Arrays with indices like LT, EQ, GT and a shape of fixed size.
    • NestedTuple: Arrays with shapes that are compatible to nested tuples like (a,(a,a)) and indices like fst and fst.snd.
    • (::+): The Append type constructor allows to respresent block arrays, e.g. block matrices. It also allows to represent non-empty arrays via ()::+sh.
    • Set: Use an arbitrary ordered set as index set.
    • Map: Concatenate a set of shapes. In a higher dimensional array it can be used for block matrices with a dynamic number of blocks but block sizes of the same shape type.
    • Triangular: A 2D array with the shape of a lower or upper triangular matrix.
    • Simplex: Simplices of any dimension, where the dimension is encoded in the type. An index is a tuple of monotonic ordered sub-indices.
    • Square: A 2D array where both dimensions always have equal size.
    • Cube: A 3D array where all three dimensions always have equal size.
    • Tagged: Statically distinguish shapes and indices that are isomorphic.
    With our Array type you can perform
    • Fast Linear Algebra using the packages comfort-blas and lapack. The lapack package defines even more fancy shapes like tall rectangular matrices, triangular matrices and banded matrices.
    • Fast Fourier Transforms using the package comfort-fftw
    • Fast Linear Programming using the packages comfort-glpk, coinor-clp, highs-lp
    • Efficient Array Processing via LLVM Just-In-Time code generation using the package knead.
    See also comfort-graph for a Graph data structure, with non-Int node identifiers and flexible edge types.

  10. fforWithKey :: DMap k2 f -> (forall (v :: k1) . () => k2 v -> f v -> g v) -> DMap k2 g

    dependent-map Data.Dependent.Map

    O(n). fforWithKey == flip mapWithKey except we cannot actually use flip because of the lack of impredicative types.

Page 558 of many | Previous | Next