/*
	A C++ template for N-dimensional, contiguous, dynamically allocated arrays

	-----------------------------------------------------------------------------

	Copyright (C) 2007, Johannes Sebastian Mueller-Roemer,
	All rights reserved.                          

	Redistribution and use in source and binary forms, with or without
	modification, are permitted provided that the following conditions
	are met:

		1. Redistributions of source code must retain the above copyright
		notice, this list of conditions and the following disclaimer.

		2. Redistributions in binary form must reproduce the above copyright
		notice, this list of conditions and the following disclaimer in the
		documentation and/or other materials provided with the distribution.

		3. The names of its contributors may not be used to endorse or promote 
		products derived from this software without specific prior written 
		permission.

	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
	"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
	LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
	A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
	CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
	LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
	NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
	SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

	-----------------------------------------------------------------------------

	Usage example:

	// Create a 4-dimensional array with dimension sizes of 10,4,4,3
	// You must provide the correct number of sizes!
	arrayNd<int,4> array(10,4,4,3);

	// Usage is similar to Java arrays
	for(int i = 0; i< array.length(); i++)
		for(int j = 0; j < array.length(); j++)
			for(int k = 0; k < array[j].length(); k++)
				for(int l = 0; l < array[j][k].length(); l++)
				{
					ndarray2[j][k][l] = 1000*i+100*j+10*k+l;
				}

	BUGS/TODO List:
		*	Minimum N is currently 3, as the specializations
			crash when calling new (Reason unknown to me,
			this happens with MSVC 7.1, I have yet to check
			other compilers)
		*	Add operator and selectors for const arrays
		*	Maybe, just maybe, make it conform to the STL
			containers, so that container algorithms can
			be used (requires resizeability though IIRC)

	Feedback is welcome,
	send your comments, suggestions or enhancements to the code to:
	j (dot) s (dot) mueller (hyphen) roemer (at) gmx (dot) net
	(sorry for the "obfuscation", I'm a little paranoid about spambots)

	Version history:
		*	Version 0.1
			The very first version, which is what you are look at right now
			Written and released 03/21/2007
*/

#ifndef JSMR_ARRAYND_H
#define JSMR_ARRAYND_H

#include <cassert>
#include <cstdarg>

template<class T, int N> struct arrayNd
{
	arrayNd() {assert(0);}
	arrayNd(int first,...)
	{
		int itemCount = first;
		dim[0] = first;
		va_list vl;
		va_start(vl,first);
		for(int i = 1; i < N; i++)
		{
			dim = va_arg(vl,int);
			itemCount *= dim;
		}
		va_end(vl);
		data = new T[itemCount];
	}
	arrayNd(const arrayNd<T,N>& o)
	{
		int itemCount = o.dim[0];
		dim[0] = o.dim[0];
		for(int i = 1; i < N; i++)
		{
			dim = dimensions;
			itemCount *= dimensions;
		}
		data = new T[itemCount];
		for(int i = 0; i < itemCount; i++)
		{
			data = o.data;
		}
	}
	~arrayNd() { delete[] data; }

	template<int A, int B> struct selector
	{
		friend selector<A+1,B-1>;

		int length() const {return dimPtr;}

		selector<A-1,B+1> operator[] (int i)
		{
			assert(i>=0&&i<dimPtr);
			return selector<A-1,B+1>(data,dimPtr,i+offset*dimPtr);
		}

	private:
		selector() {assert(0);}
		selector(T* d,int* dim,int o) {data=d;offset=o;dimPtr=dim;}
		T* data;
		int* dimPtr;
		int offset;
	};

	template<> struct selector<N-1,1>
	{
		friend arrayNd<T,N>;

		int length() const {return dimPtr[1];}

		selector<N-2,2> operator[] (int i)
		{
			assert(i>=0&&i<dimPtr[1]);
			return selector<N-2,2>(data,dimPtr,i+offset*dimPtr[1]);
		}

	private:
		selector() {assert(0);}
		selector(T* d,int* dim,int o) {data=d;offset=o;dimPtr=dim;}
		T* data;
		int* dimPtr;
		int offset;
	};

	template<> struct selector<1,N-1>
	{
		friend selector<2,N-2>;

		int length() const {return dimPtr[N-1];}

		T& operator[] (int i)
		{
			assert(i>=0&&i<dimPtr[N-1]);
			return data[i+offset*dimPtr[N-1]];
		}

	private:
		selector() {assert(0);}
		selector(T* d,int* dim,int o) {data=d;offset=o;dimPtr=dim;}
		T* data;
		int* dimPtr;
		int offset;
	};

	selector<N-1,1> operator[] (int i)
	{
		assert(i>=0&&i<dim[0]);
		return selector<N-1,1>(data,dim,i);
	}

	int length() const { return dim[0]; }

private:
	T* data;
	int dim[N];
};

template<class T> struct arrayNd<T,2>
{
	arrayNd() {assert(0);}
	arrayNd(int x, int y)
	{
		dim[0] = x;
		dim[1] = y;
		data = new T[x*y];
	}
	arrayNd(const arrayNd<T,2>& o)
	{
		int itemCount = o.dim[0]*o.dim[1];
		dim[0] = o.dim[0];
		dim[1] = o.dim[1];
		data = new T[itemCount];
		for(int i = 0; i < itemCount; i++)
		{
			data = o.data;
		}
	}
	~arrayNd() { delete[] data; }

	struct selector
	{
		friend arrayNd<T,2>;

		int length() {return len;}

		T& operator[] (int i)
		{
			assert(i>=0&&i<len);
			return data[i+offset];
		}

	private:
		selector() {assert(0);}
		selector(T* d,int l,int o) {data=d;offset=o;len=l;}
		T* data;
		int len;
		int offset;
	};

	selector operator[] (int i)
	{
		assert(i>=0&&i<dim[0]);
		return selector(data,dim[1],i*dim[0]);
	}

	int length() const { return dim[0]; }

private:
	T* data;
	int dim[2];
};

template<class T> struct arrayNd<T,1>
{
	arrayNd() {assert(0);}
	arrayNd(int x)
	{
		len = x;
		data = new T[x];
	}
	arrayNd(const arrayNd<T,1>& o)
	{
		len = o.len;
		data = new T[o.len];
		for(int i = 0; i < o.len; i++)
		{
			data = o.data;
		}
	}
	~arrayNd() { delete[] data; }

	T& operator[] (int i)
	{
		assert(i>=0&&i<len);
		return data;
	}

	int length() const { return len; }

private:
	T* data;
	int len;
};

#endif

#include <iostream>#include "arraynd.h"int main{    arrayNd<int,2> ndarray(5,5);    for(int i = 0; i < ndarray.length(); i++)        for(int j = 0; j < ndarray.length(); j++)            ndarray[j] = 10*i+j;    for(int i = 0; i < ndarray.length(); i++)        for(int j = 0; j < ndarray.length(); j++)            std::cout << ndarray[j] << std::endl;    return 0;}

#include <cassert>#include <cstdarg>

#include <cassert>#include <cstdarg>