public int compareRegions(RPChromosomeRegion chromosomeRegion) { // test leaf item bounds for hit int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
public int compareRegions(RPChromosomeRegion chromosomeRegion) { int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
public int compareRegions(RPChromosomeRegion chromosomeRegion) { return chromosomeBounds.compareRegions(chromosomeRegion); }
public int compareRegions(RPChromosomeRegion chromosomeRegion) { return chromosomeBounds.compareRegions(chromosomeRegion); }
public int compareRegions(RPChromosomeRegion chromosomeRegion) { // test leaf item bounds for hit int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
public int compareRegions(RPChromosomeRegion chromosomeRegion){ int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
public int compareRegions(RPChromosomeRegion chromosomeRegion) { int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
public int compareRegions(RPChromosomeRegion chromosomeRegion){ int value = chromosomeBounds.compareRegions(chromosomeRegion); return value; }
/** * Comparator for mChromosome bounds is used to find relevant intervals and * rank placement of node items. Returned value indicates relative * positioning to supplied chromosome test region , and expands on normal * comparator by indicating partial overlap in the extremes. * <p/> * Returns: * - 2 indicates that this region is completely disjoint below the test region * -1 indicates this region intersects the test region from below * 0 indicates that this region is inclusive to the test region * 1 indicates this region intersects the test region from above * 2 indicates that this region is completely disjoint above the test region * <p/> * Note: additional tests can be applied to determine intersection from above * or below the test region and disjoint above or below the test region cases. */ public int compareRegions(RPChromosomeRegion testRegion) { return compareRegions(testRegion.startChromID, testRegion.startBase, testRegion.endChromID, testRegion.endBase); }
int leafHitValue = selectionRegion.compareRegions(chromID, chromStart, chromID, chromEnd); if (leafHitValue == -2 || (contained && leafHitValue == -1)) { remDataSize -= (minItemSize + restOfFields.length());
int leafHitValue = itemRegion.compareRegions(selectionRegion); itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); } else { // test for hit itemRegion = new RPChromosomeRegion(chromID, chromStart, chromID, chromEnd); itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); } else { // test for hit itemRegion = new RPChromosomeRegion(chromID, chromStart, chromID, chromEnd); itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); } else { // test for hit itemRegion = new RPChromosomeRegion(chromID, chromStart, chromID, chromEnd); itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); int itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); int itemHitValue = itemRegion.compareRegions(selectionRegion);
int leafHitValue = itemRegion.compareRegions(selectionRegion); int itemHitValue = itemRegion.compareRegions(selectionRegion);