sort() [2/2]

template<typename T>

template<typename Compare>

void fl::list< T >::sort ( Compare comp )

inline

Definition at line 529 of file list.h.

                            {
        // Insertion sort with custom comparator
        if (mSize <= 1) {
            return;
        }
 
        Node* sorted_end = mHead->next;
 
        while (sorted_end->next != mHead) {
            Node* current = sorted_end->next;
 
            // Find insertion point in sorted portion
            Node* insert_pos = mHead->next;
            while (insert_pos != sorted_end->next && comp(insert_pos->data, current->data)) {
                insert_pos = insert_pos->next;
            }
 
            // If current is already in correct position
            if (insert_pos == current) {
                sorted_end = current;
            } else {
                // Remove current from its position
                unlink(current);
                // Insert before insert_pos
                link_before(insert_pos, current);
            }
        }
    }

References fl::list< T >::Node::data, link_before(), mHead, mSize, fl::list< T >::Node::next, and unlink().

Here is the call graph for this function: