Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>If these "elements" are <em>keys</em> you can store them in a <code>TreeMap</code>, which will produce a consistent order based on the <em>natural ordering</em> of the keys. Note you don't need to do much except create a new map with the old map passed to the constructor:</p> <pre><code>Map&lt;String,?&gt; map = ? Map&lt;String,?&gt; orderedMap = new TreeMap&lt;String,?&gt;(map); </code></pre> <p>Then, iterate like normal:</p> <pre><code>for(String key : orderedMap.keys()){ } </code></pre> <p>If your "elements" are <em>values</em>, then you can insert them as keys into a <code>TreeMap</code> keeping track of the original keys, read the sorted order of values as before (basically creating an inverted index):</p> <pre><code>Map&lt;?,String&gt; map = ? Map&lt;String,List&lt;?&gt;&gt; orderedVals = new TreeMap&lt;String,List&lt;?&gt;&gt;(); for(Entry&lt;?,String&gt; map : map.entrySet()){ List&lt;?&gt; keys = orderedVals.get(map.getValue()); if(keys == null){ keys = new ArrayList&lt;?&gt;(); orderedVals.put(map.getValue(), keys); } keys.add(map.getKey()); } // now orderedVals has keys in sorted order for(String val : orderedVals.keys()){ } </code></pre> <p>Of course, if you're not actually using anything related to the fact these things are in a "hashtable" (I read this as something implementing <code>Map</code>), then you can load up a <code>List</code> of your choosing, and sort it:</p> <pre><code>List&lt;String&gt; list = new ArrayList&lt;String&gt;(map.values()); // or use map.keys() Collections.sort(list); </code></pre> <p>If you're not happy with the default sort order for <code>String</code>, feel free to write your own comparator:</p> <pre><code>Collections.sort(list, new Comparator&lt;String&gt;(){ public int compare(String left, String right){ return // your impl } }); </code></pre> <p><code>compare</code> must return a negative integer when the <code>left</code> comes first, 0 if <code>left</code> and <code>right</code> are the same, and a positive integer if <code>right</code> comes first.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow do I sort elements in a hash table in alphabetical order?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMark Elliot
    1. USMark Elliot
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. CO+1 Not a bad answer, though in the case of the inverted map I'd rather just use Guava's `SortedSetMultimap` instead. (I'll post an entry expressing the idea in a minute.)
      singulars
      1. PO
      1. USChris Jester-Young
    2. COactullly my problem is i have to parsed these values Cijfercode, Crypto Doorloper Kruizword Woordzoker Zweeds from xml.but in xml they are in the alphabetical order same as above.but while using hashtable to retrive values it becomes the order Cijfercode, Doorloper Woordzoker Zweeds Kruizword Crypto why is is happening?
      singulars
      1. PO
      1. USdivz
    3. CO@chinchu: `HashMap` does not have any iteration ordering guarantees. If you want one, you have two choices: `TreeMap` (natural or comparator-based order) and `LinkedHashMap` (insertion order).
      singulars
      1. PO
      1. USChris Jester-Young
 

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