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  */
  23 
  24 
  25 package org.graalvm.compiler.graph.test.matchers;
  26 
  27 import org.hamcrest.Description;
  28 import org.hamcrest.TypeSafeDiagnosingMatcher;
  29 
  30 import org.graalvm.compiler.graph.Node;
  31 import org.graalvm.compiler.graph.iterators.NodeIterable;
  32 
  33 public class NodeIterableContains<T extends Node> extends TypeSafeDiagnosingMatcher<NodeIterable<T>> {
  34     private T node;
  35 
  36     public NodeIterableContains(T node) {
  37         this.node = node;
  38     }
  39 
  40     @Override
  41     public void describeTo(Description description) {
  42         description.appendText("is a NodeIterable containing ").appendValue(node);
  43     }
  44 
  45     public static <T extends Node> NodeIterableContains<T> contains(T node) {
  46         return new NodeIterableContains<>(node);
  47     }
  48 
  49     @Override
  50     protected boolean matchesSafely(NodeIterable<T> iterable, Description mismatchDescription) {
  51         mismatchDescription.appendText("is a NodeIterable that does not contain ").appendValue(node);
  52         return iterable.contains(node);
  53     }
  54 }