有名内部类

第31行到第57行定义了一个名为的StepThrough内部类。

public class StackOfInts {

	private int[] stack;
	private int next = 0; // index of last item in stack + 1

	public StackOfInts(int size) {
		// create an array large enough to hold the stack
		stack = new int[size];
	}

	public void push(int on) {
		if (next < stack.length)
			stack[next++] = on;
	}

	public boolean isEmpty() {
		return (next == 0);
	}

	public int pop() {
		if (!isEmpty())
			return stack[--next]; // top item on stack
		else
			return 0;
	}

	public int getStackSize() {
		return next;
	}

	private class StepThrough {
		// start stepping through at i=0
		private int i = 0;

		// increment index
		public void increment() {
			if (i < stack.length)
				i++;
		}

		// retrieve current element
		public int current() {
			return stack[i];
		}

		// last element on stack?
		public boolean isLast() {
			if (i == getStackSize() - 1)
				return true;
			else
				return false;
		}
	}

	public StepThrough stepThrough() {
		return new StepThrough();
	}

	public static void main(String[] args) {

		// instantiate outer class as "stackOne"
		StackOfInts stackOne = new StackOfInts(15);

		// populate stackOne
		for (int j = 0; j < 15; j++) {
			stackOne.push(2 * j);
		}

		// instantiate inner class as "iterator"
		StepThrough iterator = stackOne.stepThrough();

		// print out stackOne[i], one per line
		while (!iterator.isLast()) {
			System.out.print(iterator.current() + " ");
			iterator.increment();
		}
		System.out.println();

	}

}

原文: http://www.java-samples.com/showtutorial.php?tutorialid=656

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值