3518c586cf
Several places assumed this would not happen, and when the AssociatedFile was Nothing, did nothing. As part of this, preferred content checks pass the Key around. Note that checkMatcher is sometimes now called with Just Key and Just File. It currently constructs a FileMatcher, ignoring the Key. However, if it constructed a FileKeyMatcher, which contained both, then it might be possible to speed up parts of Limit, which currently call the somewhat expensive lookupFileKey to get the Key. I have not made this optimisation yet, because I am not sure if the key is always the same. Will need some significant checking to satisfy myself that's the case..
23 lines
629 B
Haskell
23 lines
629 B
Haskell
{- git-annex limits by wanted status
|
|
-
|
|
- Copyright 2012 Joey Hess <joey@kitenet.net>
|
|
-
|
|
- Licensed under the GNU GPL version 3 or higher.
|
|
-}
|
|
|
|
module Limit.Wanted where
|
|
|
|
import Common.Annex
|
|
import Annex.Wanted
|
|
import Limit
|
|
import Types.FileMatcher
|
|
|
|
addWantGet :: Annex ()
|
|
addWantGet = addLimit $ Right $ const $ checkWant $ wantGet False Nothing
|
|
|
|
addWantDrop :: Annex ()
|
|
addWantDrop = addLimit $ Right $ const $ checkWant $ wantDrop False Nothing Nothing
|
|
|
|
checkWant :: (Maybe FilePath -> Annex Bool) -> MatchInfo -> Annex Bool
|
|
checkWant a (MatchingFile fi) = a (Just $ matchFile fi)
|
|
checkWant _ (MatchingKey _) = return False
|