Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
ft_Vector_From_Polar' :: Ptr FT_Vector -> FT_Fixed -> FT_Angle -> IO ()freetype2 FreeType.Support.Computations.Internal No documentation available.
ft_Vector_Length' :: Ptr FT_Vector -> IO FT_Fixedfreetype2 FreeType.Support.Computations.Internal No documentation available.
ft_Vector_Polarize' :: Ptr FT_Vector -> Ptr FT_Fixed -> Ptr FT_Angle -> IO ()freetype2 FreeType.Support.Computations.Internal No documentation available.
ft_Vector_Rotate' :: Ptr FT_Vector -> FT_Angle -> IO ()freetype2 FreeType.Support.Computations.Internal No documentation available.
ft_Vector_Transform' :: Ptr FT_Vector -> Ptr FT_Matrix -> IO ()freetype2 FreeType.Support.Computations.Internal No documentation available.
ft_Vector_Unit' :: Ptr FT_Vector -> FT_Angle -> IO ()freetype2 FreeType.Support.Computations.Internal No documentation available.
gramVector :: Text -> Int -> HashMap Text Intfuzzyset Data.FuzzySet.Internal Generate a list of n-grams (character substrings) from the normalized input and then translate this into a dictionary with the n-grams as keys mapping to the number of occurences of the substring in the list.
>>> gramVector "xxxx" 2 fromList [("-x",1), ("xx",3), ("x-",1)]The substring "xx" appears three times in the normalized string:>>> grams "xxxx" 2 ["-x","xx","xx","xx","x-"]
>>> Data.HashMap.Strict.lookup "nts" (gramVector "intrent'srestaurantsomeoftrent'saunt'santswantsamtorentsomepants" 3) Just 8
module Grisette.Internal.Core.Data.Class.
BitVector No documentation available.
-
histogram-fill Data.Histogram No documentation available.
-
histogram-fill Data.Histogram.Generic Convert histogram data to vector