LORENE
mult2_xp1_1d.C
1/*
2 * Copyright (c) 1999-2001 Philippe Grandclement
3 *
4 * This file is part of LORENE.
5 *
6 * LORENE 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.
10 *
11 * LORENE is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with LORENE; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *
20 */
21
22
23char 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 $" ;
24
25/*
26 * $Id: mult2_xp1_1d.C,v 1.3 2014/10/13 08:53:24 j_novak Exp $
27 * $Log: mult2_xp1_1d.C,v $
28 * Revision 1.3 2014/10/13 08:53:24 j_novak
29 * Lorene classes and functions now belong to the namespace Lorene.
30 *
31 * Revision 1.2 2014/10/06 15:16:06 j_novak
32 * Modified #include directives to use c++ syntax.
33 *
34 * Revision 1.1 2007/12/11 15:42:22 jl_cornou
35 * Premiere version des fonctions liees aux polynomes de Jacobi(0,2)
36 *
37 * Revision 1.2 2002/10/16 14:36:58 j_novak
38 * Reorganization of #include instructions of standard C++, in order to
39 * use experimental version 3 of gcc.
40 *
41 * Revision 1.1.1.1 2001/11/20 15:19:29 e_gourgoulhon
42 * LORENE
43 *
44 * Revision 2.0 1999/10/11 09:53:08 phil
45 * *** empty log message ***
46 *
47 *
48 * $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 $
49 *
50 */
51
52// Includes
53#include <cstdlib>
54#include <cassert>
55
56#include "headcpp.h"
57#include "type_parite.h"
58#include "proto.h"
59
60namespace Lorene {
61void multxpun_1d(int, double **, int) ;
62
63 //-----------------------------------
64 // Routine pour les cas non prevus --
65 //-----------------------------------
66
67void _mult2_xp1_1d_pas_prevu(int nr, double* tb, double *res) {
68 cout << "mult2_xp1 pas prevu..." << tb << " " << res << endl ;
69 cout << "nr : " << nr << endl ;
70 abort() ;
71 exit(-1) ;
72}
73
74 //---------------
75 // cas R_JACO02 -
76 //---------------
77
78void _mult2_xp1_1d_r_jaco02(int nr, double* tb, double *xo) {
79
80 assert (nr>2) ;
81 multxpun_1d(nr, &tb, R_JACO02 >> TRA_R) ;
82 multxpun_1d(nr, &tb, R_JACO02 >> TRA_R) ;
83 for (int i = 0 ; i<nr ; i++) {
84 xo[i] = tb[i] ;
85 }
86}
87
88
89 //----------------------
90 // La routine a appeler
91 //----------------------
92
93void mult2_xp1_1d(int nr, double **tb, int base_r) // Version appliquee a this
94{
95
96// Routines de derivation
97static void (*mult2_xp1_1d[MAX_BASE])(int, double *, double*) ;
98static int nap = 0 ;
99
100 // Premier appel
101 if (nap==0) {
102 nap = 1 ;
103 for (int i=0 ; i<MAX_BASE ; i++) {
104 mult2_xp1_1d[i] = _mult2_xp1_1d_pas_prevu ;
105 }
106 // Les routines existantes
107 mult2_xp1_1d[R_JACO02 >> TRA_R] = _mult2_xp1_1d_r_jaco02 ;
108 }
109
110 double *result = new double[nr] ;
111 mult2_xp1_1d[base_r](nr, *tb, result) ;
112
113 delete [] (*tb) ;
114 (*tb) = result ;
115}
116}
#define MAX_BASE
Nombre max. de bases differentes.
#define R_JACO02
base de Jacobi(0,2) ordinaire (finjac)
#define TRA_R
Translation en R, used for a bitwise shift (in hex)
Lorene prototypes.
Definition app_hor.h:64