Multidimensional linked lists


template<class A> class Death_Star;
template<class A> class Death_Star {
private:
Death_Star<A>* Up;
Death_Star<A>* Down;
Death_Star<A>* Right;
Death_Star<A>* Left;
Death_Star<A>* Forward;
Death_Star<A>* Backward;
Death_Star<A>* Forward_In_Time;
Death_Star<A>* Backward_In_Time;
public:
A value;
Death_Star();
~Death_Star();
A operator [] (unsigned int, unsigned int, unsigned int, unsigned int);
};

Not that sepples again


A operator [] (unsigned int, unsigned int, unsigned int, unsigned int);
wtf? what language is this!?!? is this D or something?
also since you have 8 directions you should consider a 0,0,0,0 point and int,int,int,int

indexing operators are not really linked list cool anyway
also why not declaring
A operator[]() const;
A& operator[]();

fuck, OP can't into sepples, IHBTrolled

A multi-dimensional linked-list is just a tree.

Dipshit.

>>4
specifically, they are n-ary trees where n is the number of dimensions.

regular linked lists are binary trees, for instance.

>>4
regular linked lists are binary trees, for instance.

worst unbalanced tree ever.

>>6

yes

>>5

no

>>4

no

>>3

yes

>>2

yes

>>1

yes