Arcs iterator

Introduced properties

init defaultinit(graph: Digraph[V])

graph :: ArcsIterator :: defaultinit

fun graph: Digraph[V]

graph :: ArcsIterator :: graph

The graph whose arcs are iterated over

protected fun graph=(graph: Digraph[V])

graph :: ArcsIterator :: graph=

The graph whose arcs are iterated over

Redefined properties

redef type SELF: ArcsIterator[V]

graph $ ArcsIterator :: SELF

Type of this instance, automatically specialized in every class

redef init init

graph $ ArcsIterator :: init

redef fun is_ok: Bool

graph $ ArcsIterator :: is_ok

Is there a current item ?

redef fun item: Array[V]

graph $ ArcsIterator :: item

The current item.

redef fun next

graph $ ArcsIterator :: next

Jump to the next item.

All properties

fun !=(other: nullable Object): Bool

core :: Object :: !=

Have self and other different values?

fun +(other: Iterator[E]): Iterator[E]

core :: Iterator :: +

Combine two iterators.

fun ==(other: nullable Object): Bool

core :: Object :: ==

Have self and other the same value?

type CLASS: Class[SELF]

core :: Object :: CLASS

The type of the class of self.

type SELF: Object

core :: Object :: SELF

Type of this instance, automatically specialized in every class

fun all(pred: Fun1[E, Bool]): Bool

core :: Iterator :: all

Checks if all elements respect a predicate

fun alternate(e: E): Iterator[E]

core :: Iterator :: alternate

Alternate each item with e.

fun any(pred: Fun1[E, Bool]): Bool

core :: Iterator :: any

Checks if at least one element respects a predicate

protected fun class_factory(name: String): CLASS

core :: Object :: class_factory

Implementation used by get_class to create the specific class.

fun class_name: String

core :: Object :: class_name

The class name of the object.

init defaultinit(graph: Digraph[V])

graph :: ArcsIterator :: defaultinit

init defaultinit

core :: Object :: defaultinit

init defaultinit

core :: Iterator :: defaultinit

fun enumerate: EnumerateIter[E]

core :: Iterator :: enumerate

Iterator that gives the current count and element as a pair

fun filter(pred: Fun1[E, Bool]): FilterIter[E]

core :: Iterator :: filter

Iterator that filters elements by a predicate

fun finish

core :: Iterator :: finish

Post-iteration hook.

fun flat_map(f: Fun1[E, Iterator[Object]]): FlatMapIter[E, Object]

core :: Iterator :: flat_map

Maps every element to a nested structure then flattens it

fun fold(acc: Object, f: Fun2[Object, E, Object]): Object

core :: Iterator :: fold

Folds an iterator from the left

fun fold1(f: Fun2[E, E, E]): E

core :: Iterator :: fold1

Folds and apply two element at a time

fun for_each(f: Proc1[E])

core :: Iterator :: for_each

Apply a mutation function over all elements

fun get_class: CLASS

core :: Object :: get_class

The meta-object representing the dynamic type of self.

fun graph: Digraph[V]

graph :: ArcsIterator :: graph

The graph whose arcs are iterated over

protected fun graph=(graph: Digraph[V])

graph :: ArcsIterator :: graph=

The graph whose arcs are iterated over

fun hash: Int

core :: Object :: hash

The hash code of the object.

fun head(length: Int): Iterator[E]

core :: Iterator :: head

Filter: keep only the first length items.

init init

core :: Object :: init

fun inspect: String

core :: Object :: inspect

Developer readable representation of self.

protected fun inspect_head: String

core :: Object :: inspect_head

Return "CLASSNAME:#OBJECTID".

abstract fun is_ok: Bool

core :: Iterator :: is_ok

Is there a current item ?

intern fun is_same_instance(other: nullable Object): Bool

core :: Object :: is_same_instance

Return true if self and other are the same instance (i.e. same identity).

fun is_same_serialized(other: nullable Object): Bool

core :: Object :: is_same_serialized

Is self the same as other in a serialization context?

