anybody knows how to override a dependency with local ~/.m2 ??

@ryan.russell011 What are "regular Clojure queries"? You mean embedding SQL strings directly into your Clojure source code?

A lot of people don't like doing that -- editors don't give SQL syntax highlighting when it's embedded in a string, so HugSQL's approach works better for them. I personally value seeing the actual query inline with the code rather than needing to look at multiple files (so that's my "con" for HugSQL).

how does one map exponentiation to the power of two?

@jm.moreau what do you mean?

I want to square all the numbers in (partition 2 1 (range 1 32))

so

((1 2) (2 3) ... should become ((1 4) (4 9) ... )

(map (partial map #(Math/pow % 2)) (partition 2 1 (range 1 32)))

I’m using project Euler to try to understand FP. I’m trying to solve a+b+c= 1000, where a < b < c and a^2+b^2=c^2

hmm, I tried apply from your last set of advice

(map (partial map #(some fn) stuff still doesn’t make intuitive sense

at least to me at the moment

🙂

@jm.moreau Do you understand map?

well, obviously I could understand it better 😉

I thought map applies fn to each element in a seq

(individually)

returning another seq

(fn(a), fn(b), …)

I thought of it like a mapping in math, where everything is mapped (so a nice mapping—surely there is as word for that)

f --> g

no! its not that!

Its just as you said: >I thought map applies fn to each element in a seq

so (defn square [x] (Math/pow x)) is our fn.

just (map square '(1 2 3 4 5 6))

trying it.

(defn square [x] (Math/pos x 2))

caught that 🙂

but you want on '((1 2) (3 4)) so

can I destructure at the same time?

(map (fn[x](Math/pow x 2)) [1 2 3]) = [1 4 9] (map (fn[x](Math/pow x 2)) [[1,2] [3,4]] will try to take a list to the second power and it will fail so we have to get one level deeper and map the map: partial makes its first argument close over the rest of the arguments, so that we could lift it by the outer map (map (partial map (fn[x] (Math/pow x 2))) [[1,2] [3,4]])

(map (fn [lst] (map square lst)) '((1 2) (3 4)))

@veix.q5 yeah that makes sense

so assuming my list is a bunch of a’s and b’s such that a <b

what I want to do is

calc sqrt(a^2 + b^2) +a +b

over that list of lists

so

that’s going to be…

or rather would I destructure it like this? (map (partial map (fn [[a b]] (math on a and b here) (my partition here)

trying to get a sense of it (map (partial map (fn [[a b]] (+ a b))) (partition 2 1 (range 1 32))) doesn’t work

(just a simple attempt to add them

you won't need double maps here

because the destructuring is already unwrapping a level of nesting

I’d like to map sqrt(a^2 + b^2) +a +b over it

oh

so it becomes (fn a b)

coool

(map (fn[[a,b]] (+ ( a a) ( b b) a b) collection)

you should keep in mind what the type of the collection is.

trying stuff… @veix.q5 that helped I didn’t realized a “lifted” out of one list

great everything works. thanks @veix.q5 and @neural.works.com!

My code runs, and now I see I made some math mistakes. 🙂

is there a way to combine all permutations of lists?

List a = (1, …, n), list b similarly has n elements and so does list c. Can I make new-list of [a1, b1, c1] for all permutations?

I see there is https://clojure.github.io/math.combinatorics/

(for [x [1 2 3] y [4 5 6] z [7 8 9]] [x y z])

wow, wtf is going on there?!

it seems that for is not lazy

(for [x [1 2 3] y [4 5 6] z [7 8 9]] [x y z])

(mapcat (fn [x]
          (mapcat (fn [y]
                 (map (fn [z]
                        [x y z])
                      [7 8 9]))
               [4 5 6]))
     [1 2 3])

great I’ll look up mapcat. Thanks for the clues guys

what is the name of the mathematical category that unlike set admits repetition?

I am not looking for the list, because I don't care about order

never mind! its multiset

Bag is a common name as well

hey guys, any suggestions for resources for using clojure within cljs projects?

specifically i’m working on including macros in a fully-cljs project