de.lmu.ifi.dbs.elki.logging.Logging.isDebuggingFinest()方法的使用及代码示例

x33g5p2x  于2022-01-23 转载在 其他  
字(10.1k)|赞(0)|评价(0)|浏览(171)

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

Logging.isDebuggingFinest介绍

[英]Test whether to log 'debug' at 'FINEST' level
[中]测试是否在“最佳”级别记录“调试”

代码示例

代码示例来源：origin: elki-project/elki

@Override
public ParsedURLData parseURL(String urlStr) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("parseURL: " + urlStr);
 }
 if(urlStr.startsWith(INTERNAL_PREFIX)) {
  InternalParsedURLData ret = new InternalParsedURLData(urlStr.substring(INTERNAL_PREFIX.length()));
  return ret;
 }
 return null;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-batik-visualization

@Override
public ParsedURLData parseURL(String urlStr) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("parseURL: " + urlStr);
 }
 if(urlStr.startsWith(INTERNAL_PREFIX)) {
  InternalParsedURLData ret = new InternalParsedURLData(urlStr.substring(INTERNAL_PREFIX.length()));
  return ret;
 }
 return null;
}

代码示例来源：origin: elki-project/elki

/**
 * Flip triangles as necessary
 *
 * @param flippedB Bit set to mark triangles as done
 */
int flipTriangles(long[] flippedB) {
 final int size = tris.size();
 int numflips = 0;
 BitsUtil.zeroI(flippedB);
 for(int i = 0; i < size; i++) {
  if(!BitsUtil.get(flippedB, i) && flipTriangle(i, flippedB) >= 0) {
   numflips += 2;
  }
 }
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Flips: " + numflips);
 }
 return numflips;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-core-math

/**
 * Flip triangles as necessary
 *
 * @param flippedB Bit set to mark triangles as done
 */
int flipTriangles(long[] flippedB) {
 final int size = tris.size();
 int numflips = 0;
 BitsUtil.zeroI(flippedB);
 for(int i = 0; i < size; i++) {
  if(!BitsUtil.get(flippedB, i) && flipTriangle(i, flippedB) >= 0) {
   numflips += 2;
  }
 }
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Flips: " + numflips);
 }
 return numflips;
}

代码示例来源：origin: elki-project/elki

