This trait provides a keep function which will determine if a element T must be kept with regards to:
specialization of the IncludedExcluded trait for string separated tags
specialization of the IncludedExcluded trait for string separated tags
2 tags t1, t2 separated by a "," means that t1 OR t2 must be included (/excluded) 2 tags t1, t2 separated by a "&&" means that t1 AND t2 must be included (/excluded)
a trait for anything that can be sized
tags the next element
Stateful class to create unique names.
Stateful class to create unique names.
When the same name is asked for the second time, a unique int is attached to it
Hopcroft-Karp (https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm) algorithm for finding the maximum matching in a bipartite graph
This trait provides a keep function which will determine if a element T must be kept with regards to:
The element is kept if it is included and not excluded