As long as the node count of the graph is the major factor in graph performance it's helpful to provide common facilities that can reduce the node count.
The filter_map combinator combines the functionality of doing a map to an Option<T> and then chaining that with filter_optional. In a future major revision change, filter_map could entirely replace filter_optional by passing the identity function.
As long as the node count of the graph is the major factor in graph performance it's helpful to provide common facilities that can reduce the node count.
The
filter_mapcombinator combines the functionality of doing amapto anOption<T>and then chaining that withfilter_optional. In a future major revision change,filter_mapcould entirely replacefilter_optionalby passing the identity function.