Tabnine Logo
MergeBaseGenerator.add
Code IndexAdd Tabnine to your IDE (free)

How to use
add
method
in
org.eclipse.jgit.revwalk.MergeBaseGenerator

Best Java code snippets using org.eclipse.jgit.revwalk.MergeBaseGenerator.add (Showing top 4 results out of 315)

origin: org.eclipse.jgit/org.eclipse.jgit

void init(AbstractRevQueue p) throws IOException {
  try {
    for (;;) {
      final RevCommit c = p.next();
      if (c == null)
        break;
      add(c);
    }
    // Setup the condition used by carryOntoOne to detect a late
    // merge base and produce it on the next round.
    //
    recarryTest = branchMask | POPPED;
    recarryMask = branchMask | POPPED | MERGE_BASE;
    mergeBaseAncestor = walker.allocFlag();
    for (;;) {
      RevCommit c = _next();
      if (c == null) {
        break;
      }
      ret.add(c);
    }
  } finally {
    // Always free the flags immediately. This ensures the flags
    // will be available for reuse when the walk resets.
    //
    walker.freeFlag(branchMask | mergeBaseAncestor);
  }
}
origin: sonia.jgit/org.eclipse.jgit

void init(final AbstractRevQueue p) {
  try {
    for (;;) {
      final RevCommit c = p.next();
      if (c == null)
        break;
      add(c);
    }
  } finally {
    // Always free the flags immediately. This ensures the flags
    // will be available for reuse when the walk resets.
    //
    walker.freeFlag(branchMask);
    // Setup the condition used by carryOntoOne to detect a late
    // merge base and produce it on the next round.
    //
    recarryTest = branchMask | POPPED;
    recarryMask = branchMask | POPPED | MERGE_BASE;
  }
}
origin: theonedev/onedev

void init(AbstractRevQueue p) throws IOException {
  try {
    for (;;) {
      final RevCommit c = p.next();
      if (c == null)
        break;
      add(c);
    }
    // Setup the condition used by carryOntoOne to detect a late
    // merge base and produce it on the next round.
    //
    recarryTest = branchMask | POPPED;
    recarryMask = branchMask | POPPED | MERGE_BASE;
    mergeBaseAncestor = walker.allocFlag();
    for (;;) {
      RevCommit c = _next();
      if (c == null) {
        break;
      }
      ret.add(c);
    }
  } finally {
    // Always free the flags immediately. This ensures the flags
    // will be available for reuse when the walk resets.
    //
    walker.freeFlag(branchMask | mergeBaseAncestor);
  }
}
origin: berlam/github-bucket

void init(AbstractRevQueue p) throws IOException {
  try {
    for (;;) {
      final RevCommit c = p.next();
      if (c == null)
        break;
      add(c);
    }
    // Setup the condition used by carryOntoOne to detect a late
    // merge base and produce it on the next round.
    //
    recarryTest = branchMask | POPPED;
    recarryMask = branchMask | POPPED | MERGE_BASE;
    mergeBaseAncestor = walker.allocFlag();
    for (;;) {
      RevCommit c = _next();
      if (c == null) {
        break;
      }
      ret.add(c);
    }
  } finally {
    // Always free the flags immediately. This ensures the flags
    // will be available for reuse when the walk resets.
    //
    walker.freeFlag(branchMask | mergeBaseAncestor);
  }
}
org.eclipse.jgit.revwalkMergeBaseGeneratoradd

Popular methods of MergeBaseGenerator

  • <init>
  • carryOntoHistory
  • carryOntoOne
  • init
  • next
  • _next
  • carryOntoHistoryInnerLoop

Popular in Java

  • Updating database using SQL prepared statement
  • onRequestPermissionsResult (Fragment)
  • requestLocationUpdates (LocationManager)
  • setScale (BigDecimal)
  • PrintWriter (java.io)
    Wraps either an existing OutputStream or an existing Writerand provides convenience methods for prin
  • Thread (java.lang)
    A thread is a thread of execution in a program. The Java Virtual Machine allows an application to ha
  • ArrayList (java.util)
    ArrayList is an implementation of List, backed by an array. All optional operations including adding
  • Dictionary (java.util)
    Note: Do not use this class since it is obsolete. Please use the Map interface for new implementatio
  • UUID (java.util)
    UUID is an immutable representation of a 128-bit universally unique identifier (UUID). There are mul
  • BlockingQueue (java.util.concurrent)
    A java.util.Queue that additionally supports operations that wait for the queue to become non-empty
  • Top plugins for WebStorm
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now