de.regnis.q.sequence.QSequenceDifferenceBlock.getLeftSize()方法的使用及代码示例

x33g5p2x  于2022-01-28 转载在 其他  
字(4.8k)|赞(0)|评价(0)|浏览(62)

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

QSequenceDifferenceBlock.getLeftSize介绍

暂无

代码示例

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

private List transformLocalLines(List blocks, QSequenceLineCache localLines) throws IOException {
  final List transformedLocalLines = new ArrayList();
  final FSMergerBySequenceList blockList = new FSMergerBySequenceList(blocks);
  int localIndex = 0;
  int baseIndex = 0;
  for (;localIndex < localLines.getLineCount();) {
    final int baseTo;
    if (blockList.hasCurrent()) {
      final QSequenceDifferenceBlock block = blockList.current();
      baseTo = block.getLeftFrom() -1;
    }
    else {
      baseTo = Integer.MAX_VALUE;
    }
    while (localIndex < localLines.getLineCount() && baseIndex <= baseTo) {
      transformedLocalLines.add(localLines.getLine(localIndex));
      localIndex++;
      baseIndex++;
    }
    if (blockList.hasCurrent()) {
      for (int index = 0; index < blockList.current().getLeftSize(); index++) {
        transformedLocalLines.add(null);
      }
      baseIndex += blockList.current().getLeftSize();
      localIndex += blockList.current().getRightSize();
      blockList.forward();
    }
  }
  return transformedLocalLines;
}

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

private List transformLocalLines(List blocks, QSequenceLineCache localLines) throws IOException {
  final List transformedLocalLines = new ArrayList();
  final FSMergerBySequenceList blockList = new FSMergerBySequenceList(blocks);
  int localIndex = 0;
  int baseIndex = 0;
  for (;localIndex < localLines.getLineCount();) {
    final int baseTo;
    if (blockList.hasCurrent()) {
      final QSequenceDifferenceBlock block = blockList.current();
      baseTo = block.getLeftFrom() -1;
    }
    else {
      baseTo = Integer.MAX_VALUE;
    }
    while (localIndex < localLines.getLineCount() && baseIndex <= baseTo) {
      transformedLocalLines.add(localLines.getLine(localIndex));
      localIndex++;
      baseIndex++;
    }
    if (blockList.hasCurrent()) {
      for (int index = 0; index < blockList.current().getLeftSize(); index++) {
        transformedLocalLines.add(null);
      }
      baseIndex += blockList.current().getLeftSize();
      localIndex += blockList.current().getRightSize();
      blockList.forward();
    }
  }
  return transformedLocalLines;
}

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

private List transformLocalLines(List blocks, QSequenceLineCache localLines) throws IOException {
  final List transformedLocalLines = new ArrayList();
  final FSMergerBySequenceList blockList = new FSMergerBySequenceList(blocks);
  int localIndex = 0;
  int baseIndex = 0;
  for (;localIndex < localLines.getLineCount();) {
    final int baseTo;
    if (blockList.hasCurrent()) {
      final QSequenceDifferenceBlock block = blockList.current();
      baseTo = block.getLeftFrom() -1;
    }
    else {
      baseTo = Integer.MAX_VALUE;
    }
    while (localIndex < localLines.getLineCount() && baseIndex <= baseTo) {
      transformedLocalLines.add(localLines.getLine(localIndex));
      localIndex++;
      baseIndex++;
    }
    if (blockList.hasCurrent()) {
      for (int index = 0; index < blockList.current().getLeftSize(); index++) {
        transformedLocalLines.add(null);
      }
      baseIndex += blockList.current().getLeftSize();
      localIndex += blockList.current().getRightSize();
      blockList.forward();
    }
  }
  return transformedLocalLines;
}

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

private List transformLocalLines(List blocks, QSequenceLineCache localLines) throws IOException {
  final List transformedLocalLines = new ArrayList();
  final FSMergerBySequenceList blockList = new FSMergerBySequenceList(blocks);
  int localIndex = 0;
  int baseIndex = 0;
  for (;localIndex < localLines.getLineCount();) {
    final int baseTo;
    if (blockList.hasCurrent()) {
      final QSequenceDifferenceBlock block = blockList.current();
      baseTo = block.getLeftFrom() -1;
    }
    else {
      baseTo = Integer.MAX_VALUE;
    }
    while (localIndex < localLines.getLineCount() && baseIndex <= baseTo) {
      transformedLocalLines.add(localLines.getLine(localIndex));
      localIndex++;
      baseIndex++;
    }
    if (blockList.hasCurrent()) {
      for (int index = 0; index < blockList.current().getLeftSize(); index++) {
        transformedLocalLines.add(null);
      }
      baseIndex += blockList.current().getLeftSize();
      localIndex += blockList.current().getRightSize();
      blockList.forward();
    }
  }
  return transformedLocalLines;
}

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

for(int i = 0; i < blocksList.size(); i++) {
  QSequenceDifferenceBlock block = (QSequenceDifferenceBlock) blocksList.get(i);
  if (block.getLeftSize() > 0) {
    deleteBlameChunk(block.getRightFrom(), block.getLeftSize(), chain);

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

for(int i = 0; i < blocksList.size(); i++) {
  QSequenceDifferenceBlock block = (QSequenceDifferenceBlock) blocksList.get(i);
  if (block.getLeftSize() > 0) {
    deleteBlameChunk(block.getRightFrom(), block.getLeftSize(), chain);

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

for(int i = 0; i < blocksList.size(); i++) {
  QSequenceDifferenceBlock block = (QSequenceDifferenceBlock) blocksList.get(i);
  if (block.getLeftSize() > 0) {
    deleteBlameChunk(block.getRightFrom(), block.getLeftSize(), chain);

相关文章