ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2026-07-28 01:20:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

style: More clang-tidy identifier renaming (#7290)

Browse Source
This commit is contained in:
Alex Kremer
2026-05-20 22:31:15 +01:00
committed by GitHub
parent 8c0080020f
commit a830ab10ef
160 changed files with 1726 additions and 1746 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/test/csf/Scheduler.h
View File

@@ -91,7 +91,7 @@ private:
make_multiset<Event, boost::intrusive::constant_time_size<false>>::type;
// alloc_ is owned by the scheduler
boost::container::pmr::monotonic_buffer_resource* alloc_;
by_when_set by_when_;
by_when_set byWhen_;
public:
using iterator = typename by_when_set::iterator;
@@ -258,7 +258,7 @@ inline Scheduler::QueueType::QueueType(boost::container::pmr::monotonic_buffer_r
inline Scheduler::QueueType::~QueueType()
{
for (auto iter = by_when_.begin(); iter != by_when_.end();)
for (auto iter = byWhen_.begin(); iter != byWhen_.end();)
{
auto e = &*iter;
++iter;
@@ -270,19 +270,19 @@ inline Scheduler::QueueType::~QueueType()
inline bool
Scheduler::QueueType::empty() const
{
return by_when_.empty();
return byWhen_.empty();
}
inline auto
Scheduler::QueueType::begin() -> iterator
{
return by_when_.begin();
return byWhen_.begin();
}
inline auto
Scheduler::QueueType::end() -> iterator
{
return by_when_.end();
return byWhen_.end();
}
template <class Handler>
@@ -292,14 +292,14 @@ Scheduler::QueueType::emplace(time_point when, Handler&& h) -> typename by_when_
using event_type = EventImpl<std::decay_t<Handler>>;
auto const p = alloc_->allocate(sizeof(event_type));
auto& e = *new (p) event_type(when, std::forward<Handler>(h));
return by_when_.insert(e);
return byWhen_.insert(e);
}
inline auto
Scheduler::QueueType::erase(iterator iter) -> typename by_when_set::iterator
{
auto& e = *iter;
auto next = by_when_.erase(iter);
auto next = byWhen_.erase(iter);
e.~Event();
alloc_->deallocate(&e, sizeof(e));
return next;