mapshash tablesand skip lists an implementation of cyclic-shift hash code computation for character string in python appears as followsdef hash code( )mask ( < = for character in sh ( +ord(characterreturn limit to -bit integers -bit cyclic shift of running sum add in value of next character as with the traditional polynomial hash codefine-tuning is required when using cyclic-shift hash codeas we must wisely choose the amount to shift by for each new character our choice of -bit shift is justified by experiments run on list of just over , english wordscomparing the number of collisions for various shift amounts (see table shift collisions total max table comparison of collision behavior for the cyclic-shift hash code as applied to list of , english words the "totalcolumn records the total number of words that collide with at least one otherand the "maxcolumn records the maximum number of words colliding at any one hash code note that with cyclic shift of this hash code reverts to the one that simply sums all the characters