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

Linux Cross Reference
Tina6/tina-libs/tina/math/mathMatr_itimes.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_itimes.c,v $
 37  * Date    :  $Date: 2003/09/23 11:32:20 $
 38  * Version :  $Revision: 1.4 $
 39  * CVS Id  :  $Id: mathMatr_itimes.c,v 1.4 2003/09/23 11:32:20 matts Exp $
 40  *
 41  * Author  :  Legacy TINA
 42  *
 43  * Notes : Multiply an integer matrix by an integer
 44  *
 45  *********
 46 */
 47 /** 
 48  *  @file
 49  *  @brief  Function for multiplying an integer Matrix by an integer.           
 50  *
 51  * 
 52 */
 53 
 54 #include "mathMatr_itimes.h"
 55 
 56 #if HAVE_CONFIG_H
 57 #include <config.h>
 58 #endif
 59 
 60 #include <stdio.h>
 61 #include <tina/sys/sysDef.h>
 62 #include <tina/math/math_MatrDef.h>
 63 #include <tina/math/mathMatr_get.h>
 64 #include <tina/math/mathMatr_alloc.h>
 65 #include <tina/math/mathMatr_put.h>
 66 
 67 Matrix         *matrix_itimes(int k, Matrix * mat)
 68 {
 69         Matrix         *prod;
 70         int             m, n, i, j;
 71         int           **el1, **el2;
 72 
 73         if (mat == NULL)
 74                 return (NULL);
 75 
 76         m = mat->m;
 77         n = mat->n;
 78         el1 = mat->el.int_v;
 79 
 80         switch (mat->shape)
 81         {
 82         case matrix_full:
 83                 prod = matrix_alloc(m, n, matrix_full, int_v);
 84                 el2 = prod->el.int_v;
 85                 for (i = 0; i < m; ++i)
 86                         for (j = 0; j < n; ++j)
 87                                 el2[i][j] = k * el1[i][j];
 88                 break;
 89         case matrix_lower:
 90                 prod = matrix_alloc(m, n, matrix_lower, int_v);
 91                 el2 = prod->el.int_v;
 92                 for (i = 0; i < m; ++i)
 93                         for (j = 0; j <= i; ++j)
 94                                 el2[i][j] = k * el1[i][j];
 95                 break;
 96         case matrix_upper:
 97                 prod = matrix_alloc(m, n, matrix_upper, int_v);
 98                 el2 = prod->el.int_v;
 99                 for (i = 0; i < m; ++i)
100                         for (j = i; j < n; ++j)
101                                 el2[i][j] = k * el1[i][j];
102                 break;
103         case matrix_symmetric:
104                 prod = matrix_alloc(m, n, matrix_symmetric, int_v);
105                 el2 = prod->el.int_v;
106                 for (i = 0; i < m; ++i)
107                         for (j = 0; j <= i; ++j)
108                                 el2[i][j] = k * el1[i][j];
109                 break;
110         default:
111                 prod = matrix_alloc(m, n, matrix_full, int_v);
112                 for (i = 0; i < m; ++i)
113                         for (j = 0; j < n; ++j)
114                                 matrix_put(k * matrix_get(mat, i, j), prod, i, j);
115                 break;
116         }
117 
118         return (prod);
119 }
120 

~ [ 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.