def get_node_pos(self, string_key):
if not self.ring:<EOL><INDENT>return None<EOL><DEDENT>key = self.gen_key(string_key)<EOL>nodes = self._sorted_keys<EOL>pos = bisect(nodes, key)<EOL>if pos == len(nodes):<EOL><INDENT>return <NUM_LIT:0><EOL><DEDENT>else:<EOL><INDENT>return pos<EOL><DEDENT>
Given a string key a corresponding node in the hash ring is returned
        along with it's position in the ring.

        If the hash ring is empty, (`None`, `None`) is returned.