1

对于一点上下文，我正在尝试使用出色的 GParsPool Fork/Join 支持来解决 Project Euler问题 31。

为此，我编写了愚蠢的代码：

import groovyx.gpars.*
import groovy.util.GroovyCollections

@Grab(group="org.codehaus.gpars", module="gpars", version="0.11")
def getMatchingCombos(target) {
    combos = [200, 100 /*, 50, 20, 10, 5, 2, 1*/]
    GParsPool.withPool(1) { pool ->
        combos = combos.collectParallel { n ->  
            ((0..(target/n)).step(1) as TreeSet).collect { p -> p*n }
        }
        return GParsPool.runForkJoin(combos, 0, 0, target) { usableCombos, comboIndex, sum, targetSum ->
            def offset = "\t"*comboIndex
            def results = 0
            if(sum<=targetSum) {
                if(comboIndex<combos.size()) {
                    usableCombos[comboIndex].each { n ->
                        println offset+"now trying with $comboIndex element value $n (curent sum is $sum)"
                        results += forkOffChild(usableCombos, comboIndex+1, sum+n, targetSum)
                    }
                } else {
                    if(sum==targetSum) {
                        results +=1
                        println offset+"sum is target ! so we have $results"
                    }
                }
            }
            return results;
        }
    }
}

println getMatchingCombos(200)

不幸的是，每次我尝试运行它时，我都会得到以下堆栈跟踪：

now trying with 0 element value 0 (curent sum is 0). Known combos are [[0, 200], [0, 100, 200]] and target is 200
        now trying with 1 element value 0 (curent sum is 0). Known combos are [[0, 200], [0, 100, 200]] and target is 20
0
Caught: java.util.concurrent.ExecutionException: java.lang.NullPointerException
        at groovyx.gpars.GParsPool.runForkJoin(GParsPool.groovy:305)
        at probleme_31$_getMatchingCombos_closure1.doCall(probleme_31.groovy:18)
        at groovyx.gpars.GParsPool$_withExistingPool_closure1.doCall(GParsPool.groovy:170)
        at groovyx.gpars.GParsPool$_withExistingPool_closure1.doCall(GParsPool.groovy)
        at groovyx.gpars.GParsPool.withExistingPool(GParsPool.groovy:169)
        at groovyx.gpars.GParsPool.withPool(GParsPool.groovy:141)
        at groovyx.gpars.GParsPool.withPool(GParsPool.groovy:117)
        at probleme_31.getMatchingCombos(probleme_31.groovy:9)
        at probleme_31.run(probleme_31.groovy:41)

我知道这与我想利用 Fork/Join 作为递归“扁平化”机制的方式有关，但我在这里做的错误是什么？

4

1 回答 1

3

您错误地尝试将子结果作为 forkOffChild() 方法的返回值读取，而这应该使用 getChildrenResults() 来完成。

        return GParsPool.runForkJoin(combos, 0, 0, target) { usableCombos, comboIndex, sum, targetSum ->
        def offset = "\t"*comboIndex
        def results = 0
        if(sum<=targetSum) {
            if(comboIndex<combos.size()) {
                usableCombos[comboIndex].each { n ->
                    println offset+"now trying with $comboIndex element value $n (curent sum is $sum)"
                    forkOffChild(usableCombos, comboIndex+1, sum+n, targetSum)
                }
            } else {
                if(sum==targetSum) {
                    results +=1
                    println offset+"sum is target ! so we have $results"
                }
            }
        }
        results += getChildrenResults().sum(0)
        return results;
    }
于 2011-02-18T13:46:58.427 回答