rippled
Loading...
Searching...
No Matches
Slice.cpp
1#include <xrpl/basics/Slice.h>
2
3#include <gtest/gtest.h>
4
5#include <array>
6#include <cstdint>
7
8using namespace xrpl;
9
10static std::uint8_t const data[] = {
11 0xa8, 0xa1, 0x38, 0x45, 0x23, 0xec, 0xe4, 0x23, 0x71, 0x6d, 0x2a,
12 0x18, 0xb4, 0x70, 0xcb, 0xf5, 0xac, 0x2d, 0x89, 0x4d, 0x19, 0x9c,
13 0xf0, 0x2c, 0x15, 0xd1, 0xf9, 0x9b, 0x66, 0xd2, 0x30, 0xd3};
14
15TEST(Slice, equality_and_inequality)
16{
17 Slice const s0{};
18
19 EXPECT_EQ(s0.size(), 0);
20 EXPECT_EQ(s0.data(), nullptr);
21 EXPECT_EQ(s0, s0);
22
23 // Test slices of equal and unequal size pointing to same data:
24 for (std::size_t i = 0; i != sizeof(data); ++i)
25 {
26 Slice const s1{data, i};
27
28 EXPECT_EQ(s1.size(), i);
29 EXPECT_NE(s1.data(), nullptr);
30
31 if (i == 0)
32 EXPECT_EQ(s1, s0);
33 else
34 EXPECT_NE(s1, s0);
35
36 for (std::size_t j = 0; j != sizeof(data); ++j)
37 {
38 Slice const s2{data, j};
39
40 if (i == j)
41 EXPECT_EQ(s1, s2);
42 else
43 EXPECT_NE(s1, s2);
44 }
45 }
46
47 // Test slices of equal size but pointing to different data:
48 std::array<std::uint8_t, sizeof(data)> a;
49 std::array<std::uint8_t, sizeof(data)> b;
50
51 for (std::size_t i = 0; i != sizeof(data); ++i)
52 a[i] = b[i] = data[i];
53
54 EXPECT_EQ(makeSlice(a), makeSlice(b));
55 b[7]++;
56 EXPECT_NE(makeSlice(a), makeSlice(b));
57 a[7]++;
58 EXPECT_EQ(makeSlice(a), makeSlice(b));
59}
60
61TEST(Slice, indexing)
62{
63 Slice const s{data, sizeof(data)};
64
65 for (std::size_t i = 0; i != sizeof(data); ++i)
66 EXPECT_EQ(s[i], data[i]);
67}
68
69TEST(Slice, advancing)
70{
71 for (std::size_t i = 0; i < sizeof(data); ++i)
72 {
73 for (std::size_t j = 0; i + j < sizeof(data); ++j)
74 {
75 Slice s(data + i, sizeof(data) - i);
76 s += j;
77
78 EXPECT_EQ(s.data(), data + i + j);
79 EXPECT_EQ(s.size(), sizeof(data) - i - j);
80 }
81 }
82}
An immutable linear range of bytes.
Definition Slice.h:27
auto const data
General field definitions, or fields used in multiple transaction namespaces.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition algorithm.h:6
std::enable_if_t< std::is_same< T, char >::value||std::is_same< T, unsigned char >::value, Slice > makeSlice(std::array< T, N > const &a)
Definition Slice.h:225