Mercurial > hg > truffle
view graal/com.oracle.graal.graph/src/com/oracle/graal/graph/iterators/NodeIterable.java @ 15146:65efd2eeea1b
Remove AbstractNodeIterable, move its methods to default methods on NodeIterable.
This allows to remove a number of duplicated methods in NodeList
NodeClassIterable is also interface instead of an abstract class.
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Mon, 14 Apr 2014 16:31:13 +0200 |
parents | 360beb9b3c50 |
children | 1f130000d700 |
line wrap: on
line source
/* * Copyright (c) 2011, 2012, 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 com.oracle.graal.graph.iterators; import java.util.*; import com.oracle.graal.graph.*; public interface NodeIterable<T extends Node> extends Iterable<T> { default NodeIterable<T> until(final T u) { return new FilteredNodeIterable<>(this).until(u); } default NodeIterable<T> until(final Class<? extends T> clazz) { return new FilteredNodeIterable<>(this).until(clazz); } @SuppressWarnings("unchecked") default <F extends T> NodeIterable<F> filter(Class<F> clazz) { return (NodeIterable<F>) new FilteredNodeIterable<>(this).and(NodePredicates.isA(clazz)); } default NodeIterable<T> filterInterface(Class<?> iface) { return new FilteredNodeIterable<>(this).and(NodePredicates.isAInterface(iface)); } default FilteredNodeIterable<T> filter(NodePredicate predicate) { return new FilteredNodeIterable<>(this).and(predicate); } default FilteredNodeIterable<T> nonNull() { return new FilteredNodeIterable<>(this).and(NodePredicates.isNotNull()); } default NodeIterable<T> distinct() { return new FilteredNodeIterable<>(this).distinct(); } default List<T> snapshot() { ArrayList<T> list = new ArrayList<>(); snapshotTo(list); return list; } default void snapshotTo(Collection<T> to) { for (T n : this) { to.add(n); } } default T first() { Iterator<T> iterator = iterator(); if (iterator.hasNext()) { return iterator.next(); } return null; } default int count() { int count = 0; Iterator<T> iterator = iterator(); while (iterator.hasNext()) { iterator.next(); count++; } return count; } default boolean isEmpty() { return !iterator().hasNext(); } default boolean isNotEmpty() { return iterator().hasNext(); } default boolean contains(T node) { return this.filter(NodePredicates.equals(node)).isNotEmpty(); } }