![]() |
Shadowrun: Awakened 29 September 2011 - Build 871
|
00001 /* 00002 Copyright 2005-2010 Intel Corporation. All Rights Reserved. 00003 00004 This file is part of Threading Building Blocks. 00005 00006 Threading Building Blocks is free software; you can redistribute it 00007 and/or modify it under the terms of the GNU General Public License 00008 version 2 as published by the Free Software Foundation. 00009 00010 Threading Building Blocks is distributed in the hope that it will be 00011 useful, but WITHOUT ANY WARRANTY; without even the implied warranty 00012 of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 GNU General Public License for more details. 00014 00015 You should have received a copy of the GNU General Public License 00016 along with Threading Building Blocks; if not, write to the Free Software 00017 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 00018 00019 As a special exception, you may use this file as part of a free software 00020 library without restriction. Specifically, if other files instantiate 00021 templates or use macros or inline functions from this file, or you compile 00022 this file and link it with other files to produce an executable, this 00023 file does not by itself cause the resulting executable to be covered by 00024 the GNU General Public License. This exception does not however 00025 invalidate any other reasons why the executable file might be covered by 00026 the GNU General Public License. 00027 */ 00028 00029 class Matrix { 00030 static const int n = 10; 00031 float array[n][n]; 00032 public: 00033 Matrix() {} 00034 Matrix( float z ) { 00035 for( int i=0; i<n; ++i ) 00036 for( int j=0; j<n; ++j ) 00037 array[i][j] = i==j ? z : 0; 00038 } 00039 friend Matrix operator-( const Matrix& x ) { 00040 Matrix result; 00041 for( int i=0; i<n; ++i ) 00042 for( int j=0; j<n; ++j ) 00043 result.array[i][j] = -x.array[i][j]; 00044 return result; 00045 } 00046 friend Matrix operator+( const Matrix& x, const Matrix& y ) { 00047 Matrix result; 00048 for( int i=0; i<n; ++i ) 00049 for( int j=0; j<n; ++j ) 00050 result.array[i][j] = x.array[i][j] + y.array[i][j]; 00051 return result; 00052 } 00053 friend Matrix operator-( const Matrix& x, const Matrix& y ) { 00054 Matrix result; 00055 for( int i=0; i<n; ++i ) 00056 for( int j=0; j<n; ++j ) 00057 result.array[i][j] = x.array[i][j] - y.array[i][j]; 00058 return result; 00059 } 00060 friend Matrix operator*( const Matrix& x, const Matrix& y ) { 00061 Matrix result(0); 00062 for( int i=0; i<n; ++i ) 00063 for( int k=0; k<n; ++k ) 00064 for( int j=0; j<n; ++j ) 00065 result.array[i][j] += x.array[i][k] * y.array[k][j]; 00066 return result; 00067 } 00068 };
Copyright © 2007-2010 by The Shadowrun: Awakened Team. This work is licensed under the GNU Lesser General Public License 3.