ben/brouter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 3

Unify brackets for opening blocks with comments

Browse source
This commit is contained in:
moving-bits 2023-04-29 19:04:52 +02:00
parent 340227016a
commit 79b1eda1ed
28 changed files with 83 additions and 164 deletions
Download patch file Download diff file Expand all files Collapse all files

3
brouter-util/src/main/java/btools/util/BitCoderContext.java
View file

@ -128,8 +128,7 @@ public class BitCoderContext {
bits -= len;
return vl_values[b12]; // full value lookup
}
if (len <= 23) // // only length lookup
{
if (len <= 23) { // // only length lookup
int len2 = len >> 1;
b >>>= (len2 + 1);
int mask = 0xffffffff >>> (32 - len2);

3
brouter-util/src/main/java/btools/util/ByteDataWriter.java
View file

@ -99,8 +99,7 @@ public class ByteDataWriter extends ByteDataReader {
size++;
}
while (v != 0);
if (size > 1) // doesn't fit -> shift the data after the placeholder
{
if (size > 1) { // doesn't fit -> shift the data after the placeholder
System.arraycopy(ab, sizeoffset + 1, ab, sizeoffset + size, datasize);
}
aboffset = sizeoffset;

3
brouter-util/src/main/java/btools/util/CompactLongMap.java
View file

@ -248,8 +248,7 @@ public class CompactLongMap<V> {
pa[i] = 0;
}
for (int ti = 0; ti < size; ti++) // target-index
{
for (int ti = 0; ti < size; ti++) { // target-index
int bp = size; // treat size as bitpattern
int minIdx = -1;
long minId = 0;

3
brouter-util/src/main/java/btools/util/CompactLongSet.java
View file

@ -149,8 +149,7 @@ public class CompactLongSet {
pa[i] = 0;
}
for (int ti = 0; ti < size; ti++) // target-index
{
for (int ti = 0; ti < size; ti++) { // target-index
int bp = size; // treat size as bitpattern
int minIdx = -1;
long minId = 0;

3
brouter-util/src/main/java/btools/util/MixCoderDataInputStream.java
View file

@ -84,8 +84,7 @@ public final class MixCoderDataInputStream extends DataInputStream {
bits -= len;
return vl_values[b12]; // full value lookup
}
if (len <= 23) // // only length lookup
{
if (len <= 23) { // // only length lookup
int len2 = len >> 1;
b >>>= (len2 + 1);
int mask = 0xffffffff >>> (32 - len2);

3
brouter-util/src/main/java/btools/util/SortedHeap.java
View file

@ -209,8 +209,7 @@ public final class SortedHeap<V> {
public void add(int key, V value) {
size++;
if (first.lp == 0 && second.lp == 0) // both full ?
{
if (first.lp == 0 && second.lp == 0) { // both full ?
sortUp();
}
if (first.lp > 0) {