| Commit message (Collapse) | Author | Age |
|---|
| | |
|
| |
|
|
| |
Should have done this a long time ago.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
the wrong format, with the UUID and description flipped.
This is my own damn fault for not making UUID a real type, and then relying
on the type checker to ensure my refactoring was correct -- which it wasn't!
I should probably add code to clean up bogus entries in the uuid.log, but
right now I want to get the fix out there to prevent people experiencing
this bug.
I should also make UUID a real data type.
|
| | |
|
| |
|
|
|
| |
Apparently in haskell if you teach a man to fish, he'll write
more pointfree code.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
option is no longer used.
|
| |
|
|
| |
useful interface.
|
| |
|
|
| |
No code changes.
|
| | |
|
| |
|
|
|
| |
Turned out I had already done all the work needed to support this when
unused started checking all branches.
|
| |
|
|
|
|
|
|
|
|
| |
The backend usage graph shows present keys as well as keys found in the
repository tree, so it will also be populated for bare repositories.
Changed wording to "visible annex keys", which explains why it's 0 in
a bare repository (no keys visible as no tree), and also why it varies
depending on which branch is checked out. This seemed better than doing
something expensive to look up keys from the git-annex branch.
|
| | |
|
| |
|
|
|
|
|
|
|
| |
Checks location log information, and file contents.
Does not check that numcopies is satisfied, as .gitattributes information
about numcopies is not available in a bare repository. In practice, that
should not be a problem, since fsck is also run in a checkout and will
check numcopies there.
|
| | |
|
| |
|
|
|
|
|
|
|
| |
This new approach allows filtering out checks from the default set that are
not appropriate for a command, rather than having to list every check
that is appropriate. It also reduces some boilerplate.
Haskell does not define Eq for functions, so I had to go a long way around
with each check having a unique id. Meh.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
no code changes
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
no code changes
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
| |
This yields a second or so speedup in unused, find, etc. Seems that even
when the ByteString is immediately split and then converted to Strings,
it's faster.
I may try to push ByteStrings out into more of git-annex gradually,
although I suspect most of the time-critical parts are already covered
now, and many of the rest rely on libraries that only support Strings.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
| |
Fixed the laziness space leak, so it runs in 60 mb or so again. Slightly
faster due to using Data.Set.difference now, although this also makes it
use slightly more memory.
Also added display of the refs being checked, and made unused --from
also check all refs for things in the remote.
|
| |
|
|
| |
needs time and space optimisation
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
| |
Different keys can have the same size, so can't make a Set of the sizes.
This version actually runs faster yet, too..
|
| |
|
|
|
|
|
|
|
|
| |
Using Sets is the right thing; they have constant size lookup like my
SizeList, and logn insertation, which beats nub to death.
Runs faster than --fast mode did before, and gives accurate counts.
13 seconds total runtime with a warm cache in a repository with 40 thousand
keys.
|
| |
|
|
| |
only approximate, and is marked as such.
|
| |
|
|
|
|
|
|
|
| |
find: Rather than only showing files whose contents are present, when used
with --exclude --copies or --in, displays all files that match the
specified conditions.
Note that this is a behavior change for find --exclude! Old behavior
can be gotten with find --in . --exclude=...
|
Joey Hess