Question

对于我正在工作的项目，我创建了一个封装数据结构的C ++库。对于每个数据结构，我都创建了自定义迭代器来优雅地导航数据。一切顺利，直到我在这些类上尝试模板专业化，当我偶然发现这个构建错误时： 错误：无效使用不完整类型。

我已经在这上面撞了一个多星期了，发现网上没有任何帮助，所以我想也许你们中的一些人可以帮我这个......

简化了整个问题：

template<typename T>
class DataStructureIterator;
// OK
template<typename T>
class DataStructure {
    friend class DataStructureIterator<T>;
    public:
        typedef DataStructureIterator<T> iterator;

        ...

        iterator begin() {
            return iterator(this);
        }

        iterator end(){
            return iterator(count);
        }

};
// ERROR: "Invalid use of incomplete type" (on ANY specialization attempt)
template<>
class DataStructure<double> {
    friend class DataStructureIterator<double>;
    public:
        typedef DataStructureIterator<double> iterator;

        ...

        iterator begin() {
            return iterator(this);
        }

        iterator end(){
            return iterator(count);
        }

};

template<typename T>
class DataStructureIterator { ... }

示例：

template<typename T>
struct DoublyLinkedListEntry {
    T value;
    DoublyLinkedListEntry* next;
    DoublyLinkedListEntry* previous;
};

template<typename T>
class DoublyLinkedListIterator;

template<typename T>
class DoublyLinkedList {
    friend class DoublyLinkedListIterator<T>;
    public:
        typedef DoublyLinkedListIterator<T> iterator;

        DoublyLinkedList() {
            head = nullptr;
            tail = nullptr;
            count = 0;
        }

        ~DoublyLinkedList() {
            empty();
        }

        void add(const T& value) {
            DoublyLinkedListEntry<T>* element = new DoublyLinkedListEntry<T>;
            element->value = value;
            element->next = nullptr;
            element->previous = tail;
            if(head==nullptr) {
                head = element;
            } else {
                tail->next = element;
            }
            tail = element;
            ++ count;
        }

        iterator begin() {
            return iterator(this);
        }

        iterator end(){
            return iterator(count);
        }
    private:
        void empty(){
            DoublyLinkedListEntry<T>* temp = head;
            DoublyLinkedListEntry<T>* del = temp;
            while(del != nullptr) {
                temp = temp->next;
                delete del;
                del = temp;
            }
        }

        DoublyLinkedListEntry<T>* head;
        DoublyLinkedListEntry<T>* tail;
        std::size_t count;
};

template<>
class DoublyLinkedList<double> {
    friend class DoublyLinkedListIterator<double>;
    public:
        typedef DoublyLinkedListIterator<double> iterator;

        DoublyLinkedList() {
            head = nullptr;
            tail = nullptr;
            count = 0;
        }

        ~DoublyLinkedList() {
            empty();
        }

        void add(double& value) {
            DoublyLinkedListEntry<double>* element = new DoublyLinkedListEntry<double>;
            element->value = value;
            element->next = nullptr;
            element->previous = tail;
            if(head==nullptr) {
                head = element;
            } else {
                tail->next = element;
            }
            tail = element;
            ++ count;
        }

        iterator begin() {
            return iterator(this);
        }

        iterator end(){
            return iterator(count);
        }
    private:
        void empty(){
            DoublyLinkedListEntry<double>* temp = head;
            DoublyLinkedListEntry<double>* del = temp;
            while(del != nullptr) {
                temp = temp->next;
                delete del;
                del = temp;
            }
        }

        DoublyLinkedListEntry<double>* head;
        DoublyLinkedListEntry<double>* tail;
        std::size_t count;
};

template<typename T>
class DoublyLinkedListIterator {
    public:
        DoublyLinkedListIterator(){
            list = nullptr;
            current_item = nullptr;
            offset = 0;
        }

        DoublyLinkedListIterator(DoublyLinkedList<T>* list){
            this->list = list;
            current_item = list->head;
            offset = 0;
        }

        DoublyLinkedListIterator(std::size_t total){
            list = nullptr;
            current_item = nullptr;
            offset = total;
        }

        ~DoublyLinkedListIterator(){}

        const T operator*(){
            return current_item->value;
        }

        bool operator!=(const DoublyLinkedListIterator<T>& it) const {
            return offset!=it.offset;
        }

        DoublyLinkedListIterator<T>& operator++(){
            if(current_item!=nullptr) {
                current_item = current_item->next;
            }
            ++offset;
            return *this;
        }

    private:
        DoublyLinkedList<T>* list;
        DoublyLinkedListEntry<T>* current_item;
        std::size_t offset;
};

构建错误：

In file included from ../src/Learning.cpp:11:0:
../src/DoublyLinkedList.h: In member function ‘DoublyLinkedList<double>::iterator DoublyLinkedList<double>::begin()’:
../src/DoublyLinkedList.h:107:20: error: return type ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’ is incomplete
   iterator begin() {
                    ^
../src/DoublyLinkedList.h:108:24: error: invalid use of incomplete type ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’
    return iterator(this);
                        ^
../src/DoublyLinkedList.h:22:7: error: declaration of ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’
 class DoublyLinkedListIterator;
       ^
../src/DoublyLinkedList.h: In member function ‘DoublyLinkedList<double>::iterator DoublyLinkedList<double>::end()’:
../src/DoublyLinkedList.h:111:17: error: return type ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’ is incomplete
   iterator end(){
                 ^
../src/DoublyLinkedList.h:112:25: error: invalid use of incomplete type ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’
    return iterator(count);
                         ^
../src/DoublyLinkedList.h:22:7: error: declaration of ‘DoublyLinkedList<double>::iterator {aka class DoublyLinkedListIterator<double>}’
 class DoublyLinkedListIterator;

Answer 1

错误信息非常清楚。

当您尝试在以下函数中创建类的实例时，

class DoublyLinkedListIterator<double>是不完整的类型：

    iterator begin() {
        return iterator(this);
    }

    iterator end(){
        return iterator(count);
    }

您可以使用以下任一方法解决此问题。

在template<typename T> class DoublyLinkedListIterator的定义之前移动template<> class DataStructure<double>的定义。
不要内联定义上述功能。只声明它们。在定义template<typename T> class DoublyLinkedListIterator。

C ++模板特化朋友迭代器错误：无效使用不完整类型

1 个答案: