de.regnis.q.sequence.core.QSequenceMiddleSnakeFinder类的使用及代码示例

x33g5p2x  于2022-01-29 转载在 其他  
字(9.1k)|赞(0)|评价(0)|浏览(83)

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

QSequenceMiddleSnakeFinder介绍

暂无

代码示例

代码示例来源：origin: org.codehaus.jtstand/jtstand-sequence

public QSequenceAlgorithm(QSequenceMedia media, QSequenceSnakeRegister snakeRegister, int maximumSearchDepth) {
  QSequenceAssert.assertTrue(maximumSearchDepth >= 2); // Because for dee == 1, there is a special treatment in produceSnakesInOrder.
  this.mainMedia = media;
  this.snakeRegister = snakeRegister;
  this.finder = new QSequenceMiddleSnakeFinder(media.getLeftLength(), media.getRightLength(), maximumSearchDepth);
}

代码示例来源：origin: org.tmatesoft/svn

for (int diagonal = (delta >= 0 ? dee : -dee); (delta >= 0 ? diagonal >= -dee : diagonal <= dee); diagonal += (delta >= 0 ? -2 : 2)) {
  forwardDeePathExtender.extendDeePath(media, dee, diagonal);
  if (checkForwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(diagonal)) {
      setMiddleSnake(result, forwardDeePathExtender, diagonal);
      return 2 * dee - 1;
  final int deltadDiagonal = diagonal + delta;
  backwardDeePathExtender.extendDeePath(media, dee, deltadDiagonal);
  if (checkBackwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(deltadDiagonal)) {
      setMiddleSnake(result, backwardDeePathExtender, deltadDiagonal);
      return 2 * dee;
return determineBestSnake(media, dee, delta);

代码示例来源：origin: de.regnis.q.sequence/sequence-library

private int determineBestSnake(QSequenceMedia media, int dee, final int delta) {
  final int bestForwardDiagonal = getBestForwardDiagonal(dee, delta);
  final int bestBackwardDiagonal = getBestBackwardDiagonal(dee, delta);
  if (forwardDeePathExtender.getProgress(bestForwardDiagonal) > backwardDeePathExtender.getProgress(bestBackwardDiagonal)) {
    final int left = forwardDeePathExtender.getLeft(bestForwardDiagonal);
    final int right = forwardDeePathExtender.getRight(bestForwardDiagonal);
    result.setMiddleSnake(left, right, left, right);
    return 2 * dee - 1;
  }
  final int left = backwardDeePathExtender.getLeft(bestBackwardDiagonal);
  final int right = backwardDeePathExtender.getRight(bestBackwardDiagonal);
  if (left < 0 || right < 0) {
    backwardDeePathExtender.print(media, -dee + delta, dee + delta);
  }
  result.setMiddleSnake(left, right, left, right);
  return 2 * dee;
}

代码示例来源：origin: org.codehaus.jtstand/jtstand-sequence

final int dee = finder.determineMiddleSnake(media);
if (dee <= 0) {
  registerSnake(media, 1, leftLength, 1, rightLength);
final int leftFrom = finder.getResult().getLeftFrom();
final int rightFrom = finder.getResult().getRightFrom();
final int leftTo = finder.getResult().getLeftTo();
final int rightTo = finder.getResult().getRightTo();

代码示例来源：origin: org.jvnet.hudson.svnkit/svnkit

private int determineBestSnake(QSequenceMedia media, int dee, final int delta) {
  final int bestForwardDiagonal = getBestForwardDiagonal(dee, delta);
  final int bestBackwardDiagonal = getBestBackwardDiagonal(dee, delta);
  if (forwardDeePathExtender.getProgress(bestForwardDiagonal) > backwardDeePathExtender.getProgress(bestBackwardDiagonal)) {
    final int left = forwardDeePathExtender.getLeft(bestForwardDiagonal);
    final int right = forwardDeePathExtender.getRight(bestForwardDiagonal);
    result.setMiddleSnake(left, right, left, right);
    return 2 * dee - 1;
  }
  final int left = backwardDeePathExtender.getLeft(bestBackwardDiagonal);
  final int right = backwardDeePathExtender.getRight(bestBackwardDiagonal);
  if (left < 0 || right < 0) {
    backwardDeePathExtender.print(media, -dee + delta, dee + delta);
  }
  result.setMiddleSnake(left, right, left, right);
  return 2 * dee;
}

代码示例来源：origin: org.jvnet.hudson.svnkit/svnkit

final int dee = finder.determineMiddleSnake(media);
if (dee <= 0) {
  registerSnake(media, 1, leftLength, 1, rightLength);
final int leftFrom = finder.getResult().getLeftFrom();
final int rightFrom = finder.getResult().getRightFrom();
final int leftTo = finder.getResult().getLeftTo();
final int rightTo = finder.getResult().getRightTo();

代码示例来源：origin: de.regnis.q.sequence/sequence-library

if (checkForwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(diagonal)) {
      setMiddleSnake(result, forwardDeePathExtender, diagonal);
      return 2 * dee - 1;
  final int deltadDiagonal = diagonal + delta;
  backwardDeePathExtender.extendDeePath(media, dee, deltadDiagonal);
  if (checkBackwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(deltadDiagonal)) {
      setMiddleSnake(result, backwardDeePathExtender, deltadDiagonal);
      return 2 * dee;
return determineBestSnake(media, dee, delta);

代码示例来源：origin: org.tmatesoft/svn

private int determineBestSnake(QSequenceMedia media, int dee, final int delta) {
  final int bestForwardDiagonal = getBestForwardDiagonal(dee, delta);
  final int bestBackwardDiagonal = getBestBackwardDiagonal(dee, delta);
  if (forwardDeePathExtender.getProgress(bestForwardDiagonal) > backwardDeePathExtender.getProgress(bestBackwardDiagonal)) {
    final int left = forwardDeePathExtender.getLeft(bestForwardDiagonal);
    final int right = forwardDeePathExtender.getRight(bestForwardDiagonal);
    result.setMiddleSnake(left, right, left, right);
    return 2 * dee - 1;
  }
  final int left = backwardDeePathExtender.getLeft(bestBackwardDiagonal);
  final int right = backwardDeePathExtender.getRight(bestBackwardDiagonal);
  if (left < 0 || right < 0) {
    backwardDeePathExtender.print(media, -dee + delta, dee + delta);
  }
  result.setMiddleSnake(left, right, left, right);
  return 2 * dee;
}

代码示例来源：origin: de.regnis.q.sequence/sequence-library

final int dee = finder.determineMiddleSnake(media);
if (dee <= 0) {
  registerSnake(media, 1, leftLength, 1, rightLength);
final int leftFrom = finder.getResult().getLeftFrom();
final int rightFrom = finder.getResult().getRightFrom();
final int leftTo = finder.getResult().getLeftTo();
final int rightTo = finder.getResult().getRightTo();

代码示例来源：origin: de.regnis.q.sequence/sequence-library

public QSequenceAlgorithm(QSequenceMedia media, QSequenceSnakeRegister snakeRegister, int maximumSearchDepth) {
  QSequenceAssert.assertTrue(maximumSearchDepth >= 2); // Because for dee == 1, there is a special treatment in produceSnakesInOrder.
  this.mainMedia = media;
  this.snakeRegister = snakeRegister;
  this.finder = new QSequenceMiddleSnakeFinder(media.getLeftLength(), media.getRightLength(), maximumSearchDepth);
}

代码示例来源：origin: org.jvnet.hudson.svnkit/svnkit

if (checkForwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(diagonal)) {
      setMiddleSnake(result, forwardDeePathExtender, diagonal);
      return 2 * dee - 1;
  final int deltadDiagonal = diagonal + delta;
  backwardDeePathExtender.extendDeePath(media, dee, deltadDiagonal);
  if (checkBackwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(deltadDiagonal)) {
      setMiddleSnake(result, backwardDeePathExtender, deltadDiagonal);
      return 2 * dee;
return determineBestSnake(media, dee, delta);

代码示例来源：origin: org.codehaus.jtstand/jtstand-sequence

private int determineBestSnake(QSequenceMedia media, int dee, final int delta) {
  final int bestForwardDiagonal = getBestForwardDiagonal(dee, delta);
  final int bestBackwardDiagonal = getBestBackwardDiagonal(dee, delta);
  if (forwardDeePathExtender.getProgress(bestForwardDiagonal) > backwardDeePathExtender.getProgress(bestBackwardDiagonal)) {
    final int left = forwardDeePathExtender.getLeft(bestForwardDiagonal);
    final int right = forwardDeePathExtender.getRight(bestForwardDiagonal);
    result.setMiddleSnake(left, right, left, right);
    return 2 * dee - 1;
  }
  final int left = backwardDeePathExtender.getLeft(bestBackwardDiagonal);
  final int right = backwardDeePathExtender.getRight(bestBackwardDiagonal);
  if (left < 0 || right < 0) {
    backwardDeePathExtender.print(media, -dee + delta, dee + delta);
  }
  result.setMiddleSnake(left, right, left, right);
  return 2 * dee;
}

代码示例来源：origin: org.tmatesoft/svn

final int dee = finder.determineMiddleSnake(media);
if (dee <= 0) {
  registerSnake(media, 1, leftLength, 1, rightLength);
final int leftFrom = finder.getResult().getLeftFrom();
final int rightFrom = finder.getResult().getRightFrom();
final int leftTo = finder.getResult().getLeftTo();
final int rightTo = finder.getResult().getRightTo();

代码示例来源：origin: org.tmatesoft/svn

public QSequenceAlgorithm(QSequenceMedia media, QSequenceSnakeRegister snakeRegister, int maximumSearchDepth) {
  QSequenceAssert.assertTrue(maximumSearchDepth >= 2); // Because for dee == 1, there is a special treatment in produceSnakesInOrder.
  this.mainMedia = media;
  this.snakeRegister = snakeRegister;
  this.finder = new QSequenceMiddleSnakeFinder(media.getLeftLength(), media.getRightLength(), maximumSearchDepth);
}

代码示例来源：origin: org.codehaus.jtstand/jtstand-sequence

if (checkForwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(diagonal)) {
      setMiddleSnake(result, forwardDeePathExtender, diagonal);
      return 2 * dee - 1;
  final int deltadDiagonal = diagonal + delta;
  backwardDeePathExtender.extendDeePath(media, dee, deltadDiagonal);
  if (checkBackwardOverlapping(delta, diagonal, dee)) {
    if (isForwardAndBackwardOverlapping(deltadDiagonal)) {
      setMiddleSnake(result, backwardDeePathExtender, deltadDiagonal);
      return 2 * dee;
return determineBestSnake(media, dee, delta);

代码示例来源：origin: org.jvnet.hudson.svnkit/svnkit

public QSequenceAlgorithm(QSequenceMedia media, QSequenceSnakeRegister snakeRegister, int maximumSearchDepth) {
  QSequenceAssert.assertTrue(maximumSearchDepth >= 2); // Because for dee == 1, there is a special treatment in produceSnakesInOrder.
  this.mainMedia = media;
  this.snakeRegister = snakeRegister;
  this.finder = new QSequenceMiddleSnakeFinder(media.getLeftLength(), media.getRightLength(), maximumSearchDepth);
}

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

QSequenceMiddleSnakeFinder

相关文章

    查看更多
    微信公众号

    热门标签

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

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com