10828 Commits

This Branch

This Branch

All Branches

Author	SHA1	Message	Date
Rob Rix	1f56cd5b9d	Simplify the Show instance for State s a.	2017-03-13 12:01:03 -04:00
Rob Rix	92bb79a7a6	Define a Show instance for MyersF a b.	2017-03-13 11:58:28 -04:00
Rob Rix	6b5c9df8e6	Define a Show1 instance for MyersF a.	2017-03-13 11:57:12 -04:00
Rob Rix	e6f89c9266	Define a Show2 instance for MyersF.	2017-03-13 11:56:29 -04:00
Rob Rix	48e5119679	Define a Show1 instance for EditGraph.	2017-03-13 11:53:06 -04:00
Rob Rix	d4b0633117	Define a helper to show a vector’s contents parametrically.	2017-03-13 11:52:59 -04:00
Rob Rix	39e1cb06c4	Derive Eq & Show instances for EditGraph & Snake.	2017-03-13 11:47:38 -04:00
Rob Rix	a24c35e5ce	Define a Show instance of State s a.	2017-03-13 11:41:37 -04:00
Rob Rix	cd0466dcec	Define a Show1 instance of State.	2017-03-13 11:39:40 -04:00
Rob Rix	2e843a1a16	Define a Show2 instance of State.	2017-03-13 11:38:01 -04:00
Rob Rix	a59f657b08	Derive Eq & Show instances of MyersState.	2017-03-13 11:35:37 -04:00
Rob Rix	95a800660e	runMyersSteps constructs the initial state itself.	2017-03-13 11:35:11 -04:00
Rob Rix	8998884e51	Select the empty state specific to a given step.	2017-03-13 11:34:50 -04:00
Rob Rix	beefe1ac20	Extract the definition of the empty state.	2017-03-13 11:33:46 -04:00
Rob Rix	315927763f	Move editGraph to the implementation details section.	2017-03-13 11:32:54 -04:00
Rob Rix	6aab59ba18	Add a function to run all the steps in a myers algorithm.	2017-03-13 11:28:23 -04:00
Rob Rix	c9354e38ff	Clamp graph division to the size of the inputs.	2017-03-13 11:23:10 -04:00
Rob Rix	14f96d8bf0	Invert reverse d-paths as appropriate.	2017-03-13 11:22:43 -04:00
Rob Rix	f1ad91a346	Compute reverse d-paths in the same manner as forward ones.	2017-03-10 16:15:50 -05:00
Rob Rix	781a525f87	🔥 the custom definition of at.	2017-03-10 15:23:43 -05:00
Rob Rix	b81db68867	Don’t use the delta at all.	2017-03-10 14:18:47 -05:00
Rob Rix	438dc91672	Try to implement SES recursively.	2017-03-10 14:14:04 -05:00
Rob Rix	e74119d3de	🔥 the bogus shortcuts.	2017-03-10 14:01:51 -05:00
Rob Rix	eaf898dc4a	Test for inclusion in the interval given the delta.	2017-03-10 13:58:35 -05:00
Rob Rix	d419e9aa9a	Offset given the delta.	2017-03-10 13:57:41 -05:00
Rob Rix	7231c64bdd	Set the backwards vector with the delta.	2017-03-10 13:53:16 -05:00
Rob Rix	c4a7f35d46	Sliding can operate at the zeroth index.	2017-03-10 13:52:56 -05:00
Rob Rix	28b5a99333	Try to implement reverse d-path endpoint finding.	2017-03-10 13:52:40 -05:00
Rob Rix	e2b4b65423	Derive Eq & Show instances for some of the types.	2017-03-10 13:51:46 -05:00
Rob Rix	8aea2f6d0f	Sliding can go in either direction.	2017-03-10 13:45:36 -05:00
Rob Rix	f5ddc911d7	Bind a bunch of the relevant values & functions for all constructors.	2017-03-10 13:43:03 -05:00
Rob Rix	960cb3537c	Stub out setup for reverse d-path finding.	2017-03-10 13:38:29 -05:00
Rob Rix	d176490171	Ill-advised symmetry.	2017-03-10 13:36:23 -05:00
Rob Rix	a1ceb3dca4	Don’t access out of bounds elements.	2017-03-10 13:33:47 -05:00
Rob Rix	351fef725e	Early return if we’ve exhausted the inputs.	2017-03-10 13:32:15 -05:00
Rob Rix	1117208430	Bind the as/bs vectors.	2017-03-10 13:29:32 -05:00
Rob Rix	f739d4e0b2	y is independent of maxD.	2017-03-10 13:21:44 -05:00
Rob Rix	9bb0ae2f5a	Bind ! locally.	2017-03-10 13:18:59 -05:00
Rob Rix	a15ae4b2e0	Bounds check x & y.	2017-03-10 13:13:47 -05:00
Rob Rix	91694c4999	Maintain call-stacks.	2017-03-10 13:12:05 -05:00
Rob Rix	a8222cf0d8	🔥 GetGraph.	2017-03-10 13:09:21 -05:00
Rob Rix	6e2f098029	Don’t pass eq around.	2017-03-10 13:07:11 -05:00
Rob Rix	f00987fe89	Add smart constructors for the reader parameters.	2017-03-10 13:04:08 -05:00
Rob Rix	cd61576be9	Add constructors to retrieve the edit graph & equality function.	2017-03-10 13:03:09 -05:00
Rob Rix	b373e4c63e	Add the element type parameter to Myers.	2017-03-10 13:02:12 -05:00
Rob Rix	737ab8924d	Add a convenience to run LCS in its entirety.	2017-03-10 12:52:09 -05:00
Rob Rix	607e6cd63e	Return the correct subsequences at the ends.	2017-03-10 12:04:09 -05:00
Rob Rix	34b2f0271b	Get the middle elements in LCS.	2017-03-10 12:02:45 -05:00
Rob Rix	6a6759949e	Stub in the recursive construction of the LCS.	2017-03-10 12:01:08 -05:00
Rob Rix	0e2f57821e	Add a function dividing a graph in two.	2017-03-10 11:55:46 -05:00