# - compute (pyTree) -
import Converter.PyTree as C
import Fast.PyTree as Fast
import Post.PyTree as P
import Converter.Internal as Internal
import Fast.Utils as Utils
import Distributor2.PyTree as D2
# NP: 0: Seq, NP> 0: running with mpi, distributed on NP procs
NP = Utils.getArgs1()
if NP > 0:
    import Converter.Mpi as Cmpi
    import FastS.Mpi as FastS
    rank = Cmpi.rank
else:
    import FastS.PyTree as FastS
    rank=0

NIT = 10000

# Reading input files: t.cgns/restart.cgns and tc.cgns
t,tc,ts,graph = Fast.load('t.cgns', 'tc.cgns', split='single', 
                          restart=False, NP=NP)
it0 = 0; time0 = 0.
first = Internal.getNodeFromName1(t, 'Iteration')
if first is not None: it0 = Internal.getValue(first)
first = Internal.getNodeFromName1(t, 'Time')
if first is not None: time0 = Internal.getValue(first)

# Numerics
numb = {}
numb["temporal_scheme"]    = "explicit"
numb["ss_iteration"]       = 20
numz = {}
numz["time_step"]          = 0.007
numz["time_step_nature"]   = "global"
numz["cfl"]                = 1.
numz["scheme"]             = "senseur"
FastS.setNum2Zones(t, numz) ; Fast._setNum2Base(t, numb)

(t, tc, metrics) = FastS.warmup(t, tc, graph)

time = time0
time_step = Internal.getNodeFromName(t, 'time_step')
time_step = Internal.getValue(time_step)
for it in xrange(NIT):
    FastS._compute(t, metrics, it, tc, graph)
    if it%100 == 0:
        if rank == 0: print '- %d / %d - %f'%(it+it0, NIT+it0, time)
        FastS._computeVariables(t, metrics,'QCriterion')
        C._cpVars(t, 'centers:QCriterion', tc, 'QCriterion')
        iso = P.isoSurfMC(tc, 'QCriterion', value=-0.1)
        D2._addProcNode(iso, rank)
        if NP > 0: Cmpi.convertPyTree2File(iso, 'isoq_it%s.cgns'%(it+it0))
        else: C.convertPyTree2File(iso, 'isoq_it%s.cgns'%(it+it0))
        
    time += time_step

# time stamp
Internal.createUniqueChild(t, 'Iteration', 'DataArray_t', value=it0+NIT)
Internal.createUniqueChild(t, 'Time', 'DataArray_t', value=time)
Fast.save(t, 'restart.cgns', split='single', NP=NP)