In clojure can you apply a function to all elements in a collection and have the return value be the input...
up vote
1
down vote
favorite
Say you have a collection like this ({A: 1 B: 2} {A: 2 B: 5} {A: 4 B: 7}) with an unspecified amount of {A: B:} parts and a function (func arg1 arg2).
If we assume there is some initial state state and that every call to func generates a new-state.
Is it possible to construct something that acts like this?
(->(func state {A: 1 B: 2})
(func {A: 2 B: 5})
(func {A: 4 B: 7}))
Basically the first argument is the new state and the second is the next {A: B:} from the collection.
Any help would be appreciated!
function collections clojure
asked Nov 19 at 13:25
John Slaine
748
add a comment |
up vote
1
down vote
favorite
Say you have a collection like this ({A: 1 B: 2} {A: 2 B: 5} {A: 4 B: 7}) with an unspecified amount of {A: B:} parts and a function (func arg1 arg2).
If we assume there is some initial state state and that every call to func generates a new-state.
Is it possible to construct something that acts like this?
(->(func state {A: 1 B: 2})
(func {A: 2 B: 5})
(func {A: 4 B: 7}))
Basically the first argument is the new state and the second is the next {A: B:} from the collection.
Any help would be appreciated!
function collections clojure
asked Nov 19 at 13:25
John Slaine
748
As a side note,{:a 1 :b 2}would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though,{A: 1 B: 2}is syntactical legal.
– celwell
Nov 21 at 5:03
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Say you have a collection like this ({A: 1 B: 2} {A: 2 B: 5} {A: 4 B: 7}) with an unspecified amount of {A: B:} parts and a function (func arg1 arg2).
If we assume there is some initial state state and that every call to func generates a new-state.
Is it possible to construct something that acts like this?
(->(func state {A: 1 B: 2})
(func {A: 2 B: 5})
(func {A: 4 B: 7}))
Basically the first argument is the new state and the second is the next {A: B:} from the collection.
Any help would be appreciated!
function collections clojure
asked Nov 19 at 13:25
John Slaine
748
Say you have a collection like this ({A: 1 B: 2} {A: 2 B: 5} {A: 4 B: 7}) with an unspecified amount of {A: B:} parts and a function (func arg1 arg2).
If we assume there is some initial state state and that every call to func generates a new-state.
Is it possible to construct something that acts like this?
(->(func state {A: 1 B: 2})
(func {A: 2 B: 5})
(func {A: 4 B: 7}))
Basically the first argument is the new state and the second is the next {A: B:} from the collection.
Any help would be appreciated!
function collections clojure
function collections clojure
asked Nov 19 at 13:25
John Slaine
748
asked Nov 19 at 13:25
John Slaine
748
edited Nov 19 at 13:45
asked Nov 19 at 13:25
John Slaine
748
asked Nov 19 at 13:25
John Slaine
748
asked Nov 19 at 13:25
John Slaine
748
748
As a side note,{:a 1 :b 2}would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though,{A: 1 B: 2}is syntactical legal.
– celwell
Nov 21 at 5:03
add a comment |
As a side note,{:a 1 :b 2}would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though,{A: 1 B: 2}is syntactical legal.
– celwell
Nov 21 at 5:03
As a side note,
{:a 1 :b 2} would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though, {A: 1 B: 2} is syntactical legal.– celwell
Nov 21 at 5:03
As a side note,
{:a 1 :b 2} would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though, {A: 1 B: 2} is syntactical legal.– celwell
Nov 21 at 5:03
add a comment |
1 Answer
1
active
oldest
votes
up vote
4
down vote
accepted
Yes, this function is called reduce:
(reduce
func
initial-state
input-sequence)
or a version where the first element of the input sequence is used as initial state (check the function doc to see the details of its behaviour):
(reduce
func
input-sequence)
For example:
(reduce
+
100
[1 2 3 4 5])
;; => 115
(reduce
+
[1 2 3 4 5])
;; => 15
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
accepted
Yes, this function is called reduce:
(reduce
func
initial-state
input-sequence)
or a version where the first element of the input sequence is used as initial state (check the function doc to see the details of its behaviour):
(reduce
func
input-sequence)
For example:
(reduce
+
100
[1 2 3 4 5])
;; => 115
(reduce
+
[1 2 3 4 5])
;; => 15
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
add a comment |
up vote
4
down vote
accepted
Yes, this function is called reduce:
(reduce
func
initial-state
input-sequence)
or a version where the first element of the input sequence is used as initial state (check the function doc to see the details of its behaviour):
(reduce
func
input-sequence)
For example:
(reduce
+
100
[1 2 3 4 5])
;; => 115
(reduce
+
[1 2 3 4 5])
;; => 15
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
add a comment |
up vote
4
down vote
accepted
up vote
4
down vote
accepted
Yes, this function is called reduce:
(reduce
func
initial-state
input-sequence)
or a version where the first element of the input sequence is used as initial state (check the function doc to see the details of its behaviour):
(reduce
func
input-sequence)
For example:
(reduce
+
100
[1 2 3 4 5])
;; => 115
(reduce
+
[1 2 3 4 5])
;; => 15
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
Yes, this function is called reduce:
(reduce
func
initial-state
input-sequence)
or a version where the first element of the input sequence is used as initial state (check the function doc to see the details of its behaviour):
(reduce
func
input-sequence)
For example:
(reduce
+
100
[1 2 3 4 5])
;; => 115
(reduce
+
[1 2 3 4 5])
;; => 15
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
edited Nov 19 at 17:18
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
answered Nov 19 at 13:30
Piotrek Bzdyl
10.3k11930
10.3k11930
add a comment |
add a comment |
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%2fstackoverflow.com%2fquestions%2f53375635%2fin-clojure-can-you-apply-a-function-to-all-elements-in-a-collection-and-have-the%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
As a side note,
{:a 1 :b 2}would be more commonly seen in Clojure. I.e., using keywords for the keys of a map. Though,{A: 1 B: 2}is syntactical legal.– celwell
Nov 21 at 5:03