sqrtminusone/biome
1
0
Fork 0
mirror of https://github.com/SqrtMinusOne/biome.git synced 2025-12-10 14:35:13 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

biome-query: fix grammar in docstring

Browse source
This commit is contained in:
Pavel Korytov 2023-10-15 22:30:51 +03:00
parent 57e984f44e
commit f931520566
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
biome-query.el
View file

@ -655,15 +655,15 @@ it's the length of the word."
The algorithm is as follows: NAME is split into words, each word
produces a list of all its prefixes. E.g. \"hello\" produces \"\",
\"h\", \"he\", \"hel\", etc. Numbers are takes as a whole,
\"h\", \"he\", \"hel\", etc. Numbers are taken as a whole,
e.g. \"100\" produces just \"\" and \"100\".
One key canditate is a concatenation of prefixes of the first
One key canditade is a concatenation of prefixes of the first
MAX-WORDS words, in the same order in which words appeared in NAME.
All possible key candidates are weighted by
`biome-query--unique-key-weight'. The iteration yields these
candidates in the ascending order by these weights, up to MAX-WEIGHT.
candidates in ascending order of those weights, up to MAX-WEIGHT.
This algorithm has exponential computational complexity because
it sorts the cartesian product of all prefixes of each word, and it