File: SparseMatrix.cc

package info (click to toggle)
proda 1.0-12
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 584 kB
  • sloc: cpp: 8,549; xml: 163; makefile: 109; sh: 12
file content (242 lines) | stat: -rw-r--r-- 7,658 bytes parent folder | download | duplicates (4)
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
//////////////////////////////////////////////////////////////////////
// SparseMatrix.cc
//////////////////////////////////////////////////////////////////////

#include "Assert.h"
#include "SparseMatrix.h"

typedef SparseMatrix::SparseMatrixEntry *SparseMatrixEntryPtr;

//////////////////////////////////////////////////////////////////////
// Constructor (using Matrix)
//////////////////////////////////////////////////////////////////////

SparseMatrix::SparseMatrix (const Matrix &matrix, const float &threshold, const float &missing) :
  threshold(threshold), missing(missing), 
  layers(matrix.layers), rows(matrix.rows), cols(matrix.cols), numEntries (0) {
  
  ASSERT (layers >= 0, "Number of layers in matrix must be positive.");
  ASSERT (rows >= 0, "Number of rows in matrix must be positive.");
  ASSERT (cols >= 0, "Number of columns in matrix must be positive.");

  // count number of entries needed

  for (int i = 0; i < layers * rows * cols; i++)
    numEntries += (matrix.data[i] >= threshold);
  
  // allocate memory

  data = new SparseMatrixEntry[numEntries];
  ASSERT (data, "Out of memory.");

  rowSize = new int[layers * rows];
  ASSERT (rowSize, "Out of memory.");

  rowPtrs = new SparseMatrixEntryPtr[layers * rows];
  ASSERT (rowPtrs, "Out of memory.");

  // build sparse matrices, layer-by-layer
  
  SparseMatrixEntry *dataPtr = data;
  for (int k = 0; k < layers; k++){
    for (int i = 0; i < rows; i++){
      int numColsUsed = 0;
      for (int j = 0; j < cols; j++){
	if (matrix(k,i,j) >= threshold){
	  dataPtr->column = j;
	  dataPtr->value = matrix(k,i,j);
	  ++dataPtr;
	  numColsUsed++;
	}
      }
      rowSize[k * rows + i] = numColsUsed;
    }
  }

  // compute pointers to beginning of each row

  rowPtrs[0] = data;
  {for (int i = 1; i < layers * rows; i++)
	  rowPtrs[i] = rowPtrs[i-1] + rowSize[i-1];}
}

//////////////////////////////////////////////////////////////////////
// Destructor
//////////////////////////////////////////////////////////////////////

SparseMatrix::~SparseMatrix (){
  delete[] data;
  delete[] rowSize;
  delete[] rowPtrs;
}

//////////////////////////////////////////////////////////////////////
// Compute transpose of sparse matrix
//////////////////////////////////////////////////////////////////////

SparseMatrix *SparseMatrix::ComputeTranspose() const {
  SparseMatrix *sm = new SparseMatrix();
  ASSERT (sm, "Out of memory.");
  
  // fill in basic information

  sm->threshold = threshold;
  sm->missing = missing;
  sm->layers = layers;
  sm->rows = cols;
  sm->cols = rows;
  sm->numEntries = numEntries;
  
  // allocate memory

  sm->data = new SparseMatrixEntry[sm->numEntries];
  ASSERT (sm->data, "Out of memory.");

  sm->rowSize = new int[sm->layers * sm->rows];
  ASSERT (sm->rowSize, "Out of memory.");

  sm->rowPtrs = new SparseMatrixEntryPtr[sm->layers * sm->rows];
  ASSERT (sm->rowPtrs, "Out of memory.");

  // compute row sizes
  
  SparseMatrixEntry *dataPtr = data;
  
  for (int k = 0; k < layers; k++){
    for (int j = 0; j < sm->rows; j++)
      sm->rowSize[k * sm->rows + j] = 0;
    
    for (int i = 0; i < rows; i++)
      for (int j = 0; j < rowSize[k * rows + i]; j++)
	sm->rowSize[k * sm->rows + (dataPtr++)->column]++;
  }

  // compute pointers to beginning of each row

  sm->rowPtrs[0] = sm->data;
  for (int i = 1; i < sm->layers * sm->rows; i++)
    sm->rowPtrs[i] = sm->rowPtrs[i-1] + sm->rowSize[i-1];

  // initialize pointers for writing data to new sparse matrix

  SparseMatrixEntry **writePtrs = new SparseMatrixEntryPtr[sm->layers * sm->rows];
  ASSERT (writePtrs, "Out of memory.");
  {for (int i = 0; i < sm->layers * sm->rows; i++)
	  writePtrs[i] = sm->rowPtrs[i];}

  // now find transpose of data
  
  dataPtr = data;
  
  {for (int k = 0; k < layers; k++){
    for (int i = 0; i < rows; i++){
      for (int j = 0; j < rowSize[k * rows + i]; j++){
	writePtrs[k * sm->rows + dataPtr->column]->column = i;
	writePtrs[k * sm->rows + dataPtr->column]->value = dataPtr->value;
	++writePtrs[k * sm->rows + dataPtr->column];
	++dataPtr;
      }
    }
  }}
  
  delete[] writePtrs;
  
  return sm;
}

//////////////////////////////////////////////////////////////////////
// Printing utility function
//////////////////////////////////////////////////////////////////////

void SparseMatrix::PrintVal (FILE *file, const float &value) const {
  if (value == LOG_ZERO_FLOAT)
    fprintf (file, " -inf");
  else
    fprintf (file, "%5.2f", value);
}

//////////////////////////////////////////////////////////////////////
// Print a single matrix layer
//////////////////////////////////////////////////////////////////////

void SparseMatrix::PrintLayer (FILE *file, int layer) const {
  for (int i = 0; i < rows; i++){
    fprintf (file, "%s[", (i == 0 ? "[" : " "));
    for (int j = 0; j < rowSize[layer * rows + i]; j++){
      if (j > 0) fprintf (file, ", ");
      fprintf (file, "(%2d,", rowPtrs[layer * rows + i][j].column);
      PrintVal (file, rowPtrs[layer * rows + i][j].value);
      fprintf (file, ")");
    }
    fprintf (file, "]%s\n", (i == rows-1 ? "]" : ""));
  }
  fprintf (file, "\n");
}

//////////////////////////////////////////////////////////////////////
// Print all matrix layers
//////////////////////////////////////////////////////////////////////

void SparseMatrix::Print (FILE *file) const {
  for (int i = 0; i < layers; i++)
    PrintLayer (file, i);
}

//////////////////////////////////////////////////////////////////////
// Return pointer to row
//////////////////////////////////////////////////////////////////////

const SparseMatrix::SparseMatrixEntry *SparseMatrix::GetRowPtr (int layer, int row) const {
  ASSERT (0 <= layer && layer < layers, "Requested layer out-of-bounds.");
  ASSERT (0 <= row && row < rows, "Requested row out-of-bounds.");
  return rowPtrs[layer * rows + row];
}

//////////////////////////////////////////////////////////////////////
// Return size of row
//////////////////////////////////////////////////////////////////////

const int SparseMatrix::GetRowSize (int layer, int row) const {
  ASSERT (0 <= layer && layer < layers, "Requested layer out-of-bounds.");
  ASSERT (0 <= row && row < rows, "Requested row out-of-bounds.");
  return rowSize[layer * rows + row];
}

//////////////////////////////////////////////////////////////////////
// Return number of matrix layers
//////////////////////////////////////////////////////////////////////

const int SparseMatrix::GetNumLayers() const {
  return layers;
}

//////////////////////////////////////////////////////////////////////
// Return number of matrix rows
//////////////////////////////////////////////////////////////////////

const int SparseMatrix::GetNumRows() const {
  return rows;
}

//////////////////////////////////////////////////////////////////////
// Return number of matrix columns
//////////////////////////////////////////////////////////////////////

const int SparseMatrix::GetNumCols() const {
  return cols;
}

//////////////////////////////////////////////////////////////////////
// Access matrix element (const version)
//////////////////////////////////////////////////////////////////////

const float &SparseMatrix::operator() (int layer, int row, int col) const {
  ASSERT (0 <= layer && layer < layers, "Requested layer out-of-bounds.");
  ASSERT (0 <= row && row < rows, "Requested row out-of-bounds.");
  ASSERT (0 <= col && col < cols, "Requested column out-of-bounds.");
  for (int i = 0; i < rowSize[layer * rows + row]; i++)
    if (rowPtrs[layer * rows + row][i].column == col)
      return rowPtrs[layer * rows + row][i].value;
  return missing;
}