In Haskell, what is the reason for needing to convert from Data.Text.Internal? -


text.regex.tdfa.text 1 provides instances regexlike regex text using internal text types.

can instances of classes data.text.lazy derived instances of data.text.internal? how can improve code?

import qualified data.text.lazy t import text.regex.tdfa import text.regex.base.context() import text.regex.base.regexlike() import text.regex.tdfa.text import data.function (on)  (<?>) :: t.text -> t.text -> bool (<?>) = on (=~) t.tostrict  

i might missing something, seems have missed the module containing lazy text instances regex-tdfa classes . if that's what's happening, need change

 import text.regex.tdfa.text 

to

 import text.regex.tdfa.text.lazy 

note called text in module data.text.internal same called text in data.text -- i.e., it's "strict" text. lazy text type defined in different internal module (basically specialized list of strict texts.) it's not though these 2 ways of viewing same thing, if that's thinking.


Comments

Popular posts from this blog

jQuery Mobile app not scrolling in Firefox -

c++ - How to add Crypto++ library to Qt project -

how to receive file in java(servlet/jsp) -