[Home] [By Thread] [By Date] [Recent Entries]

  • From: "Pete Cordell" <petexmldev@c...>
  • To: "Michael Kay" <mike@s...>,"'XML Developers List'" <xml-dev@l...>
  • Date: Tue, 4 Aug 2009 08:37:12 +0100

Original Message From: "Michael Kay"

>> - Although a minor concern, all other things being equal it
>> should be more efficient to parse as the entropy is at the
>> start of the string making it easier to look up.
>
> It's just as easy to compare strings starting at the end as at the front!

Sure you can write your own string compare methods that start comparing from 
the end.  But if the solution becomes wide spread then a lot of string 
comparing will be done with comparison algorithms built into the various 
implementation language (e.g. Java, C#, JavaScript and so on) and they tend 
to start from the front.

Just because you _can_ write a string compare function that starts from the 
end is no reason to have reversed names.  It certainly doesn't outweigh the 
benefits mentioned of using non-reversed names.

Pete Cordell
Codalogic Ltd
Interface XML to C++ the easy way using XML C++
data binding to convert XSD schemas to C++ classes.
Visit http://codalogic.com/lmx/ or http://www.xml2cpp.com
for more info




[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]


Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member