Clojures: Solutions from Challenge 9 to 19

[gildub]

No description provided.

[amkirschner]

Neither original nor updated closures commits have solution to actual exercise #8 (saveOutput)

[kapoorabhi]

Neither original nor updated closures commits have solution to actual exercise #8 (saveOutput)

Yes, I noticed there is no solution for Challenge #8. I am actually working on them. Will do a PR once all is done.

[kapoorabhi]

It won't work as expected because the first output would be Sat as we are incrementing the counter on first iteration and it will return array[1].

[MEDHAT-ALHADDAD]

function cycleIterator(array) {
let counter = 0;

return () => {
if( counter >= array.length) counter = 0;
return array[counter++];
}
}

[gildub]

@amkirschner, the intent of this PR is to address solutions for challenges from 9 to 16, not 8.
That said the solution for challenge 8 already works.

const names = rollCall(['John', 'Jack', 'Paul'])
names(); // => John
names(); // => Jack
names(); // => Paul
names(); // => Everyone accounted for

[gildub]

@kapoorabhi, you're right the solution for challenge #8 was using a wrong index, I fixed the counter. Thanks

[hirwablessing]

Neither original nor updated closures commits have a solution to actual exercise #8 (saveOutput)

I've finished challenge #8 saveOutput and I just created a PR. We'll see if it get approved.