Function listIntersection

signals_test.go:227–239

Return the intersection of the two lists: the elements that are present in both lists. The notion of presence is not with '=' but with string.Contains(l2, l1) FIXME this does not enforce ordering. We might want to support both.

(lines1, lines2 []string)

// The notion of presence is not with '=' but with string.Contains(l2, l1)
// FIXME this does not enforce ordering. We might want to support both.
func listIntersection(lines1, lines2 []string) []string {
	intersection := []string{}
	for _, l1 := range lines1 {
		for _, l2 := range lines2 {
			if strings.Contains(l2, l1) {
				intersection = append(intersection, l1)
				break
			}
		}
	}

	return intersection
}