Safe Haskell | Safe |
---|---|

Language | Haskell98 |

A module of simple utility functions which are used throughout the rest of the library

## Synopsis

- toSet :: Ord a => [a] -> [a]
- sortDesc :: Ord a => [a] -> [a]
- insertDesc :: Ord a => a -> [a] -> [a]
- setUnionAsc :: Ord a => [a] -> [a] -> [a]
- setUnionDesc :: Ord a => [a] -> [a] -> [a]
- intersectAsc :: Ord a => [a] -> [a] -> [a]
- multisetSumAsc :: Ord a => [a] -> [a] -> [a]
- multisetSumDesc :: Ord a => [a] -> [a] -> [a]
- diffAsc :: Ord a => [a] -> [a] -> [a]
- diffDesc :: Ord a => [a] -> [a] -> [a]
- isSubsetAsc :: Ord a => [a] -> [a] -> Bool
- isSubMultisetAsc :: Ord a => [a] -> [a] -> Bool
- elemAsc :: Ord a => a -> [a] -> Bool
- notElemAsc :: Ord a => a -> [a] -> Bool
- picks :: [a] -> [(a, [a])]
- pairs :: [t] -> [(t, t)]
- ordpair :: Ord b => b -> b -> (b, b)
- foldcmpl :: (b -> b -> Bool) -> [b] -> Bool
- isWeaklyIncreasing :: Ord t => [t] -> Bool
- isStrictlyIncreasing :: Ord t => [t] -> Bool
- isWeaklyDecreasing :: Ord t => [t] -> Bool
- isStrictlyDecreasing :: Ord t => [t] -> Bool
- cmpfst :: Ord a => (a, b1) -> (a, b2) -> Ordering
- eqfst :: Eq a => (a, b1) -> (a, b2) -> Bool
- fromBase :: (Foldable t, Num a) => a -> t a -> a
- powersetdfs :: [a] -> [[a]]
- powersetbfs :: [a] -> [[a]]
- combinationsOf :: Int -> [a] -> [[a]]
- choose :: Integral a => a -> a -> a
- class FinSet x where
- elts :: [x]

- class HasInverses a where
- inverse :: a -> a

- (^-) :: (Num a, HasInverses a, Integral b) => a -> b -> a

# Documentation

insertDesc :: Ord a => a -> [a] -> [a] Source #

setUnionAsc :: Ord a => [a] -> [a] -> [a] Source #

The set union of two ascending lists. If both inputs are strictly increasing, then the output is their union and is strictly increasing. The code does not check that the lists are strictly increasing.

setUnionDesc :: Ord a => [a] -> [a] -> [a] Source #

intersectAsc :: Ord a => [a] -> [a] -> [a] Source #

The (multi-)set intersection of two ascending lists. If both inputs are strictly increasing, then the output is the set intersection and is strictly increasing. If both inputs are weakly increasing, then the output is the multiset intersection (with multiplicity), and is weakly increasing.

multisetSumAsc :: Ord a => [a] -> [a] -> [a] Source #

The multiset sum of two ascending lists. If xs and ys are ascending, then multisetSumAsc xs ys == sort (xs++ys). The code does not check that the lists are ascending.

multisetSumDesc :: Ord a => [a] -> [a] -> [a] Source #

The multiset sum of two descending lists. If xs and ys are descending, then multisetSumDesc xs ys == sortDesc (xs++ys). The code does not check that the lists are descending.

diffAsc :: Ord a => [a] -> [a] -> [a] Source #

The multiset or set difference between two ascending lists. If xs and ys are ascending, then diffAsc xs ys == xs \ ys, and diffAsc is more efficient. If xs and ys are sets (that is, have no repetitions), then diffAsc xs ys is the set difference. The code does not check that the lists are ascending.

diffDesc :: Ord a => [a] -> [a] -> [a] Source #

The multiset or set difference between two descending lists. If xs and ys are descending, then diffDesc xs ys == xs \ ys, and diffDesc is more efficient. If xs and ys are sets (that is, have no repetitions), then diffDesc xs ys is the set difference. The code does not check that the lists are descending.

