Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "InnaL.h"
- template <class T>
- class Lista
- {
- InnaL<T>* p;
- InnaL<T>* k;
- int d;
- public:
- Lista<T>(T* = nullptr);
- void DodajNaKoncu(T*);
- };
- ////Lista.cpp
- template <class T>
- Lista<T>::Lista(T *o)
- {
- if(o == nullptr)
- {
- this->p = nullptr;
- this->k = nullptr;
- d = 0;
- }
- else
- {
- this->p = new InnaL<T>(nullptr,o,nullptr);
- this->k = this->o;
- d = 1;
- }
- }
- template <class T>
- void Lista<T>::DodajNaKoncu(T* nK)
- {
- InnaL<T>* sK = k;
- sK->UNL(new InnaL<T>(sK,nK,nullptr));
- k = sK->PNL();
- d++;
- }
- ///InnaL.h
- template <class T>
- class InnaL
- {
- InnaL<T>* p;
- InnaL<T>* n;
- T* w;
- public:
- InnaL<T>(InnaL* = nullptr,T* = nullptr,InnaL* = nullptr);
- void UPL(InnaL*);
- void UNL(InnaL*);
- void UA(T*);
- T* PA();
- InnaL<T>* PPL();
- InnaL<T>* PNL();
- };
- ////InnaL.cpp
- #include "../include/InnaL.h"
- template <class T>
- InnaL<T>::InnaL(InnaL* po,T* w ,PrLista* na)
- {
- this->p = po;
- this->w = w;
- this->n = na;
- }
- template <class T>
- void InnaL<T>::UPL(InnaL<T>* po)
- {
- p = po;
- }
- template <class T>
- void InnaL<T>::UNL(InnaL<T>* na)
- {
- nastepny = na;
- }
- template <class T>
- void InnaL<T>::UstawAktualny(T* w)
- {
- this->w = w;
- }
- template <class T>
- T* InnaL<T>::PA()
- {
- return w;
- }
- template <class T>
- InnaL<T>* InnaL<T>::PPL()
- {
- return p;
- }
- template <class T>
- InnaL<T>* InnaL<T>::PNL()
- {
- return n;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement