Package soot.toolkits.graph

Class SlowPseudoTopologicalOrderer<N>

  • All Implemented Interfaces:
    Orderer<N>
    public class SlowPseudoTopologicalOrderer<N>
extends Object
implements Orderer<N>
    Provide the pseudo topological order of a graph's nodes. It has same functionality as PseudoTopologicalOrderer; however, this class considers the order of successors. It runs slower but more precise. Currently it was only used by ArrayBoundsCheckerAnalysis to reduce the iteration numbers.

    • Constructor Detail

      • SlowPseudoTopologicalOrderer

        public SlowPseudoTopologicalOrderer​(Singletons.Global g)

      • SlowPseudoTopologicalOrderer

        public SlowPseudoTopologicalOrderer()

    • Method Detail

      • newList

        public List<N> newList​(DirectedGraph<N> g,
                       boolean reverse)
        Builds an order for a directed graph. The order is represented by the returned list, i.e. is a node was assigned number i in the order, it will be in the ith position of the returned list.
        Specified by:
        newList in interface Orderer<N>
        Parameters:
        g - a DirectedGraph instance whose nodes we wish to order
        reverse - true to compute the reverse order
        Returns:
        a somehow ordered list of the graph's nodes

      • newList

        @Deprecated
public List<N> newList​(DirectedGraph<N> g)
        Deprecated.
        use {@link #newList(DirectedGraph, boolean))} instead
        Parameters:
        g - a DirectedGraph instance whose nodes we wish to order.
        Returns:
        a pseudo-topologically ordered list of the graph's nodes.

      • setReverseOrder

        @Deprecated
public void setReverseOrder​(boolean isReversed)
        Deprecated.
        use {@link #newList(DirectedGraph, boolean))} instead
        Set the ordering for the orderer.
        Parameters:
        isReversed - specify if we want reverse pseudo-topological ordering, or not.

      • isReverseOrder

        @Deprecated
public boolean isReverseOrder()
        Deprecated.
        use {@link #newList(DirectedGraph, boolean))} instead
        Check the ordering for the orderer.
        Returns:
        true if we have reverse pseudo-topological ordering, false otherwise.