def insert_entry_for_bucket(self, bucket_key, tree_depth):
<EOL>self.vector_count = self.vector_count + <NUM_LIT:1><EOL>if tree_depth < len(bucket_key):<EOL><INDENT>hash_char = bucket_key[tree_depth]<EOL>if not hash_char in self.childs:<EOL><INDENT>self.childs[hash_char] = RandomBinaryProjectionTreeNode()<EOL><DEDENT>self.childs[hash_char].insert_entry_for_bucket(bucket_key, tree_depth+<NUM_LIT:1>)<EOL><DEDENT>else:<EOL><INDENT>if not self.bucket_key is None:<EOL><INDENT>if self.bucket_key != bucket_key:<EOL><INDENT>raise AttributeError<EOL><DEDENT><DEDENT>self.bucket_key = bucket_key<EOL><DEDENT>
Increases counter for specified bucket_key (leaf of tree) and
also increases counters along the way from the root to the leaf.