Collection API Functions - Versionsgeschichte

Cg: /* Sorting */

2026-05-01T23:36:14Z

Sorting

← Nächstältere Version		Version vom 1. Mai 2026, 23:36 Uhr
Zeile 482:		Zeile 482:
	:''aCollection'' '''sortedBy:''' ''compareBlock''		:''aCollection'' '''sortedBy:''' ''compareBlock''
	::Returns a sorted copy of the collection (no side effect on the collection).		::Returns a sorted copy of the collection (no side effect on the collection).
	::If a condition argument (a block) is given, that should return true if the first argument is to come before the second. I.e. without a condition, the behavior is the same as "sortedBy:[:elA :elB \| elA < elB]".		::If a condition argument (a block) is given, that should return true if the first argument is to come before the second. I.e. without a condition, the behavior is the same as:<br>"<code>sortedBy:[:elA :elB \| elA < elB]</code>".

	::Examples~~<br>~~		::Examples:
	<div style="margin-left: 4em;">		<div style="margin-left: 4em;">
	''hello world'' '''sorted'''		''hello world'' '''sorted'''

Cg: /* Sorting */

2026-05-01T23:34:33Z

Sorting

← Nächstältere Version		Version vom 1. Mai 2026, 23:34 Uhr
Zeile 501:		Zeile 501:

	#('Paul' 'paula' 'Thomas' 'James' 'Emma') sorted:[:a :b \| a < b]		#('Paul' 'paula' 'Thomas' 'James' 'Emma') sorted:[:a :b \| a < b]
	=> ~~OrderedCollection~~('Emma' 'James' 'Paul' 'Thomas' 'paula')		=> #('Emma' 'James' 'Paul' 'Thomas' 'paula')

	#('Paul' 'paula' 'Thomas' 'James' 'Emma') sorted:[:a :b \| a caselessBefore: b]		#('Paul' 'paula' 'Thomas' 'James' 'Emma') sorted:[:a :b \| a caselessBefore: b]

Cg: /* Converting */

2026-05-01T23:32:22Z

Converting

← Nächstältere Version		Version vom 1. Mai 2026, 23:32 Uhr
Zeile 464:		Zeile 464:
	:''aCollection''.'''asByteArray'''() [JS]		:''aCollection''.'''asByteArray'''() [JS]
	::Returns a byte array containing the elements which must be integers in the ISO8859 range 0x00 .. 0xFF.		::Returns a byte array containing the elements which must be integers in the ISO8859 range 0x00 .. 0xFF.


	:''aCollection'' '''asSet'''		:''aCollection'' '''asSet'''
	::Returns a set containing each element at most once.		::Returns a set containing each element at most once.


	:''aCollection'' '''asOrderedCollection'''		:''aCollection'' '''asOrderedCollection'''
	::Returns an ordered collection (that is a resizable dynamic array) containing the elements in the same order.		::Returns an ordered collection (that is a resizable dynamic array) containing the elements in the same order.


	:''aCollection'' '''asSortedCollection'''		:''aCollection'' '''asSortedCollection'''
Zeile 478:		Zeile 475:

	:''aCollection'' '''as:''' ''newClass''		:''aCollection'' '''as:''' ''newClass''
	::~~Retruns~~ an instance of ''newClass'' with the reveiver's elements. Eg. "aCollection as:OrderedCollection" does the same as the above converter.		::Returns an instance of ''newClass'' with the reveiver's elements. Eg. "aCollection as:OrderedCollection" does the same as the above converter.

	=== Sorting ===		=== Sorting ===

Cg: /* Converting */

2026-05-01T23:31:46Z

Converting

← Nächstältere Version		Version vom 1. Mai 2026, 23:31 Uhr
Zeile 476:		Zeile 476:
	:''aCollection'' '''asSortedCollection'''		:''aCollection'' '''asSortedCollection'''
	::Returns a sorted collection (that is a resizable dynamic collection which automatically sorts in additional elements).		::Returns a sorted collection (that is a resizable dynamic collection which automatically sorts in additional elements).

			:''aCollection'' '''as:''' ''newClass''
			::Retruns an instance of ''newClass'' with the reveiver's elements. Eg. "aCollection as:OrderedCollection" does the same as the above converter.

	=== Sorting ===		=== Sorting ===

Cg: /* Creation */

2026-05-01T23:28:18Z

Creation

