<stis>My SIMD alist implementation is at least 7x faster that assq <stis>Assuming a keay val store withj precalculated hashes <stis>More testing reveal about 13X faster actually <stis>cache frienldy scanning of 2000 key/values is done in 100ns <stis>of cause normal hash tables are faster, but for the small lists teh call overhead is high <stis>ArneBab: I don't know I will investigate if it is beneficial to have a VM instruction for it. If that's the case, then yes, guile could benefit, <stis>you can all study the code it's in the guile-persists repo <ArneBab>(and is there a reason why you don’t split that up into header and code file?) <ArneBab>(and your hashish-macro made me smile — thank you!) ***roptat_ is now known as Guest5602