You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
3.4 KiB
99 lines
3.4 KiB
// Copyright 2020 The Pigweed Authors
|
|
//
|
|
// Licensed 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
|
|
//
|
|
// https://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 "pw_bytes/array.h"
|
|
|
|
#include <array>
|
|
#include <cstddef>
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
namespace pw::bytes {
|
|
namespace {
|
|
|
|
using std::byte;
|
|
|
|
template <typename T, typename U>
|
|
constexpr bool Equal(const T& lhs, const U& rhs) {
|
|
if (sizeof(lhs) != sizeof(rhs) || std::size(lhs) != std::size(rhs)) {
|
|
return false;
|
|
}
|
|
|
|
for (size_t i = 0; i < std::size(lhs); ++i) {
|
|
if (lhs[i] != rhs[i]) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
constexpr std::array<byte, 5> kHello{
|
|
byte{'H'}, byte{'e'}, byte{'l'}, byte{'l'}, byte{'o'}};
|
|
|
|
constexpr uint32_t kEllo =
|
|
static_cast<uint32_t>('e') << 0 | static_cast<uint32_t>('l') << 8 |
|
|
static_cast<uint32_t>('l') << 16 | static_cast<uint32_t>('o') << 24;
|
|
|
|
static_assert(Equal(String("Hello"), kHello));
|
|
static_assert(Equal(String(""), std::array<byte, 0>{}));
|
|
static_assert(Equal(MakeArray('H', 'e', 'l', 'l', 'o'), kHello));
|
|
static_assert(Equal(Concat('H', kEllo), kHello));
|
|
|
|
constexpr std::array<byte, 3> kInit{byte{'?'}, byte{'?'}, byte{'?'}};
|
|
static_assert(Equal(Initialized<3>('?'), kInit));
|
|
|
|
constexpr std::array<byte, 3> kCounting = MakeArray(0, 1, 2);
|
|
static_assert(Equal(Initialized<3>([](size_t i) { return i; }), kCounting));
|
|
|
|
constexpr std::array<byte, 3> kCounting2 = MakeArray(256, 1, 2);
|
|
static_assert(Equal(Initialized<3>([](size_t i) { return i; }), kCounting2));
|
|
|
|
constexpr auto kArray = Array<1, 2, 3, 255>();
|
|
static_assert(Equal(MakeArray(1, 2, 3, 255), kArray));
|
|
|
|
constexpr std::array<uint8_t, 4> kUintArray = Array<uint8_t, 1, 2, 3, 255>();
|
|
static_assert(Equal(MakeArray<uint8_t>(1, 2, 3, 255), kUintArray));
|
|
|
|
// Create a byte array with bytes::Concat and bytes::String and check that its
|
|
// contents are correct.
|
|
constexpr std::array<char, 2> kTestArray = {'a', 'b'};
|
|
|
|
constexpr auto kConcatTest = bytes::Concat('a',
|
|
uint16_t(1),
|
|
uint8_t(23),
|
|
kTestArray,
|
|
bytes::String("c"),
|
|
uint64_t(-1));
|
|
|
|
static_assert(kConcatTest.size() == 15);
|
|
static_assert(kConcatTest[0] == byte{'a'});
|
|
static_assert(kConcatTest[1] == byte{1});
|
|
static_assert(kConcatTest[2] == byte{0});
|
|
static_assert(kConcatTest[3] == byte{23});
|
|
static_assert(kConcatTest[4] == byte{'a'});
|
|
static_assert(kConcatTest[5] == byte{'b'});
|
|
static_assert(kConcatTest[6] == byte{'c'});
|
|
static_assert(kConcatTest[7] == byte{0xff});
|
|
static_assert(kConcatTest[8] == byte{0xff});
|
|
static_assert(kConcatTest[9] == byte{0xff});
|
|
static_assert(kConcatTest[10] == byte{0xff});
|
|
static_assert(kConcatTest[11] == byte{0xff});
|
|
static_assert(kConcatTest[12] == byte{0xff});
|
|
static_assert(kConcatTest[13] == byte{0xff});
|
|
static_assert(kConcatTest[14] == byte{0xff});
|
|
|
|
} // namespace
|
|
} // namespace pw::bytes
|