Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^4: xml parsers: do I need one?

by Aristotle (Chancellor)
on Aug 28, 2003 at 17:12 UTC ( #287453=note: print w/replies, xml ) Need Help??


in reply to Re: Re^2: xml parsers: do I need one?
in thread xml parsers: do I need one?

I am aware of that. Java has caught up a great deal in performance issues. Nevertheless, Java code is not as low level as C code. (char* anyone?)

Makeshifts last the longest.

Replies are listed 'Best First'.
Re: Re^4: xml parsers: do I need one?
by exussum0 (Vicar) on Sep 01, 2003 at 18:14 UTC
    "low level" has nothing to do w/ it. Doing things like strcmp (strncmp) isn't as efficient as java strings, since hash's comparisons MAY be faster.

    Try doing a strncmp of say, two identical 10k byte strings, but when you do a.equals(b), where a,b are strings, then doing equals() should be faster, since the hash values are calculated and compared, using specific algorithms that are prolly faster in the long term.

    ---
    Play that funky music white boy..

      What does that have to do with anything? You can write a string hashing function in C too (and I know which one I'll bet my money on). And how does this apply to writing an XML parser?

      Makeshifts last the longest.

        'cause XML is string parsing. Saying that java's XML is probably slow is rather unfair, and less probable for doing string manips are easily optimized in java as it is in one place... the jvm.

        Play that funky music white boy..

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (2)
As of 2022-08-16 06:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?