簡體   English   中英

C ++模板類迭代器錯誤

[英]C++ template class iterator error

使用模板類,我試圖基於鏈接列表為自定義容器實現迭代器類。 我試圖遍歷鏈接列表中的節點。

我的主要代碼是:

#include "Smaph.h"
#include <iostream>
#include <string>
using namespace std;

int main() {
Smaph<string, int> x1;
x1.insert("john", 3);
x1.insert("alex", 5);
cout << "Size is " << x1.size() << endl;
Smaph<string, int>::iterator it;
for (it=x1.begin(); it!=x1.end(); ++it)
    cout << *it << endl;
}

在執行for循環語句並調用x1.begin()時發生錯誤

錯誤在於轉換頭指針:

could not convert
((const Smaph<std:basic_string<char>, int>*)this)->
    Smaph<std::basic_string<char>, int>::head
from
    Smaph<std::basic_string<char>, int>::node* const
to
    Smaph<std::basic_string<char>, int>::iterator
    aka sl_iterator<std::basic_string<char>, int>

以下是我的單個Smaph.h文件

template <typename T1, typename T2> class sl_iterator;

template <typename T1, typename T2>
class Smaph
{
public:
    typedef T1 key_type;
    typedef T2 mapped_type;
    typedef unsigned int size_type;
    typedef sl_iterator<T1, T2> iterator;

friend class sl_iterator<T1, T2>;

struct node {
    T1 datum1;
    T2 datum2;
    struct node *next;
};
node *head, *tail;
Smaph() : head(0), tail(0)  { }
~Smaph() { clear(); }

bool insert(const key_type &first, const mapped_type &second) {
    node *p = new node;
    p->datum1 = first;
    p->datum2 = second;
    p->next = 0;
    if (!tail)              // empty list?
        head = p;
    else
        tail->next = p;
    tail = p;
    return (1);     // return true for now
}

size_type size() const {
    int count=0;
    for (node *p = head; p; p=p->next)
        count++;
    return count;
}

void clear() {
    while (head) {
        node *p = head->next;
        delete head;
        head = p;
        }
}

bool empty() const {
    return !head;
}

iterator begin() const {
    return head;
}

iterator end() const {
    return 0;
}
};

template <typename T1, typename T2>
class sl_iterator {
public:
    typedef T1 key_type;
    typedef T2 mapped_type;
    typedef unsigned int size_type;

    struct node {
        T1 datum1;
        T2 datum2;
        struct node *next;
    };

//private:
    node *p;
    // This private ctor is for the container class only:
    sl_iterator(node *ptr) : p(ptr) { }
public:
    sl_iterator() : p(0) { }
    sl_iterator &operator++() {        // Preincrement
        p = p->next;
        return *this;
    }
    sl_iterator operator++(int) {      // Postincrement
        const sl_iterator tmp = *this;
        ++*this;
        return tmp;
    }

    // *sl_iterator: Return a reference to the datum
    T1 &operator*() const {
        return p->datum1;
    }
    // sl_iterator->: Return the address of the datum
    T1 *operator->() const {
        return &p->datum1;
    }

    bool operator==(const sl_iterator &rhs) const {
        return p==rhs.p;
    }
    bool operator!=(const sl_iterator &rhs) const {
        return !(*this == rhs);
    }
}; // end class 

看來您希望嵌套類sl_iterator<T1, T2>::nodeSmaph<T1, T2>::node被編譯器視為同一類。 即使它們的定義相同,事實並非如此。

您可能需要更改sl_iterator的定義,以便它不包含更多的node定義,而是引用Smaph::node

template <typename T1, typename T2>
class sl_iterator {
// ...
    typename Smaph<T1, T2>::node *p;
    sl_iterator(typename Smaph<T1, T2>::node *ptr) : p(ptr) { }

// ...
};

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM