Like glib.sequence.Sequence.insertSorted, but uses a #GSequenceIterCompareFunc instead of a #GCompareDataFunc as the compare function.
iter_cmp is called with two iterators pointing into seq. It should return 0 if the iterators are equal, a negative value if the first iterator comes before the second, and a positive value if the second iterator comes before the first.
Note that when adding a large amount of data to a #GSequence, it is more efficient to do unsorted insertions and then call glib.sequence.Sequence.sort or glib.sequence.Sequence.sortIter.
data for the new item
the function used to compare iterators in the sequence
a #GSequenceIter pointing to the new item
Like glib.sequence.Sequence.insertSorted, but uses a #GSequenceIterCompareFunc instead of a #GCompareDataFunc as the compare function.
iter_cmp is called with two iterators pointing into seq. It should return 0 if the iterators are equal, a negative value if the first iterator comes before the second, and a positive value if the second iterator comes before the first.
Note that when adding a large amount of data to a #GSequence, it is more efficient to do unsorted insertions and then call glib.sequence.Sequence.sort or glib.sequence.Sequence.sortIter.