title: Optimizing the speed of insertion in java.util.Map/Set
body: <p>is there a way to optimize the speed of the insertions in a java.util.Collection by specifying the order of the items ?</p>
  
  <p>For example</p>
  
  <pre><code>java.util.Set&lt;String&gt; set = java.util.TreeSet&lt;String&gt;();
  </code></pre>
  
  <p>will this solution:</p>
  
  <pre><code>set.add("A");
  set.add("B");
  set.add("C");
  set.add("D");
  set.add("E");
  </code></pre>
  
  <p>be faster than this one (random order) ?</p>
  
  <pre><code>set.add("E");
  set.add("D");
  set.add("C");
  set.add("A");
  set.add("B");
  </code></pre>
  
  <p>(and the same question for the other collections: HashMap, hastable...)</p>
  
  <p>Thanks</p>