(commons-collections) 03/11: Remove unnecessary keyword

[gg...@apache.org]

This is an automated email from the ASF dual-hosted git repository.

ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-collections.git

commit 9e6fcd3f8ca85ac76df20155d0955270a89db3dd
Author: Gary Gregory <ga...@gmail.com>
AuthorDate: Sun Jun 23 14:17:35 2024 -0400

    Remove unnecessary keyword
---
 .../commons/collections4/map/AbstractInputCheckedMapDecorator.java  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/main/java/org/apache/commons/collections4/map/AbstractInputCheckedMapDecorator.java b/src/main/java/org/apache/commons/collections4/map/AbstractInputCheckedMapDecorator.java
index 3045a104f..2ab0a0dff 100644
--- a/src/main/java/org/apache/commons/collections4/map/AbstractInputCheckedMapDecorator.java
+++ b/src/main/java/org/apache/commons/collections4/map/AbstractInputCheckedMapDecorator.java
@@ -65,13 +65,13 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
 
         @Override
         public Iterator<Map.Entry<K, V>> iterator() {
-            return new EntrySetIterator(this.decorated().iterator(), parent);
+            return new EntrySetIterator(decorated().iterator(), parent);
         }
 
         @Override
         @SuppressWarnings("unchecked")
         public Object[] toArray() {
-            final Object[] array = this.decorated().toArray();
+            final Object[] array = decorated().toArray();
             for (int i = 0; i < array.length; i++) {
                 array[i] = new MapEntry((Map.Entry<K, V>) array[i], parent);
             }
@@ -87,7 +87,7 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
                 // where another thread could access data before we decorate it
                 result = (Object[]) Array.newInstance(array.getClass().getComponentType(), 0);
             }
-            result = this.decorated().toArray(result);
+            result = decorated().toArray(result);
             for (int i = 0; i < result.length; i++) {
                 result[i] = new MapEntry((Map.Entry<K, V>) result[i], parent);
             }