mirror of
https://github.com/zeek/zeek.git
synced 2025-10-06 00:28:21 +00:00
Reformat Zeek in Spicy style
This largely copies over Spicy's `.clang-format` configuration file. The one place where we deviate is header include order since Zeek depends on headers being included in a certain order.
This commit is contained in:
Benjamin Bannier
parent
7b8e7ed72c
commit
f5a76c1aed
786 changed files with 131714 additions and 153609 deletions
158
src/Span.h
158
src/Span.h
|
|
@ -7,153 +7,137 @@
|
|||
#include <iterator>
|
||||
#include <type_traits>
|
||||
|
||||
namespace zeek
|
||||
{
|
||||
namespace zeek {
|
||||
|
||||
/**
|
||||
* Drop-in replacement for C++20's @c std::span with dynamic extent only:
|
||||
* https://en.cppreference.com/w/cpp/container/span. After upgrading to C++20,
|
||||
* this class may get replaced with a type alias instead and/or deprecated.
|
||||
*/
|
||||
template <class T> class Span
|
||||
{
|
||||
template<class T>
|
||||
class Span {
|
||||
public:
|
||||
// -- member types ---------------------------------------------------------
|
||||
// -- member types ---------------------------------------------------------
|
||||
|
||||
using element_type = T;
|
||||
using element_type = T;
|
||||
|
||||
using value_type = typename std::remove_cv<T>::type;
|
||||
using value_type = typename std::remove_cv<T>::type;
|
||||
|
||||
using index_type = size_t;
|
||||
using index_type = size_t;
|
||||
|
||||
using difference_type = ptrdiff_t;
|
||||
using difference_type = ptrdiff_t;
|
||||
|
||||
using pointer = T*;
|
||||
using pointer = T*;
|
||||
|
||||
using const_pointer = const T*;
|
||||
using const_pointer = const T*;
|
||||
|
||||
using reference = T&;
|
||||
using reference = T&;
|
||||
|
||||
using const_reference = T&;
|
||||
using const_reference = T&;
|
||||
|
||||
using iterator = pointer;
|
||||
using iterator = pointer;
|
||||
|
||||
using const_iterator = const_pointer;
|
||||
using const_iterator = const_pointer;
|
||||
|
||||
using reverse_iterator = std::reverse_iterator<iterator>;
|
||||
using reverse_iterator = std::reverse_iterator<iterator>;
|
||||
|
||||
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
|
||||
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
|
||||
|
||||
// -- constructors, destructors, and assignment operators ------------------
|
||||
// -- constructors, destructors, and assignment operators ------------------
|
||||
|
||||
constexpr Span() noexcept : memory_block(nullptr), num_elements(0) { }
|
||||
constexpr Span() noexcept : memory_block(nullptr), num_elements(0) {}
|
||||
|
||||
constexpr Span(pointer ptr, size_t size) : memory_block(ptr), num_elements(size) { }
|
||||
constexpr Span(pointer ptr, size_t size) : memory_block(ptr), num_elements(size) {}
|
||||
|
||||
constexpr Span(pointer first, pointer last)
|
||||
: memory_block(first), num_elements(static_cast<size_t>(last - first))
|
||||
{
|
||||
}
|
||||
constexpr Span(pointer first, pointer last)
|
||||
: memory_block(first), num_elements(static_cast<size_t>(last - first)) {}
|
||||
|
||||
template <size_t Size>
|
||||
constexpr Span(element_type (&arr)[Size]) noexcept : memory_block(arr), num_elements(Size)
|
||||
{
|
||||
}
|
||||
template<size_t Size>
|
||||
constexpr Span(element_type (&arr)[Size]) noexcept : memory_block(arr), num_elements(Size) {}
|
||||
|
||||
template <class Container, class Data = typename Container::value_type,
|
||||
class = std::enable_if_t<std::is_convertible_v<Data*, T*>>>
|
||||
Span(Container& xs) noexcept : memory_block(xs.data()), num_elements(xs.size())
|
||||
{
|
||||
}
|
||||
template<class Container, class Data = typename Container::value_type,
|
||||
class = std::enable_if_t<std::is_convertible_v<Data*, T*>>>
|
||||
Span(Container& xs) noexcept : memory_block(xs.data()), num_elements(xs.size()) {}
|
||||
|
||||
template <class Container, class Data = typename Container::value_type,
|
||||
class = std::enable_if_t<std::is_convertible_v<const Data*, T*>>>
|
||||
Span(const Container& xs) noexcept : memory_block(xs.data()), num_elements(xs.size())
|
||||
{
|
||||
}
|
||||
template<class Container, class Data = typename Container::value_type,
|
||||
class = std::enable_if_t<std::is_convertible_v<const Data*, T*>>>
|
||||
Span(const Container& xs) noexcept : memory_block(xs.data()), num_elements(xs.size()) {}
|
||||
|
||||
constexpr Span(const Span&) noexcept = default;
|
||||
constexpr Span(const Span&) noexcept = default;
|
||||
|
||||
Span& operator=(const Span&) noexcept = default;
|
||||
Span& operator=(const Span&) noexcept = default;
|
||||
|
||||
// -- iterators ------------------------------------------------------------
|
||||
// -- iterators ------------------------------------------------------------
|
||||
|
||||
constexpr iterator begin() const noexcept { return memory_block; }
|
||||
constexpr iterator begin() const noexcept { return memory_block; }
|
||||
|
||||
constexpr const_iterator cbegin() const noexcept { return memory_block; }
|
||||
constexpr const_iterator cbegin() const noexcept { return memory_block; }
|
||||
|
||||
constexpr iterator end() const noexcept { return begin() + num_elements; }
|
||||
constexpr iterator end() const noexcept { return begin() + num_elements; }
|
||||
|
||||
constexpr const_iterator cend() const noexcept { return cbegin() + num_elements; }
|
||||
constexpr const_iterator cend() const noexcept { return cbegin() + num_elements; }
|
||||
|
||||
constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator{end()}; }
|
||||
constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator{end()}; }
|
||||
|
||||
constexpr const_reverse_iterator crbegin() const noexcept
|
||||
{
|
||||
return const_reverse_iterator{end()};
|
||||
}
|
||||
constexpr const_reverse_iterator crbegin() const noexcept { return const_reverse_iterator{end()}; }
|
||||
|
||||
constexpr reverse_iterator rend() const noexcept { return reverse_iterator{begin()}; }
|
||||
constexpr reverse_iterator rend() const noexcept { return reverse_iterator{begin()}; }
|
||||
|
||||
constexpr const_reverse_iterator crend() const noexcept
|
||||
{
|
||||
return const_reverse_iterator{begin()};
|
||||
}
|
||||
constexpr const_reverse_iterator crend() const noexcept { return const_reverse_iterator{begin()}; }
|
||||
|
||||
// -- element access -------------------------------------------------------
|
||||
// -- element access -------------------------------------------------------
|
||||
|
||||
constexpr reference operator[](size_t index) const noexcept { return memory_block[index]; }
|
||||
constexpr reference operator[](size_t index) const noexcept { return memory_block[index]; }
|
||||
|
||||
constexpr reference front() const noexcept { return *memory_block; }
|
||||
constexpr reference front() const noexcept { return *memory_block; }
|
||||
|
||||
constexpr reference back() const noexcept { return (*this)[num_elements - 1]; }
|
||||
constexpr reference back() const noexcept { return (*this)[num_elements - 1]; }
|
||||
|
||||
// -- properties -----------------------------------------------------------
|
||||
// -- properties -----------------------------------------------------------
|
||||
|
||||
constexpr size_t size() const noexcept { return num_elements; }
|
||||
constexpr size_t size() const noexcept { return num_elements; }
|
||||
|
||||
constexpr size_t size_bytes() const noexcept { return num_elements * sizeof(element_type); }
|
||||
constexpr size_t size_bytes() const noexcept { return num_elements * sizeof(element_type); }
|
||||
|
||||
constexpr bool empty() const noexcept { return num_elements == 0; }
|
||||
constexpr bool empty() const noexcept { return num_elements == 0; }
|
||||
|
||||
constexpr pointer data() const noexcept { return memory_block; }
|
||||
constexpr pointer data() const noexcept { return memory_block; }
|
||||
|
||||
// -- subviews -------------------------------------------------------------
|
||||
// -- subviews -------------------------------------------------------------
|
||||
|
||||
constexpr Span subspan(size_t offset, size_t count) const
|
||||
{
|
||||
return {memory_block + offset, count};
|
||||
}
|
||||
constexpr Span subspan(size_t offset, size_t count) const { return {memory_block + offset, count}; }
|
||||
|
||||
constexpr Span subspan(size_t offset) const
|
||||
{
|
||||
return {memory_block + offset, num_elements - offset};
|
||||
}
|
||||
constexpr Span subspan(size_t offset) const { return {memory_block + offset, num_elements - offset}; }
|
||||
|
||||
constexpr Span first(size_t count) const { return {memory_block, count}; }
|
||||
constexpr Span first(size_t count) const { return {memory_block, count}; }
|
||||
|
||||
constexpr Span last(size_t count) const { return subspan(num_elements - count, num_elements); }
|
||||
constexpr Span last(size_t count) const { return subspan(num_elements - count, num_elements); }
|
||||
|
||||
private:
|
||||
// -- member variables -----------------------------------------------------
|
||||
// -- member variables -----------------------------------------------------
|
||||
|
||||
/// Points to the first element in the contiguous memory block.
|
||||
pointer memory_block;
|
||||
/// Points to the first element in the contiguous memory block.
|
||||
pointer memory_block;
|
||||
|
||||
/// Stores the number of elements in the contiguous memory block.
|
||||
size_t num_elements;
|
||||
};
|
||||
/// Stores the number of elements in the contiguous memory block.
|
||||
size_t num_elements;
|
||||
};
|
||||
|
||||
// -- deduction guides ---------------------------------------------------------
|
||||
|
||||
template <class T> Span(T*, size_t) -> Span<T>;
|
||||
template<class T>
|
||||
Span(T*, size_t) -> Span<T>;
|
||||
|
||||
template <class Iter> Span(Iter, Iter) -> Span<typename std::iterator_traits<Iter>::value_type>;
|
||||
template<class Iter>
|
||||
Span(Iter, Iter) -> Span<typename std::iterator_traits<Iter>::value_type>;
|
||||
|
||||
template <class T, size_t N> Span(T (&)[N]) -> Span<T>;
|
||||
template<class T, size_t N>
|
||||
Span(T (&)[N]) -> Span<T>;
|
||||
|
||||
template <class Container> Span(Container&) -> Span<typename Container::value_type>;
|
||||
template<class Container>
|
||||
Span(Container&) -> Span<typename Container::value_type>;
|
||||
|
||||
template <class Container> Span(const Container&) -> Span<const typename Container::value_type>;
|
||||
template<class Container>
|
||||
Span(const Container&) -> Span<const typename Container::value_type>;
|
||||
|
||||
} // namespace zeek
|
||||
} // namespace zeek
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue