Merge pull request #254 from vuon9/feature/types-4-search-keyword

Support search by /s:keyword - symbol, /n:keyword - name
develop v1.6.10
Miguel Mota 3 years ago committed by GitHub
commit 9a9ee307d4
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

@ -93,6 +93,22 @@ func (ct *Cointop) Search(q string) error {
ct.State.lastSearchQuery = q 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 idx := -1
min := -1 min := -1
var hasprefixidx []int var hasprefixidx []int
@ -107,16 +123,23 @@ func (ct *Cointop) Search(q string) error {
coin := ct.State.allCoins[i] coin := ct.State.allCoins[i]
name := strings.ToLower(coin.Name) name := strings.ToLower(coin.Name)
symbol := strings.ToLower(coin.Symbol) symbol := strings.ToLower(coin.Symbol)
// if query matches symbol, return immediately // if query matches symbol, return immediately
if symbol == q { if canSearchSymbol && symbol == q {
ct.GoToGlobalIndex(i) ct.GoToGlobalIndex(i)
return nil return nil
} }
if !canSearchName {
continue
}
// if query matches name, return immediately // if query matches name, return immediately
if name == q { if name == q {
ct.GoToGlobalIndex(i) ct.GoToGlobalIndex(i)
return nil return nil
} }
// store index with the smallest levenshtein // store index with the smallest levenshtein
dist := levenshtein.DamerauLevenshteinDistance(name, q) dist := levenshtein.DamerauLevenshteinDistance(name, q)
if min == -1 || dist <= min { if min == -1 || dist <= min {
@ -131,15 +154,22 @@ func (ct *Cointop) Search(q string) error {
} }
} }
} }
if !canSearchName {
return nil
}
// go to row if prefix match // go to row if prefix match
if len(hasprefixidx) > 0 && hasprefixidx[0] != -1 && min > 0 { if len(hasprefixidx) > 0 && hasprefixidx[0] != -1 && min > 0 {
ct.GoToGlobalIndex(hasprefixidx[0]) ct.GoToGlobalIndex(hasprefixidx[0])
return nil return nil
} }
// go to row if levenshtein distance is small enough // go to row if levenshtein distance is small enough
if idx > -1 && min <= 6 { if idx > -1 && min <= 6 {
ct.GoToGlobalIndex(idx) ct.GoToGlobalIndex(idx)
return nil return nil
} }
return nil return nil
} }

@ -135,6 +135,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>. 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>. 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? ## How do I exit search?
Press <kbd>Esc</kbd> to exit search. Press <kbd>Esc</kbd> to exit search.

Loading…
Cancel
Save