Resizable one dimension array of objects.

Arrays have a literal representation.

var a = [12, 32, 8]
# is equivalent with:
var b = new Array[Int]
b.push(12)
b.push(32)
b.push(8)
assert a == b

Introduced properties

fun *(repeat: Int): Array[E]

core :: Array :: *

Repetition of arrays.
fun +(other: Array[E]): Array[E]

core :: Array :: +

Concatenation of arrays.
init filled_with(value: E, count: Int)

core :: Array :: filled_with

Create an array of count elements
init from(items: Collection[E])

core :: Array :: from

Create an array from a collection.
fun mutex: Mutex

core :: Array :: mutex

protected fun mutex=(mutex: Mutex)

core :: Array :: mutex=

fun sort_fa: ForAbuser[CompareQuery[E]]

core :: Array :: sort_fa

Sort an array through a for abuse.
fun sort_with(f: Fun1[E, Comparable])

core :: Array :: sort_with

Sorts an array with a function.
init with_capacity(cap: Int)

core :: Array :: with_capacity

Create an empty array with a given capacity.
init with_items(objects: E...)

core :: Array :: with_items

Create an array with some objects.
init with_native(nat: NativeArray[E], size: Int)

core :: Array :: with_native

Create a array filled with a given native array.

Redefined properties

redef fun ==(o: nullable Object): Bool

core $ Array :: ==

Have self and other the same value?
redef fun ==(o: nullable Object): Bool

pthreads :: redef_collections $ Array :: ==

Have self and other the same value?
redef type CONCURRENT: ConcurrentArray[E]

pthreads :: concurrent_collections $ Array :: CONCURRENT

Type of the concurrent variant of this collection
redef type SELF: Array[E]

core $ Array :: SELF

Type of this instance, automatically specialized in every class
redef fun [](index: Int): E

core $ Array :: []

Return the index-th element of the sequence.
redef fun [](index: Int): E

pthreads :: redef_collections $ Array :: []

Return the index-th element of the sequence.
redef fun []=(index: Int, item: E)

core $ Array :: []=

Set the item at index.
redef fun []=(index: Int, e: E)

pthreads :: redef_collections $ Array :: []=

Set the item at index.
redef fun add(item: E)

core $ Array :: add

Add item to this collection.
redef fun add(e: E)

pthreads :: redef_collections $ Array :: add

Add item to this collection.
redef fun add_all(items: Collection[E])

core $ Array :: add_all

Slight optimization for arrays
redef fun add_to_bundle(bundle: NativeBundle, key: JavaString)

android :: bundle $ Array :: add_to_bundle

Called by []= to dynamically choose the appropriate method according
redef fun clone: SELF

core $ Array :: clone

Shallow clone of self
redef fun copy_to(start: Int, len: Int, dest: AbstractArray[E], new_start: Int)

core $ Array :: copy_to

Copy a portion of self to an other array.
redef fun enlarge(cap: Int)

core $ Array :: enlarge

Force the capacity to be at least cap.
redef fun enlarge(cap: Int)

pthreads :: redef_collections $ Array :: enlarge

Force the capacity to be at least cap.
redef init init

core $ Array :: init

Create an empty array.
redef fun insert_all(from: Collection[E], pos: Int)

pthreads :: redef_collections $ Array :: insert_all

Insert all elements at a given position, following elements are shifted.
redef fun plain_to_s: String

core :: flat $ Array :: plain_to_s

Fast implementation
redef fun remove_at(index: Int)

pthreads :: redef_collections $ Array :: remove_at

Remove the item at index and shift all following elements
redef fun shift: E

pthreads :: redef_collections $ Array :: shift

Remove the first item.
redef fun swap_at(a: Int, b: Int)

pthreads :: redef_collections $ Array :: swap_at

Invert two elements in the array
redef fun to_concurrent: CONCURRENT

pthreads :: concurrent_collections $ Array :: to_concurrent

Wraps self in a thread-safe collection
redef fun to_s: String

array_debug :: array_debug $ Array :: to_s

User readable representation of self.
redef fun unshift(e: E)

pthreads :: redef_collections $ Array :: unshift

Add an item before the first one.

All properties

fun !=(other: nullable Object): Bool

core :: Object :: !=

