~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Linux Cross Reference
Tina6/tina-libs/tina/math/mathMatr_minus.c

Version: ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /**********
  2  *
  3  * Copyright (c) 2003, Division of Imaging Science and Biomedical Engineering,
  4  * University of Manchester, UK.  All rights reserved.
  5  * 
  6  * Redistribution and use in source and binary forms, with or without modification, 
  7  * are permitted provided that the following conditions are met:
  8  * 
  9  *   . Redistributions of source code must retain the above copyright notice, 
 10  *     this list of conditions and the following disclaimer.
 11  *    
 12  *   . Redistributions in binary form must reproduce the above copyright notice,
 13  *     this list of conditions and the following disclaimer in the documentation 
 14  *     and/or other materials provided with the distribution.
 15  * 
 16  *   . Neither the name of the University of Manchester nor the names of its
 17  *     contributors may be used to endorse or promote products derived from this 
 18  *     software without specific prior written permission.
 19  * 
 20  * 
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
 23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  *
 33  **********
 34  *
 35  * Program :    TINA
 36  * File    :  $Source: /home/tina/cvs/tina-libs/tina/math/mathMatr_minus.c,v $
 37  * Date    :  $Date: 2003/09/23 11:32:20 $
 38  * Version :  $Revision: 1.4 $
 39  * CVS Id  :  $Id: mathMatr_minus.c,v 1.4 2003/09/23 11:32:20 matts Exp $
 40  *
 41  * Author  :  Legacy TINA
 42  *
 43  * Notes : Matrix negation. (Negate elements of matrix)
 44  *
 45  *********
 46 */
 47 /** 
 48  *  @file
 49  *  @brief  Negation of Matrix elements.        
 50  *
 51  *
 52  * 
 53 */
 54 
 55 #include "mathMatr_minus.h"
 56 
 57 #if HAVE_CONFIG_H
 58 #include <config.h>
 59 #endif
 60 
 61 #include <math.h>
 62 #include <stdio.h>
 63 #include <tina/sys/sysDef.h>
 64 #include <tina/sys/sysGen_error.h>
 65 #include <tina/math/math_MatrDef.h>
 66 #include <tina/math/mathMatr_get.h>
 67 #include <tina/math/mathMatr_put.h>
 68 #include <tina/math/mathMatr_copy.h>
 69 
 70 
 71 Matrix         *matrix_minus(Matrix * mat)
 72 {
 73         int             m, n, i, j;
 74         Matrix         *minus;
 75 
 76         if (mat == NULL)
 77                 return (NULL);
 78 
 79         minus = matrix_copy(mat);
 80         m = mat->m;
 81         n = mat->n;
 82 
 83         /** explicit for standard shapes **/
 84 
 85         switch (OPAIR(mat->vtype, mat->shape))
 86         {
 87         case OPAIR(int_v, matrix_full):
 88                 {
 89                         int           **el = minus->el.int_v;
 90 
 91                         for (i = 0; i < m; i++)
 92                                 for (j = 0; j < n; j++)
 93                                         el[i][j] = -el[i][j];
 94                         return (minus);
 95                 }
 96         case OPAIR(float_v, matrix_full):
 97                 {
 98                         float         **el = minus->el.float_v;
 99 
100                         for (i = 0; i < m; i++)
101                                 for (j = 0; j < n; j++)
102                                         el[i][j] = -el[i][j];
103                         return (minus);
104                 }
105         case OPAIR(double_v, matrix_full):
106                 {
107                         double        **el = minus->el.double_v;
108 
109                         for (i = 0; i < m; i++)
110                                 for (j = 0; j < n; j++)
111                                         el[i][j] = -el[i][j];
112                         return (minus);
113                 }
114         case OPAIR(int_v, matrix_lower):
115         case OPAIR(int_v, matrix_symmetric):
116                 {
117                         int           **el = minus->el.int_v;
118 
119                         for (i = 0; i < m; i++)
120                                 for (j = 0; j <= i; j++)
121                                         el[i][j] = -el[i][j];
122                         return (minus);
123                 }
124         case OPAIR(float_v, matrix_lower):
125         case OPAIR(float_v, matrix_symmetric):
126                 {
127                         float         **el = minus->el.float_v;
128 
129                         for (i = 0; i < m; i++)
130                                 for (j = 0; j <= i; j++)
131                                         el[i][j] = -el[i][j];
132                         return (minus);
133                 }
134         case OPAIR(double_v, matrix_lower):
135         case OPAIR(double_v, matrix_symmetric):
136                 {
137                         double        **el = minus->el.double_v;
138 
139                         for (i = 0; i < m; i++)
140                                 for (j = 0; j <= i; j++)
141                                         el[i][j] = -el[i][j];
142                         return (minus);
143                 }
144         case OPAIR(int_v, matrix_upper):
145                 {
146                         int           **el = minus->el.int_v;
147 
148                         for (i = 0; i < m; i++)
149                                 for (j = i; j < n; j++)
150                                         el[i][j] = -el[i][j];
151                         return (minus);
152                 }
153         case OPAIR(float_v, matrix_upper):
154                 {
155                         float         **el = minus->el.float_v;
156 
157                         for (i = 0; i < m; i++)
158                                 for (j = i; j < n; j++)
159                                         el[i][j] = -el[i][j];
160                         return (minus);
161                 }
162         case OPAIR(double_v, matrix_upper):
163                 {
164                         double        **el = minus->el.double_v;
165 
166                         for (i = 0; i < m; i++)
167                                 for (j = i; j < n; j++)
168                                         el[i][j] = -el[i][j];
169                         return (minus);
170                 }
171         }
172 
173         /** generic for other shapes **/
174 
175         switch (mat->vtype)
176         {
177         case int_v:
178                 for (i = 0; i < m; i++)
179                         for (j = 0; j < n; j++)
180                                 matrix_put(-matrix_get(mat, i, j), minus, i, j);
181                 break;
182         case float_v:
183         case double_v:
184                 for (i = 0; i < m; i++)
185                         for (j = 0; j < n; j++)
186                                 matrix_putf(-matrix_getf(mat, i, j), minus, i, j);
187                 break;
188         default:
189                 error("matrix_minus: unsupported type", non_fatal);
190                 break;
191         }
192         return (minus);
193 }
194 
195 Matrix         *fmatrix_minus(Matrix * mat)     /* assume full float matrix */
196 
197 {
198         int             m, n, i, j;
199         Matrix         *minus;
200         float         **el;
201 
202         if (mat == NULL)
203                 return (NULL);
204 
205         minus = matrix_copy(mat);
206         m = mat->m;
207         n = mat->n;
208 
209         el = minus->el.float_v;
210         for (i = 0; i < m; i++)
211                 for (j = 0; j < n; j++)
212                         el[i][j] = -el[i][j];
213         return (minus);
214 }
215 
216 Matrix         *fmatrix_minus_inplace(Matrix * mat)     /* assume full float
217                                                          * matrix */
218 
219 {
220         int             m, n, i, j;
221         float         **el;
222 
223         if (mat == NULL)
224                 return (NULL);
225 
226         m = mat->m;
227         n = mat->n;
228 
229         el = mat->el.float_v;
230         for (i = 0; i < m; i++)
231                 for (j = 0; j < n; j++)
232                         el[i][j] = -el[i][j];
233         return (mat);
234 }
235 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.