Update contact infov1.2.2

5 files changed, 12 insertions, 2 deletions

diff --git a/LICENSE b/LICENSE
index e9cb698..cb8d63b 100644
--- a/LICENSE
+++ b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (C) 2025 by Rose Hogenson <rosehogenson@posteo.net>
+Copyright (C) 2025, 2026 by Rose Hogenson <r@roseh.moe>
 
 Permission to use, copy, modify, and/or distribute this software for
 any purpose with or without fee is hereby granted.
diff --git a/README.md b/README.md
index 65661f1..80b003b 100644
--- a/README.md
+++ b/README.md
@@ -7,3 +7,7 @@ Compared to other popular slice-backed deque implementations, this one
  - supports iterating using Go 1.23 iterators;
  - and steals Rust's clever strategy for minimizing the amount of data copied
    on reallocation.
+
+## Contact
+
+Please send inquiries or patches to \<r@roseh.moe\>
diff --git a/deque.go b/deque.go
index e8a9018..40a3d6f 100644
--- a/deque.go
+++ b/deque.go
@@ -1,8 +1,10 @@
+// Copyright 2025, 2026 Rose Hogenson <r@roseh.moe>
+
 // Package deque implements a double-ended queue (deque) implemented with a
 // slice-backed ring buffer.
 //
 // This queue has O(1) amortized inserts and removals from both ends of the
-// container. It also has O(1) indexing like a vector.
+// container. It also has O(1) indexing like a slice.
 //
 // The "default" usage of this type as a queue is to use [Deque.PushBack] to add
 // to the queue, and [Deque.PopFront] to remove from the queue. Iterating over
diff --git a/deque_test.go b/deque_test.go
index 27ae232..00fde54 100644
--- a/deque_test.go
+++ b/deque_test.go
@@ -1,3 +1,5 @@
+// Copyright 2025, 2026 Rose Hogenson <r@roseh.moe>
+
 package deque
 
 import (
diff --git a/example_test.go b/example_test.go
index f010515..89c77f2 100644
--- a/example_test.go
+++ b/example_test.go
@@ -1,3 +1,5 @@
+// Copyright 2025, 2026 Rose Hogenson <r@roseh.moe>
+
 package deque_test
 
 import (