summaryrefslogtreecommitdiff
path: root/client/discovery.go
diff options
context:
space:
mode:
authorJeroen Wijenbergh <jeroenwijenbergh@protonmail.com>2024-05-27 13:40:38 +0200
committerJeroen Wijenbergh <46386452+jwijenbergh@users.noreply.github.com>2024-05-29 14:36:10 +0200
commit820e70aed9c77f05a9275a789966f13453f330fd (patch)
treeaacccd33ce8d184be7b34c86acb87b11fc0e0449 /client/discovery.go
parentd8123e814d37669daca4cf69107109f9009d39fa (diff)
Format: Run gofumpt
Diffstat (limited to 'client/discovery.go')
-rw-r--r--client/discovery.go24
1 files changed, 12 insertions, 12 deletions
diff --git a/client/discovery.go b/client/discovery.go
index 72f0ad5..d874c64 100644
--- a/client/discovery.go
+++ b/client/discovery.go
@@ -36,8 +36,8 @@ func (c *Client) DiscoOrganizations(ck *cookie.Cookie, search string) (*discotyp
var retOrgs []discotypes.Organization
for _, v := range orgs.List {
if search == "" {
- retOrgs = append(retOrgs, v.Organization)
- continue
+ retOrgs = append(retOrgs, v.Organization)
+ continue
}
score := v.Score(search)
if score < 0 {
@@ -47,10 +47,10 @@ func (c *Client) DiscoOrganizations(ck *cookie.Cookie, search string) (*discotyp
retOrgs = append(retOrgs, v.Organization)
}
if search != "" {
- sort.Slice(retOrgs, func(i, j int) bool {
- // lower score is better
- return retOrgs[i].Score < retOrgs[j].Score
- })
+ sort.Slice(retOrgs, func(i, j int) bool {
+ // lower score is better
+ return retOrgs[i].Score < retOrgs[j].Score
+ })
}
return &discotypes.Organizations{
List: retOrgs,
@@ -79,8 +79,8 @@ func (c *Client) DiscoServers(ck *cookie.Cookie, search string) (*discotypes.Ser
var retServs []discotypes.Server
for _, v := range servs.List {
if search == "" {
- retServs = append(retServs, v.Server)
- continue
+ retServs = append(retServs, v.Server)
+ continue
}
score := v.Score(search)
if score < 0 {
@@ -90,10 +90,10 @@ func (c *Client) DiscoServers(ck *cookie.Cookie, search string) (*discotypes.Ser
retServs = append(retServs, v.Server)
}
if search != "" {
- sort.Slice(retServs, func(i, j int) bool {
- // lower score is better
- return retServs[i].Score < retServs[j].Score
- })
+ sort.Slice(retServs, func(i, j int) bool {
+ // lower score is better
+ return retServs[i].Score < retServs[j].Score
+ })
}
return &discotypes.Servers{
List: retServs,