Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* The MIT License
*
* Copyright (c) 2009 The Broad Institute
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package htsjdk.samtools;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
/**
* An individual bin in a BAM file.
*
* @author mhanna
* @version 0.1
*/
public class Bin implements Comparable {
/**
* The reference sequence associated with this bin.
*/
private final int referenceSequence;
/**
* The number of this bin within the BAM file.
*/
private final int binNumber;
/**
* The chunks associated with this bin.
*/
private List chunkList;
/**
* The last chunk in the chunkList. Only maintained during index building,
* not when reading existing index
*/
private Chunk lastChunk;
public Bin(final int referenceSequence, final int binNumber) {
this.referenceSequence = referenceSequence;
this.binNumber = binNumber;
}
protected int getReferenceSequence() {
return referenceSequence;
}
public int getBinNumber() {
return binNumber;
}
/**
* See whether two bins are equal. If the ref seq and the bin number
* are equal, assume equality of the chunk list.
* @param other The other Bin to which to compare this.
* @return True if the two bins are equal. False otherwise.
*/
@Override
public boolean equals(final Object other) {
if(other == null) return false;
if(!(other instanceof Bin)) return false;
final Bin otherBin = (Bin)other;
return this.referenceSequence == otherBin.referenceSequence && this.binNumber == otherBin.binNumber;
}
/**
* Compute a unique hash code for the given reference sequence and bin number.
* @return A unique hash code.
*/
@Override
public int hashCode() {
return ((Integer)referenceSequence).hashCode() ^ ((Integer)binNumber).hashCode();
}
/**
* Returns whether the bin currently contains chunks.
* @return True if the bin has chunks, false otherwise.
*/
public boolean containsChunks() {
return chunkList != null;
}
/**
* Compare two bins to see what ordering they should appear in.
* @param other Other bin to which this bin should be compared.
* @return -1 if this < other, 0 if this == other, 1 if this > other.
*/
@Override
public int compareTo(final Bin other) {
if(other == null)
throw new ClassCastException("Cannot compare to a null object");
// Check the reference sequences first.
if(this.referenceSequence != other.referenceSequence)
return referenceSequence - other.referenceSequence;
// Then check the bin ordering.
return binNumber - other.binNumber;
}
/**
* Adds the first chunk to the bin
*/
public void addInitialChunk(final Chunk newChunk){
final List oldChunks = new ArrayList();
setChunkList(oldChunks);
setLastChunk(newChunk);
oldChunks.add(newChunk);
}
/**
* Sets the chunks associated with this bin
*/
public void setChunkList(final List list){
chunkList = list;
}
/**
* Gets the list of chunks associated with this bin.
* @return the chunks in this bin. If no chunks are associated, an empty list will be returned.
*/
public List getChunkList(){
if(chunkList == null)
return Collections.emptyList();
return chunkList;
}
/**
* Optimization to keep lastChunk instead of iterating over all chunks repeatedly
*/
public void setLastChunk(final Chunk c){
lastChunk = c;
}
/**
* Warning: Currently only valid during index building, not when reading existing index,
* (AbstractBAMFileIndex.optimizeChunkList doesn't maintain this)
* @return the last Chunk of the chunkList
*/
public Chunk getLastChunk(){
return lastChunk;
}
}