U.go

// DO NOT EDIT!  This file was generated via `go generate`

// Copyright 2017 by David A. Golden. All rights reserved.
//
// 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

package listy

// U wraps a slice of uint
type U []uint

// Concat returns a copy of the original slice with the additional slice of
// values appended.
func (xs U) Concat(ys []uint) U {
	zs := make(U, len(xs)+len(ys))
	copy(zs, xs)
	copy(zs[len(xs):], ys)
	return zs
}

// ConcatU returns a copy of the original slice with the additional boxed slice
// of values appended.
func (xs U) ConcatU(ys U) U {
	return xs.Concat([]uint(ys))
}

// Contains checks if a value is in the list
func (xs U) Contains(v uint) bool {
	for _, x := range xs {
		if x == v {
			return true
		}
	}
	return false
}

// Elem returns the element with the given index in the list.  Panics if the
// element does not exist.
func (xs U) Elem(n int) uint {
	return xs[n]
}

// Filter returns a new list of elements matching a predicate
func (xs U) Filter(f func(uint) bool) U {
	ys := make(U, 0, len(xs))
	for _, x := range xs {
		if f(x) {
			ys = append(ys, x)
		}
	}
	return ys
}

// Head returns the first value in the list.  Panics if the list is empty.
func (xs U) Head() uint {
	return xs[0]
}

// Init returns a new list with all values except the last.  Panics if the
// list is empty.
func (xs U) Init() U {
	ys := make(U, len(xs)-1)
	copy(ys, xs[:len(xs)-1])
	return ys
}

// Last returns the last value in the list.  Panics if the list is empty.
func (xs U) Last() uint {
	return xs[len(xs)-1]
}

// Len returns the length of the list.
func (xs U) Len() int {
	return len(xs)
}

// Less reports whether the element with index i should sort before the
// element with index j.
func (xs U) Less(i, j int) bool {
	return xs[i] < xs[j]
}

// Map returns a new list with every element transformed by a function
func (xs U) Map(f func(uint) uint) U {
	ys := make(U, 0, len(xs))
	for _, x := range xs {
		ys = append(ys, f(x))
	}
	return ys
}

// Reverse returns a copy of the list with the order of elements reversed.
func (xs U) Reverse() U {
	ys := make(U, len(xs))
	n := len(xs) - 1
	for i, v := range xs {
		ys[n-i] = v
	}
	return ys
}

// Swap does an in-place swap of the elements with indexes i and j.  Panics if
// the elements don't exist.  It returns nothing per the Swap signature of
// Sort.Interface.
func (xs U) Swap(i, j int) {
	xs[i], xs[j] = xs[j], xs[i]
}

// Tail returns a new list with all values except the head.  Panics if the
// list is empty.
func (xs U) Tail() U {
	ys := make(U, len(xs)-1)
	copy(ys, xs[1:len(xs)])
	return ys
}

// Unbox returns the list as a native slice
func (xs U) Unbox() []uint {
	return []uint(xs)
}

// Uniq returns a new list with duplicate elements removed.
func (xs U) Uniq() U {
	ys := make(U, 0)
	seen := make(map[uint]struct{})
	for _, x := range xs {
		if _, ok := seen[x]; ok {
			continue
		}
		ys = append(ys, x)
		seen[x] = struct{}{}
	}
	return ys
}