0N/A/*
2362N/A * Copyright (c) 1998, 2008, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
4378N/A/*
4378N/A * This source code is provided to illustrate the usage of a given feature
4378N/A * or technique and has been deliberately simplified. Additional steps
4378N/A * required for a production-quality application, such as security checks,
4378N/A * input validation and proper error handling, might not be present in
4378N/A * this sample code.
4378N/A */
4378N/A
4378N/A
0N/Apackage com.sun.tools.example.debug.bdi;
0N/A
0N/Aimport com.sun.jdi.ThreadGroupReference;
0N/Aimport java.util.List;
0N/Aimport java.util.Stack;
0N/Aimport java.util.ArrayList;
0N/Aimport java.util.Iterator;
0N/A
0N/A/**
0N/A * Descend the tree of thread groups.
0N/A * @author Robert G. Field
0N/A */
28N/Apublic class ThreadGroupIterator implements Iterator<ThreadGroupReference> {
0N/A private final Stack<Iterator<ThreadGroupReference>> stack
0N/A = new Stack<Iterator<ThreadGroupReference>>();
0N/A
0N/A public ThreadGroupIterator(List<ThreadGroupReference> tgl) {
0N/A push(tgl);
0N/A }
0N/A
0N/A public ThreadGroupIterator(ThreadGroupReference tg) {
0N/A List<ThreadGroupReference> tgl = new ArrayList<ThreadGroupReference>();
0N/A tgl.add(tg);
0N/A push(tgl);
0N/A }
0N/A
0N/A/*
0N/A ThreadGroupIterator() {
0N/A this(Env.vm().topLevelThreadGroups());
0N/A }
0N/A*/
0N/A
28N/A private Iterator<ThreadGroupReference> top() {
28N/A return stack.peek();
0N/A }
0N/A
0N/A /**
0N/A * The invariant in this class is that the top iterator
0N/A * on the stack has more elements. If the stack is
0N/A * empty, there is no top. This method assures
0N/A * this invariant.
0N/A */
0N/A private void push(List<ThreadGroupReference> tgl) {
0N/A stack.push(tgl.iterator());
0N/A while (!stack.isEmpty() && !top().hasNext()) {
0N/A stack.pop();
0N/A }
0N/A }
0N/A
4123N/A @Override
0N/A public boolean hasNext() {
0N/A return !stack.isEmpty();
0N/A }
0N/A
4123N/A @Override
28N/A public ThreadGroupReference next() {
0N/A return nextThreadGroup();
0N/A }
0N/A
0N/A public ThreadGroupReference nextThreadGroup() {
28N/A ThreadGroupReference tg = top().next();
0N/A push(tg.threadGroups());
0N/A return tg;
0N/A }
0N/A
4123N/A @Override
0N/A public void remove() {
0N/A throw new UnsupportedOperationException();
0N/A }
0N/A
0N/A/*
0N/A static ThreadGroupReference find(String name) {
0N/A ThreadGroupIterator tgi = new ThreadGroupIterator();
0N/A while (tgi.hasNext()) {
0N/A ThreadGroupReference tg = tgi.nextThreadGroup();
0N/A if (tg.name().equals(name)) {
0N/A return tg;
0N/A }
0N/A }
0N/A return null;
0N/A }
0N/A*/
0N/A}