rose-0.9.5.1: Bindings for the ROSE compilerContentsIndex
ROSE.Sage3.Methods.SgGraph
Synopsis
isSgGraph :: Typeable a => SgNode a -> IO (Maybe (SgGraph ()))
upSgGraph :: Typeable a => SgGraph a -> SgGraph ()
newGraph :: String -> IO (SgGraph ())
graphAddEdgeGraphNodeGraphNodestring :: (Typeable a, Typeable b, Typeable c) => SgGraph a -> SgGraphNode b -> SgGraphNode c -> String -> IO (SgGraphEdge ())
graphAddEdgeGraphEdge :: (Typeable a, Typeable b) => SgGraph a -> SgGraphEdge b -> IO (SgGraphEdge ())
graphAddNodestringNode :: (Typeable a, Typeable b) => SgGraph a -> String -> SgNode b -> IO (SgGraphNode ())
graphAddNodeGraphNode :: (Typeable a, Typeable b) => SgGraph a -> SgGraphNode b -> IO (SgGraphNode ())
graphAppendProperties :: Typeable a => SgGraph a -> CInt -> String -> IO ()
graphAttributeExists :: Typeable a => SgGraph a -> String -> IO Bool
graphCheckDataMemberPointersIfInMemoryPool :: Typeable a => SgGraph a -> IO ()
graphCheckIfGraphNodeExists :: Typeable a => SgGraph a -> String -> [SgGraphNode ()] -> IO ()
graphClassName :: Typeable a => SgGraph a -> IO String
graphDisplayEdgeIndexToEdgeMap :: Typeable a => SgGraph a -> IO ()
graphDisplayNodeIndexPairToEdgeMultimap :: Typeable a => SgGraph a -> IO ()
graphDisplayNodeIndexToEdgeMultimap :: Typeable a => SgGraph a -> IO ()
graphDisplayNodeIndexToNodeMap :: Typeable a => SgGraph a -> IO ()
graphDisplayStringToEdgeIndexMultimap :: Typeable a => SgGraph a -> IO ()
graphDisplayStringToNodeIndexMultimap :: Typeable a => SgGraph a -> IO ()
graphExistsGraphNode :: (Typeable a, Typeable b) => SgGraph a -> SgGraphNode b -> IO Bool
graphExistsGraphEdge :: (Typeable a, Typeable b) => SgGraph a -> SgGraphEdge b -> IO Bool
graphGenerateSpanningTree :: Typeable a => SgGraph a -> IO [SgGraphEdge ()]
graphGetChildIndex :: (Typeable a, Typeable b) => SgGraph a -> SgNode b -> IO CLong
graphGetBoostEdgeWeights :: Typeable a => SgGraph a -> IO [CInt]
graphGetChildIndex2 :: (Typeable a, Typeable b) => SgGraph a -> SgNode b -> IO CSize
graphGetIndex :: Typeable a => SgGraph a -> IO CInt
graphGetName :: Typeable a => SgGraph a -> IO String
graphGetNumberOfTraversalSuccessors :: Typeable a => SgGraph a -> IO CSize
graphGetTraversalSuccessorByIndex :: Typeable a => SgGraph a -> CSize -> IO (SgNode ())
graphGetTraversalSuccessorContainer :: Typeable a => SgGraph a -> IO [SgNode ()]
graphGetTraversalSuccessorNamesContainer :: Typeable a => SgGraph a -> IO [CString]
graphHashCode :: Typeable a => SgGraph a -> String -> CInt -> IO CInt
graphIsInMemoryPool :: Typeable a => SgGraph a -> IO Bool
graphMemoryUsage :: IO CSize
graphMemoryUsage2 :: Typeable a => SgGraph a -> IO CSize
graphNumberOfAttributes :: Typeable a => SgGraph a -> IO CInt
graphNumberOfGraphEdges :: Typeable a => SgGraph a -> IO CSize
graphNumberOfGraphNodes :: Typeable a => SgGraph a -> IO CSize
graphNumberOfNodes :: IO CSize
graphPostConstructionInitialization :: Typeable a => SgGraph a -> IO ()
graphRemoveAttribute :: Typeable a => SgGraph a -> String -> IO ()
graphResizeHashMaps :: Typeable a => SgGraph a -> CSize -> CSize -> IO ()
graphSageClassName :: Typeable a => SgGraph a -> IO String
graphSetIndex :: Typeable a => SgGraph a -> CInt -> IO ()
graphSetName :: Typeable a => SgGraph a -> String -> IO ()
graphVariantT :: Typeable a => SgGraph a -> IO VariantT
Documentation
isSgGraph :: Typeable a => SgNode a -> IO (Maybe (SgGraph ()))
Attempts a dynamic cast of the given node to the type SgGraph.
upSgGraph :: Typeable a => SgGraph a -> SgGraph ()
Performs an upcast of a SgGraph subtype to a SgGraph.
newGraph :: String -> IO (SgGraph ())
Stub for ::SgGraph::SgGraph of type void (::std::string)
graphAddEdgeGraphNodeGraphNodestring :: (Typeable a, Typeable b, Typeable c) => SgGraph a -> SgGraphNode b -> SgGraphNode c -> String -> IO (SgGraphEdge ())
Stub for ::SgGraph::addEdge of type class ::SgGraphEdge*(class ::SgGraphNode*, class ::SgGraphNode*, const ::std::string&)
graphAddEdgeGraphEdge :: (Typeable a, Typeable b) => SgGraph a -> SgGraphEdge b -> IO (SgGraphEdge ())
Stub for ::SgGraph::addEdge of type class ::SgGraphEdge*(class ::SgGraphEdge*)
graphAddNodestringNode :: (Typeable a, Typeable b) => SgGraph a -> String -> SgNode b -> IO (SgGraphNode ())
Stub for ::SgGraph::addNode of type class ::SgGraphNode*(const ::std::string&, class ::SgNode*)
graphAddNodeGraphNode :: (Typeable a, Typeable b) => SgGraph a -> SgGraphNode b -> IO (SgGraphNode ())
Stub for ::SgGraph::addNode of type class ::SgGraphNode*(class ::SgGraphNode*)
graphAppendProperties :: Typeable a => SgGraph a -> CInt -> String -> IO ()
Stub for ::SgGraph::append_properties of type void (int , const ::std::string&)
graphAttributeExists :: Typeable a => SgGraph a -> String -> IO Bool
Stub for ::SgGraph::attributeExists of type bool (::std::string)
graphCheckDataMemberPointersIfInMemoryPool :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::checkDataMemberPointersIfInMemoryPool of type void ()
graphCheckIfGraphNodeExists :: Typeable a => SgGraph a -> String -> [SgGraphNode ()] -> IO ()
Stub for ::SgGraph::checkIfGraphNodeExists of type void (const ::std::string&, class ::std::vector < SgGraphNode * , allocator< SgGraphNode * > > &)
graphClassName :: Typeable a => SgGraph a -> IO String
Stub for ::SgGraph::class_name of type ::std::string()
graphDisplayEdgeIndexToEdgeMap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_edge_index_to_edge_map of type void ()
graphDisplayNodeIndexPairToEdgeMultimap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_node_index_pair_to_edge_multimap of type void ()
graphDisplayNodeIndexToEdgeMultimap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_node_index_to_edge_multimap of type void ()
graphDisplayNodeIndexToNodeMap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_node_index_to_node_map of type void ()
graphDisplayStringToEdgeIndexMultimap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_string_to_edge_index_multimap of type void ()
graphDisplayStringToNodeIndexMultimap :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::display_string_to_node_index_multimap of type void ()
graphExistsGraphNode :: (Typeable a, Typeable b) => SgGraph a -> SgGraphNode b -> IO Bool
Stub for ::SgGraph::exists of type bool (class ::SgGraphNode*)
graphExistsGraphEdge :: (Typeable a, Typeable b) => SgGraph a -> SgGraphEdge b -> IO Bool
Stub for ::SgGraph::exists of type bool (class ::SgGraphEdge*)
graphGenerateSpanningTree :: Typeable a => SgGraph a -> IO [SgGraphEdge ()]
Stub for ::SgGraph::generateSpanningTree of type class ::std::vector < SgGraphEdge * , allocator< SgGraphEdge * > > ()
graphGetChildIndex :: (Typeable a, Typeable b) => SgGraph a -> SgNode b -> IO CLong
Stub for ::SgGraph::getChildIndex of type long (class ::SgNode*)
graphGetBoostEdgeWeights :: Typeable a => SgGraph a -> IO [CInt]
Stub for ::SgGraph::get_boost_edge_weights of type const ::SgGraph::SgBoostEdgeWeightList&()
graphGetChildIndex2 :: (Typeable a, Typeable b) => SgGraph a -> SgNode b -> IO CSize
Stub for ::SgGraph::get_childIndex of type ::size_t(class ::SgNode*)
graphGetIndex :: Typeable a => SgGraph a -> IO CInt
Stub for ::SgGraph::get_index of type int ()
graphGetName :: Typeable a => SgGraph a -> IO String
Stub for ::SgGraph::get_name of type ::std::string()
graphGetNumberOfTraversalSuccessors :: Typeable a => SgGraph a -> IO CSize
Stub for ::SgGraph::get_numberOfTraversalSuccessors of type ::size_t()
graphGetTraversalSuccessorByIndex :: Typeable a => SgGraph a -> CSize -> IO (SgNode ())
Stub for ::SgGraph::get_traversalSuccessorByIndex of type class ::SgNode*(::size_t)
graphGetTraversalSuccessorContainer :: Typeable a => SgGraph a -> IO [SgNode ()]
Stub for ::SgGraph::get_traversalSuccessorContainer of type class ::std::vector < SgNode * , allocator< SgNode * > > ()
graphGetTraversalSuccessorNamesContainer :: Typeable a => SgGraph a -> IO [CString]
Stub for ::SgGraph::get_traversalSuccessorNamesContainer of type class ::std::vector < string , allocator< string > > ()
graphHashCode :: Typeable a => SgGraph a -> String -> CInt -> IO CInt
Stub for ::SgGraph::hashCode of type int (const char *, int )
graphIsInMemoryPool :: Typeable a => SgGraph a -> IO Bool
Stub for ::SgGraph::isInMemoryPool of type bool ()
graphMemoryUsage :: IO CSize
Stub for ::SgGraph::memoryUsage of type ::size_t()
graphMemoryUsage2 :: Typeable a => SgGraph a -> IO CSize
Stub for ::SgGraph::memory_usage of type ::size_t()
graphNumberOfAttributes :: Typeable a => SgGraph a -> IO CInt
Stub for ::SgGraph::numberOfAttributes of type int ()
graphNumberOfGraphEdges :: Typeable a => SgGraph a -> IO CSize
Stub for ::SgGraph::numberOfGraphEdges of type ::size_t()
graphNumberOfGraphNodes :: Typeable a => SgGraph a -> IO CSize
Stub for ::SgGraph::numberOfGraphNodes of type ::size_t()
graphNumberOfNodes :: IO CSize
Stub for ::SgGraph::numberOfNodes of type ::size_t()
graphPostConstructionInitialization :: Typeable a => SgGraph a -> IO ()
Stub for ::SgGraph::post_construction_initialization of type void ()
graphRemoveAttribute :: Typeable a => SgGraph a -> String -> IO ()
Stub for ::SgGraph::removeAttribute of type void (::std::string)
graphResizeHashMaps :: Typeable a => SgGraph a -> CSize -> CSize -> IO ()
Stub for ::SgGraph::resize_hash_maps of type void (::size_t, ::size_t)
graphSageClassName :: Typeable a => SgGraph a -> IO String
Stub for ::SgGraph::sage_class_name of type const char *()
graphSetIndex :: Typeable a => SgGraph a -> CInt -> IO ()
Stub for ::SgGraph::set_index of type void (int )
graphSetName :: Typeable a => SgGraph a -> String -> IO ()
Stub for ::SgGraph::set_name of type void (::std::string)
graphVariantT :: Typeable a => SgGraph a -> IO VariantT
Stub for ::SgGraph::variantT of type enum ::VariantT()
Produced by Haddock version 2.4.2