/************************************************************************************* Grid physics library, www.github.com/paboyle/Grid Source file: ./lib/Old/Tensor_peek.h Copyright (C) 2015 Author: Peter Boyle This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. See the full license in the file "LICENSE" in the top level distribution directory *************************************************************************************/ /* END LEGAL */ #ifndef GRID_MATH_PEEK_H #define GRID_MATH_PEEK_H namespace Grid { ////////////////////////////////////////////////////////////////////////////// // Peek on a specific index; returns a scalar in that index, tensor inherits rest ////////////////////////////////////////////////////////////////////////////// // If we hit the right index, return scalar with no further recursion //template inline ComplexF peekIndex(const ComplexF arg) { return arg;} //template inline ComplexD peekIndex(const ComplexD arg) { return arg;} //template inline RealF peekIndex(const RealF arg) { return arg;} //template inline RealD peekIndex(const RealD arg) { return arg;} #if 0 // Scalar peek, no indices template::TensorLevel == Level >::type * =nullptr> inline auto peekIndex(const iScalar &arg) -> iScalar { return arg; } // Vector peek, one index template::TensorLevel == Level >::type * =nullptr> inline auto peekIndex(const iVector &arg,int i) -> iScalar // Index matches { iScalar ret; // return scalar ret._internal = arg._internal[i]; return ret; } // Matrix peek, two indices template::TensorLevel == Level >::type * =nullptr> inline auto peekIndex(const iMatrix &arg,int i,int j) -> iScalar { iScalar ret; // return scalar ret._internal = arg._internal[i][j]; return ret; } ///////////// // No match peek for scalar,vector,matrix must forward on either 0,1,2 args. Must have 9 routines with notvalue ///////////// // scalar template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iScalar &arg) -> iScalar(arg._internal))> { iScalar(arg._internal))> ret; ret._internal= peekIndex(arg._internal); return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iScalar &arg,int i) -> iScalar(arg._internal,i))> { iScalar(arg._internal,i))> ret; ret._internal=peekIndex(arg._internal,i); return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iScalar &arg,int i,int j) -> iScalar(arg._internal,i,j))> { iScalar(arg._internal,i,j))> ret; ret._internal=peekIndex(arg._internal,i,j); return ret; } // vector template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iVector &arg) -> iVector(arg._internal[0])),N> { iVector(arg._internal[0])),N> ret; for(int ii=0;ii(arg._internal[ii]); } return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iVector &arg,int i) -> iVector(arg._internal[0],i)),N> { iVector(arg._internal[0],i)),N> ret; for(int ii=0;ii(arg._internal[ii],i); } return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iVector &arg,int i,int j) -> iVector(arg._internal[0],i,j)),N> { iVector(arg._internal[0],i,j)),N> ret; for(int ii=0;ii(arg._internal[ii],i,j); } return ret; } // matrix template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iMatrix &arg) -> iMatrix(arg._internal[0][0])),N> { iMatrix(arg._internal[0][0])),N> ret; for(int ii=0;ii(arg._internal[ii][jj]);// Could avoid this because peeking a scalar is dumb }} return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iMatrix &arg,int i) -> iMatrix(arg._internal[0][0],i)),N> { iMatrix(arg._internal[0][0],i)),N> ret; for(int ii=0;ii(arg._internal[ii][jj],i); }} return ret; } template::TensorLevel != Level >::type * =nullptr> inline auto peekIndex(const iMatrix &arg,int i,int j) -> iMatrix(arg._internal[0][0],i,j)),N> { iMatrix(arg._internal[0][0],i,j)),N> ret; for(int ii=0;ii(arg._internal[ii][jj],i,j); }} return ret; } #endif } #endif