Skip to content

fixed max_hit compute bug in jacobi_greedy_search_multilevel. #68

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fixed max_hit compute bug in jacobi_greedy_search_multilevel. #68

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 4 additions & 3 deletions lade/decoding.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1031,7 +1031,7 @@ def copy_from_last():

first_guess = next_tokens.item()
max_hit = 0
hits = [first_guess] + [0] * (GUESS_SIZE - 1)
hits = [first_guess] + [0] * GUESS_SIZE

new_results = []

Expand Down Expand Up @@ -1075,8 +1075,9 @@ def copy_from_last():
correct = [first_guess] + guess_results[egx:egx + GUESS_SIZE]
myguess = guess_tokens[egx:egx + GUESS_SIZE]
gg = 0
for gg in range(len(myguess)):
if myguess[gg] != correct[gg]:
# if all tokens in myguess equal to correct, gg should be len(myguess)
for gg in range(len(myguess) + 1):
if gg >= len(myguess) or myguess[gg] != correct[gg]:
break
if gg > max_hit:
max_hit = gg
Expand Down