goldcollection
/
muwire
mirror of https://github.com/zlatinb/muwire
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix or suppress various warnings

pull/62/head
Zlatin Balevsky 2021-06-04 12:41:01 +01:00
parent 84387bef8e
commit 93ac56b353
No known key found for this signature in database
GPG Key ID: A72832072D525E41
4 changed files with 11 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
core/src/main/java/net/metanotion/io/block/index/BSkipLevels.java
View File

@ -35,7 +35,7 @@ import net.metanotion.io.block.BlockFile;
import net.metanotion.util.skiplist.SkipList;
import net.metanotion.util.skiplist.SkipLevels;
import net.metanotion.util.skiplist.SkipSpan;
@SuppressWarnings("unchecked")
public class BSkipLevels extends SkipLevels {
public int levelPage;
public int spanPage;
@ -48,22 +48,22 @@ public class BSkipLevels extends SkipLevels {
BlockFile.pageSeek(bf.file, levelPage);
bsl.levelHash.put(new Integer(this.levelPage), this);
bsl.levelHash.put(this.levelPage, this);
int maxLen = bf.file.readShort();
int nonNull = bf.file.readShort();
spanPage = bf.file.readInt();
bottom = (BSkipSpan) bsl.spanHash.get(new Integer(spanPage));
bottom = (BSkipSpan) bsl.spanHash.get(spanPage);
this.levels = new BSkipLevels[maxLen];
int lp;
for(int i=0;i<nonNull;i++) {
lp = bf.file.readInt();
if(lp != 0) {
levels[i] = (BSkipLevels) bsl.levelHash.get(new Integer(lp));
levels[i] = (BSkipLevels) bsl.levelHash.get(lp);
if(levels[i] == null) {
levels[i] = new BSkipLevels(bf, lp, bsl);
bsl.levelHash.put(new Integer(lp), levels[i]);
bsl.levelHash.put(lp, levels[i]);
}
} else {
levels[i] = null;

7
core/src/main/java/net/metanotion/io/block/index/BSkipSpan.java
View File

@ -37,6 +37,7 @@ import net.metanotion.io.data.NullBytes;
import net.metanotion.util.skiplist.SkipList;
import net.metanotion.util.skiplist.SkipSpan;
@SuppressWarnings("unchecked")
public class BSkipSpan extends SkipSpan {
private final BSkipList bsl;
@ -133,7 +134,7 @@ public class BSkipSpan extends SkipSpan {
bss.keySer = key;
bss.valSer = val;
bsl.spanHash.put(new Integer(spanPage), bss);
bsl.spanHash.put(spanPage, bss);
BlockFile.pageSeek(bf.file, spanPage);
@ -196,7 +197,7 @@ public class BSkipSpan extends SkipSpan {
BSkipSpan temp;
int np = nextPage;
while(np != 0) {
temp = (BSkipSpan) bsl.spanHash.get(new Integer(np));
temp = (BSkipSpan) bsl.spanHash.get(np);
if(temp != null) {
bss.next = temp;
break;
@ -213,7 +214,7 @@ public class BSkipSpan extends SkipSpan {
bss = this;
np = prevPage;
while(np != 0) {
temp = (BSkipSpan) bsl.spanHash.get(new Integer(np));
temp = (BSkipSpan) bsl.spanHash.get(np);
if(temp != null) {
bss.next = temp;
break;

1
core/src/main/java/net/metanotion/util/skiplist/SkipLevels.java
View File

@ -28,6 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package net.metanotion.util.skiplist;
@SuppressWarnings("unchecked")
public class SkipLevels {
/* "Next" pointers
The highest indexed level is the "highest" level in the list.

1
core/src/main/java/net/metanotion/util/skiplist/SkipSpan.java
View File

@ -28,6 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package net.metanotion.util.skiplist;
@SuppressWarnings("unchecked")
public abstract class SkipSpan {
public int nKeys = 0;
public Comparable[] keys;