darcs-hash:20070907015406-c8de0-4bf04c827b12db3b8d30c01ea8af75acca8e3c02.gz

darcs-hash:20070907015248-c8de0-5f583ad3dac1a4d688b992a894c8ce75745bbbc7.gz

darcs-hash:20070906174241-c8de0-234a11916f87017de65a60b562c8f2cfa7dae4af.gz

darcs-hash:20070906172640-c8de0-11a7a435200e761ead10dc64dd940eeed6bfcdbe.gz

use clever O(1) algorithm from Knuth to find rightmost zero bit (I doubt it's significantly faster, but it sure is cooler)

darcs-hash:20070906154335-c8de0-7d3f930d12b00a5d71a0406605cace694195e620.gz

darcs-hash:20070906132958-c8de0-ee487c0dfb8390814acee28d48e57912b08195a5.gz

darcs-hash:20070906020018-c8de0-ebbcf31bebdb208a5d1ff57aca14a3994f08f549.gz

darcs-hash:20070906015428-c8de0-47309e79f9b9610b7bd7b3c1098879d49fcc8eef.gz

darcs-hash:20070906015046-c8de0-6a3da0b8e0b19d904995ceae6c5d798568a3c301.gz

darcs-hash:20070906002420-c8de0-52dc2c7d5e47001fa7f88af3e0270932f75c821d.gz

darcs-hash:20070905212910-c8de0-d17e6db5865b4aa93ec15b6521e348e647e90abf.gz

darcs-hash:20070905212543-c8de0-a6f8bacf2db3c0b3ae79cd0f06ad946f2afdb898.gz

darcs-hash:20070905212356-c8de0-23bbb4a4af7867599387cace7787eb63a07d16e3.gz

darcs-hash:20070905211405-c8de0-d3fc1fd6834a2ba40bfa40e10c652c4faa7316ed.gz

added test integrand, sobol_skip, checked whether lookup table makes rightzero32 faster (it doesn't)

darcs-hash:20070905182412-c8de0-2ff5c41960f9e7526831cfced27be56690a74888.gz

darcs-hash:20070905172746-c8de0-68efd4e54f675b63c6f6faa46c3118887f2d8a63.gz

darcs-hash:20070905172358-c8de0-3b172cc335ef8a3705a34b7bb5b087100ded5d8e.gz

darcs-hash:20070905001914-c8de0-9d8968118bcc77a63b44d8d56ebc54b24d5b2ed5.gz

darcs-hash:20070904163236-c8de0-33897b41afe8d8fd4520b02c19100efeb3193d64.gz

darcs-hash:20070904031915-c8de0-c146f3a4b28f90444c299eb79f73e94b2d22586d.gz

darcs-hash:20070904030049-c8de0-a57d4e553ccd11f80ae165ebd48adf29b96a8861.gz

darcs-hash:20070904021550-c8de0-49623cb50c1970965af5b72315b656c38025c367.gz

darcs-hash:20070904013714-c8de0-febfb807bc48f2a21bedb530971e77938ca66ae4.gz

darcs-hash:20070904013545-c8de0-2f4a0b3f51a776918e163594cfa745e4969a803b.gz

darcs-hash:20070904012015-c8de0-b18f22f76ac879415165b98ed8d34c52b062a481.gz

darcs-hash:20070903212523-c8de0-bcc71ab76958e9ce4f845ed01a649bab501de705.gz

darcs-hash:20070903204210-c8de0-428d0689b27e43df180260d820e68000db8bdc3a.gz

darcs-hash:20070903203224-c8de0-be15e46393143c4d1c400ecacef548ff1fb4a01d.gz

darcs-hash:20070903200505-c8de0-9e8929452a50483ad0d627fbbc04ed17bbe94320.gz

darcs-hash:20070903200121-c8de0-75721dba7e4c5dd4d21602f8335573d8bd81f670.gz

darcs-hash:20070903194601-c8de0-8315f01aaf5007f7bd663b6c5e643c969ffc39b9.gz

darcs-hash:20070903194532-c8de0-725aba9fd7b6e3d4cba7c7f0f89f051a7fa2e60e.gz

added luksan/ directory, which will eventually contain several routines written by Prof. Luksan and made available under the LGPL.  currently, I've converted the PLIN.FOR subroutine, which is a reimplementation of the LBFGS algorithm (and removed the lbfgs/ directory, since the code turns out to be non-free)

darcs-hash:20070903193815-c8de0-7428452045bf7147a8424cbd56af89de2e3efa66.gz

darcs-hash:20070903192207-c8de0-cef32242ac0bc7308b24d07ae31e2e9e1c6c463a.gz

darcs-hash:20070903155355-c8de0-573f0e3548646f08a7a2c2c2712375ff69307219.gz

darcs-hash:20070902021052-c8de0-a9be63facbd050d1e2a61a62cce45c0175fca451.gz

darcs-hash:20070902015359-c8de0-6debf4722defcdd64dad8ff6eb3770c7002d5f5f.gz

darcs-hash:20070902014000-c8de0-62c7656d09bbdf241c57fcce96352d0a67f27e73.gz

darcs-hash:20070902005553-c8de0-36bf93ff122a2ee40cb6f80b748a0b0269170cdb.gz

darcs-hash:20070902001903-c8de0-4e82ae47b3eaf665dc3185dc38ff75c6d323a74b.gz