-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | List with a minimum length of 2
--   
--   List with a minimum length of 2 e.g. find all duplicates in a list
@package nonnonempty
@version 0.0.1

module Data.List.NonNonEmpty
data NonNonEmpty a
NonNonEmpty :: a -> NonEmpty a -> NonNonEmpty a
head :: Lens' (NonNonEmpty a) a
tail :: Lens' (NonNonEmpty a) (NonEmpty a)
head2 :: Lens' (NonNonEmpty a) (a, a)
tail2 :: Lens' (NonNonEmpty a) [a]
instance GHC.Show.Show a => GHC.Show.Show (Data.List.NonNonEmpty.NonNonEmpty a)
instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.List.NonNonEmpty.NonNonEmpty a)
instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.List.NonNonEmpty.NonNonEmpty a)
instance Data.Data.Data a => Data.Data.Data (Data.List.NonNonEmpty.NonNonEmpty a)
instance GHC.Generics.Generic (Data.List.NonNonEmpty.NonNonEmpty a)
instance GHC.Generics.Generic1 Data.List.NonNonEmpty.NonNonEmpty
instance Data.Functor.Classes.Eq1 Data.List.NonNonEmpty.NonNonEmpty
instance Data.Functor.Classes.Ord1 Data.List.NonNonEmpty.NonNonEmpty
instance Data.Functor.Classes.Show1 Data.List.NonNonEmpty.NonNonEmpty
instance GHC.Base.Semigroup (Data.List.NonNonEmpty.NonNonEmpty a)
instance GHC.Base.Functor Data.List.NonNonEmpty.NonNonEmpty
instance Data.Foldable.Foldable Data.List.NonNonEmpty.NonNonEmpty
instance Data.Foldable1.Foldable1 Data.List.NonNonEmpty.NonNonEmpty
instance Data.Traversable.Traversable Data.List.NonNonEmpty.NonNonEmpty
instance Data.Semigroup.Traversable.Class.Traversable1 Data.List.NonNonEmpty.NonNonEmpty
instance Data.Functor.Bind.Class.Apply Data.List.NonNonEmpty.NonNonEmpty
instance GHC.Base.Applicative Data.List.NonNonEmpty.NonNonEmpty
instance Data.Functor.Bind.Class.Bind Data.List.NonNonEmpty.NonNonEmpty
instance GHC.Base.Monad Data.List.NonNonEmpty.NonNonEmpty
instance Control.Lens.Internal.Iso.Reversing (Data.List.NonNonEmpty.NonNonEmpty a)
instance Control.Lens.Each.Each (Data.List.NonNonEmpty.NonNonEmpty a) (Data.List.NonNonEmpty.NonNonEmpty b) a b