abstract fun is_ok: Bool

core :: Iterator :: is_ok

Is there a current item ?

Property definitions

core $ Iterator :: is_ok 
	# Is there a current item ?
	fun is_ok: Bool is abstract
lib/core/collection/abstract_collection.nit:246,2--247,28

core $ ArraySetIterator :: is_ok 
	redef fun is_ok do return _iter.is_ok
lib/core/collection/array.nit:679,2--38

core $ IteratorDecorator :: is_ok 
	redef fun is_ok do return real.is_ok
lib/core/collection/abstract_collection.nit:294,2--37

core $ CachedIterator :: is_ok 
	redef fun is_ok do return current_item != null
lib/core/collection/abstract_collection.nit:339,2--47

core $ RefIterator :: is_ok 
	redef var is_ok = true
lib/core/collection/abstract_collection.nit:390,2--23

core $ MapKeysIterator :: is_ok 
	redef fun is_ok do return self.original_iterator.is_ok
lib/core/collection/abstract_collection.nit:815,2--55

core $ MapValuesIterator :: is_ok 
	redef fun is_ok do return self.original_iterator.is_ok
lib/core/collection/abstract_collection.nit:826,2--55

core $ IteratorRange :: is_ok 
	redef fun is_ok do return _item < _range.after
lib/core/collection/range.nit:197,2--47

core $ ReverseIteratorRange :: is_ok 
	redef fun is_ok do return _item >= _range.first
lib/core/collection/range.nit:213,2--48

core $ HashSetIterator :: is_ok 
	redef fun is_ok do return _node != null
lib/core/collection/hash_collection.nit:487,2--40

core $ FlatSubstringsIter :: is_ok 
	redef fun is_ok do return tgt != null
lib/core/text/flat.nit:32,2--38

cartesian $ CartesianIterator :: is_ok 
	redef fun is_ok do return ice.is_ok and icf.is_ok
lib/cartesian/cartesian.nit:146,2--50

combinations $ CartesianIterator :: is_ok 
	redef var is_ok = true
lib/combinations/combinations.nit:134,2--23

combinations $ CombinationIterator :: is_ok 
	redef var is_ok = true
lib/combinations/combinations.nit:333,2--23

dummy_array $ DummyIterator :: is_ok 
	redef fun is_ok: Bool
	do
		return _pos < _array.length
	end
lib/dummy_array/dummy_array.nit:102,2--105,4

for_abuse $ ReadFileForAbuserIterator :: is_ok 
	redef var is_ok = true
lib/for_abuse/for_abuse.nit:51,2--23

for_abuse $ SortAbuserIterator :: is_ok 
	redef fun is_ok do return i < array.length - 1
lib/for_abuse/for_abuse.nit:113,2--47

functional $ FunIter :: is_ok 
        redef fun is_ok
        do
                return my_iter.is_ok
        end
lib/functional/iter_extras.nit:250,9--253,11

pipeline $ Iterator2 :: is_ok 
	redef fun is_ok
	do
		var i = current_iterator
		if i == null then return false
		return i.is_ok
	end
lib/pipeline/pipeline.nit:201,2--206,4

pipeline $ NullSkipper :: is_ok 
	redef fun is_ok do
		skip_nulls
		return inner.is_ok
	end
lib/pipeline/pipeline.nit:272,2--275,4

pipeline $ PipeUniq :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:341,2--39

pipeline $ PipeSeqUniq :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:360,2--39

pipeline $ PipeJoin :: is_ok 
	redef fun is_ok
	do
		return source1.is_ok or source2.is_ok
	end
lib/pipeline/pipeline.nit:379,2--382,4

pipeline $ PipeAlternate :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:402,2--39

pipeline $ PipeSkip :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:435,2--39

pipeline $ PipeHead :: is_ok 
	redef fun is_ok do return length > 0 and source.is_ok
lib/pipeline/pipeline.nit:453,2--54

pipeline $ PipeSkipTail :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:482,2--39

pipeline $ PipeSelect :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:508,2--39

pipeline $ PipeMap :: is_ok 
	redef fun is_ok do return source.is_ok
lib/pipeline/pipeline.nit:528,2--39

graph $ ArcsIterator :: is_ok 
	redef fun is_ok do return sources_iterator.is_ok and targets_iterator.is_ok
lib/graph/digraph.nit:690,2--76

sqlite3 $ StatementIterator :: is_ok 
	redef var is_ok is noinit
lib/sqlite3/sqlite3.nit:291,2--26

nitcc_runtime $ DephIterator :: is_ok 
	redef fun is_ok do return not stack.is_empty
lib/nitcc_runtime/nitcc_runtime.nit:447,2--45

