private void removeCaughtException(ReferenceBinding caughtException) { Object[] exceptions = this.thrownExceptions.values; for (int i = 0; i < exceptions.length; i++) { ReferenceBinding exception = (ReferenceBinding)exceptions[i]; if (exception != null) { if (exception == caughtException || caughtException.isSuperclassOf(exception)) { this.thrownExceptions.remove(exception); } } } } }
public void finished(SourceFile element) { this.needsCompileList.remove(element); this.compiledList.add(element); }
public void finished(SourceFile element) { this.needsCompileList.remove(element); this.compiledList.add(element); }
public void finished(SourceFile element) { this.needsCompileList.remove(element); this.compiledList.add(element); }
public void finished(SourceFile element) { this.needsCompileList.remove(element); this.compiledList.add(element); }
public void finished(SourceFile element) { this.needsCompileList.remove(element); this.compiledList.add(element); }
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
private void removeCaughtException(ReferenceBinding caughtException) { Object[] exceptions = this.thrownExceptions.values; for (int i = 0; i < exceptions.length; i++) { ReferenceBinding exception = (ReferenceBinding)exceptions[i]; if (exception != null) { if (TypeBinding.equalsEquals(exception, caughtException)) { this.thrownExceptions.remove(exception); } else if (caughtException.isSuperclassOf(exception)) { // catching the sub-exception when super has been caught already will give an error // so remove it from thrown list and lower the relevance for cases when it is found // from searchAllTypes(..) this.thrownExceptions.remove(exception); this.discouragedExceptions.add(exception); } } } } }
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
private void removeCaughtException(ReferenceBinding caughtException) { Object[] exceptions = this.thrownExceptions.values; for (int i = 0; i < exceptions.length; i++) { ReferenceBinding exception = (ReferenceBinding)exceptions[i]; if (exception != null) { if (TypeBinding.equalsEquals(exception, caughtException)) { this.thrownExceptions.remove(exception); } else if (caughtException.isSuperclassOf(exception)) { // catching the sub-exception when super has been caught already will give an error // so remove it from thrown list and lower the relevance for cases when it is found // from searchAllTypes(..) this.thrownExceptions.remove(exception); this.discouragedExceptions.add(exception); } } } } }
public void addPossibleMatch(ASTNode node) { // remove existing node at same position from set // (case of recovery that created the same node several time // see http://bugs.eclipse.org/bugs/show_bug.cgi?id=29366) long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing != null && existing.getClass().equals(node.getClass())) this.possibleMatchingNodesSet.remove(existing); // add node to set this.possibleMatchingNodesSet.add(node); this.possibleMatchingNodesKeys.put(key, node); } public void addTrustedMatch(ASTNode node, boolean isExact) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {
public Object removePossibleMatch(ASTNode node) { long key = (((long) node.sourceStart) << 32) + node.sourceEnd; ASTNode existing = (ASTNode) this.possibleMatchingNodesKeys.get(key); if (existing == null) return null; this.possibleMatchingNodesKeys.put(key, null); return this.possibleMatchingNodesSet.remove(node); } public Object removeTrustedMatch(ASTNode node) {