Skip to content

Commit fe49f80

Browse files
delphidabblerdelphidabbler
committed
Merge branch 'release/2.2.2'
Release v2.2.2
2 parents 4582376 + d74663d commit fe49f80

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

102 files changed

+7444
-634
lines changed

‎CHANGELOG.md

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,40 @@ From v2.0.0 all notable changes to this project will be documented in this file.
88
99
The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/) and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
1010

11+
## v2.2.2 of 2025/01/19
12+
13+
* New snippets were added to the _Arrays_ and _Mathematics_ categories:
14+
* _Arrays_ category:
15+
* `Reverse<T>` method of `TArrayUtils` & `ReverseByteArray` function (issue [#37](https://github.com/delphidabbler/code-snippets/issues/37)).
16+
* `Max<T>`, `Min<T>` & `MinMax<T>` methods of `TArrayUtils` (issue [#8](https://github.com/delphidabbler/code-snippets/issues/8)).
17+
* _Mathematics_ category:
18+
* 3 overloaded versions of each of the `ArithmeticMean` & `WeightedArithmeticMean` functions (issue [#30](https://github.com/delphidabbler/code-snippets/issues/30)).
19+
* `DigitSumBase`, `DigitCountBase` & `DigitsOf` function (issue [#17](https://github.com/delphidabbler/code-snippets/issues/17)).
20+
* `DigitPowerSum` function (issue [#39](https://github.com/delphidabbler/code-snippets/issues/39)).
21+
* `IsPalindromic` function (issue [#19](https://github.com/delphidabbler/code-snippets/issues/19)).
22+
* `IsNarcissistic` function (issue [#18](https://github.com/delphidabbler/code-snippets/issues/18)).
23+
* `LSE` & `Softmax` functions (issue [34](https://github.com/delphidabbler/code-snippets/issues/34)).
24+
* 3 overloaded versions of a `Median` function (issue [#41](https://github.com/delphidabbler/code-snippets/issues/41)).
25+
* 2 overloaded versions of each of the `MinMaxOfArray`, `RescaleRange`, `NormaliseByWeight` & `RangeOf` functions (issue [#44](https://github.com/delphidabbler/code-snippets/issues/44)).
26+
* 3 overloaded versions of each of the `GeometricMean` and `WeightedGeometricMean` functions (issue [#31](https://github.com/delphidabbler/code-snippets/issues/31)).
27+
* 3 overloaded versions of each of the `SumOfReciprocals` and `HarmonicMean` functions (issue [#35](https://github.com/delphidabbler/code-snippets/issues/35)).
28+
* 3 overloaded versions of a `WeightedHarmonicMean` function (issue [#47](https://github.com/delphidabbler/code-snippets/issues/47)).
29+
* `LogarithmicMean` function (issue [#32](https://github.com/delphidabbler/code-snippets/issues/32)).
30+
* 3 overloaded versions of the `PowerMean` and `WeightedPowerMean` functions (issue [#33](https://github.com/delphidabbler/code-snippets/issues/33)).
31+
* `Mode`, `ModeAlt`, `ModeCount`, `HasMode` & `CountOccurences` functions (issue [#42](https://github.com/delphidabbler/code-snippets/issues/42)).
32+
* 2 overloaded versions of a `RMS` function (issue [#49](https://github.com/delphidabbler/code-snippets/issues/49)).
33+
* 2 overloaded versions of a `TSS` (total sum of squares) function (issue [#51](https://github.com/delphidabbler/code-snippets/issues/51)).
34+
* Updates to snippets in the _Mathematics_ category:
35+
* Overflow checking was added to the `PowNZN`.
36+
* Fixed bug in all overloads of the `SumOfLogs` routine that was causing access violations whenever an exception was to be raised (issue [#46](https://github.com/delphidabbler/code-snippets/issues/46)).
37+
* Changes to tests:
38+
* Added unit tests for all the routines and methods that were added to the _Arrays_ and _Mathematics_ categories in this release.
39+
* Added unit test for the pre-existing `ByteArraysEqual` function in the _Arrays_ category.
40+
* Modified unit test for `PowNZN` to check for new `EOverflow` exception raised when an overflow condition is detected.
41+
* Removed conditional compilation directives from the array unit test unit.
42+
* Updated `README.md` to note that there are now over 700 snippets in the collection.
43+
* Updated all copyright dates for 2025.
44+
1145
## v2.2.1 of 2024/12/02 (HOTFIX)
1246

1347
* Fixed invalid and corrupted values in some `AdvancedTest.URL` and `AdvancedTest.Level` keys in `data.ini`, `hex.ini` and `maths.ini`. Fixes issue [#29](https://github.com/delphidabbler/code-snippets/issues/29).

‎LICENSE.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
# MIT License
22

3-
All `.dat` files in the `collection` directory and certain `.pas` files in the `tests` directory that were generated from the collection are copyright © 2005-2024, [Peter Johnson](https://gravatar.com/delphidabbler) and [Contributors](https://github.com/delphidabbler/code-snippets/tree/master/collection/CONTRIBUTORS).
3+
All `.dat` files in the `collection` directory and certain `.pas` files in the `tests` directory that were generated from the collection are copyright © 2005-2025, [Peter Johnson](https://gravatar.com/delphidabbler) and [Contributors](https://github.com/delphidabbler/code-snippets/tree/master/collection/CONTRIBUTORS).
44

5-
All other files in this project are copyright © 2020-2024, [Peter Johnson](https://gravatar.com/delphidabbler).
5+
All other files in this project are copyright © 2020-2025, [Peter Johnson](https://gravatar.com/delphidabbler).
66

77
----
88

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
## Overview
44

5-
This repository contains a collection of over 600 reusable Pascal code snippets. The majority are simple functions and procedures but there are also some constants and type definitions, including some advanced records with methods.
5+
This repository contains a collection of over 700 reusable Pascal code snippets. The majority are simple functions and procedures but there are also some constants and type definitions, including some advanced records with methods.
66

77
Snippets are grouped into categories, with each snippet belonging to exactly one category.
88

‎collection/623.dat

Lines changed: 77 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -3,24 +3,51 @@
33
public
44
// Returns first element of given array, which must not be empty.
55
class function First<T>(const A: array of T): T; static;
6+
67
// Returns last element of given array, which must not be empty.
78
class function Last<T>(const A: array of T): T; static;
9+
810
// Returns index of given item in given array or -1 if element no in array.
911
// Given equality comparer is used to compare array elements with Elem.
1012
class function IndexOf<T>(const Item: T; const A: array of T;
1113
const EqualityComparer: Generics.Defaults.TEqualityComparison<T>):
1214
Integer; static;
15+
1316
// Checks if two given arrays have the same contents, in same order. Given
1417
// equality comparer is used to compare array elements.
1518
class function Equal<T>(const Left, Right: array of T;
1619
const EqualityComparer: Generics.Defaults.TEqualityComparison<T>):
1720
Boolean; static;
21+
1822
// Checks if the first Count elements of the given arrays are the same.
1923
// Given equality comparer is used to compare array elements.
2024
class function SameStart<T>(const Left, Right: array of T;
2125
const Count: Integer;
2226
const EqualityComparer: Generics.Defaults.TEqualityComparison<T>):
2327
Boolean; static;
28+
29+
// Creates and returns a new array that is the reverse of the given array.
30+
class function Reverse<T>(const A: array of T): TArray<T>; static;
31+
32+
// Returns the maximum value of array A, which must not be be empty. The
33+
// given comparer must return -ve if its 1st argument is less than the 2nd
34+
// argument, +ve if the reverse holds and zero if both arguments are equal.
35+
class function Max<T>(const A: array of T; const Comparer: TComparison<T>):
36+
T; static;
37+
38+
// Returns the minimum value of array A, which must not be be empty. The
39+
// given comparer must return -ve if its 1st argument is less than the 2nd
40+
// argument, +ve if the reverse holds and zero if both arguments are equal.
41+
class function Min<T>(const A: array of T; const Comparer: TComparison<T>):
42+
T; static;
43+
44+
// Finds the minimum and maximum value of array A, which must not be empty.
45+
// The minimum and maximum are returned via the MinValue and MaxValue
46+
// parameters respectively. The given comparer must return -ve if its 1st
47+
// argument is less than the 2nd argument, +ve if the reverse holds and zero
48+
// if both arguments are equal.
49+
class procedure MinMax<T>(const A: array of T;
50+
const Comparer: TComparison<T>; out MinValue, MaxValue: T); static;
2451
end;
2552

2653
class function TArrayUtils.Equal<T>(const Left, Right: array of T;
@@ -60,6 +87,56 @@ begin
6087
Result := A[Pred(Length(A))];
6188
end;
6289

90+
class function TArrayUtils.Max<T>(const A: array of T;
91+
const Comparer: TComparison<T>): T;
92+
var
93+
Idx: Integer;
94+
begin
95+
Assert(System.Length(A) > 0);
96+
Result := A[0];
97+
for Idx := 1 to Pred(System.Length(A)) do
98+
if Comparer(A[Idx], Result) > 0 then
99+
Result := A[Idx];
100+
end;
101+
102+
class function TArrayUtils.Min<T>(const A: array of T;
103+
const Comparer: TComparison<T>): T;
104+
var
105+
Idx: Integer;
106+
begin
107+
Assert(System.Length(A) > 0);
108+
Result := A[0];
109+
for Idx := 1 to Pred(System.Length(A)) do
110+
if Comparer(A[Idx], Result) < 0 then
111+
Result := A[Idx];
112+
end;
113+
114+
class procedure TArrayUtils.MinMax<T>(const A: array of T;
115+
const Comparer: TComparison<T>; out MinValue, MaxValue: T);
116+
var
117+
Idx: Integer;
118+
begin
119+
Assert(System.Length(A) > 0);
120+
MinValue := A[0];
121+
MaxValue := A[0];
122+
for Idx := 1 to Pred(System.Length(A)) do
123+
begin
124+
if Comparer(A[Idx], MinValue) < 0 then
125+
MinValue := A[Idx]
126+
else if Comparer(A[Idx], MaxValue) > 0 then
127+
MaxValue := A[Idx];
128+
end;
129+
end;
130+
131+
class function TArrayUtils.Reverse<T>(const A: array of T): TArray<T>;
132+
var
133+
I: Integer;
134+
begin
135+
SetLength(Result, Length(A));
136+
for I := 0 to High(A) do
137+
Result[High(A)-I] := A[I];
138+
end;
139+
63140
class function TArrayUtils.SameStart<T>(const Left, Right: array of T;
64141
const Count: Integer;
65142
const EqualityComparer: Generics.Defaults.TEqualityComparison<T>): Boolean;

‎collection/634.dat

Lines changed: 13 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,22 @@
11
function PowNZN(const X: Integer; const N: Cardinal): Int64;
22
var
33
I: Integer;
4+
OverflowGuard: Int64;
45
begin
5-
if (X = 0) and (N > 0) then
6-
Exit(0);
7-
if X = 1 then
6+
if N = 0 then
7+
// IEEE: pown(x, 0) is 1, even when X is zero
88
Exit(1);
9+
if X = 0 then
10+
// pown(0, n) = 0, for all positive n
11+
Exit(0);
12+
OverflowGuard := High(Int64) div Abs(X);
913
Result := 1;
1014
for I := 1 to N do
15+
begin
16+
if OverflowGuard < Abs(Result) then
17+
raise SysUtils.EOverflow.CreateFmt(
18+
'Overflow calculating %d to the power %d', [X, N]
19+
);
1120
Result := Result * X;
21+
end;
1222
end;

‎collection/643.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Elem = 0 then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/644.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Elem <= 0 then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/645.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Elem <= 0 then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/646.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Elem = 0 then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/647.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Math.Sign(Elem) <> Math.PositiveValue then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/648.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Math.Sign(Elem) <> Math.PositiveValue then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/649.dat

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ begin
1212
for Elem in A do
1313
begin
1414
if Math.Sign(Elem) <> Math.PositiveValue then
15-
raise SysUtils.EArgumentOutOfRangeException(sNotPositive);
15+
raise SysUtils.EArgumentOutOfRangeException.Create(sNotPositive);
1616
Result := Result + System.Ln(Elem);
1717
end;
1818
end;

‎collection/650.dat

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
function ArithmeticMean(const A: array of Double): Double; overload;
2+
var
3+
X: Double;
4+
begin
5+
if Length(A) = 0 then
6+
raise SysUtils.EArgumentException.Create('Array is empty');
7+
Result := 0.0;
8+
for X in A do
9+
Result := Result + X / Length(A);
10+
end;

‎collection/651.dat

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
function ArithmeticMean(const A: array of Integer): Double; overload;
2+
var
3+
X: Integer;
4+
begin
5+
if Length(A) = 0 then
6+
raise SysUtils.EArgumentException.Create('Array is empty');
7+
Result := 0.0;
8+
for X in A do
9+
Result := Result + X / Length(A);
10+
end;

‎collection/652.dat

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
function ArithmeticMean(const A: array of Cardinal): Double; overload;
2+
var
3+
X: Cardinal;
4+
begin
5+
if Length(A) = 0 then
6+
raise SysUtils.EArgumentException.Create('Array is empty');
7+
Result := 0.0;
8+
for X in A do
9+
Result := Result + X / Length(A);
10+
end;

‎collection/653.dat

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
function WeightedArithmeticMean(const Values: array of Double;
2+
const Weights: array of Double): Double; overload;
3+
var
4+
WeightSum: Double;
5+
Weight: Double;
6+
Idx: Integer;
7+
begin
8+
if Length(Values) = 0 then
9+
raise SysUtils.EArgumentException.Create('Array of values is empty');
10+
if Length(Values) <> Length(Weights) then
11+
raise SysUtils.EArgumentException.Create(
12+
'Number of values and number of weights must be the same'
13+
);
14+
WeightSum := 0.0;
15+
for Weight in Weights do
16+
begin
17+
if Math.Sign(Weight) = Math.NegativeValue then
18+
raise SysUtils.EArgumentException.Create('Weights must all be >= 0');
19+
WeightSum := WeightSum + Weight;
20+
end;
21+
if Math.IsZero(WeightSum) then
22+
raise SysUtils.EArgumentException.Create('All weights are 0');
23+
Result := 0.0;
24+
for Idx := Low(Values) to High(Values) do
25+
Result := Result + Weights[Idx] * Values[Idx] / WeightSum;
26+
end;

‎collection/654.dat

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
function WeightedArithmeticMean(const Values: array of Integer;
2+
const Weights: array of Double): Double; overload;
3+
var
4+
Idx: Integer;
5+
DblVals: array of Double;
6+
begin
7+
SetLength(DblVals, Length(Values));
8+
for Idx := Low(Values) to High(Values) do
9+
DblVals[Idx] := Values[Idx];
10+
Result := WeightedArithmeticMean(DblVals, Weights);
11+
end;

‎collection/655.dat

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
function WeightedArithmeticMean(const Values: array of Cardinal;
2+
const Weights: array of Double): Double; overload;
3+
var
4+
Idx: Integer;
5+
DblVals: array of Double;
6+
begin
7+
SetLength(DblVals, Length(Values));
8+
for Idx := Low(Values) to High(Values) do
9+
DblVals[Idx] := Values[Idx];
10+
Result := WeightedArithmeticMean(DblVals, Weights);
11+
end;

‎collection/656.dat

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
function ReverseByteArray(const A: array of Byte): TBytes;
2+
var
3+
I: Integer;
4+
begin
5+
SetLength(Result, Length(A));
6+
for I := 0 to High(A) do
7+
Result[High(A)-I] := A[I];
8+
end;

‎collection/657.dat

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
function DigitSumBase(N: Int64; const Base: Byte): Integer;
2+
var
3+
SignOfN: Math.TValueSign;
4+
begin
5+
if Base < 2 then
6+
raise SysUtils.EArgumentException.Create(
7+
'Base must be in the range 2..255'
8+
);
9+
if N = 0 then
10+
Exit(0);
11+
SignOfN := Math.Sign(N);
12+
N := Abs(N);
13+
Result := 0;
14+
repeat
15+
Inc(Result, N mod Base);
16+
N := N div Base;
17+
until N = 0;
18+
if SignOfN = Math.NegativeValue then
19+
Result := -1 * Result;
20+
end;

0 commit comments

Comments
 (0)