if(LOG.isDebuggingFine()) {
 LOG.debugFine("Resize by " + inc + "x" + (inc / ratio));
 if(LOG.isDebuggingFinest()) {
  logSizes();
if(LOG.isDebuggingFinest()) {
 logSizes();

代码示例来源：origin: elki-project/elki

if(getLogger().isDebuggingFinest()) {
  getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for kNN query: " + it.get());
if(getLogger().isDebuggingFinest()) {
 StringBuilder buf = new StringBuilder();
 buf.append("Fallback to linear scan - no index was able to accelerate this query.\n");

代码示例来源：origin: elki-project/elki

if(getLogger().isDebuggingFinest()) {
  getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for range query: " + it.get());
if(getLogger().isDebuggingFinest()) {
 StringBuilder buf = new StringBuilder();
 buf.append("Fallback to linear scan - no index was able to accelerate this query.\n");

代码示例来源：origin: elki-project/elki

/**
 * Flip triangles as necessary
 *
 * @param flippedA Bit set for triangles to test
 * @param flippedB Bit set to mark triangles as done
 */
int flipTriangles(long[] flippedA, long[] flippedB) {
 int numflips = 0;
 BitsUtil.zeroI(flippedB);
 for(int i = BitsUtil.nextSetBit(flippedA, 0); i > -1; i = BitsUtil.nextSetBit(flippedA, i + 1)) {
  if(!BitsUtil.get(flippedB, i) && flipTriangle(i, flippedB) >= 0) {
   numflips += 2;
  }
 }
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Flips: " + numflips);
 }
 return numflips;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-core-math

/**
 * Flip triangles as necessary
 *
 * @param flippedA Bit set for triangles to test
 * @param flippedB Bit set to mark triangles as done
 */
int flipTriangles(long[] flippedA, long[] flippedB) {
 int numflips = 0;
 BitsUtil.zeroI(flippedB);
 for(int i = BitsUtil.nextSetBit(flippedA, 0); i > -1; i = BitsUtil.nextSetBit(flippedA, i + 1)) {
  if(!BitsUtil.get(flippedB, i) && flipTriangle(i, flippedB) >= 0) {
   numflips += 2;
  }
 }
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Flips: " + numflips);
 }
 return numflips;
}

代码示例来源：origin: elki-project/elki

@Override
public MultipleObjectsBundle filter(final MultipleObjectsBundle objects) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Removing records with NaN values.");

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-input

@Override
public MultipleObjectsBundle filter(final MultipleObjectsBundle objects) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Removing records with NaN values.");

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-input

@Override
public MultipleObjectsBundle filter(final MultipleObjectsBundle objects) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Removing records with NaN values.");

代码示例来源：origin: elki-project/elki

@Override
public MultipleObjectsBundle filter(final MultipleObjectsBundle objects) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("Removing records with NaN values.");

代码示例来源：origin: elki-project/elki

@Override
public SimilarityQuery<O> getSimilarityQuery(SimilarityFunction<? super O> similarityFunction, Object... hints) {
 if(similarityFunction == null) {
  throw new AbortException("Similarity query requested for 'null' similarity!");
 }
 for(It<SimilarityIndex<O>> it = getHierarchy().iterChildrenReverse(this).filter(SimilarityIndex.class); it.valid(); it.advance()) {
  SimilarityQuery<O> q = it.get().getSimilarityQuery(similarityFunction, hints);
  if(getLogger().isDebuggingFinest()) {
   getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for similarity query: " + it.get());
  }
  if(q != null) {
   return q;
  }
 }
 for(Object o : hints) {
  if(o == DatabaseQuery.HINT_OPTIMIZED_ONLY && !(similarityFunction instanceof DBIDSimilarityFunction)) {
   return null; // Linear scan is not desirable.
  }
 }
 return similarityFunction.instantiate(this);
}

代码示例来源：origin: elki-project/elki

@Override
public DistanceQuery<O> getDistanceQuery(DistanceFunction<? super O> distanceFunction, Object... hints) {
 if(distanceFunction == null) {
  throw new AbortException("Distance query requested for 'null' distance!");
 }
 for(It<DistanceIndex<O>> it = getHierarchy().iterChildrenReverse(this).filter(DistanceIndex.class); it.valid(); it.advance()) {
  DistanceQuery<O> q = it.get().getDistanceQuery(distanceFunction, hints);
  if(getLogger().isDebuggingFinest()) {
   getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for distance query: " + it.get());
  }
  if(q != null) {
   return q;
  }
 }
 for(Object o : hints) {
  if(o == DatabaseQuery.HINT_OPTIMIZED_ONLY && !(distanceFunction instanceof DBIDDistanceFunction)) {
   return null; // Linear scan is not desirable.
  }
 }
 return distanceFunction.instantiate(this);
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-database

@Override
public SimilarityQuery<O> getSimilarityQuery(SimilarityFunction<? super O> similarityFunction, Object... hints) {
 if(similarityFunction == null) {
  throw new AbortException("Similarity query requested for 'null' similarity!");
 }
 for(It<SimilarityIndex<O>> it = getHierarchy().iterChildrenReverse(this).filter(SimilarityIndex.class); it.valid(); it.advance()) {
  SimilarityQuery<O> q = it.get().getSimilarityQuery(similarityFunction, hints);
  if(getLogger().isDebuggingFinest()) {
   getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for similarity query: " + it.get());
  }
  if(q != null) {
   return q;
  }
 }
 for(Object o : hints) {
  if(o == DatabaseQuery.HINT_OPTIMIZED_ONLY && !(similarityFunction instanceof DBIDSimilarityFunction)) {
   return null; // Linear scan is not desirable.
  }
 }
 return similarityFunction.instantiate(this);
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-database

@Override
public DistanceQuery<O> getDistanceQuery(DistanceFunction<? super O> distanceFunction, Object... hints) {
 if(distanceFunction == null) {
  throw new AbortException("Distance query requested for 'null' distance!");
 }
 for(It<DistanceIndex<O>> it = getHierarchy().iterChildrenReverse(this).filter(DistanceIndex.class); it.valid(); it.advance()) {
  DistanceQuery<O> q = it.get().getDistanceQuery(distanceFunction, hints);
  if(getLogger().isDebuggingFinest()) {
   getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for distance query: " + it.get());
  }
  if(q != null) {
   return q;
  }
 }
 for(Object o : hints) {
  if(o == DatabaseQuery.HINT_OPTIMIZED_ONLY && !(distanceFunction instanceof DBIDDistanceFunction)) {
   return null; // Linear scan is not desirable.
  }
 }
 return distanceFunction.instantiate(this);
}

代码示例来源：origin: elki-project/elki

/**
 * Expands the specified directory nodes.
 *
 * @param distFunction the spatial distance function of this algorithm
 * @param node1 the first node
 * @param node2 the second node
 */
private void expandDirNodes(SpatialPrimitiveDistanceFunction<V> distFunction, DeLiCluNode node1, DeLiCluNode node2) {
 if(LOG.isDebuggingFinest()) {
  LOG.debugFinest("ExpandDirNodes: " + node1.getPageID() + " + " + node2.getPageID());
 }
 int numEntries_1 = node1.getNumEntries();
 int numEntries_2 = node2.getNumEntries();
 // insert all combinations of unhandled - handled children of
 // node1-node2 into pq
 for(int i = 0; i < numEntries_1; i++) {
  DeLiCluEntry entry1 = node1.getEntry(i);
  if(!entry1.hasUnhandled()) {
   continue;
  }
  for(int j = 0; j < numEntries_2; j++) {
   DeLiCluEntry entry2 = node2.getEntry(j);
   if(!entry2.hasHandled()) {
    continue;
   }
   double distance = distFunction.minDist(entry1, entry2);
   heap.add(new SpatialObjectPair(distance, entry1, entry2, true));
  }
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@Override
public DistanceQuery<O> getDistanceQuery(DistanceFunction<? super O> distanceFunction, Object... hints) {
 if(distanceFunction == null) {
  throw new AbortException("Distance query requested for 'null' distance!");
 }
 for(Iter<Result> it = getHierarchy().iterChildrenReverse(this); it.valid(); it.advance()) {
  if(!(it.get() instanceof Index)) {
   continue;
  }
  Index idx = (Index) it.get();
  if(idx instanceof DistanceIndex) {
   @SuppressWarnings("unchecked")
   final DistanceIndex<O> distanceIndex = (DistanceIndex<O>) idx;
   DistanceQuery<O> q = distanceIndex.getDistanceQuery(distanceFunction, hints);
   if(getLogger().isDebuggingFinest()) {
    getLogger().debugFinest((q != null ? "Using" : "Not using") + " index for distance query: " + idx);
   }
   if(q != null) {
    return q;
   }
  }
 }
 for(Object o : hints) {
  if(o == DatabaseQuery.HINT_OPTIMIZED_ONLY && !(distanceFunction instanceof DBIDDistanceFunction)) {
   return null; // Linear scan is not desirable.
  }
 }
 return distanceFunction.instantiate(this);
}

代码示例来源：origin: elki-project/elki

if(LOG.isDebuggingFinest()) {
 LOG.debugFinest("ExpandLeafNodes: " + node1.getPageID() + " + " + node2.getPageID());

内容来源于网络，如有侵权，请联系作者删除！

Logging

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备2022004421号-2 NULL123 https://www.null123.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com