summaryrefslogtreecommitdiff
path: root/2.3-1/src/c/matrixOperations/diag/i8diagexa.c
blob: 8d5513b69af6d3f059120d1f46fc7be95eea68ba (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/* Copyright (C) 2016 - IIT Bombay - FOSSEE

 This file must be used under the terms of the CeCILL.
 This source file is licensed as described in the file COPYING, which
 you should have received as part of this distribution.  The terms
 are also available at
 http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
 Author: Mushir
 Organization: FOSSEE, IIT Bombay
 Email: toolbox@scilab.in
*/

#include "diag.h"
void i8diagexa(int8 *in, int _row,int _column,int extract_post,int8 *out)
{
     
    
    int  j;
    if(_row == _column)
     {
         if(extract_post <= 0)
	   {
      	     for ( j = 0 ; j < _column ; j++ )
               {
                
                 
                  out[j] = in[((_column+1)*j)-extract_post] ;  
                   
               }  
           }
         else
	    {
      	       for ( j = extract_post ; j < _column ; j++ )
                  {
                
                 
                   out[j-extract_post] = in[((_column+1)*j)-extract_post] ;  
                   
                 }
    	     }  

     } 
     else if(_row > _column)
     {

        if(extract_post >=0)
          {
       
             for(j = extract_post; j < _column;j++)
               {

                   out[j-extract_post] = in[((_row+1)*j)-extract_post];
               }
             

          }
        else
          {
                
              if((abs(extract_post) <= (_row - _column)))
                {
                   for(j = 0; j < _column ; j++)  
                      {
                         out[j] = in[((_row+1)*j)-extract_post];
                      
                      }
                }
               else
                 {

                     for(j=0; j < (_row + extract_post);j++) 
                       {

                            out[j] = in[((_row+1)*j)-extract_post];
             
                       }
                                    


                 }

          }

      }
     else if (_row < _column)
      {
        
        if(extract_post > 0)
         {
             if((extract_post <= (_column - _row)))
              {
                for(j=extract_post;j < _column;j++) 
                 {
                      out[j-extract_post] = in[((_row+1)*j)-extract_post]; 
                 }
                  
              }
            else
               {
                 for(j=extract_post;j < _column;j++) 
                  {
                      out[j-extract_post] = in[((_row+1)*j)-extract_post]; 
                  }

              }  

         }   
         else
            {
              
                 
                 for(j=0;j < (_row+extract_post);j++)
                    {

                        out[j] =  in[((_row+1)*j)-extract_post];            



                    }



            }
       
       
      }
         

}