ordered_tree $ OrderedTreeIterator :: is_ok 
	redef fun is_ok do return not iterators.is_empty
lib/ordered_tree/ordered_tree.nit:306,2--49

core $ ArrayIterator :: is_ok 
	redef fun is_ok do return _index < _array.length
lib/core/collection/array.nit:564,2--49

core $ DowntoIteratorRange :: is_ok 
	redef fun is_ok do return _item >= _range.last
lib/core/collection/range.nit:230,2--47

core $ ListIterator :: is_ok 
	redef fun is_ok do return not _node == null
lib/core/collection/list.nit:277,2--44

core $ CircularArrayIterator :: is_ok 
	redef fun is_ok do return index < array.length
lib/core/collection/circular_array.nit:255,2--47

core $ RopeByteReverseIterator :: is_ok 
	redef fun is_ok do return pos >= 0
lib/core/text/ropes.nit:356,2--35

core $ RopeByteIterator :: is_ok 
	redef fun is_ok do return pos <= max
lib/core/text/ropes.nit:398,2--37

core $ RopeCharReverseIterator :: is_ok 
	redef fun is_ok do return pos >= 0
lib/core/text/ropes.nit:438,2--35

core $ RopeCharIterator :: is_ok 
	redef fun is_ok do return pos <= max
lib/core/text/ropes.nit:479,2--37

core $ ReverseRopeSubstrings :: is_ok 
	redef fun is_ok do return pos >= 0
lib/core/text/ropes.nit:536,2--35

core $ RopeSubstrings :: is_ok 
	redef fun is_ok do return pos <= max
lib/core/text/ropes.nit:608,2--37

core $ FlatStringCharReverseIterator :: is_ok 
	redef fun is_ok do return curr_pos >= 0
lib/core/text/flat.nit:742,2--40

core $ FlatStringCharIterator :: is_ok 
	redef fun is_ok do return curr_pos <= max
lib/core/text/flat.nit:763,2--42

core $ FlatStringByteReverseIterator :: is_ok 
	redef fun is_ok do return curr_pos >= target._first_byte
lib/core/text/flat.nit:802,2--57

core $ FlatStringByteIterator :: is_ok 
	redef fun is_ok do return curr_pos <= target.last_byte
lib/core/text/flat.nit:828,2--55

core $ FlatBufferByteReverseIterator :: is_ok 
	redef fun is_ok do return curr_pos >= 0
lib/core/text/flat.nit:1178,2--40

core $ FlatBufferByteIterator :: is_ok 
	redef fun is_ok do return curr_pos < target._byte_length
lib/core/text/flat.nit:1212,2--57

core $ FlatBufferCharReverseIterator :: is_ok 
	redef fun is_ok do return curr_pos >= 0
lib/core/text/flat.nit:1229,2--40

core $ FlatBufferCharIterator :: is_ok 
	redef fun is_ok do return curr_pos <= max
lib/core/text/flat.nit:1295,2--42

core $ BytesIterator :: is_ok 
	redef fun is_ok do return index < max
lib/core/bytes.nit:785,2--38

java $ JavaArrayIterator :: is_ok 
	redef fun is_ok do return index < array.length
lib/java/collections.nit:186,2--47

java $ JavaArrayReverseIterator :: is_ok 
	redef fun is_ok do return index >= 0
lib/java/collections.nit:201,2--37

core $ U16StringCharIterator :: is_ok 
	redef fun is_ok do return curr_pos < target.length
lib/core/text/u16_string.nit:196,2--51

core $ U16StringCharReverseIterator :: is_ok 
	redef fun is_ok do return curr_pos >= 0
lib/core/text/u16_string.nit:212,2--40

functional $ FlatMapIter :: is_ok 
        redef fun is_ok
        do
                return inner != null
        end
lib/functional/iter_extras.nit:327,9--330,11

functional $ OrderedIter :: is_ok 
        redef fun is_ok
        do
                return sorted_iter.is_ok
        end
lib/functional/iter_extras.nit:377,9--380,11

nitcc_runtime $ NProdIterator :: is_ok 
	redef fun is_ok do return index < prod.number_of_children
lib/nitcc_runtime/nitcc_runtime.nit:587,2--58

core $ ArrayReverseIterator :: is_ok 
	redef fun is_ok do return _index >= 0
lib/core/collection/array.nit:578,2--38

more_collections $ UnrolledIterator :: is_ok 
	redef fun is_ok do return index < list.length
lib/more_collections/more_collections.nit:666,2--46

mongodb $ MongoCursor :: is_ok 
	redef var is_ok = true
lib/mongodb/mongodb.nit:720,2--23
Nit standard library. Version .