abstract fun iterator: Iterator[E]

core :: Collection :: iterator

Get a new iterator on the collection.

Property definitions

core $ Collection :: iterator 
	# Get a new iterator on the collection.
	fun iterator: Iterator[E] is abstract
lib/core/collection/abstract_collection.nit:60,2--61,38

core $ SequenceRead :: iterator 
	redef fun iterator: IndexedIterator[E] is abstract
lib/core/collection/abstract_collection.nit:1035,2--51

core $ Range :: iterator 
	redef fun iterator do return new IteratorRange[E](self)
lib/core/collection/range.nit:50,2--56

pthreads $ ConcurrentCollection :: iterator 
	redef fun iterator
	do
		mutex.lock
		var r = real_collection.iterator
		mutex.unlock
		return r
	end
lib/pthreads/concurrent_collections.nit:132,2--138,4

cartesian $ Cartesian :: iterator 
	redef fun iterator do return new CartesianIterator[E,F](self)
lib/cartesian/cartesian.nit:118,2--62

combinations $ CartesianCollection :: iterator 
	redef fun iterator do return new CartesianIterator[E](self)
lib/combinations/combinations.nit:115,2--60

combinations $ CombinationCollection :: iterator 
	redef fun iterator do
		return new CombinationIterator[E](self)
	end
lib/combinations/combinations.nit:308,2--310,4

nitcc_runtime $ DephCollection :: iterator 
	redef fun iterator do return new DephIterator([node].iterator)
lib/nitcc_runtime/nitcc_runtime.nit:435,2--63

core $ Ref :: iterator 
	redef fun iterator do return new RefIterator[E](self)
lib/core/collection/abstract_collection.nit:377,2--54

core $ AbstractArrayRead :: iterator 
	redef fun iterator: IndexedIterator[E] do
		var res = _free_iterator
		if res == null then return new ArrayIterator[E](self)
		res._index = 0
		_free_iterator = null
		return res
	end
lib/core/collection/array.nit:140,2--146,4

core $ ArrayMapKeys :: iterator 
	redef fun iterator do return new MapKeysIterator[K, E](self.map.iterator)
lib/core/collection/array.nit:812,2--74

core $ ArrayMapValues :: iterator 
	redef fun iterator do return new MapValuesIterator[K, E](self.map.iterator)
lib/core/collection/array.nit:829,2--76

core $ HashMapKeys :: iterator 
	redef fun iterator do return new MapKeysIterator[K, V](self.map.iterator)
lib/core/collection/hash_collection.nit:297,2--74

core $ HashMapValues :: iterator 
	redef fun iterator do return new MapValuesIterator[K, V](self.map.iterator)
lib/core/collection/hash_collection.nit:346,2--76

core $ StringCharView :: iterator 
	redef fun iterator: IndexedIterator[Char] do return self.iterator_from(0)
lib/core/text/abstract_text.nit:1458,2--74

core $ StringByteView :: iterator 
	redef fun iterator do return self.iterator_from(0)
lib/core/text/abstract_text.nit:1476,2--51

nitcc_runtime $ NProdChildren :: iterator 
	redef fun iterator do return new NProdIterator(prod)
lib/nitcc_runtime/nitcc_runtime.nit:577,2--53

ordered_tree $ OrderedTree :: iterator 
	#     var tree = new OrderedTree[Int]
	#     tree.add_all(null, [1, 2])
	#     tree.add_all(1, [11, 12])
	#     tree.add_all(11, [111, 112])
	#     tree.add_all(12, [121, 122])
	#     tree.add_all(2, [21, 22])
	#     var order = [1, 11, 111, 112, 12, 121, 122, 2, 21, 22]
	#     assert tree.iterator.to_a == order
	redef fun iterator do return new OrderedTreeIterator[E](self)
lib/ordered_tree/ordered_tree.nit:235,2--243,62

java $ AbstractJavaArray :: iterator 
	redef fun iterator do return new JavaArrayIterator[E](self)
lib/java/collections.nit:44,2--60

poset $ POSet :: iterator 
	redef fun iterator do return elements.keys.iterator
lib/poset/poset.nit:84,2--52

core $ ProxyQueue :: iterator 
	redef fun iterator do return seq.iterator
lib/core/queue.nit:146,2--42

core $ RandQueue :: iterator 
	redef fun iterator do return seq.iterator
lib/core/queue.nit:204,2--42

core $ MinHeap :: iterator 
	redef fun iterator do return items.iterator
lib/core/queue.nit:240,2--44

core $ DisjointSet :: iterator 
	redef fun iterator do return nodes.keys.iterator
lib/core/collection/union_find.nit:123,2--49

geometry $ QuadTree :: iterator 
	redef fun iterator
	do
		if is_leaf then return data.iterator

		assert children.length >= 4
		return data.iterator + children[0].iterator + children[1].iterator + children[2].iterator + children[3].iterator
	end
lib/geometry/quadtree.nit:181,2--187,4

neo4j $ SequentialNodeCollection :: iterator 
	redef fun iterator do return new NullSkipper[NeoNode](self.nodes.iterator)
lib/neo4j/graph/sequential_id.nit:57,2--75

core $ ArraySet :: iterator 
	redef fun iterator do return new ArraySetIterator[E](_array.iterator)
lib/core/collection/array.nit:624,2--70

core $ List :: iterator 
	redef fun iterator: ListIterator[E] do return new ListIterator[E](self)
lib/core/collection/list.nit:196,2--72

core $ CircularArray :: iterator 
	redef fun iterator do return new CircularArrayIterator[E](self)
lib/core/collection/circular_array.nit:246,2--64

more_collections $ UnrolledList :: iterator 
	redef fun iterator do return new UnrolledIterator[E](self)
lib/more_collections/more_collections.nit:602,2--59

dom $ XMLEntities :: iterator 
	redef fun iterator do return entities.iterator
lib/dom/xml_entities.nit:97,2--47

dummy_array $ DummyArray :: iterator 
	redef fun iterator: DummyIterator
	do
		return new DummyIterator(self)
	end
lib/dummy_array/dummy_array.nit:72,2--75,4

core $ HashSet :: iterator 
	redef fun iterator do return new HashSetIterator[E](self)
lib/core/collection/hash_collection.nit:463,2--58

core $ Bytes :: iterator 
	redef fun iterator do return new BytesIterator.with_buffer(self)
lib/core/bytes.nit:618,2--65
Nit standard library. Version .