The current item.

Require is_ok.

Property definitions

core $ Iterator :: item
	# The current item.
	# Require `is_ok`.
	fun item: E is abstract
lib/core/collection/abstract_collection.nit:207,2--209,24

core $ ArraySetIterator :: item
	redef fun item: E do return _iter.item
lib/core/collection/array.nit:683,2--39

core $ IteratorDecorator :: item
	redef fun item do return real.item
lib/core/collection/abstract_collection.nit:295,2--35

core $ CachedIterator :: item
	redef fun item do return current_item.as(not null)
lib/core/collection/abstract_collection.nit:337,2--51

core $ RefIterator :: item
	redef fun item do return _container.item
lib/core/collection/abstract_collection.nit:386,2--41

core $ MapKeysIterator :: item
	redef fun item do return self.original_iterator.key
lib/core/collection/abstract_collection.nit:817,2--52

core $ MapValuesIterator :: item
	redef fun item do return self.original_iterator.item
lib/core/collection/abstract_collection.nit:828,2--53

core $ IteratorRange :: item
	redef var item is noinit
lib/core/collection/range.nit:195,2--25

core $ ReverseIteratorRange :: item
	redef var item is noinit
lib/core/collection/range.nit:211,2--25

core $ HashSetIterator :: item
	redef fun item
	do
		assert is_ok
		return _node._key
	end
lib/core/collection/hash_collection.nit:489,2--493,4

core $ FlatSubstringsIter :: item
	redef fun item do
		assert is_ok
		return tgt.as(not null)
	end
lib/core/text/flat.nit:27,2--30,4

cartesian $ CartesianIterator :: item
	redef fun item do
		# We lazily create the pair here
		var res = item_cache
		if res == null then
			res = new Pair[E,F](ice.item, icf.item)
			item_cache = res
		end
		return res
	end
lib/cartesian/cartesian.nit:148,2--156,4

