Gets Virtual Thread to Get Pinned without a parkPermit

jesperancinha · Jun 19, 2022 · e47800a · e47800a
1 parent e2ddc8f
commit e47800a
Show file tree

Hide file tree

Showing 5 changed files with 108 additions and 30 deletions.
diff --git a/Log.md b/Log.md
@@ -1,16 +1,16 @@
 | Time | Method | Time Complexity | Space Complexity | Repetitions | Java Duration | Kotlin Duration | Machine |
 |---|---|---|---|---|---|---|---|
-| 2022-06-19T18:21:45.478279 | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 46 | -1 | Prototype |
-| 2022-06-19T18:21:45.491856 | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 1489 | 3228 | Prototype |
-| 2022-06-19T18:21:45.491984 | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1370 | 1616 | Prototype |
-| 2022-06-19T18:21:45.492032 | revertText - Reverted Text | O(n) | O(1) | 10000 | 337 | 540 | Prototype |
-| 2022-06-19T18:21:45.492074 | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 412 | 1716 | Prototype |
-| 2022-06-19T18:21:45.492115 | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 2467 | 1731 | Prototype |
-| 2022-06-19T18:21:45.492155 | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 194 | 365 | Prototype |
-| 2022-06-19T18:21:45.492198 | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 337 | 772 | Prototype |
-| 2022-06-19T18:21:45.492252 | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 276 | 768 | Prototype |
-| 2022-06-19T18:21:45.492294 | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 1258 | 4409 | Prototype |
-| 2022-06-19T18:21:45.492344 | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 673 | 749 | Prototype |
-| 2022-06-19T18:21:45.492396 | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 353 | 545 | Prototype |
-| 2022-06-19T18:21:45.492438 | controlTest - N/A | n/a | n/a | 10000 | 759 | 828 | Prototype |
-| 2022-06-19T18:21:45.492480 | generalTest - N/A | n/a | n/a | 10000 | 217 | 187 | Prototype |
+| 2022-06-19T18:35:45.863816 | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 10337 | -1 | Prototype |
+| 2022-06-19T18:35:45.863865 | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2190 | -1 | Prototype |
+| 2022-06-19T18:35:45.863884 | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 2720 | -1 | Prototype |
+| 2022-06-19T18:35:45.863898 | revertText - Reverted Text | O(n) | O(1) | 10000 | 1755 | -1 | Prototype |
+| 2022-06-19T18:35:45.863912 | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1928 | -1 | Prototype |
+| 2022-06-19T18:35:45.863929 | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 3455 | -1 | Prototype |
+| 2022-06-19T18:35:45.863942 | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1838 | -1 | Prototype |
+| 2022-06-19T18:35:45.863959 | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1657 | -1 | Prototype |
+| 2022-06-19T18:35:45.863975 | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1792 | -1 | Prototype |
+| 2022-06-19T18:35:45.863989 | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 2049 | -1 | Prototype |
+| 2022-06-19T18:35:45.864002 | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 2785 | -1 | Prototype |
+| 2022-06-19T18:35:45.864015 | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 1950 | -1 | Prototype |
+| 2022-06-19T18:35:45.864028 | controlTest - N/A | n/a | n/a | 10000 | 1230 | -1 | Prototype |
+| 2022-06-19T18:35:45.864041 | generalTest - N/A | n/a | n/a | 10000 | 625 | -1 | Prototype |
diff --git a/dump/dump.csv b/dump/dump.csv
@@ -1,15 +1,15 @@
 "JAVADURATION","KOTLINDURATION","MACHINE","METHOD","REPETITION","SPACECOMPLEXITY","TIMECOMPLEXITY"
