mod is:module

This module contains code from: https://hackage.haskell.org/package/mod and has the following license: Copyright (c) 2019 Andrew Lelechenko Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the Software), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

module Data.Mod

mod

Modular arithmetic, promoting moduli to the type level, with an emphasis on performance. Originally part of the arithmoi package. This module supports moduli of arbitrary size. Use Data.Mod.Word to achieve better performance, when your moduli fit into Word.

module Test.QuickCheck.Modifiers

QuickCheck

Modifiers for test data. These types do things such as restricting the kind of test data that can be generated. They can be pattern-matched on in properties as a stylistic alternative to using explicit quantification. Note: the contents of this module are re-exported by Test.QuickCheck. You do not need to import it directly. Examples:

-- Functions cannot be shown (but see Test.QuickCheck.Function)
prop_TakeDropWhile (Blind p) (xs :: [A]) =
takeWhile p xs ++ dropWhile p xs == xs

prop_TakeDrop (NonNegative n) (xs :: [A]) =
take n xs ++ drop n xs == xs

-- cycle does not work for empty lists
prop_Cycle (NonNegative n) (NonEmpty (xs :: [A])) =
take n (cycle xs) == take n (xs ++ cycle xs)

-- Instead of forAll orderedList
prop_Sort (Ordered (xs :: [OrdA])) =
sort xs == xs

module System.Posix.DynamicLinker.Module

unix

DLOpen support, old API Derived from GModule.chs by M.Weber & M.Chakravarty which is part of c2hs I left the API more or less the same, mostly the flags are different.

module Distribution.Backpack.ModSubst

Cabal

A type class ModSubst for objects which can have ModuleSubst applied to them. See also https://github.com/ezyang/ghc-proposals/blob/backpack/proposals/0000-backpack.rst

module Distribution.Backpack.ModuleShape

Cabal

See https://github.com/ezyang/ghc-proposals/blob/backpack/proposals/0000-backpack.rst

module Servant.API.Modifiers

servant

module GHC.Rename.Module

ghc

module GHC.Tc.Module

ghc