| /* |
| * Copyright 2000-2009 JetBrains s.r.o. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package com.intellij.internal.diGraph.analyzer; |
| |
| import com.intellij.openapi.util.Pair; |
| |
| import java.util.Iterator; |
| import java.util.LinkedList; |
| |
| /** |
| * Created by IntelliJ IDEA. |
| * User: db |
| * Date: 21.06.2003 |
| * Time: 20:23:16 |
| * To change this template use Options | File Templates. |
| */ |
| public class GlobalAnalyzer { |
| private static boolean stepOneEnd(MarkedNode currNode, LinkedList worklist, OneEndFunctor functor) { |
| boolean result = false; |
| |
| for (Iterator i = currNode.outIterator(); i.hasNext();) { |
| MarkedEdge currEdge = (MarkedEdge)i.next(); |
| MarkedNode nextNode = (MarkedNode)currEdge.end(); |
| Mark theMark = functor.compute(currNode.getMark(), currEdge.getMark(), nextNode.getMark()); |
| if (!theMark.coincidesWith(nextNode.getMark())) { |
| result = true; |
| nextNode.setMark(theMark); |
| worklist.addFirst(nextNode); |
| } |
| } |
| |
| return result; |
| } |
| |
| private static boolean stepTwoEnds(final MarkedNode currNode, final LinkedList worklist, final TwoEndsFunctor functor) { |
| boolean result = false; |
| |
| for (Iterator i = currNode.outIterator(); i.hasNext();) { |
| final MarkedEdge currEdge = (MarkedEdge)i.next(); |
| final MarkedNode nextNode = (MarkedNode)currEdge.end(); |
| final Pair<Mark,Mark> markPair = functor.compute(currNode.getMark(), currEdge.getMark(), nextNode.getMark()); |
| |
| final Mark leftMark = markPair.getFirst(); |
| final Mark rightMark = markPair.getSecond(); |
| |
| if (!leftMark.coincidesWith(currNode.getMark())) { |
| result = true; |
| currNode.setMark(leftMark); |
| worklist.addFirst(currNode); |
| } |
| |
| if (!rightMark.coincidesWith(nextNode.getMark())) { |
| result = true; |
| nextNode.setMark(rightMark); |
| worklist.addFirst(nextNode); |
| } |
| } |
| |
| return result; |
| } |
| |
| public static <T extends MarkedNode>boolean doOneEnd(final LinkedList<T> init, final OneEndFunctor functor) { |
| boolean result = false; |
| |
| final LinkedList<T> worklist = new LinkedList<T>(); |
| |
| for (Iterator<T> i = init.iterator(); i.hasNext();) { |
| result = stepOneEnd(i.next(), worklist, functor) || result; |
| } |
| |
| while (worklist.size() > 0) { |
| result = stepOneEnd(worklist.removeFirst(), worklist, functor) || result; |
| } |
| |
| return result; |
| } |
| |
| public static <T extends MarkedNode>boolean doTwoEnds(final LinkedList<T> init, final TwoEndsFunctor functor) { |
| boolean result = false; |
| |
| final LinkedList<T> worklist = new LinkedList<T>(); |
| |
| for (Iterator<T> i = init.iterator(); i.hasNext();) { |
| result = stepTwoEnds(i.next(), worklist, functor) || result; |
| } |
| |
| while (worklist.size() > 0) { |
| result = stepTwoEnds(worklist.removeFirst(), worklist, functor) || result; |
| } |
| |
| return result; |
| } |
| } |