Reformatted a comment in all language versions (related to commit 5073db4487).

This commit is contained in:
Project Nayuki 2018-08-26 03:55:03 +00:00
parent c3aeb24757
commit 98d1f0cc91
7 changed files with 7 additions and 14 deletions

View File

@ -619,8 +619,7 @@ static long getPenaltyScore(const uint8_t qrcode[]) {
black++;
}
}
// Note that size is odd, so black/total != 1/2
int total = qrsize * qrsize;
int total = qrsize * qrsize; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
int k = (int)((labs(black * 20L - total * 10L) + total - 1) / total) - 1;
result += k * PENALTY_N4;

View File

@ -485,8 +485,7 @@ long QrCode::getPenaltyScore() const {
black++;
}
}
// Note that size is odd, so black/total != 1/2
int total = size * size;
int total = size * size; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
int k = static_cast<int>((std::abs(black * 20L - total * 10L) + total - 1) / total) - 1;
result += k * PENALTY_N4;

View File

@ -632,8 +632,7 @@ public final class QrCode {
black++;
}
}
// Note that size is odd, so black/total != 1/2
int total = size * size;
int total = size * size; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
int k = (Math.abs(black * 20 - total * 10) + total - 1) / total - 1;
result += k * PENALTY_N4;

View File

@ -480,8 +480,7 @@ var qrcodegen = new function() {
black++;
});
});
// Note that size is odd, so black/total != 1/2
var total = size * size;
var total = size * size; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
var k = Math.ceil(Math.abs(black * 20 - total * 10) / total) - 1;
result += k * QrCode.PENALTY_N4;

View File

@ -476,8 +476,7 @@ class QrCode(object):
# Balance of black and white modules
black = sum((1 if cell else 0) for row in modules for cell in row)
# Note that size is odd, so black/total != 1/2
total = size**2
total = size**2 # Note that size is odd, so black/total != 1/2
# Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
k = (abs(black * 20 - total * 10) + total - 1) // total - 1
result += k * QrCode._PENALTY_N4

View File

@ -609,8 +609,7 @@ impl QrCode {
for color in &self.modules {
black += *color as i32;
}
// Note that size is odd, so black/total != 1/2
let total: i32 = size * size;
let total: i32 = size * size; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
let k: i32 = ((black * 20 - total * 10).abs() + total - 1) / total - 1;
result += k * PENALTY_N4;

View File

@ -548,8 +548,7 @@ namespace qrcodegen {
black++;
});
});
// Note that size is odd, so black/total != 1/2
let total: int = this.size * this.size;
let total: int = this.size * this.size; // Note that size is odd, so black/total != 1/2
// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
let k: int = Math.ceil(Math.abs(black * 20 - total * 10) / total) - 1;
result += k * QrCode.PENALTY_N4;