Hoogle Search
Within LTS Haskell 24.58 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
submatrix :: Int -> Int -> Int -> Int -> Matrix a -> Matrix amatrix Data.Matrix O(1). Extract a submatrix given row and column limits. Example:
( 1 2 3 ) ( 4 5 6 ) ( 2 3 ) submatrix 1 2 2 3 ( 7 8 9 ) = ( 5 6 )
_errprefix :: RunState text -> textprocess-extras System.Process.Run Prefix for lines of stderr
_outprefix :: RunState text -> textprocess-extras System.Process.Run Prefix for lines of stdout
-
POSIX Backend for "Text.Regex" (regex-base) The POSIX regex backend for regex-base. The main appeal of this backend is that it's very lightweight due to its reliance on the ubiquitous POSIX.2 regex facility that is provided by the standard C library on most POSIX platforms. See also https://wiki.haskell.org/Regular_expressions for more information.
-
Module that provides the Regex backend that wraps the C POSIX.2 regex api. This is the backend being used by the regex-compat package to replace Text.Regex. The Text.Regex.Posix module provides a backend for regular expressions. If you import this along with other backends, then you should do so with qualified imports, perhaps renamed for convenience. If the =~ and =~~ functions are too high level, you can use the compile, regexec, and execute functions from importing either Text.Regex.Posix.String or Text.Regex.Posix.ByteString. If you want to use a low-level CString interface to the library, then import Text.Regex.Posix.Wrap and use the wrap* functions. This module is only efficient with ByteString only if it is null terminated, i.e. (Bytestring.last bs)==0. Otherwise the library must make a temporary copy of the ByteString and append the NUL byte. A String will be converted into a CString for processing. Doing this repeatedly will be very inefficient. Note that the posix library works with single byte characters, and does not understand Unicode. If you need Unicode support you will have to use a different backend. When offsets are reported for subexpression captures, a subexpression that did not match anything (as opposed to matching an empty string) will have its offset set to the unusedRegOffset value, which is (-1). Benchmarking shows the default regex library on many platforms is very inefficient. You might increase performace by an order of magnitude by obtaining libpcre and regex-pcre or libtre and regex-tre. If you do not need the captured substrings then you can also get great performance from regex-dfa. If you do need the capture substrings then you may be able to use regex-parsec to improve performance.
getVersion_Text_Regex_Posix :: Versionregex-posix Text.Regex.Posix No documentation available.
type family
IsPrefixOf (a1 :: [a]) (a2 :: NonEmpty a) :: Boolsingletons-base Data.List.NonEmpty.Singletons No documentation available.
data
IsPrefixOfSym0 (a1 :: TyFun [a] NonEmpty a ~> Bool)singletons-base Data.List.NonEmpty.Singletons No documentation available.
data
IsPrefixOfSym1 (a6989586621681141589 :: [a]) (b :: TyFun NonEmpty a Bool)singletons-base Data.List.NonEmpty.Singletons No documentation available.
-
singletons-base Data.List.NonEmpty.Singletons No documentation available.