Apply Max to each element of a list [duplicate]












4















This question already has an answer here:




  • Applying a lower bound threshold on a list

    3 answers




I have a list



a = {1, 8, 0, 6, 5, 3, 5, 2, 2, 5}


I want to generate a new list whose elements are the same of a if it's bigger than 5, or 5 elsewhere.
I managed to achieve this using Map and a pure function doing



Map[(Max[#, 5]) &, a]


but this looks a bit clumsy to me. Is there a better way?



EDIT: I found this solution



a /. x_ /; x < 5 -> 5


but I cannot really understand why is working. Could someone give an insight into it?



Thanks






map







share|improve this question









New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











marked as duplicate by Kuba♦ 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.











  • 2




    Why not Max[#, 5] & /@ a ?
    – Mauro Lacy
    Jan 3 at 11:38
















4















This question already has an answer here:




  • Applying a lower bound threshold on a list

    3 answers




I have a list



a = {1, 8, 0, 6, 5, 3, 5, 2, 2, 5}


I want to generate a new list whose elements are the same of a if it's bigger than 5, or 5 elsewhere.
I managed to achieve this using Map and a pure function doing



Map[(Max[#, 5]) &, a]


but this looks a bit clumsy to me. Is there a better way?



EDIT: I found this solution



a /. x_ /; x < 5 -> 5


but I cannot really understand why is working. Could someone give an insight into it?



Thanks






map







share|improve this question









New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











marked as duplicate by Kuba♦ 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.











  • 2




    Why not Max[#, 5] & /@ a ?
    – Mauro Lacy
    Jan 3 at 11:38














4












4








4


0






This question already has an answer here:




  • Applying a lower bound threshold on a list

    3 answers




I have a list



a = {1, 8, 0, 6, 5, 3, 5, 2, 2, 5}


I want to generate a new list whose elements are the same of a if it's bigger than 5, or 5 elsewhere.
I managed to achieve this using Map and a pure function doing



Map[(Max[#, 5]) &, a]


but this looks a bit clumsy to me. Is there a better way?



EDIT: I found this solution



a /. x_ /; x < 5 -> 5


but I cannot really understand why is working. Could someone give an insight into it?



Thanks






map







share|improve this question









New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












This question already has an answer here:




  • Applying a lower bound threshold on a list

    3 answers




I have a list



a = {1, 8, 0, 6, 5, 3, 5, 2, 2, 5}


I want to generate a new list whose elements are the same of a if it's bigger than 5, or 5 elsewhere.
I managed to achieve this using Map and a pure function doing



Map[(Max[#, 5]) &, a]


but this looks a bit clumsy to me. Is there a better way?



EDIT: I found this solution



a /. x_ /; x < 5 -> 5


but I cannot really understand why is working. Could someone give an insight into it?



Thanks





This question already has an answer here:




  • Applying a lower bound threshold on a list

    3 answers







map




map






share|improve this question









New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited Jan 3 at 10:24





















New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Jan 3 at 10:20









Luca Amerio

233




233




New contributor




Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Luca Amerio is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




marked as duplicate by Kuba♦ 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






marked as duplicate by Kuba♦ 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.










  • 2




    Why not Max[#, 5] & /@ a ?
    – Mauro Lacy
    Jan 3 at 11:38














  • 2




    Why not Max[#, 5] & /@ a ?
    – Mauro Lacy
    Jan 3 at 11:38








2




2




Why not Max[#, 5] & /@ a ?
– Mauro Lacy
Jan 3 at 11:38




Why not Max[#, 5] & /@ a ?
– Mauro Lacy
Jan 3 at 11:38










1 Answer
1






active

oldest

votes


















6














You can use Clip or Ramp:



Clip[a, {5, ∞}]



{5, 8, 5, 6, 5, 5, 5, 5, 5, 5}




5 + Ramp[a - 5]



{5, 8, 5, 6, 5, 5, 5, 5, 5, 5}







share|improve this answer




























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    6














    You can use Clip or Ramp:



    Clip[a, {5, ∞}]



    {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}




    5 + Ramp[a - 5]



    {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}







    share|improve this answer


























      6














      You can use Clip or Ramp:



      Clip[a, {5, ∞}]



      {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}




      5 + Ramp[a - 5]



      {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}







      share|improve this answer
























        6












        6








        6






        You can use Clip or Ramp:



        Clip[a, {5, ∞}]



        {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}




        5 + Ramp[a - 5]



        {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}







        share|improve this answer












        You can use Clip or Ramp:



        Clip[a, {5, ∞}]



        {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}




        5 + Ramp[a - 5]



        {5, 8, 5, 6, 5, 5, 5, 5, 5, 5}








        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered Jan 3 at 10:30









        kglr

        177k9198407




        177k9198407















            -

            Popular posts from this blog

            If I really need a card on my start hand, how many mulligans make sense? [duplicate]

            Image
            5 This question already has an answer here: How do you calculate the likelihood of drawing certain cards in your opening hand? 3 answers There is a funny modern deck where you play Treasure Hunt, but you really need to have it on the starting hand. How many mulligans should I take, if my deck contains 60 cards and contains 4 copies of Treasure Hunt? magic-the-gathering probability share | improve this question asked Nov 23 '18 at 12:12 dan dan 152 4
            Read more

            Alcedinidae

            Image
            Alcedinidae Martin-pêcheur à dos bleu ( Alcedo azurea ) Classification (COI) Règne Animalia Embranchement Chordata Sous-embr. Vertebrata Classe Aves Ordre Coraciiformes Famille Alcedinidae Rafinesque, 1815 Les Alcédinidés ou Alcedinidae forment une famille d'oiseaux plus connus sous les noms de martins-pêcheurs et martins-chasseurs. Sommaire 1 Description 2 Répartition et habitat 3 Systématique 3.1 Liste alphabétique des genres 3.2 Liste des espèces 4 Chez les Anciens : l'alcyon 4.1 Étymologie (Littré) 4.2 Oiseau « fabuleux » ? 5 Notes 6 Articles connexes 7 Liens externes 7.1 Bibliographie Description | Ce sont des oiseaux compacts de taille petite à moyenne (10 à 46 cm), au bec droit et long, en forme de poignard. Leurs pattes sont courtes, et ils portent un plumage aux couleurs vives. Répartition et habitat | Cosmopolites, ils fréquentent surtout
            Read more

            Can an atomic nucleus contain both particles and antiparticles? [duplicate]

            Image
            9 $begingroup$ This question already has an answer here: What happens if we put together a proton and an antineutron? 2 answers Is it theoretically possible to make a "deuterium" atom containing a proton and an antineutron in its nucleus? Would the strong nuclear force cause attraction between a proton and an antineutron? Would such a nucleus be stable, or would the proton somehow annihilate the antineutron when close enough? nuclear-physics antimatter share | cite | improve this question asked yesterday
            Read more