容器不會排序，包含測試用例，（簡單的問題？）

Question

我看不到我做錯了什麼。我認爲這可能是三大法則之一。 Codepad link

#include <deque> 
//#include <string> 
//#include <utility> 
//#include <cstdlib> 
#include <cstring> 
#include <iostream> 
//#include <algorithm> // I use sort(), so why does this still compile when commented out? 

#include <boost/filesystem.hpp> 
#include <boost/foreach.hpp> 

using namespace std; 

namespace fs = boost::filesystem; 

class Page 
{ 
    public: 
     // constructor 
     Page(const char* path, const char* data, int size) : 
      path_(fs::path(path)), 
      size_(size), 
      data_(new char[size]) 
     { 
//   cout << "Creating Page..." << endl; 
      strncpy(data_, data, size); 
//   cout << "done creating Page..." << endl; 
     } 
     // copy constructor 
     Page(const Page& other) : 
      path_(fs::path(other.path())), 
      size_(other.size()), 
      data_(new char[other.size()]) 
     { 
//   cout << "Copying Page..." << endl; 
      strncpy(data_, other.data(), size_); 
//   cout << "done copying Page..." << endl; 
     } 
     // destructor 
     ~Page() { delete[] data_; } 
     // accessors 
     const fs::path& path() const { return path_; } 
     const char* data() const { return data_; } 
     int size() const { return size_; } 
     // operators 
     Page& operator = (const Page& other) { 
      if (this == &other) 
       return *this; 
      char* newImage = new char[other.size()]; 
      strncpy(newImage, other.data(), other.size()); 
      delete[] data_; 
      data_ = newImage; 
      return *this; 
     } 
     bool operator < (const Page& other) const { return path_ < other.path(); } 
    private: 
     fs::path path_; 
     int size_; 
     char* data_; 
}; 

class Book 
{ 
    public: 
     Book(const char* path) : 
      path_(fs::path(path)) 
     { 
      cout << "Creating Book..." << endl; 
      cout << "pushing back #1" << endl; 
      pages_.push_back(Page("image1.jpg", "firstImage", 10)); 
      cout << "pushing back #3" << endl; 
      pages_.push_back(Page("image3.jpg", "thirdImage", 10)); 
      cout << "pushing back #2" << endl; 
      pages_.push_back(Page("image2.jpg", "secondImage", 11)); 

      cout << "testing operator <" << endl; 
      cout << pages_[0].path().string() << (pages_[0] < pages_[1]? " < " : " > ") << pages_[1].path().string() << endl; 
      cout << pages_[1].path().string() << (pages_[1] < pages_[2]? " < " : " > ") << pages_[2].path().string() << endl; 
      cout << pages_[0].path().string() << (pages_[0] < pages_[2]? " < " : " > ") << pages_[2].path().string() << endl; 

      cout << "sorting" << endl; 
      BOOST_FOREACH (Page p, pages_) 
       cout << p.path().string() << endl; 
      sort(pages_.begin(), pages_.end()); 
      cout << "done sorting\n"; 
      BOOST_FOREACH (Page p, pages_) 
       cout << p.path().string() << endl; 

      cout << "done Creating Book" << endl; 
     } 
    private: 
     deque<Page> pages_; 
     fs::path path_; 
}; 

int main() { 
    Book* book = new Book("/some/path/"); 
} 

Answer 1

我只是不停地插科打諢，並意識到我的賦值運算符需要所有其它參數上爲好，不只是堆上分配者複製。

男人我覺得啞巴。 > _ <

btw後續問題：有沒有辦法做排序而不需要strncpy（）所有的緩衝區，只是交換指針地址呢？

編輯：

TNX dirkgently。是的，就是這樣，在我發佈之前，Sry沒有看到你的評論。