Skip to main content

Timeline for "Unflattening" a list

Current License: CC BY-SA 3.0

16 events
when toggle format what by license comment
Apr 14, 2020 at 0:59 answer added kglr timeline score: 7
Nov 3, 2017 at 14:29 comment added Valerio Hi guys, can one use the new ArrayReshape?
Dec 31, 2014 at 18:37 comment added Austin Burk Code golf post inspired by this question: codegolf.stackexchange.com/questions/43018/unflatten-an-array
Apr 4, 2014 at 2:12 answer added luyuwuli timeline score: 4
Apr 3, 2014 at 21:33 comment added faysou related mathematica.stackexchange.com/q/45293/66
Aug 17, 2013 at 21:26 comment added Jacob Akkerboom @bills I feel Internal-Deflatten is also a candidate for the inverse of Flatten, and is worth mentioning :). See Szabolcs answer in the Q&A about undocumented functions. But yeah I guess it doesn't really help.
Aug 14, 2013 at 5:05 answer added Ray Koopman timeline score: 6
Aug 14, 2013 at 3:19 vote accept T.T.
Aug 14, 2013 at 3:02 history tweeted twitter.com/#!/StackMma/status/367481334417358848
Aug 14, 2013 at 2:37 answer added halirutan timeline score: 37
Aug 14, 2013 at 1:39 answer added Jonie timeline score: 5
Aug 14, 2013 at 0:58 review First posts
Aug 14, 2013 at 3:47
Aug 14, 2013 at 0:54 comment added Jonie I'd presume you can't actually save the previous structure. What you might be able to do is simply map the new elements back to list, ie. replacing elements in the old list with ones in the new list in order. This should be possible since you aren't increasing or decreasing the number of elements.
Aug 14, 2013 at 0:46 comment added T.T. @bill s Oh, I know about Partition. My question is how we can kind of save the previous structure of the list prior to flattening, and then reapply this hierarchical structuring (which can pretty much be arbitrary).
Aug 14, 2013 at 0:44 comment added bill s Partition is essentially the inverse of Flatten
Aug 14, 2013 at 0:42 history asked T.T. CC BY-SA 3.0