Skip to content
Snippets Groups Projects
Unverified Commit d56617aa authored by Benjamin Loison's avatar Benjamin Loison
Browse files

Verifying object attribute modification

parent 5236b81b
No related branches found
No related tags found
No related merge requests found
......@@ -35,7 +35,12 @@ def Compress(m, k, C, previous_score, previous_ℓ):
return π + χ, new_score,
def uparrow(C, μ):
return [block for block in C if block.level >= μ and block.level_min <= μ]
chain = [block for block in C if block.level >= μ and block.level_min <= μ]
for blockIndex, block in enumerate(chain):
print('a', block.level_min, μ)
block.level_min = μ
print('b', chain[blockIndex].level_min)
return chain
# Proceeding by dichotomy may not be worth it.
# For instance for the first 60 000 blocks, we have in theory 10 levels for the last blocks while log2(256) = 8, so because of first blocks not having a higher than 8 level, it doesn't seem worth it at the beginning at least.
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment