From f1e1d26b80c3826885d849eb7a77cf3f96b6a699 Mon Sep 17 00:00:00 2001 From: Joe Elliott <number101010@gmail.com> Date: Sat, 16 Nov 2024 09:36:38 -0500 Subject: [PATCH] lint Signed-off-by: Joe Elliott <number101010@gmail.com> --- pkg/regexp/regexp.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pkg/regexp/regexp.go b/pkg/regexp/regexp.go index 76bd7fb05f8..32a40f5fdb1 100644 --- a/pkg/regexp/regexp.go +++ b/pkg/regexp/regexp.go @@ -116,5 +116,5 @@ func shouldMemoize(m *labels.FastRegexMatcher) bool { len(cheat.setMatches) == 0 && // setMatches definitively reject or accept. if len != 0 the regex will never be executed, but perhaps if there are a very large # of setMatches we prefer memoizing anyway? cheat.prefix == "" && // prefix and suffix _do not_ prevent the regex from executing, but they are quick to evaluate and tend to nicely filter down. cheat.suffix == "" // perhaps a length requirement would be an improvement? i.e. require a prefix or suffix of at least 3 chars? - //len(cheat.contains) == 0 // in testing, it was faster to memoize with a contains filter. perhaps if the filters are long enough we don't memoize? + // len(cheat.contains) == 0 // in testing, it was faster to memoize with a contains filter. perhaps if the filters are long enough we don't memoize? }