mirror of https://github.com/rwxrob/bonzai
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
71 lines
1.7 KiB
Go
71 lines
1.7 KiB
Go
/*
|
|
Copyright 2022 Robert S. Muhlestein.
|
|
|
|
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 filter
|
|
|
|
import "strings"
|
|
|
|
// Number combines the primitives generally considered numbers by JSON
|
|
// and other high-level structure data representations.
|
|
type Number interface {
|
|
int16 | int32 | int64 | float32 | float64
|
|
}
|
|
|
|
// Text combines byte slice and string.
|
|
type Text interface {
|
|
[]byte | string
|
|
}
|
|
|
|
// P is for "principle" in this case. These are the types that have
|
|
// representations in JSON and other high-level structured data
|
|
// representations.
|
|
type P interface {
|
|
Number
|
|
Text
|
|
bool
|
|
}
|
|
|
|
// HasPrefix filters the Text input set and returns only those elements
|
|
// that have the give prefix.
|
|
func HasPrefix[T Text](set []T, pre string) []T {
|
|
m := []T{}
|
|
for _, s := range set {
|
|
if strings.HasPrefix(string(s), pre) {
|
|
m = append(m, s)
|
|
}
|
|
}
|
|
return m
|
|
}
|
|
|
|
// Minus performs a set "minus" operation by returning a new set with
|
|
// the elements of the second set removed from it.
|
|
func Minus[T Text, M Text](set []T, min []M) []T {
|
|
m := []T{}
|
|
for _, i := range set {
|
|
var seen bool
|
|
for _, n := range min {
|
|
if string(n) == string(i) {
|
|
seen = true
|
|
break
|
|
}
|
|
}
|
|
if !seen {
|
|
m = append(m, i)
|
|
}
|
|
}
|
|
return m
|
|
}
|