diskusagedetail_slice.go

// Generated by: gen
// TypeWriter: slice
// Directive: +gen on *DiskUsageDetail

package gobacklog

import (
	"errors"
	"math/rand"
)

// Sort implementation is a modification of http://golang.org/pkg/sort/#Sort
// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found at http://golang.org/LICENSE.

// DiskUsageDetailSlice is a slice of type *DiskUsageDetail. Use it where you would use []*DiskUsageDetail.
type DiskUsageDetailSlice []*DiskUsageDetail

// Where returns a new DiskUsageDetailSlice whose elements return true for func. See: http://clipperhouse.github.io/gen/#Where
func (rcv DiskUsageDetailSlice) Where(fn func(*DiskUsageDetail) bool) (result DiskUsageDetailSlice) {
	for _, v := range rcv {
		if fn(v) {
			result = append(result, v)
		}
	}
	return result
}

// Count gives the number elements of DiskUsageDetailSlice that return true for the passed func. See: http://clipperhouse.github.io/gen/#Count
func (rcv DiskUsageDetailSlice) Count(fn func(*DiskUsageDetail) bool) (result int) {
	for _, v := range rcv {
		if fn(v) {
			result++
		}
	}
	return
}

// SortBy returns a new ordered DiskUsageDetailSlice, determined by a func defining ‘less’. See: http://clipperhouse.github.io/gen/#SortBy
func (rcv DiskUsageDetailSlice) SortBy(less func(*DiskUsageDetail, *DiskUsageDetail) bool) DiskUsageDetailSlice {
	result := make(DiskUsageDetailSlice, len(rcv))
	copy(result, rcv)
	// Switch to heapsort if depth of 2*ceil(lg(n+1)) is reached.
	n := len(result)
	maxDepth := 0
	for i := n; i > 0; i >>= 1 {
		maxDepth++
	}
	maxDepth *= 2
	quickSortDiskUsageDetailSlice(result, less, 0, n, maxDepth)
	return result
}

// GroupByString groups elements into a map keyed by string. See: http://clipperhouse.github.io/gen/#GroupBy
func (rcv DiskUsageDetailSlice) GroupByString(fn func(*DiskUsageDetail) string) map[string]DiskUsageDetailSlice {
	result := make(map[string]DiskUsageDetailSlice)
	for _, v := range rcv {
		key := fn(v)
		result[key] = append(result[key], v)
	}
	return result
}

// GroupByInt groups elements into a map keyed by int. See: http://clipperhouse.github.io/gen/#GroupBy
func (rcv DiskUsageDetailSlice) GroupByInt(fn func(*DiskUsageDetail) int) map[int]DiskUsageDetailSlice {
	result := make(map[int]DiskUsageDetailSlice)
	for _, v := range rcv {
		key := fn(v)
		result[key] = append(result[key], v)
	}
	return result
}

// GroupByBool groups elements into a map keyed by bool. See: http://clipperhouse.github.io/gen/#GroupBy
func (rcv DiskUsageDetailSlice) GroupByBool(fn func(*DiskUsageDetail) bool) map[bool]DiskUsageDetailSlice {
	result := make(map[bool]DiskUsageDetailSlice)
	for _, v := range rcv {
		key := fn(v)
		result[key] = append(result[key], v)
	}
	return result
}

// First returns the first element that returns true for the passed func. Returns error if no elements return true. See: http://clipperhouse.github.io/gen/#First
func (rcv DiskUsageDetailSlice) First(fn func(*DiskUsageDetail) bool) (result *DiskUsageDetail, err error) {
	for _, v := range rcv {
		if fn(v) {
			result = v
			return
		}
	}
	err = errors.New("no DiskUsageDetailSlice elements return true for passed func")
	return
}

// MaxBy returns an element of DiskUsageDetailSlice containing the maximum value, when compared to other elements using a passed func defining ‘less’. In the case of multiple items being equally maximal, the last such element is returned. Returns error if no elements. See: http://clipperhouse.github.io/gen/#MaxBy
func (rcv DiskUsageDetailSlice) MaxBy(less func(*DiskUsageDetail, *DiskUsageDetail) bool) (result *DiskUsageDetail, err error) {
	l := len(rcv)
	if l == 0 {
		err = errors.New("cannot determine the MaxBy of an empty slice")
		return
	}
	m := 0
	for i := 1; i < l; i++ {
		if rcv[i] != rcv[m] && !less(rcv[i], rcv[m]) {
			m = i
		}
	}
	result = rcv[m]
	return
}