← Nächstältere Version		Version vom 1. Mai 2026, 23:28 Uhr
Zeile 63:		Zeile 63:
	::[[Datei:point_right.png\|20px]] but notice the different behavior as compared to Array's behavior:		::[[Datei:point_right.png\|20px]] but notice the different behavior as compared to Array's behavior:
	:::for <CODE>Array</CODE> (and its subclasses), the size argument defines the size of the instantiated Array (which is fixed thereafter); and the array is filled wirth nils.		:::for <CODE>Array</CODE> (and its subclasses), the size argument defines the size of the instantiated Array (which is fixed thereafter); and the array is filled wirth nils.
	:::for <CODE>OrderedCollection</CODE> and<CODE>Dictionary</CODE> (and their subclasses), the size argument defines the number of preallocated slots in the collection; however, the logical size ~~of it~~ is zero (i.e. it is empty).		:::for <CODE>OrderedCollection</CODE> and<CODE>Dictionary</CODE> (and their subclasses), the size argument defines the number of preallocated slots in the collection; however, the logical size is initially zero (i.e. it is empty) until elements are added.
	::[[Datei:point_right.png\|20px]] In general:		::[[Datei:point_right.png\|20px]] In general:
	:::if the collection class has a variable number of elements, the size given to the <code>new:</code> method is the preallocation size, whereas for fixed size collections, its the actual size (and the elements are initialized with nil or zero in the number containers).		:::if the collection class has a variable number of elements, the size given to the <code>new:</code> method is the preallocation size, whereas for fixed size collections, its the actual size (and the elements are initialized with nil or zero in the number containers).

Cg: /* Most Useful Collection Classes */

2026-05-01T23:26:04Z

Most Useful Collection Classes

Cg: /* Intro */

2026-05-01T23:14:47Z

Intro

← Nächstältere Version		Version vom 1. Mai 2026, 23:14 Uhr
Zeile 8:		Zeile 8:
	== Intro ==		== Intro ==
	Roughly simplified, collections can be separated into the following groups:		Roughly simplified, collections can be separated into the following groups:
	* those where elements can be accessed by a numeric index are called ''sequenceable''. These inherit (mostly) from the abstract SequenceableCollection class. Examples are <code>Array</code>, <code>ByteArray</code>, <code>OrderedCollection</code> and <code>String</code>.		* those where elements can be accessed by a numeric index are called "''sequenceable''". These inherit (mostly) from the abstract SequenceableCollection class. Examples are <code>Array</code>, <code>ByteArray</code>, <code>OrderedCollection</code> and <code>String</code>.
	* those without a definite order, but access to elements via a key. Examples are <code>Dictionary</code> (aka ''HashTable'' in other languages).		* those without a definite order, but access to elements via a key. Examples are <code>Dictionary</code> (aka ''HashTable'' in other languages).
	* those which neither have an order nor access elements by a key. Examples are <code>Set</code>		* those which neither have an order nor access elements by a key. Examples are <code>Set</code>

Cg am 1. Mai 2026 um 23:14 Uhr

2026-05-01T23:14:14Z

← Nächstältere Version		Version vom 1. Mai 2026, 23:14 Uhr
Zeile 6:		Zeile 6:
	[[Useful API Functions \| Back to Useful API Functions]]		[[Useful API Functions \| Back to Useful API Functions]]

			== Intro ==
	~~Collections~~ can be separated into the following groups:		Roughly simplified, collections can be separated into the following groups:
	* those where elements can be accessed by a numeric index are called ''sequenceable''. These inherit (mostly) from the abstract SequenceableCollection class. Examples are <code>Array</code>, <code>ByteArray</code>, <code>OrderedCollection</code> and <code>String</code>.		* those where elements can be accessed by a numeric index are called ''sequenceable''. These inherit (mostly) from the abstract SequenceableCollection class. Examples are <code>Array</code>, <code>ByteArray</code>, <code>OrderedCollection</code> and <code>String</code>.
	* those without a definite order, but access to elements via a key. Examples are <code>Dictionary</code> (aka ''HashTable'' in other languages).		* those without a definite order, but access to elements via a key. Examples are <code>Dictionary</code> (aka ''HashTable'' in other languages).
	* those which neither have an order nor access elements by a key. Examples are <code>Set</code>		* those which neither have an order nor access elements by a key. Examples are <code>Set</code>

	There are also combinations, ~~whichallow~~ access both by a numeric and a non-numericc key. Examples are <code>OrderedDictionary</code> and <code>OrderedSet</code>.		There are also combinations, which allow access both by a numeric and a non-numericc key. Examples are <code>OrderedDictionary</code> and <code>OrderedSet</code>.

	[[Datei:point_right.png\|20px]] Notice: except when written otherwise, all indices of sequenceable collections are 1-based. Valid indices range from 1 to the collection's size (as eg. in Mathematica, but not as in C, Java or Python).		[[Datei:point_right.png\|20px]] Notice: except when written otherwise, all indices of sequenceable collections are 1-based. Valid indices range from 1 to the collection's size (as eg. in Mathematica, but not as in C, Java or Python).

