File: slice.go

package info (click to toggle)
singularity-container 4.0.3%2Bds1-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 21,672 kB
  • sloc: asm: 3,857; sh: 2,125; ansic: 1,677; awk: 414; makefile: 110; python: 99
file content (54 lines) | stat: -rw-r--r-- 1,454 bytes parent folder | download | duplicates (2)
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
// Copyright (c) 2021, Sylabs Inc. All rights reserved.
// This software is licensed under a 3-clause BSD license. Please consult the
// LICENSE.md file distributed with the sources of this project regarding your
// rights to use or distribute this software.

package slice

import "github.com/samber/lo"

// ContainsString returns true if string slice s contains match
func ContainsString(s []string, match string) bool {
	for _, a := range s {
		if a == match {
			return true
		}
	}
	return false
}

// ContainsAnyString returns true if string slice s contains any of matches
func ContainsAnyString(s []string, matches []string) bool {
	for _, m := range matches {
		for _, a := range s {
			if a == m {
				return true
			}
		}
	}
	return false
}

// ContainsInt returns true if int slice s contains match
func ContainsInt(s []int, match int) bool {
	for _, a := range s {
		if a == match {
			return true
		}
	}
	return false
}

// Subtract removes items in slice b from slice a, returning the result.
// Implemented using a map for greater efficiency than lo.Difference / lo.Without, when operating on large slices.
func Subtract[T comparable](a []T, b []T) []T {
	subtractionMap := lo.FromEntries(lo.Map(a, func(item T, _ int) lo.Entry[T, bool] {
		return lo.Entry[T, bool]{Key: item, Value: true}
	}))
	subtractionMap = lo.OmitByKeys(subtractionMap, b)

	return lo.Filter(a, func(x T, _ int) bool {
		_, ok := subtractionMap[x]
		return ok
	})
}