Skip to content
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.

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

Already on GitHub? Sign in to your account

Support search by /s:keyword - symbol, /n:keyword - name #254

Merged
merged 3 commits into from
Oct 29, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
32 changes: 31 additions & 1 deletion cointop/search.go
Original file line number Diff line number Diff line change
Expand Up @@ -93,6 +93,22 @@ func (ct *Cointop) Search(q string) error {
ct.State.lastSearchQuery = q
}

canSearchSymbol := true
canSearchName := true
if strings.HasPrefix(q, "s:") {
canSearchSymbol = true
canSearchName = false
q = q[2:]
log.Debug("Search, by keyword")
}

if strings.HasPrefix(q, "n:") {
canSearchSymbol = false
canSearchName = true
q = q[2:]
log.Debug("Search, by name")
}

idx := -1
min := -1
var hasprefixidx []int
Expand All @@ -107,16 +123,23 @@ func (ct *Cointop) Search(q string) error {
coin := ct.State.allCoins[i]
name := strings.ToLower(coin.Name)
symbol := strings.ToLower(coin.Symbol)

// if query matches symbol, return immediately
if symbol == q {
if canSearchSymbol && symbol == q {
vuon9 marked this conversation as resolved.
Show resolved Hide resolved
ct.GoToGlobalIndex(i)
return nil
}

if !canSearchName {
continue
}

// if query matches name, return immediately
if name == q {
vuon9 marked this conversation as resolved.
Show resolved Hide resolved
ct.GoToGlobalIndex(i)
return nil
}

// store index with the smallest levenshtein
dist := levenshtein.DamerauLevenshteinDistance(name, q)
if min == -1 || dist <= min {
Expand All @@ -131,15 +154,22 @@ func (ct *Cointop) Search(q string) error {
}
}
}

if !canSearchName {
return nil
}

// go to row if prefix match
if len(hasprefixidx) > 0 && hasprefixidx[0] != -1 && min > 0 {
ct.GoToGlobalIndex(hasprefixidx[0])
return nil
}

// go to row if levenshtein distance is small enough
if idx > -1 && min <= 6 {
ct.GoToGlobalIndex(idx)
return nil
}

return nil
}
2 changes: 2 additions & 0 deletions docs/content/faq.md
Original file line number Diff line number Diff line change
Expand Up @@ -134,6 +134,8 @@ draft: false
The default key to open search is <kbd>/</kbd>. Type the search query after the `/` in the field and hit <kbd>Enter</kbd>.
Each search starts from the current cursor position. To search for the same term again, hit <kbd>/</kbd> then <kbd>Enter</kbd>.

The default behaviour will start to search by symbol first, then it will continues searching by name if there is no result. To search by only symbol, type the search query after `/s:`. To search by only name, type the search query after `/n:`.

## How do I exit search?

Press <kbd>Esc</kbd> to exit search.
Expand Down