     }
 
     debug('found %d primes in range: [%s-%s]',  primes.length, start, end)
-    
+
     # memUsage = process.memoryUsage()
     # debug("memory usage:" +  Math.round(memUsage.heapUsed / 1024 / 1024) + " MB")
 

#     - 0  : [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
#

# count and sum of all the primes in a chunk is stored in a separate table
#
#- primeSumTbl
#     - 0  : [25,  1060]
#  
# The sum table and prime table use the same index (field value) to store related 
# chunks. All indexes are numbers

PRIME_INDEX_TBL="primeIndexTbl"
# PRIME_SUM_TBL="primeSumTbl"
PRIME_TBL = "primeTbl"

primeIndexTbl = {}
# primeSumTbl = {}
primeTbl = {}

qLoadIndexTbl = (self) ->
    q = Q.defer()

        return q.promise

    debug('setting primes at index:%d', chunkIndex)
    primeSumTbl[chunkIndex] = chunkPrimeTbl.sum
    primeTbl[chunkIndex] = _.uniq(_.concat(primeTbl[chunkIndex] or [], chunkPrimeTbl.primes or []))

    # store the primes
    self.store.qSet(PRIME_TBL, chunkIndex, chunkPrimeTbl.primes)
    .then(()->
        return q.resolve()
    )
    .fail((err)->
