Applying a function to a nested listNested 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)
How to handle DM constantly stealing everything from sleeping characters?
if i accidentally leaked my schools ip address and someone d doses my school am i at fault
how to find out if there's files in a folder and exit accordingly (in KSH)
Why is there a cap on 401k contributions?
Do Rabbis admit emotional involvement in their rulings?
resoldering copper waste pipe
How can I test a shell script in a "safe environment" to avoid harm to my computer?
Not taking the bishop by the knight, why?
Probability of taking balls without replacement from a bag question
Passport stamps art, can it be done?
How is Arya still alive?
Was there a contingency plan in place if Little Boy failed to detonate?
Is there a need for better software for writers?
How can I make parentheses stick to formula?
How do I minimise waste on a flight?
Was Mohammed the most popular first name for boys born in Berlin in 2018?
What does the "DS" in "DS-..." US visa application forms stand for?
Employee is self-centered and affects the team negatively
Unicode-math and mathrm result in missing symbols
Is there any evidence to support the claim that the United States was "suckered into WW1" by Zionists, made by Benjamin Freedman in his 1961 speech
What replaces x86 intrinsics for C when Apple ditches Intel CPUs for their own chips?
What can cause an unfrozen indoor copper drain pipe to crack?
Can I bring back Planetary Romance as a genre?
Gift for mentor after his thesis defense?
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)
$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
$endgroup$
add a comment |
$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
$endgroup$
4
$begingroup$
Why does the order ford
andc
change, and not fora
andb
?
$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
In your example it does not matter whetherF
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
Apr 30 at 6:27
add a comment |
$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
$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
edited Apr 29 at 22:53
amator2357
asked Apr 29 at 21:53
amator2357amator2357
61610
61610
4
$begingroup$
Why does the order ford
andc
change, and not fora
andb
?
$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
In your example it does not matter whetherF
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
Apr 30 at 6:27
add a comment |
4
$begingroup$
Why does the order ford
andc
change, and not fora
andb
?
$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
In your example it does not matter whetherF
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
Apr 30 at 6:27
4
4
$begingroup$
Why does the order for
d
and c
change, and not for a
and b
?$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
Why does the order for
d
and c
change, and not for a
and b
?$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
In your example it does not matter whether
F
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.$endgroup$
– Kuba♦
Apr 30 at 6:27
$begingroup$
In your example it does not matter whether
F
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.$endgroup$
– Kuba♦
Apr 30 at 6:27
add a comment |
4 Answers
4
active
oldest
votes
$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]
$endgroup$
add a comment |
$begingroup$
Another possibility, if you want just lists to acquire the F
wrapper:
l /. List -> F@*List
F[F[F[a, b], c], d]
$endgroup$
add a comment |
$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]]]
$endgroup$
$begingroup$
I think thatFlatten
works in this trivial case but it will not "find" the levels in a more complex situation
$endgroup$
– J42161217
Apr 29 at 22:41
add a comment |
$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.
$endgroup$
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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]
$endgroup$
add a comment |
$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]
$endgroup$
add a comment |
$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]
$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]
answered Apr 29 at 23:34
kglrkglr
191k10212431
191k10212431
add a comment |
add a comment |
$begingroup$
Another possibility, if you want just lists to acquire the F
wrapper:
l /. List -> F@*List
F[F[F[a, b], c], d]
$endgroup$
add a comment |
$begingroup$
Another possibility, if you want just lists to acquire the F
wrapper:
l /. List -> F@*List
F[F[F[a, b], c], d]
$endgroup$
add a comment |
$begingroup$
Another possibility, if you want just lists to acquire the F
wrapper:
l /. List -> F@*List
F[F[F[a, b], c], d]
$endgroup$
Another possibility, if you want just lists to acquire the F
wrapper:
l /. List -> F@*List
F[F[F[a, b], c], d]
answered Apr 30 at 0:10
Carl WollCarl Woll
77.7k3102204
77.7k3102204
add a comment |
add a comment |
$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]]]
$endgroup$
$begingroup$
I think thatFlatten
works in this trivial case but it will not "find" the levels in a more complex situation
$endgroup$
– J42161217
Apr 29 at 22:41
add a comment |
$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]]]
$endgroup$
$begingroup$
I think thatFlatten
works in this trivial case but it will not "find" the levels in a more complex situation
$endgroup$
– J42161217
Apr 29 at 22:41
add a comment |
$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]]]
$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]]]
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.8k585172
61.8k585172
$begingroup$
I think thatFlatten
works in this trivial case but it will not "find" the levels in a more complex situation
$endgroup$
– J42161217
Apr 29 at 22:41
add a comment |
$begingroup$
I think thatFlatten
works in this trivial case but it will not "find" the levels in a more complex situation
$endgroup$
– J42161217
Apr 29 at 22:41
$begingroup$
I think that
Flatten
works in this trivial case but it will not "find" the levels in a more complex situation$endgroup$
– J42161217
Apr 29 at 22:41
$begingroup$
I think that
Flatten
works in this trivial case but it will not "find" the levels in a more complex situation$endgroup$
– J42161217
Apr 29 at 22:41
add a comment |
$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.
$endgroup$
add a comment |
$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.
$endgroup$
add a comment |
$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.
$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.
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
1,6201117
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
4
$begingroup$
Why does the order for
d
andc
change, and not fora
andb
?$endgroup$
– Carl Woll
Apr 29 at 22:30
$begingroup$
My mistake, thank you for spotting that. I edited it.
$endgroup$
– amator2357
Apr 29 at 22:54
$begingroup$
In your example it does not matter whether
F
is applied from the lowest level up or reverse. It it matters it may affect applicable solutions.$endgroup$
– Kuba♦
Apr 30 at 6:27