Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: The Great Computer Language Shootout

by hardburn (Abbot)
on Sep 21, 2004 at 16:15 UTC ( #392700=note: print w/replies, xml ) Need Help??

in reply to The Great Computer Language Shootout

I have reaffirmed a long-standing and strongly held view: Language comparisons are rarely meaningful and even less often fair. A good comparison of major programming languages requires more effort than most people are willing to spend, experience in a wide range of application areas, a rigid maintenance of a detached and impartial point of view, and a sense of fairness. -- Bjarne Stroustrup, The Design and Evolution of C++

"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.

  • Comment on Re: The Great Computer Language Shootout

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://392700]
Tanktalus is trying to figure out how to get a case-insensitive match between straße and strasse to return true in perl :( fc doesn't seem to do it, either, unless I'm doing it wrong.
[LanX]: ß,ss
[LanX]: nope
[LanX]: /.*(?:ß|ss).*/
[hippo]: How are you doing the match? Regex, index, eq or something else?
[choroba]: fc $s1 eq fc $s2 I guess
[Tanktalus]: hippo: I don't care, I just want to prove it can match correctly compared to, say, ILIKE / UPPER / LOWER in postgres :)

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (13)
As of 2018-03-21 15:37 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (268 votes). Check out past polls.