private-public members:S

[tunayan]

when i try this code it gives several errors:S i did all of declarations in public but again i take these errors; i did public to node but i didnt work

Error	2	error C2248: 'SimSpace<T>::node' : cannot access private member declared in class 'SimSpace<T>
Error	3	error C2248: 'SimNode<T>::link' : cannot access private member declared in class 'SimNode<T>'
Warning	1	warning C4101: 'x' : unreferenced local variable

#include<iostream>

using namespace std;

template<class T>
class SimSpace;

template<class T>
class SimNode
{
	friend SimSpace<T>;
private:
	T data;
	int link;
};

template<class T>
class SimSpace
{

public:
	SimSpace(int MaxSpaceSize=100);
	~SimSpace(){delete[]node;}
	int Allocate();
	void Deallocate(int& i);
private:
	int NumberOfNodes;
	int first;
	SimNode<T> *node;
};

template <class T>
SimSpace<T>::SimSpace(int MaxSpaceSize)
{
	NumberOfNodes = MaxSpaceSize;
	node = new SimNode<T> [NumberOfNodes];
	for(int i=0; i<NumberOfNOdes-1; i++)
		node[i].link = i+1;
	node[NumberOfNodes-1].link = -1;
	first = 0;
}

template<class T>
int SimSpace<T>::Allocate()
{
	if(first == -1) throw NoMem();
	int i= first;
	first = node[i].link;
	return i;
}


template<class T>
void SimSpace<T>:: Deallocate(int& i)
{
	node[i].link = first;
	first = i;
	i= -1;
}
////////////////////////////////////////////////////////////////////////////////
template<class T>
class SimChain 
{
public:
	SimChain(){first= -1;}
	~SimChain(){Destroy();}
	void Destroy();
	int Length()const;
	bool Find(int k, T& x)const;
	int Search(const T& x)const;
	SimChain<T>& Delete(int k, T& x);
	SimChain<T>& Insert(int k,const T& x);
	void Output(ostream& out)const;
private:
	int first;
	static SimSpace<T> S;
};

template<class T>
void SimChain<T>::Destroy()
{
	int next;
	while(first!=-1)
	{
		next = S.node[first].link;
		S.Deallocate(first);
		first = next;
	}
}

template<class T>
int SimChain<T>::Length()const
{
	int current = first;
	int len =0;
	while(current!= -1)
	{
		current = S.node[current].link;
		len++;
	}
	return len;
}

template <class T>
bool SimChain<T>::Find(int k,T& x)const
{
	if(k<1) return false;
	int current= first;
	int index= 1;
	while(index<k && current!= -1)
	{
		current= S.node[current].link;
		index++;
	}
	if(current!=-1)
	{
		x = S.node[current].data;
		return true;
	}
	return false;
}

template<class T>
SimChain<T>& SimChain<T>::Delete(int k,T& x)
{
	if(k<1 || first == -1)
		throw OutOfBounds();
int p = first;

if(k==1)
	first = S.node[first].link;
else
{
	int q=first;
	for(int index=1 ; index< k-1 && q!=-1;index++)
		q= S.node[q].link;
	if(q== -1 ||S.node[q].link == -1 )
		throw OutOfBounds();
	p= S.node[q].link;

	S.node[q].link = S.node[p].link;
}

x= S.node[p].data;
S.Deallocate(p);
return *this;
}

template<class T>
SimChain<T>& SimChain<T>::Insert(int k,const T& x)
{
	if(k<0) throw OutOfBounds();
	int p = first;
	for(int index=1; index < k && p!= -1 ; index++)
		p= S.node[p].link;

	if(k>0 && p==-1)
		throw OutOfBounds();
	int y = S.Allocate();
	S.node[y].data = x;

	if(k)
	{
		S.node[y].link = S.node[p].link;
		S.node[p].link = y;
	}
	else
	{
		S.node[y].link = first;
		first = y;
	}
	return *this;
}

////////////////////////////////////////////////
void main(void)
{
	int x;
	SimChain<int> c;

}