*
* The #GSequence data structure has the API of a list, but is
* implemented internally with a balanced binary tree. This means that
- * it is possible to maintain a sorted list of n elements in time O(n
- * log n). The data contained in each element can be either integer
- * values, by using of the <link
- * linkend="glib-Type-Conversion-Macros">Type Conversion Macros</link>,
- * or simply pointers to any type of data.
- *
- * A #GSequence is accessed through <firstterm>iterators</firstterm>,
- * represented by a #GSequenceIter. An iterator represents a position
- * between two elements of the sequence. For example, the
- * <firstterm>begin</firstterm> iterator represents the gap immediately
- * before the first element of the sequence, and the
- * <firstterm>end</firstterm> iterator represents the gap immediately
+ * it is possible to maintain a sorted list of n elements in time O(n log n).
+ * The data contained in each element can be either integer values, by using
+ * of the [Type Conversion Macros][glib-Type-Conversion-Macros], or simply
+ * pointers to any type of data.
+ *
+ * A #GSequence is accessed through "iterators", represented by a
+ * #GSequenceIter. An iterator represents a position between two
+ * elements of the sequence. For example, the "begin" iterator
+ * represents the gap immediately before the first element of the
+ * sequence, and the "end" iterator represents the gap immediately
* after the last element. In an empty sequence, the begin and end
* iterators are the same.
*
*
* The function g_sequence_get() is used with an iterator to access the
* element immediately following the gap that the iterator represents.
- * The iterator is said to <firstterm>point</firstterm> to that element.
+ * The iterator is said to "point" to that element.
*
* Iterators are stable across most operations on a #GSequence. For
* example an iterator pointing to some element of a sequence will
* GSequence:
*
* The #GSequence struct is an opaque data type representing a
- * <link linkend="glib-Sequences">Sequence</link> data type.
+ * [sequence][glib-Sequences] data type.
*/
struct _GSequence
{
* be called on all items when the sequence is destroyed and on items that
* are removed from the sequence.
*
- * Return value: a new #GSequence
+ * Returns: a new #GSequence
*
* Since: 2.14
**/
* The @begin and @end iterators must both point to the same sequence
* and @begin must come before or be equal to @end in the sequence.
*
- * Return value: a #GSequenceIter pointing somewhere in the
+ * Returns: a #GSequenceIter pointing somewhere in the
* (@begin, @end) range
*
* Since: 2.14
*
* The @a and @b iterators must point into the same sequence.
*
- * Return value: a negative number if @a comes before @b, 0 if they are
+ * Returns: a negative number if @a comes before @b, 0 if they are
* equal, and a positive number if @a comes after @b
*
* Since: 2.14
*
* Adds a new item to the end of @seq.
*
- * Return value: an iterator pointing to the new item
+ * Returns: an iterator pointing to the new item
*
* Since: 2.14
*/
*
* Adds a new item to the front of @seq
*
- * Return value: an iterator pointing to the new item
+ * Returns: an iterator pointing to the new item
*
* Since: 2.14
*/
*
* Inserts a new item just before the item pointed to by @iter.
*
- * Return value: an iterator pointing to the new item
+ * Returns: an iterator pointing to the new item
*
* Since: 2.14
*/
* if the first item comes before the second, and a positive value
* if the second item comes before the first.
*
- * Return value: a #GSequenceIter pointing to the new item.
+ * Returns: a #GSequenceIter pointing to the new item.
*
* Since: 2.14
*/
* you want to add a large amount of data, call g_sequence_sort() after
* doing unsorted insertions.
*
- * Return value: an #GSequenceIter pointing to the position where @data
+ * Returns: an #GSequenceIter pointing to the position where @data
* would have been inserted according to @cmp_func and @cmp_data
*
* Since: 2.14
* you want to add a large amount of data, call g_sequence_sort() after
* doing unsorted insertions.
*
- * Return value: an #GSequenceIter pointing to the position of the
+ * Returns: an #GSequenceIter pointing to the position of the
* first item found equal to @data according to @cmp_func and
* @cmp_data, or %NULL if no such item exists
*
* first iterator comes before the second, and a positive value
* if the second iterator comes before the first.
*
- * Return value: a #GSequenceIter pointing to the new item
+ * Returns: a #GSequenceIter pointing to the new item
*
* Since: 2.14
*/
* you want to add a large amount of data, call g_sequence_sort() after
* doing unsorted insertions.
*
- * Return value: a #GSequenceIter pointing to the position in @seq
+ * Returns: a #GSequenceIter pointing to the position in @seq
* where @data would have been inserted according to @iter_cmp
* and @cmp_data
*
* you want to add a large amount of data, call g_sequence_sort() after
* doing unsorted insertions.
*
- * Return value: an #GSequenceIter pointing to the position of
+ * Returns: an #GSequenceIter pointing to the position of
* the first item found equal to @data according to @cmp_func
* and @cmp_data, or %NULL if no such item exists
*
*
* Returns the #GSequence that @iter points into.
*
- * Return value: the #GSequence that @iter points into
+ * Returns: the #GSequence that @iter points into
*
* Since: 2.14
*/
*
* Returns the data that @iter points to.
*
- * Return value: the data that @iter points to
+ * Returns: the data that @iter points to
*
* Since: 2.14
*/
*
* Returns the length of @seq
*
- * Return value: the length of @seq
+ * Returns: the length of @seq
*
* Since: 2.14
*/
*
* Returns the end iterator for @seg
*
- * Return value: the end iterator for @seq
+ * Returns: the end iterator for @seq
*
* Since: 2.14
*/
*
* Returns the begin iterator for @seq.
*
- * Return value: the begin iterator for @seq.
+ * Returns: the begin iterator for @seq.
*
* Since: 2.14
*/
* Returns the iterator at position @pos. If @pos is negative or larger
* than the number of items in @seq, the end iterator is returned.
*
- * Return value: The #GSequenceIter at position @pos
+ * Returns: The #GSequenceIter at position @pos
*
* Since: 2.14
*/
*
* Returns whether @iter is the end iterator
*
- * Return value: Whether @iter is the end iterator
+ * Returns: Whether @iter is the end iterator
*
* Since: 2.14
*/
*
* Returns whether @iter is the begin iterator
*
- * Return value: whether @iter is the begin iterator
+ * Returns: whether @iter is the begin iterator
*
* Since: 2.14
*/
*
* Returns the position of @iter
*
- * Return value: the position of @iter
+ * Returns: the position of @iter
*
* Since: 2.14
*/
* Returns an iterator pointing to the next position after @iter.
* If @iter is the end iterator, the end iterator is returned.
*
- * Return value: a #GSequenceIter pointing to the next position after @iter
+ * Returns: a #GSequenceIter pointing to the next position after @iter
*
* Since: 2.14
*/
* Returns an iterator pointing to the previous position before @iter.
* If @iter is the begin iterator, the begin iterator is returned.
*
- * Return value: a #GSequenceIter pointing to the previous position
+ * Returns: a #GSequenceIter pointing to the previous position
* before @iter
*
* Since: 2.14
* the begin iterator is returned. If @iter is closer than @delta positions
* to the end of the sequence, the end iterator is returned.
*
- * Return value: a #GSequenceIter which is @delta positions away from @iter
+ * Returns: a #GSequenceIter which is @delta positions away from @iter
*
* Since: 2.14
*/