김수경/JavaScript/InfiniteDataStructure - Revision history

Maintenance script: Repair MoniWiki formatting after migration

2026-03-29T00:34:36Z

Repair MoniWiki formatting after migration

← Older revision		Revision as of 00:34, 29 March 2026
Line 1:		Line 1:
	Implementing Infinite Data Structure in JavaScript.		Implementing Infinite Data Structure in [[JavaScript]].

	== 11/26 ==		== 11/26 ==

Maintenance script: Repair batch-0004 pages from live compare

2026-03-27T00:37:16Z

Repair batch-0004 pages from live compare

← Older revision		Revision as of 00:37, 27 March 2026
Line 9:		Line 9:
	limit(n)(a) := (n >= a)		limit(n)(a) := (n >= a)
	**		**
	.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])		.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])
	**		**
	filter(f(a)) := for each a in seq, sequence of a which f(a) is true.		filter(f(a)) := for each a in seq, sequence of a which f(a) is true.

imported>linflus at 13:58, 26 November 2011

2011-11-26T13:58:37Z

← Older revision		Revision as of 13:58, 26 November 2011
Line 2:		Line 2:

	== 11/26 ==		== 11/26 ==
	* naturalSequence().filter(limit(n)).reduce(sum)		*
	** sum(a, b) := a + b		naturalSequence().filter(limit(n)).reduce(sum)
	** limit(n)(a) := (n >= a)		**
			sum(a, b) := a + b
			**
			limit(n)(a) := (n >= a)
	**		**
	.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])		.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])
	** filter(f(a)) := for each a in seq, sequence of a which f(a) is true.		**
			filter(f(a)) := for each a in seq, sequence of a which f(a) is true.

imported>linflus at 13:58, 26 November 2011

2011-11-26T13:58:00Z

← Older revision		Revision as of 13:58, 26 November 2011
Line 5:		Line 5:
	** sum(a, b) := a + b		** sum(a, b) := a + b
	** limit(n)(a) := (n >= a)		** limit(n)(a) := (n >= a)
	** .reduce(f(a, b)) := f(seq[[:last-1]].reduce(f), seq~~[~~last~~]~~)		**
			.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])
	** filter(f(a)) := for each a in seq, sequence of a which f(a) is true.		** filter(f(a)) := for each a in seq, sequence of a which f(a) is true.

imported>linflus at 13:55, 26 November 2011

2011-11-26T13:55:25Z

New page

Implementing Infinite Data Structure in JavaScript.

== 11/26 ==
* naturalSequence().filter(limit(n)).reduce(sum)
** sum(a, b) := a + b
** limit(n)(a) := (n >= a)
** .reduce(f(a, b)) := f(seq[[:last-1]].reduce(f), seq[last])
** filter(f(a)) := for each a in seq, sequence of a which f(a) is true.