Initial commit

.gitignore

@@ -0,0 +1,33 @@
+HELP.md
+target/
+!.mvn/wrapper/maven-wrapper.jar
+!**/src/main/**/target/
+!**/src/test/**/target/
+
+### STS ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+
+### IntelliJ IDEA ###
+.idea
+*.iws
+*.iml
+*.ipr
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+build/
+!**/src/main/**/build/
+!**/src/test/**/build/
+
+### VS Code ###
+.vscode/

.mvn/wrapper/maven-wrapper.properties

@@ -0,0 +1,2 @@
+distributionUrl=https://repo.maven.apache.org/maven2/org/apache/maven/apache-maven/3.8.6/apache-maven-3.8.6-bin.zip
+wrapperUrl=https://repo.maven.apache.org/maven2/org/apache/maven/wrapper/maven-wrapper/3.1.0/maven-wrapper-3.1.0.jar

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2022 roymanigley
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,82 @@
+# WriteSonicClient
+> Console application which calls the `writesonic.com` AI API, the response is printed out to the console.  
+> 
+> with the `--voice` option the output will be spoken out using the `freetts` API
+
+## Requirements
+
+- Java 17
+- `writesonic.com` API Key ([how to obtain the WriteSonic API Key](https://docs.writesonic.com/reference/finding-your-api-key))
+
+## Build
+
+    ./mvnw clean package
+
+## Run
+> before running the application you need to set the `WRITE_SONIC_API_KEY` env variable.  
+>  
+> **Linux/Mac**: `export WRITE_SONIC_API_KEY=XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXX`  
+> **Windows**: `set WRITE_SONIC_API_KEY=XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXX`
+
+**text only**
+
+    java -jar target/WriteSonicClient-0.0.1-SNAPSHOT.jar
+
+**with voice and text**
+
+    java -jar target/WriteSonicClient-0.0.1-SNAPSHOT.jar --voice 
+
+> when you are done just **enter an empty line to close the application**
+
+### Example output
+
+    [+] Enter your question: 
+    > provide me a java implementation of the heapsort algorythm in markdown
+    [+] Processing question: provide me a java implementation of the heapsort algorythm in markdown
+    ```Java
+    public void heapSort(int[] list) { 
+        // Build heap (rearrange array) 
+        for (int i = list.length / 2 - 1; i >= 0; i--) 
+            heapify(list, list.length, i); 
+      
+        // One by one extract an element from heap 
+        for (int i=list.length-1; i>=0; i--) 
+        { 
+            // Move current root to end 
+            int temp = list[0]; 
+            list[0] = list[i]; 
+            list[i] = temp; 
+      
+            // call max heapify on the reduced heap 
+            heapify(list, i, 0); 
+        } 
+    } 
+
+    // To heapify a subtree rooted with node i which is 
+    // an index in arr[]. n is size of heap 
+    void heapify(int arr[], int n, int i) 
+    { 
+        int largest = i; // Initialize largest as root 
+        int l = 2*i + 1; // left = 2*i + 1 
+        int r = 2*i + 2; // right = 2*i + 2 
+      
+        // If left child is larger than root 
+        if (l  n && arr[l] > arr[largest]) 
+            largest = l; 
+      
+        // If right child is larger than largest so far 
+        if (r  n && arr[r] > arr[largest]) 
+            largest = r; 
+      
+        // If largest is not root 
+        if (largest != i) 
+        { 
+            int swap = arr[i]; 
+            arr[i] = arr[largest]; 
+            arr[largest] = swap; 
+      
+            // Recursively heapify the affected sub-tree 
+            heapify(arr, n, largest); 
+        } 
+    } 
+    ```