monoidmap-examples-0.0.0.1: Examples for monoidmap.
Copyright© 2022–2025 Jonathan Knowles
LicenseApache-2.0
Safe HaskellNone
LanguageHaskell2010

Data.MonoidMap.Examples.Set.NonEmpty

Description

A minimal non-empty variant of the Set data type.

Documentation

data NESet v Source #

Instances

Instances details
Ord v => Semigroup (NESet v) Source # 
Instance details

Defined in Data.MonoidMap.Examples.Set.NonEmpty

Methods

(<>) :: NESet v -> NESet v -> NESet v #

sconcat :: NonEmpty (NESet v) -> NESet v #

stimes :: Integral b => b -> NESet v -> NESet v #

Show v => Show (NESet v) Source # 
Instance details

Defined in Data.MonoidMap.Examples.Set.NonEmpty

Methods

showsPrec :: Int -> NESet v -> ShowS #

show :: NESet v -> String #

showList :: [NESet v] -> ShowS #

Eq v => Eq (NESet v) Source # 
Instance details

Defined in Data.MonoidMap.Examples.Set.NonEmpty

Methods

(==) :: NESet v -> NESet v -> Bool #

(/=) :: NESet v -> NESet v -> Bool #

toSet :: NESet v -> Set v Source #

isSubsetOf :: Ord v => NESet v -> NESet v -> Bool Source #

union :: Ord v => NESet v -> NESet v -> NESet v Source #

intersection :: Ord v => NESet v -> NESet v -> Set v Source #