-"46","-1","Prototype","saveWordsNio - Write to 1 file","2","n/a","n/a"
-"1489","3228","Prototype","findAllUniqueWords - All Unique Words","10000","n/a","n/a"
-"1370","1616","Prototype","findAllUniqueWordsWithCount - All Words with count","10000","n/a","n/a"
-"337","540","Prototype","revertText - Reverted Text","10000","O(1)","O(n)"
-"412","1716","Prototype","contentSplitIterateSubtractAndSum - Double iteration of an array of words","10000","O(1)","O(n^2)"
-"2467","1731","Prototype","repetitionCount - Repetition count","10000","O(n)","O(n^2)"
-"194","365","Prototype","createAvlTree - Create AVL Tree","10000","O(n)","O(log n)"
-"337","772","Prototype","findPrimeSecret - Secret word in Sieve of Eratosthenes","10000","O(n)","O(n * log(log n))"
-"276","768","Prototype","createSplayTree - Create Splay Tree","10000","O(n)","O(log n)"
-"1258","4409","Prototype","quickSort - Quick sort","10000","O(log n)","O(n * log n)"
-"673","749","Prototype","makeTextFromWordFlow - Make text from word Flow","10000","n/a","n/a"
-"353","545","Prototype","createIntersectionWordList - Intersection Text Algorithm","10000","O(n)","O(n)"
-"759","828","Prototype","controlTest - N/A","10000","n/a","n/a"
-"217","187","Prototype","generalTest - N/A","10000","n/a","n/a"
+"10337","-1","Prototype","saveWordsNio - Write to 1 file","2","n/a","n/a"
+"2190","-1","Prototype","findAllUniqueWords - All Unique Words","10000","n/a","n/a"
+"2720","-1","Prototype","findAllUniqueWordsWithCount - All Words with count","10000","n/a","n/a"
+"1755","-1","Prototype","revertText - Reverted Text","10000","O(1)","O(n)"
+"1928","-1","Prototype","contentSplitIterateSubtractAndSum - Double iteration of an array of words","10000","O(1)","O(n^2)"
+"3455","-1","Prototype","repetitionCount - Repetition count","10000","O(n)","O(n^2)"
+"1838","-1","Prototype","createAvlTree - Create AVL Tree","10000","O(n)","O(log n)"
+"1657","-1","Prototype","findPrimeSecret - Secret word in Sieve of Eratosthenes","10000","O(n)","O(n * log(log n))"
+"1792","-1","Prototype","createSplayTree - Create Splay Tree","10000","O(n)","O(log n)"
+"2049","-1","Prototype","quickSort - Quick sort","10000","O(log n)","O(n * log n)"
+"2785","-1","Prototype","makeTextFromWordFlow - Make text from word Flow","10000","n/a","n/a"
+"1950","-1","Prototype","createIntersectionWordList - Intersection Text Algorithm","10000","O(n)","O(n)"
+"1230","-1","Prototype","controlTest - N/A","10000","n/a","n/a"
+"625","-1","Prototype","generalTest - N/A","10000","n/a","n/a"
diff --git a/dump/java/Log.md b/dump/java/Log.md
@@ -14,3 +14,76 @@
 | Java Project Loom | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 353 | Prototype |
 | Java Project Loom | controlTest - N/A | n/a | n/a | 10000 | 759 | Prototype |
 | Java Project Loom | generalTest - N/A | n/a | n/a | 10000 | 217 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 66 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2351 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1702 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1602 | Prototype |