Have self and other different values?
fun *(repeat: Int): Array[E]

core :: Array :: *

Repetition of arrays.
fun +(other: Array[E]): Array[E]

core :: Array :: +

Concatenation of arrays.
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 CONCURRENT: ConcurrentCollection[E]

core :: Collection :: CONCURRENT

Type of the concurrent variant of this collection
type SELF: Object

core :: Object :: SELF

Type of this instance, automatically specialized in every class
abstract fun [](index: Int): E

core :: SequenceRead :: []

Return the index-th element of the sequence.
abstract fun []=(index: Int, item: E)

core :: Sequence :: []=

Set the item at index.
protected fun accept_json_serializer(v: JsonSerializer)

serialization :: Serializable :: accept_json_serializer

Refinable service to customize the serialization of this class to JSON
protected fun accept_msgpack_attribute_counter(v: AttributeCounter)

serialization :: Serializable :: accept_msgpack_attribute_counter

Hook to customize the behavior of the AttributeCounter
protected fun accept_msgpack_serializer(v: MsgPackSerializer)

serialization :: Serializable :: accept_msgpack_serializer

Hook to customize the serialization of this class to MessagePack
abstract fun add(item: E)

core :: SimpleCollection :: add

Add item to this collection.
fun add_all(coll: Collection[E])

core :: SimpleCollection :: add_all

Add each item of coll.
protected fun add_to_bundle(bundle: NativeBundle, key: JavaString)

serialization :: Serializable :: add_to_bundle

Called by []= to dynamically choose the appropriate method according
fun append(coll: Collection[E])

core :: Sequence :: append

Add each item of coll after the last.
fun as_fifo: Queue[E]

core :: Sequence :: as_fifo

Return a FIFO proxy queue where result.take is shift.
fun as_lifo: Queue[E]

core :: Sequence :: as_lifo

Return a LIFO proxy queue (stack) where result.take is pop.
fun as_random: Queue[E]

core :: SimpleCollection :: as_random

Return a random proxy queue where result.take is random.
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.
abstract fun clear

core :: RemovableCollection :: clear

Remove all items
abstract fun clone: SELF

core :: Cloneable :: clone

Duplicate self
fun combinations(r: Int): Collection[SequenceRead[E]]

core :: Collection :: combinations

All r-length combinations on self (in same order) without repeated elements.
fun combinations_with_replacement(r: Int): Collection[SequenceRead[E]]

core :: Collection :: combinations_with_replacement

All r-length combination on self (in same order) with repeated elements.
fun copy_to(start: Int, len: Int, dest: AbstractArray[E], new_start: Int)

core :: AbstractArrayRead :: copy_to

Copy a portion of self to an other array.
fun core_serialize_to(serializer: Serializer)

serialization :: Serializable :: core_serialize_to

Actual serialization of self to serializer
fun count(item: nullable Object): Int

core :: Collection :: count

How many occurrences of item are in the collection?
abstract fun enlarge(cap: Int)

core :: AbstractArray :: enlarge

Force the capacity to be at least cap.
init filled_with(value: E, count: Int)

core :: Array :: filled_with

Create an array of count elements
fun first: E

core :: Collection :: first

Return the first item of the collection
fun first=(item: E)

core :: Sequence :: first=

Set the first item.
init from(items: Collection[E])

core :: Array :: from

Create an array from a collection.
init from_deserializer(deserializer: Deserializer)

serialization :: Serializable :: from_deserializer

Create an instance of this class from the deserializer
fun get_class: CLASS

core :: Object :: get_class

The meta-object representing the dynamic type of self.
fun get_or_default(index: Int, default: E): E

core :: SequenceRead :: get_or_default

Try to get an element, return default if the index is invalid.
fun get_or_null(index: Int): nullable E

core :: SequenceRead :: get_or_null

Try to get an element, return null if the index is invalid.
fun has(item: nullable Object): Bool

core :: Collection :: has

Is item in the collection ?
fun has_all(other: Collection[nullable Object]): Bool

core :: Collection :: has_all

Does the collection contain at least each element of other?
fun has_any(other: Collection[nullable Object]): Bool

core :: Collection :: has_any

Does the collection contain at least one element of other?
fun has_exactly(other: Collection[nullable Object]): Bool

core :: Collection :: has_exactly

