42 return [](
const T& ) {
return true; };
55template <
typename T>
auto hide_nodes(
const std::set<T>& nodes) {
56 return [nodes](
const T&
node) {
return nodes.find(
node) == nodes.
end(); };
69template <
typename T>
auto hide_diedges(
const std::set<std::pair<T, T>>& edges) {
71 [edges](
const T&
u,
const T&
v) {
return edges.find(std::make_pair(
u,
v)) == edges.
end(); };
Read-only map of maps of maps (view into a dict-of-dict-of-dict structure)
Definition coreviews.hpp:109
auto end() const
Get iterator to the end of the view.
Definition coreviews.hpp:61
auto hide_diedges(const std::set< std::pair< T, T > > &edges)
Create a filter that hides specified directed edges.
Definition filters.h:69
auto no_filter(const T &)
A predicate that always returns true (no filtering).
Definition filters.h:41
auto hide_nodes(const std::set< T > &nodes)
Create a filter that hides specified nodes.
Definition filters.h:55