Documentation for Bernstein-Vazirani Algorithm

[claudefalbriard]

at function: def run(self, cxn, bitstring_map):

Please clarify the required input format for the second parameter called bitstring_map: :param Dict[String, String] bitstring_map: a truth table describing the boolean function, whose dot-product vector and bias is to be found

An basic code example would be helpful to to better understand and implement the algorithm from the forest pyquil grove library. Thanks for support.