mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-10-04 22:02:52 +01:00
Jon Meow
af694b97cb
I'm doing this to avoid macro name conflicts, following https://google.github.io/styleguide/cppguide.html#Preprocessor_Macros: "If you do export a macro from a header, it must have a globally unique name. To achieve this, it must be named with a prefix consisting of your project's namespace name (but upper case)." Commands run: ``` sed -i 's/\(DCHECK\|CHECK\|FATAL\|MAKE_UNIQUE_NAME\|MAKE_UNIQUE_NAME_IMPL\|RAW_EXITING_STREAM\|RETURN_IF_ERROR\|RETURN_IF_ERROR_IMPL\|ASSIGN_OR_RETURN\|ASSIGN_OR_RETURN_IMPL\|DIAGNOSTIC_KIND\|RETURN_IF_STACK_LIMITED\)(/CARBON_\1(/g' $(git ls-files *.cpp *.h *.lpp *.ypp *.def ':!third_party') sed -i 's/#undef DIAGNOSTIC_KIND/#undef CARBON_DIAGNOSTIC_KIND/' toolchain/diagnostics/diagnostic_registry.def ``` Note this isn't *quite* everything, but it's intended to be a large pass at everything: ``` ╚╡git grep '#define ' *.cpp *.h *.lpp *.ypp *.def ':!third_party' | grep -v '#define CARBON' | grep -v _H_ explorer/syntax/lexer.lpp: #define YY_USER_ACTION \ explorer/syntax/lexer.lpp: #define SIMPLE_TOKEN(name) \ explorer/syntax/lexer.lpp: #define ARG_TOKEN(name, arg) \ explorer/syntax/parse_and_lex_context.h:#define YY_DECL \ migrate_cpp/cpp_refactoring/var_decl.cpp:#define ABSTRACT_TYPE(Class, Base) migrate_cpp/cpp_refactoring/var_decl.cpp:#define TYPE(Class, Base) \ ``` We may in particular want to do a pass to clean up #ifdef guards and make them be CARBON_ rooted.
76 lines
2.1 KiB
C++
76 lines
2.1 KiB
C++
// Part of the Carbon Language project, under the Apache License v2.0 with LLVM
|
|
// Exceptions. See /LICENSE for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
#ifndef EXPLORER_INTERPRETER_STACK_H_
|
|
#define EXPLORER_INTERPRETER_STACK_H_
|
|
|
|
#include <cstddef>
|
|
#include <iterator>
|
|
#include <vector>
|
|
|
|
#include "common/check.h"
|
|
|
|
namespace Carbon {
|
|
|
|
// A stack data structure.
|
|
template <class T>
|
|
struct Stack {
|
|
// NOLINTNEXTLINE(readability-identifier-naming)
|
|
using const_iterator = typename std::vector<T>::const_reverse_iterator;
|
|
|
|
// Creates an empty instance.
|
|
Stack() = default;
|
|
|
|
// Creates an instance containing just `x`.
|
|
explicit Stack(T x) : Stack() { Push(std::move(x)); }
|
|
|
|
// Pushes `x` onto the top of the stack.
|
|
void Push(T x) { elements_.push_back(std::move(x)); }
|
|
|
|
// Removes and returns the top element of the stack.
|
|
//
|
|
// - Requires: !this->IsEmpty()
|
|
auto Pop() -> T {
|
|
CARBON_CHECK(!IsEmpty()) << "Can't pop from empty stack.";
|
|
auto r = std::move(elements_.back());
|
|
elements_.pop_back();
|
|
return r;
|
|
}
|
|
|
|
// Removes the top `n` elements of the stack.
|
|
//
|
|
// - Requires: n >= 0 && n <= Count()
|
|
void Pop(int n) {
|
|
CARBON_CHECK(n >= 0) << "Negative pop count disallowed.";
|
|
CARBON_CHECK(static_cast<size_t>(n) <= elements_.size())
|
|
<< "Can only pop as many elements as stack has.";
|
|
elements_.erase(elements_.end() - n, elements_.end());
|
|
}
|
|
|
|
// Returns the top element of the stack.
|
|
//
|
|
// - Requires: !this->IsEmpty()
|
|
auto Top() const -> const T& {
|
|
CARBON_CHECK(!IsEmpty()) << "Empty stack has no Top().";
|
|
return elements_.back();
|
|
}
|
|
|
|
// Returns `true` iff `Count() > 0`.
|
|
auto IsEmpty() const -> bool { return elements_.empty(); }
|
|
|
|
// Returns the number of elements in `*this`.
|
|
auto Count() const -> int { return elements_.size(); }
|
|
|
|
// Iterates over the Stack from top to bottom.
|
|
auto begin() const -> const_iterator { return elements_.crbegin(); }
|
|
auto end() const -> const_iterator { return elements_.crend(); }
|
|
|
|
private:
|
|
std::vector<T> elements_;
|
|
};
|
|
|
|
} // namespace Carbon
|
|
|
|
#endif // EXPLORER_INTERPRETER_CONS_LIST_H_
|