/** * @see java.lang.Object#equals(java.lang.Object) */ public boolean equals(Object object) { if (this == object) return true; if (!(object instanceof AccessRuleSet)) return false; AccessRuleSet otherRuleSet = (AccessRuleSet) object; if (this.classpathEntryType != otherRuleSet.classpathEntryType || this.classpathEntryName == null && otherRuleSet.classpathEntryName != null || ! this.classpathEntryName.equals(otherRuleSet.classpathEntryName)) { return false; } int rulesLength = this.accessRules.length; if (rulesLength != otherRuleSet.accessRules.length) return false; for (int i = 0; i < rulesLength; i++) if (!this.accessRules[i].equals(otherRuleSet.accessRules[i])) return false; return true; }
public int getProblemId() { return this.accessRule.getProblemId(); }
private int hashCode(AccessRule[] rules) { final int prime = 31; if (rules == null) return 0; int result = 1; for (int i = 0, length = rules.length; i < length; i++) { result = prime * result + (rules[i] == null ? 0 : rules[i].hashCode()); } return result; }
private void encodeAccessRule(AccessRule accessRule, XMLWriter writer, boolean indent, boolean newLine) { HashMap parameters = new HashMap(); parameters.put(TAG_PATTERN, new String(accessRule.pattern)); switch (accessRule.getProblemId()) { case IProblem.ForbiddenReference: parameters.put(TAG_KIND, TAG_NON_ACCESSIBLE); break; case IProblem.DiscouragedReference: parameters.put(TAG_KIND, TAG_DISCOURAGED); break; default: parameters.put(TAG_KIND, TAG_ACCESSIBLE); break; } if (accessRule.ignoreIfBetter()) parameters.put(TAG_IGNORE_IF_BETTER, "true"); //$NON-NLS-1$ writer.printTag(TAG_ACCESS_RULE, parameters, indent, newLine, true); }
protected AccessRestriction getAccessRestriction(String packageName) { if (exportedPackages != null && !exportedPackages.contains(packageName)) { AccessRule rule = new AccessRule(null /* pattern */, IProblem.ForbiddenReference, true /* keep looking for accessible type */); return new AccessRestriction(rule, AccessRestriction.COMMAND_LINE, getEntryName()); } return null; }
public boolean ignoreIfBetter() { return this.accessRule.ignoreIfBetter(); } }
public String toString() { StringBuffer buffer = new StringBuffer(); buffer.append("pattern="); //$NON-NLS-1$ buffer.append(this.pattern); switch (getProblemId()) { case IProblem.ForbiddenReference: buffer.append(" (NON ACCESSIBLE"); //$NON-NLS-1$ break; case IProblem.DiscouragedReference: buffer.append(" (DISCOURAGED"); //$NON-NLS-1$ break; default: buffer.append(" (ACCESSIBLE"); //$NON-NLS-1$ break; } if (ignoreIfBetter()) buffer.append(" | IGNORE IF BETTER"); //$NON-NLS-1$ buffer.append(')'); return buffer.toString(); } }
protected AccessRestriction getAccessRestriction(String packageName) { if (exportedPackages != null && !exportedPackages.contains(packageName)) { AccessRule rule = new AccessRule(null /* pattern */, IProblem.ForbiddenReference, true /* keep looking for accessible type */); return new AccessRestriction(rule, AccessRestriction.COMMAND_LINE, getEntryName()); } return null; }
public boolean ignoreIfBetter() { return this.accessRule.ignoreIfBetter(); } }
public String toString() { StringBuffer buffer = new StringBuffer(); buffer.append("pattern="); //$NON-NLS-1$ buffer.append(this.pattern); switch (getProblemId()) { case IProblem.ForbiddenReference: buffer.append(" (NON ACCESSIBLE"); //$NON-NLS-1$ break; case IProblem.DiscouragedReference: buffer.append(" (DISCOURAGED"); //$NON-NLS-1$ break; default: buffer.append(" (ACCESSIBLE"); //$NON-NLS-1$ break; } if (ignoreIfBetter()) buffer.append(" | IGNORE IF BETTER"); //$NON-NLS-1$ buffer.append(')'); return buffer.toString(); } }
switch (key) { case '+': accessRules[j++] = new AccessRule(pattern .toCharArray(), 0); break; case '~': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.DiscouragedReference); break; case '-': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.ForbiddenReference); break; case '?': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.ForbiddenReference, true/*keep looking for accessible type*/);
public int getProblemId() { return this.accessRule.getProblemId(); }
private int hashCode(AccessRule[] rules) { final int prime = 31; if (rules == null) return 0; int result = 1; for (int i = 0, length = rules.length; i < length; i++) { result = prime * result + (rules[i] == null ? 0 : rules[i].hashCode()); } return result; }
public boolean ignoreIfBetter() { return this.accessRule.ignoreIfBetter(); } }
/** * @see java.lang.Object#equals(java.lang.Object) */ public boolean equals(Object object) { if (this == object) return true; if (!(object instanceof AccessRuleSet)) return false; AccessRuleSet otherRuleSet = (AccessRuleSet) object; if (this.classpathEntryType != otherRuleSet.classpathEntryType || this.classpathEntryName == null && otherRuleSet.classpathEntryName != null || ! this.classpathEntryName.equals(otherRuleSet.classpathEntryName)) { return false; } int rulesLength = this.accessRules.length; if (rulesLength != otherRuleSet.accessRules.length) return false; for (int i = 0; i < rulesLength; i++) if (!this.accessRules[i].equals(otherRuleSet.accessRules[i])) return false; return true; }
public String toString() { StringBuffer buffer = new StringBuffer(); buffer.append("pattern="); //$NON-NLS-1$ buffer.append(this.pattern); switch (getProblemId()) { case IProblem.ForbiddenReference: buffer.append(" (NON ACCESSIBLE"); //$NON-NLS-1$ break; case IProblem.DiscouragedReference: buffer.append(" (DISCOURAGED"); //$NON-NLS-1$ break; default: buffer.append(" (ACCESSIBLE"); //$NON-NLS-1$ break; } if (ignoreIfBetter()) buffer.append(" | IGNORE IF BETTER"); //$NON-NLS-1$ buffer.append(')'); return buffer.toString(); } }
switch (key) { case '+': accessRules[j++] = new AccessRule(pattern .toCharArray(), 0); break; case '~': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.DiscouragedReference); break; case '-': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.ForbiddenReference); break; case '?': accessRules[j++] = new AccessRule(pattern .toCharArray(), IProblem.ForbiddenReference, true/*keep looking for accessible type*/);
public int getProblemId() { return this.accessRule.getProblemId(); }
private int hashCode(AccessRule[] rules) { final int prime = 31; if (rules == null) return 0; int result = 1; for (int i = 0, length = rules.length; i < length; i++) { result = prime * result + (rules[i] == null ? 0 : rules[i].hashCode()); } return result; }
public boolean ignoreIfBetter() { return this.accessRule.ignoreIfBetter(); } }