mirror of
https://github.com/nodejs/node.git
synced 2025-05-19 02:54:19 +00:00
edd537ca2f
PR-URL: https://github.com/nodejs/node/pull/45230 Reviewed-By: Jiawen Geng <technicalcute@gmail.com> Reviewed-By: Yagiz Nizipli <yagiz@nizipli.com>
40 lines
1.1 KiB
C++
40 lines
1.1 KiB
C++
// Copyright 2020 The Chromium Authors
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "span.h"
|
|
|
|
#include <algorithm>
|
|
|
|
namespace v8_crdtp {
|
|
|
|
bool SpanLessThan(span<uint8_t> x, span<uint8_t> y) noexcept {
|
|
auto min_size = std::min(x.size(), y.size());
|
|
const int r = min_size == 0 ? 0 : memcmp(x.data(), y.data(), min_size);
|
|
return (r < 0) || (r == 0 && x.size() < y.size());
|
|
}
|
|
|
|
bool SpanEquals(span<uint8_t> x, span<uint8_t> y) noexcept {
|
|
auto len = x.size();
|
|
if (len != y.size())
|
|
return false;
|
|
return x.data() == y.data() || len == 0 ||
|
|
std::memcmp(x.data(), y.data(), len) == 0;
|
|
}
|
|
|
|
bool SpanLessThan(span<char> x, span<char> y) noexcept {
|
|
auto min_size = std::min(x.size(), y.size());
|
|
const int r = min_size == 0 ? 0 : memcmp(x.data(), y.data(), min_size);
|
|
return (r < 0) || (r == 0 && x.size() < y.size());
|
|
}
|
|
|
|
bool SpanEquals(span<char> x, span<char> y) noexcept {
|
|
auto len = x.size();
|
|
if (len != y.size())
|
|
return false;
|
|
return x.data() == y.data() || len == 0 ||
|
|
std::memcmp(x.data(), y.data(), len) == 0;
|
|
}
|
|
|
|
} // namespace v8_crdtp
|