Project Euler problem 01 - Java vs Clojure (https://projecteuler.net/problem=1)

ProjectEuler_01-v2.clj

(defn mod35 [number]
  (or
   (zero? (mod number 3))
   (zero? (mod number 5))))

(reduce + (filter mod35 (range 1 1000)))

ProjectEuler_01.clj

(reduce + (
	for [number (range 1 1000) 
	:when (or 
		(zero? (mod number 3)) 
		(zero? (mod number 5)))
	] number))

ProjectEuler_01.java

import java.util.*;

class ProjectEuler_01
{
	public static void main (String[] args) throws java.lang.Exception
	{
		int sum = 0;
		for (int number = 0; number < 1000; number++) {
			if (number % 3 == 0 || number % 5 == 0) {
				sum += number;
			}
		}
		
		System.out.println(sum);
	}
}

Transduce ;)

(def xf (filter #(or (zero? (mod % 3))
                     (zero? (mod % 5)))))
(transduce xf + (range 1000))

for je hrozně neidiomatický. Použij filter nebo map:

(defn mod-3-and-5 [x]
   (or
    (zero? (mod x 3))
    (zero? (mod x 5))))
(reduce + (filter mod-3-and-5 (range 1 1000)))