isSubsetAsc :: Ord a => [a] -> [a] -> Bool Source #

isSubMultisetAsc :: Ord a => [a] -> [a] -> Bool Source #

elemAsc :: Ord a => a -> [a] -> Bool Source #

Is the element in the ascending list?

With infinite lists, this can fail to terminate.
For example, elemAsc 1 [1*2,3*4,7/8..] would fail to terminate.
However, with a list of Integer, this will always terminate.

notElemAsc :: Ord a => a -> [a] -> Bool Source #

Is the element not in the ascending list? (With infinite lists, this can fail to terminate.)

picks :: [a] -> [(a, [a])] Source #

Return all the ways to "pick one and leave the others" from a list

isWeaklyIncreasing :: Ord t => [t] -> Bool Source #

isStrictlyIncreasing :: Ord t => [t] -> Bool Source #

isWeaklyDecreasing :: Ord t => [t] -> Bool Source #

isStrictlyDecreasing :: Ord t => [t] -> Bool Source #

powersetdfs :: [a] -> [[a]] Source #

Given a set `xs`

, represented as an ordered list, `powersetdfs xs`

returns the list of all subsets of xs, in lex order

powersetbfs :: [a] -> [[a]] Source #

Given a set `xs`

, represented as an ordered list, `powersetbfs xs`

returns the list of all subsets of xs, in shortlex order

combinationsOf :: Int -> [a] -> [[a]] Source #

Given a positive integer `k`

, and a set `xs`

, represented as a list,
`combinationsOf k xs`

returns all k-element subsets of xs.
The result will be in lex order, relative to the order of the xs.

choose :: Integral a => a -> a -> a Source #

`choose n k`

is the number of ways of choosing k distinct elements from an n-set

The class of finite sets

## Instances

FinSet F25 Source # | |

Defined in Math.Core.Field | |

FinSet F16 Source # | |

Defined in Math.Core.Field | |

FinSet F9 Source # | |

Defined in Math.Core.Field | |

FinSet F8 Source # | |

Defined in Math.Core.Field | |

FinSet F4 Source # | |

Defined in Math.Core.Field | |

FinSet F23 Source # | |

Defined in Math.Core.Field | |

FinSet F19 Source # | |

Defined in Math.Core.Field | |

FinSet F17 Source # | |

Defined in Math.Core.Field | |

FinSet F13 Source # | |

Defined in Math.Core.Field | |

FinSet F11 Source # | |

Defined in Math.Core.Field | |

FinSet F7 Source # | |

Defined in Math.Core.Field | |

FinSet F5 Source # | |

Defined in Math.Core.Field | |

FinSet F3 Source # | |

Defined in Math.Core.Field | |

FinSet F2 Source # | |

Defined in Math.Core.Field | |

IntegerAsType p => FinSet (Fp p) Source # | |

Defined in Math.Algebra.Field.Base | |

(FinSet fp, Eq fp, Num fp, PolynomialAsType fp poly) => FinSet (ExtensionField fp poly) Source # | |

Defined in Math.Algebra.Field.Extension elts :: [ExtensionField fp poly] Source # |

class HasInverses a where Source #

A class representing algebraic structures having an inverse operation. Note that in some cases not every element has an inverse.

## Instances

HasInverses SSymF Source # | |

Ord a => HasInverses (Permutation a) Source # | The HasInverses instance is what enables us to write |

Defined in Math.Algebra.Group.PermutationGroup inverse :: Permutation a -> Permutation a Source # | |

HasInverses (GroupAlgebra Q) Source # | Note that the inverse of a group algebra element can only be efficiently calculated if the group generated by the non-zero terms is very small (eg <100 elements). |

Defined in Math.Algebras.GroupAlgebra inverse :: GroupAlgebra Q -> GroupAlgebra Q Source # | |

(Eq k, Fractional k, Ord a, Show a) => HasInverses (Vect k (Interval a)) Source # | |