Skip to content

Reduce memory use in case-based tokenization. #8375

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

Merged
merged 1 commit into from
Dec 9, 2024
Merged

Reduce memory use in case-based tokenization. #8375

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
22 changes: 11 additions & 11 deletions app/lib/search/text_utils.dart
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -102,23 +102,23 @@ Map<String, double>? tokenize(String? originalText, {bool isSplit = false}) {

// Scan for CamelCase phrases and extract Camel and Case separately.
final wordCodeUnits = word.codeUnits;
final changeIndex = <int>[0];
bool prevLower = _isLower(wordCodeUnits[0]);
for (int i = 1; i < word.length; i++) {
final lower = _isLower(wordCodeUnits[i]);
if (!lower && prevLower) {
changeIndex.add(i);
int prevIndex = 0;
for (int i = 1; i <= word.length; i++) {
if (i < word.length) {
final lower = _isLower(wordCodeUnits[i]);
final isChanging = !lower && prevLower;
prevLower = lower;
if (!isChanging) continue;
}
prevLower = lower;
}
changeIndex.add(word.length);
for (int i = 1; i < changeIndex.length; i++) {
final token = normalizeBeforeIndexing(
word.substring(changeIndex[i - 1], changeIndex[i]));

final token = normalizeBeforeIndexing(word.substring(prevIndex, i));
final weight = math.pow((token.length / word.length), 0.5).toDouble();
if ((tokens[token] ?? 0.0) < weight) {
tokens[token] = weight;
}

prevIndex = i;
}
}
return tokens;
Expand Down
Loading