| ||||
| ||||
| Synopsis | ||||
| Documentation | ||||
| isSgBidirectionalGraph :: Typeable a => SgNode a -> IO (Maybe (SgBidirectionalGraph ())) | ||||
| Attempts a dynamic cast of the given node to the type SgBidirectionalGraph. | ||||
| upSgBidirectionalGraph :: Typeable a => SgBidirectionalGraph a -> SgBidirectionalGraph () | ||||
| Performs an upcast of a SgBidirectionalGraph subtype to a SgBidirectionalGraph. | ||||
| newBidirectionalGraph :: String -> IO (SgBidirectionalGraph ()) | ||||
| Stub for ::SgBidirectionalGraph::SgBidirectionalGraph of type void (::std::string) | ||||
| bidirectionalGraphCheckDataMemberPointersIfInMemoryPool :: Typeable a => SgBidirectionalGraph a -> IO () | ||||
| Stub for ::SgBidirectionalGraph::checkDataMemberPointersIfInMemoryPool of type void () | ||||
| bidirectionalGraphClassName :: Typeable a => SgBidirectionalGraph a -> IO String | ||||
| Stub for ::SgBidirectionalGraph::class_name of type ::std::string() | ||||
| bidirectionalGraphGetChildIndex :: (Typeable a, Typeable b) => SgBidirectionalGraph a -> SgNode b -> IO CLong | ||||
| Stub for ::SgBidirectionalGraph::getChildIndex of type long (class ::SgNode*) | ||||
| bidirectionalGraphGetChildIndex2 :: (Typeable a, Typeable b) => SgBidirectionalGraph a -> SgNode b -> IO CSize | ||||
| Stub for ::SgBidirectionalGraph::get_childIndex of type ::size_t(class ::SgNode*) | ||||
| bidirectionalGraphGetNumberOfTraversalSuccessors :: Typeable a => SgBidirectionalGraph a -> IO CSize | ||||
| Stub for ::SgBidirectionalGraph::get_numberOfTraversalSuccessors of type ::size_t() | ||||
| bidirectionalGraphGetTraversalSuccessorByIndex :: Typeable a => SgBidirectionalGraph a -> CSize -> IO (SgNode ()) | ||||
| Stub for ::SgBidirectionalGraph::get_traversalSuccessorByIndex of type class ::SgNode*(::size_t) | ||||
| bidirectionalGraphGetTraversalSuccessorContainer :: Typeable a => SgBidirectionalGraph a -> IO [SgNode ()] | ||||
| Stub for ::SgBidirectionalGraph::get_traversalSuccessorContainer of type class ::std::vector < SgNode * , allocator< SgNode * > > () | ||||
| bidirectionalGraphGetTraversalSuccessorNamesContainer :: Typeable a => SgBidirectionalGraph a -> IO [CString] | ||||
| Stub for ::SgBidirectionalGraph::get_traversalSuccessorNamesContainer of type class ::std::vector < string , allocator< string > > () | ||||
| bidirectionalGraphIsInMemoryPool :: Typeable a => SgBidirectionalGraph a -> IO Bool | ||||
| Stub for ::SgBidirectionalGraph::isInMemoryPool of type bool () | ||||
| bidirectionalGraphMemoryUsage :: IO CSize | ||||
| Stub for ::SgBidirectionalGraph::memoryUsage of type ::size_t() | ||||
| bidirectionalGraphNumberOfNodes :: IO CSize | ||||
| Stub for ::SgBidirectionalGraph::numberOfNodes of type ::size_t() | ||||
| bidirectionalGraphSageClassName :: Typeable a => SgBidirectionalGraph a -> IO String | ||||
| Stub for ::SgBidirectionalGraph::sage_class_name of type const char *() | ||||
| bidirectionalGraphVariantT :: Typeable a => SgBidirectionalGraph a -> IO VariantT | ||||
| Stub for ::SgBidirectionalGraph::variantT of type enum ::VariantT() | ||||
| Produced by Haddock version 2.4.2 |