searching.go

// Copyright 2016 The Gosl Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package utl

import (
	"time"
)

// IntMinMax returns the maximum and minimum elements in v
//  NOTE: this is not efficient and should be used for small slices only
func IntMinMax(v []int) (mi, ma int) {
	mi, ma = v[0], v[0]
	for i := 1; i < len(v); i++ {
		if v[i] < mi {
			mi = v[i]
		}
		if v[i] > ma {
			ma = v[i]
		}
	}
	return
}

// MinMax returns the maximum and minimum elements in v
//  NOTE: this is not efficient and should be used for small slices only
func MinMax(v []float64) (mi, ma float64) {
	mi, ma = v[0], v[0]
	for i := 1; i < len(v); i++ {
		if v[i] < mi {
			mi = v[i]
		}
		if v[i] > ma {
			ma = v[i]
		}
	}
	return
}

// Sum sums all items in v
//  NOTE: this is not efficient and should be used for small slices only
func Sum(v []float64) (sum float64) {
	for i := 0; i < len(v); i++ {
		sum += v[i]
	}
	return
}

// DurSum sums all seconds in v
//  NOTE: this is not efficient and should be used for small slices only
func DurSum(v []time.Duration) (seconds float64) {
	for _, t := range v {
		seconds += t.Seconds()
	}
	return
}

// StrIndexSmall finds the index of an item in a slice of strings
//  NOTE: this function is not efficient and should be used with small slices only; say smaller than 20
func StrIndexSmall(a []string, val string) int {
	for idx, str := range a {
		if str == val {
			return idx
		}
	}
	return -1 // not found
}

// IntIndexSmall finds the index of an item in a slice of ints
//  NOTE: this function is not efficient and should be used with small slices only; say smaller than 20
func IntIndexSmall(a []int, val int) int {
	for idx, item := range a {
		if item == val {
			return idx
		}
	}
	return -1 // not found
}

// IntFilter filters out components in slice
//  NOTE: this function is not efficient and should be used with small slices only
func IntFilter(a []int, out func(idx int) bool) (res []int) {
	for i := 0; i < len(a); i++ {
		if out(i) {
			continue
		}
		res = append(res, a[i])
	}
	return
}

// IntNegOut filters out negative components in slice
//  NOTE: this function is not efficient and should be used with small slices only
func IntNegOut(a []int) (res []int) {
	for i := 0; i < len(a); i++ {
		if a[i] < 0 {
			continue
		}
		res = append(res, a[i])
	}
	return
}