/*! * \return Maximum tree depth of the individual. */ inline unsigned int getMaxTreeDepth() const { Beagle_StackTraceBeginM(); unsigned int lDepth = 0; for(unsigned int i=0; i<size(); ++i) lDepth = maxOf(lDepth, (*this)[i]->getTreeDepth()); return lDepth; Beagle_StackTraceEndM(); }
inline bool LanguageIdentifier::isAmbiguousTLD(char *tld, int len) { register int x; for(x = 0; ambiguousTLDs[x]; x++) { if(!strncmp(tld, ambiguousTLDs[x], maxOf(len, gbstrlen(ambiguousTLDs[x])))) return(true); } return(false); }