How do I transpose the first and deepest levels of an arbitrarily nested array? The Next CEO of Stack OverflowA question about transforming one List into two Lists with additional requirementsEmulating R data frame getters with UpValuesQuickly pruning elements in one structured array that exist in a separate unordered array`Part` like `Delete`: How to delete list of columns or arbitrarily deeper levelsHow to mesh a region using adaptive cubic elementsHow to efficiently Flatten nested lists while preserving select levels?Distribute elements of one line across arbitrary dimension of another listDeep level nested list addition`Transpose` nested `Association`How to extract the first element in nested lists

Are there any limitations on attacking while grappling?

Several mode to write the symbol of a vector

How did the Bene Gesserit know how to make a Kwisatz Haderach?

Are there any unintended negative consequences to allowing PCs to gain multiple levels at once in a short milestone-XP game?

What flight has the highest ratio of time difference to flight time?

Make solar eclipses exceedingly rare, but still have new moons

Preparing Indesign booklet with .psd graphics for print

Won the lottery - how do I keep the money?

If a black hole is created from light, can this black hole then move at speed of light?

How to invert MapIndexed on a ragged structure? How to construct a tree from rules?

Multiple labels for a single equation

How do I transpose the first and deepest levels of an arbitrarily nested array?

Inappropriate reference requests from Journal reviewers

Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?

Is there a way to save my career from absolute disaster?

If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?

Elegant way to replace substring in a regex with optional groups in Python?

What connection does MS Office have to Netscape Navigator?

Received an invoice from my ex-employer billing me for training; how to handle?

Do I need to enable Dev Hub in my PROD Org?

Is 'diverse range' a pleonastic phrase?

What is the purpose of the Evocation wizard's Potent Cantrip feature?

If the heap is zero-initialized for security, then why is the stack merely uninitialized?

How to start emacs in "nothing" mode (`fundamental-mode`)



How do I transpose the first and deepest levels of an arbitrarily nested array?



The Next CEO of Stack OverflowA question about transforming one List into two Lists with additional requirementsEmulating R data frame getters with UpValuesQuickly pruning elements in one structured array that exist in a separate unordered array`Part` like `Delete`: How to delete list of columns or arbitrarily deeper levelsHow to mesh a region using adaptive cubic elementsHow to efficiently Flatten nested lists while preserving select levels?Distribute elements of one line across arbitrary dimension of another listDeep level nested list addition`Transpose` nested `Association`How to extract the first element in nested lists










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 , ...;









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
    11 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
    11 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
    10 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba
    10 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
    10 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 , ...;









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
    11 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
    11 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
    10 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba
    10 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
    10 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 , ...;









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






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 1 hour ago









J. M. is slightly pensive

98.7k10311467




98.7k10311467










asked 11 hours ago









KubaKuba

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
    11 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
    11 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
    10 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba
    10 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
    10 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
    11 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
    11 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
    10 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba
    10 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
    10 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
11 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
11 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
11 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
11 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
10 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
10 hours ago













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




$begingroup$
@Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
$endgroup$
– Kuba
10 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
10 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
10 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$




















      2












      $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-first-and-deepest-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 10 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 11 hours ago









                    C. E.C. E.

                    50.9k399205




                    50.9k399205





















                        2












                        $begingroup$

                        Terrible solution using Table but works:



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





                        share|improve this answer









                        $endgroup$

















                          2












                          $begingroup$

                          Terrible solution using Table but works:



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





                          share|improve this answer









                          $endgroup$















                            2












                            2








                            2





                            $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 10 hours ago









                            RomanRoman

                            4,0161022




                            4,0161022



























                                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-first-and-deepest-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

                                Can not update quote_id field of “quote_item” table magento 2Magento 2.1 - We can't remove the item. (Shopping Cart doesnt allow us to remove items before becomes empty)Add value for custom quote item attribute using REST apiREST API endpoint v1/carts/cartId/items always returns error messageCorrect way to save entries to databaseHow to remove all associated quote objects of a customer completelyMagento 2 - Save value from custom input field to quote_itemGet quote_item data using quote id and product id filter in Magento 2How to set additional data to quote_item table from controller in Magento 2?What is the purpose of additional_data column in quote_item table in magento2Set Custom Price to Quote item magento2 from controller

                                How to solve knockout JS error in Magento 2 Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?(Magento2) knockout.js:3012 Uncaught ReferenceError: Unable to process bindingUnable to process binding Knockout.js magento 2Cannot read property `scopeLabel` of undefined on Product Detail PageCan't get Customer Data on frontend in Magento 2Magento2 Order Summary - unable to process bindingKO templates are not loading in Magento 2.1 applicationgetting knockout js error magento 2Product grid not load -— Unable to process binding Knockout.js magento 2Product form not loaded in magento2Uncaught ReferenceError: Unable to process binding “if: function()return (isShowLegend()) ” magento 2

                                Nissan Patrol Зміст Перше покоління — 4W60 (1951-1960) | Друге покоління — 60 series (1960-1980) | Третє покоління (1980–2002) | Четверте покоління — Y60 (1987–1998) | П'яте покоління — Y61 (1997–2013) | Шосте покоління — Y62 (2010- ) | Посилання | Зноски | Навігаційне менюОфіційний український сайтТест-драйв Nissan Patrol 2010 7-го поколінняNissan PatrolКак мы тестировали Nissan Patrol 2016рвиправивши або дописавши її