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
|
/*
* Copyright (c) 1999-2001 Philippe Grandclement
*
* 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 mult2_xp1_1d_C[] = "$Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/mult2_xp1_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $" ;
/*
* $Id: mult2_xp1_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $
* $Log: mult2_xp1_1d.C,v $
* Revision 1.3 2014/10/13 08:53:24 j_novak
* Lorene classes and functions now belong to the namespace Lorene.
*
* Revision 1.2 2014/10/06 15:16:06 j_novak
* Modified #include directives to use c++ syntax.
*
* Revision 1.1 2007/12/11 15:42:22 jl_cornou
* Premiere version des fonctions liees aux polynomes de Jacobi(0,2)
*
* Revision 1.2 2002/10/16 14:36:58 j_novak
* Reorganization of #include instructions of standard C++, in order to
* use experimental version 3 of gcc.
*
* Revision 1.1.1.1 2001/11/20 15:19:29 e_gourgoulhon
* LORENE
*
* Revision 2.0 1999/10/11 09:53:08 phil
* *** empty log message ***
*
*
* $Header: /cvsroot/Lorene/C++/Source/Non_class_members/Operators/mult2_xp1_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $
*
*/
// Includes
#include <cstdlib>
#include <cassert>
#include "headcpp.h"
#include "type_parite.h"
#include "proto.h"
namespace Lorene {
void multxpun_1d(int, double **, int) ;
//-----------------------------------
// Routine pour les cas non prevus --
//-----------------------------------
void _mult2_xp1_1d_pas_prevu(int nr, double* tb, double *res) {
cout << "mult2_xp1 pas prevu..." << tb << " " << res << endl ;
cout << "nr : " << nr << endl ;
abort() ;
exit(-1) ;
}
//---------------
// cas R_JACO02 -
//---------------
void _mult2_xp1_1d_r_jaco02(int nr, double* tb, double *xo) {
assert (nr>2) ;
multxpun_1d(nr, &tb, R_JACO02 >> TRA_R) ;
multxpun_1d(nr, &tb, R_JACO02 >> TRA_R) ;
for (int i = 0 ; i<nr ; i++) {
xo[i] = tb[i] ;
}
}
//----------------------
// La routine a appeler
//----------------------
void mult2_xp1_1d(int nr, double **tb, int base_r) // Version appliquee a this
{
// Routines de derivation
static void (*mult2_xp1_1d[MAX_BASE])(int, double *, double*) ;
static int nap = 0 ;
// Premier appel
if (nap==0) {
nap = 1 ;
for (int i=0 ; i<MAX_BASE ; i++) {
mult2_xp1_1d[i] = _mult2_xp1_1d_pas_prevu ;
}
// Les routines existantes
mult2_xp1_1d[R_JACO02 >> TRA_R] = _mult2_xp1_1d_r_jaco02 ;
}
double *result = new double[nr] ;
mult2_xp1_1d[base_r](nr, *tb, result) ;
delete [] (*tb) ;
(*tb) = result ;
}
}
|
