blob: 63b4839795f0ac7b3831c1eebb2444c55f662692 (
plain) (
blame)
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
|
package tools;
import utils.ArrayKeyValueReverseIterator;
import utils.ArrayReverseIterator;
class ArrayTools {
public static function last<T>(arr:Array<T>):Null<T> {
return arr[arr.length - 1];
}
public static function min<T:Float>(arr:Array<T>, ?maxValue:T):T {
var min = arr[0] ?? maxValue;
for (value in arr) if (value < min) min = value;
return min;
}
public static function max<T:Float>(arr:Array<T>, ?minValue:T):T {
var max = arr[0] ?? minValue;
for (value in arr) if (value > max) max = value;
return max;
}
public static function indexOfMax<T:Float>(arr:Array<T>, ?minValue:T):Int {
if (arr.length == 0) return -1;
var max = arr[0] ?? minValue;
var maxIndex = 0;
for (i in 1...arr.length) {
if (arr[i] > max) {
maxIndex = i;
max = arr[i];
}
}
return maxIndex;
}
public static function sum<T:Float>(arr:Array<T>):T {
var total:T = cast 0;
for (value in arr) total += value;
return total;
}
public static function shuffle<T>(arr:Array<T>):Void {
for (i => a in arr) {
final n = Std.random(arr.length);
final b = arr[n];
arr[i] = b;
arr[n] = a;
}
}
public static inline function reversed<T>(arr:Array<T>) {
return new ArrayReverseIterator(arr);
}
/** Key-value reversed array iterator **/
public static inline function reversedKV<T>(arr:Array<T>) {
return new ArrayKeyValueReverseIterator(arr);
}
public static inline function findMin<T>(
arr:Array<T>, f:(item:T) -> Float, maxValue:Float
):Null<T> {
var result:Null<T> = null;
for (item in arr) {
final dist = f(item);
if (dist > maxValue) continue;
maxValue = dist;
result = item;
}
return result;
}
extern overload public static inline function inlineFind<T>(it:Array<T>, f:(item:T) -> Bool):Null<T> {
var result:Null<T> = null;
for (v in it) {
if (f(v)) {
result = v;
break;
}
}
return result;
}
extern overload public static inline function inlineFind<T>(it:Iterable<T>, f:(item:T) -> Bool):Null<T> {
var result:Null<T> = null;
for (v in it) {
if (f(v)) {
result = v;
break;
}
}
return result;
}
extern overload public static inline function inlineExists<T>(it:Array<T>, f:(item:T) -> Bool):Bool {
var result = false;
for (v in it) {
if (f(v)) {
result = true;
break;
}
}
return result;
}
extern overload public static inline function inlineExists<T>(it:Iterable<T>, f:(item:T) -> Bool):Bool {
var result = false;
for (v in it) {
if (f(v)) {
result = true;
break;
}
}
return result;
}
}
|
