|
1 | 1 | # - refine (pyTree) - |
2 | 2 | import Generator.PyTree as G |
3 | 3 | import Converter.PyTree as C |
| 4 | +import Converter.Internal as Internal |
4 | 5 | import KCore.test as test |
5 | 6 |
|
6 | 7 | # cas 2D multibloc avec CL et raccords |
7 | 8 | a = G.cart( (0,0,0), (0.1,0.1,0.1), (11,11,1)) |
8 | 9 | b = G.cart( (0,1,0), (0.1,0.1,0.1), (11,11,1)) |
9 | | -a = C.addBC2Zone(a,'match1','BCMatch','jmax',b,'jmin') |
10 | | -a = C.addBC2Zone(a,"wall",'BCWall','imin') |
11 | | -a = C.addBC2Zone(a,"overlap",'BCOverlap','imax') |
12 | | -b = C.addBC2Zone(b,'match2','BCMatch','jmin',a,'jmax') |
13 | | -b = C.addBC2Zone(b,"wall",'BCWall','imin') |
14 | | -b = C.addBC2Zone(b,"overlap",'BCOverlap','imax') |
| 10 | +C._addBC2Zone(a,'match1','BCMatch','jmax',b,'jmin') |
| 11 | +C._addBC2Zone(a,"wall",'BCWall','imin') |
| 12 | +C._addBC2Zone(a,"overlap",'BCOverlap','imax') |
| 13 | +C._addBC2Zone(b,'match2','BCMatch','jmin',a,'jmax') |
| 14 | +C._addBC2Zone(b,"wall",'BCWall','imin') |
| 15 | +C._addBC2Zone(b,"overlap",'BCOverlap','imax') |
15 | 16 | t = C.newPyTree(['Base',2]); t[2][1][2] += [a,b] |
16 | | -t = C.initVars(t,'F',1.); t = C.initVars(t,'centers:G',2.) |
17 | | -# facteur de raffinement non entier |
18 | | -for noz in range(2): t[2][1][2][noz] = G.refine(t[2][1][2][noz],1.5,dir=1) |
19 | | -test.testT(t,1) |
20 | | -# facteur de raffinement entier 1 direction |
21 | | -t = C.newPyTree(['Base']); t[2][1][2]+=[a,b] |
22 | | -t = C.initVars(t,'F',1.); t = C.initVars(t,'centers:G',2.) |
23 | | -for noz in range(2): t[2][1][2][noz] = G.refine(t[2][1][2][noz],2.,dir=1) |
24 | | -test.testT(t,2) |
25 | | -# |
26 | | -# facteur de raffinement entier 3 directions |
27 | | -# |
28 | | -t = C.newPyTree(['Base',2]); t[2][1][2] += [a,b] |
29 | | -t = C.initVars(t,'F',1.); t = C.initVars(t,'centers:G',2.) |
30 | | -for noz in range(2): t[2][1][2][noz] = G.refine(t[2][1][2][noz],2,dir=0) |
31 | | -test.testT(t,3) |
| 17 | +C._initVars(t,'F',1.); C._initVars(t,'centers:G',2.) |
| 18 | + |
| 19 | +# Non integer refinement factor: GCs and BCs are removed |
| 20 | +# topTree |
| 21 | +factor = 1.5 |
| 22 | +t2 = G.refine(t, factor, dir=1) |
| 23 | +test.testT(t2, 1) |
| 24 | + |
| 25 | +t2 = G.refine(t, factor, dir=0) |
| 26 | +test.testT(t2, 2) |
| 27 | + |
| 28 | +# single zone |
| 29 | +t2 = Internal.copyRef(t) |
| 30 | +for noz in range(2): t2[2][1][2][noz] = G.refine(t2[2][1][2][noz], factor, dir=1) |
| 31 | +test.testT(t2, 3) |
| 32 | + |
| 33 | +# Integer refinement factor: GCs and BCs are removed |
| 34 | +# topTree |
| 35 | +factor = 2. |
| 36 | +t2 = G.refine(t, factor, dir=1) |
| 37 | +test.testT(t2, 4) |
| 38 | + |
| 39 | +t2 = G.refine(t, factor, dir=0) |
| 40 | +test.testT(t2, 5) |
| 41 | + |
| 42 | +# single zone |
| 43 | +t2 = Internal.copyRef(t) |
| 44 | +for noz in range(2): t2[2][1][2][noz] = G.refine(t2[2][1][2][noz], factor, dir=1) |
| 45 | +test.testT(t2, 6) |
| 46 | + |
| 47 | +# Non integer refinement factor: GCs and BCs are removed |
| 48 | +# topTree |
| 49 | +factor = 0.3 |
| 50 | +t2 = G.refine(t, factor, dir=1) |
| 51 | +test.testT(t2, 7) |
| 52 | + |
| 53 | +t2 = G.refine(t, factor, dir=0) |
| 54 | +test.testT(t2, 8) |
| 55 | + |
| 56 | +# single zone |
| 57 | +t2 = Internal.copyRef(t) |
| 58 | +for noz in range(2): t2[2][1][2][noz] = G.refine(t2[2][1][2][noz], factor, dir=1) |
| 59 | +test.testT(t2, 9) |
| 60 | + |
| 61 | +# Integer refinement factor: GCs and BCs are removed |
| 62 | +# topTree |
| 63 | +factor = 0.5 |
| 64 | +t2 = G.refine(t, factor, dir=1) |
| 65 | +test.testT(t2, 10) |
| 66 | + |
| 67 | +t2 = G.refine(t, factor, dir=0) |
| 68 | +test.testT(t2, 11) |
| 69 | + |
| 70 | +# single zone |
| 71 | +t2 = Internal.copyRef(t) |
| 72 | +for noz in range(2): t2[2][1][2][noz] = G.refine(t2[2][1][2][noz], factor, dir=1) |
| 73 | +test.testT(t2, 12) |
0 commit comments