Move main

.vscode/launch.json

@@ -9,15 +9,15 @@
             "type": "java",
             "name": "Debug ArrayV",
             "request": "launch",
-            "mainClass": "main.ArrayVisualizer",
+            "mainClass": "io.github.arrayv.main.ArrayVisualizer",
             "vmArgs": ["-Dsun.java2d.d3d=false", "-cp", "bin;lib/classgraph-4.8.47.jar"]
         },
         {
             // should match run.bat
             "type": "java",
             "name": "Debug ArrayV (custom max length)",
             "request": "launch",
-            "mainClass": "main.ArrayVisualizer",
+            "mainClass": "io.github.arrayv.main.ArrayVisualizer",
             "args": ["${input:length}"],
             "vmArgs": ["-Dsun.java2d.d3d=false", "-cp", "bin;lib/classgraph-4.8.47.jar"]
         }

build.xml

@@ -64,7 +64,7 @@
     <target depends="build" name="dist-jar" description="Creates an executable JAR file in the dist directory">
         <jar destfile="dist/arrayVisualizer.jar">
             <manifest>
-                <attribute name="Main-Class" value="main.ArrayVisualizer"/>
+                <attribute name="Main-Class" value="io.github.arrayv.main.ArrayVisualizer"/>
                 <attribute name="Add-Opens" value="java.desktop/com.sun.media.sound"/>
             </manifest>
             <zipfileset src="lib/classgraph-4.8.47.jar"/>
@@ -73,7 +73,7 @@
         </jar>
     </target>
     <target depends="build" name="run" description="Runs ArrayV">
-        <java classname="main.ArrayVisualizer" classpathref="ArrayVisualizer-master.classpath" fork="true">
+        <java classname="io.github.arrayv.main.ArrayVisualizer" classpathref="ArrayVisualizer-master.classpath" fork="true">
             <jvmarg value="-Dsun.java2d.d3d=false"/>
         </java>
     </target>

run.bat

@@ -1 +1 @@
-java -Dsun.java2d.d3d=false -cp bin;lib/classgraph-4.8.47.jar main.ArrayVisualizer %1
+java -Dsun.java2d.d3d=false -cp bin;lib/classgraph-4.8.47.jar io.github.arrayv.main.ArrayVisualizer %1

run.sh

@@ -1,6 +1,6 @@
 if [ "$1" != "" ]
 then
-    java -Dsun.java2d.d3d=false -cp bin:lib/classgraph-4.8.47.jar main.ArrayVisualizer "$1"
+    java -Dsun.java2d.d3d=false -cp bin:lib/classgraph-4.8.47.jar io.github.arrayv.main.ArrayVisualizer "$1"
 else
-    java -Dsun.java2d.d3d=false -cp bin:lib/classgraph-4.8.47.jar main.ArrayVisualizer
+    java -Dsun.java2d.d3d=false -cp bin:lib/classgraph-4.8.47.jar io.github.arrayv.main.ArrayVisualizer
 fi

src/main/java/io/github/arrayv/dialogs/ShuffleDialog.java

@@ -17,9 +17,9 @@
 import javax.swing.event.DocumentListener;
 
 import io.github.arrayv.frames.AppFrame;
+import io.github.arrayv.main.ArrayManager;
 import io.github.arrayv.panels.ShufflePanel;
 import io.github.arrayv.panes.JErrorPane;
-import main.ArrayManager;
 import utils.Distributions;
 import utils.ShuffleGraph;
 import utils.ShuffleInfo;

src/main/java/io/github/arrayv/frames/ArrayFrame.java

@@ -14,9 +14,9 @@
 import javax.swing.event.ChangeEvent;
 import javax.swing.event.ChangeListener;
 
