         init (_n, _threshold)->
           nInit = n = _n
           threshold = _threshold
+          return
 
         body (resolve, reject)->
           return resolve(nInit, totalStoppingTime) if n is 1


  describe 'Examples in the readme.md file', ->
    collatzTask = null
    beforeEach( ->
      collatzTask = new CrunchTask (init, body, fin) ->
        nInit = n = threshold = null
        totalStoppingTime = 0

          else
            n = n / 2
          totalStoppingTime++
          return
        , 100

        fin (status)->
          if status is false
            console.log 'Collatz conjecture breaking candidate:', nInit
          return
        return
      return


    it 'implements a Collatz conjecture, aka 3n + 1 problem, algorithm', (ddone)->

      collatzTask.onIdle ddone

      collatzTask.run(1).done (arr)->
        [n, count] = arr
