I am a little bit confused with a simple operation of searching in the array
with D2-phobos. With tango I used to use:
size_t find( Elem[] buf, Elem pat, Pred2E pred = Pred2E.init );
Performs a linear scan of buf from [0 .. buf.length), returning the index
of the first element matching p
Eldar Insafutdinov:
> I think I completely misunderstood how to use it.
Yes, it's too much complex. It tries to do many different things in the most
efficient way possible, the result is a high complexity in usage. That's one of
the faults of Andrei's code, it's not tested by letting average co
On Sun, Jul 12, 2009 at 3:56 PM, bearophile wrote:
> Eldar Insafutdinov:
>> I think I completely misunderstood how to use it.
>
> Yes, it's too much complex. It tries to do many different things in the most
> efficient way possible, the result is a high complexity in usage. That's one
> of the fa
Below codes cause dmd crash in dmd2.031,but OK in dmd2.030:
module dmdCrash;
void main()
{
ulong num1=100;
int num2=10;
int result=num1/num2;
}
bearophile wrote:
> Eldar Insafutdinov:
>> I think I completely misunderstood how to use it.
>
> Yes, it's too much complex. It tries to do many different things in the most
> efficient way possible, the result is a high complexity in usage. That's one
> of the faults of Andrei's code, it's no
