src/sorterinterface.cpp
bool SorterInterface::firstLessThanSecond(const QVariantMap &first, const QVariantMap &second) const
{
    if (first.empty() && !second.empty()) {
         return true;
    }

    if (second.empty()) {
         return false;
    }

    return first.value(NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE).toInt()
           < second.value(NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE).toInt();
}
// The default sorting algorithm is to sort by type.
The default sorting algorithm is to sort by type.
The default sorting algorithm is to sort by type .
bool SorterInterface::firstLessThanSecond(const QVariantMap &first, const QVariantMap &second) const
{
    if (first.empty() && !second.empty()) {
         return true;
    }
    if (second.empty()) {
         return false;
    }
    return first.value(NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE).toInt()
           < second.value(NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE).toInt();
}
bool SorterInterface :: firstLessThanSecond ( const QVariantMap & first , const QVariantMap & second ) const { if ( first . empty ( ) && ! second . empty ( ) ) { return true ; } if ( second . empty ( ) ) { return false ; } return first . value ( NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE ) . toInt ( ) < second . value ( NEMOQMLPLUGINS_SOCIAL_CONTENTITEMTYPE ) . toInt ( ) ; }
The default sorting algorithm is to sort by type.
The default sorting algorithm is to sort by type .