067aabdd48
Finally builds (oh the agoncy of making it build), but still very unmergable, only Command.Find is included and lots of stuff is badly hacked to make it compile. Benchmarking vs master, this git-annex find is significantly faster! Specifically: num files old new speedup 48500 4.77 3.73 28% 12500 1.36 1.02 66% 20 0.075 0.074 0% (so startup time is unchanged) That's without really finishing the optimization. Things still to do: * Eliminate all the fromRawFilePath, toRawFilePath, encodeBS, decodeBS conversions. * Use versions of IO actions like getFileStatus that take a RawFilePath. * Eliminate some Data.ByteString.Lazy.toStrict, which is a slow copy. * Use ByteString for parsing git config to speed up startup. It's likely several of those will speed up git-annex find further. And other commands will certianly benefit even more.
38 lines
981 B
Haskell
38 lines
981 B
Haskell
{- git-annex single-value log
|
|
-
|
|
- This is used to store a value in a way that can be union merged.
|
|
-
|
|
- A line of the log will look like: "timestamp value"
|
|
-
|
|
- The line with the newest timestamp wins.
|
|
-
|
|
- Copyright 2014 Joey Hess <id@joeyh.name>
|
|
-
|
|
- Licensed under the GNU AGPL version 3 or higher.
|
|
-}
|
|
|
|
module Logs.SingleValue (
|
|
module Logs.SingleValue.Pure,
|
|
readLog,
|
|
getLog,
|
|
setLog,
|
|
) where
|
|
|
|
import Annex.Common
|
|
import qualified Annex.Branch
|
|
import Logs.SingleValue.Pure
|
|
import Annex.VectorClock
|
|
|
|
import qualified Data.Set as S
|
|
|
|
readLog :: (Ord v, SingleValueSerializable v) => RawFilePath -> Annex (Log v)
|
|
readLog = parseLog <$$> Annex.Branch.get
|
|
|
|
getLog :: (Ord v, SingleValueSerializable v) => RawFilePath -> Annex (Maybe v)
|
|
getLog = newestValue <$$> readLog
|
|
|
|
setLog :: (SingleValueSerializable v) => RawFilePath -> v -> Annex ()
|
|
setLog f v = do
|
|
c <- liftIO currentVectorClock
|
|
let ent = LogEntry c v
|
|
Annex.Branch.change f $ \_old -> buildLog (S.singleton ent)
|