Rob Rix
|
26400a24a8
|
Import & run the OrderedMapSpec spec.
|
2015-12-14 17:49:40 -05:00 |
|
Rob Rix
|
40f6df8b5d
|
Merge branch 'master' into ordered-map
|
2015-12-14 17:35:08 -05:00 |
|
Josh Vera
|
6850b402d4
|
Merge pull request #326 from github/post-process-leaf-nodes-in-terms
Post process leaf nodes in terms
|
2015-12-14 17:20:16 -05:00 |
|
Rob Rix
|
86cf5df9e7
|
Merge pull request #327 from github/remove-info-line-range
Remove line range from Info
|
2015-12-14 17:20:12 -05:00 |
|
Rob Rix
|
2cdbc9ad5e
|
Update the tests to point at OrderedMap.
|
2015-12-14 17:15:44 -05:00 |
|
joshvera
|
f5dadfd964
|
fix tests
|
2015-12-14 16:09:12 -05:00 |
|
Rob Rix
|
cded6c0d7d
|
Get the substrings out at the same time as computing the ranges.
|
2015-12-14 15:37:30 -05:00 |
|
Rob Rix
|
fdb1a6a9f7
|
Correct the tests.
|
2015-12-14 15:33:16 -05:00 |
|
Rob Rix
|
06a826c5f0
|
Merge branch 'master' into post-process-leaf-nodes-in-terms
|
2015-12-14 15:28:04 -05:00 |
|
Rob Rix
|
9d61286d81
|
Take only maxLength elements for keyed nodes.
|
2015-12-14 15:18:56 -05:00 |
|
Rob Rix
|
32d460bce7
|
Rename n to maxDepth .
|
2015-12-14 15:18:16 -05:00 |
|
Rob Rix
|
686325bf4c
|
Rename m to maxLength .
|
2015-12-14 15:17:26 -05:00 |
|
Rob Rix
|
5c90ecde8e
|
Use the cube of the max length, not the square.
I.e. shrink the produces lists.
|
2015-12-14 15:15:56 -05:00 |
|
Rob Rix
|
33c0dacd55
|
Take m, not n.
|
2015-12-14 15:13:32 -05:00 |
|
Rob Rix
|
2f726d4ba6
|
🔥 ArbitraryDiff .
|
2015-12-14 15:12:07 -05:00 |
|
Rob Rix
|
a93908a5f8
|
Test the reflexivity of Diff equality by generating a pair of terms and diffing them.
|
2015-12-14 15:11:59 -05:00 |
|
Rob Rix
|
2e5d85748b
|
Capture the construction of strictly smaller terms in the where clause.
|
2015-12-14 15:08:32 -05:00 |
|
Rob Rix
|
3e22121d66
|
Test that the offset is applied.
|
2015-12-14 12:53:14 -05:00 |
|
Rob Rix
|
48464ac552
|
Test that we skip whitespace at the end.
|
2015-12-14 12:52:37 -05:00 |
|
Rob Rix
|
bfdf388b5c
|
Test that we skip whitespace at the start.
|
2015-12-14 12:52:01 -05:00 |
|
Rob Rix
|
7bf7d22d8e
|
Test that multiple whitespace characters are skipped.
|
2015-12-14 12:51:23 -05:00 |
|
Rob Rix
|
1bdfa51702
|
Test that multiple words → multiple ranges.
|
2015-12-14 12:49:01 -05:00 |
|
Rob Rix
|
da6995ae54
|
Test that a single word string is covered by the returned range.
|
2015-12-14 12:48:04 -05:00 |
|
Rob Rix
|
fca022109c
|
Uh, ok.
|
2015-12-14 12:47:51 -05:00 |
|
Rob Rix
|
ce5854e019
|
Test that the empty string doesn’t have any word ranges in it.
|
2015-12-14 12:46:53 -05:00 |
|
Rob Rix
|
8951bebfa7
|
Test that rangesOfWordsFrom doesn’t produce words for whitespace.
|
2015-12-14 12:46:20 -05:00 |
|
Rob Rix
|
7bc4c62151
|
Increase the probability of leaves as a cheap way speed up the tests.
|
2015-12-11 16:11:10 -05:00 |
|
Rob Rix
|
14e861da35
|
Test that diffing a term against itself produces a zero-cost diff.
|
2015-12-11 16:10:22 -05:00 |
|
Rob Rix
|
3bb9e704bf
|
Remove the Arbitrary instance for Diff.
|
2015-12-11 16:07:11 -05:00 |
|
Rob Rix
|
0aa3154434
|
Test properties over ArbitraryDiff.
|
2015-12-11 16:07:06 -05:00 |
|
Rob Rix
|
c79113c18c
|
ArbitraryDiff is Arbitrary.
|
2015-12-11 16:06:14 -05:00 |
|
Rob Rix
|
86d95d1d86
|
unDiff interprets diffs.
|
2015-12-11 16:04:41 -05:00 |
|
Rob Rix
|
21b2d7fdfd
|
Stub in an ArbitraryDiff type.
|
2015-12-11 16:03:04 -05:00 |
|
Rob Rix
|
fa4e5011ac
|
Test diff equality reflexivity.
|
2015-12-11 16:02:08 -05:00 |
|
Rob Rix
|
f9a72f75e1
|
Add a silly Arbitrary instance for Diff.
|
2015-12-11 16:02:02 -05:00 |
|
Rob Rix
|
d07cd36e40
|
CategorySet is Arbitrary.
|
2015-12-11 16:01:46 -05:00 |
|
Rob Rix
|
64c4787d81
|
CategorySet is Categorizable.
|
2015-12-11 16:01:40 -05:00 |
|
Rob Rix
|
90b3da2291
|
Add a fixed-member CategorySet type.
|
2015-12-11 16:01:28 -05:00 |
|
Rob Rix
|
f667109c28
|
Test _Term_ equality, not ArbitraryTerm equality.
|
2015-12-11 15:51:25 -05:00 |
|
Rob Rix
|
97ff45bd28
|
Remove an obsolete import.
|
2015-12-11 15:50:35 -05:00 |
|
Rob Rix
|
066e0511d1
|
🔥 arbitraryBounded.
|
2015-12-11 15:47:43 -05:00 |
|
Rob Rix
|
50090dd73a
|
Make leaves likelier.
|
2015-12-11 15:47:23 -05:00 |
|
Rob Rix
|
91317207fe
|
Resume generating arbitrary keyed nodes.
|
2015-12-11 15:47:19 -05:00 |
|
Rob Rix
|
9ece0af975
|
Bound depth by the cube root of the size parameter, and length by the square root.
|
2015-12-11 15:41:35 -05:00 |
|
Rob Rix
|
d9bb395f2c
|
Remove the Arbitrary instance for Syntax.
|
2015-12-11 15:03:30 -05:00 |
|
Rob Rix
|
2646ebf4ae
|
We need this import for liftM.
|
2015-12-11 15:03:19 -05:00 |
|
Rob Rix
|
77c9970f25
|
Don’t bind a variable for n .
|
2015-12-11 15:03:03 -05:00 |
|
Rob Rix
|
3efa6e6ff4
|
Recur into arbitrary , and produce arbitrary Keyed nodes.
|
2015-12-11 15:02:29 -05:00 |
|
Rob Rix
|
76f78234aa
|
Define shrink by case analysis.
|
2015-12-11 15:01:44 -05:00 |
|
Rob Rix
|
2e97bf44fc
|
Generate arbitrary Fixed terms with bounds &c.
|
2015-12-11 14:40:29 -05:00 |
|