admin/mlib
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix format

Browse Source
This commit is contained in:
Patrick Pelissier committed 2022-03-14 19:28:49 +01:00
1 parent 845736c489
commit 22674f2b46
1 file changed
+4 -4
Download Patch File Download Diff File Expand all files Collapse all files
m-dict.h
+4 -4
View File
@@ -450,7 +450,7 @@
static inline void \ static inline void \
M_C3(m_d1ct_,name,_resize_up)(dict_t map) \ M_C3(m_d1ct_,name,_resize_up)(dict_t map) \
{ \ { \
/* NOTE: Contract may not be fulfilled here */ \ /* NOTE: Contract may not be fulfilled here */ \
size_t old_size = M_C(name, _array_list_pair_size)(map->table); \ size_t old_size = M_C(name, _array_list_pair_size)(map->table); \
size_t new_size = old_size * 2; \ size_t new_size = old_size * 2; \
if (M_UNLIKELY (new_size <= old_size)) { \ if (M_UNLIKELY (new_size <= old_size)) { \
@@ -490,7 +490,7 @@
static inline void \ static inline void \
M_C3(m_d1ct_,name,_resize_down)(dict_t map) \ M_C3(m_d1ct_,name,_resize_down)(dict_t map) \
{ \ { \
/* NOTE: Contract may not be fulfilled here */ \ /* NOTE: Contract may not be fulfilled here */ \
size_t old_size = M_C(name, _array_list_pair_size)(map->table); \ size_t old_size = M_C(name, _array_list_pair_size)(map->table); \
M_ASSERT ((old_size % 2) == 0); \ M_ASSERT ((old_size % 2) == 0); \
size_t new_size = old_size / 2; \ size_t new_size = old_size / 2; \
@@ -748,7 +748,7 @@
return true; \ return true; \
/* Otherwise this is the slow path : \ /* Otherwise this is the slow path : \
both dictionary may not have arrays with the same size, but \ both dictionary may not have arrays with the same size, but \
still the dictionaries shall be equal as they contain the same \ still the dictionaries shall be equal as they contain the same \
items. */ \ items. */ \
dict_it_t it; \ dict_it_t it; \
for(M_C(name, _it)(it, dict1) ; \ for(M_C(name, _it)(it, dict1) ; \
@@ -1025,7 +1025,7 @@
, /* NO UPDATE */) ) \ , /* NO UPDATE */) ) \
\ \
/* HASH method for dictionnary itself seems hard to implement: \ /* HASH method for dictionnary itself seems hard to implement: \
we have to handle the case where two dictionaries are structuraly \ we have to handle the case where two dictionaries are structuraly \
different, but functionnaly identical (seems they have the same \ different, but functionnaly identical (seems they have the same \
members, but put in a different order). \ members, but put in a different order). \
We cannot iterator over the dictionary to compute a hash, as the \ We cannot iterator over the dictionary to compute a hash, as the \