HaxeFoundation.haxe/std/python/HaxeIterator.hx

/*
 * Copyright (C)2005-2019 Haxe Foundation
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

package python;

import python.Exceptions.StopIteration;
import python.NativeIterator;

class HaxeIterator<T> {
	var it:NativeIteratorRaw<T>;
	var x:Null<T> = null;
	var has = false;
	var checked = false;

	public function new(it:NativeIteratorRaw<T>) {
		this.it = it;
	}

	public inline function next():T {
		if (!checked)
			hasNext();
		checked = false;
		return x;
	}

	public function hasNext():Bool {
		if (!checked) {
			try {
				x = it.__next__();
				has = true;
			} catch (s:StopIteration) {
				has = false;
				x = null;
			}
			checked = true;
		}
		return has;
	}
}