blob: 51d63ff387b55062c7d36acd0fb3b8fe80702930 [file] [log] [blame]
/*
* Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.compiler.graph.test.matchers;
import org.hamcrest.Description;
import org.hamcrest.TypeSafeDiagnosingMatcher;
import org.graalvm.compiler.graph.iterators.NodeIterable;
public class NodeIterableCount extends TypeSafeDiagnosingMatcher<NodeIterable<?>> {
private int count;
public NodeIterableCount(int count) {
this.count = count;
}
@Override
public void describeTo(Description description) {
description.appendText("is a NodeIterable containing ").appendValue(count).appendText(" elements");
}
public static NodeIterableCount hasCount(int count) {
return new NodeIterableCount(count);
}
@Override
protected boolean matchesSafely(NodeIterable<?> iterable, Description mismatchDescription) {
mismatchDescription.appendText("is a NodeIterable containing ").appendValue(iterable.count()).appendText(" elements");
return iterable.count() == count;
}
}