package xianxinTable;import java.util.ArrayList;
import java.util.Iterator;import com.sun.java_cup.internal.internal_error;public class queue_self<E> implements Iterator<E> {// 定义一个简单的迭代器public iterator itertor(){return new iterator();}class iterator implements Iterator<E> {// 要迭代的长度private int size;// 当前迭代到达位置private int nowsize;iterator() {size = queue_self.this.length;nowsize = 1;}public boolean hasNext() {if (nowsize != size+1) {// TODO Auto-generated method stubreturn true;} else {return false;}}public E next() {// TODO Auto-generated method stubint page=nowsize;nowsize++;return queue_self.this.datalist.get(page-1);}public void remove() {// TODO Auto-generated method stub}}// 定义数组长度private int length;// 存放数组内容private ArrayList<E> datalist;// 队列头private int head;// 队列尾private int rear;// 队列初始化public queue_self() {datalist = new ArrayList<E>();this.length = 0;head = 0;rear = 0;}// 入队public boolean offer(E data) {if (true) {this.datalist.add(data);length++;return true;} else {return false;}}// 出队public E poll() {E e = null;if (length == 0) {return e;} else {e = this.datalist.get(head);this.datalist.remove(head);length--;return e;}}// 查看队首元素public E peek() {E e = null;if (length == 0) {return e;} else {e = this.datalist.get(head);return e;}}// 返回队列长度public int length() {return this.length;}public static void main(String[] args) {queue_self<Integer> q = new queue_self<Integer>();q.offer(2);q.offer(44);q.offer(66);q.poll();Iterator<Integer> it=q.itertor();while(it.hasNext()){System.out.println(it.next());}}public boolean hasNext() {// TODO Auto-generated method stubreturn false;}public E next() {// TODO Auto-generated method stubreturn null;}public void remove() {// TODO Auto-generated method stub}}

44
66