bookshelfiterator.java

来自「Java实现的常用数据结构算法」· Java 代码 · 共 18 行

package Libarary;

public class BookShelfIterator implements Iterator {
	private BookShelf bookShelf;
	private int index;
	public BookShelfIterator(BookShelf shelf){
		this.bookShelf=shelf;
	}
	public boolean hasNext() {
		if(bookShelf.mark<bookShelf.last)
		return true;
		return false;
	}
	public Book next() {
		return bookShelf.getBookAt(bookShelf.mark);
	}
}