How do I transpose the 1st and -1th levels of an arbitrarily nested array?












6












$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    5 hours ago










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    5 hours ago












  • $begingroup$
    Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago












  • $begingroup$
    @Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    5 hours ago


















6












$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    5 hours ago










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    5 hours ago












  • $begingroup$
    Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago












  • $begingroup$
    @Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    5 hours ago
















6












6








6





$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$




Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation




list-manipulation






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 39 mins ago









Peter Mortensen

33627




33627










asked 6 hours ago









Kuba♦Kuba

107k12210531




107k12210531












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    5 hours ago










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    5 hours ago












  • $begingroup$
    Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago












  • $begingroup$
    @Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    5 hours ago




















  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    5 hours ago










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    5 hours ago












  • $begingroup$
    Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago












  • $begingroup$
    @Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    5 hours ago


















$begingroup$
Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
$endgroup$
– Roman
5 hours ago




$begingroup$
Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
$endgroup$
– Roman
5 hours ago












$begingroup$
Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
$endgroup$
– Carl Woll
5 hours ago






$begingroup$
Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
$endgroup$
– Carl Woll
5 hours ago














$begingroup$
Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
$endgroup$
– Roman
5 hours ago






$begingroup$
Does your list always contain {a,b} at the lowest level, or can there be anything there as long as they're all of same length?
$endgroup$
– Roman
5 hours ago














$begingroup$
@Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
$endgroup$
– Kuba♦
5 hours ago




