a194557ba754f9b14d473ff9e39a2bc2449e58c1,qiskit_acqua/ising/maxcut.py,,sample_most_likely,#Any#Any#,155

Before Change


            count = state_vector.get(state, 0)
            temp_vec[i] = count
            total += count
        state_vector = temp_vec / float(total)

    k = np.argmax(np.abs(state_vector))
    x = np.zeros(n)
    for i in range(n):

After Change


    
    if isinstance(state_vector, dict) or isinstance(state_vector, OrderedDict):
        // get the binary string with the largest count
        binary_string = sorted(state_vector.items(), key=lambda kv: kv[1])[-1][0]
        x = np.asarray([int(y) for y in list(binary_string)])
        return x
    else:
        n = int(np.log2(state_vector.shape[0]))
Italian Trulli
In pattern: SUPERPATTERN

Frequency: 3

Non-data size: 5

Instances


Project Name: Qiskit/qiskit-aqua
Commit Name: a194557ba754f9b14d473ff9e39a2bc2449e58c1
Time: 2018-07-06
Author: chenrich@us.ibm.com
File Name: qiskit_acqua/ising/maxcut.py
Class Name:
Method Name: sample_most_likely


Project Name: snipsco/snips-nlu
Commit Name: fe31edaf082b894a7abde79a71d533f67ca9e145
Time: 2019-04-29
Author: adrien.ball@snips.ai
File Name: snips_nlu/intent_parser/deterministic_intent_parser.py
Class Name: DeterministicIntentParser
Method Name: _parse_top_intents


Project Name: Qiskit/qiskit-aqua
Commit Name: d892fb853c4c296539034d2dbaf304c0d06a357d
Time: 2018-07-06
Author: 34400304+liupibm@users.noreply.github.com
File Name: qiskit_acqua/ising/graphpartition.py
Class Name:
Method Name: sample_most_likely