Examples of ColMajorCell

Examples of com.matrix.ColMajorCell

178
179
180
181
182
183
184
185
   public ColMajorCell get(int index)
   {
      if ( (index>this.size()) || (index<0) )
         throw new NoSuchElementException();
      else
         return new ColMajorCell(((Integer)tsIindexes.get(index)).intValue(),
                                 ((Integer)tsJindexes.get(index)).intValue());
   }
View Full Code Here

Examples of com.matrix.ColMajorCell

32
33
34
35
36
37
38
39
40
41
42
43
44
      // For each part of the low-resolution warp path, project that path to the higher resolution by filling in the
      //    path's corresponding cells at the higher resolution.
      for (int w=0; w<shrunkWarpPath.size(); w++)
      {
         final ColMajorCell currentCell = shrunkWarpPath.get(w);
         final int warpedI = currentCell.getCol();
         final int warpedJ = currentCell.getRow();

         final int blockISize = shrunkI.aggregatePtSize(warpedI);
         final int blockJSize = shrunkJ.aggregatePtSize(warpedJ);

         // If the path moved up or diagonally, then the next cell's values on the J axis will be larger.
View Full Code Here

Examples of com.matrix.ColMajorCell

239
240
241
242
243
244
245
246
247
248
249
250
251
      //    (first to last row (1..maxI), bottom to top (1..MaxJ)
      final Iterator matrixIterator = window.iterator();

      while (matrixIterator.hasNext())
      {
         final ColMajorCell currentCell = (ColMajorCell)matrixIterator.next();  // current cell being filled
         final int i = currentCell.getCol();
         final int j = currentCell.getRow();

         if ( (i==0) && (j==0) )      // bottom left cell (first row AND first column)
            costMatrix.put(i, j, distFn.calcDistance(tsI.getMeasurementVector(0), tsJ.getMeasurementVector(0)));
         else if (i == 0)             // first column
         {
View Full Code Here

Examples of com.matrix.ColMajorCell

305
306
307
308
309
310
311
312
313
314
315
316
317
      //    (first to last row (1..maxI), bottom to top (1..MaxJ)
      final Iterator matrixIterator = window.iterator();

      while (matrixIterator.hasNext())
      {
         final ColMajorCell currentCell = (ColMajorCell)matrixIterator.next();  // current cell being filled
         final int i = currentCell.getCol();
         final int j = currentCell.getRow();

         if ( (i==0) && (j==0) )      // bottom left cell (first row AND first column)
            costMatrix.put(i, j, distFn.calcDistance(tsI.getMeasurementVector(0), tsJ.getMeasurementVector(0)));
         else if (i == 0)             // first column
         {
View Full Code Here

Examples of com.matrix.ColMajorCell

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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
            windowCells.add(cellIter.next());


         for (int cell=0; cell<windowCells.size(); cell++)
         {
            final ColMajorCell currentCell = (ColMajorCell)windowCells.get(cell);

            if ( (currentCell.getCol() != minI()) && (currentCell.getRow() != maxJ()) )// move to upper left if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()-radius;
               final int targetRow = currentCell.getRow()+radius;

               if ( (targetCol>=minI()) && (targetRow<=maxJ()))
                  markVisited(targetCol, targetRow);
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = Math.max(minI()-targetCol, targetRow-maxJ());
                  markVisited(targetCol+cellsPastEdge, targetRow-cellsPastEdge);
               }  // end if
            }  // end if

            if (currentCell.getRow() != maxJ())  // move up if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol();
               final int targetRow = currentCell.getRow()+radius;

               if (targetRow <= maxJ())
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = targetRow-maxJ();
                  markVisited(targetCol, targetRow-cellsPastEdge);
               }  // end if
            }  // end if

            if ((currentCell.getCol() != maxI()) && (currentCell.getRow() != maxJ())) // move to upper-right if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()+radius;
               final int targetRow = currentCell.getRow()+radius;

               if ( (targetCol<=maxI()) && (targetRow<=maxJ()))
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = Math.max(targetCol-maxI(), targetRow-maxJ());
                  markVisited(targetCol-cellsPastEdge, targetRow-cellsPastEdge);
               }  // end if
            }  // end if

            if (currentCell.getCol() != minI())  // move left if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()-radius;
               final int targetRow = currentCell.getRow();

               if (targetCol >= minI())
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = minI()-targetCol;
                  markVisited(targetCol+cellsPastEdge, targetRow);
               }  // end if
            }  // end if

            if (currentCell.getCol() != maxI())  // move right if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()+radius;
               final int targetRow = currentCell.getRow();

               if (targetCol <= maxI())
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = targetCol-maxI();
                  markVisited(targetCol-cellsPastEdge, targetRow);
               }  // end if
            }  // end if

            if ( (currentCell.getCol() != minI()) && (currentCell.getRow() != minJ()) )  // move to lower-left if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()-radius;
               final int targetRow = currentCell.getRow()-radius;

               if ( (targetCol>=minI()) && (targetRow>=minJ()))
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = Math.max(minI()-targetCol, minJ()-targetRow);
                  markVisited(targetCol+cellsPastEdge, targetRow+cellsPastEdge);
               }  // end if
            }  // end if

            if (currentCell.getRow() != minJ())  // move down if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol();
               final int targetRow = currentCell.getRow()-radius;

               if (targetRow >= minJ())
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
                  // Expand the window only to the edge of the matrix.
                  final int cellsPastEdge = minJ()-targetRow;
                  markVisited(targetCol, targetRow+cellsPastEdge);
               }  // end if
            }  // end if

            if ((currentCell.getCol() != maxI()) && (currentCell.getRow() != minJ()))  // move to lower-right if possible
            {
               // Either extend full search radius or some fraction until edges of matrix are met.
               final int targetCol = currentCell.getCol()+radius;
               final int targetRow = currentCell.getRow()-radius;

               if ( (targetCol<=maxI()) && (targetRow>=minJ()))
                  markVisited(targetCol, targetRow);  // radius does not go past the edges of the matrix
               else
               {
View Full Code Here

Examples of com.matrix.ColMajorCell

347
348
349
350
351
352
353
354
355
356
357
            throw new ConcurrentModificationException();
         else if (!hasMoreElements)
            throw new NoSuchElementException();
         else
         {
            final ColMajorCell cell = new ColMajorCell(currentI, currentJ);
            if (++currentJ > window.maxJforI(currentI))
            {
               if (++currentI <= window.maxI())
                  currentJ = window.minJforI(currentI);
               else
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.