| ||||
| ||||
| Synopsis | ||||
| Documentation | ||||
| isSgIntKeyedBidirectionalGraph :: Typeable a => SgNode a -> IO (Maybe (SgIntKeyedBidirectionalGraph ())) | ||||
| Attempts a dynamic cast of the given node to the type SgIntKeyedBidirectionalGraph. | ||||
| upSgIntKeyedBidirectionalGraph :: Typeable a => SgIntKeyedBidirectionalGraph a -> SgIntKeyedBidirectionalGraph () | ||||
| Performs an upcast of a SgIntKeyedBidirectionalGraph subtype to a SgIntKeyedBidirectionalGraph. | ||||
| newIntKeyedBidirectionalGraph :: String -> IO (SgIntKeyedBidirectionalGraph ()) | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::SgIntKeyedBidirectionalGraph of type void (::std::string) | ||||
| intKeyedBidirectionalGraphCheckDataMemberPointersIfInMemoryPool :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO () | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::checkDataMemberPointersIfInMemoryPool of type void () | ||||
| intKeyedBidirectionalGraphClassName :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO String | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::class_name of type ::std::string() | ||||
| intKeyedBidirectionalGraphGetChildIndex :: (Typeable a, Typeable b) => SgIntKeyedBidirectionalGraph a -> SgNode b -> IO CLong | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::getChildIndex of type long (class ::SgNode*) | ||||
| intKeyedBidirectionalGraphGetChildIndex2 :: (Typeable a, Typeable b) => SgIntKeyedBidirectionalGraph a -> SgNode b -> IO CSize | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::get_childIndex of type ::size_t(class ::SgNode*) | ||||
| intKeyedBidirectionalGraphGetNumberOfTraversalSuccessors :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO CSize | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::get_numberOfTraversalSuccessors of type ::size_t() | ||||
| intKeyedBidirectionalGraphGetTraversalSuccessorByIndex :: Typeable a => SgIntKeyedBidirectionalGraph a -> CSize -> IO (SgNode ()) | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::get_traversalSuccessorByIndex of type class ::SgNode*(::size_t) | ||||
| intKeyedBidirectionalGraphGetTraversalSuccessorContainer :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO [SgNode ()] | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::get_traversalSuccessorContainer of type class ::std::vector < SgNode * , allocator< SgNode * > > () | ||||
| intKeyedBidirectionalGraphGetTraversalSuccessorNamesContainer :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO [CString] | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::get_traversalSuccessorNamesContainer of type class ::std::vector < string , allocator< string > > () | ||||
| intKeyedBidirectionalGraphIsInMemoryPool :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO Bool | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::isInMemoryPool of type bool () | ||||
| intKeyedBidirectionalGraphMemoryUsage :: IO CSize | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::memoryUsage of type ::size_t() | ||||
| intKeyedBidirectionalGraphNumberOfNodes :: IO CSize | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::numberOfNodes of type ::size_t() | ||||
| intKeyedBidirectionalGraphSageClassName :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO String | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::sage_class_name of type const char *() | ||||
| intKeyedBidirectionalGraphVariantT :: Typeable a => SgIntKeyedBidirectionalGraph a -> IO VariantT | ||||
| Stub for ::SgIntKeyedBidirectionalGraph::variantT of type enum ::VariantT() | ||||
| Produced by Haddock version 2.4.2 |