Awesome, Felipe. Thanks.<br><br>--Tracy<br><br><div class="gmail_quote">On Thu, Feb 26, 2009 at 11:07 AM, Felipe Lessa <span dir="ltr"><<a href="mailto:felipe.lessa@gmail.com">felipe.lessa@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">2009/2/26 Tracy Wadleigh <<a href="mailto:tracy.wadleigh@gmail.com">tracy.wadleigh@gmail.com</a>>:<br>
<div><div></div><div class="Wj3C7c">> On Thu, Feb 26, 2009 at 7:17 AM, Lennart Augustsson <<a href="mailto:lennart@augustsson.net">lennart@augustsson.net</a>><br>
> wrote:<br>
>><br>
>> You can implement a reasonable split if you can fast-forward the<br>
>> generator.<br>
>> There's no known method to fast-forward the MT, but other generators<br>
>> like MRG32k3a can handle it.<br>
><br>
> Are you aware of any existing (C/C++/Haskell) library implementing this<br>
> algorithm? A cursory google search didn't turn anything up for me, aside<br>
> from something implemented in Java, and another in Lisp.<br>
<br>
</div></div>Maybe <a href="http://www.iro.umontreal.ca/%7Elecuyer/myftp/streams00/" target="_blank">http://www.iro.umontreal.ca/~lecuyer/myftp/streams00/</a> ?<br>
<br>
--<br>
<font color="#888888">Felipe.<br>
</font></blockquote></div><br>