-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsearch.go
135 lines (116 loc) · 4.25 KB
/
search.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
Copyright (c) 2018 Carl Löndahl. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
* Neither the name of Pass Desktop nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package main
import (
"fmt"
"log"
"github.com/murlokswarm/app"
"pass/rest"
"strings"
)
type Search struct {
Query string
Result []rest.Name
}
func (h *Search) Render() string {
// Ouput
filteredNameList := `
<div class="WindowLayout">
<div class="SearchLayout">
<input type="text"
value="{{html .Query}}"
placeholder="Account"
onchange="DoSearchQuery"
autofocus="true"
autocomplete="off"
autocorrect="off"
autocapitalize="off"
spellcheck="false"
selectable="on"
class="editable searchfield"/>
<div clickable="on"
class="scrollable">
<div class="animated">
<ul>`
// Since we need to concatenate the results to a string, it is
// cheapest (both in terms of memory and computations) to perform
// filtering at this stage, rather than earlier filtering of the list.
for _, name := range h.Result {
// Due to optimization, we have encoded some data in the name.
// We extract this data.
title, label, image := rest.DecodeName(name.Text)
// Get the icon if it exists, otherwise, substitue.
filename := GetImageName(image)
// Match the query against the current item to decide if we
// should display it or not.
if h.Query == "" || strings.Contains(strings.ToLower(title), strings.ToLower(h.Query)) {
// Append to output.
filteredNameList = filteredNameList + fmt.Sprintf(`
<a href="%s?Name=%s;Encrypted=%s">
<li>
<img src="iconpack/%s.png"/>
<div class="SearchListItemCaption">%s</div>
<div class="SearchListItemLabel">%s</div>
</li>
</a>`,
label, title, name.Encrypted, filename, title, label)
}
}
// Just to make the code look a bit cleaner.
filteredNameList = filteredNameList + `
</ul>
</div>
</div>
</div>
</div>`
return filteredNameList
}
func (h *Search) Prefetch(query string) {
// Fetch from Vault.
r, err := restClient.VaultListSecrets()
// Update query field.
h.Query = query
if err != nil {
log.Println(err)
return
}
h.Result = *r
}
func (h *Search) DoSearchQuery(arg app.ChangeArg) {
// ...and fetch accounts based on query.
h.Prefetch(arg.Value)
app.Render(h)
}
func NavigateBack(query string) {
// This is used by other windows, to get less code repetition.
s := Search{}
s.Prefetch(query)
win.Mount(&s)
}
func init() {
app.RegisterComponent(&Search{})
}