@@ -182,7 +182,7 @@ void q_reverse(struct list_head *head);
182
182
* @k: is a positive integer and is less than or equal to the length of the
183
183
* linked list.
184
184
*
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
186
186
* nothing.
187
187
*
188
188
* Reference:
@@ -195,7 +195,7 @@ void q_reverseK(struct list_head *head, int k);
195
195
* @head: header of queue
196
196
* @descend: whether or not to sort in descending order
197
197
*
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
199
199
* nothing.
200
200
*/
201
201
void q_sort (struct list_head * head , bool descend );
@@ -205,7 +205,7 @@ void q_sort(struct list_head *head, bool descend);
205
205
* value anywhere to the right side of it.
206
206
* @head: header of queue
207
207
*
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
209
209
* nothing.
210
210
*
211
211
* Reference:
@@ -220,7 +220,7 @@ int q_ascend(struct list_head *head);
220
220
* value anywhere to the right side of it.
221
221
* @head: header of queue
222
222
*
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
224
224
* nothing.
225
225
*
226
226
* Reference:
0 commit comments