1555 Commits

This Branch

This Branch

All Branches

Author	SHA1	Message	Date
Rob Rix	699e6ee30d	Leaf terms capture their text.	2015-10-21 16:53:47 -04:00
Rob Rix	cc7030701e	Syntax constructors don’t take the strings.	2015-10-21 16:53:31 -04:00
Rob Rix	f92daa8aeb	Recursive constructors close over a/b instead of passing them.	2015-10-21 16:52:49 -04:00
Rob Rix	2c542fbd66	Leaves hold their values.	2015-10-21 16:52:09 -04:00
Rob Rix	dc88a90b8a	Patches construct their own terms. ... Terms also only take a single string.	2015-10-21 16:51:19 -04:00
Rob Rix	3cc4a02dc7	Patch constructors take strings.	2015-10-21 16:47:32 -04:00
Rob Rix	d315f5aabe	Construct a single element.	2015-10-21 16:43:18 -04:00
Rob Rix	f30e7411a1	Construct DOM for replacements.	2015-10-21 16:40:02 -04:00
Rob Rix	1c6d3c2349	Construct DOM for insertions.	2015-10-21 16:39:55 -04:00
Rob Rix	909e32d1eb	And finally, retrieve elements from the right property.	2015-10-21 16:38:02 -04:00
Rob Rix	a9953d380b	Test the right property, too.	2015-10-21 16:37:08 -04:00
Rob Rix	6d2f891a95	Enumerate the right property.	2015-10-21 16:35:39 -04:00
Rob Rix	5347b50ad3	Construct keyed nodes as a definition list.	2015-10-21 16:34:20 -04:00
Rob Rix	25e9054d06	Return an element for leaves.	2015-10-21 16:32:21 -04:00
Rob Rix	86467ff4f4	Insert indexed nodes as a list.	2015-10-21 16:31:53 -04:00
Rob Rix	4f671e461c	Terms call directly recursively.	2015-10-21 16:30:51 -04:00
Rob Rix	d5d86e222c	Map diffs to divs.	2015-10-21 16:29:42 -04:00
Rob Rix	6ef105ab08	Stub in handling of leaf nodes.	2015-10-21 16:27:08 -04:00
Rob Rix	276f95c669	Construct Diffs recursively.	2015-10-21 16:26:36 -04:00
Rob Rix	be2e6f9a44	Rename view to model.	2015-10-21 16:25:46 -04:00
Rob Rix	87862e839b	Diffs are model objects.	2015-10-21 16:24:56 -04:00
Rob Rix	6a515d917d	Split things out into temporaries for debugging.	2015-10-21 16:23:25 -04:00
Rob Rix	b0bd628c4f	Construct leaves.	2015-10-21 16:22:19 -04:00
Rob Rix	db8c04bd6f	Construct terms directly.	2015-10-21 16:19:29 -04:00
Rob Rix	d31f3ce85d	Use Indexed/Keyed so we can differentiate leaves.	2015-10-21 16:17:30 -04:00
Rob Rix	3e58fd0ec3	Indexed/Keyed construct objects.	2015-10-21 16:16:11 -04:00
Rob Rix	cdebdecc9d	Add elements for keyed nodes.	2015-10-21 16:07:47 -04:00
Rob Rix	6848ecce46	Add elements for arrays.	2015-10-21 16:07:39 -04:00
Rob Rix	6ca9e84892	Map terms into DOM nodes.	2015-10-21 16:05:34 -04:00
Rob Rix	ee1c1acb5b	Don’t shadow the continuation.	2015-10-21 16:04:06 -04:00
Rob Rix	df4e37e5de	Add DOM stuff to the DOM.	2015-10-21 16:02:55 -04:00
Rob Rix	d425c007e6	keyed produces a hash.	2015-10-21 16:01:45 -04:00
Rob Rix	89f218021f	Leaves are just passed straight through.	2015-10-21 16:01:22 -04:00
Rob Rix	2bd26cd80c	indexed produces an array.	2015-10-21 16:00:43 -04:00
Rob Rix	17877c7f36	Construct new terms.	2015-10-21 15:58:55 -04:00
Rob Rix	ebd101b22f	Add a value for terms.	2015-10-21 15:58:00 -04:00
Rob Rix	2aa2e49f41	Return null.	2015-10-21 15:57:23 -04:00
Rob Rix	27f01cc43f	Construct new values.	2015-10-21 15:57:15 -04:00
Rob Rix	848f3ec654	Return the element representing deletions.	2015-10-21 15:55:02 -04:00
Rob Rix	d373c6829c	Remove the before/after elements.	2015-10-21 15:54:46 -04:00
Rob Rix	2232be5e9f	Pass the input strings around everywhere.	2015-10-21 15:54:10 -04:00
Rob Rix	a7c04a8214	Don’t fetch the before/after terms.	2015-10-21 15:51:47 -04:00
Rob Rix	f687283721	Map replacements into Replace values.	2015-10-21 15:51:40 -04:00
Rob Rix	ba55d8a5ad	Map deletion/insertion patches in the source diff into deletions/insertions.	2015-10-21 15:50:29 -04:00
Rob Rix	014efdc84e	Map deletions into DOM.	2015-10-21 15:50:13 -04:00
Rob Rix	9d3a6b9ec6	Add values for patches.	2015-10-21 15:50:06 -04:00
Rob Rix	f8f82a6b16	Pass the DOM elements.	2015-10-21 15:49:34 -04:00
Rob Rix	ead175b4e4	We do, now.	2015-10-21 14:10:51 -04:00
Rob Rix	49d0904b1b	term recurs through syntax.	2015-10-21 14:09:40 -04:00
Rob Rix	90ae03f234	Recur through replacements.	2015-10-21 14:08:43 -04:00