Cg am 1. Mai 2026 um 23:12 Uhr

2026-05-01T23:12:06Z

← Nächstältere Version		Version vom 1. Mai 2026, 23:12 Uhr
Zeile 6:		Zeile 6:
	[[Useful API Functions \| Back to Useful API Functions]]		[[Useful API Functions \| Back to Useful API Functions]]

			Collections can be separated into the following groups:
⚫	[[Datei:point_right.png\|20px]] Notice: except when written otherwise, all indices are 1-based. Valid indices range from 1 to the collection's size (as eg. in Mathematica, but not as in C, Java or Python).
			* those where elements can be accessed by a numeric index are called ''sequenceable''. These inherit (mostly) from the abstract SequenceableCollection class. Examples are <code>Array</code>, <code>ByteArray</code>, <code>OrderedCollection</code> and <code>String</code>.
⚫	<br>In Smalltalk, the first element has number 1, and the N'th element of a collection has number N.
			* those without a definite order, but access to elements via a key. Examples are <code>Dictionary</code> (aka ''HashTable'' in other languages).
			* those which neither have an order nor access elements by a key. Examples are <code>Set</code>

			There are also combinations, whichallow access both by a numeric and a non-numericc key. Examples are <code>OrderedDictionary</code> and <code>OrderedSet</code>.

		⚫	[[Datei:point_right.png\|20px]] Notice: except when written otherwise, all indices of sequenceable collections are 1-based. Valid indices range from 1 to the collection's size (as eg. in Mathematica, but not as in C, Java or Python).
		⚫	<br>In Smalltalk, the first element of a sequenceable collection has number 1, and the N'th element of a collection has number N.
	<br>Also notice: String and ByteArray are subclasses of Collection, which means that most of the functions listed below can also be applied to sequences of characters and bytes.		<br>Also notice: String and ByteArray are subclasses of Collection, which means that most of the functions listed below can also be applied to sequences of characters and bytes.

Cg: /* Most Useful Subclasses */

2026-05-01T23:04:17Z

Most Useful Subclasses

← Nächstältere Version		Version vom 1. Mai 2026, 23:04 Uhr
Zeile 10:		Zeile 10:
	<br>Also notice: String and ByteArray are subclasses of Collection, which means that most of the functions listed below can also be applied to sequences of characters and bytes.		<br>Also notice: String and ByteArray are subclasses of Collection, which means that most of the functions listed below can also be applied to sequences of characters and bytes.

	== Most Useful ~~Subclasses~~ ==		== Most Useful Collection Classes ==
	:<CODE>Array</CODE>		:<CODE>Array</CODE>
	:: a collection of (references to) other objects. An array can hold on any other object type, even mixed, which means that the elements of an array can be instances of different classes. Technically an array holds references (aka pointers) to its elements, not their contents. Arrays are fixed in size; this means that once created, you cannot add or remove elements (1).		:: a collection of (references to) other objects. An array can hold on any other object type, even mixed, which means that the elements of an array can be instances of different classes. Technically an array holds references (aka pointers) to its elements, not their contents. Arrays are fixed in size; this means that once created, you cannot add or remove elements (1).

← Nächstältere Version		Version vom 1. Mai 2026, 23:26 Uhr
Zeile 20:		Zeile 20:
	== Most Useful Collection Classes ==		== Most Useful Collection Classes ==
	:<CODE>Array</CODE>		:<CODE>Array</CODE>
	:: a collection of (references to) other objects. An array can hold on any other object type, even mixed, which means that the elements of an array can be instances of different classes. Technically an array holds references (aka pointers) to its elements, not their contents. Arrays are fixed in size; this means that once created, you cannot add or remove elements (1).		:: a collection of (references to) other objects. An array can hold on any other object type, even mixed, which means that the elements of an array can be instances of different classes. Technically an array holds references (aka pointers) to its elements, not their contents.<br>Arrays are fixed in size; this means that once created, you cannot add or remove elements <sup>1)</sup>.

	:<CODE>OrderedCollection</CODE>		:<CODE>OrderedCollection</CODE>
	:: similar to an Array, these allow fast add- and removal at either end. They can therefore also be used as Stacks or Queues (although there are subclasses named "Queue" and "Stack", which solely exist to make their purpose clear and explicitly documented).		:: similar to an Array, these allow fast add- and removal at either end. They can therefore also be used as Stacks or Queues (although there are subclasses named "<code>Queue</code>" and "<code>Stack</code>", which solely exist to make their purpose clear and explicitly documented).

	:<CODE>String</CODE>		:<CODE>String</CODE>
	:: a sequence of characters. Expecco supports 8, 16 and 32 bit strings. The internal encoding of all strings is always Unicode. Internally, strings are never kept in any compressed UTF8 or similar fashion. Only when loaded from or stored into external files or streams will there be an encoding. A number of encoders is found under the CharacterEncoder class.<br>Although ~~Strings~~ look like ~~Arrays~~ of ~~Characters~~ to the outside world, they use a more compact internal storage format (1, 2 or 4 byte per character, instead of the 4 or 8 byte pointer as used by Array).		:: a sequence of characters. Expecco supports 8, 16 and 32 bit strings. The internal encoding of all strings is always Unicode. Internally, strings are never kept in any compressed UTF8 or similar fashion. Only when loaded from or stored into external files or streams will there be an encoding. A number of encoders is found under the <code>CharacterEncoder</code> class.<br>Although strings look and behave like arrays of characters to the outside world, they use a more compact internal storage format (1, 2 or 4 byte per character, instead of the 4 or 8 byte pointer as used by Array).

	:<CODE>ByteArray</CODE>		:<CODE>ByteArray</CODE>
	:: a sequence of small unsigned 8 bit numbers (aka "bytes"). The class side protocol adds a number of instance creation methods, for example to read a hex encoded or Base64 encoded string. They also use a more compact storage format (1 byte per element).		:: a sequence of small unsigned 8 bit numbers (aka "''bytes''"). The class side protocol adds a number of instance creation methods, for example to read a hex encoded or Base64 encoded string. They also use a more compact storage format (1 byte per element).

	:<CODE>Float32Array</CODE>, <CODE>Float64Array</CODE>		:<CODE>Float32Array</CODE>, <CODE>Float64Array</CODE>
	:: a sequence of IEEE floating point numbers. These are mostly used to store bulk data, such as mesurement values and/or for data interchange with bridges.		:: a sequence of IEEE floating point numbers. These are mostly used to store bulk data, such as mesurement values and/or for data interchange with bridges. A number of additional container classes for 8,16,32 and 64 bit integers, both signed and unsigned, for complex numbers and for half-float (tinyFloats) are provided. They all do not store pointers but the unboxed numbers.

	:<CODE>Dictionary</CODE>		:<CODE>Dictionary</CODE>
	:: a dictionary (also known as "HashTable" in other languages) will associate values to keys, where the key can be an arbitrary object. There are a number of specialized subclasses, such as CacheDictionary, CacheDictionaryWithLimitedLifeTime, IdentityDictionary, Virtual- and PluggableDictionary. The last one lets you specify your own configurable hash- and compare functions. The VirtualDictionary is a complete mock, where you can plug in any action (Smalltalk-block) for access.		:: a dictionary (also known as "''HashTable''" in other languages) will associate values to keys, where both the key and the value can be an arbitrary object. There are a number of specialized subclasses, such as <code>CacheDictionary</code>, <code>CacheDictionaryWithLimitedLifeTime</code>, <code>IdentityDictionary</code>, <code>Virtual</code>- and <code>PluggableDictionary</code>.<br>The last one lets you specify your own configurable hash- and compare functions. The VirtualDictionary is a complete mock, where you can plug in any action (Smalltalk-block) for access.

	:<CODE>Interval</CODE>		:<CODE>Interval</CODE>
	:: an interval (also known as "Range" in eg. Python) mimics a collection on the outside, but only keeps the first and last element inside, computing all elements on the fly. There is also a companion class called "GeometricSeries" which behaves similar, but computes elements via a multiplication factor instead of an addition step.		:: an interval (also known as "''Range''" in eg. Python) mimics a collection on the outside, but only keeps the first and last element plus a step delta inside, computing all elements on the fly. There is also a companion class called "<code>GeometricSeries</code>" which behaves similar, but computes elements via a multiplication factor instead of an addition step.

	:<CODE>Tree</CODE>, <CODE>Queue</CODE>, <CODE>PriorityQueue</CODE> <CODE>SharedQueue</CODE>, ...		:<CODE>Tree</CODE>, <CODE>Queue</CODE>, <CODE>PriorityQueue</CODE> <CODE>SharedQueue</CODE>, ...
	:: there are many other collections for special uses. We recommend you to open a systemBrowser and look at the examples provided on the class side (typically found under documentation - examples).		:: there are many other collections for special uses. We recommend you to open a systemBrowser and look at the examples provided on the class side (typically found under documentation → examples).

	Notes:		Notes: