Funny, I had kind of a dejavu when I read about "just having a bidi algorithm that work". I had the same feeling a number of years ago, and the result was Fribidi... The question of "why does it have to be so complicated" is a good question, but in a sense it doesn't matter. The only standard that exists is the Unicode one, and the chances of getting the world to accept something that is not standard is very small... What exactly is it that you don't like about FriBidi?
beleive me, its the last thing i want to do, which is implement an already implemented and tested algorithm... but FriBidi's license does not allow me to use it in PuTTY.... PuTTY is a 1 file terminal emulator, so using FriBidi in an external library is not convenient for the author... and using it in PuTTY's code is not possible with FriBidi's license... its all license issues, i have nothing against FriBidi...
Now regarding the implementation, last time I checked Behdad (or was it Owen Taylor?) had implemented a double lookup. First the upper bits are used to select a 128-byte block. The lower bits are then used to lookup into this lower block. A perl program generates the code and has the additional compression to compare the contents of the 128-byte block. If you hit upon a complete block that has already been built (e.g. all 128 bytes are LTR) then you just reference the existing block. Probably this compression has been updated a bit more, but I believe that is still the basic idea.
i'll keep that in mind for later...
thanks for the feedback.... did u check the code..? if so, what do u think..?
and thanks behdad, i forgot to thank u in the other posts... sorry if it sounded rude or anything...
ak.
_________________________________________________________________
Protect your PC - get McAfee.com VirusScan Online http://clinic.mcafee.com/clinic/ibuy/campaign.asp?cid=3963
_______________________________________________ Developer mailing list [EMAIL PROTECTED] http://lists.arabeyes.org/mailman/listinfo/developer
