</code> and seeds it with values taken from the itrator range [first, last) and adjusts first to point to the element after the last one used. If there are not enough elements, throws <code class="computeroutput">std::invalid_argument</code>.</p>
<p>first and last must be input iterators. </p>
</li>
</ol></div>
</div>
<div class="refsect2">
<a name="id-1.3.34.5.6.21.3.4.7"></a><h3>
<a name="id-1_3_34_5_6_22_1_1_1_9-bb"></a><code class="computeroutput">linear_congruential_engine</code> public member function