1/*
2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23package org.graalvm.compiler.graph.test.matchers;
24
25import org.hamcrest.Description;
26import org.hamcrest.TypeSafeDiagnosingMatcher;
27
28import org.graalvm.compiler.graph.Node;
29import org.graalvm.compiler.graph.iterators.NodeIterable;
30
31public class NodeIterableContains<T extends Node> extends TypeSafeDiagnosingMatcher<NodeIterable<T>> {
32    private T node;
33
34    public NodeIterableContains(T node) {
35        this.node = node;
36    }
37
38    @Override
39    public void describeTo(Description description) {
40        description.appendText("is a NodeIterable containing ").appendValue(node);
41    }
42
43    public static <T extends Node> NodeIterableContains<T> contains(T node) {
44        return new NodeIterableContains<>(node);
45    }
46
47    @Override
48    protected boolean matchesSafely(NodeIterable<T> iterable, Description mismatchDescription) {
49        mismatchDescription.appendText("is a NodeIterable that does not contain ").appendValue(node);
50        return iterable.contains(node);
51    }
52}
53