Collection library - Revision history

Thomas Linder Puls: regexp -> regex

2021-10-13T08:38:09Z

regexp -> regex

← Older revision		Revision as of 10:38, 13 October 2021
Line 182:		Line 182:
	getWord2_nd(First, _Rest) = string::toLowerCase(First) :-		getWord2_nd(First, _Rest) = string::toLowerCase(First) :-
	string::length(First) > 2, % only words with more than 2 letters		string::length(First) > 2, % only words with more than 2 letters
	not(~~regexp~~::search("[^a-zA-Z]", First, _, _)). % not a word if it contains non-letters		not(regex::search("[^a-zA-Z]", First, _, _)). % not a word if it contains non-letters

	getWord2_nd(_First, Rest) = getWord_nd(Rest).</vip>		getWord2_nd(_First, Rest) = getWord_nd(Rest).</vip>

Tbn: /* Keyword recognition */ typo

2016-11-03T13:14:11Z

Keyword recognition: typo

← Older revision		Revision as of 15:14, 3 November 2016
Line 126:		Line 126:
	<vp>keywordSet</vp> is a (modifiable) set of strings, which is initialized to contain the actual keywords from the <vp>keywords</vp> constant.		<vp>keywordSet</vp> is a (modifiable) set of strings, which is initialized to contain the actual keywords from the <vp>keywords</vp> constant.

	Notice that you should be ~~carefull~~ when initializing class facts like it is done above. Such initialization is done in an unpredictable order before entering the goal of the program. So first of all it is difficult to know which other parts of the program that has already been initialized. Secondly, the exception system is not initialized properly so exceptions will be reported in a rather low-level fasion.		Notice that you should be careful when initializing class facts like it is done above. Such initialization is done in an unpredictable order before entering the goal of the program. So first of all it is difficult to know which other parts of the program that has already been initialized. Secondly, the exception system is not initialized properly so exceptions will be reported in a rather low-level fasion.

	=== Text Concordance ===		=== Text Concordance ===

Tbn: /* queue */ typo

2016-11-03T12:40:42Z

queue: typo

← Older revision		Revision as of 14:40, 3 November 2016
Line 58:		Line 58:
	** <vp>queueM_fact</vp> implements a modifiable FIFO queue based on a nondeterm fact database		** <vp>queueM_fact</vp> implements a modifiable FIFO queue based on a nondeterm fact database

	* ''priority queue'' is a queue where the first element is alwasy the element with hightst priority (i.e. the least, the ~~greates~~ or based on a custom comparison).		* ''priority queue'' is a queue where the first element is alwasy the element with hightst priority (i.e. the least, the greatest or based on a custom comparison).
	** <vp>priorityQueueP_leftist</vp> implements a persistent priority queue		** <vp>priorityQueueP_leftist</vp> implements a persistent priority queue
	** <vp>priorityQueueM_leftist</vp> implements a modifiable priority queue		** <vp>priorityQueueM_leftist</vp> implements a modifiable priority queue

Thomas Linder Puls: category

2016-03-04T10:12:26Z

Thomas Linder Puls: /* Usage examples */ grammar

2012-12-09T12:35:31Z

Usage examples: grammar

← Older revision		Revision as of 14:35, 9 December 2012
Line 88:		Line 88:
	== Usage examples ==		== Usage examples ==

	The examples in this section is inspired by the examples in ''The C5 Generic Collection Library for C# and CLI'', Niels Kokholm and Peter Sestoft, IT University Technical Report Series TR-2006-76, 2006.		The examples in this section are inspired by the examples in ''The C5 Generic Collection Library for C# and CLI'', Niels Kokholm and Peter Sestoft, IT University Technical Report Series TR-2006-76, 2006.

	=== Keyword recognition ===		=== Keyword recognition ===

Thomas Linder Puls: /* map */ space

2012-12-09T12:34:46Z

map: space