// MinBy returns an element of DiskUsageDetailSlice containing the minimum value, when compared to other elements using a passed func defining ‘less’. In the case of multiple items being equally minimal, the first such element is returned. Returns error if no elements. See: http://clipperhouse.github.io/gen/#MinBy
func (rcv DiskUsageDetailSlice) MinBy(less func(*DiskUsageDetail, *DiskUsageDetail) bool) (result *DiskUsageDetail, err error) {
	l := len(rcv)
	if l == 0 {
		err = errors.New("cannot determine the Min of an empty slice")
		return
	}
	m := 0
	for i := 1; i < l; i++ {
		if less(rcv[i], rcv[m]) {
			m = i
		}
	}
	result = rcv[m]
	return
}

// Distinct returns a new DiskUsageDetailSlice whose elements are unique. See: http://clipperhouse.github.io/gen/#Distinct
func (rcv DiskUsageDetailSlice) Distinct() (result DiskUsageDetailSlice) {
	appended := make(map[*DiskUsageDetail]bool)
	for _, v := range rcv {
		if !appended[v] {
			result = append(result, v)
			appended[v] = true
		}
	}
	return result
}

// DistinctBy returns a new DiskUsageDetailSlice whose elements are unique, where equality is defined by a passed func. See: http://clipperhouse.github.io/gen/#DistinctBy
func (rcv DiskUsageDetailSlice) DistinctBy(equal func(*DiskUsageDetail, *DiskUsageDetail) bool) (result DiskUsageDetailSlice) {
Outer:
	for _, v := range rcv {
		for _, r := range result {
			if equal(v, r) {
				continue Outer
			}
		}
		result = append(result, v)
	}
	return result
}

// Shuffle returns a shuffled copy of DiskUsageDetailSlice, using a version of the Fisher-Yates shuffle. See: http://clipperhouse.github.io/gen/#Shuffle
func (rcv DiskUsageDetailSlice) Shuffle() DiskUsageDetailSlice {
	numItems := len(rcv)
	result := make(DiskUsageDetailSlice, numItems)
	copy(result, rcv)
	for i := 0; i < numItems; i++ {
		r := i + rand.Intn(numItems-i)
		result[r], result[i] = result[i], result[r]
	}
	return result
}

// Sort implementation based on http://golang.org/pkg/sort/#Sort, see top of this file

func swapDiskUsageDetailSlice(rcv DiskUsageDetailSlice, a, b int) {
	rcv[a], rcv[b] = rcv[b], rcv[a]
}

// Insertion sort
func insertionSortDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, a, b int) {
	for i := a + 1; i < b; i++ {
		for j := i; j > a && less(rcv[j], rcv[j-1]); j-- {
			swapDiskUsageDetailSlice(rcv, j, j-1)
		}
	}
}

// siftDown implements the heap property on rcv[lo, hi).
// first is an offset into the array where the root of the heap lies.
func siftDownDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, lo, hi, first int) {
	root := lo
	for {
		child := 2*root + 1
		if child >= hi {
			break
		}
		if child+1 < hi && less(rcv[first+child], rcv[first+child+1]) {
			child++
		}
		if !less(rcv[first+root], rcv[first+child]) {
			return
		}
		swapDiskUsageDetailSlice(rcv, first+root, first+child)
		root = child
	}
}

func heapSortDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, a, b int) {
	first := a
	lo := 0
	hi := b - a

	// Build heap with greatest element at top.
	for i := (hi - 1) / 2; i >= 0; i-- {
		siftDownDiskUsageDetailSlice(rcv, less, i, hi, first)
	}

	// Pop elements, largest first, into end of rcv.
	for i := hi - 1; i >= 0; i-- {
		swapDiskUsageDetailSlice(rcv, first, first+i)
		siftDownDiskUsageDetailSlice(rcv, less, lo, i, first)
	}
}

// Quicksort, following Bentley and McIlroy,
// Engineering a Sort Function, SP&E November 1993.

