Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <pre><code>import java.io.File; import java.io.FileNotFoundException; import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class HashMapExample { static String fileName = "text.txt"; private static Scanner input; public static void main(String[] args) throws FileNotFoundException { input = new Scanner(new File(fileName)); Map&lt;String, Integer&gt; map = new HashMap&lt;String, Integer&gt;(); while (input.hasNext()) { String word = input.next(); if (map.containsKey(word)) { int temp = map.get(word) + 1; map.put(word, temp); } else { map.put(word, 1); } } System.out.println("printing longest word(s) with word count &lt; 3"); System.out.println(""); // iterate through the key set and display word, word length and values System.out.printf("%-25s\t%-25s\t%s\n", "Word", "Word Length", "Count"); String longest = getLongest(map); int valueOfLongest = 0; if (!longest.equals("")) { valueOfLongest = longest.length(); System.out.printf("%-25s\t%-25s\t%s\n", longest, longest.length(), map.get(longest)); map.remove(longest); } boolean isAllRemoved = false; while (!isAllRemoved) { isAllRemoved = false; longest = getLongest(map); if (!longest.equals("") &amp;&amp; longest.length() == valueOfLongest){ System.out.printf("%-25s\t%-25s\t%s\n", longest, longest.length(), map.get(longest)); map.remove(longest); } else isAllRemoved = true; } System.out.println(""); System.out.println("printing next longest word(s) with word count &gt; = 3"); System.out.println(""); // iterate through the key set and display word, word length and values System.out.printf("%-25s\t%-25s\t%s\n", "Word", "Word Length", "Count"); String nextLongest = getNextLongest(map, valueOfLongest); int valueOfNextLongest = 0; if (!longest.equals("")) { valueOfNextLongest = nextLongest.length(); System.out.printf("%-25s\t%-25s\t%s\n", nextLongest, nextLongest.length(), map.get(nextLongest)); map.remove(nextLongest); } boolean isNextLongest = false; while (!isNextLongest) { isNextLongest = true; nextLongest = getNextLongest(map, valueOfLongest); if (!(nextLongest.equals("")) &amp;&amp; nextLongest.length() == valueOfNextLongest) { System.out.printf("%-25s\t%-25s\t%s\n", nextLongest, nextLongest.length(), map.get(nextLongest)); map.remove(nextLongest); isNextLongest = false; } } } public static String getLongest(Map&lt;String, Integer&gt; map) { String longest = ""; for (Map.Entry&lt;String, Integer&gt; entry : map.entrySet()) { String key = (String) entry.getKey(); if (longest.length() &lt; key.length() &amp;&amp; map.get(key) &lt; 3) { longest = key; } } return longest; } public static String getNextLongest(Map&lt;String, Integer&gt; map, int valueOfLongest) { String nextLongest = ""; for (Map.Entry&lt;String, Integer&gt; entry : map.entrySet()) { String key = (String) entry.getKey(); if (valueOfLongest &gt; key.length() &amp;&amp; nextLongest.length() &lt; key.length() &amp;&amp; map.get(key) &gt;= 3) { nextLongest = key; } } return nextLongest; } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POJava - Hashmapping a text file
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USopenmike
    1. USopenmike
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POJava - Hashmapping a text file
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COIf the longest word is occurred <3 times, it will not be printed but the next longest word that occurrs >=3 will be printed. BTW that code is brilliant! It needs some tweaking tho - any non-letter characters should not be considered into the length of the word
      singulars
      1. PO
      1. USuser3093590
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload