1 #@ MODIF sd_ligrel SD DATE 16/06/2009 AUTEUR PELLET J.PELLET
2 # -*- coding: iso-8859-1 -*-
3 # CONFIGURATION MANAGEMENT OF EDF VERSION
4 # ======================================================================
5 # COPYRIGHT (C) 1991 - 2007 EDF R&D WWW.CODE-ASTER.ORG
6 # THIS PROGRAM IS FREE SOFTWARE; YOU CAN REDISTRIBUTE IT AND/OR MODIFY
7 # IT UNDER THE TERMS OF THE GNU GENERAL PUBLIC LICENSE AS PUBLISHED BY
8 # THE FREE SOFTWARE FOUNDATION; EITHER VERSION 2 OF THE LICENSE, OR
9 # (AT YOUR OPTION) ANY LATER VERSION.
11 # THIS PROGRAM IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL, BUT
12 # WITHOUT ANY WARRANTY; WITHOUT EVEN THE IMPLIED WARRANTY OF
13 # MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. SEE THE GNU
14 # GENERAL PUBLIC LICENSE FOR MORE DETAILS.
16 # YOU SHOULD HAVE RECEIVED A COPY OF THE GNU GENERAL PUBLIC LICENSE
17 # ALONG WITH THIS PROGRAM; IF NOT, WRITE TO EDF R&D CODE_ASTER,
18 # 1 AVENUE DU GENERAL DE GAULLE, 92141 CLAMART CEDEX, FRANCE.
19 # ======================================================================
23 class sd_ligrel(AsBase):
26 LGRF = AsVK8(lonmax=2, docu=Parmi('ACOU', 'MECA', 'THER'), )
27 NBNO = AsVI(lonmax=1,)
30 # AU_MOINS_UN : LIEL, SSSA
31 # LIEL : il existe des éléments finis
32 # SSSA : il existe des sous-structures statiques
33 LIEL = Facultatif(AsColl( acces='NU', stockage='CONTIG', modelong='VARIABLE', type='I', ))
34 SSSA = Facultatif(AsVI())
35 # ENSEMBLE : LIEL, REPE
36 REPE = Facultatif(AsVI())
38 # si mailles tardives :
39 NEMA = Facultatif(AsColl( acces='NU', stockage='CONTIG', modelong='VARIABLE', type='I', ))
41 PRNS = Facultatif(AsVI())
42 LGNS = Facultatif(AsVI())
46 # retourne True si la SD semble exister.
47 return self.LGRF.exists
49 def check_LGRF(self,checker):
50 if not self.exists() : return
51 lgrf=self.LGRF.get_stripped()
52 from SD.sd_maillage import sd_maillage
53 sd2=sd_maillage(lgrf[0]); sd2.check(checker)
55 from SD.sd_partition import sd_partition
56 sd2=sd_partition(lgrf[1]); sd2.check(checker)
59 def check_presence(self,checker):
60 if not self.exists() : return
61 exi_liel=self.LIEL.exists
62 exi_sssa=self.SSSA.exists
63 exi_repe=self.REPE.exists
64 exi_nema=self.NEMA.exists
65 exi_prns=self.PRNS.exists
66 exi_lgns=self.LGNS.exists
68 # AU_MOINS_UN : .LIEL, .SSSA
69 assert exi_liel or exi_sssa
71 # SI .LIEL AU_MOINS_UN : .REPE, .NEMA
73 assert exi_repe or exi_nema
76 if exi_repe : assert exi_liel
79 if exi_nema : assert exi_liel
81 # noeuds tardifs => .PRNS .LGNS et .NEMA
82 nb_no_tard= self.NBNO.get()[0]
87 assert self.LGNS.lonmax >= nb_no_tard # .LGNS est surdimensionné
88 nbec= self.PRNS.lonmax / nb_no_tard
89 assert self.PRNS.lonmax == nb_no_tard * nbec , (nbec, nb_no_tard)
90 assert nbec >= 1 and nbec < 10 , nbec