lens-family-2.1.3: Lens Families
Safe HaskellSafe-Inferred
LanguageHaskell2010

Lens.Family2.Stock

Description

This module contains lenses, prisms, grids, grates and traversals for common structures in Haskell. It also contains the combinators for various kinds of optics.

A Function name with ' is a grate variant of a grid, and a function name with _ is a traversal variants of a grid or prism. For example, both' is the grate variant of both while both_ is the traversal variant.

Synopsis

Stock Lenses

_1 :: forall a r b f. Functor f => LensLike f (a, r) (b, r) a b Source #

Lens on the first element of a pair.

_2 :: forall r a b f. Functor f => LensLike f (r, a) (r, b) a b Source #

Lens on the second element of a pair.

chosen :: forall a b f. Functor f => LensLike f (Either a a) (Either b b) a b Source #

Lens on the Left or Right element of an (Either a a).

ix :: Eq k => k -> Lens' (k -> v) v Source #

Lens on a given point of a function.

at :: Ord k => k -> Lens' (Map k v) (Maybe v) Source #

Lens on a given point of a Map.

intAt :: Int -> Lens' (IntMap v) (Maybe v) Source #

Lens on a given point of a IntMap.

at' :: Ord k => k -> Lens' (Map k v) (Maybe v) Source #

Lens providing strict access to a given point of a Map.

intAt' :: Int -> Lens' (IntMap v) (Maybe v) Source #

Lens providing strict access to a given point of a IntMap.

contains :: Ord k => k -> Lens' (Set k) Bool Source #

Lens on a given point of a Set.

intContains :: Int -> Lens' IntSet Bool Source #

Lens on a given point of a IntSet.

Stock Prisms

left :: forall a r b f g. (Applicative f, Traversable g) => AdapterLike f g (Either a r) (Either b r) a b Source #

A prism on the Left element of an Either.

right :: forall r a b f g. (Applicative f, Traversable g) => AdapterLike f g (Either r a) (Either r b) a b Source #

A prism on the Right element of an Either.

just :: forall a b f g. (Applicative f, Traversable g) => AdapterLike f g (Maybe a) (Maybe b) a b Source #

A prism on the Just element of a Maybe.

nothing :: forall a f g. (Applicative f, Traversable g) => AdapterLike' f g (Maybe a) () Source #

A prism on the Nothing element of a Maybe.

Stock Grids

both :: forall a b f g. (Applicative f, Functor g) => AdapterLike f g (a, a) (b, b) a b Source #

A grid on both elements of a pair (a,a).

bend :: FiniteBits b => Grid' b Bool Source #

A grid from the most significant bit to the least significant bit of a FiniteBits type.

Big endian order.

lend :: FiniteBits b => Grid' b Bool Source #

A grid from the least significant bit to the most significant bit of a FiniteBits type.

Little endian order.

Stock Grates

cod :: forall r a b g. Functor g => GrateLike g (r -> a) (r -> b) a b Source #

A grate accessing the codomain of a function.

both' :: forall a b g. Functor g => GrateLike g (a, a) (b, b) a b Source #

A grate on both elements of a pair (a,a).

bend' :: FiniteBits b => Grate' b Bool Source #

A grate from the most significant bit to the least significant bit of a FiniteBits type.

Big endian order.

lend' :: FiniteBits b => Grate' b Bool Source #

A grate from the least significant bit to the most significant bit of a FiniteBits type.

Little endian order.

Stock Traversals

both_ :: forall a b f. Applicative f => LensLike f (a, a) (b, b) a b Source #

Traversals on both elements of a pair (a,a).

bend_ :: FiniteBits b => Traversal' b Bool Source #

A traversal from the most significant bit to the least significant bit of a FiniteBits type.

Big endian order.

lend_ :: FiniteBits b => Traversal' b Bool Source #

A traversal from the least significant bit to the most significant bit of a FiniteBits type.

Little endian order.

left_ :: forall a r b f. Applicative f => LensLike f (Either a r) (Either b r) a b Source #

