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 package org.graalvm.compiler.graph.test.matchers; 24 25 import org.hamcrest.Description; 26 import org.hamcrest.TypeSafeDiagnosingMatcher; 27 28 import org.graalvm.compiler.graph.iterators.NodeIterable; 29 30 public class NodeIterableCount extends TypeSafeDiagnosingMatcher<NodeIterable<?>> { 31 private int count; 32 33 public NodeIterableCount(int count) { 34 this.count = count; 35 } 36 37 @Override 38 public void describeTo(Description description) { 39 description.appendText("is a NodeIterable containing ").appendValue(count).appendText(" elements"); 40 } 41 42 public static NodeIterableCount hasCount(int count) { 43 return new NodeIterableCount(count); 44 } 45 46 @Override 47 protected boolean matchesSafely(NodeIterable<?> iterable, Description mismatchDescription) { 48 mismatchDescription.appendText("is a NodeIterable containing ").appendValue(iterable.count()).appendText(" elements"); 49 return iterable.count() == count; 50 } 51 }