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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/*
* Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
* Copyright (C) 2010-2011 - DIGITEO - Allan CORNET
*
* 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.1-en.txt
*
*/
#include <string.h>
#include "MALLOC.h"
#include "getRange.h"
#ifdef _MSC_VER
#include "strdup_windows.h"
#endif
// =============================================================================
#define SIZE_ARRAY_RANGE 4
// =============================================================================
static int getRangeSize(int *lowCoord, int *highCoord, int maxCoord);
// =============================================================================
void getSubIndices(const int *iRange, int * R1, int * R2, int * C1, int * C2 )
{
*R1 = iRange[0];
*C1 = iRange[1];
*R2 = iRange[2];
*C2 = iRange[3];
return;
}
// =============================================================================
int isValidRange(const int *iRange, int sizeArray)
{
int i = 0;
int R1 = 0, C1 = 0, R2 = 0, C2 = 0;
if (iRange == NULL)
{
return 0;
}
getSubIndices(iRange, &R1, &R2, &C1, &C2 );
if (sizeArray != SIZE_ARRAY_RANGE)
{
return 0;
}
if (R1 <= 0)
{
return 0;
}
if (R2 <= 0)
{
return 0;
}
if (C1 <= 0)
{
return 0;
}
if (C2 <= 0)
{
return 0;
}
if (R1 > R2)
{
return 0;
}
if (C1 > C2)
{
return 0;
}
return 1;
}
// =============================================================================
char **getRangeAsString(const char **pStrsValues,
int nbRows, int nbCols,
const int *iRange,
int *returnedNbRows, int *returnedNbCols)
{
if (isValidRange(iRange, SIZE_ARRAY_RANGE))
{
int R1, C1, R2, C2;
int rangeSize;
getSubIndices(iRange, &R1, &R2, &C1, &C2);
*returnedNbRows = getRangeSize(&R1, &R2, nbRows);
*returnedNbCols = getRangeSize(&C1, &C2, nbCols);
rangeSize = (*returnedNbRows) * (*returnedNbCols);
if (rangeSize > 0)
{
char **newStrArray = (char**)MALLOC(sizeof(char*) * rangeSize);
if (newStrArray != NULL)
{
int i = 0;
int j = 0;
int k = 0;
for (j = C1 - 1 ; j < C2 ; j++)
{
for (i = R1 - 1 ; i < R2 ; i++ )
{
newStrArray[k] = strdup(pStrsValues[i + nbRows * j]);
k++;
}
}
}
return newStrArray;
}
// range is empty, calling function should raise an out of bound error
}
return NULL;
}
// =============================================================================
complexArray *getRangeAsComplexArray(const complexArray *pComplex,
int nbRows, int nbCols,
const int *iRange,
int *returnedNbRows, int *returnedNbCols)
{
if (isValidRange(iRange, SIZE_ARRAY_RANGE))
{
int R1, C1, R2, C2;
int rangeSize;
getSubIndices(iRange, &R1, &R2, &C1, &C2 );
*returnedNbRows = getRangeSize(&R1, &R2, nbRows);
*returnedNbCols = getRangeSize(&C1, &C2, nbCols);
rangeSize = (*returnedNbRows) * (*returnedNbCols);
if (rangeSize > 0)
{
complexArray *newComplexArray =
createComplexArrayEmpty(rangeSize);
if (newComplexArray != NULL)
{
int i = 0;
int j = 0;
int k = 0;
newComplexArray->isComplex = pComplex->isComplex;
for (j = C1 - 1 ; j < C2 ; j++)
{
for (i = R1 - 1 ; i < R2 ; i++)
{
newComplexArray->realPart[k] = pComplex->realPart[i + (nbRows * j)];
if (pComplex->isComplex)
{
newComplexArray->imagPart[k] = pComplex->imagPart[i + (nbRows * j)];
}
k++;
}
}
}
return newComplexArray;
}
// range is empty, calling function should raise an out of bound error
}
return NULL;
}
// =============================================================================
static int getRangeSize(int *lowCoord, int *highCoord, int maxCoord)
{
// IsValidRange has done all checks of range, except on right bound
if (*lowCoord <= maxCoord)
{
if (*highCoord > maxCoord)
{
*highCoord = maxCoord;
}
return *highCoord - *lowCoord + 1;
}
// lower coord is out of bound
return 0;
}
// =============================================================================
|
