static boolean sentenceEq(S a, S b) { L<S> tok1 = parse3(a), tok2 = parse3(b); if (tok1.size() != tok2.size()) return false; for (int i = 0; i < tok1.size(); i++) if (!tok1.get(i).equalsIgnoreCase(tok2.get(i))) return false; return true; }
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: | #1001198 |
Snippet name: | sentenceEq |
Eternal ID of this version: | #1001198/1 |
Text MD5: | c58108ed0d77f88b33af331d52b7f11d |
Author: | stefan |
Category: | javax |
Type: | JavaX fragment (include) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2015-09-29 20:33:09 |
Source code size: | 280 bytes / 8 lines |
Pitched / IR pitched: | No / Yes |
Views / Downloads: | 698 / 984 |
Referenced in: | #1002427 - Accellerating 629 (SPIKE) #1006654 - Standard functions list 2 (LIVE, continuation of #761) #3000382 - Answer for ferdie (>> t = 1, f = 0) #3000383 - Answer for funkoverflow (>> t=1, f=0 okay) |