Data.Conduit.Find

Documentation

data FileEntry

Constructors

FileEntry

Fields

entryInfo :: FileInfo

entryStatus :: FileStatus

Instances

Show FileEntry

HasFileInfo FileEntry

type Predicate m a = Looped m a a

class HasFileInfo a where

Methods

getFileInfo :: a -> FileInfo

Instances

HasFileInfo FileEntry

consider :: a -> Looped m a b -> Looped m a b

entryPath :: HasFileInfo a => a -> FilePath

matchAll :: Monad m => Predicate m a

ignoreAll :: Monad m => Looped m a b

ignoreVcs :: (MonadIO m, HasFileInfo e) => Predicate m e

Return all entries, except for those within version-control metadata directories (and not including the version control directory itself either).

regex :: (Monad m, HasFileInfo e) => Text -> Predicate m e

Find every entry whose filename part matching the given regular expression.

glob :: (Monad m, HasFileInfo e) => Text -> Predicate m e

Find every entry whose filename part matching the given filename globbing expression. For example: glob *.hs.

stat :: MonadIO m => Looped m FileInfo FileEntry

lstat :: MonadIO m => Looped m FileInfo FileEntry

regular :: Monad m => Predicate m FileEntry

hasMode :: Monad m => FileMode -> Predicate m FileEntry

executable :: Monad m => Predicate m FileEntry

filename_ :: (Monad m, HasFileInfo e) => (FilePath -> Bool) -> Predicate m e

filenameS_ :: (Monad m, HasFileInfo e) => (String -> Bool) -> Predicate m e

filepath_ :: (Monad m, HasFileInfo e) => (FilePath -> Bool) -> Predicate m e

filepathS_ :: (Monad m, HasFileInfo e) => (String -> Bool) -> Predicate m e

depth :: (Monad m, HasFileInfo e) => (Int -> Bool) -> Predicate m e

lastAccessed :: Monad m => (UTCTime -> Bool) -> Predicate m FileEntry

lastModified :: Monad m => (UTCTime -> Bool) -> Predicate m FileEntry

withPath :: HasFileInfo a => Monad m => (FilePath -> m Bool) -> Predicate m a

withStatus :: Monad m => (FileStatus -> m Bool) -> Predicate m FileEntry

prune :: MonadIO m => Predicate m a -> Predicate m a

prune is much like not_, but does not preserve recursion.

test :: MonadIO m => Predicate m FileEntry -> FilePath -> m Bool

Test a file path using the same type of Predicate that is accepted by find.

find :: (MonadIO m, MonadResource m) => FilePath -> Predicate m FileEntry -> Producer m FilePath

find' :: (MonadIO m, MonadResource m) => FilePath -> Predicate m FileEntry -> Producer m FileEntry

lfind :: (MonadIO m, MonadResource m) => FilePath -> Predicate m FileEntry -> Producer m FilePath

lfind' :: (MonadIO m, MonadResource m) => FilePath -> Predicate m FileEntry -> Producer m FileEntry

findWithPreFilter :: (MonadIO m, MonadResource m) => FilePath -> Bool -> Predicate m FileInfo -> Predicate m FileEntry -> Producer m FileEntry

readPaths :: (MonadIO m, MonadResource m) => FilePath -> Predicate m FilePath -> Producer m FilePath

or_ :: MonadIO m => Looped m a b -> Looped m a b -> Looped m a b

and_ :: MonadIO m => Looped m a b -> Looped m a b -> Looped m a b

not_ :: MonadIO m => Predicate m a -> Predicate m a

not_ reverse the meaning of the given predicate, preserving recursion.