RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-28 02:47:34 +00:00
Code Issues Activity Actions

Everywhere: Run clang-format

Browse source
This commit is contained in:
Idan Horowitz 2022-04-01 20:58:27 +03:00 • committed by Linus Groh
parent 0376c127f6
commit 086969277e
1665 changed files with 8479 additions and 8479 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Tests/AK/TestArray.cpp
View file

@ -8,7 +8,7 @@
#include <AK/Array.h>
static constexpr int constexpr_sum(const Span<const int> span)
static constexpr int constexpr_sum(Span<int const> const span)
{
int sum = 0;
for (auto value : span)

4
Tests/AK/TestBase64.cpp
View file

@ -12,7 +12,7 @@
TEST_CASE(test_decode)
{
auto decode_equal = [&](const char* input, const char* expected) {
auto decode_equal = [&](char const* input, char const* expected) {
auto decoded_option = decode_base64(StringView(input));
EXPECT(!decoded_option.is_error());
auto decoded = decoded_option.release_value();
@ -41,7 +41,7 @@ TEST_CASE(test_decode_invalid)
TEST_CASE(test_encode)
{
auto encode_equal = [&](const char* input, const char* expected) {
auto encode_equal = [&](char const* input, char const* expected) {
auto encoded = encode_base64({ input, strlen(input) });
EXPECT(encoded == String(expected));
EXPECT_EQ(StringView(expected).length(), calculate_base64_encoded_length(StringView(input).bytes()));

4
Tests/AK/TestBinarySearch.cpp
View file

@ -54,7 +54,7 @@ TEST_CASE(vector_strings)
strings.append("cat");
strings.append("dog");
auto string_compare = [](const String& a, const String& b) -> int {
auto string_compare = [](String const& a, String const& b) -> int {
return strcmp(a.characters(), b.characters());
};
auto test1 = *binary_search(strings, String("bat"), nullptr, string_compare);
@ -108,7 +108,7 @@ TEST_CASE(constexpr_array_search)
TEST_CASE(unsigned_to_signed_regression)
{
const Array<u32, 5> input { 0, 1, 2, 3, 4 };
Array<u32, 5> const input { 0, 1, 2, 3, 4 };
// The algorithm computes 1 - input[2] = -1, and if this is (incorrectly) cast
// to an unsigned then it will look in the wrong direction and miss the 1.

2
Tests/AK/TestBitmap.cpp
View file

@ -216,7 +216,7 @@ TEST_CASE(count_in_range)
bitmap.set(i, true);
}
auto count_bits_slow = [](const Bitmap& b, size_t start, size_t len, bool value) -> size_t {
auto count_bits_slow = [](Bitmap const& b, size_t start, size_t len, bool value) -> size_t {
size_t count = 0;
for (size_t i = start; i < start + len; i++) {
if (b.get(i) == value)

2
Tests/AK/TestDoublyLinkedList.cpp
View file

@ -35,7 +35,7 @@ TEST_CASE(should_find_mutable)
TEST_CASE(should_find_const)
{
const auto sut = make_list();
auto const sut = make_list();
EXPECT_EQ(4, *sut.find(4));

6
Tests/AK/TestFormat.cpp
View file

@ -14,7 +14,7 @@
TEST_CASE(is_integral_works_properly)
{
EXPECT(!IsIntegral<const char*>);
EXPECT(!IsIntegral<char const*>);
EXPECT(IsIntegral<unsigned long>);
}
@ -186,7 +186,7 @@ TEST_CASE(ensure_that_format_works)
TEST_CASE(format_string_literal_as_pointer)
{
const char* literal = "abc";
char const* literal = "abc";
EXPECT_EQ(String::formatted("{:p}", literal), String::formatted("{:p}", reinterpret_cast<FlatPtr>(literal)));
}
@ -228,7 +228,7 @@ TEST_CASE(file_descriptor)
rewind(file);
Array<u8, 256> buffer;
const auto nread = fread(buffer.data(), 1, buffer.size(), file);
auto const nread = fread(buffer.data(), 1, buffer.size(), file);
EXPECT_EQ("Hello, World!\nfoobar\n"sv, StringView { buffer.span().trim(nread) });

8
Tests/AK/TestHashFunctions.cpp
View file

@ -42,14 +42,14 @@ TEST_CASE(ptr_hash)
EXPECT_EQ(ptr_hash(FlatPtr(42)), 2824066580u);
EXPECT_EQ(ptr_hash(FlatPtr(0)), 954888656u);
EXPECT_EQ(ptr_hash(reinterpret_cast<const void*>(42)), 2824066580u);
EXPECT_EQ(ptr_hash(reinterpret_cast<const void*>(0)), 954888656u);
EXPECT_EQ(ptr_hash(reinterpret_cast<void const*>(42)), 2824066580u);
EXPECT_EQ(ptr_hash(reinterpret_cast<void const*>(0)), 954888656u);
} else {
EXPECT_EQ(ptr_hash(FlatPtr(42)), 3564735745u);
EXPECT_EQ(ptr_hash(FlatPtr(0)), 1177991625u);
EXPECT_EQ(ptr_hash(reinterpret_cast<const void*>(42)), 3564735745u);
EXPECT_EQ(ptr_hash(reinterpret_cast<const void*>(0)), 1177991625u);
EXPECT_EQ(ptr_hash(reinterpret_cast<void const*>(42)), 3564735745u);
EXPECT_EQ(ptr_hash(reinterpret_cast<void const*>(0)), 1177991625u);
}
}

2
Tests/AK/TestHashMap.cpp
View file

@ -111,7 +111,7 @@ TEST_CASE(case_insensitive)
TEST_CASE(hashmap_of_nonnullownptr_get)
{
struct Object {
Object(const String& s)
Object(String const& s)
: string(s)
{
}

4
Tests/AK/TestHashTable.cpp
View file

@ -136,7 +136,7 @@ TEST_CASE(many_strings)
TEST_CASE(many_collisions)
{
struct StringCollisionTraits : public GenericTraits<String> {
static unsigned hash(const String&) { return 0; }
static unsigned hash(String const&) { return 0; }
};
HashTable<String, StringCollisionTraits> strings;
@ -158,7 +158,7 @@ TEST_CASE(many_collisions)
TEST_CASE(space_reuse)
{
struct StringCollisionTraits : public GenericTraits<String> {
static unsigned hash(const String&) { return 0; }
static unsigned hash(String const&) { return 0; }
};
HashTable<String, StringCollisionTraits> strings;

12
Tests/AK/TestIPv4Address.cpp
View file

@ -66,7 +66,7 @@ TEST_CASE(should_convert_to_string)
TEST_CASE(should_make_ipv4_address_from_string)
{
const auto addr = IPv4Address::from_string("192.168.0.1");
auto const addr = IPv4Address::from_string("192.168.0.1");
EXPECT(addr.has_value());
EXPECT_EQ(192, addr.value()[0]);
@ -77,21 +77,21 @@ TEST_CASE(should_make_ipv4_address_from_string)
TEST_CASE(should_make_empty_optional_from_bad_string)
{
const auto addr = IPv4Address::from_string("bad string");
auto const addr = IPv4Address::from_string("bad string");
EXPECT(!addr.has_value());
}
TEST_CASE(should_make_empty_optional_from_out_of_range_values)
{
const auto addr = IPv4Address::from_string("192.168.0.500");
auto const addr = IPv4Address::from_string("192.168.0.500");
EXPECT(!addr.has_value());
}
TEST_CASE(should_fill_d_octet_from_1_part)
{
const auto addr = IPv4Address::from_string("1");
auto const addr = IPv4Address::from_string("1");
EXPECT(addr.has_value());
EXPECT_EQ(0, addr.value()[0]);
@ -102,7 +102,7 @@ TEST_CASE(should_fill_d_octet_from_1_part)
TEST_CASE(should_fill_a_and_d_octets_from_2_parts)
{
const auto addr = IPv4Address::from_string("192.1");
auto const addr = IPv4Address::from_string("192.1");
EXPECT(addr.has_value());
EXPECT_EQ(192, addr.value()[0]);
@ -113,7 +113,7 @@ TEST_CASE(should_fill_a_and_d_octets_from_2_parts)
TEST_CASE(should_fill_a_b_d_octets_from_3_parts)
{
const auto addr = IPv4Address::from_string("192.168.1");
auto const addr = IPv4Address::from_string("192.168.1");
EXPECT(addr.has_value());
EXPECT_EQ(192, addr.value()[0]);

4
Tests/AK/TestJSON.cpp
View file

@ -46,7 +46,7 @@ TEST_CASE(load_form)
auto widgets = form_json.as_object().get("widgets").as_array();
widgets.for_each([&](const JsonValue& widget_value) {
widgets.for_each([&](JsonValue const& widget_value) {
auto& widget_object = widget_value.as_object();
auto widget_class = widget_object.get("class").as_string();
widget_object.for_each_member([&]([[maybe_unused]] auto& property_name, [[maybe_unused]] const JsonValue& property_value) {
@ -87,7 +87,7 @@ TEST_CASE(json_utf8_multibyte)
{
auto json_or_error = JsonValue::from_string("\"š\"");
EXPECT_EQ(json_or_error.is_error(), false);
auto& json = json_or_error.value();
EXPECT_EQ(json.type(), JsonValue::Type::String);
EXPECT_EQ(json.as_string().is_null(), false);

8
Tests/AK/TestMACAddress.cpp
View file

@ -85,7 +85,7 @@ TEST_CASE(should_string_format)
TEST_CASE(should_make_mac_address_from_string_numbers)
{
const auto sut = MACAddress::from_string("01:02:03:04:05:06");
auto const sut = MACAddress::from_string("01:02:03:04:05:06");
EXPECT(sut.has_value());
EXPECT_EQ(1, sut.value()[0]);
@ -98,7 +98,7 @@ TEST_CASE(should_make_mac_address_from_string_numbers)
TEST_CASE(should_make_mac_address_from_string_letters)
{
const auto sut = MACAddress::from_string("de:ad:be:ee:ee:ef");
auto const sut = MACAddress::from_string("de:ad:be:ee:ee:ef");
EXPECT(sut.has_value());
EXPECT_EQ(u8 { 0xDE }, sut.value()[0]);
@ -111,14 +111,14 @@ TEST_CASE(should_make_mac_address_from_string_letters)
TEST_CASE(should_make_empty_optional_from_bad_string)
{
const auto sut = MACAddress::from_string("bad string");
auto const sut = MACAddress::from_string("bad string");
EXPECT(!sut.has_value());
}
TEST_CASE(should_make_empty_optional_from_out_of_range_values)
{
const auto sut = MACAddress::from_string("de:ad:be:ee:ee:fz");
auto const sut = MACAddress::from_string("de:ad:be:ee:ee:fz");
EXPECT(!sut.has_value());
}

14
Tests/AK/TestMemoryStream.cpp
View file

@ -63,7 +63,7 @@ TEST_CASE(recoverable_error)
TEST_CASE(chain_stream_operator)
{
const Array<u8, 4> expected { 0, 1, 2, 3 };
Array<u8, 4> const expected { 0, 1, 2, 3 };
Array<u8, 4> actual;
InputMemoryStream stream { expected };
@ -76,10 +76,10 @@ TEST_CASE(chain_stream_operator)
TEST_CASE(seeking_slicing_offset)
{
const Array<u8, 8> input { 0, 1, 2, 3, 4, 5, 6, 7 };
const Array<u8, 4> expected0 { 0, 1, 2, 3 };
const Array<u8, 4> expected1 { 4, 5, 6, 7 };
const Array<u8, 4> expected2 { 1, 2, 3, 4 };
Array<u8, 8> const input { 0, 1, 2, 3, 4, 5, 6, 7 };
Array<u8, 4> const expected0 { 0, 1, 2, 3 };
Array<u8, 4> const expected1 { 4, 5, 6, 7 };
Array<u8, 4> const expected2 { 1, 2, 3, 4 };
Array<u8, 4> actual0 {}, actual1 {}, actual2 {};
@ -140,7 +140,7 @@ TEST_CASE(duplex_large_buffer)
TEST_CASE(read_endian_values)
{
const Array<u8, 8> input { 0, 1, 2, 3, 4, 5, 6, 7 };
Array<u8, 8> const input { 0, 1, 2, 3, 4, 5, 6, 7 };
InputMemoryStream stream { input };
LittleEndian<u32> value1;
@ -153,7 +153,7 @@ TEST_CASE(read_endian_values)
TEST_CASE(write_endian_values)
{
const Array<u8, 8> expected { 4, 3, 2, 1, 1, 2, 3, 4 };
Array<u8, 8> const expected { 4, 3, 2, 1, 1, 2, 3, 4 };
DuplexMemoryStream stream;
stream << LittleEndian<u32> { 0x01020304 } << BigEndian<u32> { 0x01020304 };

2
Tests/AK/TestNeverDestroyed.cpp
View file

@ -14,7 +14,7 @@ struct Counter {
~Counter() { ++num_destroys; }
Counter(const Counter&)
Counter(Counter const&)
{
++num_copies;
}

4
Tests/AK/TestOptional.cpp
View file

@ -159,7 +159,7 @@ TEST_CASE(test_copy_ctor_and_dtor_called)
{
}
CopyChecker(const CopyChecker& other)
CopyChecker(CopyChecker const& other)
: m_was_copy_constructed(other.m_was_copy_constructed)
{
m_was_copy_constructed = true;
@ -182,7 +182,7 @@ TEST_CASE(test_copy_ctor_and_dtor_called)
{
}
MoveChecker(const MoveChecker& other)
MoveChecker(MoveChecker const& other)
: m_was_move_constructed(other.m_was_move_constructed)
{
EXPECT(false);

4
Tests/AK/TestQuickSort.cpp
View file

@ -50,7 +50,7 @@ TEST_CASE(sorts_without_copy)
// So it provides no strong guarantees about the properties of quick_sort.
TEST_CASE(maximum_stack_depth)
{
const int size = 256;
int const size = 256;
int* data = new int[size];
for (int i = 0; i < size; i++) {
@ -72,7 +72,7 @@ TEST_CASE(maximum_stack_depth)
: max_depth(max_depth)
{
}
DepthMeasurer(const DepthMeasurer& obj)
DepthMeasurer(DepthMeasurer const& obj)
: max_depth(obj.max_depth)
{
depth = obj.depth + 1;

12
Tests/AK/TestSinglyLinkedList.cpp
View file

@ -37,14 +37,14 @@ TEST_CASE(should_find_mutable_with_predicate)
{
auto sut = make_list();
EXPECT_EQ(4, *sut.find_if([](const auto v) { return v == 4; }));
EXPECT_EQ(4, *sut.find_if([](auto const v) { return v == 4; }));
EXPECT_EQ(sut.end(), sut.find_if([](const auto v) { return v == 42; }));
EXPECT_EQ(sut.end(), sut.find_if([](auto const v) { return v == 42; }));
}
TEST_CASE(should_find_const)
{
const auto sut = make_list();
auto const sut = make_list();
EXPECT_EQ(4, *sut.find(4));
@ -53,11 +53,11 @@ TEST_CASE(should_find_const)
TEST_CASE(should_find_const_with_predicate)
{
const auto sut = make_list();
auto const sut = make_list();
EXPECT_EQ(4, *sut.find_if([](const auto v) { return v == 4; }));
EXPECT_EQ(4, *sut.find_if([](auto const v) { return v == 4; }));
EXPECT_EQ(sut.end(), sut.find_if([](const auto v) { return v == 42; }));
EXPECT_EQ(sut.end(), sut.find_if([](auto const v) { return v == 42; }));
}
TEST_CASE(removal_during_iteration)

2
Tests/AK/TestSourceLocation.cpp
View file

@ -18,7 +18,7 @@ TEST_CASE(basic_scenario)
EXPECT_EQ(StringView(__FILE__), location.filename());
}
static StringView test_default_arg(const SourceLocation& loc = SourceLocation::current())
static StringView test_default_arg(SourceLocation const& loc = SourceLocation::current())
{
return loc.function_name();
}

10
Tests/AK/TestSpan.cpp
View file

@ -115,23 +115,23 @@ TEST_CASE(span_from_void_pointer)
{
int value = 0;
[[maybe_unused]] Bytes bytes0 { reinterpret_cast<void*>(value), 4 };
[[maybe_unused]] ReadonlyBytes bytes1 { reinterpret_cast<const void*>(value), 4 };
[[maybe_unused]] ReadonlyBytes bytes1 { reinterpret_cast<void const*>(value), 4 };
}
TEST_CASE(span_from_c_string)
{
const char* str = "Serenity";
char const* str = "Serenity";
[[maybe_unused]] ReadonlyBytes bytes { str, strlen(str) };
}
TEST_CASE(starts_with)
{
const char* str = "HeyFriends!";
char const* str = "HeyFriends!";
ReadonlyBytes bytes { str, strlen(str) };
const char* str_hey = "Hey";
char const* str_hey = "Hey";
ReadonlyBytes hey_bytes { str_hey, strlen(str_hey) };
EXPECT(bytes.starts_with(hey_bytes));
const char* str_nah = "Nah";
char const* str_nah = "Nah";
ReadonlyBytes nah_bytes { str_nah, strlen(str_nah) };
EXPECT(!bytes.starts_with(nah_bytes));

2
Tests/AK/TestStringView.cpp
View file

@ -19,7 +19,7 @@ TEST_CASE(construct_empty)
TEST_CASE(view_literal)
{
const char* truth = "cats rule dogs drool";
char const* truth = "cats rule dogs drool";
StringView view(truth);
EXPECT_EQ(view.is_null(), false);
EXPECT_EQ(view.characters_without_null_termination(), truth);

4
Tests/AK/TestTuple.cpp
View file

@ -97,8 +97,8 @@ TEST_CASE(apply)
// With const reference, taken from a const tuple
{
bool was_called = false;
const auto& args_ref = args;
args_ref.apply_as_args([&](const int& a, const int& b, const String& c) {
auto const& args_ref = args;
args_ref.apply_as_args([&](int const& a, int const& b, String const& c) {
was_called = true;
EXPECT_EQ(a, 1);
EXPECT_EQ(b, 2);

2
Tests/AK/TestTypeTraits.cpp
View file

@ -220,7 +220,7 @@ TEST_CASE(IsConstructible)
};
EXPECT_VARIADIC_TRAIT_TRUE(IsConstructible, D, int);
EXPECT_VARIADIC_TRAIT_TRUE(IsConstructible, D, char);
EXPECT_VARIADIC_TRAIT_FALSE(IsConstructible, D, const char*);
EXPECT_VARIADIC_TRAIT_FALSE(IsConstructible, D, char const*);
EXPECT_VARIADIC_TRAIT_FALSE(IsConstructible, D, void);
}

4
Tests/AK/TestTypedTransfer.cpp
View file

@ -20,7 +20,7 @@ struct NonPrimitiveIntWrapper {
TEST_CASE(overlapping_source_and_destination_1)
{
const Array<NonPrimitiveIntWrapper, 6> expected { 3, 4, 5, 6, 5, 6 };
Array<NonPrimitiveIntWrapper, 6> const expected { 3, 4, 5, 6, 5, 6 };
Array<NonPrimitiveIntWrapper, 6> actual { 1, 2, 3, 4, 5, 6 };
AK::TypedTransfer<NonPrimitiveIntWrapper>::copy(actual.data(), actual.data() + 2, 4);
@ -31,7 +31,7 @@ TEST_CASE(overlapping_source_and_destination_1)
TEST_CASE(overlapping_source_and_destination_2)
{
const Array<NonPrimitiveIntWrapper, 6> expected { 1, 2, 1, 2, 3, 4 };
Array<NonPrimitiveIntWrapper, 6> const expected { 1, 2, 1, 2, 3, 4 };
Array<NonPrimitiveIntWrapper, 6> actual { 1, 2, 3, 4, 5, 6 };
AK::TypedTransfer<NonPrimitiveIntWrapper>::copy(actual.data() + 2, actual.data(), 4);

14
Tests/AK/TestVector.cpp
View file

@ -43,14 +43,14 @@ TEST_CASE(strings)
strings.append("DEF");
int loop_counter = 0;
for (const String& string : strings) {
for (String const& string : strings) {
EXPECT(!string.is_null());
EXPECT(!string.is_empty());
++loop_counter;
}
loop_counter = 0;
for (auto& string : (const_cast<const Vector<String>&>(strings))) {
for (auto& string : (const_cast<Vector<String> const&>(strings))) {
EXPECT(!string.is_null());
EXPECT(!string.is_empty());
++loop_counter;
@ -402,7 +402,7 @@ TEST_CASE(should_find_value)
{
Vector<int> v { 1, 2, 3, 4, 0, 6, 7, 8, 0, 0 };
const auto expected = v.begin() + 4;
auto const expected = v.begin() + 4;
EXPECT_EQ(expected, v.find(0));
}
@ -411,9 +411,9 @@ TEST_CASE(should_find_predicate)
{
Vector<int> v { 1, 2, 3, 4, 0, 6, 7, 8, 0, 0 };
const auto expected = v.begin() + 4;
auto const expected = v.begin() + 4;
EXPECT_EQ(expected, v.find_if([](const auto v) { return v == 0; }));
EXPECT_EQ(expected, v.find_if([](auto const v) { return v == 0; }));
}
TEST_CASE(should_find_index)
@ -548,8 +548,8 @@ TEST_CASE(rend)
{
Vector<int> v { 1, 2, 3, 4, 5, 6, 7, 8, 0 };
const auto expected = v.end() - 5;
const auto expected_in_reverse = v.rend() - 5;
auto const expected = v.end() - 5;
auto const expected_in_reverse = v.rend() - 5;
EXPECT_EQ(*expected, *expected_in_reverse);
}