// medianOfThree moves the median of the three values rcv[a], rcv[b], rcv[c] into rcv[a].
func medianOfThreeDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, a, b, c int) {
	m0 := b
	m1 := a
	m2 := c
	// bubble sort on 3 elements
	if less(rcv[m1], rcv[m0]) {
		swapDiskUsageDetailSlice(rcv, m1, m0)
	}
	if less(rcv[m2], rcv[m1]) {
		swapDiskUsageDetailSlice(rcv, m2, m1)
	}
	if less(rcv[m1], rcv[m0]) {
		swapDiskUsageDetailSlice(rcv, m1, m0)
	}
	// now rcv[m0] <= rcv[m1] <= rcv[m2]
}

func swapRangeDiskUsageDetailSlice(rcv DiskUsageDetailSlice, a, b, n int) {
	for i := 0; i < n; i++ {
		swapDiskUsageDetailSlice(rcv, a+i, b+i)
	}
}

func doPivotDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, lo, hi int) (midlo, midhi int) {
	m := lo + (hi-lo)/2 // Written like this to avoid integer overflow.
	if hi-lo > 40 {
		// Tukey's Ninther, median of three medians of three.
		s := (hi - lo) / 8
		medianOfThreeDiskUsageDetailSlice(rcv, less, lo, lo+s, lo+2*s)
		medianOfThreeDiskUsageDetailSlice(rcv, less, m, m-s, m+s)
		medianOfThreeDiskUsageDetailSlice(rcv, less, hi-1, hi-1-s, hi-1-2*s)
	}
	medianOfThreeDiskUsageDetailSlice(rcv, less, lo, m, hi-1)

	// Invariants are:
	//	rcv[lo] = pivot (set up by ChoosePivot)
	//	rcv[lo <= i < a] = pivot
	//	rcv[a <= i < b] < pivot
	//	rcv[b <= i < c] is unexamined
	//	rcv[c <= i < d] > pivot
	//	rcv[d <= i < hi] = pivot
	//
	// Once b meets c, can swap the "= pivot" sections
	// into the middle of the slice.
	pivot := lo
	a, b, c, d := lo+1, lo+1, hi, hi
	for {
		for b < c {
			if less(rcv[b], rcv[pivot]) { // rcv[b] < pivot
				b++
			} else if !less(rcv[pivot], rcv[b]) { // rcv[b] = pivot
				swapDiskUsageDetailSlice(rcv, a, b)
				a++
				b++
			} else {
				break
			}
		}
		for b < c {
			if less(rcv[pivot], rcv[c-1]) { // rcv[c-1] > pivot
				c--
			} else if !less(rcv[c-1], rcv[pivot]) { // rcv[c-1] = pivot
				swapDiskUsageDetailSlice(rcv, c-1, d-1)
				c--
				d--
			} else {
				break
			}
		}
		if b >= c {
			break
		}
		// rcv[b] > pivot; rcv[c-1] < pivot
		swapDiskUsageDetailSlice(rcv, b, c-1)
		b++
		c--
	}

	min := func(a, b int) int {
		if a < b {
			return a
		}
		return b
	}

	n := min(b-a, a-lo)
	swapRangeDiskUsageDetailSlice(rcv, lo, b-n, n)

	n = min(hi-d, d-c)
	swapRangeDiskUsageDetailSlice(rcv, c, hi-n, n)

	return lo + b - a, hi - (d - c)
}

func quickSortDiskUsageDetailSlice(rcv DiskUsageDetailSlice, less func(*DiskUsageDetail, *DiskUsageDetail) bool, a, b, maxDepth int) {
	for b-a > 7 {
		if maxDepth == 0 {
			heapSortDiskUsageDetailSlice(rcv, less, a, b)
			return
		}
		maxDepth--
		mlo, mhi := doPivotDiskUsageDetailSlice(rcv, less, a, b)
		// Avoiding recursion on the larger subproblem guarantees
		// a stack depth of at most lg(b-a).
		if mlo-a < b-mhi {
			quickSortDiskUsageDetailSlice(rcv, less, a, mlo, maxDepth)
			a = mhi // i.e., quickSortDiskUsageDetailSlice(rcv, mhi, b)
		} else {
			quickSortDiskUsageDetailSlice(rcv, less, mhi, b, maxDepth)
			b = mlo // i.e., quickSortDiskUsageDetailSlice(rcv, a, mlo)
		}
	}
	if b-a > 1 {
		insertionSortDiskUsageDetailSlice(rcv, less, a, b)
	}
}