update javadoc for network module

Author: JavaSaBr

rlib-collections/src/main/java/javasabr/rlib/collections/array/LongArray.java

@@ -1,4 +1,3 @@
-
 package javasabr.rlib.collections.array;
 
 import java.io.Serializable;
@@ -91,12 +90,12 @@ static LongArray of(long... elements) {
   /**
    * Creates an immutable copy of the specified long array.
    *
-   * @param intArray the array to copy
+   * @param array the array to copy
    * @return an immutable copy
    * @since 10.0.0
    */
-  static LongArray copyOf(LongArray intArray) {
-    return new ImmutableLongArray(intArray.toArray());
+  static LongArray copyOf(LongArray array) {
+    return new ImmutableLongArray(array.toArray());
   }
 
   /**

rlib-collections/src/main/java/javasabr/rlib/collections/array/UnsafeMutableIntArray.java

@@ -33,7 +33,7 @@ public interface UnsafeMutableIntArray extends UnsafeIntArray, MutableIntArray {
    * @return the removed value
    * @since 10.0.0
    */
-  int unsafeRemoveByInex(int index);
+  int unsafeRemoveByIndex(int index);
 
   /**
    * Sets the value at the specified index without bounds checking.

rlib-collections/src/main/java/javasabr/rlib/collections/array/UnsafeMutableLongArray.java

@@ -33,7 +33,7 @@ public interface UnsafeMutableLongArray extends UnsafeLongArray, MutableLongArra
    * @return the removed value
    * @since 10.0.0
    */
-  long unsafeRemoveByInex(int index);
+  long unsafeRemoveByIndex(int index);
 
   /**
    * Sets the value at the specified index without bounds checking.

rlib-collections/src/main/java/javasabr/rlib/collections/array/impl/AbstractIntArray.java

@@ -61,7 +61,7 @@ public boolean contains(int value) {
   @Override
   public boolean containsAll(IntArray array) {
     if (array.isEmpty()) {
-      return false;
+      return true;
     }
 
     int[] wrapped = array.asUnsafe().wrapped();
@@ -77,7 +77,7 @@ public boolean containsAll(IntArray array) {
   @Override
   public boolean containsAll(int[] array) {
     if (array.length < 1) {
-      return false;
+      return true;
     }
     for (int value : array) {
       if (!contains(value)) {

rlib-collections/src/main/java/javasabr/rlib/collections/array/impl/AbstractLongArray.java

@@ -61,7 +61,7 @@ public boolean contains(long value) {
   @Override
   public boolean containsAll(LongArray array) {
     if (array.isEmpty()) {
-      return false;
+      return true;
     }
     long[] wrapped = array.asUnsafe().wrapped();
     for (int i = 0, length = array.size(); i < length; i++) {
@@ -75,7 +75,7 @@ public boolean containsAll(LongArray array) {
   @Override
   public boolean containsAll(long[] array) {
     if (array.length < 1) {
-      return false;
+      return true;
     }
     for (long value : array) {
       if (!contains(value)) {

rlib-collections/src/main/java/javasabr/rlib/collections/array/impl/AbstractMutableIntArray.java

@@ -66,7 +66,7 @@ public UnsafeMutableIntArray unsafeSet(int index, int value) {
   @Override
   public int removeByIndex(int index) {
     checkIndex(index);
-    return unsafeRemoveByInex(index);
+    return unsafeRemoveByIndex(index);
   }
 
   @Override
@@ -75,7 +75,7 @@ public boolean remove(int value) {
     if (index < 0) {
       return false;
     }
-    unsafeRemoveByInex(index);
+    unsafeRemoveByIndex(index);
     return true;
   }
 
@@ -108,7 +108,7 @@ public boolean removeAll(int[] array) {
   }
 
   @Override
-  public int unsafeRemoveByInex(int index) {
+  public int unsafeRemoveByIndex(int index) {
     int numMoved = size() - index - 1;
     int[] wrapped = wrapped();
     int value = wrapped[index];

rlib-collections/src/main/java/javasabr/rlib/collections/array/impl/AbstractMutableLongArray.java

@@ -66,7 +66,7 @@ public UnsafeMutableLongArray unsafeSet(int index, long value) {
   @Override
   public long removeByIndex(int index) {
     checkIndex(index);
-    return unsafeRemoveByInex(index);
+    return unsafeRemoveByIndex(index);
   }
 
   @Override
@@ -75,7 +75,7 @@ public boolean remove(long value) {
     if (index < 0) {
       return false;
     }
-    unsafeRemoveByInex(index);
+    unsafeRemoveByIndex(index);
     return true;
   }
 
@@ -108,7 +108,7 @@ public boolean removeAll(long[] array) {
   }
 
   @Override
-  public long unsafeRemoveByInex(int index) {
+  public long unsafeRemoveByIndex(int index) {
     int numMoved = size() - index - 1;
     long[] wrapped = wrapped();
     long value = wrapped[index];

rlib-collections/src/main/java/javasabr/rlib/collections/deque/DequeFactory.java

@@ -33,7 +33,7 @@ public static <E> Deque<E> linkedListBased() {
    * @return a new array based deque
    * @since 10.0.0
    */
-  public static <E> Deque<E> arrayBasedBased(Class<? super E> type) {
+  public static <E> Deque<E> arrayBased(Class<? super E> type) {
     return new DefaultArrayBasedDeque<>(type);
   }
 
@@ -46,7 +46,7 @@ public static <E> Deque<E> arrayBasedBased(Class<? super E> type) {
    * @return a new array based deque
    * @since 10.0.0
    */
-  public static <E> Deque<E> arrayBasedBased(Class<? super E> type, int capacity) {
+  public static <E> Deque<E> arrayBased(Class<? super E> type, int capacity) {
     return new DefaultArrayBasedDeque<>(type, capacity);
   }
 }

rlib-collections/src/main/java/javasabr/rlib/collections/dictionary/impl/gc/optimized/GcOptimizedMutableHashBasedIntToRefDictionary.java

@@ -34,7 +34,7 @@ public GcOptimizedMutableHashBasedIntToRefDictionary(int initCapacity, float loa
     //noinspection unchecked
     this.entries = new ReusableLinkedHashIntToRefEntry[initCapacity];
     this.threshold = (int) (initCapacity * loadFactor);
-    this.entryPool = DequeFactory.arrayBasedBased(ReusableLinkedHashIntToRefEntry.class);
+    this.entryPool = DequeFactory.arrayBased(ReusableLinkedHashIntToRefEntry.class);
   }
 
   @Override

rlib-collections/src/test/java/javasabr/rlib/collections/deque/DequeTest.java

@@ -420,7 +420,7 @@ void shouldCheckContains(Deque<String> deque) {
   @Test
   void shouldRebalanceIndexesAddLastRemoveFirst() {
     // given:
-    Deque<String> deque = DequeFactory.arrayBasedBased(String.class, 15);
+    Deque<String> deque = DequeFactory.arrayBased(String.class, 15);
     Field head = ReflectionUtils.getUnsafeField(deque, "head");
     Field tail = ReflectionUtils.getUnsafeField(deque, "tail");
     var generator = new AtomicInteger();
@@ -541,7 +541,7 @@ void shouldRebalanceIndexesAddLastRemoveFirst() {
   @Test
   void shouldRebalanceIndexesAddFirstRemoveLast() {
     // given:
-    Deque<String> deque = DequeFactory.arrayBasedBased(String.class, 15);
+    Deque<String> deque = DequeFactory.arrayBased(String.class, 15);
     Field head = ReflectionUtils.getUnsafeField(deque, "head");
     Field tail = ReflectionUtils.getUnsafeField(deque, "tail");
     var generator = new AtomicInteger();
@@ -707,6 +707,6 @@ void shouldCorrectlyIterate2Deque(Deque<String> deque) {
   private static Stream<Arguments> generateDeque() {
     return Stream.of(
         Arguments.of(DequeFactory.linkedListBased()),
-        Arguments.of(DequeFactory.arrayBasedBased(String.class, 15)));
+        Arguments.of(DequeFactory.arrayBased(String.class, 15)));
   }
 }