@@ -182,7 +182,7 @@ void q_reverse(struct list_head *head);
182182 * @k: is a positive integer and is less than or equal to the length of the
183183 * linked list.
184184 *
185- * No effect if queue is NULL or empty. If there has only one element, do
185+ * No effect if queue is NULL or empty. If there is only one element, do
186186 * nothing.
187187 *
188188 * Reference:
@@ -195,7 +195,7 @@ void q_reverseK(struct list_head *head, int k);
195195 * @head: header of queue
196196 * @descend: whether or not to sort in descending order
197197 *
198- * No effect if queue is NULL or empty. If there has only one element, do
198+ * No effect if queue is NULL or empty. If there is only one element, do
199199 * nothing.
200200 */
201201void q_sort (struct list_head * head , bool descend );
@@ -205,7 +205,7 @@ void q_sort(struct list_head *head, bool descend);
205205 * value anywhere to the right side of it.
206206 * @head: header of queue
207207 *
208- * No effect if queue is NULL or empty. If there has only one element, do
208+ * No effect if queue is NULL or empty. If there is only one element, do
209209 * nothing.
210210 *
211211 * Reference:
@@ -220,7 +220,7 @@ int q_ascend(struct list_head *head);
220220 * value anywhere to the right side of it.
221221 * @head: header of queue
222222 *
223- * No effect if queue is NULL or empty. If there has only one element, do
223+ * No effect if queue is NULL or empty. If there is only one element, do
224224 * nothing.
225225 *
226226 * Reference:
0 commit comments