@@ -271,7 +271,7 @@ defmodule HPAX.Table do
271
271
current -> min ( current , new_protocol_max_table_size )
272
272
end
273
273
274
- % __MODULE__ {
274
+ % {
275
275
evict_to_size ( table , new_protocol_max_table_size )
276
276
| protocol_max_table_size: new_protocol_max_table_size ,
277
277
max_table_size: new_protocol_max_table_size ,
@@ -280,7 +280,7 @@ defmodule HPAX.Table do
280
280
end
281
281
282
282
def dynamic_resize ( % __MODULE__ { } = table , new_max_table_size ) do
283
- % __MODULE__ {
283
+ % {
284
284
evict_to_size ( table , new_max_table_size )
285
285
| max_table_size: new_max_table_size
286
286
}
@@ -295,15 +295,15 @@ defmodule HPAX.Table do
295
295
Additionally, if the current max table size is larger than this value, it is also included int
296
296
the list, per https://www.rfc-editor.org/rfc/rfc7541#section-4.2
297
297
"""
298
- def pop_pending_resizes ( % { pending_minimum_resize: nil } = table ) , do: { table , [ ] }
298
+ def pop_pending_resizes ( % __MODULE__ { pending_minimum_resize: nil } = table ) , do: { table , [ ] }
299
299
300
- def pop_pending_resizes ( table ) do
300
+ def pop_pending_resizes ( % __MODULE__ { } = table ) do
301
301
pending_resizes =
302
302
if table . max_table_size > table . pending_minimum_resize ,
303
303
do: [ table . pending_minimum_resize , table . max_table_size ] ,
304
304
else: [ table . pending_minimum_resize ]
305
305
306
- { % __MODULE__ { table | pending_minimum_resize: nil } , pending_resizes }
306
+ { % { table | pending_minimum_resize: nil } , pending_resizes }
307
307
end
308
308
309
309
# Removes records as necessary to have the total size of entries within the table be less than
@@ -314,7 +314,7 @@ defmodule HPAX.Table do
314
314
{ new_entries_reversed , new_size } =
315
315
evict_towards_size ( Enum . reverse ( entries ) , size , new_size )
316
316
317
- % __MODULE__ {
317
+ % {
318
318
table
319
319
| entries: Enum . reverse ( new_entries_reversed ) ,
320
320
size: new_size ,
0 commit comments