Timeline for Concatenate strings from different levels of list
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2013 at 2:55 | comment | added | rm -rf♦ |
My interpretation was that the deeper ones will be ignored. Taking the above example, if they wanted to concatenate for "level 1" with its ancestors (taking "turen" to be level 0), then they'd get {"turen as", "turen al", "turen aj"...}. For level 2, they'd get the above list without the two word strings (i.e. "turen själ", "turen jäsa",...)
|
|
| Jan 13, 2013 at 2:39 | comment | added | Mr.Wizard | @rm-rf what is supposed to happen to the deeper elements then? | |
| Jan 13, 2013 at 2:24 | comment | added | rm -rf♦ | I think the question asked for a way to be able to join words up to some level X, not all the way. Or rather, start with an inner string at level X and prepend all its predecessors. | |
| Jan 13, 2013 at 1:39 | comment | added | Leonid Shifrin |
Looks like you've nailed it, +1. Generally, I found recursion to be more powerful than rules + ReplaceRepeated, but here apparently the latter is enough. Nice solution!
|
|
| Jan 13, 2013 at 1:27 | history | undeleted | Mr.Wizard | ||
| Jan 13, 2013 at 1:27 | history | edited | Mr.Wizard | CC BY-SA 3.0 |
added 330 characters in body
|
| Jan 13, 2013 at 0:57 | history | deleted | Mr.Wizard | ||
| Jan 13, 2013 at 0:53 | history | answered | Mr.Wizard | CC BY-SA 3.0 |