Public

Constructs new comparator for two parts with lengths l1 and l2 respectively.

<init>

Compares two parts on inclusion. part1 includes part2 if (part1.resourceId ==
part2.resourceId) && (

compare

BufferedReader

Reading from database using SQL prepared statement

Provides access to system-related information and resources including standard
input and output. Ena

java.lang.System

Abstract class for representing access to a system resource. All permissions
have a name (whose inte

java.security.Permission

 GregorianCalendar is a concrete subclass of Calendarand provides the standard
calendar used by most

java.util.GregorianCalendar

An ExecutorService that executes each submitted task using one of possibly
several pooled threads, n

java.util.concurrent.ThreadPoolExecutor

Defines methods that all servlets must implement.A servlet is a small Java
program that runs within 

javax.servlet.Servlet

Used to perform Get operations on a single row. To get everything for a row,
instantiate a Get objec

org.apache.hadoop.hbase.client.Get

compareTo

requestLocationUpdates

onCreateOptionsMenu

/**
 * Checks that second CloneGroup includes first one.
 * 
 * CloneGroup A is included in another CloneGroup B, if every part pA from A has part pB in B,
 * which satisfy the conditions:
 * <pre>
 * (pA.resourceId == pB.resourceId) and (pB.unitStart <= pA.unitStart) and (pA.unitEnd <= pB.unitEnd)
 * </pre>
 * And all resourcesId from B exactly the same as all resourceId from A, which means that also every part pB from B has part pA in A,
 * which satisfy the condition:
 * <pre>
 * pB.resourceId == pA.resourceId
 * </pre>
 * Inclusion is the partial order, thus this relation is:
 * <ul>
 * <li>reflexive - A in A</li>
 * <li>transitive - (A in B) and (B in C) => (A in C)</li>
 * <li>antisymmetric - (A in B) and (B in A) <=> (A = B)</li>
 * </ul>
 * 
 * 
 * This method uses the fact that all parts already sorted by resourceId and unitStart (see {@link ContainsInComparator#CLONEPART_COMPARATOR}),
 * so running time - O(|A|+|B|).
 * 
 */

// TODO Godin: according to tests seems that if first part of condition is true, then second part can not be false

// if this can be proved, then second part can be removed

/**
 * Checks that second clone contains first one.
 * 
 * Clone A is contained in another clone B, if every part pA from A has part pB in B,
 * which satisfy the conditions:
 * <pre>
 * (pA.resourceId == pB.resourceId) and (pB.unitStart <= pA.unitStart) and (pA.unitEnd <= pB.unitEnd)
 * </pre>
 * And all resourcesId from B exactly the same as all resourceId from A, which means that also every part pB from B has part pA in A,
 * which satisfy the condition:
 * <pre>
 * pB.resourceId == pA.resourceId
 * </pre>
 * So this relation is:
 * <ul>
 * <li>reflexive - A in A</li>
 * <li>transitive - (A in B) and (B in C) => (A in C)</li>
 * <li>antisymmetric - (A in B) and (B in A) <=> (A = B)</li>
 * </ul>
 * 
 * 
 * Important: this method relies on fact that all parts were already sorted by resourceId and unitStart by using
 * {@link BlocksGroup.BlockComparator}, which uses {@link org.sonar.duplications.utils.FastStringComparator} for comparison by resourceId.
 * 
 * 
 * Running time - O(|A|+|B|).
 * 
 */

How to use org.sonar.duplications.detector.ContainsInComparatorconstructor

Best Java code snippets using org.sonar.duplications.detector.ContainsInComparator.<init> (Showing top 5 results out of 315)

How to use
org.sonar.duplications.detector.ContainsInComparator
constructor