Merge pull request #112 from liblit/warning-fixes-html-validation

Eliminate all Eclipse HTML validation warnings
This commit is contained in:
Manu Sridharan 2016-11-28 21:37:46 -08:00 committed by GitHub
commit 1e5dcf46f7
110 changed files with 386 additions and 123 deletions

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude11804file131examples-src/pages/garbage.htmlT0304file132examples-src/pages/garbage2.htmlT0304file139target/site/dependency-convergence.htmlT0304file136examples-src/ajaxslt/test/xpath.htmlT0304file139examples-src/ajaxslt/xslt_unittest.htmlT0304file135examples-src/ajaxslt/test/xslt.htmlT0304file129examples-src/pages/page4.htmlT0304file128examples-src/pages/list.htmlT0304file129examples-src/pages/page1.htmlT0304file129examples-src/pages/page2.htmlT0304file133examples-src/pages/prototype.htmlT0304file133examples-src/pages/prototype.htmlT0304file132examples-src/pages/skeleton.htmlT0304file133examples-src/pages/skeleton2.htmlT0304file133examples-src/pages/skeleton3.htmlT0304file136examples-src/pages/windowonload.htmlT0304file131examples-src/pages/windowx.htmlT0304file145examples-src/tests/portal-example-simple.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0304file141ocaml/ocamljava-2.0-alpha1/doc/concurrentT0204file137ocaml/ocamljava-2.0-alpha1/doc/manualT0204file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -5,7 +5,7 @@ package arraybounds;
* All array accesses in the following class are unnecessary and they will be
* detected correctly by the array bounds analysis.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class Detectable {
@ -77,7 +77,7 @@ public class Detectable {
}
/**
* swaps elements of a and b for all i: 0 <= i < min(a.length, b.length)
* swaps elements of a and b for all i: 0 &lt;= i &lt; min(a.length, b.length)
*
* @param a
* @param b
@ -100,7 +100,7 @@ public class Detectable {
}
/**
* Invert the order of all elements of arr with index i: fromIndex <= i <
* Invert the order of all elements of arr with index i: fromIndex &lt;= i <
* toIndex.
*
* @param arr

View File

@ -5,7 +5,7 @@ package arraybounds;
* All array accesses in the following class are unnecessary but they will not
* be detected correctly by the array bounds analysis.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class NotDetectable {

View File

@ -5,7 +5,7 @@ package arraybounds;
* All array accesses in the following class are necessary and they will be
* detected correctly by the array bounds analysis.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class NotInBound {

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -41,7 +41,7 @@ import com.ibm.wala.util.config.AnalysisScopeReader;
*
* So there is no explicit check for specific lines.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ArrayboundsAnalysisTest {

View File

@ -54,7 +54,7 @@ import com.ibm.wala.util.config.AnalysisScopeReader;
* For an example how to use the exception pruning see
* {@link PruneArrayOutOfBoundExceptionEdge#computeCfgAndPrunedCFG(IMethod)}
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class PruneArrayOutOfBoundExceptionEdge {

View File

@ -50,7 +50,7 @@ import com.ibm.wala.util.ref.ReferenceCleanser;
* exceptional instructions should be deleted) and that no new edges are
* inserted.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ExceptionAnalysis2EdgeFilterTest {

View File

@ -45,7 +45,7 @@ import com.ibm.wala.util.ref.ReferenceCleanser;
* interprocedural is right. As well as the number of caught exceptions for each
* call site.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ExceptionAnalysisTest {

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -53,7 +53,7 @@ import com.ibm.wala.util.collections.Pair;
* "ABCD: eliminating array bounds checks on demand." ACM SIGPLAN Notices. Vol.
* 35. No. 5. ACM, 2000.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public class ArrayBoundsGraph extends DirectedHyperGraph<Integer> {
/**

View File

@ -27,7 +27,7 @@ import com.ibm.wala.ssa.SSAPiInstruction;
/**
* @see ArrayBoundsGraph
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public class ArrayBoundsGraphBuilder {
private final IR ir;

View File

@ -22,7 +22,7 @@ import com.ibm.wala.util.ssa.InstructionByIIndexMap;
* "ABCD: eliminating array bounds checks on demand." ACM SIGPLAN Notices. Vol.
* 35. No. 5. ACM, 2000.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ArrayOutOfBoundsAnalysis {

View File

@ -9,7 +9,7 @@ import com.ibm.wala.ssa.SSABinaryOpInstruction;
* Normalizes a binary operation with a constant by providing direct access to
* assigned = other op constant.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class BinaryOpWithConstant {

View File

@ -7,7 +7,7 @@ import com.ibm.wala.ssa.SSAConditionalBranchInstruction;
* ConditionNormalizer normalizes a branch condition. See Constructor for more
* information.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ConditionNormalizer {

View File

@ -10,7 +10,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.edgeweights.EdgeWeigh
/**
* A DirectedHyperEdge is an edge of a {@link DirectedHyperGraph}.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <T>
* Type used in HyperNodes (HyperNode<T>)

View File

@ -13,7 +13,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight;
* Implementation of a directed hyper graph. In a hyper graph an edge can have
* more than one head and more than one tail.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <T>
*/

View File

@ -10,7 +10,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight;
/**
* A HyperNode is a node of a {@link DirectedHyperGraph}.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <T>
*/

View File

@ -13,7 +13,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.edgeweights.EdgeWeigh
/**
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <T>
* NodeValueType
@ -81,7 +81,7 @@ public class ShortestPath<T> {
/**
* @param weight
* @param otherWeight
* @return weight > otherWeight
* @return weight &gt; otherWeight
*/
private boolean greaterThen(Weight weight, Weight otherWeight) {
return otherWeight.getType() == Type.NOT_SET || this.comparator.compare(weight, otherWeight) > 0;
@ -90,7 +90,7 @@ public class ShortestPath<T> {
/**
* @param weight
* @param otherWeight
* @return weight < otherWeight
* @return weight &lt; otherWeight
*/
private boolean lessThen(Weight weight, Weight otherWeight) {
return otherWeight.getType() == Type.NOT_SET || this.comparator.compare(weight, otherWeight) < 0;

View File

@ -9,7 +9,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight.Type;
* Defines a normal Order on Weight: unlimited < ... < -1 < 0 < 1 < ... not_set
* is not comparable
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class NormalOrder implements Comparator<Weight> {

View File

@ -10,7 +10,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight.Type;
* Defines a reverse Order on Weight: ... > 1 > 0 > -1 > ... > unlimited not_set
* is not comparable
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ReverseOrder implements Comparator<Weight> {

View File

@ -9,7 +9,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight;
* unlimited is given by the chosen order (see {@link NormalOrder} and
* {@link ReverseOrder}).
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public class Weight {
public enum Type {

View File

@ -7,7 +7,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.edgeweights.EdgeWeigh
/**
* EdgeWeight that adds a specific value.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class AdditiveEdgeWeight implements EdgeWeight {

View File

@ -6,7 +6,7 @@ import com.ibm.wala.analysis.arraybounds.hypergraph.weight.Weight;
* The weight of an edge can produce a new value for the tail nodes given the
* head nodes.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public interface EdgeWeight {
public Weight newValue(Weight weight);

View File

@ -27,7 +27,7 @@ import com.ibm.wala.types.TypeReference;
/**
* Wrapper to store multiple intraprocedural analysis for a call graph.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class CGIntraproceduralExceptionAnalysis {

View File

@ -52,7 +52,7 @@ import com.ibm.wala.util.graph.impl.InvertedGraph;
*
* Notice: Only exceptions, which are part of the analysis scope are considered.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ExceptionAnalysis {

View File

@ -18,7 +18,7 @@ import com.ibm.wala.ssa.SSAInstruction;
/**
* Converter to use the results of the exception analysis with an edge filter.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ExceptionAnalysis2EdgeFilter implements EdgeFilter<ISSABasicBlock> {

View File

@ -18,7 +18,7 @@ import com.ibm.wala.util.MonitorUtil.IProgressMonitor;
* This class is basically a copy of {@link IntraprocNullPointerAnalysis}, but
* does only provide the result of the analysis instead of a pruned CFG.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class IntraproceduralNullPointerAnalysis {

View File

@ -29,7 +29,7 @@ import com.ibm.wala.ssa.SSAUnaryOpInstruction;
/**
* Helper class to find the variable that may be null.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class RelevantVariableFinder implements IVisitor {

View File

@ -55,7 +55,7 @@ public class ControlDependenceGraph<T> extends AbstractNumberedGraph<T> {
* This is the heart of the CDG computation. Based on Cytron et al., this is the reverse dominance frontier based algorithm for
* computing control dependence edges.
*
* @return Map: node n -> {x : n is control-dependent on x}
* @return Map: node n -&gt; {x : n is control-dependent on x}
*/
private Map<T, Set<T>> buildControlDependence(boolean wantEdgeLabels) {
Map<T, Set<T>> controlDependence = HashMapFactory.make(cfg.getNumberOfNodes());

View File

@ -242,7 +242,7 @@ public class CodeScanner {
}
/**
* @return Set <TypeReference>
* @return {@link Set}&lt;{@link TypeReference}&gt;
* @throws IllegalArgumentException if statements == null
*/
public static Set<TypeReference> getCaughtExceptions(final Language l, SSAInstruction[] statements) throws IllegalArgumentException {

View File

@ -541,7 +541,7 @@ public class JavaLanguage extends LanguageImpl implements BytecodeLanguage, Cons
}
/**
* @return Collection<TypeReference>, set of exception types a call to a declared target might throw.
* @return {@link Collection}&lt;{@link TypeReference}&gt;, set of exception types a call to a declared target might throw.
* @throws InvalidClassFileException
* @throws IllegalArgumentException if target is null
* @throws IllegalArgumentException if cha is null

View File

@ -192,7 +192,7 @@ public abstract class ShrikeBTMethod implements IMethod, BytecodeConstants {
}
/**
* @return Set <TypeReference>, the exceptions that statements in this method may throw,
* @return {@link Set}&lt;{@link TypeReference}&gt;, the exceptions that statements in this method may throw,
* @throws InvalidClassFileException
*/
public Collection<TypeReference> getImplicitExceptionTypes() throws InvalidClassFileException {
@ -804,7 +804,7 @@ public abstract class ShrikeBTMethod implements IMethod, BytecodeConstants {
}
/**
* @return Set <TypeReference>
* @return {@link Set}&lt;{@link TypeReference}&gt;
* @throws InvalidClassFileException
*/
public Set<TypeReference> getCaughtExceptionTypes() throws InvalidClassFileException {

View File

@ -78,7 +78,7 @@ public class CallFlowEdges {
/**
* @param c
* @param d2
* @return set of d1 s.t. <c, d1> -> <s_p, d2> was recorded as call flow, or null if none found.
* @return set of d1 s.t. {@literal <c, d1> -> <s_p, d2>} was recorded as call flow, or null if none found.
*/
public IntSet getCallFlowSources(int c, int d2) {
if (c < 0) {
@ -119,7 +119,7 @@ public class CallFlowEdges {
/**
*
* @param d2
* @return set of c s.t. <c, d1> -> <s_p, d2> was recorded as call flow (for some d1), or null if none found.
* @return set of c s.t. {@literal <c, d1> -> <s_p, d2>} was recorded as call flow (for some d1), or null if none found.
*/
public IntSet getCallFlowSourceNodes(int d2) {
IntSet s = identityEdges.get(d2);

View File

@ -25,7 +25,7 @@ public interface IBinaryReturnFlowFunction extends IFlowFunction {
/**
* @param call_d factoid of the caller at the call site
* @param exit_d factoid of the callee at the exit site
* @return set of ret_d such that (<call_d, exit_d>, ret_d) is an edge in this distributive function's graph representation, or
* @return set of ret_d such that ({@literal <call_d, exit_d>}, ret_d) is an edge in this distributive function's graph representation, or
* null if there are none
*/
public SparseIntSet getTargets(int call_d, int exit_d);

View File

@ -20,7 +20,7 @@ public interface IFlowFunctionMap<T> {
/**
* @param src
* @param dest
* @return the flow function for a "normal" edge in the supergraph from src->dest
* @return the flow function for a "normal" edge in the supergraph from src -&gt; dest
*/
public IUnaryFlowFunction getNormalFlowFunction(T src, T dest);
@ -29,7 +29,7 @@ public interface IFlowFunctionMap<T> {
* @param dest the entry of the callee
* @param ret the block that will be returned to, in the caller. This can be null .. signifying that facts can flow
* into the callee but not return
* @return the flow function for a "call" edge in the supergraph from src->dest
* @return the flow function for a "call" edge in the supergraph from src -&gt; dest
*/
public IUnaryFlowFunction getCallFlowFunction(T src, T dest, T ret);
@ -37,22 +37,22 @@ public interface IFlowFunctionMap<T> {
* @param call supergraph node of the call instruction for this return edge.
* @param src
* @param dest
* @return the flow function for a "return" edge in the supergraph from src->dest
* @return the flow function for a "return" edge in the supergraph from src -&gt; dest
*/
public IFlowFunction getReturnFlowFunction(T call, T src, T dest);
/**
* @param src
* @param dest
* @return the flow function for a "call-to-return" edge in the supergraph from src->dest
* @return the flow function for a "call-to-return" edge in the supergraph from src -&gt; dest
*/
public IUnaryFlowFunction getCallToReturnFlowFunction(T src, T dest);
/**
* @param src
* @param dest
* @return the flow function for a "call-to-return" edge in the supergraph from src->dest, when the supergraph does
* not contain any callees of src. This happens via, e.g., slicing.
* @return the flow function for a "call-to-return" edge in the supergraph from src -&gt; dest,
* when the supergraph does not contain any callees of src. This happens via, e.g., slicing.
*/
public IUnaryFlowFunction getCallNoneToReturnFlowFunction(T src, T dest);
}

View File

@ -21,7 +21,7 @@ public interface IPartiallyBalancedFlowFunctions<T> extends IFlowFunctionMap<T>
*
* @param src
* @param dest
* @return the flow function for a "return" edge in the supergraph from src->dest
* @return the flow function for a "return" edge in the supergraph from src -&lt; dest
*/
public IFlowFunction getUnbalancedReturnFlowFunction(T src, T dest);

View File

@ -199,7 +199,7 @@ public class LocalPathEdges {
*
* @param n local block number of a basic block n
* @param d2
* @return the sparse int set of d1 s.t. <s_p, d1> -> <n, d2> are recorded as path edges. null if none found
* @return the sparse int set of d1 s.t. {@literal <s_p, d1> -> <n, d2>} are recorded as path edges. null if none found
*/
public IntSet getInverse(int n, int d2) {
IBinaryNaturalRelation R = paths.get(d2);
@ -276,7 +276,7 @@ public class LocalPathEdges {
* @param i
* @param n local block number of a basic block n
* @param j
* @return true iff we have a path edge <s_p,i>-><n, j>
* @return true iff we have a path edge {@literal <s_p,i> -> <n, j>}
*/
public boolean contains(int i, int n, int j) {
@ -311,7 +311,7 @@ public class LocalPathEdges {
/**
*
* @param n
* @return set of d2 s.t. d1->d2 is a path edge for node n.
* @return set of d2 s.t. d1 -&gt; d2 is a path edge for node n.
*/
public IntSet getReachable(int n, int d1) {
if (PARANOID) {
@ -323,7 +323,7 @@ public class LocalPathEdges {
/**
* Note that this is really slow!!!
*
* @return set of d2 s.t. d1->d2 is a path edge for node n
* @return set of d2 s.t. d1 -&gt; d2 is a path edge for node n
*/
private IntSet getReachableSlow(int n, int d1) {
MutableSparseIntSet result = MutableSparseIntSet.makeEmpty();
@ -363,7 +363,7 @@ public class LocalPathEdges {
}
/**
* @return set of d2 s.t. d1->d2 is a path edge for node n
* @return set of d2 s.t. d1 -&gt; d2 is a path edge for node n
*/
private IntSet getReachableFast(int n, int d1) {
@ -378,7 +378,7 @@ public class LocalPathEdges {
* TODO: optimize this based on altPaths
*
* @param n the local block number of a node
* @return set of d2 s.t \exists d1 s.t. d1->d2 is a path edge for node n
* @return set of d2 s.t \exists d1 s.t. d1 -&gt; d2 is a path edge for node n
*/
public IntSet getReachable(int n) {
MutableSparseIntSet result = MutableSparseIntSet.makeEmpty();

View File

@ -106,7 +106,7 @@ public class LocalSummaryEdges {
* @param s_p local block number an entry
* @param x local block number of an exit block
* @param d1 source dataflow fact
* @return set of d2 s.t. d1->d2 recorded as a summary edge for (s_p,x), or null if none
* @return set of d2 s.t. d1 -&gt; d2 recorded as a summary edge for (s_p,x), or null if none
*/
public IntSet getSummaryEdges(int s_p, int x, int d1) {
int n = getIndexForEntryExitPair(s_p, x);
@ -124,7 +124,7 @@ public class LocalSummaryEdges {
* @param s_p local block number an entry
* @param x local block number of an exit block
* @param d2 target dataflow fact
* @return set of d1 s.t. d1->d2 recorded as a summary edge for (s_p,x), or null if none
* @return set of d1 s.t. d1 -&gt; d2 recorded as a summary edge for (s_p,x), or null if none
*/
public IntSet getInvertedSummaryEdgesForTarget(int s_p, int x, int d2) {
int n = getIndexForEntryExitPair(s_p, x);

View File

@ -45,7 +45,7 @@ public interface TabulationResult<T, P, F> {
* @param n1
* @param d1
* @param n2
* @return set of d2 s.t. (n1,d1) -> (n2,d2) is recorded as a summary edge, or null if none found
* @return set of d2 s.t. (n1,d1) -&gt; (n2,d2) is recorded as a summary edge, or null if none found
*/
public IntSet getSummaryTargets(T n1, int d1, T n2);

View File

@ -392,12 +392,12 @@ public class TabulationSolver<T, P, F> {
/**
* Propagate information for an "exit" edge to the appropriate return sites
*
* [23] for each d5 s.t. <s_p,d2> -> <returnSite(c),d5> ..
* [23] for each d5 s.t. {@literal <s_p,d2> -> <returnSite(c),d5>} ..
*
* @param edge the edge being processed
* @param succ numbers of the nodes that are successors of edge.n (the return block in the callee) in the call graph.
* @param c a call site of edge.s_p
* @param D4 set of d1 s.t. <c, d1> -> <edge.s_p, edge.d2> was recorded as call flow
* @param D4 set of d1 s.t. {@literal <c, d1> -> <edge.s_p, edge.d2>} was recorded as call flow
*/
private void propagateToReturnSites(final PathEdge<T> edge, final T c, final IntSet D4) {
P proc = supergraph.getProcOf(c);
@ -447,11 +447,11 @@ public class TabulationSolver<T, P, F> {
/**
* Propagate information for an "exit" edge to a caller return site
*
* [23] for each d5 s.t. <s_p,d2> -> <returnSite(c),d5> ..
* [23] for each d5 s.t. {@literal <s_p,d2> -> <returnSite(c),d5>} ..
*
* @param edge the edge being processed
* @param c a call site of edge.s_p
* @param D4 set of d1 s.t. <c, d1> -> <edge.s_p, edge.d2> was recorded as call flow
* @param D4 set of d1 s.t. {@literal <c, d1> -> <edge.s_p, edge.d2>} was recorded as call flow
* @param entries the blocks in the supergraph that are entries for the procedure of c
* @param retSite the return site being propagated to
* @param retf the flow function
@ -474,8 +474,9 @@ public class TabulationSolver<T, P, F> {
* @param c the corresponding call site
* @param entries entry nodes in the caller
* @param retSite the return site
* @param d4 a fact s.t. <c, d4> -> <callee, d2> was recorded as call flow and <callee, d2> is the source of the summary edge
* being applied
* @param d4 a fact s.t. {@literal <c, d4> -> <callee, d2>} was
* recorded as call flow and {@literal <callee, d2>} is the
* source of the summary edge being applied
* @param D5 facts to propagate to return site
* @param edge the path edge ending at the exit site of the callee
*/
@ -522,7 +523,7 @@ public class TabulationSolver<T, P, F> {
* @param s_p
* @param n
* @param d2 note that s_p must be an entry for procof(n)
* @return set of d1 s.t. <s_p, d1> -> <n, d2> is a path edge, or null if none found
* @return set of d1 s.t. {@literal <s_p, d1> -> <n, d2>} is a path edge, or null if none found
*/
protected IntSet getInversePathEdges(T s_p, T n, int d2) {
int number = supergraph.getLocalBlockNumber(n);
@ -1000,7 +1001,7 @@ public class TabulationSolver<T, P, F> {
* @param n1
* @param d1
* @param n2
* @return set of d2 s.t. (n1,d1) -> (n2,d2) is recorded as a summary edge, or null if none found
* @return set of d2 s.t. (n1,d1) -&gt; (n2,d2) is recorded as a summary edge, or null if none found
*/
@Override
public IntSet getSummaryTargets(T n1, int d1, T n2) {
@ -1040,7 +1041,7 @@ public class TabulationSolver<T, P, F> {
}
/**
* @return set of d1 s.t. (n1,d1) -> (n2,d2) is recorded as a summary edge, or null if none found
* @return set of d1 s.t. (n1,d1) -&gt; (n2,d2) is recorded as a summary edge, or null if none found
* @throws UnsupportedOperationException unconditionally
*/
public IntSet getSummarySources(T n2, int d2, T n1) throws UnsupportedOperationException {

View File

@ -118,8 +118,9 @@ public abstract class AbstractFlowGraph extends SlowSparseNumberedLabeledGraph<O
protected final Map<PointerKey, SSAAbstractInvokeInstruction> callDefs = HashMapFactory.make();
/**
* Map: {@link LocalPointerKey} -> Set<{@link SSAInvokeInstruction}>. If we have (x, foo()), that means x was passed as a
* parameter to the call to foo(). The parameter position is not represented and must be recovered.
* Map: {@link LocalPointerKey} -&gt; {@link Set}&lt;{@link SSAInvokeInstruction}&gt;.
* If we have (x, foo()), that means x was passed as a parameter to the call to foo().
* The parameter position is not represented and must be recovered.
*/
protected final Map<PointerKey, Set<SSAAbstractInvokeInstruction>> callParams = HashMapFactory.make();
@ -130,7 +131,7 @@ public abstract class AbstractFlowGraph extends SlowSparseNumberedLabeledGraph<O
protected final Map<PointerKey, CGNode> params = HashMapFactory.make();
/**
* Map: {@link LocalPointerKey} -> {@link CGNode}. If we have (x, foo), then x is a return value of method foo. Must re-discover
* Map: {@link LocalPointerKey} -&gt; {@link CGNode}. If we have (x, foo), then x is a return value of method foo. Must re-discover
* if x is normal or exceptional return value.
*/
protected final Map<PointerKey, CGNode> returns = HashMapFactory.make();

View File

@ -19,12 +19,12 @@ import com.ibm.wala.ipa.callgraph.propagation.PointerKey;
public interface MemoryAccessMap {
/**
* @return Collection<FieldAccess>
* @return {@link Collection}&lt;{@link FieldAccess}&gt;
*/
public Collection<MemoryAccess> getFieldReads(PointerKey baseRef, IField field);
/**
* @return Collection<FieldAccess>
* @return {@link Collection}&lt;{@link FieldAccess}&gt;
*/
public Collection<MemoryAccess> getFieldWrites(PointerKey baseRef, IField field);

View File

@ -34,7 +34,7 @@ public abstract class AbstractPointerAnalysis implements PointerAnalysis<Instanc
private final CallGraph cg;
/**
* bijection from InstanceKey <=>Integer
* bijection from InstanceKey &lt;=&gt; Integer
*/
protected final MutableMapping<InstanceKey> instanceKeys;

View File

@ -40,7 +40,7 @@ public interface PointerAnalysis<T extends InstanceKey> {
HeapGraph<T> getHeapGraph();
/**
* @return the bijection between InstanceKey <=> Integer that defines the
* @return the bijection between InstanceKey &lt;=&gt; Integer that defines the
* interpretation of points-to-sets.
*/
OrdinalSetMapping<T> getInstanceKeyMapping();

View File

@ -198,7 +198,7 @@ public class PointsToMap {
}
/**
* @return Iterator<PointerKey>
* @return {@link Iterator}&lt;{@link PointerKey}&gt;
*/
public Iterator<PointerKey> getTransitiveRoots() {
return new FilterIterator<PointerKey>(iterateKeys(), new Predicate() {

View File

@ -77,7 +77,7 @@ public class PropagationSystem extends DefaultFixedPointSolver<PointsToSetVariab
private final PropagationGraph flowGraph = new PropagationGraph();
/**
* bijection from InstanceKey <=>Integer
* bijection from InstanceKey &lt;=&gt; Integer
*/
protected final MutableMapping<InstanceKey> instanceKeys = MutableMapping.make();

View File

@ -228,7 +228,7 @@ public class ZeroXInstanceKeys implements InstanceKeyFactory {
}
/**
* @return Map: IClass -> Integer, the number of allocation sites for each type.
* @return Map: IClass -&gt; Integer, the number of allocation sites for each type.
*/
private Map<IClass, Integer> countAllocsByType(CGNode node) {
Map<IClass, Integer> count = HashMapFactory.make();

View File

@ -7,7 +7,7 @@ import java.util.Collection;
* combination with {@link ExceptionFilter2EdgeFilter}. For more Details see
* package-info.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <Instruction>
*/

View File

@ -14,7 +14,7 @@ import com.ibm.wala.types.TypeReference;
/**
* This class converts an exception filter to an edge filter.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
* @param <Block>
*/

View File

@ -12,7 +12,7 @@ import com.ibm.wala.types.TypeReference;
* Helper class to check if an exception is part of a set of filtered
* exceptions.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ExceptionMatcher {

View File

@ -6,7 +6,7 @@ import com.ibm.wala.types.TypeReference;
* FilteredException represents either a single exception or an exception and
* all its subclasses.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class FilteredException {

View File

@ -15,7 +15,7 @@ import com.ibm.wala.types.TypeReference;
* Adapter for using {@link ArrayOutOfBoundsAnalysis}. This filter is filtering
* ArrayOutOfBoundException, which can not occur.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class ArrayOutOfBoundFilter implements ExceptionFilter<SSAInstruction> {

View File

@ -9,7 +9,7 @@ import com.ibm.wala.ipa.cfg.exceptionpruning.FilteredException;
/**
* Use this class to combine multiple {@link ExceptionFilter}
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public class CombinedExceptionFilter<Instruction> implements ExceptionFilter<Instruction> {
private final Collection<ExceptionFilter<Instruction>> exceptionFilter;

View File

@ -11,7 +11,7 @@ import com.ibm.wala.types.TypeReference;
/**
* For filtering specific exceptions.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class IgnoreExceptionsFilter implements ExceptionFilter<SSAInstruction> {

View File

@ -16,7 +16,7 @@ import com.ibm.wala.types.TypeReference;
* Adapter for {@link IntraproceduralNullPointerAnalysis}. This filter is filtering
* NullPointerException, which can not occur.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
public class NullPointerExceptionFilter implements

View File

@ -1,7 +1,7 @@
/**
* All available filters should be contained in this package.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
package com.ibm.wala.ipa.cfg.exceptionpruning.filter;

View File

@ -9,7 +9,7 @@
* This package contains classes for this job and also adapter for some
* analysis.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*
*/
package com.ibm.wala.ipa.cfg.exceptionpruning;

View File

@ -70,7 +70,7 @@ public class SyntheticIR extends IR {
/**
* Set up the symbol table according to statements in the IR
*
* @param constants Map: value number (Integer) -> ConstantValue
* @param constants Map: value number (Integer) -&gt; ConstantValue
*/
private static SymbolTable makeSymbolTable(IMethod method, SSAInstruction[] instructions, Map<Integer, ConstantValue> constants,
AbstractCFG cfg) {

View File

@ -212,7 +212,7 @@ public class XMLMethodSummaryReader implements BytecodeConstants {
}
/**
* @return Method summaries collected for methods. Mapping Object -> MethodSummary where Object is either a
* @return Method summaries collected for methods. Mapping Object -&gt; MethodSummary where Object is either a
* <ul>
* <li>MethodReference
* <li>TypeReference

View File

@ -20,7 +20,7 @@ import com.ibm.wala.util.collections.Pair;
* A policy, that adds pi nodes for all variables, that are used in a branch
* instruction.
*
* @author Stephan Gocht <stephan@gobro.de>
* @author Stephan Gocht {@code <stephan@gobro.de>}
*/
public class AllIntegerDueToBranchePiPolicy implements SSAPiNodePolicy {

View File

@ -85,7 +85,7 @@ public final class Atom implements Serializable {
/**
* create an Atom from utf8[off] of length len
*
* @throws IllegalArgumentException if utf8.length <= off
* @throws IllegalArgumentException if utf8.length &lt;= off
*/
public static Atom findOrCreate(byte utf8[], int off, int len) throws IllegalArgumentException, IllegalArgumentException,
IllegalArgumentException {

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0204file139target/site/dependency-convergence.htmlT0304file119target/work/pluginsT02
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude11004file139target/site/dependency-convergence.htmlT0304file119target/work/pluginsT0204file176target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/list.htmlT0304file177target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/page1.htmlT0304file177target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/page2.htmlT0304file177target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/page1.htmlT0304file177target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/page2.htmlT0304file177target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/page4.htmlT0304file179target/work/data/com.ibm.wala.cast.js.test.data/examples-src/pages/windowx.htmlT0304file193target/work/data/com.ibm.wala.cast.js.test.data/examples-src/tests/portal-example-simple.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -45,7 +45,7 @@ public class AnnotationsReader extends AttributeReader {
}
/**
* @return total length of this attribute in bytes, <bf>including</bf> the
* @return total length of this attribute in bytes, <b>including</b> the
* first 6 bytes
* @throws InvalidClassFileException
*/

View File

@ -0,0 +1,9 @@
DELEGATES_PREFERENCE=delegateValidatorList
USER_BUILD_PREFERENCE=enabledBuildValidatorList
USER_MANUAL_PREFERENCE=enabledManualValidatorList
USER_PREFERENCE=overrideGlobalPreferencestruedisableAllValidationfalseversion1.2.700.v201610061600
eclipse.preferences.version=1
override=true
suspend=false
vals/org.eclipse.wst.html.core.HTMLValidator/groups=0107include06111contentType136org.eclipse.wst.html.core.htmlsourceT07fileext04htmlF07fileext05xhtmlF07fileext03htmF07fileext04htplF07fileext03wmlF0107exclude0104file139target/site/dependency-convergence.htmlT03
vf.version=3

View File

@ -25,7 +25,7 @@ import com.ibm.wala.fixpoint.UnaryOperator;
public interface ITransferFunctionProvider<T, V extends IVariable> {
/**
* @return the transfer function from IN_node -> OUT_node
* @return the transfer function from IN_node -&gt; OUT_node
*/
public UnaryOperator<V> getNodeTransferFunction(T node);
@ -35,7 +35,7 @@ public interface ITransferFunctionProvider<T, V extends IVariable> {
public boolean hasNodeTransferFunctions();
/**
* @return the transfer function from OUT_src -> EDGE_<src,dst>
* @return the transfer function from OUT_src -&gt; EDGE_&lt;src,dst&gt;
*/
public UnaryOperator<V> getEdgeTransferFunction(T src, T dst);

View File

@ -44,10 +44,10 @@ public interface IFixedPointStatement<T extends IVariable> extends INodeWithNumb
* Evaluate this statement, setting a new value for the left-hand side. The
* return value is one of the following:
* <ul>
* {@link FixedPointConstants#CHANGED},
* {@link FixedPointConstants#CHANGED_AND_FIXED},
* {@link FixedPointConstants#NOT_CHANGED}or
* {@link FixedPointConstants#NOT_CHANGED_AND_FIXED}.
* <li>{@link FixedPointConstants#CHANGED},</li>
* <li>{@link FixedPointConstants#CHANGED_AND_FIXED},</li>
* <li>{@link FixedPointConstants#NOT_CHANGED}, or</li>
* <li>{@link FixedPointConstants#NOT_CHANGED_AND_FIXED}.</li>
* </ul>
*/
abstract byte evaluate();

View File

@ -31,14 +31,14 @@ public interface IFixedPointSystem<T extends IVariable> {
/**
* Return an Iterator of the {@link IFixedPointStatement}s in this system
*
* @return Iterator <Constraint>
* @return {@link Iterator}&lt;Constraint&gt;
*/
public Iterator getStatements();
/**
* Return an Iterator of the variables in this graph
*
* @return Iterator <IVariable>
* @return {@link Iterator}&lt;{@link IVariable}&gt;
*/
public Iterator getVariables();
@ -53,12 +53,12 @@ public interface IFixedPointSystem<T extends IVariable> {
boolean containsVariable(T v);
/**
* @return Iterator <statement>, the statements that use the variable
* @return {@link Iterator}&lt;statement&gt;, the statements that use the variable
*/
Iterator getStatementsThatUse(T v);
/**
* @return Iterator <statement>, the statements that def the variable
* @return {@link Iterator}&lt;statement&gt;, the statements that def the variable
*/
Iterator getStatementsThatDef(T v);

View File

@ -18,7 +18,7 @@ import java.util.NoSuchElementException;
public abstract class Heap<T> {
/**
* @return true iff elt1 is considered < elt2
* @return true iff elt1 is considered &lt; elt2
*/
abstract protected boolean compareElements(T elt1, T elt2);

View File

@ -184,7 +184,7 @@ public class ImmutableStack<T> implements Iterable<T> {
}
/**
* @return <code>true</code> iff other.size() = k, k <= this.size(), and the
* @return <code>true</code> iff {@code other.size() = k}, {@code k <= this.size()}, and the
* top k elements of this equal other
* @throws IllegalArgumentException
* if other == null

View File

@ -26,7 +26,7 @@ import com.ibm.wala.util.intset.MutableSparseIntSet;
*/
public class MapUtil {
/**
* @param M a mapping from Object -> Set
* @param M a mapping from Object -&gt; Set
* @param key
* @return the Set corresponding to key in M; create one if needed
* @throws IllegalArgumentException if M is null
@ -97,7 +97,7 @@ public class MapUtil {
}
/**
* @param M a mapping from Object -> Map
* @param M a mapping from Object -&gt; Map
* @param key
* @return the Map corresponding to key in M; create one if needed
* @throws IllegalArgumentException if M is null
@ -133,7 +133,7 @@ public class MapUtil {
}
/**
* @param M a mapping from Object -> WeakHashMap
* @param M a mapping from Object -&gt; WeakHashMap
* @param key
* @return the WeakHashMap corresponding to key in M; create one if needed
* @throws IllegalArgumentException if M is null
@ -153,8 +153,8 @@ public class MapUtil {
}
/**
* @param m a map from key -> Set <value>
* @return inverted map, value -> Set <key>
* @param m a map from key -&gt; {@link Set}&lt;value&gt;
* @return inverted map, value -&gt; {@link Set}&lt;key&gt;
* @throws IllegalArgumentException if m is null
*/
public static <K, V> Map<V, Set<K>> inverseMap(Map<K, Set<V>> m) {

View File

@ -27,7 +27,7 @@ public class ParanoidHashSet<T> extends LinkedHashSet<T> {
public static final long serialVersionUID = 30919839181133333L;
/**
* A mapping from Integer (hashcode) -> Set of objects
* A mapping from Integer (hashcode) -&gt; Set of objects
*/
private final Map<Integer, Set<T>> hcFreq;

View File

@ -13,8 +13,8 @@ package com.ibm.wala.util.graph;
import com.ibm.wala.util.intset.SimpleIntVector;
/**
* We represent a path in a numbered graph as a vector of integers <i_1, ...,
* i_n> where node i_1 is the src and node i_n is the sink
* We represent a path in a numbered graph as a vector of integers &lt;i_1, ...,
* i_n&gt; where node i_1 is the src and node i_n is the sink
*/
public class Path extends SimpleIntVector {

View File

@ -23,7 +23,7 @@ import com.ibm.wala.util.intset.MutableMapping;
public class SlowNumberedNodeManager<T> implements NumberedNodeManager<T>, Serializable {
/**
* A bijection between integer <-> node
* A bijection between integer &lt;-&gt; node
*/
final private MutableMapping<T> map = MutableMapping.make();

View File

@ -51,7 +51,7 @@ public final class SparseNumberedEdgeManager<T> implements NumberedEdgeManager<T
* an object to track nodes
* @param normalCase
* what is the "normal" number of out edges for a node?
* @throws IllegalArgumentException if normalCase < 0
* @throws IllegalArgumentException if normalCase &lt; 0
*/
public SparseNumberedEdgeManager(NumberedNodeManager<T> nodeManager, int normalCase, byte delegateImpl) throws IllegalArgumentException {
if (nodeManager == null) {

View File

@ -26,7 +26,7 @@ public class SlowDFSDiscoverTimeIterator<T> extends GraphDFSDiscoverTimeIterator
public static final long serialVersionUID = 9439217987188L;
/**
* An iterator of child nodes for each node being searched A Map: Node -> Iterator
* An iterator of child nodes for each node being searched A Map: Node -&gt; Iterator
*/
final private Map<T, Iterator<? extends T>> pendingChildren = HashMapFactory.make(25);

Some files were not shown because too many files have changed in this diff Show More