 &lt; n   :      min_i &lt;= max_i</li>
<li>for all i &lt; n-1 :  max_i + 1 &lt; min_{i+1}.
Note that we check at validation that a variable domain is small enough so
that we don't run into integer overflow in our algorithms. Because of that,
you cannot just have "unbounded" variable like [0, kint64max] and should
try to specify tighter domains.
</li>
</ul>
</pre><pre><code>repeated int64 domain = 2;</code>
<dl class="section return"><dt>Returns</dt><dd>The count of domain.
</dd></dl>
</pre>
<p>Implements <