blob: 57d22806f969ddf9b54a47e91565f29c458e45c9 (
plain) (
blame)
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
|
// 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 <sstream>
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/compute/ordering.h"
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/util/unreachable.h"
namespace arrow20 {
namespace compute {
bool SortKey::Equals(const SortKey& other) const {
return target == other.target && order == other.order;
}
std::string SortKey::ToString() const {
std::stringstream ss;
ss << target.ToString() << ' ';
switch (order) {
case SortOrder::Ascending:
ss << "ASC";
break;
case SortOrder::Descending:
ss << "DESC";
break;
}
return ss.str();
}
bool Ordering::IsSuborderOf(const Ordering& other) const {
if (sort_keys_.empty()) {
// The implicit ordering is a subordering of nothing. The unordered ordering
// is a subordering of everything
return !is_implicit_;
}
if (null_placement_ != other.null_placement_) {
return false;
}
if (sort_keys_.size() > other.sort_keys_.size()) {
return false;
}
for (std::size_t key_idx = 0; key_idx < sort_keys_.size(); key_idx++) {
if (sort_keys_[key_idx] != other.sort_keys_[key_idx]) {
return false;
}
}
return true;
}
bool Ordering::Equals(const Ordering& other) const {
return null_placement_ == other.null_placement_ && sort_keys_ == other.sort_keys_;
}
std::string Ordering::ToString() const {
std::stringstream ss;
ss << "[";
bool first = true;
for (const auto& key : sort_keys_) {
if (first) {
first = false;
} else {
ss << ", ";
}
ss << key.ToString();
}
ss << "]";
switch (null_placement_) {
case NullPlacement::AtEnd:
ss << " nulls last";
break;
case NullPlacement::AtStart:
ss << " nulls first";
break;
default:
Unreachable();
}
return ss.str();
}
} // namespace compute
} // namespace arrow20
|