Does the collection contain exactly all the elements of other?
fun has_only(item: nullable Object): Bool

core :: Collection :: has_only

Is the collection contain only item?
fun hash: Int

core :: Object :: hash

The hash code of the object.
fun index_of(item: nullable Object): Int

core :: SequenceRead :: index_of

The index of the first occurrence of item.
fun index_of_from(item: nullable Object, pos: Int): Int

core :: SequenceRead :: index_of_from

The index of the first occurrence of item, starting from pos.
init init

core :: Object :: init

abstract fun insert(item: E, index: Int)

core :: Sequence :: insert

Insert an element at a given position, following elements are shifted.
fun insert_all(coll: Collection[E], index: Int)

core :: Sequence :: insert_all

Insert all elements at a given position, following elements are shifted.
fun inspect: String

core :: Object :: inspect

Developer readable representation of self.
protected fun inspect_head: String

core :: Object :: inspect_head

Return "CLASSNAME:#OBJECTID".
fun is_empty: Bool

core :: Collection :: is_empty

Is there no item in the collection?
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 iterator: Iterator[E]

core :: Collection :: iterator

Get a new iterator on the collection.
fun iterator_from(pos: Int): IndexedIterator[E]

core :: SequenceRead :: iterator_from

Gets a new Iterator starting at position pos
fun join(separator: nullable Text, last_separator: nullable Text): String

core :: Collection :: join

Concatenate and separate each elements with separator.
fun last: E

core :: SequenceRead :: last

Get the last item.
fun last=(item: E)

core :: Sequence :: last=

Set the last item.
fun last_index_of(item: nullable Object): Int

core :: SequenceRead :: last_index_of

The index of the last occurrence of item.
fun last_index_of_from(item: nullable Object, pos: Int): Int

core :: SequenceRead :: last_index_of_from

The index of the last occurrence of item starting from pos and decrementing.
fun length: Int

core :: Collection :: length

Number of items in the collection.
protected fun length=(length: Int)

core :: AbstractArrayRead :: length=

fun modulo(index: Int): E

core :: SequenceRead :: modulo

Return the index-th element but wrap
fun modulo=(index: Int, value: E)

core :: Sequence :: modulo=

Set the index-th element but wrap
fun modulo_index(index: Int): Int

core :: SequenceRead :: modulo_index

Returns the real index for a modulo index.
protected fun msgpack_extra_array_items: Int

serialization :: Serializable :: msgpack_extra_array_items

Hook to request a larger than usual metadata array
fun mutex: Mutex

core :: Array :: mutex

protected fun mutex=(mutex: Mutex)

core :: Array :: mutex=

fun not_empty: Bool

core :: Collection :: not_empty

Alias for not is_empty.
intern fun object_id: Int

core :: Object :: object_id

An internal hash code for the object based on its identity.
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 permutations(r: Int): Collection[SequenceRead[E]]

core :: Collection :: permutations

All r-length permutations on self (all possible ordering) without repeated elements.
fun plain_to_s: String

core :: Collection :: plain_to_s

Concatenate elements without separators
abstract fun pop: E

core :: Sequence :: pop

Remove the last item.
fun prepend(coll: Collection[E])

core :: Sequence :: prepend

Add all items of coll before the first one.
fun product(r: Int): Collection[SequenceRead[E]]

core :: Collection :: product

Cartesian product, over r times self.
abstract fun push(e: E)

core :: Sequence :: push

Add an item after the last one.
fun rand: E

core :: Collection :: rand

Return a random element form the collection
abstract fun remove(item: nullable Object)

core :: RemovableCollection :: remove

Remove an occurrence of item
fun remove_all(item: nullable Object)

core :: RemovableCollection :: remove_all

Remove all occurrences of item
abstract fun remove_at(index: Int)

core :: Sequence :: remove_at

Remove the item at index and shift all following elements
abstract fun reverse_iterator: IndexedIterator[E]

core :: SequenceRead :: reverse_iterator

Gets an iterator starting at the end and going backwards
fun reverse_iterator_from(pos: Int): IndexedIterator[E]

core :: SequenceRead :: reverse_iterator_from

Gets an iterator on the chars of self starting from pos
fun reversed: Array[E]

core :: AbstractArrayRead :: reversed

