View Single Post
Old 10-12-2008, 09:59 PM   #8
pilotbob
Grand Sorcerer
pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.pilotbob ought to be getting tired of karma fortunes by now.
 
pilotbob's Avatar
 
Posts: 19,832
Karma: 11844413
Join Date: Jan 2007
Location: Tampa, FL USA
Device: Kindle Touch
Quote:
Originally Posted by kovidgoyal View Post
It could but since there are a very large number of possible ligatures this would just slow things down a lot
Really... is python that slow? Perhaps a utility to do this outside and have it be an option.

I think if you build a hash table of ligatures it would be quick to do a look up. However, I'm not sure how you are doing the conversion. Is this a stream based process? In .Net you would do this with stream readers and writers. The readers output is a stream which can input to the next reader/writer. The overhead is very small as the stream is processed from end to end and passed from adapter to adapter as the stream is processed.

Is there anything like that in python?

BOb
pilotbob is offline   Reply With Quote