← Older revision		Revision as of 14:34, 9 December 2012
Line 67:		Line 67:
	A '''map''' is a function from ''keys'' to ''values''. Not all keys need have a value. The basic operations is setting, getting and try-getting the value associated with a certain key. When the value of a key is set the previous value of that key is "lost".		A '''map''' is a function from ''keys'' to ''values''. Not all keys need have a value. The basic operations is setting, getting and try-getting the value associated with a certain key. When the value of a key is set the previous value of that key is "lost".

	A map is a collection of (key,value)-tuples,so the <vp>collection</vp> predicates all deal with such tuples.		A map is a collection of (key,value)-tuples, so the <vp>collection</vp> predicates all deal with such tuples.

	<vp>map</vp> is the basic interface for inspecting maps (persistent as well as modifiable). It supports <vp>collection</vp> of (key,value)-tuples and extends with predicates/properties:		<vp>map</vp> is the basic interface for inspecting maps (persistent as well as modifiable). It supports <vp>collection</vp> of (key,value)-tuples and extends with predicates/properties:

Thomas Linder Puls: /* map */ spelling

2012-12-09T12:33:31Z

map: spelling

← Older revision		Revision as of 14:33, 9 December 2012
Line 65:		Line 65:
	=== map ===		=== map ===

	A '''map''' is a ~~functionfrom~~ ''keys'' to ''values''. Not all keys need have a value. The basic operations is setting, getting and try-getting the value associated with a certain key. When the value of a key is set the previous value of that key is "lost".		A '''map''' is a function from ''keys'' to ''values''. Not all keys need have a value. The basic operations is setting, getting and try-getting the value associated with a certain key. When the value of a key is set the previous value of that key is "lost".

	A map is a collection of (key,value)-tuples,so the <vp>collection</vp> predicates all deal with such tuples.		A map is a collection of (key,value)-tuples,so the <vp>collection</vp> predicates all deal with such tuples.

Kehler: /* queue */

2010-05-26T09:37:22Z

queue

← Older revision		Revision as of 11:37, 26 May 2010
Line 52:		Line 52:
	=== queue ===		=== queue ===

	A ''queue'' is a collection of elements which are ordered. ~~THe~~ fundamental operation is getting the first element is the queue. Membership testing is typically inefficient. The interfaces of queues is similar to that of sets, supporting <vp>collection</vp> and one of the interfaces <vp>persistent</vp> and <vp>modifiable</vp>. The names are different to stress the difference in intension and efficeincy. And in future they may evolve differently. PFC contains two kinds of queues:		A ''queue'' is a collection of elements which are ordered. The fundamental operation is getting the first element is the queue. Membership testing is typically inefficient. The interfaces of queues is similar to that of sets, supporting <vp>collection</vp> and one of the interfaces <vp>persistent</vp> and <vp>modifiable</vp>. The names are different to stress the difference in intension and efficeincy. And in future they may evolve differently. PFC contains two kinds of queues:

	* ''queue'' is a "regular" FIFO (first-in-first-out) queue.		* ''queue'' is a "regular" FIFO (first-in-first-out) queue.

Thomas Linder Puls: language bug

2010-05-26T09:36:13Z

language bug

← Older revision		Revision as of 11:36, 26 May 2010
Line 19:		Line 19:
	== Collection Interfaces & Classes ==		== Collection Interfaces & Classes ==

	There is no fundamental difference in retrieving data from persistent and modifiable collection ~~so retrieval~~. The difference lies in the updating of the collections.		There is no fundamental difference in retrieving data from persistent and modifiable collection. The difference lies in the updating of the collections.

	Therefore retrieval is done through interfaces that are shared by persistent and modifiable collections, whereas updating is done through separate persistent and modifiable interfaces.		Therefore retrieval is done through interfaces that are shared by persistent and modifiable collections, whereas updating is done through separate persistent and modifiable interfaces.

Thomas Linder Puls: Category:Tutorials

2010-05-26T09:09:36Z

Category:Tutorials

← Older revision		Revision as of 11:09, 26 May 2010
Line 206:		Line 206:

	[[Category:PFC]]		[[Category:PFC]]
			[[Category:Tutorials]]

← Older revision		Revision as of 12:12, 4 March 2016
Line 205:		Line 205:


	[[Category:~~PFC]]~~		[[Category:Data types and handling]]
	~~[[Category:Tutorials~~]]