combinations $ CartesianIterator :: item
	redef fun item
	do
		var len = iterators.length
		var res = new Array[E].with_capacity(len)
		for i in [0..len[ do
			var it = iterators[i]
			res.add(it.item)
		end
		return res
	end
lib/combinations/combinations.nit:136,2--145,4

combinations $ CombinationIterator :: item
	redef fun item
	do
		var len = product.repeat
		var res = new Array[E].with_capacity(len)
		for i in [0..len[ do
			var it = iterators[i]
			res.add(it.item)
		end
		return res
	end
lib/combinations/combinations.nit:335,2--344,4

dummy_array $ DummyIterator :: item
	redef fun item: Int
	do
		assert is_ok
		return _array.value_at(_pos)
	end
lib/dummy_array/dummy_array.nit:96,2--100,4

for_abuse $ ReadFileForAbuserIterator :: item
	redef var item: FileReader is noinit
lib/for_abuse/for_abuse.nit:50,2--37

for_abuse $ SortAbuserIterator :: item
	redef fun item do return query.as(not null)
lib/for_abuse/for_abuse.nit:106,2--44

pipeline $ Iterator2 :: item
	redef fun item
	do
		var i = current_iterator
		assert i != null
		return i.item
	end
lib/pipeline/pipeline.nit:208,2--213,4

pipeline $ NullSkipper :: item
	redef fun item do
		skip_nulls
		return inner.item.as(E)
	end
lib/pipeline/pipeline.nit:277,2--280,4

pipeline $ PipeUniq :: item
	redef fun item do return source.item
lib/pipeline/pipeline.nit:343,2--37

pipeline $ PipeSeqUniq :: item
	redef fun item do return source.item
lib/pipeline/pipeline.nit:362,2--37

pipeline $ PipeJoin :: item
	redef fun item
	do
		if source1.is_ok then return source1.item else return source2.item
	end
lib/pipeline/pipeline.nit:384,2--387,4

pipeline $ PipeAlternate :: item
	redef fun item
	do
		if odd then
			return source.item
		else
			return odd_item
		end
	end
lib/pipeline/pipeline.nit:404,2--411,4

pipeline $ PipeSkip :: item
	redef fun item do return source.item
lib/pipeline/pipeline.nit:437,2--37

pipeline $ PipeHead :: item
	redef fun item do return source.item
lib/pipeline/pipeline.nit:455,2--37

pipeline $ PipeSkipTail :: item
	redef fun item do return lasts.first
lib/pipeline/pipeline.nit:484,2--37

pipeline $ PipeSelect :: item
	redef fun item do return source.item
lib/pipeline/pipeline.nit:510,2--37

pipeline $ PipeMap :: item
	redef fun item do
		if item_cached then return item_cache
		item_cache = function.apply(source.item)
		item_cached = true
		return item_cache
	end
lib/pipeline/pipeline.nit:530,2--535,4

graph $ ArcsIterator :: item
	redef fun item do return [sources_iterator.item, targets_iterator.item]
lib/graph/digraph.nit:692,2--72

sqlite3 $ StatementIterator :: item
	redef var item: StatementRow is noinit
lib/sqlite3/sqlite3.nit:289,2--39

nitcc_runtime $ DephIterator :: item
	redef fun item do return stack.last.item.as(not null)
lib/nitcc_runtime/nitcc_runtime.nit:448,2--54

ordered_tree $ OrderedTreeIterator :: item
	redef fun item do
		assert is_ok
		return iterators.last.item
	end
lib/ordered_tree/ordered_tree.nit:308,2--311,4

core $ ArrayIterator :: item
	redef fun item do return _array[_index]
lib/core/collection/array.nit:560,2--40

core $ DowntoIteratorRange :: item
	redef var item is noinit
lib/core/collection/range.nit:227,2--25

core $ ListIterator :: item
	redef fun item do return _node.as(not null).item
lib/core/collection/list.nit:272,2--49

core $ CircularArrayIterator :: item
	redef fun item do return array[index]
lib/core/collection/circular_array.nit:256,2--38

core $ RopeByteReverseIterator :: item
	redef fun item do return ns[pns]
lib/core/text/ropes.nit:358,2--33

core $ RopeByteIterator :: item
	redef fun item do return ns[pns]
lib/core/text/ropes.nit:396,2--33

core $ RopeCharReverseIterator :: item
	redef fun item do return ns[pns]
lib/core/text/ropes.nit:440,2--33

core $ RopeCharIterator :: item
	redef fun item do return str[pns]
lib/core/text/ropes.nit:477,2--34

core $ ReverseRopeSubstrings :: item
	redef fun item do return str
lib/core/text/ropes.nit:532,2--29

core $ RopeSubstrings :: item
	redef fun item do return str
lib/core/text/ropes.nit:606,2--29

core $ FlatStringCharReverseIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/flat.nit:744,2--42

core $ FlatStringCharIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/flat.nit:765,2--42

core $ FlatStringByteReverseIterator :: item
	redef fun item do return target_items[curr_pos]
lib/core/text/flat.nit:804,2--48

core $ FlatStringByteIterator :: item
	redef fun item do return target_items[curr_pos]
lib/core/text/flat.nit:830,2--48

core $ FlatBufferByteReverseIterator :: item
	redef fun item do return target_items[curr_pos]
lib/core/text/flat.nit:1180,2--48

core $ FlatBufferByteIterator :: item
	redef fun item do return target_items[curr_pos]
lib/core/text/flat.nit:1214,2--48

core $ FlatBufferCharReverseIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/flat.nit:1231,2--42

core $ FlatBufferCharIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/flat.nit:1297,2--42

core $ BytesIterator :: item
	redef fun item do return tgt[index]
lib/core/bytes.nit:789,2--36

java $ JavaArrayIterator :: item
	redef fun item do return array[index]
lib/java/collections.nit:184,2--38

java $ JavaArrayReverseIterator :: item
	redef fun item do return array[index]
lib/java/collections.nit:199,2--38

core $ U16StringCharIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/u16_string.nit:198,2--42

core $ U16StringCharReverseIterator :: item
	redef fun item do return target[curr_pos]
lib/core/text/u16_string.nit:214,2--42

functional $ MapIter :: item
        redef fun item
        do
                return f.call(my_iter.item)
        end
lib/functional/iter_extras.nit:261,9--264,11

functional $ EnumerateIter :: item
        redef fun item
        do
               return new Pair[Int,E](0, my_iter.item)
        end
lib/functional/iter_extras.nit:273,9--276,11

functional $ FilterIter :: item
        redef fun item
        do
                assert is_ok
                return my_iter.item
        end
lib/functional/iter_extras.nit:289,9--293,11

functional $ FlatMapIter :: item
        redef fun item
        do
                return inner.as(not null).item
        end
lib/functional/iter_extras.nit:322,9--325,11

functional $ OrderedIter :: item
        redef fun item
        do
                return sorted_iter.item
        end
lib/functional/iter_extras.nit:372,9--375,11

nitcc_runtime $ NProdIterator :: item
	redef fun item do return prod.child(index)
lib/nitcc_runtime/nitcc_runtime.nit:589,2--43

more_collections $ UnrolledIterator :: item
	redef fun item do return node.items[index_in_node]
lib/more_collections/more_collections.nit:664,2--51

mongodb $ MongoCursor :: item
	redef fun item do
		return new JsonObject.from_bson(new BSON(native.current))
	end
lib/mongodb/mongodb.nit:724,2--726,4