LowLevelDiffAlgorithm.java

  1. /*
  2.  * Copyright (C) 2010, Google Inc.
  3.  * and other copyright owners as documented in the project's IP log.
  4.  *
  5.  * This program and the accompanying materials are made available
  6.  * under the terms of the Eclipse Distribution License v1.0 which
  7.  * accompanies this distribution, is reproduced below, and is
  8.  * available at http://www.eclipse.org/org/documents/edl-v10.php
  9.  *
  10.  * All rights reserved.
  11.  *
  12.  * Redistribution and use in source and binary forms, with or
  13.  * without modification, are permitted provided that the following
  14.  * conditions are met:
  15.  *
  16.  * - Redistributions of source code must retain the above copyright
  17.  *   notice, this list of conditions and the following disclaimer.
  18.  *
  19.  * - Redistributions in binary form must reproduce the above
  20.  *   copyright notice, this list of conditions and the following
  21.  *   disclaimer in the documentation and/or other materials provided
  22.  *   with the distribution.
  23.  *
  24.  * - Neither the name of the Eclipse Foundation, Inc. nor the
  25.  *   names of its contributors may be used to endorse or promote
  26.  *   products derived from this software without specific prior
  27.  *   written permission.
  28.  *
  29.  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  30.  * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  31.  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  32.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  33.  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  34.  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  35.  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  36.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  37.  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  38.  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  39.  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  40.  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  41.  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  42.  */

  43. package org.eclipse.jgit.diff;

  44. /**
  45.  * Compares two sequences primarily based upon hash codes.
  46.  */
  47. public abstract class LowLevelDiffAlgorithm extends DiffAlgorithm {
  48.     /** {@inheritDoc} */
  49.     @Override
  50.     public <S extends Sequence> EditList diffNonCommon(
  51.             SequenceComparator<? super S> cmp, S a, S b) {
  52.         HashedSequencePair<S> p = new HashedSequencePair<>(cmp, a, b);
  53.         HashedSequenceComparator<S> hc = p.getComparator();
  54.         HashedSequence<S> ha = p.getA();
  55.         HashedSequence<S> hb = p.getB();
  56.         p = null;

  57.         EditList res = new EditList();
  58.         Edit region = new Edit(0, a.size(), 0, b.size());
  59.         diffNonCommon(res, hc, ha, hb, region);
  60.         return res;
  61.     }

  62.     /**
  63.      * Compare two sequences and identify a list of edits between them.
  64.      *
  65.      * This method should be invoked only after the two sequences have been
  66.      * proven to have no common starting or ending elements. The expected
  67.      * elimination of common starting and ending elements is automatically
  68.      * performed by the {@link #diff(SequenceComparator, Sequence, Sequence)}
  69.      * method, which invokes this method using
  70.      * {@link org.eclipse.jgit.diff.Subsequence}s.
  71.      *
  72.      * @param edits
  73.      *            result list to append the region's edits onto.
  74.      * @param cmp
  75.      *            the comparator supplying the element equivalence function.
  76.      * @param a
  77.      *            the first (also known as old or pre-image) sequence. Edits
  78.      *            returned by this algorithm will reference indexes using the
  79.      *            'A' side: {@link org.eclipse.jgit.diff.Edit#getBeginA()},
  80.      *            {@link org.eclipse.jgit.diff.Edit#getEndA()}.
  81.      * @param b
  82.      *            the second (also known as new or post-image) sequence. Edits
  83.      *            returned by this algorithm will reference indexes using the
  84.      *            'B' side: {@link org.eclipse.jgit.diff.Edit#getBeginB()},
  85.      *            {@link org.eclipse.jgit.diff.Edit#getEndB()}.
  86.      * @param region
  87.      *            the region being compared within the two sequences.
  88.      */
  89.     public abstract <S extends Sequence> void diffNonCommon(EditList edits,
  90.             HashedSequenceComparator<S> cmp, HashedSequence<S> a,
  91.             HashedSequence<S> b, Edit region);
  92. }