93d1dd8036
Improves the current filtering implementation complixity. Currently, the best case is O(N) and worst case O(N^2) for key-value filtering. In the new implementation, the best case is O(1) and worst case O(N), again for key-value filtering. Signed-off-by: David Calavera <david.calavera@gmail.com> |
||
|---|---|---|
| .. | ||
| container | ||
| local | ||
| network | ||
| volume | ||
| router.go | ||