static LS aggressivelyCollectPossibleComputerIDs(S s) { new LinkedHashSet<S> ids; for i over s: { int j = i; while (j < l(s) && Character.isLowerCase(s.charAt(j))) ++j; if (j-i == 12) ids.add(substring(s, i, j)); i = j; } ret asList(ids); }
Began life as a copy of #1007698
download show line numbers debug dex old transpilations
Travelled to 11 computer(s): bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, irmadwmeruwu, ishqpsrjomds, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1019728 |
| Snippet name: | aggressivelyCollectPossibleComputerIDs |
| Eternal ID of this version: | #1019728/6 |
| Text MD5: | edb49dd6dd14ff5e35e2ec50ab57319a |
| Author: | stefan |
| Category: | javax |
| Type: | JavaX fragment (include) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2018-11-24 01:54:39 |
| Source code size: | 280 bytes / 11 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 610 / 649 |
| Version history: | 5 change(s) |
| Referenced in: | [show references] |