From c6aa29b6fdba1606bfd218b17de89f64179c0ed8 Mon Sep 17 00:00:00 2001
From: Erik Arvstedt <erik.arvstedt@gmail.com>
Date: Sat, 15 Jul 2023 11:29:09 +0200
Subject: [PATCH] SinglyLinkedList: rename `invert` -> `reverse`

---
 lib/std/linked_list.zig | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/lib/std/linked_list.zig b/lib/std/linked_list.zig
index 3b9ff4cfcd..e91d144c51 100644
--- a/lib/std/linked_list.zig
+++ b/lib/std/linked_list.zig
@@ -62,9 +62,9 @@ pub fn SinglyLinkedList(comptime T: type) type {
                 return count;
             }
 
-            /// Invert the list starting from this node in-place.
+            /// Reverse the list starting from this node in-place.
             /// This operation is O(N).
-            pub fn invert(indirect: *?*Node) void {
+            pub fn reverse(indirect: *?*Node) void {
                 if (indirect.* == null) {
                     return;
                 }
@@ -164,7 +164,7 @@ test "basic SinglyLinkedList test" {
     try testing.expect(list.first.?.next.?.data == 4);
     try testing.expect(list.first.?.next.?.next == null);
 
-    L.Node.invert(&list.first);
+    L.Node.reverse(&list.first);
 
     try testing.expect(list.first.?.data == 4);
     try testing.expect(list.first.?.next.?.data == 2);