- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我编写了一个基本程序,用于为中间 C++ 类制作整数堆栈。整个编译都很好,但我遇到了 2 个问题:容量总是显示为 0,并且在我测试重载赋值运算符 (Stack1 = Stack2) 时出现段错误。我知道这可能是因为同样的事情,但应该改变什么?
#include <iostream>
#include <ostream>
#include <cstring>
#include <stdexcept>
using namespace std;
class Stack
{
//overloaded "<<" for outputting the stack's contents
friend ostream& operator<<(ostream& leftOp, const Stack& rightOp);
public:
Stack(); //constructor
Stack(const Stack& s); //copy constructor
~Stack(); //destructor
const Stack& operator=(const Stack& rightOp); //assign one stack to another
void clear(); //set the stack size back to 0
bool empty() const; //checks whether or not the stack is empty
unsigned int size() const; //returns the size
unsigned int capacity() const; //returns the capacity
int top() const throw(out_of_range); //returns the top value
void push(int item); //adds a new value
void pop() throw(out_of_range); //removes the top value
void reserve(unsigned int newCapacity); //enlarges the array
private:
unsigned int stackCap; //stack capacity
unsigned int stackSize; //stack size
int* stackArray; //pointer to the stack, to be dynamically allocated
};
int main()
{
cout << "Testing default constructor\n\n";
Stack s1;
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing push()\n\n";
for (int i = 10; i < 80; i+= 10)
s1.push(i);
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
for (int i = 15; i < 85; i+= 10)
s1.push(i);
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing copy constructor()\n\n";
Stack s2 = s1;
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing top()\n\n";
cout << "Top item of s1: " << s1.top() << endl << endl;
cout << "Testing pop()\n\nTop item of s1: ";
while (!s1.empty())
{
cout << s1.top() << ' ';
s1.pop();
}
cout << endl << endl;
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing assignment operator\n\n";
Stack s3;
s3 = s2;
cout << "s2 (size " << s2.size() << "): " << s2 << endl;
cout << "s3 (size " << s3.size() << "): " << s3 << endl << endl;
cout << "Testing clear()\n\n";
s2.clear();
cout << "s2: " << s2 << endl;
cout << "s2 size: " << s2.size() << ", capacity: " << s2.capacity() << endl;
cout << "s2 is " << ((s2.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "s3: " << s3 << endl;
cout << "s3 size: " << s3.size() << ", capacity: " << s3.capacity() << endl;
cout << "s3 is " << ((s3.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing assignment to self and swap\n\n";
s3 = s3;
s2 = s3;
s3.clear();
cout << "s2 (size " << s2.size() << "): " << s2 << endl;
cout << "s3 (size " << s3.size() << "): " << s3 << endl << endl;
cout << "Testing chained assignment\n\n";
Stack s4;
s4 = s3 = s2;
cout << "s2 (size " << s2.size() << "): " << s2 << endl;
cout << "s3 (size " << s3.size() << "): " << s3 << endl;
cout << "s4 (size " << s4.size() << "): " << s4 << endl << endl;
cout << "Testing const correctness\n\n";
const Stack& r4 = s4;
cout << "s4: " << r4 << endl;
cout << "s4 size: " << r4.size() << ", capacity: " << r4.capacity() << endl;
cout << "s4 is " << ((r4.empty()) ? "empty\n" : "not empty\n");
cout << "\nTop item of s4: " << r4.top() << endl << endl;
s1 = r4;
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
s1.clear();
cout << "s1: " << s1 << endl;
cout << "s1 size: " << s1.size() << ", capacity: " << s1.capacity() << endl;
cout << "s1 is " << ((s1.empty()) ? "empty\n" : "not empty\n");
cout << endl;
cout << "Testing top() with empty stack\n\n";
try
{
cout << s1.top() << endl;
}
catch (out_of_range orex)
{
cout << orex.what() << endl << endl;
}
cout << "Testing pop() with empty stack\n\n";
try
{
s1.pop();
}
catch (out_of_range orex)
{
cout << orex.what() << endl;
}
return 0;
}
Stack::Stack()
{
stackCap = 0;
stackSize = 0;
stackArray = '\0';
}
Stack::Stack(const Stack& s) //copy constructor
{
stackCap = s.capacity();
stackSize = s.size();
if (s.stackCap == 0)
stackArray = '\0';
else
{
stackArray = new int[stackCap];
for (unsigned int i=0; i < stackSize; i++) //copy the string except for the nullbyte
{
stackArray[i] = s.stackArray[i]; //copy it one character at a time into the main string
}
}
}
Stack::~Stack() //destructor
{
delete stackArray;
}
const Stack& Stack::operator=(const Stack& rightOp) //assign one stack to another
{
if (rightOp.stackArray == '\0')
{
stackCap = 0;
stackSize = 0;
stackArray = '\0';
}
else
{
delete[] stackArray; //delete that array that is the wrong size!
stackSize = rightOp.stackSize;
stackCap = rightOp.stackCap;
if (rightOp.capacity() == 0)
stackArray = '\0';
else
{
stackArray = new int[stackCap];
for (unsigned int i=0; i < stackSize; i++) //copy the string except for the nullbyte
{
stackArray[i] = rightOp.stackArray[i]; //copy it one character at a time into the main string
}
}
}
return *this;
}
void Stack::clear()
{
stackSize = 0;
}
bool Stack::empty() const
{
return (stackSize == 0);
}
unsigned int Stack::size() const
{
return stackSize;
}
unsigned int Stack::capacity() const
{
return stackCap;
}
int Stack::top() const throw(out_of_range)
{
if ( empty() == true )
throw out_of_range("top(): stack is empty");
else
return stackArray[stackSize];
}
void Stack::push(int item)
{
if (stackCap == stackSize)
reserve(stackCap * 2);
stackArray[stackSize] = item;
stackSize++;
}
void Stack::pop() throw(out_of_range)
{
if ( empty() == true )
throw out_of_range("top(): stack is empty");
stackSize--;
if (stackSize > 0 && stackSize == stackCap / 4)
reserve(stackCap / 2);
}
void Stack::reserve(unsigned int newCapacity)
{
int* copyArray = new int[newCapacity];
for (unsigned int i = 0; i < stackSize; i++)
{
copyArray[i] = stackArray[i];
}
stackCap = newCapacity;
delete[] stackArray;
stackArray = copyArray;
}
ostream& operator<<(ostream& leftOp, const Stack& rightOp) //prints out the stacks contents
{
for (unsigned int i = 0; i < rightOp.stackSize; i++) //run the loop for the number of rightOp elements
leftOp << rightOp.stackArray[i] << " "; //read the elements into leftOp stream
return leftOp;
}
最佳答案
您的代码没有很好地处理 s3 = s3;
。您在删除后引用了 s3.stackArray
。
解决此问题的一种方法是在 operator=()
的开头添加 if (this == &rightOp) return *this;
。
此外,由于您的初始容量为 0,并且您总是通过 reserve(stackCap * 2)
增加它,因此它始终停留在 0。要么使用非 0 初始容量,要么专门处理 0。
关于c++ - 基于数组的整数堆栈中的段错误和行为不当的数据成员,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/22776281/
test = (function(){var key = 200; return {getKey : function(){return key} }; })(); test.
如果这个问题可能一直被问到,我很抱歉,但我进行了搜索,但找不到足够的答案。 如果公共(public)成员/方法正在访问私有(private)成员/字段,如何禁用它们的继承? 所以考虑一下: publi
重要的澄清:一些评论者似乎认为我是从 union 复制的。仔细查看 memcpy,它从一个普通的旧 uint32_t 地址复制而来,该地址不包含在 union 中。另外,我正在(通过 memcpy)复
spinner 通常只显示一个字符串,在我想分配 IDpersonne 和 Name 的情况下,旋转器必须告诉我名字。当我得到选定的项目时,我必须得到 ID。我该怎么做? 最佳答案 我假设您已将项目排
A 类的实例是 B 类的公共(public)成员。B 类的实例也是 A 的公共(public)成员。在什么情况下可能需要这种实现?我的意思是是否有一个或多个标准场景需要这种实现方式?更具体的细节:我有
我如何设置我的 web.config 以使用表单例份验证,将成员身份提供程序设置为 ActiveDirectoryMembershipProvider 并使用内置登录控件。这样我就可以使用有效的事件目
这个问题已经有答案了: Should methods in a Java interface be declared with or without a public access modifier?
因此根据定义,类中的私有(private)数字在序列化时以类名作为前缀。这对我来说是一个问题,我希望能够序列化/保存/反序列化一个确切的对象,但是 php 所做的是给我另一个 classname+va
我实现了一个成员? clojure 中的函数如下: (defn member? [item seq] (cond (empty? seq) false (= item (first
我在这里的问题似乎总是与使用函数有关。它仍然让我困惑!在本教科书练习中,我被要求按值传递结构,然后调整它并按引用传递。最初我设计的代码是在 main 中完成所有工作。现在我正在传递值。所以我添加了新函
所以我有这些变量 List files, images = new List(); string rootStr; 还有这个线程函数 private static int[] thread_searc
我对 C++ 模板和尝试弄清楚部分模板特化还比较陌生。我正在使用模板实现几个相关的数据结构:用于概率存在/不存在查询的布隆过滤器(基于位数组),以及用于丰度查询的计数布隆过滤器(带有整数数组)。我从以
例如在 java 中,我在外部类和内部类中声明并初始化了一个 JButton,我决定在某些情况下将其隐藏,这是一种安全的编程实践吗? 最佳答案 内部类的全部目的是它们可以访问到环绕内部类的外部类。 所
我有一个使用库进行通信的类: class Topic { Topic( Type T, String name ); }; class Reader { Reader (Topic, Stri
我在两个单独的文件中有以下代码。 package animal; public class Frog { protected void ribbit() { Syste
我有一个分数列表。使用这些,我需要从 redis 排序集中提取值。 我知道我可以使用 zrangebyscore - 但如果我提供的列表中的分数不连续怎么办?在这种情况下,我不能依赖 zrangeby
过去几年我一直被 C# 编码宠坏了,现在我又回到了 C++ 并发现我在处理本应很简单的东西时遇到了麻烦。我正在为 gamedev 使用名为 DarkGDK 的第三方库(任何以 db 为前缀的命令),但
我正在关注 Brian Harvey 从 2011 年开始在 UC Berkeley site 上的 SICP 讲座。 .他正在使用 STk interpreter教这门课,我正在使用带有 DrRac
在这段代码中,为什么在运算符重载中无法访问我的类的私有(private)字段? (请注意,这只是一个 MRE,不是完整代码) template class Frac template Frac o
在命名命名空间类中,我将一个类(位于全局命名空间中)声明为友元。 但是,后一个类不能访问前一个类的私有(private)成员。为什么是这样?有什么办法可以解决吗? Bob.h namespace AB
我是一名优秀的程序员,十分优秀!