Traversal on the Left element of an Either.

right_ :: forall r a b f. Applicative f => LensLike f (Either r a) (Either r b) a b Source #

Traversal on the Right element of an Either.

just_ :: forall a b f. Applicative f => LensLike f (Maybe a) (Maybe b) a b Source #

Traversal on the Just element of a Maybe.

nothing_ :: forall a f. Applicative f => LensLike' f (Maybe a) () Source #

Traversal on the Nothing element of a Maybe.

ignored :: forall a b b' f. Applicative f => LensLike f a a b b' Source #

The empty traveral on any type.

Stock SECs

mapped :: forall (f :: Type -> Type) a a'. Functor f => Setter (f a) (f a') a a' Source #

An SEC referencing the parameter of a functor.

Lens Combinators

alongside :: Functor f => LensLike (AlongsideLeft f b1) s0 t0 a0 b0 -> LensLike (AlongsideRight f t0) s1 t1 a1 b1 -> LensLike f (s0, s1) (t0, t1) (a0, a1) (b0, b1) Source #

alongside :: Lens s0 t0 a0 b0 -> Lens s1 t1 a1 b1 -> Lens (s0, s1) (t0, t1) (a0, a1) (b0, b1)

alongside :: Getter s0 t0 a0 b0 -> Getter s1 t1 a1 b1 -> Getter (s0, s1) (t0, t1) (a0, a1) (b0, b1)

Given two lens/getter families, make a new lens/getter on their product.

backwards :: LensLike (Backwards f) s t a b -> LensLike f s t a b Source #

backwards :: Traversal s t a b -> Traversal s t a b
backwards :: Fold s t a b -> Fold s t a b

Given a traversal or fold, reverse the order that elements are traversed.

backwards :: Lens s t a b -> Lens s t a b
backwards :: Getter s t a b -> Getter s t a b
backwards :: Setter s t a b -> Setter s t a b

No effect on lenses, getters or setters.

beside :: (Applicative f, Functor g) => AdapterLike f g s0 t0 a b -> AdapterLike f g s1 t1 a b -> AdapterLike f g (s0, s1) (t0, t1) a b Source #

beside :: Grid s1 t1 a b -> Grid s2 t2 a b -> Grid (s1, s2) (t1, t2) a b

Given two grids referencing a type c, create a grid on the pair referencing c.

beside' :: Functor g => GrateLike g s0 t0 a b -> GrateLike g s1 t1 a b -> GrateLike g (s0, s1) (t0, t1) a b Source #

beside' :: Grate s0 t0 a b -> Grate s1 t1 a b -> Grate (s0, s1) (t0, t1) a b

beside' :: Resetter s0 t0 a b -> Resetter s1 t1 a b -> Resetter (s0, s1) (t0, t1) a b

Given two grates/resetters referencing a type c, create a grate/resetter on the pair referencing c.

beside_ :: Applicative f => LensLike f s0 t0 a b -> LensLike f s1 t1 a b -> LensLike f (s0, s1) (t0, t1) a b Source #

beside_ :: Traversal s0 t0 a b -> Traversal s1 t1 a b -> Traversal (s0, s1) (t0, t1) a b

beside_ :: Fold s0 t0 a b -> Fold s1 t1 a b -> Fold (s0, s1) (t0, t1) a b

beside_ :: Setter s0 t0 a b -> Setter s1 t1 a b -> Setter (s0, s1) (t0, t1) a b

Given two traversals/folds/setters referencing a type c, create a traversal/fold/setter on the pair referencing c.

choosing :: Functor f => LensLike f s0 t0 a b -> LensLike f s1 t1 a b -> LensLike f (Either s0 s1) (Either t0 t1) a b Source #

choosing :: Lens s0 t0 a b -> Lens s1 t1 a b -> Lens (Either s0 s1) (Either t0 t1) a b

choosing :: Traversal s0 t0 a b -> Traversal s1 t1 a b -> Traversal (Either s0 s1) (Either t0 t1) a b

choosing :: Getter s0 t0 a b -> Getter s1 t1 a b -> Getter (Either s0 s1) (Either t0 t1) a b

choosing :: Fold s0 t0 a b -> Fold s1 t1 a b -> Fold (Either s0 s1) (Either t0 t1) a b

choosing :: Setter s0 t0 a b -> Setter s1 t1 a b -> Setter (Either s0 s1) (Either t0 t1) a b

Given two lens/traversal/getter/fold/setter families with the same substructure, make a new lens/traversal/getter/fold/setter on Either.

from :: (Functor f, Functor g) => AdapterLike (FromF (g s -> f t) (f b) g) (FromG (f b) f) b a t s -> AdapterLike f g s t a b Source #

from :: Adapter b a t s -> Adapter s t a b

Reverses the direction of an adapter.

from :: Getter b a t s -> Reviewer s t a b
from :: Reviewer b a t s -> Getter s t a b

Changes a Getter into a Reviewer and vice versa.

Types

data AlongsideLeft (f :: Type -> Type) b a Source #

Instances

Instances details
Functor f => Functor (AlongsideLeft f a) 
Instance details

Defined in Lens.Family.Stock

Methods

fmap :: (a0 -> b) -> AlongsideLeft f a a0 -> AlongsideLeft f a b #

(<$) :: a0 -> AlongsideLeft f a b -> AlongsideLeft f a a0 #

Phantom f => Phantom (AlongsideLeft f a) 
Instance details

Defined in Lens.Family.Stock

Methods

coerce :: AlongsideLeft f a a0 -> AlongsideLeft f a b

data AlongsideRight (f :: Type -> Type) a b Source #

Instances

Instances details
Functor f => Functor (AlongsideRight f a) 
Instance details

Defined in Lens.Family.Stock

Methods

fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b #

