Method complexity

test/python/complexity.py:119–151

(self,setupfun,fun, order, depth = 0)

  def complexity(self,setupfun,fun, order, depth = 0):

    N = 1

    Ns = []
    ts = []

    dt = 0
    while dt<self.maxt:
      sys.stdout.write("\r%d..." % N)
      sys.stdout.flush()
      p = setupfun(self,N) # Setup
      for i in range(10):
        t = time()
        fun(self,N,p) # Run the function
        dt = time()-t
        Ns.append(N)
        ts.append(dt)
      N=int(N*1.5)
      N+=1
      if self.check: break
    print("")

    Ns = array(Ns)
    ts = array(ts)
    valid = ts > self.mint
    if not(self.check):
      orders = self.checkOrders(Ns[valid],ts[valid])
    if not(self.check) and (len(orders)!=1 or orders[0]!=order):
      if (depth<3):
        return self.complexity(setupfun,fun, order, depth+1 )
      else:
        self.assertTrue(False,"We expected order %d, but found %s" % (order,str(orders)))


  def test_DMadd(self):