Return a new array that is the reverse of self
fun rotate_left

core :: Sequence :: rotate_left

Rotates the elements of self once to the left
fun rotate_right

core :: Sequence :: rotate_right

Rotates the elements of self once to the right
fun sample(length: Int): Array[E]

core :: Collection :: sample

Return a new array made of (at most) length elements randomly chosen.
fun serialization_hash: Int

core :: Object :: serialization_hash

Hash value use for serialization
fun serialize_msgpack(plain: nullable Bool): Bytes

serialization :: Serializable :: serialize_msgpack

Serialize self to MessagePack bytes
fun serialize_to(serializer: Serializer)

serialization :: Serializable :: serialize_to

Serialize self to serializer
fun serialize_to_json(plain: nullable Bool, pretty: nullable Bool): String

serialization :: Serializable :: serialize_to_json

Serialize self to JSON
abstract fun shift: E

core :: Sequence :: shift

Remove the first item.
fun shuffle

core :: AbstractArray :: shuffle

Reorder randomly the elements in self.
fun sort_fa: ForAbuser[CompareQuery[E]]

core :: Array :: sort_fa

Sort an array through a for abuse.
fun sort_with(f: Fun1[E, Comparable])

core :: Array :: sort_with

Sorts an array with a function.
fun sub(from: Int, count: Int): Array[E]

core :: AbstractArrayRead :: sub

Returns a sub-array containing count elements starting from from.
fun subarray(start: Int, len: Int): Array[E]

core :: Sequence :: subarray

Copy the content of self between start and len to a new Array.
fun swap_at(a: Int, b: Int)

core :: AbstractArray :: swap_at

Invert two elements in the array
intern fun sys: Sys

core :: Object :: sys

Return the global sys object, the only instance of the Sys class.
fun to_a: Array[E]

core :: Collection :: to_a

Build a new array from a collection
abstract fun to_concurrent: CONCURRENT

core :: Collection :: to_concurrent

Wraps self in a thread-safe collection
fun to_counter: Counter[E]

core :: Collection :: to_counter

