Rob Rix
fe708485e7
Clean up the readFile helper.
2017-06-15 11:28:00 -04:00
Rob Rix
0ea0417fb1
Merge pull request #1162 from github/optimize-for-large-nested-branches
...
Optimize for large nested branches
2017-06-15 11:24:31 -04:00
Rob Rix
2dfd3322a2
Merge branch 'master' into optimize-for-large-nested-branches
2017-06-15 11:02:00 -04:00
Rob Rix
b6d52051dc
Merge pull request #1163 from github/i-c-u-later
...
🔥 icu, text-icu, & gitlib
2017-06-15 11:01:30 -04:00
Rob Rix
f5be57daf3
Ignore all .hp/.prof files.
2017-06-15 10:49:23 -04:00
Rob Rix
ed2c60608f
Correct the CommandSpec.
2017-06-15 10:17:41 -04:00
Rob Rix
60d822f9bc
Use a strict & partially unpacked structure for mapping terms.
2017-06-15 10:10:48 -04:00
Rob Rix
eaa98912de
Bounds are closed ranges.
2017-06-15 10:06:15 -04:00
Rob Rix
2b46a7a347
Reverse the generated lists.
2017-06-15 10:04:48 -04:00
Rob Rix
93f61519b7
Update the featureVectorDecorator bounds test.
2017-06-15 09:46:51 -04:00
Rob Rix
46cfee6e28
Update the RWS spec.
2017-06-15 09:44:46 -04:00
Rob Rix
1f4eb8e475
Avoid the indirection through Maybe.
2017-06-15 09:44:09 -04:00
Rob Rix
b5cb522d62
Unpack a few fields.
2017-06-15 09:36:04 -04:00
Rob Rix
7e05cec95f
Unbox feature vectors.
2017-06-15 09:20:31 -04:00
Rob Rix
c12a2465a5
RWS employs strict state.
2017-06-15 09:10:58 -04:00
Rob Rix
e15f5ad7ab
Fold strictly.
2017-06-15 08:57:07 -04:00
Rob Rix
11859c9b51
Generate the lists of terms & diffs purely.
2017-06-15 08:55:23 -04:00
Rob Rix
655fab9277
Implement RWS directly.
2017-06-15 08:46:40 -04:00
Rob Rix
1aba30158b
Re-export the whole module.
2017-06-15 08:32:50 -04:00
Rob Rix
60323b7f5c
Simplify Command to just be Command.Files.
2017-06-15 08:32:08 -04:00
Rob Rix
bd03bbf779
🔥 another redundant import.
2017-06-14 23:21:54 -04:00
Rob Rix
a815960132
🔥 redundant variables and imports.
2017-06-14 23:20:12 -04:00
Rob Rix
83f8612c35
🔥 unused variables.
2017-06-14 23:18:35 -04:00
Rob Rix
64b018065c
Pretty, pretty 🔥
2017-06-14 17:59:52 -04:00
Rob Rix
779d9fc164
More spec 🔥
2017-06-14 17:54:29 -04:00
Rob Rix
fed4d93a46
Gitlib gone too.
2017-06-14 17:54:21 -04:00
Rob Rix
de325b2aab
🔥 a bunch of specs.
2017-06-14 17:49:33 -04:00
Rob Rix
a7a39a6e49
🔥 showsQuaternaryWith.
2017-06-14 17:49:28 -04:00
Rob Rix
f7c3f1153c
🔥 a couple of redundant imports.
2017-06-14 17:48:05 -04:00
Rob Rix
992ef93c0b
Git gone.
2017-06-14 17:47:31 -04:00
Rob Rix
1caff48253
Fiddle while ICU 🔥 s.
2017-06-14 17:37:36 -04:00
Rob Rix
b71f711102
This is a nice linker you have here. It’d be a shame if anything were to happen to it.
2017-06-14 17:35:50 -04:00
Rob Rix
826461e8e2
🔥 text-icu.
2017-06-14 17:34:26 -04:00
Rob Rix
17f577b3f3
Merge branch 'master' into optimize-for-large-nested-branches
2017-06-14 16:56:09 -04:00
Rob Rix
cc26137954
Unpack Endpoint coordinates.
2017-06-14 16:09:48 -04:00
Rob Rix
9cef2b2cd6
Slide down diagonals along both axes.
2017-06-14 16:04:04 -04:00
Rob Rix
e1f2e988ed
Moving/sliding doesn’t need to close over anything in searchAlongK.
2017-06-14 14:55:34 -04:00
Rob Rix
36392ca0f9
Avoid a let binding in searchAlongK.
2017-06-14 14:44:22 -04:00
Rob Rix
7a8780f8e8
🔥 the cost centres for prev/next.
2017-06-14 14:41:54 -04:00
Rob Rix
cc72a864e0
Bind getK, prev, & next in the where clause.
2017-06-14 14:41:28 -04:00
Timothy Clem
ec8e0d5cf3
Merge pull request #1161 from github/root-source-slicing-fix
...
Fix bug in slicing `Source` for root node
2017-06-14 11:32:01 -06:00
Rob Rix
641653bb5e
Factor the k pairing into searchAlongK.
2017-06-14 13:03:59 -04:00
Rob Rix
6971dc8220
Factor out the predicate on endpoints.
2017-06-14 13:03:09 -04:00
Timothy Clem
fecf3d4b41
Add a test for file that starts with newline
2017-06-14 11:01:12 -06:00
Rob Rix
7937ad4569
Replace state and update at most once per envelope.
2017-06-14 12:58:07 -04:00
Timothy Clem
f8ecbda145
Just ready in a lazy bytestring for aeson's decode
2017-06-14 10:33:38 -06:00
Timothy Clem
8f6d25b9d8
Properly slice source for root node
...
Fixes a nasty bug where source files that begin with a newline weren't
getting properly sliced at the root node (code was erroneously assuming
that the first node starts at byte 0). If a file starts with a newline
the program node ends up starting at byte 1 and everything afterward was
offset by one.
2017-06-14 10:29:11 -06:00
Rob Rix
c3b0e95c0f
Rename the cost centre for the insert.
2017-06-14 10:40:23 -04:00
Rob Rix
e43882e056
Use the standard definition of for.
2017-06-14 10:07:17 -04:00
Rob Rix
6b30cadb66
Give a simpler definition of for
.
2017-06-14 10:06:35 -04:00