be362ef8ed
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> |
||
|---|---|---|
| .. | ||
| filters | ||
| kernel | ||
| operatingsystem | ||
| parsers.go | ||
| parsers_test.go | ||