| ||||
| ||||
| Synopsis | ||||
| Documentation | ||||
| isSgStringKeyedBidirectionalGraph :: Typeable a => SgNode a -> IO (Maybe (SgStringKeyedBidirectionalGraph ())) | ||||
| Attempts a dynamic cast of the given node to the type SgStringKeyedBidirectionalGraph. | ||||
| upSgStringKeyedBidirectionalGraph :: Typeable a => SgStringKeyedBidirectionalGraph a -> SgStringKeyedBidirectionalGraph () | ||||
| Performs an upcast of a SgStringKeyedBidirectionalGraph subtype to a SgStringKeyedBidirectionalGraph. | ||||
| newStringKeyedBidirectionalGraph :: String -> IO (SgStringKeyedBidirectionalGraph ()) | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::SgStringKeyedBidirectionalGraph of type void (::std::string) | ||||
| stringKeyedBidirectionalGraphCheckDataMemberPointersIfInMemoryPool :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO () | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::checkDataMemberPointersIfInMemoryPool of type void () | ||||
| stringKeyedBidirectionalGraphClassName :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO String | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::class_name of type ::std::string() | ||||
| stringKeyedBidirectionalGraphGetChildIndex :: (Typeable a, Typeable b) => SgStringKeyedBidirectionalGraph a -> SgNode b -> IO CLong | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::getChildIndex of type long (class ::SgNode*) | ||||
| stringKeyedBidirectionalGraphGetChildIndex2 :: (Typeable a, Typeable b) => SgStringKeyedBidirectionalGraph a -> SgNode b -> IO CSize | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::get_childIndex of type ::size_t(class ::SgNode*) | ||||
| stringKeyedBidirectionalGraphGetNumberOfTraversalSuccessors :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO CSize | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::get_numberOfTraversalSuccessors of type ::size_t() | ||||
| stringKeyedBidirectionalGraphGetTraversalSuccessorByIndex :: Typeable a => SgStringKeyedBidirectionalGraph a -> CSize -> IO (SgNode ()) | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::get_traversalSuccessorByIndex of type class ::SgNode*(::size_t) | ||||
| stringKeyedBidirectionalGraphGetTraversalSuccessorContainer :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO [SgNode ()] | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::get_traversalSuccessorContainer of type class ::std::vector < SgNode * , allocator< SgNode * > > () | ||||
| stringKeyedBidirectionalGraphGetTraversalSuccessorNamesContainer :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO [CString] | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::get_traversalSuccessorNamesContainer of type class ::std::vector < string , allocator< string > > () | ||||
| stringKeyedBidirectionalGraphIsInMemoryPool :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO Bool | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::isInMemoryPool of type bool () | ||||
| stringKeyedBidirectionalGraphMemoryUsage :: IO CSize | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::memoryUsage of type ::size_t() | ||||
| stringKeyedBidirectionalGraphNumberOfNodes :: IO CSize | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::numberOfNodes of type ::size_t() | ||||
| stringKeyedBidirectionalGraphSageClassName :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO String | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::sage_class_name of type const char *() | ||||
| stringKeyedBidirectionalGraphVariantT :: Typeable a => SgStringKeyedBidirectionalGraph a -> IO VariantT | ||||
| Stub for ::SgStringKeyedBidirectionalGraph::variantT of type enum ::VariantT() | ||||
| Produced by Haddock version 2.4.2 |