+| Java Project Loom | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1751 | Prototype |
+| Java Project Loom | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 2867 | Prototype |
+| Java Project Loom | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1544 | Prototype |
+| Java Project Loom | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1613 | Prototype |
+| Java Project Loom | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1337 | Prototype |
+| Java Project Loom | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 2384 | Prototype |
+| Java Project Loom | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 2241 | Prototype |
+| Java Project Loom | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 1646 | Prototype |
+| Java Project Loom | controlTest - N/A | n/a | n/a | 10000 | 1016 | Prototype |
+| Java Project Loom | generalTest - N/A | n/a | n/a | 10000 | 503 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 74 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2498 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1716 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1340 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 82 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2943 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1877 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1677 | Prototype |
+| Java Project Loom | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1807 | Prototype |
+| Java Project Loom | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 5046 | Prototype |
+| Java Project Loom | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1734 | Prototype |
+| Java Project Loom | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1973 | Prototype |
+| Java Project Loom | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1521 | Prototype |
+| Java Project Loom | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 2078 | Prototype |
+| Java Project Loom | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 2610 | Prototype |
+| Java Project Loom | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 1725 | Prototype |
+| Java Project Loom | controlTest - N/A | n/a | n/a | 10000 | 948 | Prototype |
+| Java Project Loom | generalTest - N/A | n/a | n/a | 10000 | 526 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 94 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2281 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1694 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1480 | Prototype |
+| Java Project Loom | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1431 | Prototype |
+| Java Project Loom | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 3085 | Prototype |
+| Java Project Loom | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1521 | Prototype |
+| Java Project Loom | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1729 | Prototype |
+| Java Project Loom | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1555 | Prototype |
+| Java Project Loom | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 2449 | Prototype |
+| Java Project Loom | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 2087 | Prototype |
+| Java Project Loom | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 1468 | Prototype |
+| Java Project Loom | controlTest - N/A | n/a | n/a | 10000 | 931 | Prototype |
+| Java Project Loom | generalTest - N/A | n/a | n/a | 10000 | 545 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 72 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2127 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1793 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1539 | Prototype |
+| Java Project Loom | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1645 | Prototype |
+| Java Project Loom | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 3781 | Prototype |
+| Java Project Loom | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1453 | Prototype |
+| Java Project Loom | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1471 | Prototype |
+| Java Project Loom | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1347 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 100 | 556 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2058 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 1768 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1442 | Prototype |
+| Java Project Loom | saveWordsNio - Write to 1 file | n/a | n/a | 2 | 10337 | Prototype |
+| Java Project Loom | findAllUniqueWords - All Unique Words | n/a | n/a | 10000 | 2190 | Prototype |
+| Java Project Loom | findAllUniqueWordsWithCount - All Words with count | n/a | n/a | 10000 | 2720 | Prototype |
+| Java Project Loom | revertText - Reverted Text | O(n) | O(1) | 10000 | 1755 | Prototype |
+| Java Project Loom | contentSplitIterateSubtractAndSum - Double iteration of an array of words | O(n^2) | O(1) | 10000 | 1928 | Prototype |
+| Java Project Loom | repetitionCount - Repetition count | O(n^2) | O(n) | 10000 | 3455 | Prototype |
+| Java Project Loom | createAvlTree - Create AVL Tree | O(log n) | O(n) | 10000 | 1838 | Prototype |
+| Java Project Loom | findPrimeSecret - Secret word in Sieve of Eratosthenes | O(n * log(log n)) | O(n) | 10000 | 1657 | Prototype |
+| Java Project Loom | createSplayTree - Create Splay Tree | O(log n) | O(n) | 10000 | 1792 | Prototype |
+| Java Project Loom | quickSort - Quick sort | O(n * log n) | O(log n) | 10000 | 2049 | Prototype |
+| Java Project Loom | makeTextFromWordFlow - Make text from word Flow | n/a | n/a | 10000 | 2785 | Prototype |
+| Java Project Loom | createIntersectionWordList - Intersection Text Algorithm | O(n) | O(n) | 10000 | 1950 | Prototype |
+| Java Project Loom | controlTest - N/A | n/a | n/a | 10000 | 1230 | Prototype |
+| Java Project Loom | generalTest - N/A | n/a | n/a | 10000 | 625 | Prototype |
diff --git a/java-good-story/src/main/java/org/jesperancinha/good/story/AlgorithmInterface.java b/java-good-story/src/main/java/org/jesperancinha/good/story/AlgorithmInterface.java
@@ -38,5 +38,5 @@ public interface AlgorithmInterface {
 
     String saveWords(List<String> words);
 
-    String saveWordsNio(List<String> words);
+   String  saveWordsNio(List<String> words);
 }
diff --git a/java-good-story/src/main/java/org/jesperancinha/good/story/AlgorithmManager.java b/java-good-story/src/main/java/org/jesperancinha/good/story/AlgorithmManager.java
@@ -293,7 +293,12 @@ public String saveWords(List<String> words) {
     }
 
 
-    public String saveWordsNio(List<String> words) {
+    public synchronized String saveWordsNio(List<String> words) {
+        try {
+            Thread.sleep(1000);
+        } catch (InterruptedException e) {
+            throw new RuntimeException(e);
+        }
         Set<StandardOpenOption> options = new HashSet<>();
         options.add(StandardOpenOption.CREATE);
         options.add(StandardOpenOption.APPEND);