我一直在處理自定義Vector類。一切工作完美罰款微軟編譯器,但是當我在Borland上嘗試它時,我得到一個非常奇怪的錯誤。new int []拋出'訪問衝突'異常
Borland在插入函數內拋出異常; 正確調用拷貝構造函數「Vector temp(* this);」在
「array_ = new int [rhs.size_];」 line
void Vector::insert(int value, unsigned position) throw(SubscriptError)
{
check_bounds(position);
Vector temp(*this);
int tmpSize= size_;
temp.size_++;
size_++;
for (unsigned int i=tmpSize; i > position; i--)
{
temp[i] = temp[i-1];
}
temp[position] = value;
//array_= temp.array_;
for(unsigned int i = 0; i < size_; i++)
{
array_[i]= temp.array_[i];
}
}
這裏是我的複製構造函數;
Vector::Vector(const Vector& rhs)
{
array_ = new int[rhs.size_];
size_ = rhs.size_;
for(unsigned int i = 0; i < rhs.size_; i++)
{
array_[i] = rhs.array_[i];
}
}
最後這是main();
std::cout << "push_back 5 integers:\n";
for (int i = 0; i < 5; i++)
{
a.push_back(i);
Print(a);
}
std::cout << "insert(99, 3):\n";
a.insert(99, 3);
Print(a);
std::cout << "insert(98, 0):\n";
a.insert(98, 0);
Print(a);
std::cout << "insert(97, 6):\n";
a.insert(97, 6);
Print(a);
奇怪的是第一次插入通話(a.insert(99,3))正常工作,當它涉及到第二個呼叫崩潰(a.insert(98,0))
下面是完整的頭文件
namespace CS170
{
class SubscriptError
{
public:
SubscriptError(int Subscript) : subscript_(Subscript) {};
int GetSubscript(void) const { return subscript_; }
private:
int subscript_;
};
class Vector
{
public:
static const int NO_INDEX = -1;
struct SortResult
{
unsigned compares;
unsigned swaps;
};
// Default constructor
Vector(void);
// Destructor
~Vector();
// Copy constructor
Vector(const Vector& rhs);
// Constructor to create a Vector from an array
Vector(const int array[], unsigned size);
// Adds a node to the front of the list
void push_back(int value);
// Adds a node to the end of the list
void push_front(int value);
// Removes the last element. Does nothing if empty.
void pop_back(void);
// Removes the first element. Does nothing if empty.
void pop_front(void);
// Inserts a new node at the specified position. Causes an
// abort() if the position is invalid. (Calls check_bounds)
void insert(int value, unsigned position) throw(SubscriptError);
// Removes an element with the specified value (first occurrence)
void remove(int value);
// Deletes the underlying array and sets size_ to 0
void clear(void);
// Return true if the vector is empty, otherwise, false
bool empty(void) const;
// Assignment operator
Vector& operator=(const Vector& rhs);
// Concatenates a vector onto the end of this vector.
Vector& operator+=(const Vector& rhs);
// Concatenates two Vectors.
Vector operator+(const Vector& rhs) const;
// Subscript operators.
int operator[](unsigned index) const throw(SubscriptError);
int& operator[](unsigned index) throw(SubscriptError);
// Returns the number of elements in the vector.
unsigned size(void) const;
// Returns the size of the underlying array
unsigned capacity(void) const;
// The number of memory allocations that have occurred
unsigned allocations(void) const;
// This searches the vector using a binary search instead
// of a linear search. The data must be sorted. Returns
// the index. If not found, returns CS170::Vector::NO_INDEX.
// DO NOT SORT THE DATA IN THIS FUNCTION!!
int bsearch(int value) const;
// Sorts the elements using a selection sort.
// Returns the number of swaps/comparisons that occurred.
SortResult selection_sort(void);
// Sorts the elements using a bubble_sort.
// Returns the number of swaps/comparisons that occurred.
SortResult bubble_sort(void);
void swap(int &a, int& b);
void swapv(Vector &other);
void reverse(void);
bool operator==(const Vector& rhs) const;
void shrink_to_fit(void);
private:
int *array_; // The dynamically allocated array
unsigned size_; // The number of elements in the array
unsigned capacity_; // The allocated size of the array
unsigned allocs_; // Number of allocations (resizes)
// Private methods...
void check_bounds(unsigned index) const throw(SubscriptError);
void grow(void);
// Other private methods...
};
}// namespace CS170
#endif // VECTOR_H
@Brian:爲什麼會出現rhs.size_'爲private的問題?一個類可以完全訪問其內部,所以你當然可以訪問你自己內部的另一個Vector對象的'size_'。 – Xeo 2011-04-17 06:48:30
不要使用異常規範(函數頭中的'throw(SubscriptError)'),它們將從C++中移除。 – ybungalobill 2011-04-17 06:48:40