de.regnis.q.sequence.line.QSequenceLine Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of sequence-library Show documentation
Show all versions of sequence-library Show documentation
Textual Diff and Merge Library
/*
* ====================================================================
* Copyright (c) 2000-2008 SyntEvo GmbH, [email protected]
* All rights reserved.
*
* This software is licensed as described in the file SEQUENCE-LICENSE,
* which you should have received as part of this distribution. Use is
* subject to license terms.
* ====================================================================
*/
package de.regnis.q.sequence.line;
import de.regnis.q.sequence.line.simplifier.*;
/**
* @author Marc Strapetz
*/
public final class QSequenceLine {
// Fields =================================================================
private final long from;
private final byte[] contentBytes;
private final byte[] compareBytes;
// Setup ==================================================================
public QSequenceLine(long from, byte[] contentBytes, QSequenceLineSimplifier simplifier) {
this.from = from;
this.contentBytes = contentBytes;
this.compareBytes = simplifier.simplify(contentBytes);
}
// Accessing ==============================================================
public long getFrom() {
return from;
}
public long getTo() {
return from + contentBytes.length - 1;
}
public int getContentLength() {
return contentBytes.length;
}
public byte[] getContentBytes() {
return contentBytes;
}
/**
* @deprecated
*/
public byte[] getBytes() {
return getContentBytes();
}
public int getCompareHash() {
return new String(compareBytes).hashCode();
}
// Implemented ============================================================
public boolean equals(Object obj) {
// Must be because of caching media! Find something better!
final byte[] otherBytes = ((QSequenceLine)obj).compareBytes;
if (compareBytes.length != otherBytes.length) {
return false;
}
for (int index = 0; index < compareBytes.length; index++) {
if (compareBytes[index] != otherBytes[index]) {
return false;
}
}
return true;
}
public int hashCode() {
int hashCode = 0;
for (int index = 0; index < compareBytes.length; index++) {
hashCode = 31 * hashCode + compareBytes[index];
}
return hashCode;
}
public String toString() {
return new String(contentBytes);
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy