This is the complete list of members for hal::NetlistTraversalDecorator, including all inherited members.

get_next_combinational_gates(const Net net, bool successors, const std::set< PinType > &forbidden_pins={}, std::unordered_map< const Net , std::set< Gate * >> *cache=nullptr) const	hal::NetlistTraversalDecorator
get_next_combinational_gates(const Gate gate, bool successors, const std::set< PinType > &forbidden_pins={}, std::unordered_map< const Net , std::set< Gate * >> *cache=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates(const Net net, bool successors, const std::function< bool(const Gate )> &target_gate_filter, bool continue_on_match=false, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates(const Gate gate, bool successors, const std::function< bool(const Gate )> &target_gate_filter, bool continue_on_match=false, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates_until(const Net net, bool successors, const std::function< bool(const Gate )> &target_gate_filter, bool continue_on_mismatch=false, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates_until(const Gate gate, bool successors, const std::function< bool(const Gate )> &target_gate_filter, bool continue_on_mismatch=false, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates_until_depth(const Net net, bool successors, u32 max_depth, const std::function< bool(const Gate )> &target_gate_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_matching_gates_until_depth(const Gate gate, bool successors, u32 max_depth, const std::function< bool(const Gate )> &target_gate_filter=nullptr) const	hal::NetlistTraversalDecorator
get_next_sequential_gates(const Net net, bool successors, const std::set< PinType > &forbidden_pins={}, std::unordered_map< const Net , std::set< Gate * >> *cache=nullptr) const	hal::NetlistTraversalDecorator
get_next_sequential_gates(const Gate gate, bool successors, const std::set< PinType > &forbidden_pins={}, std::unordered_map< const Net , std::set< Gate * >> *cache=nullptr) const	hal::NetlistTraversalDecorator
get_next_sequential_gates_map(bool successors, const std::set< PinType > &forbidden_pins) const	hal::NetlistTraversalDecorator
get_shortest_path(const Gate start_gate, const Gate end_gate, const PinDirection &direction, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
get_shortest_path_distance(const Gate start_gate, const Gate end_gate, const PinDirection &direction, const std::function< bool(const Endpoint , const u32 current_depth)> &exit_endpoint_filter=nullptr, const std::function< bool(const Endpoint , const u32 current_depth)> &entry_endpoint_filter=nullptr) const	hal::NetlistTraversalDecorator
NetlistTraversalDecorator(const Netlist &netlist)	hal::NetlistTraversalDecorator