public void calculatePrimeNumbersAsync()

in domain/src/main/java/demoapp/dom/services/core/wrapperFactory/PrimeNumberGenerator.java [27:36]

• 10 lines of code
• 2 McCabe index (conditional complexity)

    public void calculatePrimeNumbersAsync(final int from, final int upTo) {
        int nextPrime = nextPrime(from);
        if (nextPrime <= upTo) {
            primeNumberFactory.newPrimeNumber(nextPrime);
            wrapperFactory.asyncWrap(
                    this,
                    AsyncControl.returningVoid().withSkipRules()
            ).calculatePrimeNumbersAsync(nextPrime, upTo);          // <.>
        }
    }