$begingroup$
@Roman Level[arr, {-2}]` should be a rectangular array but rows do not need to be the same.
$endgroup$
– Kuba♦
5 hours ago












$begingroup$
@Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
$endgroup$
– Roman
5 hours ago






$begingroup$
@Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
$endgroup$
– Roman
5 hours ago












3 Answers
3






active

oldest

votes


















8












$begingroup$

arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};



SetAttributes[f1, Listable]

Apply[f1, arr, {0, -3}] /. f1 -> List



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







share|improve this answer









$endgroup$





















    3












    $begingroup$

    This is what the list at the lowest level looks like:



    el = First@Level[list, {-2}];


    Using this, we can solve it with a rules-based approach:



    list /. el -> # & /@ el


    or a recursive approach like this:



    walk[lists : {__List}, i_] := walk[#, i] & /@ lists
    
walk[atoms : {__}, i_] := i
    
walk[list, #] & /@ el





    share|improve this answer









    $endgroup$





















      1












      $begingroup$

      Terrible solution using Table but works:



      Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





      share|improve this answer









      $endgroup$














        Your Answer





        StackExchange.ifUsing("editor", function () {
        return StackExchange.using("mathjaxEditing", function () {
        StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
        StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
        });
        });
        }, "mathjax-editing");

        StackExchange.ready(function() {
        var channelOptions = {
        tags: "".split(" "),
        id: "387"
        };
        initTagRenderer("".split(" "), "".split(" "), channelOptions);

        StackExchange.using("externalEditor", function() {
        // Have to fire editor after snippets, if snippets enabled
        if (StackExchange.settings.snippets.snippetsEnabled) {
        StackExchange.using("snippets", function() {
        createEditor();
        });
        }
        else {
        createEditor();
        }
        });

        function createEditor() {
        StackExchange.prepareEditor({
        heartbeatType: 'answer',
        autoActivateHeartbeat: false,
        convertImagesToLinks: false,
        noModals: true,
        showLowRepImageUploadWarning: true,
        reputationToPostImages: null,
        bindNavPrevention: true,
        postfix: "",
        imageUploader: {
        brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
        contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
        allowUrls: true
        },
        onDemand: true,
        discardSelector: ".discard-answer"
        ,immediatelyShowMarkdownHelp:true
        });


        }
        });














        draft saved

        draft discarded


















        StackExchange.ready(
        function () {
        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194206%2fhow-do-i-transpose-the-1st-and-1th-levels-of-an-arbitrarily-nested-array%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        8












        $begingroup$

        arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
        

        
SetAttributes[f1, Listable]
        
Apply[f1, arr, {0, -3}] /. f1 -> List



        {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







        share|improve this answer









        $endgroup$


















          8












          $begingroup$

          arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
          

          
SetAttributes[f1, Listable]
          
Apply[f1, arr, {0, -3}] /. f1 -> List



          {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







          share|improve this answer









          $endgroup$
















            8












            8








            8





            $begingroup$

            arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
            

            
SetAttributes[f1, Listable]
            
Apply[f1, arr, {0, -3}] /. f1 -> List



            {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







            share|improve this answer









            $endgroup$



            arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
            

            
SetAttributes[f1, Listable]
            
Apply[f1, arr, {0, -3}] /. f1 -> List



            {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}








            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 5 hours ago









            andre314andre314

            12.3k12352




            12.3k12352























                3












                $begingroup$

                This is what the list at the lowest level looks like:



                el = First@Level[list, {-2}];


                Using this, we can solve it with a rules-based approach:



                list /. el -> # & /@ el


                or a recursive approach like this:



                walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                
walk[atoms : {__}, i_] := i
                
walk[list, #] & /@ el





                share|improve this answer









                $endgroup$


















                  3












                  $begingroup$

                  This is what the list at the lowest level looks like:



                  el = First@Level[list, {-2}];


                  Using this, we can solve it with a rules-based approach:



                  list /. el -> # & /@ el


                  or a recursive approach like this:



                  walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                  
walk[atoms : {__}, i_] := i
                  
walk[list, #] & /@ el





                  share|improve this answer









                  $endgroup$
















                    3












                    3








                    3





                    $begingroup$

                    This is what the list at the lowest level looks like:



                    el = First@Level[list, {-2}];


                    Using this, we can solve it with a rules-based approach:



                    list /. el -> # & /@ el


                    or a recursive approach like this:



                    walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                    
walk[atoms : {__}, i_] := i
                    
walk[list, #] & /@ el





                    share|improve this answer









                    $endgroup$



                    This is what the list at the lowest level looks like:



                    el = First@Level[list, {-2}];


                    Using this, we can solve it with a rules-based approach:



                    list /. el -> # & /@ el


                    or a recursive approach like this:



                    walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                    
walk[atoms : {__}, i_] := i
                    
walk[list, #] & /@ el






                    share|improve this answer












                    share|improve this answer



                    share|improve this answer










                    answered 5 hours ago









                    C. E.C. E.

                    50.9k399205




                    50.9k399205























                        1












                        $begingroup$

                        Terrible solution using Table but works:



                        Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                        share|improve this answer









                        $endgroup$


















                          1












                          $begingroup$

                          Terrible solution using Table but works:



                          Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                          share|improve this answer









                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$

                            Terrible solution using Table but works:



                            Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                            share|improve this answer









                            $endgroup$



                            Terrible solution using Table but works:



                            Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]






                            share|improve this answer












                            share|improve this answer



                            share|improve this answer










                            answered 5 hours ago









                            RomanRoman

                            3,9761022




                            3,9761022






























                                draft saved

                                draft discarded




















































                                Thanks for contributing an answer to Mathematica Stack Exchange!


                                • Please be sure to answer the question. Provide details and share your research!

                                But avoid …



                                • Asking for help, clarification, or responding to other answers.

                                • Making statements based on opinion; back them up with references or personal experience.


                                Use MathJax to format equations. MathJax reference.


                                To learn more, see our tips on writing great answers.




                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function () {
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194206%2fhow-do-i-transpose-the-1st-and-1th-levels-of-an-arbitrarily-nested-array%23new-answer', 'question_page');
                                }
                                );

                                Post as a guest















                                Required, but never shown





















































                                Required, but never shown














                                Required, but never shown












                                Required, but never shown







                                Required, but never shown

































                                Required, but never shown














                                Required, but never shown












                                Required, but never shown







                                Required, but never shown







                                -

                                Popular posts from this blog

                                Costa Masnaga

                                Image
                                .mw-parser-output .avviso .mbox-text-div>div,.mw-parser-output .avviso .mbox-text-full-div>div{font-size:90%}.mw-parser-output .avviso .mbox-image div{width:52px}.mw-parser-output .avviso .mbox-text-full-div .hide-when-compact{display:block} Questa voce o sezione sull'argomento Lombardia non cita le fonti necessarie o quelle presenti sono insufficienti . Puoi migliorare questa voce aggiungendo citazioni da fonti attendibili secondo le linee guida sull'uso delle fonti. Segui i suggerimenti del progetto di riferimento. Costa Masnaga comune Localizzazione Stato   Italia Regione Lombardia Provincia Lecco Amministrazione Sindaco Sabina Panzeri (Al centro il cittadino) dall'08/06/2009 Territorio Coordinate 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Coordinate: 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Altitudine 318 m s.l.m...
                                Read more

                                Fotorealismo

                                Image
                                Guerrino Boatto, Venice's St. Barnaba Church and canal Il fotorealismo è un genere di pittura basato sull'uso di una o più fotografie dalle quali l'artista prende le informazioni necessarie da utilizzare poi nel processo della creazione dell'opera, in genere ad olio o ad acrilico, al fine di avere un aspetto finale il più simile possibile alla fotografia. Indice 1 Storia 2 Lista dei fotorealisti 3 Note 4 Voci correlate 5 Altri progetti Storia | Il fotorealismo è un movimento che nasce negli Stati Uniti d'America alla fine degli anni sessanta [1] sulla scia della Pop Art [2] [3] [4] , e insieme condividono il carattere reazionario verso la travolgente ascesa dei media, che alla metà del ventesimo secolo si trasforma in un fenomeno di massa talmente imponente da minacciare il valore dell'immagine nell'arte. [5] [6] Ne consegue così che, colto il gesto d'inizio che fu della Pop Art, i fotorealisti aprono ad un ...
                                Read more

                                Sidney Franklin

                                Image
                                Questa voce sull'argomento registi statunitensi è solo un abbozzo . Contribuisci a migliorarla secondo le convenzioni di Wikipedia. Sidney Franklin, foto di Carl Van Vechten Oscar alla memoria Irving G. Thalberg 1943 Sidney Franklin , all'anagrafe Sidney Arnold Franklin , (San Francisco, 21 marzo 1893 – Santa Monica, 18 maggio 1972), è stato un regista, produttore cinematografico e attore statunitense. Il 20 giugno 1963, si sposò con l'attrice australiana Enid Bennett. Il matrimonio durò fino alla morte dell'attrice, il 14 maggio 1969 [1] Indice 1 Filmografia 1.1 Regista 1.2 Aiuto regia (parziale) 1.3 Produttore 1.4 Attore (parziale) 2 Note 3 Altri progetti 4 Collegamenti esterni Filmografia | Regista | The Baby , co-regia Chester M. Franklin (1915) The Rivals , co-regia Chester M. Franklin (1915) Little Dick's First Case , co-regia Chester M. Franklin (1915) Her Filmland Hero , co-...
                                Read more