-
Notifications
You must be signed in to change notification settings - Fork 0
/
view.go
98 lines (84 loc) · 1.86 KB
/
view.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
// Copyright (c) 2022 The Go-Enjin Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package index
type Views []*View
type View struct {
Index int
Key string
Url string
Label string
Present bool
Filters Filters
HasFilters bool
Paginate string
NextMore string
FirstPage string
PrevPage string
NextPage string
LastPage string
PageNumber int
TotalPages int
SearchAction string
}
func makeView(idx int, key, label string, filters Filters) (view *View) {
view = &View{
Index: idx,
Key: key,
Label: label,
Filters: filters,
HasFilters: len(filters) > 0,
Present: false,
}
return
}
func (v Views) HasFilters() (has bool) {
for _, view := range v {
if has = view.HasFilters; has {
return
}
}
return
}
func (v Views) HasFilterPresent() (has bool) {
for _, view := range v {
for _, group := range view.Filters {
for _, filter := range group {
if has = filter.Present; has {
return
}
}
}
}
return
}
func (v *View) HasFilterPresent() (has bool) {
for _, group := range v.Filters {
for _, filter := range group {
if has = filter.Present; has {
return
}
}
}
return
}
func (v *View) GroupHasFilterPresent(idx int) (has bool) {
if idx >= 0 && len(v.Filters) > idx {
for _, filter := range v.Filters[idx] {
if has = filter.Present; has {
return
}
}
}
return
}