bool InnerDecklistNode::compare(AbstractDecklistNode *other) const { switch (sortMethod) { case 0: return compareNumber(other); case 1: return compareName(other); case 2: return comparePrice(other); } return 0; }
bool AbstractDecklistCardNode::compare(AbstractDecklistNode *other) const { switch (sortMethod) { case ByNumber: return compareNumber(other); case ByName: return compareName(other); case ByPrice: return compareTotalPrice(other); } return 0; }
int SdpCandidate::compareTo(UtlContainable const *rhs) const { int result ; const SdpCandidate* pCandidate = static_cast<const SdpCandidate*>(rhs); if (rhs->isInstanceOf(SdpCandidate::TYPE) && pCandidate) { result = compareNumber(mPriority, pCandidate->mPriority, true /* reverse */); // We want to order a list of these from highest priority to lowest if(0 == result) { // Priority should be unique, so we shouldn't get here, but implementation is included for completeness result = mFoundation.compareTo(pCandidate->mFoundation); } if(0 == result) { result = compareNumber(mId, pCandidate->mId); } if(0 == result) { result = compareNumber(mTransport, pCandidate->mTransport); } if(0 == result) { result = mConnectionAddress.compareTo(pCandidate->mConnectionAddress); } if(0 == result) { result = compareNumber(mPort, pCandidate->mPort); } if(0 == result) { result = compareNumber(mCandidateType, pCandidate->mCandidateType); } if(0 == result) { result = mRelatedAddress.compareTo(pCandidate->mRelatedAddress); } if(0 == result) { result = compareNumber(mRelatedPort, pCandidate->mRelatedPort); } } else { OsSysLog::add(FAC_SDP, PRI_ERR, "SdpCandidate::compareTo argument instance of: %s not instance of: %s", rhs->getContainableType(), SdpCandidate::TYPE); result = INT_MAX ; } return result ; }