Create and fill up a counter with the elements of `self.
fun to_curlslist: CURLSList

core :: Collection :: to_curlslist

Convert Collection[String] to CURLSList
fun to_json: String

serialization :: Serializable :: to_json

Serialize self to plain JSON
abstract fun to_jvalue(env: JniEnv): JValue

core :: Object :: to_jvalue

fun to_pretty_json: String

serialization :: Serializable :: to_pretty_json

Serialize self to plain pretty JSON
fun to_s: String

core :: Object :: to_s

User readable representation of self.
fun to_shuffle: Array[E]

core :: Collection :: to_shuffle

Return a new array made of elements in a random order.
abstract fun unshift(e: E)

core :: Sequence :: unshift

Add an item before the first one.
init with_capacity(cap: Int)

core :: Array :: with_capacity

Create an empty array with a given capacity.
init with_items(objects: E...)

core :: Array :: with_items

Create an array with some objects.
init with_native(nat: NativeArray[E], size: Int)

core :: Array :: with_native

Create a array filled with a given native array.
package_diagram core::Array Array core::AbstractArray AbstractArray core::Array->core::AbstractArray core::Cloneable Cloneable core::Array->core::Cloneable core::AbstractArrayRead AbstractArrayRead core::AbstractArray->core::AbstractArrayRead core::Sequence Sequence core::AbstractArray->core::Sequence core::Object Object core::Cloneable->core::Object ...core::AbstractArrayRead ... ...core::AbstractArrayRead->core::AbstractArrayRead ...core::Sequence ... ...core::Sequence->core::Sequence ...core::Object ... ...core::Object->core::Object core::ArrayCmp ArrayCmp core::ArrayCmp->core::Array pthreads::ConcurrentArray ConcurrentArray pthreads::ConcurrentArray->core::Array json::JsonArray JsonArray json::JsonArray->core::Array geometry::BoxedArray BoxedArray geometry::BoxedArray->core::Array nitcorn::Interfaces Interfaces nitcorn::Interfaces->core::Array nitcorn::VirtualHosts VirtualHosts nitcorn::VirtualHosts->core::Array mongodb::MongoPipeline MongoPipeline mongodb::MongoPipeline->json::JsonArray mongodb::MongoPipeline... ... mongodb::MongoPipeline...->mongodb::MongoPipeline

Ancestors

abstract class AbstractArrayRead[E: nullable Object]

core :: AbstractArrayRead

One dimension array of objects.
interface Collection[E: nullable Object]

core :: Collection

The root of the collection hierarchy.
interface Object

core :: Object

The root of the class hierarchy.
interface RemovableCollection[E: nullable Object]

core :: RemovableCollection

Items can be removed from this collection
interface Sequence[E: nullable Object]

core :: Sequence

Sequence are indexed collection.
interface SequenceRead[E: nullable Object]

core :: SequenceRead

Sequences are indexed collections.
interface Serializable

serialization :: Serializable

Instances of this class can be passed to Serializer::serialize
interface SimpleCollection[E: nullable Object]

core :: SimpleCollection

Items can be added to these collections.

Parents

abstract class AbstractArray[E: nullable Object]

core :: AbstractArray

Resizable one dimension array of objects.
interface Cloneable

core :: Cloneable

Something that can be cloned

Children

class ArrayCmp[E: nullable Comparable]

core :: ArrayCmp

Comparable array for comparable elements.
class BoxedArray[E: Boxed[Numeric]]

geometry :: BoxedArray

BoxedCollection implemented by an array
class ConcurrentArray[E: nullable Object]

pthreads :: ConcurrentArray

A concurrent variant to the standard Array
class Interfaces

nitcorn :: Interfaces

A list of interfaces with dynamic port listeners
class JsonArray

json :: JsonArray

A JSON array.
class VirtualHosts

nitcorn :: VirtualHosts

A list of virtual hosts with dynamic port listeners

Descendants

class MongoPipeline

mongodb :: MongoPipeline

Mongo pipelines are arrays of aggregation stages

Class definitions

core $ Array
# Resizable one dimension array of objects.
#
# Arrays have a literal representation.
#
#     var a = [12, 32, 8]
#     # is equivalent with:
#     var b = new Array[Int]
#     b.push(12)
#     b.push(32)
#     b.push(8)
#     assert a == b
class Array[E]
	super AbstractArray[E]
	super Cloneable

	redef fun [](index)
	do
		assert index: index >= 0 and index < _length
		return _items.as(not null)[index]
	end

	redef fun []=(index, item)
	do
		assert index: index >= 0 and index < _length + 1
		if _capacity <= index then
			enlarge(index + 1)
		end
		if _length <= index then
			_length = index + 1
		end
		_items.as(not null)[index] = item
	end

	redef fun add(item)
	do
		var l = _length
		if _capacity <= l then
			enlarge(l + 1)
		end
		_length = l + 1
		_items.as(not null)[l] = item
	end

	# Slight optimization for arrays
	redef fun add_all(items)
	do
		var l = _length
		var nl = l + items.length
		if _capacity < nl then
			enlarge nl
		end

		if items isa Array[E] then
			var k = 0
			while l < nl do
				_items.as(not null)[l] = items._items.as(not null)[k]
				l += 1
				k += 1
			end
		else
			for item in items do
				_items.as(not null)[l] = item
				l += 1
			end
		end

		_length = nl
	end

	redef fun copy_to(start, len, dest, new_start)
	do
		# Fast code when source and destination are two arrays

		if not dest isa Array[E] then
			super
			return
		end

		# Enlarge dest if required
		var dest_len = new_start + len
		if dest_len > dest.length then
			dest.enlarge(dest_len)
			dest.length = dest_len
		end

		# Get underlying native arrays
		var items = self.items
		if items == null then return
		var dest_items = dest.items
		assert dest_items != null

		# Native copy
		items.memmove(start, len, dest_items, new_start)
	end

	redef fun enlarge(cap)
	do
		var c = _capacity
		if cap <= c then return
		while c <= cap do c = c * 2 + 2
		var a = new NativeArray[E](c)
		if _capacity > 0 then _items.as(not null).copy_to(a, _length)
		_items = a
		_capacity = c
	end

	# Create an empty array.
	init
	do
		_capacity = 0
		_length = 0
	end

	# Create an array from a collection.
	init from(items: Collection[E]) do
		with_capacity(items.length)
		self.add_all(items)
	end

	# Create an array with some `objects`.
	init with_items(objects: E...)
	do
		_items = objects._items
		_capacity = objects._capacity
		_length = objects.length
	end

	# Create an empty array with a given capacity.
	init with_capacity(cap: Int)
	do
		assert positive: cap >= 0
		_items = new NativeArray[E](cap)
		_capacity = cap
		_length = 0
	end

	# Create an array of `count` elements
	init filled_with(value: E, count: Int)
	do
		assert positive: count >= 0
		_items = new NativeArray[E](count)
		_capacity = count
		_length = count
		var i = 0
		while i < count do
			self[i] = value
			i += 1
		end
	end

	# Create a array filled with a given native array.
	init with_native(nat: NativeArray[E], size: Int)
	do
		assert positive: size >= 0
		_items = nat
		_capacity = size
		_length = size
	end

	# The internal storage.
	private var items: nullable NativeArray[E] = null

	# The size of `_items`.
	private var capacity: Int = 0

	redef fun ==(o)
	do
		if not o isa Array[nullable Object] then return super
		# Efficient implementation
		var l = length
		if l != o.length then return false
		if l == 0 then return true
		var i = 0
		var it = _items.as(not null)
		var oit = o._items.as(not null)
		while i < l do
			if it[i] != oit[i] then return false
			i += 1
		end
		return true
	end

	# Shallow clone of `self`
	#
	# ~~~
	# var a = [1,2,3]
	# var b = a.clone
	# assert a == b
	# a.add 4
	# assert a != b
	# b.add 4
	# assert a == b
	# ~~~
	#
	# Note that the clone is shallow and elements are shared between `self` and the result.
	#
	# ~~~
	# var aa = [a]
	# var bb = aa.clone
	# assert aa == bb
	# aa.first.add 5
	# assert aa == bb
	# ~~~
	redef fun clone do return to_a

	# Concatenation of arrays.
	#
	# Returns a new array built by concatenating `self` and `other` together.
	#
	#     var a1 = [1,2,3]
	#     var a2 = [4,5,6]
	#     var a3 = a1 + a2
	#     assert a3 == [1,2,3,4,5,6]
	#
	# Because a new array is always created, future modification on `self` and `other`
	# does not impact the previously computed result.
	#
	#     a1.add(30)
	#     a2.add(60)
	#     assert a3      == [1,2,3,4,5,6] # unchanged
	#     assert a1 + a2 == [1,2,3,30,4,5,6,60]
	fun +(other: Array[E]): Array[E]
	do
		var res = new Array[E].with_capacity(length + other.length)
		res.append(self)
		res.append(other)
		return res
	end

	# Repetition of arrays.
	#
	# returns a new array built by concatenating `self` `repeat` times.
	#
	#     var a = [1,2,3]
	#     assert (a * 0).is_empty
	#     assert a * 1  ==  [1,2,3]
	#     assert a * 2  ==  [1,2,3,1,2,3]
	#     assert (a * 10).length  ==  30
	fun *(repeat: Int): Array[E]
	do
		assert repeat >= 0
		var res = new Array[E].with_capacity(length * repeat)
		while repeat > 0 do
			res.add_all(self)
			repeat -= 1
		end
		return res
	end
end
lib/core/collection/array.nit:306,1--554,3

core :: flat $ Array
redef class Array[E]

	# Fast implementation
	redef fun plain_to_s
	do
		var l = _length
		if l == 0 then return ""
		var its = _items.as(not null)
		var first = its[0]
		if l == 1 then if first == null then return "" else return first.to_s
		var na = new NativeArray[String](l)
		var i = 0
		var sl = 0
		var mypos = 0
		while i < l do
			var itsi = its[i]
			if itsi == null then
				i += 1
				continue
			end
			var tmp = itsi.to_s
			sl += tmp.byte_length
			na[mypos] = tmp
			i += 1
			mypos += 1
		end
		var ns = new CString(sl + 1)
		ns[sl] = 0
		i = 0
		var off = 0
		while i < mypos do
			var tmp = na[i]
			if tmp isa FlatString then
				var tpl = tmp._byte_length
				tmp._items.copy_to(ns, tpl, tmp._first_byte, off)
				off += tpl
			else
				for j in tmp.substrings do
					var s = j.as(FlatString)
					var slen = s._byte_length
					s._items.copy_to(ns, slen, s._first_byte, off)
					off += slen
				end
			end
			i += 1
		end
		return new FlatString.with_infos(ns, sl, 0)
	end
end
lib/core/text/flat.nit:1483,1--1531,3

for_abuse :: for_abuse $ Array
redef class Array[E]
	# Sort an array through a `for` abuse.
	# The user uses the provided query (item) to implements its own comparison
	#
	#     var a = [1, 3, 2]
	#     for q in a.sort_fa do q.res = q.a <=> q.b
	#     assert a ==  [1, 2, 3]
	#
	# Implements a sort by permutation.
	fun sort_fa: ForAbuser[CompareQuery[E]]
	do
		return new SortAbuser[E](self)
	end
end
lib/for_abuse/for_abuse.nit:137,1--150,3

pthreads :: redef_collections $ Array
# Thread-safe refinements of most of the known methods (except `enlarge`)
redef class Array
	var mutex = new Mutex

	redef fun add(e)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun []=(index, e)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun [](index)
	do
		mutex.lock
		var r = super
		mutex.unlock
		return r
	end

	redef fun remove_at(index)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun shift
	do
		mutex.lock
		var r = super
		mutex.unlock
		return r
	end

	redef fun unshift(e)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun insert_all(from, pos)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun swap_at(a, b)
	do
		mutex.lock
		super
		mutex.unlock
	end

	redef fun ==(o)
	do
		mutex.lock
		var r = super
		mutex.unlock
		return r
	end

	redef fun enlarge(cap)
	do
		mutex.lock
		super
		mutex.unlock
	end
end
lib/pthreads/redef_collections.nit:36,1--112,3

functional :: iter_extras $ Array
redef class Array

        # Sorts an array with a function.
        #
        # ~~~~nitish
        # class Person
        #       var name: String
        # end
        #
        # def get_name(p: Person) do return p.name
        #
        # var ps = [new Person("Turing"), new Person("Curry"), new Person("Alfredo")]
        # ps.sort_with(&get_name)
        # assert ps[0].name == "Alfredo"
        # assert ps[1].name == "Curry"
        # assert ps[2].name == "Turing"
        # ~~~~
        fun sort_with(f: Fun1[E, Comparable])
        do
                var cmp = new ComparatorWith[E](f)
                if length > 1 then
                        cmp.quick_sort(self, 0, length - 1)
                end
        end
end
lib/functional/iter_extras.nit:23,1--47,3

pthreads :: concurrent_collections $ Array
redef class Array[E]
	redef type CONCURRENT: ConcurrentArray[E]

	redef fun to_concurrent do return new ConcurrentArray[E].wrap(self)
end
lib/pthreads/concurrent_collections.nit:56,1--60,3

array_debug :: array_debug $ Array
redef class Array[E]

	redef fun to_s do
		sys.arr_len.inc length
		for i in self do
			sys.arr_s_len.inc i.to_s.length
		end
		return super
	end

end
lib/array_debug/array_debug.nit:71,1--81,3

android :: bundle $ Array
redef class Array[E]
	redef fun add_to_bundle(bundle, key)
	do
		if self isa Array[Bool] then
			bundle.put_boolean_array(key, self)
		else if self isa Array[Int] then
			bundle.put_long_array(key, self)
		else if self isa Array[Float] then
			bundle.put_double_array(key, self)
		else if self isa Array[Char] then
			bundle.put_char_array(key, self)
		else if self isa Array[String] then
			sys.jni_env.push_local_frame(self.length)
			var java_string_array = new Array[JavaString]

			for element in self do
				java_string_array.push(element.to_s.to_java_string)
			end

			bundle.put_string_array(key, java_string_array)
		else if self isa Array[Serializable] then
			sys.jni_env.push_local_frame(self.length)
			var java_string_array = new Array[JavaString]

			for element in self do
			var serialized_string = new StringWriter
				var serializer = new JsonSerializer(serialized_string)
				serializer.serialize(element)
				java_string_array.add(serialized_string.to_s.to_java_string)
			end

			bundle.put_string_array(key, java_string_array)
		end
	end
end
lib/android/bundle/bundle.nit:721,1--755,3