Mercurial > jdk8-mips64-public > jaxws / annotate
src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/gbind/Graph.java@0989ad8c0860 (annotated)
src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/gbind/Graph.java
Tue, 09 Apr 2013 14:51:13 +0100
- author
- alanb
- date
- Tue, 09 Apr 2013 14:51:13 +0100
- changeset 368
- 0989ad8c0860
- parent 0
- 373ffda63c9a
- permissions
- -rw-r--r--
8010393: Update JAX-WS RI to 2.2.9-b12941
Reviewed-by: alanb, erikj
Contributed-by: miroslav.kos@oracle.com, martin.grebac@oracle.com
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. Oracle designates this |
| aoqi@0 | 8 | * particular file as subject to the "Classpath" exception as provided |
| aoqi@0 | 9 | * by Oracle in the LICENSE file that accompanied this code. |
| aoqi@0 | 10 | * |
| aoqi@0 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 15 | * accompanied this code). |
| aoqi@0 | 16 | * |
| aoqi@0 | 17 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 20 | * |
| aoqi@0 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 22 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 23 | * questions. |
| aoqi@0 | 24 | */ |
| aoqi@0 | 25 | |
| aoqi@0 | 26 | package com.sun.tools.internal.xjc.reader.gbind; |
| aoqi@0 | 27 | |
| aoqi@0 | 28 | import java.util.ArrayList; |
| aoqi@0 | 29 | import java.util.HashSet; |
| aoqi@0 | 30 | import java.util.Iterator; |
| aoqi@0 | 31 | import java.util.List; |
| aoqi@0 | 32 | import java.util.Set; |
| aoqi@0 | 33 | |
| aoqi@0 | 34 | /** |
| aoqi@0 | 35 | * Graph of {@link Element}s. |
| aoqi@0 | 36 | * |
| aoqi@0 | 37 | * @author Kohsuke Kawaguchi |
| aoqi@0 | 38 | */ |
| aoqi@0 | 39 | public final class Graph implements Iterable<ConnectedComponent> { |
| aoqi@0 | 40 | private final Element source = new SourceNode(); |
| aoqi@0 | 41 | private final Element sink = new SinkNode(); |
| aoqi@0 | 42 | |
| aoqi@0 | 43 | /** |
| aoqi@0 | 44 | * Strongly connected components of this graph. |
| aoqi@0 | 45 | */ |
| aoqi@0 | 46 | private final List<ConnectedComponent> ccs = new ArrayList<ConnectedComponent>(); |
| aoqi@0 | 47 | |
| aoqi@0 | 48 | /** |
| aoqi@0 | 49 | * Builds a {@link Graph} from an {@link Expression} tree. |
| aoqi@0 | 50 | * |
| aoqi@0 | 51 | * {@link Expression} given to the graph will be modified forever, |
| aoqi@0 | 52 | * and it will not be able to create another {@link Graph}. |
| aoqi@0 | 53 | */ |
| aoqi@0 | 54 | public Graph(Expression body) { |
| aoqi@0 | 55 | // attach source and sink |
| aoqi@0 | 56 | Expression whole = new Sequence(new Sequence(source,body),sink); |
| aoqi@0 | 57 | |
| aoqi@0 | 58 | // build up a graph |
| aoqi@0 | 59 | whole.buildDAG(ElementSet.EMPTY_SET); |
| aoqi@0 | 60 | |
| aoqi@0 | 61 | // decompose into strongly connected components. |
| aoqi@0 | 62 | // the algorithm is standard DFS-based algorithm, |
| aoqi@0 | 63 | // one illustration of this algorithm is available at |
| aoqi@0 | 64 | // http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/strongComponent.htm |
| aoqi@0 | 65 | source.assignDfsPostOrder(sink); |
| aoqi@0 | 66 | source.buildStronglyConnectedComponents(ccs); |
| aoqi@0 | 67 | |
| aoqi@0 | 68 | // cut-set check |
| aoqi@0 | 69 | Set<Element> visited = new HashSet<Element>(); |
| aoqi@0 | 70 | for (ConnectedComponent cc : ccs) { |
| aoqi@0 | 71 | visited.clear(); |
| aoqi@0 | 72 | if(source.checkCutSet(cc,visited)) { |
| aoqi@0 | 73 | cc.isRequired = true; |
| aoqi@0 | 74 | } |
| aoqi@0 | 75 | } |
| aoqi@0 | 76 | } |
| aoqi@0 | 77 | |
| aoqi@0 | 78 | /** |
| aoqi@0 | 79 | * List up {@link ConnectedComponent}s of this graph in an order. |
| aoqi@0 | 80 | */ |
| aoqi@0 | 81 | public Iterator<ConnectedComponent> iterator() { |
| aoqi@0 | 82 | return ccs.iterator(); |
| aoqi@0 | 83 | } |
| aoqi@0 | 84 | |
| aoqi@0 | 85 | public String toString() { |
| aoqi@0 | 86 | return ccs.toString(); |
| aoqi@0 | 87 | } |
| aoqi@0 | 88 | } |
