• Aucun résultat trouvé

Procedure DEFI_LIST_ENTI Code_Aster

N/A
N/A
Protected

Academic year: 2022

Partager "Procedure DEFI_LIST_ENTI Code_Aster"

Copied!
4
0
0

Texte intégral

(1)

Code_Aster Version default

Titre : Opérateur DEFI_LIST_ENTI Date : 10/04/2009 Page : 1/4

Responsable : Mathieu COURTOIS Clé : U4.34.02 Révision : 654

Procedure DEFI_LIST_ENTI

1 Drank

To create a list of strictly increasing integers.

The list can be given “in extenso” by the user, or, it can be formed from under lists defined in

“constant step”.

The list can be made up by extraction of the sequence numbers of a data structure result.

Product a data structure of the listis type.

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

(2)

Code_Aster Version default

Titre : Opérateur DEFI_LIST_ENTI Date : 10/04/2009 Page : 2/4

Responsable : Mathieu COURTOIS Clé : U4.34.02 Révision : 654

2 Syntax

Li [listis] =DEFI_LISTE_ENTI

( ♦OPERATION=/ “DEFI”, [DEFAULT]

/ “NUME_ORDRE”,

◊INFO=/1 ,

[DEFAULT]

/2 ,

◊TITER=titer ,

[l_Kn]

# If OPERATION = “DEFI”:

/♦VALE=lis ,

[l_I]

/♦DEBUT=deb ,

[I]

/◊INTERVALLE= (_F ( ♦JUSQU_A=if , [I]

♦/NOMBRE=in ,

[I]

/PAS =ipas , [I]

),),

# If OPERATION = “NUME_ORDRE”:

♦RESULTAT = resu, [result]

♦PARAMETRE = resu, [kN]

♦INTERV_R = (val1, val2), [R]

)

3 Operands

3.1 Definition of a list of integers

3.1.1 Operand VALE

◊ VALE = lily

Lists integers which will form the data structure listis result, one can provide any python list.

3.1.2 Operand debut

♦DEBUT =

deb.: first integer of the list to be built.

3.1.3 Key word INTERVALLE

◊ INTERVALLE

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

(3)

Code_Aster Version default

Titre : Opérateur DEFI_LIST_ENTI Date : 10/04/2009 Page : 3/4

Responsable : Mathieu COURTOIS Clé : U4.34.02 Révision : 654

Key word factor whose each occurrence makes it possible to define an interval at constant step.

3.1.3.1 Operand JUSQU_A

♦ JUSQU_A =if

yewis the whole end of the interval to be cut out with a constant step.

3.1.3.2 Operand NOT

♦ /PAS =ipas No division interval.

3.1.3.3 Operand NOMBRE

/NOMBRE = in

Many steps which one wants in the interval.

3.2 Extraction of sequence numbers

This operation makes it possible to result recover in a data structure (evol_noli resulting from STAT/DYNA_NON_LINE for example) the sequence numbers corresponding to certain criteria.

The list of the sequence numbers thus obtained can then be used in all the commands having key word LIST_ORDRE.

For time, the only programmed criterion is the extraction of a parameter in a given interval.

3.2.1.1 Operand PARAMETRE

Name of the parameter of the data structure result which one wants to extract the value.

3.2.1.2 Operand INTERV_R

INTERV_R = (val1, val2)

Definition of the interval to which of which to belong the parameter to be extracted.

3.3 Operand INFO

◊ INFO = I

Indicates the level of printing of the results of the operator:

1 : no printing,

2 : printing of the list of integers created.

3.4 Operand TITER

◊ TITER = title

Titrates attached to the product concept by this operator [U4.03.01].

4 Remarks

• it is checked that the list is increasing,

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

(4)

Code_Aster Version default

Titre : Opérateur DEFI_LIST_ENTI Date : 10/04/2009 Page : 4/4

Responsable : Mathieu COURTOIS Clé : U4.34.02 Révision : 654

• attention: the data structure of the listis type cannot be used behind a key word expecting a l_I (continuation of integers written between brackets).

5 Case

5.1 examples OPERATION = “DEFI”

to build the list of integers to constant step:

1 4 7 10 13 16

listi = DEFI_LIST_ENTI ( debut = 1,

INTERVALLE = (_F ( JUSQU_A =16 ,

NOT =3 ),),

)

to build the list of integers with two values different from the step:

1 2 3 4 5 1 0 1 5

listi = DEFI_LIST_ENTI ( debut =1 ,

INTERVALLE = (_F ( JUSQU_A =5 ,

NOT =1 , ),

_F ( JUSQU_A =15 ,

NOT =5 , ),)

) or

listi = DEFI_LIST_ENTI ( debut =1 ,

INTERVALLE = (_F ( JUSQU_A =5 , NOMBRE =4 , ), _F ( JUSQU_A =15 ,

NOMBRE =2 , ),), )

or, from does not import python list object:

listi = DEFI_LIST_ENTI ( VALE = arranges (10) ,)

5.2 Case OPERATION = “NUME_ORDRE”

lnuor = DEFI_LIST_ENTI (OPERATION=' NUMÉRIQUE_ORDRE', RESULTAT=DEPLTRAN,

PARAMETRE=' INST', INTERV_R= (1.36, 1.46,),)

lnuor will contain the list of the sequence numbers whose value of time (parameter INST) is in the interval given.

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

Références

Documents relatifs

La liste peut être constituée par extraction des numéros d'ordre d'une structure de données résultat.. Produit une structure de données de

Ce mot clé permet de post-traiter certains champs aux nœuds ou aux éléments sur des parties de modèle à des instants d’une liste (dite d’observation) généralement plus

Le calcul de la CFL n’est pas programmé pour tous les éléments (en particulier les éléments discrets sont ignorés.); la CFL estimée par Code_Aster peut donc être plus grande

It is used to introduce the applied forces on fields of linear behavior condensed dynamically and not modelled into computation which calls on a diagram of integration in

La liste peut être constituée par extraction des numéros d'ordre d'une structure de données résultat.. Produit une structure de données de

Le calcul de la CFL n’est pas programmé pour tous les éléments (en particulier les éléments discrets sont ignorés.); la CFL estimée par Code_Aster peut donc être plus grande

Option to be used with a diagram in time clarifies [bib2] and which makes it possible to solve with a matrix of lumpée mass (diagonalized).. This option is not available for all

• a field of size is a structure of data which makes it possible to store fields defined in the nodes (cham_no_*) or of the fields defined by elements (cham_elem_*).. For the fields