p>Euclidean modulo operator.</p>
<p>Returns the remainder of the Euclidean division. The Euclidean division of
two integers <code>a</code> and <code>b</code> yields two integers <code>q</code> and <code>r</code> such that
<code>a == b * q + r</code> and <code>0 &lt;= r &lt; b.abs()</code>.</p>
<p>The sign of the returned value <code>r</code> is always positive.</p>
<p>See <a href="../../dart-core/BigInt/remainder.html">remainder</a> for the remainder of the truncating division.</p>
    </section>
    
    <