Download Jar. Uses 3874K of libraries. Click here for Pure Java version (7299L/54K).
!7 p-experiment { assertEqualsVerbose( //[[{"der"={"du"={"bist"=""}}, "die"={"wo"={"ich"={"kenne"=""}}}, "ich"={"kenne"=""}, "mag"=""}]], [[{"der"={"du"={"bist"=""}}, "die"={"ich"={"kenne"="", "mag"=""}, "wo"={"ich"={"kenne"=""}}}}]], print(sfu(listToWordTree(mechList("Häufige Relativsätze"), "")))); }
I think a word tree is a Map<S, O> where the values are more word trees or any kind of non-Map (=leaf). The keys are words or "<default>" to mix a leaf and a non-leaf.
download show line numbers debug dex old transpilations
Travelled to 15 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, irmadwmeruwu, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, onxytkatvevr, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1014223 |
| Snippet name: | Test listToWordTree (OK) |
| Eternal ID of this version: | #1014223/10 |
| Text MD5: | 86784ea8a73ce73829287fd4d77b4c3d |
| Transpilation MD5: | e3e4c063b6786fcda6e395b9755732c5 |
| Author: | stefan |
| Category: | javax / a.i. |
| Type: | JavaX source code (desktop) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2018-07-23 20:54:55 |
| Source code size: | 327 bytes / 8 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 439 / 1147 |
| Version history: | 9 change(s) |
| Referenced in: | [show references] |