Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: parsing a very large array with regexps

by fmerges (Chaplain)
on Aug 19, 2007 at 20:45 UTC ( #633662=note: print w/ replies, xml ) Need Help??

in reply to Re: parsing a very large array with regexps
in thread parsing a very large array with regexps


I would really think about if it's not better and faster if possible for you guys to make the project "open". Basically what I see is that you're still working on the same problem of the previous posts... and that there's still this lack of information you're giving, basically you would get a better solution if people could really help you on the project.

Looking at the previous posts and also to this one, I can see that you are really doing it as CGI scripts with code and presentation in one (spaghetti code)... I think is better to research a little bit on topics like separation of concern and also data mining, etc..., and really having a model or engine to which you feed the input and get an output which is independent from the Web.


fmerges at

Comment on Re^2: parsing a very large array with regexps

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://633662]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (13)
As of 2015-03-30 20:19 GMT
Find Nodes?
    Voting Booth?

    When putting a smiley right before a closing parenthesis, do you:

    Results (659 votes), past polls