1
package matchers
2

3
import (
4
	"fmt"
5

6
	"github.com/onsi/gomega/format"
7
	"github.com/onsi/gomega/matchers/internal/miter"
8
	"github.com/onsi/gomega/matchers/support/goraph/bipartitegraph"
9
)
10

11
type ContainElementsMatcher struct {
12
	Elements        []any
13
	missingElements []any
14
}
15

16
func (matcher *ContainElementsMatcher) Match(actual any) (success bool, err error) {
17
	if !isArrayOrSlice(actual) && !isMap(actual) && !miter.IsIter(actual) {
18
		return false, fmt.Errorf("ContainElements matcher expects an array/slice/map/iter.Seq/iter.Seq2.  Got:\n%s", format.Object(actual, 1))
19
	}
20

21
	matchers := matchers(matcher.Elements)
22
	bipartiteGraph, err := bipartitegraph.NewBipartiteGraph(valuesOf(actual), matchers, neighbours)
23
	if err != nil {
24
		return false, err
25
	}
26

27
	edges := bipartiteGraph.LargestMatching()
28
	if len(edges) == len(matchers) {
29
		return true, nil
30
	}
31

32
	_, missingMatchers := bipartiteGraph.FreeLeftRight(edges)
33
	matcher.missingElements = equalMatchersToElements(missingMatchers)
34

35
	return false, nil
36
}
37

38
func (matcher *ContainElementsMatcher) FailureMessage(actual any) (message string) {
39
	message = format.Message(actual, "to contain elements", presentable(matcher.Elements))
40
	return appendMissingElements(message, matcher.missingElements)
41
}
42

43
func (matcher *ContainElementsMatcher) NegatedFailureMessage(actual any) (message string) {
44
	return format.Message(actual, "not to contain elements", presentable(matcher.Elements))
45
}
46

47