1 | static L<S> ellipsisTerms(S pat) {
|
2 | int i = indexOf(pat, "..."); |
3 | if (i < 0) ret ll(ai_getIndexedTerm(pat)); |
4 | S prefix = substring(pat, 0, i), suffix = substring(pat, i+3); |
5 | ret endingWithIC(suffix, fullTermsStartingWith(prefix)); |
6 | } |
Began life as a copy of #1013315
download show line numbers debug dex old transpilations
Travelled to 13 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1013457 |
| Snippet name: | ellipsisTerms - terms matching an ellipsis pattern ("the ... rule") |
| Eternal ID of this version: | #1013457/4 |
| Text MD5: | 8984ad795aca9e1966e3e12394454349 |
| Author: | stefan |
| Category: | javax / parsing |
| Type: | JavaX fragment (include) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2018-01-07 13:02:47 |
| Source code size: | 241 bytes / 6 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 353 / 386 |
| Version history: | 3 change(s) |
| Referenced in: | [show references] |