Node
This commit is contained in:
@@ -328,10 +328,10 @@ public class NodeManager2 {
|
|||||||
int baseIdx = this.nodeAllocations.allocateNextConsecutiveCounted(Integer.bitCount(msk));
|
int baseIdx = this.nodeAllocations.allocateNextConsecutiveCounted(Integer.bitCount(msk));
|
||||||
for (int i = 0; i < 8; i++) {
|
for (int i = 0; i < 8; i++) {
|
||||||
if ((msk&(1<<i))!=0) {
|
if ((msk&(1<<i))!=0) {
|
||||||
//It means the section actually exists,
|
//It means the section actually exists, so add and upload it
|
||||||
|
// aswell as add it to the mapping + push the node
|
||||||
} else {
|
} else {
|
||||||
//The section was empty, so just remove it
|
//The section was empty, so just remove/skip it
|
||||||
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -62,6 +62,7 @@ public class HierarchicalBitSet {
|
|||||||
if (this.cnt+count>this.limit) {
|
if (this.cnt+count>this.limit) {
|
||||||
return -2;//Limit reached
|
return -2;//Limit reached
|
||||||
}
|
}
|
||||||
|
//At a minimum maybe just do a while loop for testing
|
||||||
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user