Sub Array : Array SubArray « Collections Data Structure « Java






Sub Array

      
/*
 * @(#)SubArray.java  1.0 Mar 7, 2008
 *
 *  The MIT License
 *
 *  Copyright (c) 2008 Malachi de AElfweald <malachid@gmail.com>
 *
 *  Permission is hereby granted, free of charge, to any person obtaining a copy
 *  of this software and associated documentation files (the "Software"), to deal
 *  in the Software without restriction, including without limitation the rights
 *  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 *  copies of the Software, and to permit persons to whom the Software is
 *  furnished to do so, subject to the following conditions:
 *
 *  The above copyright notice and this permission notice shall be included in
 *  all copies or substantial portions of the Software.
 *
 *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 *  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 *  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 *  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 *  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 *  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 *  THE SOFTWARE.
 */
//package org.eoti.util;

import java.util.Iterator;

public class SubArray<T> implements Iterable<T>, Iterator<T> {
  protected T[] arr;
  protected int startInclusive;
  protected int endInclusive;
  protected int currentPos;

  public SubArray(int startInclusive, int endInclusive, SubArray<T> arr) {
    this(startInclusive, endInclusive, arr.arr);
  }

  public SubArray(int startInclusive, SubArray<T> arr) {
    this(startInclusive, arr.arr);
  }

  public SubArray(int startInclusive, int endInclusive, T... arr) {
    this.startInclusive = startInclusive;
    this.endInclusive = endInclusive;
    this.arr = arr;
    this.currentPos = startInclusive;
  }

  public SubArray(int startInclusive, T... arr) {
    this(startInclusive, arr.length - 1, arr);
  }

  public int size() {
    return arr.length;
  }

  public Iterator<T> iterator() {
    return this;
  }

  public boolean hasNext() {
    return (currentPos <= endInclusive);
  }

  public T next() {
    return arr[currentPos++];
  }

  public void remove() {
    throw new UnsupportedOperationException();
  }
}

   
    
    
    
    
    
  








Related examples in the same category

1.Gets the subarray from array that starts at offset.
2.Gets the subarray of length length from array that starts at offset.
3.Puts the entire source array in the target array at offset offset.
4.Copies bytes from the source byte array to the destination array
5.Exclude 2 arrays of ints
6.This program demonstrates a triangular array.This program demonstrates a triangular array.
7.This program shows how to store tabular data in a 2D array.
8.Reverse an Array
9.Returns a new array containing all of a, with additional extra space added (zero initialized).