1
I Use This!
Activity Not Available

News

Analyzed 3 months ago. based on code collected 4 months ago.
Posted about 15 years ago by [email protected] (Serge Matveenko)
Oh! Here goes download link [link] -- Serge Matveenko jabber:[email protected] microblog:[link] profile:[link] -- You received this message because you are subscribed to the Google Groups "PyStarDict" group.
Posted about 15 years ago by [email protected] (lig)
Hi, folks! Version v0.6 of the PyStarDict library is a little bit faster than v0.4, could be build as deb-package and released also as tar.xz archive packed via xz-utils. There are also fixes for Python 2.6 in this version. Cheers, Serge "lig" ... [More] Matveenko -- You received this message because you are subscribed to the Google Groups "PyStarDict" group. [Less]
Posted over 16 years ago by [email protected] (Serge Matveenko)
I feel a bit sceptical about this way. Looks like we cannot know word's position until we unpack it. Possibly we could find a specific word by regex but this will take as much time on every word lookup as we spending for idx load now. Please run your tests with PyStarDict v0.4. It seems you could get
Posted over 16 years ago by [email protected] (cocobear)
On Fri, 2 Jan 2009 02:07:37 0300 I think we don't need to unpack every word, we can use regex find every word's position, when look up, we retrive data at the postion of this word, just at this time we unpack .
Posted over 16 years ago by [email protected] (Serge Matveenko)
Hello all! I've released PyStarDict v0.4 that have great speed improvements and new dictionary methods implemented. Look for it on sf.net download page: [link]
Posted over 16 years ago by [email protected] (Serge Matveenko)
i've already implement it with some fixes. look for latest master git tree here [link]
Posted over 16 years ago by [email protected] (Serge Matveenko)
---------- Forwarded message ---------- To: [email protected] 2009/1/2 Serge Matveenko <[email protected]>: a new path(a litter change). this path is for the laster pystardict version. t.py -- speed test for regexp t2.py -- speed test for old arithmetic. my test result 30M idx t.py -- 20s t2.py --50s
Posted over 16 years ago by [email protected] (Serge Matveenko)
Hi! Thank you for this path. As i cannot see any tests of this path in your letter i will try to make such tests by myself. After that i hope to see real speed difference. Unfortunately i cannot see what version this patch for exactly and going to implement this regexp method manualy.
Posted over 16 years ago by [email protected] (cocobear)
On Wed, 24 Dec 2008 12:31:09 0300 It's what I mean, but I express it not exactly. I'm working on it.
Posted over 16 years ago by [email protected] (Serge Matveenko)
there is no byte by byte file reading there is only byte by byte parsing directly in memory of whole file read at once into byte buffer i willl be glad to know it