1
1
mirror of https://github.com/github/semantic.git synced 2024-12-20 21:31:48 +03:00
Commit Graph

8391 Commits

Author SHA1 Message Date
joshvera
bbc2c2b9b2 Add the empty statement 2016-08-19 15:53:04 -04:00
joshvera
b6f92792ac ++tree-sitter-parsers 2016-08-19 14:37:13 -04:00
Josh Vera
08b591db7b Merge pull request #740 from github/intmap-intersections-in-rws
IntMap intersections in RWS
2016-08-19 13:16:03 -04:00
Rob Rix
b0c8f93d70 Add a type signature for findNearestNeighbourTo. 2016-08-19 13:12:59 -04:00
Rob Rix
b5c67da74b Add a type signature for nearestUnmapped. 2016-08-19 13:10:35 -04:00
Rob Rix
6b69095a71 Merge branch 'master' into intmap-intersections-in-rws 2016-08-19 11:41:16 -04:00
Josh Vera
9c8ebd0566 Merge pull request #739 from github/eschew-discontinuity
Disallow moves beyond a given bound.
2016-08-19 11:40:57 -04:00
Rob Rix
db6679a912 Use IntMap intersections to define nearestUnmapped. 2016-08-19 11:36:46 -04:00
Rob Rix
1385e9193f 🔥 a redundant import. 2016-08-19 11:35:32 -04:00
Rob Rix
1627ab0e26 🔥 a redundant binding. 2016-08-18 17:53:29 -04:00
Rob Rix
1b2271e479 Maintain IntMaps of unmapped elements. 2016-08-18 17:53:17 -04:00
Rob Rix
10ca6f60b6 Revert "Construct IntMaps of the lists of inputs."
This reverts commit 8d62477ee805d45603d6c84fdeea59b341153c00.
2016-08-18 17:49:40 -04:00
Rob Rix
124e7b51da Revert "Traverse & delete remaining unmapped terms in IntMap."
This reverts commit 7f3f842657b8cd9b1e5c60ae81e5fcaa44f1b1e4.
2016-08-18 17:49:33 -04:00
Rob Rix
bff81035d8 Traverse & delete remaining unmapped terms in IntMap. 2016-08-18 17:41:27 -04:00
Rob Rix
3e94a6a9dd Construct IntMaps of the lists of inputs. 2016-08-18 17:28:35 -04:00
Rob Rix
a83faecdfd So, apparently 3 is the magic number today. 2016-08-18 17:04:10 -04:00
Rob Rix
d4cbba043d Disallow moves beyond a given bound.
🎩 @rewinfrey
2016-08-18 16:59:57 -04:00
Rob Rix
7009d9ac2b Move the multiple hunks fixture back to the main diffs list. 2016-08-18 15:33:14 -04:00
Josh Vera
ffe99f84d9 Merge pull request #733 from github/account-for-false-positives
Account for false positives
2016-08-18 15:04:57 -04:00
Rob Rix
6765a9e764 Use the default parameters when diffing. 2016-08-18 14:04:25 -04:00
Rob Rix
00689650dd Use the defaultFeatureVectorDecorator in the tests. 2016-08-18 14:03:36 -04:00
Rob Rix
1473c10659 Add a defaultFeatureVectorDecorator function. 2016-08-18 14:02:48 -04:00
Rob Rix
900a0b7a1f Use the global l/m defaults. 2016-08-18 14:00:40 -04:00
Rob Rix
3e01b1cd13 Add bindings for the default values of the variables. 2016-08-18 13:59:34 -04:00
Rob Rix
2706ed262e Rename constantTimeEditDistance to editDistanceUpTo. 2016-08-18 13:44:27 -04:00
Rob Rix
627ae0552c Revert "Extract a Comparator type synonym."
This reverts commit 1aa2b093f0f45815b73c8ad172cf507d2d7ed6ec.
2016-08-18 12:54:52 -04:00
Rob Rix
3fb0ba5ddf constantTimeEditDistance takes a diff. 2016-08-18 12:54:41 -04:00
Rob Rix
d169e6fa66 Spacing. 2016-08-18 12:51:07 -04:00
Rob Rix
12f6ce9fa4 Merge remote-tracking branch 'origin/account-for-false-positives' into account-for-false-positives 2016-08-18 12:50:26 -04:00
Rob Rix
f49527a268 Export constantTimeEditDistance. 2016-08-18 12:50:15 -04:00
Rob Rix
ddbcb0cd18 Roll diffCostOfMaybes into constantTimeEditDistance. 2016-08-18 12:50:03 -04:00
Rick Winfrey
52ace63c81 Merge branch 'account-for-false-positives' of github.com:github/semantic-diff into account-for-false-positives 2016-08-18 11:49:33 -05:00
Rob Rix
e063d7e0cd constantTimeEditDistance is computed over terms. 2016-08-18 12:49:17 -04:00
Rob Rix
a184d5ad4b Extract constantTimeEditDistance to the top level. 2016-08-18 12:48:13 -04:00
Rob Rix
f2c5e88801 Extract a Comparator type synonym. 2016-08-18 12:48:01 -04:00
Rob Rix
29a0db2675 📝 l & m. 2016-08-18 12:42:57 -04:00
Rob Rix
ab2dfacab6 Bind a variable for m. 2016-08-18 12:38:39 -04:00
Rob Rix
0c4921b58c Bind a variable for l. 2016-08-18 12:38:28 -04:00
Rob Rix
3832a7b90f 📝 constantTimeEditDistance. 2016-08-18 12:35:24 -04:00
Rob Rix
ffad7170f0 Spacing. 2016-08-18 12:31:46 -04:00
Rob Rix
768703dc7e 📝 nearestUnmapped. 2016-08-18 12:27:26 -04:00
Rob Rix
b14a7765e6 Copy in b. 2016-08-18 11:40:39 -04:00
Rob Rix
ecaff655c1 Extract a function to copy terms in. 2016-08-18 11:40:33 -04:00
Rob Rix
cabf1a887e Compute recursive as copies instead of replacements.
This should make us more accurate to the tests of Interpreter.
2016-08-18 11:37:55 -04:00
Rob Rix
02bb72ee0b Move compare to the where clause. 2016-08-18 11:25:21 -04:00
Rob Rix
8aa0f082a6 Bump _q_ in all of the specs.
Figure it’s best if they use the same value for the parameter.
2016-08-18 11:23:21 -04:00
Rob Rix
d17f76bc60 Take surrounding context into account when computing bases.
```
1 `div` 2 = 0
2 `div` 2 = 1
3 `div` 2 = 1
```

etc.

This means that given _q_ = 3, the base for b in [a, b, c, d] will be
[a, b, c] instead of [b, c, d]. This means that grams encode limited
sibling ordering information both forwards and backwards, making them
slightly more stable.
2016-08-18 11:14:37 -04:00
Rob Rix
c3e0e9e7d4 Bump _q_ to 3. 2016-08-18 11:01:27 -04:00
Rob Rix
4cc090e92b Use Int instead of Integer. 2016-08-18 10:52:49 -04:00
Rob Rix
ceab42bab3 Merge branch 'master' into account-for-false-positives 2016-08-18 10:37:02 -04:00