1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/*
* Multiplication by cos(theta)
*
* for:
* - Valeur
* - Mtbl_cf
*/
/*
* Copyright (c) 1999-2001 Jerome Novak
* Copyright (c) 1999-2001 Eric Gourgoulhon
*
* This file is part of LORENE.
*
* LORENE is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* LORENE is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with LORENE; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
char valeur_mult_ct_C[] = "$Header: /cvsroot/Lorene/C++/Source/Valeur/valeur_mult_ct.C,v 1.5 2014/10/13 08:53:50 j_novak Exp $" ;
/*
* $Id: valeur_mult_ct.C,v 1.5 2014/10/13 08:53:50 j_novak Exp $
* $Log: valeur_mult_ct.C,v $
* Revision 1.5 2014/10/13 08:53:50 j_novak
* Lorene classes and functions now belong to the namespace Lorene.
*
* Revision 1.4 2014/10/06 15:13:23 j_novak
* Modified #include directives to use c++ syntax.
*
* Revision 1.3 2009/10/09 14:01:06 j_novak
* New bases T_cos and T_SIN.
*
* Revision 1.2 2004/11/23 15:17:19 m_forot
* Added the bases for the cases without any equatorial symmetry
* (T_COSSIN_C, T_COSSIN_S, T_LEG, R_CHEBPI_P, R_CHEBPI_I).
*
* Revision 1.1.1.1 2001/11/20 15:19:27 e_gourgoulhon
* LORENE
*
* Revision 1.4 1999/11/30 12:44:45 eric
* Valeur::base est desormais du type Base_val et non plus Base_val*.
*
* Revision 1.3 1999/11/24 09:33:02 eric
* Modif commentaires.
*
* Revision 1.2 1999/11/23 16:17:47 eric
* Reorganisation du calcul dans le cas ETATZERO.
*
* Revision 1.1 1999/11/23 14:31:28 novak
* Initial revision
*
*
* $Header: /cvsroot/Lorene/C++/Source/Valeur/valeur_mult_ct.C,v 1.5 2014/10/13 08:53:50 j_novak Exp $
*
*/
// Headers C
#include <cassert>
// Headers Lorene
#include "mtbl_cf.h"
#include "valeur.h"
// Local prototypes
namespace Lorene {
void _mult_ct_pas_prevu (Tbl*, int&) ;
void _mult_ct_t_cos (Tbl*, int&) ;
void _mult_ct_t_sin (Tbl*, int&) ;
void _mult_ct_t_sin_p (Tbl*, int&) ;
void _mult_ct_t_sin_i (Tbl*, int&) ;
void _mult_ct_t_cos_i (Tbl*, int&) ;
void _mult_ct_t_cos_p (Tbl*, int&) ;
void _mult_ct_t_cossin_si (Tbl*, int&) ;
void _mult_ct_t_cossin_ci (Tbl*, int&) ;
void _mult_ct_t_cossin_cp (Tbl*, int&) ;
void _mult_ct_t_cossin_sp (Tbl*, int&) ;
void _mult_ct_t_cossin_c (Tbl*, int&) ;
void _mult_ct_t_cossin_s (Tbl*, int&) ;
// Version membre d'un Valeur
// --------------------------
const Valeur& Valeur::mult_ct() const {
// Protection
assert(etat != ETATNONDEF) ;
// Peut-etre rien a faire ?
if (p_mult_ct != 0x0) {
return *p_mult_ct ;
}
// ... si, il faut bosser
p_mult_ct = new Valeur(mg) ;
if (etat == ETATZERO) {
p_mult_ct->set_etat_zero() ;
}
else {
assert(etat == ETATQCQ) ;
p_mult_ct->set_etat_cf_qcq() ;
Mtbl_cf* cfp = p_mult_ct->c_cf ; // Pointeur sur le Mtbl_cf qui vient d'etre
// cree par le set_etat_cf_qcq()
// Initialisation de *cfp : recopie des coef. de la fonction
if (c_cf == 0x0) {
coef() ;
}
*cfp = *c_cf ;
cfp->mult_ct() ; // calcul
p_mult_ct->base = cfp->base ; // On remonte la base de sortie au niveau Valeur
}
// Termine
return *p_mult_ct ;
}
// Version membre d'un Mtbl_cf
// ---------------------------
void Mtbl_cf::mult_ct() {
// Routines de derivation
static void (*_mult_ct[MAX_BASE])(Tbl *, int &) ;
static int nap = 0 ;
// Premier appel
if (nap==0) {
nap = 1 ;
for (int i=0 ; i<MAX_BASE ; i++) {
_mult_ct[i] = _mult_ct_pas_prevu ;
}
// Les routines existantes
_mult_ct[T_COS >> TRA_T] = _mult_ct_t_cos ;
_mult_ct[T_SIN >> TRA_T] = _mult_ct_t_sin ;
_mult_ct[T_COS_P >> TRA_T] = _mult_ct_t_cos_p ;
_mult_ct[T_COS_I >> TRA_T] = _mult_ct_t_cos_i ;
_mult_ct[T_SIN_P >> TRA_T] = _mult_ct_t_sin_p ;
_mult_ct[T_SIN_I >> TRA_T] = _mult_ct_t_sin_i ;
_mult_ct[T_COSSIN_SI >> TRA_T] = _mult_ct_t_cossin_si ;
_mult_ct[T_COSSIN_CI >> TRA_T] = _mult_ct_t_cossin_ci ;
_mult_ct[T_COSSIN_CP >> TRA_T] = _mult_ct_t_cossin_cp ;
_mult_ct[T_COSSIN_SP >> TRA_T] = _mult_ct_t_cossin_sp ;
_mult_ct[T_COSSIN_C >> TRA_T] = _mult_ct_t_cossin_c ;
_mult_ct[T_COSSIN_S >> TRA_T] = _mult_ct_t_cossin_s ;
}
// Debut de la routine
// Protection
assert(etat == ETATQCQ) ;
// Boucle sur les zones
int base_t ;
for (int l=0 ; l<nzone ; l++) {
base_t = (base.b[l] & MSQ_T) >> TRA_T ;
assert(t[l] != 0x0) ;
_mult_ct[base_t](t[l], base.b[l]) ;
}
}
}
|
