mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-17 21:24:28 +00:00
46 lines
1.3 KiB
C++
46 lines
1.3 KiB
C++
#pragma once
|
|
|
|
#include <Core/Block.h>
|
|
#include <DataStreams/IRowInputStream.h>
|
|
#include <Common/HashTable/HashMap.h>
|
|
|
|
|
|
namespace DB
|
|
{
|
|
|
|
class ReadBuffer;
|
|
|
|
|
|
/** Stream for reading data in TSKV format.
|
|
* TSKV is a very inefficient data format.
|
|
* Similar to TSV, but each field is written as key=value.
|
|
* Fields can be listed in any order (including, in different lines there may be different order),
|
|
* and some fields may be missing.
|
|
* An equal sign can be escaped in the field name.
|
|
* Also, as an additional element there may be a useless tskv fragment - it needs to be ignored.
|
|
*/
|
|
class TSKVRowInputStream : public IRowInputStream
|
|
{
|
|
public:
|
|
TSKVRowInputStream(ReadBuffer & istr_, const Block & header_, bool skip_unknown_);
|
|
|
|
bool read(MutableColumns & columns) override;
|
|
bool allowSyncAfterError() const override { return true; };
|
|
void syncAfterError() override;
|
|
|
|
private:
|
|
ReadBuffer & istr;
|
|
Block header;
|
|
/// Skip unknown fields.
|
|
bool skip_unknown;
|
|
|
|
/// Buffer for the read from the stream the field name. Used when you have to copy it.
|
|
String name_buf;
|
|
|
|
/// Hash table matching `field name -> position in the block`. NOTE You can use perfect hash map.
|
|
using NameMap = HashMap<StringRef, size_t, StringRefHash>;
|
|
NameMap name_map;
|
|
};
|
|
|
|
}
|