* Run detection on each chunk concurrently. * Add printer functionality. * Add logic for dedupe. * cleanup. * Moddify number of notifier workers. * Add comment. * move consts into fxn. * buffer resutls chan. * fix test. * address comments. * return an error from Finish. * fix test. * fix test. * linter. * check err. * address comments.
67 lines
1.3 KiB
Go
67 lines
1.3 KiB
Go
package common
|
|
|
|
import (
|
|
"bufio"
|
|
"bytes"
|
|
"crypto/rand"
|
|
"io"
|
|
"math/big"
|
|
"strings"
|
|
)
|
|
|
|
func AddStringSliceItem(item string, slice *[]string) {
|
|
for _, i := range *slice {
|
|
if i == item {
|
|
return
|
|
}
|
|
}
|
|
*slice = append(*slice, item)
|
|
}
|
|
|
|
func RemoveStringSliceItem(item string, slice *[]string) {
|
|
for i, listItem := range *slice {
|
|
if item == listItem {
|
|
(*slice)[i] = (*slice)[len(*slice)-1]
|
|
*slice = (*slice)[:len(*slice)-1]
|
|
}
|
|
}
|
|
}
|
|
|
|
func MinInt(a, b int) int {
|
|
if a < b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
func BytesEqual(a, b []byte, numBytes int) bool {
|
|
limit := MinInt(numBytes, MinInt(len(a), len(b))-1)
|
|
return bytes.Equal(a[:limit], b[:limit])
|
|
}
|
|
|
|
func ResponseContainsSubstring(reader io.ReadCloser, target string) (bool, error) {
|
|
scanner := bufio.NewScanner(reader)
|
|
for scanner.Scan() {
|
|
if strings.Contains(scanner.Text(), target) {
|
|
return true, nil
|
|
}
|
|
}
|
|
if err := scanner.Err(); err != nil {
|
|
return false, err
|
|
}
|
|
return false, nil
|
|
}
|
|
|
|
var letters = []rune("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789")
|
|
|
|
// RandomID returns a random string of the given length.
|
|
func RandomID(length int) string {
|
|
b := make([]rune, length)
|
|
for i := range b {
|
|
randInt, _ := rand.Int(rand.Reader, big.NewInt(int64(len(letters))))
|
|
b[i] = letters[randInt.Int64()]
|
|
}
|
|
|
|
return string(b)
|
|
}
|