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

          else
            n = n / 2
          totalStoppingTime++
        , 100

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

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



      collatzTask.onIdle( ()->
        expect(type(setTimeout)).toBeDefined()
        expect(type(setTimeout)).toEqual('function')
        expect(type(done)).toBeDefined()
        expect(type(done)).toEqual('function')
        setTimeout(done, 100)
        return
      )

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

        init (_n, _threshold)->
          nInit = n = _n
          threshold = _threshold
          return

        body (resolve, reject)->
          return resolve(nInit, totalStoppingTime) if n is 1
