@@ -26,19 +26,24 @@ impl URLSearchParams {
26
26
/// ```
27
27
/// use ada_url::URLSearchParams;
28
28
/// let params = URLSearchParams::parse("a=1&b=2");
29
- /// assert_eq!(params.size (), 2);
29
+ /// assert_eq!(params.len (), 2);
30
30
/// ```
31
- pub fn size ( & self ) -> usize {
31
+ pub fn len ( & self ) -> usize {
32
32
unsafe { ffi:: ada_search_params_size ( self . 0 ) }
33
33
}
34
34
35
+ /// Returns true if no entries exist in the URLSearchParams.
36
+ pub fn is_empty ( & self ) -> bool {
37
+ self . len ( ) == 0
38
+ }
39
+
35
40
/// Sorts the keys of the URLSearchParams struct.
36
- pub fn sort ( & self ) {
41
+ pub fn sort ( & mut self ) {
37
42
unsafe { ffi:: ada_search_params_sort ( self . 0 ) }
38
43
}
39
44
40
45
/// Appends a key/value to the URLSearchParams struct.
41
- pub fn append ( & self , key : & str , value : & str ) {
46
+ pub fn append ( & mut self , key : & str , value : & str ) {
42
47
unsafe {
43
48
ffi:: ada_search_params_append (
44
49
self . 0 ,
@@ -50,16 +55,16 @@ impl URLSearchParams {
50
55
}
51
56
}
52
57
53
- /// Removes all keys pre-existing keys from the URLSearchParams struct
58
+ /// Removes all pre-existing keys from the URLSearchParams struct
54
59
/// and appends the new key/value.
55
60
///
56
61
/// ```
57
62
/// use ada_url::URLSearchParams;
58
- /// let params = URLSearchParams::parse("a=1&b=2");
63
+ /// let mut params = URLSearchParams::parse("a=1&b=2");
59
64
/// params.set("a", "3");
60
65
/// assert_eq!(params.get("a"), Some("3"));
61
66
/// ```
62
- pub fn set ( & self , key : & str , value : & str ) {
67
+ pub fn set ( & mut self , key : & str , value : & str ) {
63
68
unsafe {
64
69
ffi:: ada_search_params_set (
65
70
self . 0 ,
@@ -77,11 +82,11 @@ impl URLSearchParams {
77
82
///
78
83
/// ```
79
84
/// use ada_url::URLSearchParams;
80
- /// let params = URLSearchParams::parse("a=1&b=2");
85
+ /// let mut params = URLSearchParams::parse("a=1&b=2");
81
86
/// params.remove("a", Some("1"));
82
87
/// assert_eq!(params.get("a"), None);
83
88
/// ```
84
- pub fn remove ( & self , key : & str , value : Option < & str > ) {
89
+ pub fn remove ( & mut self , key : & str , value : Option < & str > ) {
85
90
if let Some ( value) = value {
86
91
unsafe {
87
92
ffi:: ada_search_params_remove_value (
@@ -97,14 +102,14 @@ impl URLSearchParams {
97
102
}
98
103
}
99
104
100
- /// Retruns true if the URLSearchParams struct contains the key.
105
+ /// Returns whether the [` URLSearchParams`] contains the ` key` .
101
106
///
102
107
/// ```
103
108
/// use ada_url::URLSearchParams;
104
109
/// let params = URLSearchParams::parse("a=1&b=2");
105
- /// assert_eq!(params.has ("a", None), true);
110
+ /// assert_eq!(params.contains ("a", None), true);
106
111
/// ```
107
- pub fn has ( & self , key : & str , value : Option < & str > ) -> bool {
112
+ pub fn contains ( & self , key : & str , value : Option < & str > ) -> bool {
108
113
if let Some ( value) = value {
109
114
unsafe {
110
115
ffi:: ada_search_params_has_value (
@@ -158,7 +163,7 @@ impl URLSearchParams {
158
163
/// use ada_url::URLSearchParams;
159
164
/// let params = URLSearchParams::parse("a=1&a=2");
160
165
/// let pairs = params.get_all("a");
161
- /// assert_eq!(pairs.get_size (), 2);
166
+ /// assert_eq!(pairs.len (), 2);
162
167
/// ```
163
168
pub fn get_all ( & self , key : & str ) -> URLSearchParamsEntry {
164
169
unsafe {
@@ -173,9 +178,9 @@ impl URLSearchParams {
173
178
/// ```
174
179
/// use ada_url::URLSearchParams;
175
180
/// let params = URLSearchParams::parse("a=1");
176
- /// let mut keys = params.get_keys ();
181
+ /// let mut keys = params.keys ();
177
182
/// assert!(keys.has_next());
178
- pub fn get_keys ( & self ) -> URLSearchParamsKeysIterator {
183
+ pub fn keys ( & self ) -> URLSearchParamsKeysIterator {
179
184
let iterator = unsafe { ffi:: ada_search_params_get_keys ( self . 0 ) } ;
180
185
URLSearchParamsKeysIterator :: new ( iterator)
181
186
}
@@ -185,9 +190,9 @@ impl URLSearchParams {
185
190
/// ```
186
191
/// use ada_url::URLSearchParams;
187
192
/// let params = URLSearchParams::parse("a=1");
188
- /// let mut values = params.get_values ();
193
+ /// let mut values = params.values ();
189
194
/// assert!(values.has_next());
190
- pub fn get_values ( & self ) -> URLSearchParamsValuesIterator {
195
+ pub fn values ( & self ) -> URLSearchParamsValuesIterator {
191
196
let iterator = unsafe { ffi:: ada_search_params_get_values ( self . 0 ) } ;
192
197
URLSearchParamsValuesIterator :: new ( iterator)
193
198
}
@@ -211,7 +216,7 @@ impl URLSearchParamsKeysIterator<'_> {
211
216
}
212
217
213
218
/// Returns a new value if it's available
214
- pub fn get_next ( & self ) -> Option < & str > {
219
+ pub fn get_next ( & mut self ) -> Option < & str > {
215
220
if self . has_next ( ) {
216
221
return None ;
217
222
}
@@ -258,7 +263,7 @@ impl URLSearchParamsValuesIterator<'_> {
258
263
}
259
264
260
265
/// Returns a new value if it's available
261
- pub fn get_next ( & self ) -> Option < & str > {
266
+ pub fn get_next ( & mut self ) -> Option < & str > {
262
267
if self . has_next ( ) {
263
268
return None ;
264
269
}
@@ -300,9 +305,9 @@ impl<'a> URLSearchParamsEntry<'a> {
300
305
/// use ada_url::URLSearchParams;
301
306
/// let params = URLSearchParams::parse("a=1&b=2");
302
307
/// let pairs = params.get_all("a");
303
- /// assert_eq!(pairs.get_size (), 1);
308
+ /// assert_eq!(pairs.len (), 1);
304
309
/// ```
305
- pub fn get_size ( & self ) -> usize {
310
+ pub fn len ( & self ) -> usize {
306
311
self . size
307
312
}
308
313
@@ -312,7 +317,7 @@ impl<'a> URLSearchParamsEntry<'a> {
312
317
/// use ada_url::URLSearchParams;
313
318
/// let params = URLSearchParams::parse("a=1&a=2");
314
319
/// let pairs = params.get_all("a");
315
- /// assert_eq!(pairs.get_size (), 2);
320
+ /// assert_eq!(pairs.len (), 2);
316
321
/// assert_eq!(pairs.get(0), Some("1"));
317
322
/// assert_eq!(pairs.get(1), Some("2"));
318
323
/// assert_eq!(pairs.get(2), None);
0 commit comments