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)
Appropriate certificate to ask for a fibre installation (ANSI/TIA-568.3-D?)
Is there a word that describe the non-justified use of a more complex word?
Decoupling cap routing on a 4 layer PCB
Something that can be activated/enabled
Is “snitty” a popular American English term? What is its origin?
Why aren't nationalizations in Russia described as socialist?
Are there any of the Children of the Forest left, or are they extinct?
Word meaning as function of the composition of its phonemes
Can my 2 children 10 and 12 Travel to the USA on expired American Passports? They are US citizens
Out of scope work duties and resignation
Would you use llamarse for an animal's name?
What are the differences between credential stuffing and password spraying?
Does it make sense for a function to return an rvalue reference?
Emotional immaturity of comic-book version of superhero Shazam
What to use instead of cling film to wrap pastry
Wrong answer from DSolve when solving a differential equation
Adjacent DEM color matching in QGIS
Why wasn't the Night King naked in S08E03?
What does this wavy downward arrow preceding a piano chord mean?
Should homeowners insurance cover the cost of the home?
Why does sound not move through a wall?
Building a list of products from the elements in another list
Has the Hulk always been able to talk?
60s/70s science fiction novel where a man (after years of trying) finally succeeds to make a coin levitate by sheer concentration
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
asked Apr 29 at 21:53
amator2357amator2357
56710
$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
asked Apr 29 at 21:53
amator2357amator2357
56710
$endgroup$
4
$begingroup$
Why does the order fordandcchange, and not foraandb?
$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 whetherFis applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
2 days ago
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
asked Apr 29 at 21:53
amator2357amator2357
56710
$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
asked Apr 29 at 21:53
amator2357amator2357
56710
asked Apr 29 at 21:53
amator2357amator2357
56710
edited Apr 29 at 22:53
amator2357
asked Apr 29 at 21:53
amator2357amator2357
56710
asked Apr 29 at 21:53
amator2357amator2357
56710
asked Apr 29 at 21:53
amator2357amator2357
56710
56710
4
$begingroup$
Why does the order fordandcchange, and not foraandb?
$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 whetherFis applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
2 days ago
add a comment |
4
$begingroup$
Why does the order fordandcchange, and not foraandb?
$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 whetherFis applied from the lowest level up or reverse. It it matters it may affect applicable solutions.
$endgroup$
– Kuba♦
2 days ago
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♦
2 days ago
$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♦
2 days ago
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]
answered Apr 29 at 23:34
kglrkglr
190k10209428
$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]
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
$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]]]
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
$endgroup$
$begingroup$
I think thatFlattenworks 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.
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
$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]
answered Apr 29 at 23:34
kglrkglr
190k10209428
$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]
answered Apr 29 at 23:34
kglrkglr
190k10209428
$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]
answered Apr 29 at 23:34
kglrkglr
190k10209428
$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
190k10209428
answered Apr 29 at 23:34
kglrkglr
190k10209428
answered Apr 29 at 23:34
kglrkglr
190k10209428
answered Apr 29 at 23:34
kglrkglr
190k10209428
190k10209428
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]
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
$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]
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
$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]
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
$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
77k3101201
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
answered Apr 30 at 0:10
Carl WollCarl Woll
77k3101201
77k3101201
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]]]
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
$endgroup$
$begingroup$
I think thatFlattenworks 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]]]
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
$endgroup$
$begingroup$
I think thatFlattenworks 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]]]
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
$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.4k585171
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
answered Apr 29 at 22:30
Henrik SchumacherHenrik Schumacher
61.4k585171
61.4k585171
$begingroup$
I think thatFlattenworks 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 thatFlattenworks 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.
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
$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.
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
$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.
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
$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
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
answered Apr 29 at 23:03
ShredderroyShredderroy
1,6201117
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
dandcchange, and not foraandb?$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
Fis applied from the lowest level up or reverse. It it matters it may affect applicable solutions.$endgroup$
– Kuba♦
2 days ago