File: ux.go

package info (click to toggle)
golang-github-adam-lavrik-go-imath 0.0~git20210910.265a42a-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 152 kB
  • sloc: makefile: 2
file content (145 lines) | stat: -rw-r--r-- 2,710 bytes parent folder | download
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
/*
Copyright 2020...2021 Adam Lavrik <lavrik.adam@gmail.com>

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 ux

import "unsafe"

type T = uint
type ST = int

const (
	Size = unsafe.Sizeof(T(0))
	BitSize = Size << 3
	Minimal = T(0)
	Maximal = ^Minimal
)

func DivMod(dividend, divisor T) (T, T) {
	return dividend / divisor, dividend % divisor
}

func GCD(value_0, value_1 T) T {
	for value_1 != 0 {
		value_0, value_1 = value_1, value_0 % value_1
	}
	return value_0
}

func Is2Power(value T) bool {
	return value != 0 && (value & (value - 1) == 0)
}

func IsOdd(value T) bool {
	return (value & 1) != 0
}

func LCM(value_0, value_1 T) T {
	if value_0 == 0 || value_1 == 0 {
		return 0
	}
	return value_0 / GCD(value_0, value_1) * value_1
}

func Min(value_0, value_1 T) T {
	if value_0 < value_1 {
		return value_0
	}
	return value_1
}

func Mins(value T, values ...T) T {
	for _, v := range values {
		if v < value {
			value = v
		}
	}
	return value
}

func MinSlice(values []T) T {
	return Mins(values[0], values[1:]...)
}

func MinSliceChecked(values []T) (T, bool) {
	if len(values) == 0 {
		return 0, true
	}
	return MinSlice(values), false
}

func Max(value_0, value_1 T) T {
	if value_0 > value_1 {
		return value_0
	}
	return value_1
}

func Maxs(value T, values ...T) T {
	for _, v := range values {
		if v > value {
			value = v
		}
	}
	return value
}

func MaxSlice(values []T) T {
	return Maxs(values[0], values[1:]...)
}

func MaxSliceChecked(values []T) (T, bool) {
	if len(values) == 0 {
		return 0, true
	}
	return MaxSlice(values), false
}

func MinMax(value_0, value_1 T) (T, T) {
	if value_0 < value_1 {
		return value_0, value_1
	}
	return value_1, value_0
}

func MinMaxs(value T, values ...T) (T, T) {
	min := value
	max := value
	for _, v := range values {
		if v < min {
			min = v
		} else if v > max {
			max = v
		}
	}
	return min, max
}

func MinMaxSlice(values []T) (T, T) {
	return MinMaxs(values[0], values[1:]...)
}

func MinMaxSliceChecked(values []T) (T, T, bool) {
	if len(values) == 0 {
		return 0, 0, true
	}
	min, max := MinMaxSlice(values)
	return min, max, false
}

func Sign(value T) T {
	shift := BitSize - 1
	return value >> shift | T((-ST(value &^ (1 << shift)) >> shift) & 1)
}