aboutsummaryrefslogtreecommitdiffstats
path: root/util/generic/buffer.h
diff options
context:
space:
mode:
authorAnton Samokhvalov <pg83@yandex.ru>2022-02-10 16:45:17 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:45:17 +0300
commitd3a398281c6fd1d3672036cb2d63f842d2cb28c5 (patch)
treedd4bd3ca0f36b817e96812825ffaf10d645803f2 /util/generic/buffer.h
parent72cb13b4aff9bc9cf22e49251bc8fd143f82538f (diff)
downloadydb-d3a398281c6fd1d3672036cb2d63f842d2cb28c5.tar.gz
Restoring authorship annotation for Anton Samokhvalov <pg83@yandex.ru>. Commit 2 of 2.
Diffstat (limited to 'util/generic/buffer.h')
-rw-r--r--util/generic/buffer.h306
1 files changed, 153 insertions, 153 deletions
diff --git a/util/generic/buffer.h b/util/generic/buffer.h
index 9c729b5225..9576467404 100644
--- a/util/generic/buffer.h
+++ b/util/generic/buffer.h
@@ -1,166 +1,166 @@
#pragma once
-
-#include "utility.h"
-
+
+#include "utility.h"
+
#include <util/generic/fwd.h>
-#include <util/system/align.h>
-#include <util/system/yassert.h>
-
+#include <util/system/align.h>
+#include <util/system/yassert.h>
+
#include <cstring>
-
+
class TBuffer {
-public:
+public:
using TIterator = char*;
using TConstIterator = const char*;
-
- TBuffer(size_t len = 0);
- TBuffer(const char* buf, size_t len);
-
- TBuffer(const TBuffer& b)
- : Data_(nullptr)
- , Len_(0)
- , Pos_(0)
- {
- *this = b;
- }
-
- TBuffer(TBuffer&& b) noexcept;
-
- TBuffer& operator=(TBuffer&& b) noexcept;
-
- TBuffer& operator=(const TBuffer& b) {
+
+ TBuffer(size_t len = 0);
+ TBuffer(const char* buf, size_t len);
+
+ TBuffer(const TBuffer& b)
+ : Data_(nullptr)
+ , Len_(0)
+ , Pos_(0)
+ {
+ *this = b;
+ }
+
+ TBuffer(TBuffer&& b) noexcept;
+
+ TBuffer& operator=(TBuffer&& b) noexcept;
+
+ TBuffer& operator=(const TBuffer& b) {
if (this != &b) {
Assign(b.Data(), b.Size());
}
- return *this;
- }
+ return *this;
+ }
~TBuffer();
-
+
inline void Clear() noexcept {
- Pos_ = 0;
- }
-
+ Pos_ = 0;
+ }
+
inline void EraseBack(size_t n) noexcept {
Y_ASSERT(n <= Pos_);
- Pos_ -= n;
- }
-
+ Pos_ -= n;
+ }
+
inline void Reset() noexcept {
- TBuffer().Swap(*this);
- }
-
- inline void Assign(const char* data, size_t len) {
- Clear();
- Append(data, len);
- }
-
- inline void Assign(const char* b, const char* e) {
- Assign(b, e - b);
- }
-
+ TBuffer().Swap(*this);
+ }
+
+ inline void Assign(const char* data, size_t len) {
+ Clear();
+ Append(data, len);
+ }
+
+ inline void Assign(const char* b, const char* e) {
+ Assign(b, e - b);
+ }
+
inline char* Data() noexcept {
- return Data_;
- }
-
+ return Data_;
+ }
+
inline const char* Data() const noexcept {
- return Data_;
- }
-
+ return Data_;
+ }
+
inline char* Pos() noexcept {
- return Data_ + Pos_;
- }
+ return Data_ + Pos_;
+ }
inline const char* Pos() const noexcept {
- return Data_ + Pos_;
- }
+ return Data_ + Pos_;
+ }
- /// Used space in bytes (do not mix with Capacity!)
+ /// Used space in bytes (do not mix with Capacity!)
inline size_t Size() const noexcept {
- return Pos_;
- }
-
- Y_PURE_FUNCTION inline bool Empty() const noexcept {
- return !Size();
- }
-
+ return Pos_;
+ }
+
+ Y_PURE_FUNCTION inline bool Empty() const noexcept {
+ return !Size();
+ }
+
inline explicit operator bool() const noexcept {
- return Size();
- }
+ return Size();
+ }
inline size_t Avail() const noexcept {
- return Len_ - Pos_;
- }
-
+ return Len_ - Pos_;
+ }
+
void Append(const char* buf, size_t len);
-
- inline void Append(const char* b, const char* e) {
- Append(b, e - b);
- }
-
- inline void Append(char ch) {
- if (Len_ == Pos_) {
- Reserve(Len_ + 1);
+
+ inline void Append(const char* b, const char* e) {
+ Append(b, e - b);
+ }
+
+ inline void Append(char ch) {
+ if (Len_ == Pos_) {
+ Reserve(Len_ + 1);
}
-
- *(Data() + Pos_++) = ch;
- }
-
+
+ *(Data() + Pos_++) = ch;
+ }
+
void Fill(char ch, size_t len);
- // Method is useful when first messages from buffer are processed, and
- // the last message in buffer is incomplete, so we need to move partial
- // message to the begin of the buffer and continue filling the buffer
- // from the network.
+ // Method is useful when first messages from buffer are processed, and
+ // the last message in buffer is incomplete, so we need to move partial
+ // message to the begin of the buffer and continue filling the buffer
+ // from the network.
inline void Chop(size_t pos, size_t count) {
const auto end = pos + count;
Y_ASSERT(end <= Pos_);
-
- if (count == 0) {
- return;
- } else if (count == Pos_) {
- Pos_ = 0;
- } else {
+
+ if (count == 0) {
+ return;
+ } else if (count == Pos_) {
+ Pos_ = 0;
+ } else {
memmove(Data_ + pos, Data_ + end, Pos_ - end);
Pos_ -= count;
}
- }
+ }
inline void ChopHead(size_t count) {
Chop(0U, count);
}
- inline void Proceed(size_t pos) {
+ inline void Proceed(size_t pos) {
//Y_ASSERT(pos <= Len_); // see discussion in REVIEW:29021
- Resize(pos);
- }
-
- inline void Advance(size_t len) {
+ Resize(pos);
+ }
+
+ inline void Advance(size_t len) {
Resize(Pos_ + len);
- }
+ }
- inline void Reserve(size_t len) {
- if (len > Len_) {
- DoReserve(len);
+ inline void Reserve(size_t len) {
+ if (len > Len_) {
+ DoReserve(len);
}
- }
-
+ }
+
inline void ReserveExactNeverCallMeInSaneCode(size_t len) {
if (len > Len_) {
Realloc(len);
}
}
- inline void ShrinkToFit() {
- if (Pos_ < Len_) {
- Realloc(Pos_);
+ inline void ShrinkToFit() {
+ if (Pos_ < Len_) {
+ Realloc(Pos_);
}
- }
+ }
- inline void Resize(size_t len) {
- Reserve(len);
- Pos_ = len;
- }
+ inline void Resize(size_t len) {
+ Reserve(len);
+ Pos_ = len;
+ }
// Method works like Resize, but allocates exact specified number of bytes
// rather than rounded up to next power of 2
@@ -171,15 +171,15 @@ public:
}
inline size_t Capacity() const noexcept {
- return Len_;
- }
-
- inline void AlignUp(size_t align, char fillChar = '\0') {
- size_t diff = ::AlignUp(Pos_, align) - Pos_;
- while (diff-- > 0) {
- Append(fillChar);
- }
- }
+ return Len_;
+ }
+
+ inline void AlignUp(size_t align, char fillChar = '\0') {
+ size_t diff = ::AlignUp(Pos_, align) - Pos_;
+ while (diff-- > 0) {
+ Append(fillChar);
+ }
+ }
inline char* data() noexcept {
return Data();
@@ -194,35 +194,35 @@ public:
}
inline void Swap(TBuffer& r) noexcept {
- DoSwap(Data_, r.Data_);
- DoSwap(Len_, r.Len_);
- DoSwap(Pos_, r.Pos_);
- }
-
- /*
- * after this call buffer becomes empty
- */
+ DoSwap(Data_, r.Data_);
+ DoSwap(Len_, r.Len_);
+ DoSwap(Pos_, r.Pos_);
+ }
+
+ /*
+ * after this call buffer becomes empty
+ */
void AsString(TString& s);
-
- /*
- * iterator-like interface
- */
+
+ /*
+ * iterator-like interface
+ */
inline TIterator Begin() noexcept {
- return Data();
- }
-
+ return Data();
+ }
+
inline TIterator End() noexcept {
- return Begin() + Size();
- }
-
+ return Begin() + Size();
+ }
+
inline TConstIterator Begin() const noexcept {
- return Data();
- }
-
+ return Data();
+ }
+
inline TConstIterator End() const noexcept {
- return Begin() + Size();
- }
-
+ return Begin() + Size();
+ }
+
bool operator==(const TBuffer& other) const noexcept {
if (Empty()) {
return other.Empty();
@@ -234,12 +234,12 @@ public:
return !(*this == other);
}
-private:
- void DoReserve(size_t len);
- void Realloc(size_t len);
-
-private:
- char* Data_;
- size_t Len_;
- size_t Pos_;
-};
+private:
+ void DoReserve(size_t len);
+ void Realloc(size_t len);
+
+private:
+ char* Data_;
+ size_t Len_;
+ size_t Pos_;
+};