gpt4 book ai didi

org.broad.igv.bbfile.ZoomLevelIterator.getHitList()方法的使用及代码示例

转载 作者:知者 更新时间:2024-03-16 09:15:31 26 4
gpt4 key购买 nike

本文整理了Java中org.broad.igv.bbfile.ZoomLevelIterator.getHitList()方法的一些代码示例,展示了ZoomLevelIterator.getHitList()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。ZoomLevelIterator.getHitList()方法的具体详情如下:
包路径:org.broad.igv.bbfile.ZoomLevelIterator
类名称:ZoomLevelIterator
方法名:getHitList

ZoomLevelIterator.getHitList介绍

暂无

代码示例

代码示例来源:origin: pcingola/SnpEff

private int getHitRegion(RPChromosomeRegion hitRegion, boolean contained) {
  int hitCount = 0;
  // check if new hit list is needed
  // Note: getHitList will reset mLeafItemIndex to 0, the beginning of new hit list
  if (leafHitList == null) {   //|| mLeafItemIndex >= mLeafHitList.size()){
    hitCount = getHitList(hitRegion, contained);
    if (hitCount == 0)
      return 0;   // no hit data found
  } else {
    hitCount = leafHitList.size() - leafItemIndex;
    if (hitCount == 0)
      return 0;   // hit list exhausted
  }
  // Perform a block read for starting base of selection region - use first leaf hit
  dataBlockRead = getDataBlock(leafItemIndex++);
  // try next item - probably intersection issue
  // Note: recursive call until a block is valid or hit list exhuasted
  if (!dataBlockRead)
    hitCount = getHitRegion(hitRegion, contained);
  return hitCount;
}

代码示例来源:origin: igvteam/igv

private int getHitRegion(RPChromosomeRegion hitRegion, boolean contained) {
  int hitCount = 0;
  // check if new hit list is needed
  // Note: getHitList will reset mLeafItemIndex to 0, the beginning of new hit list
  if (leafHitList == null) {   //|| mLeafItemIndex >= mLeafHitList.size()){
    hitCount = getHitList(hitRegion, contained);
    if (hitCount == 0)
      return 0;   // no hit data found
  } else {
    hitCount = leafHitList.size() - leafItemIndex;
    if (hitCount == 0)
      return 0;   // hit list exhausted
  }
  // Perform a block read for starting base of selection region - use first leaf hit
  dataBlockRead = getDataBlock(leafItemIndex++);
  // try next item - probably intersection issue
  // Note: recursive call until a block is valid or hit list exhuasted
  if (!dataBlockRead)
    hitCount = getHitRegion(hitRegion, contained);
  return hitCount;
}

代码示例来源:origin: edu.toronto.cs.savant/savant-core

private int getHitRegion(RPChromosomeRegion hitRegion, boolean contained) {
  int hitCount = 0;
  // check if new hit list is needed
  // Note: getHitList will reset mLeafItemIndex to 0, the beginning of new hit list
  if (leafHitList == null) {   //|| mLeafItemIndex >= mLeafHitList.size()){
    hitCount = getHitList(hitRegion, contained);
    if (hitCount == 0)
      return 0;   // no hit data found
  } else {
    hitCount = leafHitList.size() - leafItemIndex;
    if (hitCount == 0)
      return 0;   // hit list exhausted
  }
  // Perform a block read for starting base of selection region - use first leaf hit
  dataBlockRead = getDataBlock(leafItemIndex++);
  // try next item - probably intersection issue
  // Note: recursive call until a block is valid or hit list exhuasted
  if (!dataBlockRead)
    hitCount = getHitRegion(hitRegion, contained);
  return hitCount;
}

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com