Redefined from class RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeee.
virtual int
ccccoooommmmppppaaaarrrreeeeTTTToooo(const RWCollectable* c) const;
Redefined from class RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeee. returns the result of
RRRRWWWWCCCCSSSSttttrrrriiiinnnngggg::::::::ccccoooommmmppppaaaarrrreeeeTTTToooo((((****((((ccccoooonnnnsssstttt SSSSttttrrrriiiinnnngggg****))))cccc,,,, RRRRWWWWCCCCSSSSttttrrrriiiinnnngggg::::::::eeeexxxxaaaacccctttt)))). This compares
strings lexicographically, with case considered. It would be possible to
define , for instance, CCCCaaaasssseeeeFFFFoooollllddddeeeeddddSSSSttttrrrriiiinnnngggg which did comparisons ignoring
case. We have deliberately left this as an exercise for two reasons:
Because it is both easy to do and not universally needed; and because the
presence of both RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeeeSSSSttttrrrriiiinnnnggggssss and such a CCCCaaaasssseeeeFFFFoooollllddddeeeeddddSSSSttttrrrriiiinnnngggg in any
kind of sorted collection has the potential for very confusing behavior,
since the result of a comparison would depend on the order in which the
comparison was done.
virtual unsigned
hhhhaaaasssshhhh() const;
Redefined from class RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeee. Calls RRRRWWWWCCCCSSSSttttrrrriiiinnnngggg::::::::hhhhaaaasssshhhh(((()))) and returns
the results.
virtual RWClassID
iiiissssAAAA() const;
Redefined from class RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeee to return ________RRRRWWWWCCCCOOOOLLLLLLLLEEEECCCCTTTTAAAABBBBLLLLEEEESSSSTTTTRRRRIIIINNNNGGGG.
virtual RWBoolean
iiiissssEEEEqqqquuuuaaaallll(const RWCollectable* c) const;
Redefined from class RRRRWWWWCCCCoooolllllllleeeeccccttttaaaabbbblllleeee. Calls RRRRWWWWCCCCSSSSttttrrrriiiinnnngggg::::::::ooooppppeeeerrrraaaattttoooorrrr========(((()))) (iiii....eeee....,
the equivalence operator) with cccc as the argument and returns the results.