Copyright | Phillip Seeber 2022 |
---|---|
License | AGPL-3 |
Maintainer | phillip.seeber@googlemail.com |
Stability | experimental |
Portability | POSIX, Windows |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- newtype IndexException = IndexException String
- magnitude :: (Numeric r e, Source r e, Floating e) => Vector r e -> e
- normalise :: (Numeric r e, Source r e, Floating e) => Vector r e -> Vector r e
- angle :: (Numeric r e, Source r e, Floating e) => Vector r e -> Vector r e -> e
- minDistAt :: (Manifest r e, MonadThrow m, Ord e) => Matrix r e -> m (e, Ix2)
- minDistAtVec :: (Manifest r e, MonadThrow m, Ord e) => Ix1 -> Vector r e -> m (e, Ix1)
- iMinimumM :: (Manifest r a, MonadThrow m, Index ix, Ord a) => Array r ix a -> m (a, ix)
Documentation
newtype IndexException Source #
Exception regarding indexing in some kind of aaray.
Instances
Exception IndexException Source # | |
Defined in ConClusion.Array.Util | |
Show IndexException Source # | |
Defined in ConClusion.Array.Util showsPrec :: Int -> IndexException -> ShowS # show :: IndexException -> String # showList :: [IndexException] -> ShowS # |
magnitude :: (Numeric r e, Source r e, Floating e) => Vector r e -> e Source #
Magnitude of a vector (length).
normalise :: (Numeric r e, Source r e, Floating e) => Vector r e -> Vector r e Source #
Normalise a vector.
angle :: (Numeric r e, Source r e, Floating e) => Vector r e -> Vector r e -> e Source #
Angle between two vectors.
minDistAt :: (Manifest r e, MonadThrow m, Ord e) => Matrix r e -> m (e, Ix2) Source #
Find the minimal distance in a distance matrix, which is not the main diagonal.
minDistAtVec :: (Manifest r e, MonadThrow m, Ord e) => Ix1 -> Vector r e -> m (e, Ix1) Source #
Find the minimal element of a vector, which is at a larger than the supplied index.