Merge math package to the lodash package.

Author: javadev

checkstyle.xml

@@ -20,7 +20,7 @@
     <module name="FileLength">
       <property name="fileExtensions" value="java"/>
       <property name="severity" value="warning"/>
-      <property name="max" value="2600"/>
+      <property name="max" value="3100"/>
     </module>
     <module name="RegexpSingleline">
       <property name="format" value="\s+$"/>

src/main/java/com/github/underscore/math/Directory.java renamed to src/main/java/com/github/underscore/lodash/Directory.java

@@ -1,7 +1,7 @@
 /*
  * The MIT License (MIT)
  *
- * Copyright 2017 Valentyn Kolesnikov
+ * Copyright 2017-2018 Valentyn Kolesnikov
  *
  * Permission is hereby granted, free of charge, to any person obtaining a copy
  * of this software and associated documentation files (the "Software"), to deal
@@ -21,7 +21,7 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  * THE SOFTWARE.
  */
-package com.github.underscore.math;
+package com.github.underscore.lodash;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/github/underscore/math/Entry.java renamed to src/main/java/com/github/underscore/lodash/Entry.java

@@ -1,7 +1,7 @@
 /*
  * The MIT License (MIT)
  *
- * Copyright 2017 Valentyn Kolesnikov
+ * Copyright 2017-2018 Valentyn Kolesnikov
  *
  * Permission is hereby granted, free of charge, to any person obtaining a copy
  * of this software and associated documentation files (the "Software"), to deal
@@ -21,7 +21,7 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  * THE SOFTWARE.
  */
-package com.github.underscore.math;
+package com.github.underscore.lodash;
 
 public abstract class Entry {
     private final Directory parent;

src/main/java/com/github/underscore/math/File.java renamed to src/main/java/com/github/underscore/lodash/File.java

@@ -1,7 +1,7 @@
 /*
  * The MIT License (MIT)
  *
- * Copyright 2017 Valentyn Kolesnikov
+ * Copyright 2017-2018 Valentyn Kolesnikov
  *
  * Permission is hereby granted, free of charge, to any person obtaining a copy
  * of this software and associated documentation files (the "Software"), to deal
@@ -21,7 +21,7 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  * THE SOFTWARE.
  */
-package com.github.underscore.math;
+package com.github.underscore.lodash;
 
 public class File extends Entry {
     private final java.io.ByteArrayOutputStream stream;

src/main/java/com/github/underscore/lodash/U.java

@@ -653,6 +653,11 @@ public Chain<String> fetch() {
         public Chain<String> fetch(final String method, final String body) {
             return new Chain<String>(U.fetch((String) item(), method, body).text());
         }
+
+        @SuppressWarnings("unchecked")
+        public Chain<List<T>> createPermutationWithRepetition(final int permutationLength) {
+            return new Chain<List<T>>(U.createPermutationWithRepetition((List<T>) value(), permutationLength));
+        }
     }
 
     public static Chain<String> chain(final String item) {
@@ -2955,4 +2960,53 @@ public void put(K key, V value) {
     public static <K, V> LRUCache<K, V> createLRUCache(final int capacity) {
         return new LRUCache<K, V>(capacity);
     }
+
+    public static <T> List<List<T>> createPermutationWithRepetition(final List<T> list, final int permutationLength) {
+        final long resultSize = (long) Math.pow(list.size(), permutationLength);
+        final List<List<T>> result = new ArrayList<List<T>>((int) resultSize);
+        final int[] bitVector = new int[permutationLength];
+        for (int index = 0; index < resultSize; index += 1) {
+            List<T> result2 = new ArrayList<T>(permutationLength);
+            for (int index2 = 0; index2 < permutationLength; index2 += 1) {
+                result2.add(list.get(bitVector[index2]));
+            }
+            int index3 = 0;
+            while (index3 < permutationLength && bitVector[index3] == list.size() - 1) {
+                bitVector[index3] = 0;
+                index3 += 1;
+            }
+            if (index3 < permutationLength) {
+                bitVector[index3] += 1;
+            }
+            result.add(result2);
+        }
+        return result;
+    }
+
+    @SuppressWarnings("unchecked")
+    public List<List<T>> createPermutationWithRepetition(final int permutationLength) {
+        return createPermutationWithRepetition((List<T>) value(), permutationLength);
+    }
+
+    public static List<Entry> findByName(final Entry entry, final String name) {
+        final List<Entry> result = new ArrayList<Entry>();
+        final Queue<Entry> allFiles = new LinkedList<Entry>();
+        allFiles.add(entry);
+        while (!allFiles.isEmpty()) {
+            final Entry localEntry = allFiles.poll();
+            if (localEntry instanceof Directory) {
+                final List<Entry> files = ((Directory) localEntry).getContents();
+                for (final Entry innerFile : files) {
+                    if (innerFile instanceof Directory) {
+                        allFiles.add(innerFile);
+                    } else if (innerFile.getName().equals(name)) {
+                        result.add(innerFile);
+                    }
+                }
+            } else if (localEntry.getName().equals(name)) {
+                result.add(localEntry);
+            }
+        }
+        return result;
+    }
 }