[Quantproject-developers] QuantProject/b1_ADT/Collections IntArrayManager.cs, NONE, 1.1

[Glauco S. <gla...@us...>]

Update of /cvsroot/quantproject/QuantProject/b1_ADT/Collections
In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv10124/b1_ADT/Collections

Added Files:
	IntArrayManager.cs 
Log Message:
This class provides methods to manage arrays of int

--- NEW FILE: IntArrayManager.cs ---
/*
QuantProject - Quantitative Finance Library

IntArrayManager.cs
Copyright (C) 2006
Glauco Siliprandi

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*/

using System;

namespace QuantProject.ADT.Collections
{
	/// <summary>
	/// This class provides methods to manage arrays of int
	/// </summary>
	public class IntArrayManager
	{
		public IntArrayManager()
		{
			//
			// TODO: Add constructor logic here
			//
		}

		#region SubArray
		private static void subArray_checkParameters( int[] arrayOfInt ,
			int firstPosition ,	int numberOfElementsToBeSelected )
		{
			if ( firstPosition < 0 )
				throw new Exception( "firstPosition is less than zero!" );
			if ( firstPosition >= arrayOfInt.Length )
				throw new Exception( "firstPosition is >= than arrayOfInt.Length!" );
			if ( numberOfElementsToBeSelected < 0 )
				throw new Exception(
					"numberOfElementsToBeSelected is less than zero!" );
			if ( firstPosition + numberOfElementsToBeSelected > arrayOfInt.Length )
				throw new Exception(
					"firstPosition + numberOfElementsToBeSelected is >= arrayOfInt.Length !!" );
		}

		/// <summary>
		/// Returns a subarray of arrayOfInt
		/// </summary>
		/// <param name="arrayOfInt"></param>
		/// <param name="firstPosition"></param>
		/// <param name="numberOfElementsToBeSelected"></param>
		/// <returns></returns>
		public static int[] SubArray( int[] arrayOfInt , int firstPosition ,
			int numberOfElementsToBeSelected )
		{
			subArray_checkParameters( arrayOfInt , firstPosition ,
				numberOfElementsToBeSelected );
			int[] subArray = new int[ numberOfElementsToBeSelected ];
			for ( int i = 0 ; i < numberOfElementsToBeSelected ; i++ )
			{
				int currentPosition = firstPosition + i;
				subArray[ i ] =	arrayOfInt[ currentPosition ];
			}
			return arrayOfInt;
		}
		#endregion SubArray

	}
}