1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/util/delimiting.h"
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/buffer.h"
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/util/logging.h"
namespace arrow20 {
BoundaryFinder::~BoundaryFinder() {}
namespace {
Status StraddlingTooLarge() {
return Status::Invalid(
"straddling object straddles two block boundaries (try to increase block size?)");
}
class NewlineBoundaryFinder : public BoundaryFinder {
public:
Status FindFirst(std::string_view partial, std::string_view block,
int64_t* out_pos) override {
auto pos = block.find_first_of(newline_delimiters);
if (pos == std::string_view::npos) {
*out_pos = kNoDelimiterFound;
} else {
auto end = block.find_first_not_of(newline_delimiters, pos);
if (end == std::string_view::npos) {
end = block.length();
}
*out_pos = static_cast<int64_t>(end);
}
return Status::OK();
}
Status FindLast(std::string_view block, int64_t* out_pos) override {
auto pos = block.find_last_of(newline_delimiters);
if (pos == std::string_view::npos) {
*out_pos = kNoDelimiterFound;
} else {
auto end = block.find_first_not_of(newline_delimiters, pos);
if (end == std::string_view::npos) {
end = block.length();
}
*out_pos = static_cast<int64_t>(end);
}
return Status::OK();
}
Status FindNth(std::string_view partial, std::string_view block, int64_t count,
int64_t* out_pos, int64_t* num_found) override {
DCHECK(partial.find_first_of(newline_delimiters) == std::string_view::npos);
int64_t found = 0;
int64_t pos = kNoDelimiterFound;
auto cur_pos = block.find_first_of(newline_delimiters);
while (cur_pos != std::string_view::npos) {
if (block[cur_pos] == '\r' && cur_pos + 1 < block.length() &&
block[cur_pos + 1] == '\n') {
cur_pos += 2;
} else {
++cur_pos;
}
pos = static_cast<int64_t>(cur_pos);
if (++found >= count) {
break;
}
cur_pos = block.find_first_of(newline_delimiters, cur_pos);
}
*out_pos = pos;
*num_found = found;
return Status::OK();
}
protected:
static constexpr const char* newline_delimiters = "\r\n";
};
} // namespace
std::shared_ptr<BoundaryFinder> MakeNewlineBoundaryFinder() {
return std::make_shared<NewlineBoundaryFinder>();
}
Chunker::~Chunker() {}
Chunker::Chunker(std::shared_ptr<BoundaryFinder> delimiter)
: boundary_finder_(delimiter) {}
Status Chunker::Process(std::shared_ptr<Buffer> block, std::shared_ptr<Buffer>* whole,
std::shared_ptr<Buffer>* partial) {
int64_t last_pos = -1;
RETURN_NOT_OK(boundary_finder_->FindLast(std::string_view(*block), &last_pos));
if (last_pos == BoundaryFinder::kNoDelimiterFound) {
// No delimiter found
*whole = SliceBuffer(block, 0, 0);
*partial = block;
return Status::OK();
} else {
*whole = SliceBuffer(block, 0, last_pos);
*partial = SliceBuffer(block, last_pos);
}
return Status::OK();
}
Status Chunker::ProcessWithPartial(std::shared_ptr<Buffer> partial,
std::shared_ptr<Buffer> block,
std::shared_ptr<Buffer>* completion,
std::shared_ptr<Buffer>* rest) {
if (partial->size() == 0) {
// If partial is empty, don't bother looking for completion
*completion = SliceBuffer(block, 0, 0);
*rest = block;
return Status::OK();
}
int64_t first_pos = -1;
RETURN_NOT_OK(boundary_finder_->FindFirst(std::string_view(*partial),
std::string_view(*block), &first_pos));
if (first_pos == BoundaryFinder::kNoDelimiterFound) {
// No delimiter in block => the current object is too large for block size
return StraddlingTooLarge();
} else {
*completion = SliceBuffer(block, 0, first_pos);
*rest = SliceBuffer(block, first_pos);
return Status::OK();
}
}
Status Chunker::ProcessFinal(std::shared_ptr<Buffer> partial,
std::shared_ptr<Buffer> block,
std::shared_ptr<Buffer>* completion,
std::shared_ptr<Buffer>* rest) {
if (partial->size() == 0) {
// If partial is empty, don't bother looking for completion
*completion = SliceBuffer(block, 0, 0);
*rest = block;
return Status::OK();
}
int64_t first_pos = -1;
RETURN_NOT_OK(boundary_finder_->FindFirst(std::string_view(*partial),
std::string_view(*block), &first_pos));
if (first_pos == BoundaryFinder::kNoDelimiterFound) {
// No delimiter in block => it's entirely a completion of partial
*completion = block;
*rest = SliceBuffer(std::move(block), 0, 0);
} else {
*completion = SliceBuffer(block, 0, first_pos);
*rest = SliceBuffer(std::move(block), first_pos);
}
return Status::OK();
}
Status Chunker::ProcessSkip(std::shared_ptr<Buffer> partial,
std::shared_ptr<Buffer> block, bool final, int64_t* count,
std::shared_ptr<Buffer>* rest) {
DCHECK_GT(*count, 0);
int64_t pos;
int64_t num_found;
ARROW_RETURN_NOT_OK(boundary_finder_->FindNth(
std::string_view(*partial), std::string_view(*block), *count, &pos, &num_found));
if (pos == BoundaryFinder::kNoDelimiterFound) {
return StraddlingTooLarge();
}
if (ARROW_PREDICT_FALSE(final && *count > num_found && block->size() != pos)) {
// Skip the last row in the final block which does not have a delimiter
++num_found;
*rest = SliceBuffer(std::move(block), 0, 0);
} else {
*rest = SliceBuffer(std::move(block), pos);
}
*count -= num_found;
return Status::OK();
}
} // namespace arrow20
|
