添加log日志组成形式说明

andrewbytecoder · andrewbytecoder · commit 3aa45c668b93 · 2024-04-23T20:01:09.000+08:00
diff --git a/demo/test.cpp b/demo/test.cpp
@@ -31,31 +31,50 @@
 using namespace std;
 
 
-#include <iostream>
-#include <fstream>
-#include <filesystem>
-#include <string>
+struct ConsumptionOffset {
+    std::map<TopicName, std::map<PatitionNo, Offset>> consumeOffsets;   // 单个消费者组偏移量信息
+};
+
+struct ConsumerInfo {
+    std::map<TopicName, std::vector<partitionNo>>  consumerTopics; // 消费主题信息
+    uint64_t    arbVersion; //< 消费者仲裁版本号
+}
 
-enum class MyEnum : int32_t {
-    VALUE1,
-    VALUE2,
-    VALUE3
+struct ConsumerCoordinatorInfo {
+    std::map<ConsumerInstanceId, ConsumerInfo> consumerCoordinatorResults; //< 消费协调结果
 };
 
+class ConsumerCoordinator {
+public:
+    ConsumerCoordinator(std::string &groupId, ConsumerCoordinatorInfo &consumerCoordinatorInfo) {}
+    // 新增消费者
+    int32_t AddConsumer();
+    // 减少消费者
+    int32_t DeleteConsumer();
+    // 网络中断
+    int32_t NetworkDisconnected();
 
 
-void Show(int32_t data) {}
 
-int main() {
+private:
+    std::string m_groupId; //< 消费者组 uuid
+    ConsumerCoordinatorInfo m_consumerInfo; //<  消费者实例id <==> 消费者实例消费分配方案
 
-    std::vector<char> data;
+};
+
+
+class ConsumerCoordinatorOffsetMng {
+public:
+    uint64_t GetOffset(std::string& groupId, std::string& topicName, int32_t partitionNo) { }
+
+private:
+    std::map<GroupId, ConsumptionOffset>  m_consumerrCoordinatorOffset; //< GroupId <==> ConsumerCoordinatorOffset
+};
 
-    data.reserve(1000);
-    data.insert(data.end(),)
 
 
+int main() {
 
 
-    std::cout << "All files moved successfully." << std::endl;
     return 0;
 }
diff --git a/doc/db/table_format.adoc b/doc/db/table_format.adoc
@@ -74,10 +74,10 @@ the BlockHandle of the metaindex and index blocks as well as a magic number.
                                        // (40==2*BlockHandle::kMaxEncodedLength)
         magic:            fixed64;     // == 0xdb4775248b80fb57 (little-endian)
 
-## "filter" Meta Block
+=== "filter" Meta Block
 
 If a `FilterPolicy` was specified when the database was opened, a
-filter block is stored in each table.  The "metaindex" block contains
+filter block is stored in each table.The "metaindex" block contains
 an entry that maps from `filter.<N>` to the BlockHandle for the filter
 block where `<N>` is the string returned by the filter policy's
 `Name()` method.
@@ -88,7 +88,7 @@ in a block whose file offset falls within the range
 
     [ i*base ... (i+1)*base-1 ]
 
-Currently, "base" is 2KB.  So for example, if blocks X and Y start in
+Currently, "base" is 2KB.So for example, if blocks X and Y start in
 the range `[ 0KB .. 2KB-1 ]`, all of the keys in X and Y will be
 converted to a filter by calling `FilterPolicy::CreateFilter()`, and the
 resulting filter will be stored as the first filter in the filter
@@ -114,10 +114,10 @@ The filter block is formatted as follows:
 The offset array at the end of the filter block allows efficient
 mapping from a data block offset to the corresponding filter.
 
-## "stats" Meta Block
+=== "stats" Meta Block
 
-This meta block contains a bunch of stats.  The key is the name
-of the statistic.  The value contains the statistic.
+This meta block contains a bunch of stats.The key is the name
+of the statistic.The value contains the statistic.
 
 TODO(postrelease): record following stats.
 
diff --git a/doc/instruction/readme.adoc b/doc/instruction/readme.adoc
@@ -227,21 +227,14 @@ db->Put(write_options, ...);
 
 === 并发
 
-A database may only be opened by one process at a time. The leveldb
-implementation acquires a lock from the operating system to prevent misuse.
-Within a single process, the same `leveldb::DB` object may be safely shared by
-multiple concurrent threads. I.e., different threads may write into or fetch
-iterators or call Get on the same database without any external synchronization
-(the leveldb implementation will automatically do the required synchronization).
-However other objects (like Iterator and `WriteBatch`) may require external
-synchronization. If two threads share such an object, they must protect access
-to it using their own locking protocol. More details are available in the public
-header files.
+一个数据库在同一时刻只能被一个进程打开。LevelDB 通过从操作系统获取锁来防止误用。
+在单个进程中，同一个 `leveldb::DB` 对象可以被多个并发线程安全地共享。也就是说，不同的线程可以无需任何外部同步（LevelDB 实现将自动完成所需同步）地对同一数据库进行写入、获取迭代器或调用 Get 方法。
+
+然而，其他对象（如 Iterator 和 `WriteBatch`）可能需要外部同步。如果两个线程共享这样的对象，它们必须使用自己的锁定协议来保护对该对象的访问。更多详情可在公共头文件中找到。
 
 === Iteration
 
-The following example demonstrates how to print all key,value pairs in a
-database.
+下面的示例演示了如何使用迭代器打印数据库中所有的key和value
 
 ```c++
 leveldb::Iterator* it = db->NewIterator(leveldb::ReadOptions());
@@ -619,3 +612,14 @@ documents:
 2. [Format of an immutable Table file](table_format.md)
 3. [Format of a log file](log_format.md)
 
+
+
+1. 消费组中消费实例的加入和退出
+2. 消费者协调器对消费实例主题分区的动态调整
+3. 消费偏移量的管理
+4. mc集群成员的变更处理
+
+
+
+
+
diff --git a/doc/persistence/log_format.adoc b/doc/persistence/log_format.adoc
@@ -23,9 +23,8 @@ ifndef::rootpath[]
 endif::rootpath[]
 
 
+== leveldb Log format
 
-leveldb Log format
-==================
 The log file contents are a sequence of 32KB blocks.  The only exception is that
 the tail of the file may contain a partial block.
 
@@ -80,7 +79,7 @@ bytes free in the third block, which will be left empty as the trailer.
 
 
 
-## Some benefits over the recordio format:
+=== Some benefits over the recordio format:
 
 1. We do not need any heuristics for resyncing - just go to next block boundary
    and scan.  If there is a corruption, skip to the next block.  As a
@@ -92,7 +91,7 @@ bytes free in the third block, which will be left empty as the trailer.
 
 3. We do not need extra buffering for large records.
 
-## Some downsides compared to recordio format:
+=== Some downsides compared to recordio format:
 
 1. No packing of tiny records.  This could be fixed by adding a new record type,
    so it is a shortcoming of the current implementation, not necessarily the
diff --git a/doc/utils/c++_common_knowledge.adoc b/doc/utils/c++_common_knowledge.adoc
@@ -59,7 +59,7 @@ struct sql {
 aligned_storage是C++标准库中的一个模板类，定义在<type_traits>头文件中。它提供了一种用于按照指定对齐要求分配内存的机制。
 
 aligned_storage模板类的定义如下：
-[souece, cpp]
+[source, cpp]
 ----
 template <std::size_t Len, std::size_t Align>
 struct aligned_storage;