+import io.github.arrayv.main.ArrayManager;
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.panes.JEnhancedOptionPane;
-import main.ArrayManager;
-import main.ArrayVisualizer;
 import utils.Highlights;
 
 /*

src/main/java/io/github/arrayv/frames/UtilFrame.java

@@ -6,11 +6,11 @@
 import javax.swing.JFrame;
 import javax.swing.JOptionPane;
 
+import io.github.arrayv.main.ArrayManager;
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.prompts.ShufflePrompt;
 import io.github.arrayv.prompts.SortPrompt;
 import io.github.arrayv.prompts.ViewPrompt;
-import main.ArrayManager;
-import main.ArrayVisualizer;
 import utils.Delays;
 import utils.Highlights;
 import utils.Sounds;

src/main/java/main/ArrayManager.java → src/main/java/io/github/arrayv/main/ArrayManager.java

@@ -1,4 +1,4 @@
-package main;
+package io.github.arrayv.main;
 
 import java.util.Arrays;
 

src/main/java/main/ArrayVisualizer.java → src/main/java/io/github/arrayv/main/ArrayVisualizer.java

@@ -1,4 +1,4 @@
-package main;
+package io.github.arrayv.main;
 
 import java.awt.BasicStroke;
 import java.awt.Color;

src/main/java/main/SortAnalyzer.java → src/main/java/io/github/arrayv/main/SortAnalyzer.java

@@ -1,4 +1,4 @@
-package main;
+package io.github.arrayv.main;
 
 import java.io.File;
 import java.io.FileOutputStream;
@@ -78,6 +78,7 @@ public final class SortAnalyzer {
     private static final Map.Entry<String, String>[] IMPORT_REPLACEMENTS = CommonUtils.createPairArray(
         "import dialogs.", "import io.github.arrayv.dialogs.",
         "import frames.", "import io.github.arrayv.frames.",
+        "import main.", "import io.github.arrayv.main.",
         "import panels.", "import io.github.arrayv.panels.",
         "import panes.", "import io.github.arrayv.panes.",
         "import prompts.", "import io.github.arrayv.prompts.",

src/main/java/io/github/arrayv/prompts/ShufflePrompt.java

@@ -8,8 +8,8 @@
 import io.github.arrayv.dialogs.ShuffleDialog;
 import io.github.arrayv.frames.AppFrame;
 import io.github.arrayv.frames.UtilFrame;
+import io.github.arrayv.main.ArrayManager;
 import io.github.arrayv.panes.JErrorPane;
-import main.ArrayManager;
 import utils.Distributions;
 import utils.Shuffles;
 

src/main/java/io/github/arrayv/prompts/SortPrompt.java

@@ -24,6 +24,8 @@
 import io.github.arrayv.dialogs.ImportSortDialog;
 import io.github.arrayv.frames.AppFrame;
 import io.github.arrayv.frames.UtilFrame;
+import io.github.arrayv.main.ArrayVisualizer;
+import io.github.arrayv.main.SortAnalyzer;
 import io.github.arrayv.panes.JErrorPane;
 import io.github.arrayv.sortdata.SortInfo;
 import io.github.arrayv.threads.MultipleSortThread;
@@ -39,8 +41,6 @@
 import io.github.arrayv.threads.RunQuickSorts;
 import io.github.arrayv.threads.RunSelectionSorts;
 import io.github.arrayv.threads.RunSort;
-import main.ArrayVisualizer;
-import main.SortAnalyzer;
 
 /*
  *

src/main/java/io/github/arrayv/prompts/ViewPrompt.java

@@ -7,8 +7,8 @@
 
 import io.github.arrayv.frames.AppFrame;
 import io.github.arrayv.frames.UtilFrame;
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.visuals.VisualStyles;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sortdata/NewSortInstance.java

@@ -6,8 +6,8 @@
 import java.lang.reflect.Constructor;
 import java.util.function.Supplier;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class NewSortInstance implements Supplier<Sort> {
     private static final MethodHandles.Lookup LOOKUP = MethodHandles.publicLookup();

src/main/java/io/github/arrayv/sortdata/SortInfo.java

@@ -4,8 +4,8 @@
 import java.util.HashSet;
 import java.util.function.Supplier;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class SortInfo {
     private final int id;

src/main/java/io/github/arrayv/sorts/concurrent/BitonicSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  * This version of Bitonic Sort was taken from here, written by Nikos Pitsianis:

src/main/java/io/github/arrayv/sorts/concurrent/BitonicSortParallel.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class BitonicSortParallel extends Sort {
     private int[] arr;

src/main/java/io/github/arrayv/sorts/concurrent/BitonicSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  * This version of Bitonic Sort was taken from here, written by H.W. Lang:

src/main/java/io/github/arrayv/sorts/concurrent/BoseNelsonSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class BoseNelsonSortIterative extends Sort {
     public BoseNelsonSortIterative(ArrayVisualizer arrayVisualizer) {

src/main/java/io/github/arrayv/sorts/concurrent/BoseNelsonSortParallel.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class BoseNelsonSortParallel extends Sort {
 

src/main/java/io/github/arrayv/sorts/concurrent/BoseNelsonSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class BoseNelsonSortRecursive extends Sort {
 

src/main/java/io/github/arrayv/sorts/concurrent/CreaseSort.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/DiamondSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/DiamondSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class DiamondSortRecursive extends Sort {
     private final double DELAY = 0.05;

src/main/java/io/github/arrayv/sorts/concurrent/FoldSort.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/MatrixSort.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
 Idea made by Control#2866 in The Studio Discord Server (https://discord.com/invite/2xGkKC2)

src/main/java/io/github/arrayv/sorts/concurrent/MergeExchangeSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class MergeExchangeSortIterative extends Sort {
 

src/main/java/io/github/arrayv/sorts/concurrent/OddEvenMergeSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  * This version of Odd-Even Merge Sort was taken from here, written by wkpark on StackOverflow:

src/main/java/io/github/arrayv/sorts/concurrent/OddEvenMergeSortParallel.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/OddEvenMergeSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  * This version of Odd-Even Merge Sort was taken from here, written by H.W. Lang:

src/main/java/io/github/arrayv/sorts/concurrent/PairwiseMergeSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/PairwiseMergeSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/PairwiseSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/PairwiseSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/WeaveSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/concurrent/WeaveSortParallel.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 public final class WeaveSortParallel extends Sort {
     private int[] arr;

src/main/java/io/github/arrayv/sorts/concurrent/WeaveSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/distribute/AmericanFlagSort.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.Sort;
-import main.ArrayVisualizer;
 
 /*
  *

src/main/java/io/github/arrayv/sorts/distribute/BinaryQuickSortIterative.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.BinaryQuickSorting;
-import main.ArrayVisualizer;
 
 /**
  * Binary MSD Radix Sort / Binary Quicksort.

src/main/java/io/github/arrayv/sorts/distribute/BinaryQuickSortRecursive.java

@@ -1,7 +1,7 @@
 package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.main.ArrayVisualizer;
 import io.github.arrayv.sorts.templates.BinaryQuickSorting;
-import main.ArrayVisualizer;
 
 /**
  * Binary MSD Radix Sort / Binary Quicksort.