-
Notifications
You must be signed in to change notification settings - Fork 0
/
boolSlice.go
67 lines (53 loc) · 2.09 KB
/
boolSlice.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
//-------------------------------------------------------------------------------------------------- <-100
// Author: Kelcey Damage
// Go: 1.10
// 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.
// Doc
//-------------------------------------------------------------------------------------------------- <-100
// Doc (90 char length for optimal godoc code-block parsing) | <- 90
//-------------------------------------------------------------------------------------------------- <-100
package collections
import (
"sort"
)
// Code
//-------------------------------------------------------------------------------------------------- <-100
// BoolSlice is a slice of booleans with common methods.
type BoolSlice struct {
slice
}
// New instantiates a new BoolSlice based on the passed slice.
func (s *BoolSlice) New(x slice) BoolSlice {
i := BoolSlice{}
i.slice = x
return i
}
// Sort inplace sorts the slice ascending.
//
// Implements sort.Sort() method.
func (s *BoolSlice) Sort() {
sort.Sort(*s)
}
// Reverse inplace sorts the slice descending.
//
// Implements sort.Sort() method. (Flakey method for now)
func (s *BoolSlice) Reverse() {
sort.Sort(*s)
}
// Less implementation for sort. Return true if value at index [i] not equal to [j]. This will sort
// the slice so that all true booleans appear before false booleans.
func (s BoolSlice) Less(i, j int) bool {
return s.All()[i].(bool) != s.All()[j].(bool)
}
// Slice returns a new slice with the range of data between indexes [i] and [j] int the original.
func (s *BoolSlice) Slice(i, j int) BoolSlice {
return BoolSlice{(*s).All()[i:j]}
}