Applying a function to a nested listNested List ProductExtract function argumentsCreating a simple function...

Why do freehub and cassette have only one position that matches?

If Melisandre foresaw another character closing blue eyes, why did she follow Stannis?

Write to EXCEL from SQL DB using VBA script

How could a planet have most of its water in the atmosphere?

Was Unix ever a single-user OS?

What happened to Rhaegal?

Can a cyclic Amine form an Amide?

If 1. e4 c6 is considered as a sound defense for black, why is 1. c3 so rare?

Is it cheaper to drop cargo than to land it?

Why is the SNP putting so much emphasis on currency plans?

Binary Numbers Magic Trick

Historically, were women trained for obligatory wars? Or did they serve some other military function?

Why do computer-science majors learn calculus?

Has any spacecraft ever had the ability to directly communicate with civilian air traffic control?

If Earth is tilted, why is Polaris always above the same spot?

Topological Spaces homeomorphic

What is the word which sounds like "shtrass"?

Why are notes ordered like they are on a piano?

Packet sniffer for MacOS Mojave and above

Survey Confirmation - Emphasize the question or the answer?

What is the limiting factor for a CAN bus to exceed 1Mbps bandwidth?

Does higher resolution in an image imply more bits per pixel?

Power LED from 3.3V Power Pin without Resistor

When and why did journal article titles become descriptive, rather than creatively allusive?



Applying a function to a nested list


Nested List ProductExtract function argumentsCreating a simple function to compute the average of the difference between pairs of elements in an arraySorting non-numerical listsExtract part of list by reading it in a cyclic mannerApplying a function along the desired dimensions of a n-dimensional arrayManipulating Elements in a Triple-Nested ListApplying function to all elements of the list of listApplying a function to a list of symbolic ratiosApplying a function to a list (compounding)













1












$begingroup$


Say I have a list:



l = {{{a, b}, c}, d}


I now want to apply a function, call it F to that list in a way that I go from the lowest to highest level, i.e. 



F[{F[{F[{a,b}], c}] , d}]


Is there a function in Mathematica which does exactly that?






list-manipulation functions







share|improve this question











$endgroup$








  • 4




    $begingroup$
    Why does the order for d and c change, and not for a and b?
    $endgroup$
    – Carl Woll
    4 hours ago










  • $begingroup$
    My mistake, thank you for spotting that. I edited it.
    $endgroup$
    – amator2357
    4 hours ago
















1












$begingroup$


Say I have a list:



l = {{{a, b}, c}, d}


I now want to apply a function, call it F to that list in a way that I go from the lowest to highest level, i.e. 



F[{F[{F[{a,b}], c}] , d}]


Is there a function in Mathematica which does exactly that?






list-manipulation functions







share|improve this question











$endgroup$








  • 4




    $begingroup$
    Why does the order for d and c change, and not for a and b?
    $endgroup$
    – Carl Woll
    4 hours ago










  • $begingroup$
    My mistake, thank you for spotting that. I edited it.
    $endgroup$
    – amator2357
    4 hours ago














1












1








1





$begingroup$


Say I have a list:



l = {{{a, b}, c}, d}


I now want to apply a function, call it F to that list in a way that I go from the lowest to highest level, i.e. 



F[{F[{F[{a,b}], c}] , d}]


Is there a function in Mathematica which does exactly that?






list-manipulation functions







share|improve this question











$endgroup$




Say I have a list:



l = {{{a, b}, c}, d}


I now want to apply a function, call it F to that list in a way that I go from the lowest to highest level, i.e. 



F[{F[{F[{a,b}], c}] , d}]


Is there a function in Mathematica which does exactly that?






list-manipulation functions




list-manipulation functions






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 4 hours ago







amator2357

















asked 5 hours ago









amator2357amator2357

4538




4538








  • 4




    $begingroup$
    Why does the order for d and c change, and not for a and b?
    $endgroup$
    – Carl Woll
    4 hours ago










  • $begingroup$
    My mistake, thank you for spotting that. I edited it.
    $endgroup$
    – amator2357
    4 hours ago














  • 4




    $begingroup$
    Why does the order for d and c change, and not for a and b?
    $endgroup$
    – Carl Woll
    4 hours ago










  • $begingroup$
    My mistake, thank you for spotting that. I edited it.
    $endgroup$
    – amator2357
    4 hours ago








4




4




$begingroup$
Why does the order for d and c change, and not for a and b?
$endgroup$
– Carl Woll
4 hours ago




$begingroup$
Why does the order for d and c change, and not for a and b?
$endgroup$
– Carl Woll
4 hours ago












$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
4 hours ago




$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
4 hours ago










4 Answers
4






active

oldest

votes


















2












$begingroup$

Replace[l, x_List :> F[x], All]



F[{F[{F[{a, b}], c}], d}]




Also



ClearAll[f]

f[Except[_List, x_]] := x;

MapAll[f, l]



f[{f[{f[{a, b}], c}], d}]







share|improve this answer









$endgroup$





















    1












    $begingroup$

    F@*Reverse@Map[F@*Reverse, l, -2]



    F[{d, F[{c, F[{b, a}]}]}]




    Fold[F[{#2, #1}] &, Flatten[l]]



    F[{d, F[{c, F[{b, a}]}]}]







    share|improve this answer









    $endgroup$













    • $begingroup$
      I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
      $endgroup$
      – J42161217
      4 hours ago



















    1












    $begingroup$

    Another possibility, if you want just lists to acquire the F wrapper:



    l /. List -> F@*List



    F[{F[{F[{a, b}], c}], d}]







    share|improve this answer









    $endgroup$





















      0












      $begingroup$

      This works:



      {{{a, b}, c}, d} //. {{s_?ListQ, t_?(Not@*ListQ)} :> {f[s], t}} // f


      It's a bit hackish because of the separate invocation of f at the end, but it returns the desired result.






      share|improve this answer









      $endgroup$














        Your Answer








        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%2f197329%2fapplying-a-function-to-a-nested-list%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        4 Answers
        4






        active

        oldest

        votes








        4 Answers
        4






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        2












        $begingroup$

        Replace[l, x_List :> F[x], All]



        F[{F[{F[{a, b}], c}], d}]




        Also



        ClearAll[f]
        
f[Except[_List, x_]] := x;
        
MapAll[f, l]



        f[{f[{f[{a, b}], c}], d}]







        share|improve this answer









        $endgroup$


















          2












          $begingroup$

          Replace[l, x_List :> F[x], All]



          F[{F[{F[{a, b}], c}], d}]




          Also



          ClearAll[f]
          
f[Except[_List, x_]] := x;
          
MapAll[f, l]



          f[{f[{f[{a, b}], c}], d}]







          share|improve this answer









          $endgroup$
















            2












            2








            2





            $begingroup$

            Replace[l, x_List :> F[x], All]



            F[{F[{F[{a, b}], c}], d}]




            Also



            ClearAll[f]
            
f[Except[_List, x_]] := x;
            
MapAll[f, l]



            f[{f[{f[{a, b}], c}], d}]







            share|improve this answer









            $endgroup$



            Replace[l, x_List :> F[x], All]



            F[{F[{F[{a, b}], c}], d}]




            Also



            ClearAll[f]
            
f[Except[_List, x_]] := x;
            
MapAll[f, l]



            f[{f[{f[{a, b}], c}], d}]








            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 3 hours ago









            kglrkglr

            190k10209427




            190k10209427























                1












                $begingroup$

                F@*Reverse@Map[F@*Reverse, l, -2]



                F[{d, F[{c, F[{b, a}]}]}]




                Fold[F[{#2, #1}] &, Flatten[l]]



                F[{d, F[{c, F[{b, a}]}]}]







                share|improve this answer









                $endgroup$













                • $begingroup$
                  I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                  $endgroup$
                  – J42161217
                  4 hours ago
















                1












                $begingroup$

                F@*Reverse@Map[F@*Reverse, l, -2]



                F[{d, F[{c, F[{b, a}]}]}]




                Fold[F[{#2, #1}] &, Flatten[l]]



                F[{d, F[{c, F[{b, a}]}]}]







                share|improve this answer









                $endgroup$













                • $begingroup$
                  I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                  $endgroup$
                  – J42161217
                  4 hours ago














                1












                1








                1





                $begingroup$

                F@*Reverse@Map[F@*Reverse, l, -2]



                F[{d, F[{c, F[{b, a}]}]}]




                Fold[F[{#2, #1}] &, Flatten[l]]



                F[{d, F[{c, F[{b, a}]}]}]







                share|improve this answer









                $endgroup$



                F@*Reverse@Map[F@*Reverse, l, -2]



                F[{d, F[{c, F[{b, a}]}]}]




                Fold[F[{#2, #1}] &, Flatten[l]]



                F[{d, F[{c, F[{b, a}]}]}]








                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered 4 hours ago









                Henrik SchumacherHenrik Schumacher

                61.3k585171




                61.3k585171












                • $begingroup$
                  I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                  $endgroup$
                  – J42161217
                  4 hours ago


















                • $begingroup$
                  I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                  $endgroup$
                  – J42161217
                  4 hours ago
















                $begingroup$
                I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                $endgroup$
                – J42161217
                4 hours ago




                $begingroup$
                I think that Flatten works in this trivial case but it will not "find" the levels in a more complex situation
                $endgroup$
                – J42161217
                4 hours ago











                1












                $begingroup$

                Another possibility, if you want just lists to acquire the F wrapper:



                l /. List -> F@*List



                F[{F[{F[{a, b}], c}], d}]







                share|improve this answer









                $endgroup$


















                  1












                  $begingroup$

                  Another possibility, if you want just lists to acquire the F wrapper:



                  l /. List -> F@*List



                  F[{F[{F[{a, b}], c}], d}]







                  share|improve this answer









                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$

                    Another possibility, if you want just lists to acquire the F wrapper:



                    l /. List -> F@*List



                    F[{F[{F[{a, b}], c}], d}]







                    share|improve this answer









                    $endgroup$



                    Another possibility, if you want just lists to acquire the F wrapper:



                    l /. List -> F@*List



                    F[{F[{F[{a, b}], c}], d}]








                    share|improve this answer












                    share|improve this answer



                    share|improve this answer










                    answered 2 hours ago









                    Carl WollCarl Woll

                    76.4k3100200




                    76.4k3100200























                        0












                        $begingroup$

                        This works:



                        {{{a, b}, c}, d} //. {{s_?ListQ, t_?(Not@*ListQ)} :> {f[s], t}} // f


                        It's a bit hackish because of the separate invocation of f at the end, but it returns the desired result.






                        share|improve this answer









                        $endgroup$


















                          0












                          $begingroup$

                          This works:



                          {{{a, b}, c}, d} //. {{s_?ListQ, t_?(Not@*ListQ)} :> {f[s], t}} // f


                          It's a bit hackish because of the separate invocation of f at the end, but it returns the desired result.






                          share|improve this answer









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            This works:



                            {{{a, b}, c}, d} //. {{s_?ListQ, t_?(Not@*ListQ)} :> {f[s], t}} // f


                            It's a bit hackish because of the separate invocation of f at the end, but it returns the desired result.






                            share|improve this answer









                            $endgroup$



                            This works:



                            {{{a, b}, c}, d} //. {{s_?ListQ, t_?(Not@*ListQ)} :> {f[s], t}} // f


                            It's a bit hackish because of the separate invocation of f at the end, but it returns the desired result.







                            share|improve this answer












                            share|improve this answer



                            share|improve this answer










                            answered 3 hours ago









                            ShredderroyShredderroy

                            1,6101117




                            1,6101117






























                                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%2f197329%2fapplying-a-function-to-a-nested-list%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

                                Why does my Macbook overheat and use so much CPU and energy when on YouTube?Why do so many insist on using...

                                Image
                                Can a cyclic Amine form an Amide? Feels like I am getting dragged into office politics Airbnb - host wants to reduce rooms, can we get refund? How to scale a verbatim environment on a minipage? You look catfish vs You look like a catfish? When and why did journal article titles become descriptive, rather than creatively allusive? Attending a conference where my ex-supervisor and his collaborator are present, should I attend? Save terminal output to a txt file What happened to Rhaegal? Visa for volunteering in England Historically, were women trained for obligatory wars? Or did they serve some
                                Read more

                                How to prevent page numbers from appearing on glossaries?How to remove a dot and a page number in the...

                                Image
                                Contradiction proof for inequality of P and NP? Providing evidence of Consent of Parents for Marriage by minor in England in early 1800s? Can we say “you can pay when the order gets ready”? Is there really no use for MD5 anymore? Can an Area of Effect spell cast outside a Prismatic Wall extend inside it? If a planet has 3 moons, is it possible to have triple Full/New Moons at once? Minor Revision with suggestion of an alternative proof by reviewer Why did C use the -> operator instead of reusing the . operator? Critique of timeline aesthetic "The cow" OR "a cow" OR "cows" in this context
                                Read more

                                Puerta de Hutt Referencias Enlaces externos Menú de navegación15°58′00″S 5°42′00″O /...

                                Image
                                Localidades de Santa Elena inglésasentamientoisla Santa ElenaLongwoodIglesia de San MateoPico de DianaNapoleón BonaparteHenri Gratien BertrandAlarma ForestalLevelwoodSan Pablo Puerta de Hutt Hutt's Gate Asentamiento Puerta de Hutt Hutt's Gate Coordenadas 15°58′00″S 5°42′00″O  /  -15.96666667, -5.7 Coordenadas: 15°58′00″S 5°42′00″O  /  -15.96666667, -5.7 Entidad Asentamiento  • País   Reino Unido  • Territorio de ultramar   Santa Elena, Ascensión y Tristán de Acuña  • Isla Santa Elena Huso horario UTC+0 [editar datos en Wikidata] Puerta de Hutt (en inglés: Hutt's Gate ) es un pequeño asentamiento ubicado en la isla Santa Elena, que forma parte del distrito de Longwood. Se ubica en las coordenadas 15°58′00″S 5°42′00″O  /  -15.96667, -5.70000 . [ 1 ] ​ Aquí se localiza la Iglesia de San Mateo y en sus cercanías el Pico de Diana [ 2 ] ​ y la tumba de Napoleón Bonaparte. Es una amplia zona residencial y cuent
                                Read more