std::stack push() 方法

自 C++11 起

// (1) Non const version only
void push( const value_type& value );

// (2) Non const version only
void push( value_type&& value );

直到 C++11

// (1) Non const version only
void push( const value_type& value );

将给定元素值推入栈的末尾

• (1) 有效调用

  c.push_back(value)
• (2) 有效调用

  c.push_back(std::move(value))

参数

• value - 要推入的元素的值

返回值

(无)

异常

等同于底层容器的 push_back。

复杂度

等同于底层容器的 push_back。

示例

Main.cpp

#include <map>
#include <stack>
#include <array>
#include <iostream>
#include <stdexcept>
#include <string_view>
 
class BrainHackInterpreter {
    std::map<unsigned, unsigned> open_brackets, close_brackets;
    unsigned program_pos_{0};
    std::array<std::uint8_t, 32768> data_;
    int data_pos_{0};
 
    void collect_brackets_positions(const std::string_view program) {
        std::stack<unsigned> brackets_stack;
 
        for (auto pos{0U}; pos != program.length(); ++pos) {
            const char c{program[pos]};
            if ('[' == c) {
                brackets_stack.push(pos);
            } else if (']' == c) {
                if (brackets_stack.empty()) {
                    throw std::runtime_error("brackets [] do not match!");
                } else {
                    open_brackets[brackets_stack.top()] = pos;
                    close_brackets[pos] = brackets_stack.top();
                    brackets_stack.pop();
                }
            }
        }
 
        if (!brackets_stack.empty())
            throw std::runtime_error("brackets [] do not match!");
    }
 
    void check_data_pos(int pos) {
        if (pos < 0 or pos >= static_cast<int>(data_.size()))
            throw std::out_of_range{"data pointer out of bound"};
    }
 
  public:
    BrainHackInterpreter(const std::string_view program) {
        collect_brackets_positions(program);
        data_.fill(0);
 
        for (; program_pos_ < program.length(); ++program_pos_) {
            switch (program[program_pos_]) {
                case '<': check_data_pos(--data_pos_); break;
                case '>': check_data_pos(++data_pos_); break;
                case '-': --data_[data_pos_]; break;
                case '+': ++data_[data_pos_]; break;
                case '.': std::cout << data_[data_pos_]; break;
                case ',': std::cin >> data_[data_pos_]; break;
                case '[':
                    if (data_[data_pos_] == 0)
                        program_pos_ = open_brackets[program_pos_];
                    break;
                case ']':
                    if (data_[data_pos_] != 0)
                        program_pos_ = close_brackets[program_pos_];
                    break;
            }
        }
    }
};
 
int main()
{
    BrainHackInterpreter
    {
		"-[------->+<]>-.--[-->+++<]>.[----->++<]>++.--------"
		"----.+[->+++<]>.+++++++++++++..----.-----------.++++"
		"+++++++++.-------.+++++++.---------.[--->+<]>---."
    };
}

输出

Hi, cppreference!