(<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 #

Phantom f => Phantom (AlongsideRight f a) 
Instance details

Defined in Lens.Family.Stock

Methods

coerce :: AlongsideRight f a a0 -> AlongsideRight f a b

data FromF i j (g :: Type -> Type) x Source #

Instances

Instances details
Functor g => Functor (FromF i j g) 
Instance details

Defined in Lens.Family.Stock

Methods

fmap :: (a -> b) -> FromF i j g a -> FromF i j g b #

(<$) :: a -> FromF i j g b -> FromF i j g a #

Phantom g => Phantom (FromF i j g) 
Instance details

Defined in Lens.Family.Stock

Methods

coerce :: FromF i j g a -> FromF i j g b

data FromG e (f :: Type -> Type) x Source #

Instances

Instances details
Functor f => Functor (FromG e f) 
Instance details

Defined in Lens.Family.Stock

Methods

fmap :: (a -> b) -> FromG e f a -> FromG e f b #

(<$) :: a -> FromG e f b -> FromG e f a #

Phantom g => Phantom (FromG e g) 
Instance details

Defined in Lens.Family.Stock

Methods

coerce :: FromG e g a -> FromG e g b

Re-exports

type Lens s t a b = forall (f :: Type -> Type). Functor f => LensLike f s t a b Source #

type Lens' s a = forall (f :: Type -> Type). Functor f => LensLike' f s a Source #

type Grate s t a b = forall (g :: Type -> Type). Functor g => GrateLike g s t a b Source #

type Grate' s a = forall (g :: Type -> Type). Functor g => GrateLike' g s a Source #

type Traversal s t a b = forall (f :: Type -> Type). Applicative f => LensLike f s t a b Source #

type Traversal' s a = forall (f :: Type -> Type). Applicative f => LensLike' f s a Source #

type Setter s t a b = forall (f :: Type -> Type). Identical f => LensLike f s t a b Source #

type AdapterLike (f :: Type -> Type) (g :: Type -> Type) s t a b = (g a -> f b) -> g s -> f t Source #

type AdapterLike' (f :: Type -> Type) (g :: Type -> Type) s a = (g a -> f a) -> g s -> f s Source #

type LensLike (f :: Type -> Type) s t a b = (a -> f b) -> s -> f t Source #

type LensLike' (f :: Type -> Type) s a = (a -> f a) -> s -> f s Source #

class (Traversable f, Applicative f) => Identical (f :: Type -> Type) Source #

Minimal complete definition

extract

Instances

Instances details
Identical Identity 
Instance details

Defined in Lens.Family.Identical

Methods

extract :: Identity a -> a

Identical f => Identical (Backwards f) 
Instance details

Defined in Lens.Family.Identical

Methods

extract :: Backwards f a -> a

(Identical f, Identical g) => Identical (Compose f g) 
Instance details

Defined in Lens.Family.Identical

Methods

extract :: Compose f g a -> a

data Backwards (f :: k -> Type) (a :: k) #

The same functor, but with an Applicative instance that performs actions in the reverse order.

Instances

Instances details
Generic1 (Backwards f :: k -> Type) 
Instance details

Defined in Control.Applicative.Backwards

Associated Types

type Rep1 (Backwards f :: k -> Type) 
Instance details

Defined in Control.Applicative.Backwards

type Rep1 (Backwards f :: k -> Type) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.1.0-899a" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)))

Methods

from1 :: forall (a :: k). Backwards f a -> Rep1 (Backwards f) a #

to1 :: forall (a :: k). Rep1 (Backwards f) a -> Backwards f a #

Foldable f => Foldable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fold :: Monoid m => Backwards f m -> m #

foldMap :: Monoid m => (a -> m) -> Backwards f a -> m #

foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m #

foldr :: (a -> b -> b) -> b -> Backwards f a -> b #

foldr' :: (a -> b -> b) -> b -> Backwards f a -> b #

foldl :: (b -> a -> b) -> b -> Backwards f a -> b #

foldl' :: (b -> a -> b) -> b -> Backwards f a -> b #

foldr1 :: (a -> a -> a) -> Backwards f a -> a #

foldl1 :: (a -> a -> a) -> Backwards f a -> a #

toList :: Backwards f a -> [a] #

null :: Backwards f a -> Bool #

length :: Backwards f a -> Int #

elem :: Eq a => a -> Backwards f a -> Bool #

maximum :: Ord a => Backwards f a -> a #

minimum :: Ord a => Backwards f a -> a #

sum :: Num a => Backwards f a -> a #

product :: Num a => Backwards f a -> a #

Foldable1 f => Foldable1 (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fold1 :: Semigroup m => Backwards f m -> m #

foldMap1 :: Semigroup m => (a -> m) -> Backwards f a -> m #

foldMap1' :: Semigroup m => (a -> m) -> Backwards f a -> m #

toNonEmpty :: Backwards f a -> NonEmpty a #

maximum :: Ord a => Backwards f a -> a #

minimum :: Ord a => Backwards f a -> a #

head :: Backwards f a -> a #

last :: Backwards f a -> a #

foldrMap1 :: (a -> b) -> (a -> b -> b) -> Backwards f a -> b #

foldlMap1' :: (a -> b) -> (b -> a -> b) -> Backwards f a -> b #

foldlMap1 :: (a -> b) -> (b -> a -> b) -> Backwards f a -> b #

foldrMap1' :: (a -> b) -> (a -> b -> b) -> Backwards f a -> b #

Eq1 f => Eq1 (Backwards f) 
Instance details

Defined in Control.Applicative.Backwards

Methods

liftEq :: (a -> b -> Bool) -> Backwards f a -> Backwards f b -> Bool #

Ord1 f => Ord1 (Backwards f) 
Instance details

Defined in Control.Applicative.Backwards

Methods

liftCompare :: (a -> b -> Ordering) -> Backwards f a -> Backwards f b -> Ordering #

Read1 f => Read1 (Backwards f) 
Instance details

Defined in Control.Applicative.Backwards

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Backwards f a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Backwards f a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Backwards f a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Backwards f a] #

Show1 f => Show1 (Backwards f) 
Instance details

Defined in Control.Applicative.Backwards

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Backwards f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Backwards f a] -> ShowS #

Contravariant f => Contravariant (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

contramap :: (a' -> a) -> Backwards f a -> Backwards f a' #

(>$) :: b -> Backwards f b -> Backwards f a #

Traversable f => Traversable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) #

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) #

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #

Alternative f => Alternative (Backwards f)

Try alternatives in the same order as f.

Instance details

Defined in Control.Applicative.Backwards

Methods

empty :: Backwards f a #

(<|>) :: Backwards f a -> Backwards f a -> Backwards f a #

some :: Backwards f a -> Backwards f [a] #

many :: Backwards f a -> Backwards f [a] #

Applicative f => Applicative (Backwards f)

Apply f-actions in the reverse order.

Instance details

Defined in Control.Applicative.Backwards

Methods

pure :: a -> Backwards f a #

(<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b #

liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c #

(*>) :: Backwards f a -> Backwards f b -> Backwards f b #

(<*) :: Backwards f a -> Backwards f b -> Backwards f a #

Functor f => Functor (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b #

(<$) :: a -> Backwards f b -> Backwards f a #

Identical f => Identical (Backwards f) 
Instance details

Defined in Lens.Family.Identical

Methods

extract :: Backwards f a -> a

Phantom f => Phantom (Backwards f) 
Instance details

Defined in Lens.Family.Phantom

Methods

coerce :: Backwards f a -> Backwards f b

Generic (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Associated Types

type Rep (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

type Rep (Backwards f a) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.1.0-899a" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))

Methods

from :: Backwards f a -> Rep (Backwards f a) x #

to :: Rep (Backwards f a) x -> Backwards f a #

(Read1 f, Read a) => Read (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

readsPrec :: Int -> ReadS (Backwards f a) #

readList :: ReadS [Backwards f a] #

readPrec :: ReadPrec (Backwards f a) #

readListPrec :: ReadPrec [Backwards f a] #

(Show1 f, Show a) => Show (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

showsPrec :: Int -> Backwards f a -> ShowS #

show :: Backwards f a -> String #

showList :: [Backwards f a] -> ShowS #

(Eq1 f, Eq a) => Eq (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

(==) :: Backwards f a -> Backwards f a -> Bool #

(/=) :: Backwards f a -> Backwards f a -> Bool #

(Ord1 f, Ord a) => Ord (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

compare :: Backwards f a -> Backwards f a -> Ordering #

(<) :: Backwards f a -> Backwards f a -> Bool #

(<=) :: Backwards f a -> Backwards f a -> Bool #

(>) :: Backwards f a -> Backwards f a -> Bool #

(>=) :: Backwards f a -> Backwards f a -> Bool #

max :: Backwards f a -> Backwards f a -> Backwards f a #

min :: Backwards f a -> Backwards f a -> Backwards f a #

type Rep1 (Backwards f :: k -> Type) 
Instance details

Defined in Control.Applicative.Backwards

type Rep1 (Backwards f :: k -> Type) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.1.0-899a" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)))
type Rep (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

type Rep (Backwards f a) = D1 ('MetaData "Backwards" "Control.Applicative.Backwards" "transformers-0.6.1.0-899a" 'True) (C1 ('MetaCons "Backwards" 'PrefixI 'True) (S1 ('MetaSel ('Just "forwards") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))

class Bits b => FiniteBits b #

The FiniteBits class denotes types with a finite, fixed number of bits.

Since: base-4.7.0.0

Minimal complete definition

finiteBitSize

Instances

Instances details
FiniteBits CBool 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CBool -> Int #

countLeadingZeros :: CBool -> Int #

countTrailingZeros :: CBool -> Int #

FiniteBits CChar 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CChar -> Int #

countLeadingZeros :: CChar -> Int #

countTrailingZeros :: CChar -> Int #

FiniteBits CInt 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CInt -> Int #

countLeadingZeros :: CInt -> Int #

countTrailingZeros :: CInt -> Int #

FiniteBits CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CIntMax -> Int #

countLeadingZeros :: CIntMax -> Int #

countTrailingZeros :: CIntMax -> Int #

FiniteBits CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CIntPtr -> Int #

countLeadingZeros :: CIntPtr -> Int #

countTrailingZeros :: CIntPtr -> Int #

FiniteBits CLLong 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CLLong -> Int #

countLeadingZeros :: CLLong -> Int #

countTrailingZeros :: CLLong -> Int #

FiniteBits CLong 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CLong -> Int #

countLeadingZeros :: CLong -> Int #

countTrailingZeros :: CLong -> Int #

FiniteBits CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CPtrdiff -> Int #

countLeadingZeros :: CPtrdiff -> Int #

countTrailingZeros :: CPtrdiff -> Int #

FiniteBits CSChar 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CSChar -> Int #

countLeadingZeros :: CSChar -> Int #

countTrailingZeros :: CSChar -> Int #

FiniteBits CShort 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CShort -> Int #

countLeadingZeros :: CShort -> Int #

countTrailingZeros :: CShort -> Int #

FiniteBits CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CSigAtomic -> Int #

countLeadingZeros :: CSigAtomic -> Int #

countTrailingZeros :: CSigAtomic -> Int #

FiniteBits CSize 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CSize -> Int #

countLeadingZeros :: CSize -> Int #

countTrailingZeros :: CSize -> Int #

FiniteBits CUChar 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CUChar -> Int #

countLeadingZeros :: CUChar -> Int #

countTrailingZeros :: CUChar -> Int #

FiniteBits CUInt 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CUInt -> Int #

countLeadingZeros :: CUInt -> Int #

countTrailingZeros :: CUInt -> Int #

FiniteBits CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CUIntMax -> Int #

countLeadingZeros :: CUIntMax -> Int #

countTrailingZeros :: CUIntMax -> Int #

FiniteBits CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CUIntPtr -> Int #

countLeadingZeros :: CUIntPtr -> Int #

countTrailingZeros :: CUIntPtr -> Int #

FiniteBits CULLong 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CULLong -> Int #

countLeadingZeros :: CULLong -> Int #

countTrailingZeros :: CULLong -> Int #

FiniteBits CULong 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CULong -> Int #

countLeadingZeros :: CULong -> Int #

countTrailingZeros :: CULong -> Int #

FiniteBits CUShort 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CUShort -> Int #

countLeadingZeros :: CUShort -> Int #

countTrailingZeros :: CUShort -> Int #

FiniteBits CWchar 
Instance details

Defined in Foreign.C.Types

Methods

finiteBitSize :: CWchar -> Int #

countLeadingZeros :: CWchar -> Int #

countTrailingZeros :: CWchar -> Int #

FiniteBits IntPtr 
Instance details

Defined in Foreign.Ptr

Methods

finiteBitSize :: IntPtr -> Int #

countLeadingZeros :: IntPtr -> Int #

countTrailingZeros :: IntPtr -> Int #

FiniteBits WordPtr 
Instance details

Defined in Foreign.Ptr

Methods

finiteBitSize :: WordPtr -> Int #

countLeadingZeros :: WordPtr -> Int #

countTrailingZeros :: WordPtr -> Int #

FiniteBits Int16

Since: base-4.6.0.0

Instance details

Defined in GHC.Int

Methods

finiteBitSize :: Int16 -> Int #

countLeadingZeros :: Int16 -> Int #

countTrailingZeros :: Int16 -> Int #

FiniteBits Int32

Since: base-4.6.0.0

Instance details

Defined in GHC.Int

Methods

finiteBitSize :: Int32 -> Int #

countLeadingZeros :: Int32 -> Int #

countTrailingZeros :: Int32 -> Int #

FiniteBits Int64

Since: base-4.6.0.0

Instance details

Defined in GHC.Int

Methods

finiteBitSize :: Int64 -> Int #

countLeadingZeros :: Int64 -> Int #

countTrailingZeros :: Int64 -> Int #

FiniteBits Int8

Since: base-4.6.0.0

Instance details

Defined in GHC.Int

Methods

finiteBitSize :: Int8 -> Int #

countLeadingZeros :: Int8 -> Int #

countTrailingZeros :: Int8 -> Int #

FiniteBits Word16

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Methods

finiteBitSize :: Word16 -> Int #

countLeadingZeros :: Word16 -> Int #

countTrailingZeros :: Word16 -> Int #

FiniteBits Word32

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Methods

finiteBitSize :: Word32 -> Int #

countLeadingZeros :: Word32 -> Int #

countTrailingZeros :: Word32 -> Int #

FiniteBits Word64

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Methods

finiteBitSize :: Word64 -> Int #

countLeadingZeros :: Word64 -> Int #

countTrailingZeros :: Word64 -> Int #

FiniteBits Word8

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Methods

finiteBitSize :: Word8 -> Int #

countLeadingZeros :: Word8 -> Int #

countTrailingZeros :: Word8 -> Int #

FiniteBits CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CBlkCnt -> Int #

countLeadingZeros :: CBlkCnt -> Int #

countTrailingZeros :: CBlkCnt -> Int #

FiniteBits CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CBlkSize -> Int #

countLeadingZeros :: CBlkSize -> Int #

countTrailingZeros :: CBlkSize -> Int #

FiniteBits CClockId 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CClockId -> Int #

countLeadingZeros :: CClockId -> Int #

countTrailingZeros :: CClockId -> Int #

FiniteBits CDev 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CDev -> Int #

countLeadingZeros :: CDev -> Int #

countTrailingZeros :: CDev -> Int #

FiniteBits CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CFsBlkCnt -> Int #

countLeadingZeros :: CFsBlkCnt -> Int #

countTrailingZeros :: CFsBlkCnt -> Int #

FiniteBits CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CFsFilCnt -> Int #

countLeadingZeros :: CFsFilCnt -> Int #

countTrailingZeros :: CFsFilCnt -> Int #

FiniteBits CGid 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CGid -> Int #

countLeadingZeros :: CGid -> Int #

countTrailingZeros :: CGid -> Int #

FiniteBits CId 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CId -> Int #

countLeadingZeros :: CId -> Int #

countTrailingZeros :: CId -> Int #

FiniteBits CIno 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CIno -> Int #

countLeadingZeros :: CIno -> Int #

countTrailingZeros :: CIno -> Int #

FiniteBits CKey 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CKey -> Int #

countLeadingZeros :: CKey -> Int #

countTrailingZeros :: CKey -> Int #

FiniteBits CMode 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CMode -> Int #

countLeadingZeros :: CMode -> Int #

countTrailingZeros :: CMode -> Int #

FiniteBits CNfds 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CNfds -> Int #

countLeadingZeros :: CNfds -> Int #

countTrailingZeros :: CNfds -> Int #

FiniteBits CNlink 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CNlink -> Int #

countLeadingZeros :: CNlink -> Int #

countTrailingZeros :: CNlink -> Int #

FiniteBits COff 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: COff -> Int #

countLeadingZeros :: COff -> Int #

countTrailingZeros :: COff -> Int #

FiniteBits CPid 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CPid -> Int #

countLeadingZeros :: CPid -> Int #

countTrailingZeros :: CPid -> Int #

FiniteBits CRLim 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CRLim -> Int #

countLeadingZeros :: CRLim -> Int #

countTrailingZeros :: CRLim -> Int #

FiniteBits CSocklen 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CSocklen -> Int #

countLeadingZeros :: CSocklen -> Int #

countTrailingZeros :: CSocklen -> Int #

FiniteBits CSsize 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CSsize -> Int #

countLeadingZeros :: CSsize -> Int #

countTrailingZeros :: CSsize -> Int #

FiniteBits CTcflag 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CTcflag -> Int #

countLeadingZeros :: CTcflag -> Int #

countTrailingZeros :: CTcflag -> Int #

FiniteBits CUid 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: CUid -> Int #

countLeadingZeros :: CUid -> Int #

countTrailingZeros :: CUid -> Int #

FiniteBits Fd 
Instance details

Defined in System.Posix.Types

Methods

finiteBitSize :: Fd -> Int #

countLeadingZeros :: Fd -> Int #

countTrailingZeros :: Fd -> Int #

FiniteBits Bool

Since: base-4.7.0.0

Instance details

Defined in GHC.Bits

Methods

finiteBitSize :: Bool -> Int #

countLeadingZeros :: Bool -> Int #

countTrailingZeros :: Bool -> Int #

FiniteBits Int

Since: base-4.6.0.0

Instance details

Defined in GHC.Bits

Methods

finiteBitSize :: Int -> Int #

countLeadingZeros :: Int -> Int #

countTrailingZeros :: Int -> Int #

FiniteBits Word

Since: base-4.6.0.0

Instance details

Defined in GHC.Bits

Methods

finiteBitSize :: Word -> Int #

countLeadingZeros :: Word -> Int #

countTrailingZeros :: Word -> Int #

FiniteBits a => FiniteBits (And a)

Since: base-4.16

Instance details

Defined in Data.Bits

Methods

finiteBitSize :: And a -> Int #

countLeadingZeros :: And a -> Int #

countTrailingZeros :: And a -> Int #

FiniteBits a => FiniteBits (Iff a)

Since: base-4.16

Instance details

Defined in Data.Bits

Methods

finiteBitSize :: Iff a -> Int #

countLeadingZeros :: Iff a -> Int #

countTrailingZeros :: Iff a -> Int #

FiniteBits a => FiniteBits (Ior a)

Since: base-4.16

Instance details

Defined in Data.Bits

Methods

finiteBitSize :: Ior a -> Int #

countLeadingZeros :: Ior a -> Int #

countTrailingZeros :: Ior a -> Int #

FiniteBits a => FiniteBits (Xor a)

Since: base-4.16

Instance details

Defined in Data.Bits

Methods

finiteBitSize :: Xor a -> Int #

countLeadingZeros :: Xor a -> Int #

countTrailingZeros :: Xor a -> Int #

FiniteBits a => FiniteBits (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

finiteBitSize :: Identity a -> Int #

countLeadingZeros :: Identity a -> Int #

countTrailingZeros :: Identity a -> Int #

FiniteBits a => FiniteBits (Down a)

Since: base-4.14.0.0

Instance details

Defined in Data.Ord

Methods

finiteBitSize :: Down a -> Int #

countLeadingZeros :: Down a -> Int #

countTrailingZeros :: Down a -> Int #

FiniteBits a => FiniteBits (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

finiteBitSize :: Const a b -> Int #

countLeadingZeros :: Const a b -> Int #

countTrailingZeros :: Const a b -> Int #

Deprecated names

lft :: forall a r b f g. (Applicative f, Traversable g) => AdapterLike f g (Either a r) (Either b r) a b Source #

Deprecated: Renamed as left.

rgt :: forall r a b f g. (Applicative f, Traversable g) => AdapterLike f g (Either r a) (Either r b) a b Source #

Deprecated: Renamed as right.

some :: forall a b f g. (Applicative f, Traversable g) => AdapterLike f g (Maybe a) (Maybe b) a b Source #

Deprecated: Renamed as just.

none :: forall a f g. (Applicative f, Traversable g) => AdapterLike' f g (Maybe a) () Source #

Deprecated: Renamed as nothing.

lft_ :: forall a r b f. Applicative f => LensLike f (Either a r) (Either b r) a b Source #

Deprecated: Renamed as left_.

rgt_ :: forall r a b f. Applicative f => LensLike f (Either r a) (Either r b) a b Source #

Deprecated: Renamed as right_.

some_ :: forall a b f. Applicative f => LensLike f (Maybe a) (Maybe b) a b Source #

Deprecated: Renamed as just_.

none_ :: forall a f. Applicative f => LensLike' f (Maybe a) () Source #

Deprecated: Renamed as nothing_.