This commit is contained in:
Joey Hess 2024-09-03 11:52:54 -04:00
parent b800ea6826
commit 03864a2c3b
No known key found for this signature in database
GPG key ID: DB12DB0FF05F8F38
2 changed files with 4 additions and 13 deletions

View file

@ -21,8 +21,8 @@ Planned schedule of work:
* July: p2p protocol over http * July: p2p protocol over http
* August, part 1: git-annex proxy support for exporttree * August, part 1: git-annex proxy support for exporttree
* August, part 2: balanced preferred content * August, part 2: balanced preferred content
* September: streaming through proxy to special remotes (especially S3)
* October: proving behavior of balanced preferred content with proxies * October: proving behavior of balanced preferred content with proxies
* September: streaming through proxy to special remotes (especially S3)
[[!tag projects/openneuro]] [[!tag projects/openneuro]]

View file

@ -35,18 +35,9 @@ matter the sizes of the underlying repositories, but balanced preferred
content does take repository fullness into account, which further content does take repository fullness into account, which further
complicates fully understanding the behavior. complicates fully understanding the behavior.
Notice that `balanced()` (in the current design) is not stable when used Notice that `fullbalanced()` is not stable when used
on its own, and has to be used as part of a larger expression to make it on its own, and so `balanced()` adds an "or present" to stabilize it.
stable, eg: And so `not balanced()` includes `not present`, which is bad!
((balanced(backup) and not (copies=backup:1)) or present
So perhaps `balanced()` should include the other checks in it,
to avoid the user shooting themselves in the foot. On the other
hand, if `balanced()` implicitly contains `present`, then `not balanced()`
would include `not present`, which is bad!
(For that matter, what does `not balanced()` even do currently?)
## proof ## proof