관리 메뉴

프로그램 소스

STL list 흉내내서 만들기 [C++] 본문

C++/디딤돌 자료구조와 알고리즘 with C++

STL list 흉내내서 만들기 [C++]

Only 프로그램 소스 언제나휴일 2016.06.11 16:40

STL list 흉내내서 만들기 [C++]


리스트 만들기.zip





"본문 내용"은 언제나 휴일 본 사이트에 있습니다.


//list.h

#pragma once

namespace ehlib

{

    template<typename Data>

    class list

    {       

        struct node

        {

            Data data;

            node *prev;

            node *next;

            node(Data data=0)

            {

                this->data = data;

                prev = next = 0;

            }

        };

        node *head;

        node *tail;

        int count;

    public:

        class iterator

        {    

            node *now;

        public:

            iterator(node *now=0)

            {         

                this->now = now;

            }

            Data operator *()const

            {

                 return now->data;

            }

            operator node *()

            {

                return now;

            }

            iterator &operator++()

            {

                now = now->next;

                return (*this);

            }

            const iterator operator++(int)

            {

                iterator re(*this);

                now = now->next;

                return re;

            }

            bool operator !=(const iterator &iter)const

            {  

                return now != iter.now;

            }

            bool operator ==(const iterator &iter)const

            {

                return now == iter.now;

            }

        };

        typedef iterator const_iterator;

        list()

        {

            head = new node();

            tail = new node();

            head->next = tail;

            tail->prev = head;

            count = 0;

        }

        ~list()

        {

            node *prev=0;

            while(head !=0)

            {

                prev = head;

                head = head->next;

                delete prev;

            }

        }       

        void push_back(Data data)

        {

            insert(end(),data);

        }

        void insert(iterator at, Data data)

        {

            node *now = new node(data);

            node *pos = at;

            now->next = pos;

            now->prev = pos->prev;

            pos->prev->next = now;

            pos->prev = now;

            count++;

        }

        void erase(iterator at)

        {

            node *now = at;

            now->prev->next = now->next;

            now->next->prev = now->prev;

            delete now;

            count--;

        }       

        iterator begin()

        {

            iterator iter(head->next);

            return iter;

        }

        iterator end()

        {           

            iterator iter(tail);

            return iter;

        }

        const_iterator begin()const

        {

            iterator iter(head->next);

            return iter;

        }

        const_iterator end()const

        {           

            iterator iter(tail);

            return iter;

        }

        size_t size()

        {

            return count;

        }

    };

}



//algorithm.h

#pragma once

namespace ehlib

{

    template <typename Iter,typename Fun>

    Iter find_if(Iter beg,Iter end,Fun fun)

    {    

        for(  ;beg != end ; ++beg)

        {

            if(fun(*beg))

            {

                break;

            }

        }

        return beg;

    } 

}



프로그래밍 언어 및 기술 학습, 무료 동영상 강의 언제나 휴일

0 Comments
댓글쓰기 폼