intern fun is_same_type(other: Object): Bool

core :: Object :: is_same_type

Return true if self and other have the same dynamic type.

abstract fun item: E

core :: Iterator :: item

The current item.

fun iterator: Iterator[E]

core :: Iterator :: iterator

Iterate over self

fun map(f: Fun1[E, Object]): MapIter[E, Object]

core :: Iterator :: map

Applies a function to every elements

abstract fun next

core :: Iterator :: next

Jump to the next item.

fun next_by(step: Int)

core :: Iterator :: next_by

Jump to the next item step times.

intern fun object_id: Int

core :: Object :: object_id

An internal hash code for the object based on its identity.

fun order_by(f: Fun1[E, Comparable]): OrderedIter[E]

core :: Iterator :: order_by

Generates an Iterator whose elements are sorted by the function

fun output

core :: Object :: output

Display self on stdout (debug only).

intern fun output_class_name

core :: Object :: output_class_name

Display class name on stdout (debug only).

fun select(predicate: Function[E, Bool]): Iterator[E]

core :: Iterator :: select

Filter: reject items that does not meet some criteria.

fun seq_uniq: Iterator[E]

core :: Iterator :: seq_uniq

Filter: reject continuous sequences of duplicates

fun serialization_hash: Int

core :: Object :: serialization_hash

Hash value use for serialization

fun skip(item: E): Iterator[E]

core :: Iterator :: skip

Filter: reject a given item.

fun skip_head(length: Int): Iterator[E]

core :: Iterator :: skip_head

Filter: reject the first length items.

fun skip_tail(length: Int): Iterator[E]

core :: Iterator :: skip_tail

Filter: reject the last length items.

fun sort: Iterator[E]

core :: Iterator :: sort

Filter: sort with default_comparator.

fun sort_with(comparator: Comparator): Iterator[E]

core :: Iterator :: sort_with

Filter: sort with a given comparator.

fun start

core :: Iterator :: start

Pre-iteration hook.

intern fun sys: Sys

core :: Object :: sys

Return the global sys object, the only instance of the Sys class.

fun tail(length: Int): Iterator[E]

core :: Iterator :: tail

Filter: keep only the last length items.

fun to_a: Array[E]

core :: Iterator :: to_a

Interate on self and build an array

abstract fun to_jvalue(env: JniEnv): JValue

core :: Object :: to_jvalue

fun to_s: String

core :: Object :: to_s

User readable representation of self.

fun to_step(step: Int): Iterator[E]

core :: Iterator :: to_step

A decorator around self that advance self a given number of steps instead of one.

fun uniq: Iterator[E]

core :: Iterator :: uniq

Filter: reject duplicates.

Ancestors

interface Object

The root of the class hierarchy.

Parents

interface Iterator[E: nullable Object]

core :: Iterator

Iterators generate a series of elements, one at a time.

Class definitions

graph $ ArcsIterator

# Arcs iterator
class ArcsIterator[V: Object]
	super Iterator[Array[V]]

	# The graph whose arcs are iterated over
	var graph: Digraph[V]
	# Attributes
	#
	private var sources_iterator: Iterator[V] is noinit
	private var targets_iterator: Iterator[V] is noinit
	init
	do
		sources_iterator = graph.vertices_iterator
		if sources_iterator.is_ok then
			targets_iterator = graph.successors(sources_iterator.item).iterator
			if not targets_iterator.is_ok then update_iterators
		end
	end

	redef fun is_ok do return sources_iterator.is_ok and targets_iterator.is_ok

	redef fun item do return [sources_iterator.item, targets_iterator.item]

	redef fun next
	do
		targets_iterator.next
		update_iterators
	end

	private fun update_iterators
	do
		while not targets_iterator.is_ok and sources_iterator.is_ok
		do
			sources_iterator.next
			if sources_iterator.is_ok then
				targets_iterator = graph.successors(sources_iterator.item).iterator
			end
		end
	end
end

lib/graph/digraph.nit:671,1--710,3