title: OCaml performance according to matching order
body: <p>In OCaml, is there any relation between the order in a pattern-matching and performance?</p>
  
  <p>For instance, if I declare a type:</p>
  
  <pre><code>type t = A | B | C
  </code></pre>
  
  <p>and then perform some pattern-matching as follows:</p>
  
  <pre><code>match t1 with
    | A -&gt; ...
    | _ -&gt; ...
  </code></pre>
  
  <p>From a performance point of view, is it equivalent to</p>
  
  <pre><code>match t1 with
    | B -&gt; ...
    | _ -&gt; ...
  </code></pre>
  
  <p>assuming in the first case there are as many A's as there are B's in the second?</p>
  
  <p>In other words, should I worry about the order of declaration of constructors in a type, when considering performance?</p>