001/*
002 * This file is part of McIDAS-V
003 *
004 * Copyright 2007-2023
005 * Space Science and Engineering Center (SSEC)
006 * University of Wisconsin - Madison
007 * 1225 W. Dayton Street, Madison, WI 53706, USA
008 * https://www.ssec.wisc.edu/mcidas
009 * 
010 * All Rights Reserved
011 * 
012 * McIDAS-V is built on Unidata's IDV and SSEC's VisAD libraries, and
013 * some McIDAS-V source code is based on IDV and VisAD source code.  
014 * 
015 * McIDAS-V is free software; you can redistribute it and/or modify
016 * it under the terms of the GNU Lesser Public License as published by
017 * the Free Software Foundation; either version 3 of the License, or
018 * (at your option) any later version.
019 * 
020 * McIDAS-V is distributed in the hope that it will be useful,
021 * but WITHOUT ANY WARRANTY; without even the implied warranty of
022 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
023 * GNU Lesser Public License for more details.
024 * 
025 * You should have received a copy of the GNU Lesser Public License
026 * along with this program.  If not, see http://www.gnu.org/licenses.
027 */
028
029package edu.wisc.ssec.mcidasv.data.hydra;
030
031public class Subset {
032
033  private int[] start = null;
034  private int[] count = null;
035  private int[] stride = null;
036  private int rank;
037
038  public Subset(int rank) {
039    this.rank = rank;
040    start = new int[rank];
041    count = new int[rank];
042    stride = new int[rank];
043
044    for (int t=0; t<rank; t++) {
045      start[t] = -1;
046      count[t] = -1;
047      stride[t] = -1;
048    }
049  }
050
051  public int[] getStart() {
052    return start;
053  }
054
055  public int[] getCount() {
056    return count;
057  }
058
059  public int[] getStride() {
060    return stride;
061  }
062
063  public int getRank() {
064    return rank;
065  }
066
067}