mirror of
https://github.com/hanzoai/jube-fork.git
synced 2026-10-30 18:33:33 +00:00
richard-churchman
cc0a2bee21
Included open-source Accord.net library code natively to the solution given the deprecated state of that project. Accord.net will be supported inside Jube for own needs (such as upgrading to .Net 7+). Accord.net libraries modified to compile to .Net 6. Modified Accord.net libraries to better support Newtonsoft Json.net serialisation. Included annotations in the Accord.net libraries to house important dependency statistics. Serialised json can be used independently of Jube to recall a Neural Network. Removal of Binary Serializer totally as a precursor to the projects support of .Net 7+. Extensive bug fixing in crucial functions of Neural Network training and recall. While this part of the system remains in Alpha, it is substantially more fit for purpose.
348 lines
9.2 KiB
C#
348 lines
9.2 KiB
C#
// Accord Math Library
|
|
// The Accord.NET Framework
|
|
// http://accord-framework.net
|
|
//
|
|
// Copyright © César Souza, 2009-2017
|
|
// cesarsouza at gmail.com
|
|
//
|
|
// This library is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
// License as published by the Free Software Foundation; either
|
|
// version 2.1 of the License, or (at your option) any later version.
|
|
//
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
// Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License along with this library; if not, write to the Free Software
|
|
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
//
|
|
|
|
namespace Accord.Math
|
|
{
|
|
using System;
|
|
using System.Runtime.CompilerServices;
|
|
|
|
public static partial class Matrix
|
|
{
|
|
|
|
/// <summary>
|
|
/// Gets the indices that sort a vector.
|
|
/// </summary>
|
|
///
|
|
public static int[] ArgSort<T>(this T[] values)
|
|
where T : IComparable<T>
|
|
{
|
|
int[] idx;
|
|
values.Copy().Sort(out idx);
|
|
return idx;
|
|
}
|
|
|
|
#region Vector ArgMin/ArgMax
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector.
|
|
/// </summary>
|
|
///
|
|
#if NET45 || NET46 || NET462 || NETSTANDARD2_0
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
#endif
|
|
public static int ArgMax<T>(this T[] values)
|
|
where T : IComparable<T>
|
|
{
|
|
int imax = 0;
|
|
T max = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(max) > 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
|
|
return imax;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector.
|
|
/// </summary>
|
|
///
|
|
#if NET45 || NET46 || NET462 || NETSTANDARD2_0
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
#endif
|
|
public static int ArgMax<T>(this T[] values, out T max)
|
|
where T : IComparable<T>
|
|
{
|
|
int imax = 0;
|
|
max = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(max) > 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
|
|
return imax;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector.
|
|
/// </summary>
|
|
///
|
|
#if NET45 || NET46 || NET462 || NETSTANDARD2_0
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
#endif
|
|
public static int ArgMin<T>(this T[] values)
|
|
where T : IComparable<T>
|
|
{
|
|
int imin = 0;
|
|
T min = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(min) < 0)
|
|
{
|
|
min = values[i];
|
|
imin = i;
|
|
}
|
|
}
|
|
|
|
return imin;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector.
|
|
/// </summary>
|
|
///
|
|
#if NET45 || NET46 || NET462 || NETSTANDARD2_0
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
#endif
|
|
public static int ArgMin<T>(this T[] values, out T min)
|
|
where T : IComparable<T>
|
|
{
|
|
int imin = 0;
|
|
min = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(min) < 0)
|
|
{
|
|
min = values[i];
|
|
imin = i;
|
|
}
|
|
}
|
|
|
|
return imin;
|
|
}
|
|
|
|
#endregion
|
|
|
|
|
|
|
|
#region Vector Min/Max
|
|
/// <summary>
|
|
/// Gets the maximum non-null element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static Nullable<T> Max<T>(this Nullable<T>[] values, out int imax)
|
|
where T : struct, IComparable<T>
|
|
{
|
|
imax = -1;
|
|
Nullable<T> max = null;
|
|
|
|
for (int i = 0; i < values.Length; i++)
|
|
{
|
|
if (values[i].HasValue)
|
|
{
|
|
if (max == null || values[i].Value.CompareTo(max.Value) > 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
}
|
|
|
|
return max;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the minimum non-null element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static Nullable<T> Min<T>(this Nullable<T>[] values, out int imin)
|
|
where T : struct, IComparable<T>
|
|
{
|
|
imin = -1;
|
|
Nullable<T> min = null;
|
|
|
|
for (int i = 0; i < values.Length; i++)
|
|
{
|
|
if (values[i].HasValue)
|
|
{
|
|
if (min == null || values[i].Value.CompareTo(min.Value) < 0)
|
|
{
|
|
min = values[i];
|
|
imin = i;
|
|
}
|
|
}
|
|
}
|
|
|
|
return min;
|
|
}
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static T Max<T>(this T[] values, out int imax)
|
|
where T : IComparable<T>
|
|
{
|
|
imax = 0;
|
|
T max = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(max) > 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static T Max<T>(this T[] values, out int imax, bool alreadySorted)
|
|
where T : IComparable<T>
|
|
{
|
|
if (alreadySorted)
|
|
{
|
|
imax = values.Length - 1;
|
|
return values[values.Length - 1];
|
|
}
|
|
|
|
return Max(values, out imax);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static T Max<T>(this T[] values)
|
|
where T : IComparable<T>
|
|
{
|
|
int imax;
|
|
return Max(values, out imax);
|
|
}
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static T Min<T>(this T[] values, out int imin)
|
|
where T : IComparable<T>
|
|
{
|
|
imin = 0;
|
|
T min = values[0];
|
|
for (int i = 1; i < values.Length; i++)
|
|
{
|
|
if (values[i].CompareTo(min) < 0)
|
|
{
|
|
min = values[i];
|
|
imin = i;
|
|
}
|
|
}
|
|
return min;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector.
|
|
/// </summary>
|
|
///
|
|
public static T Min<T>(this T[] values)
|
|
where T : IComparable<T>
|
|
{
|
|
int imin;
|
|
return Min(values, out imin);
|
|
}
|
|
#endregion
|
|
|
|
|
|
|
|
#region limited length
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector up to a fixed length.
|
|
/// </summary>
|
|
///
|
|
public static T Max<T>(this T[] values, int length, out int imax)
|
|
where T : IComparable<T>
|
|
{
|
|
imax = 0;
|
|
T max = values[0];
|
|
for (int i = 1; i < length; i++)
|
|
{
|
|
if (values[i].CompareTo(max) > 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the maximum element in a vector up to a fixed length.
|
|
/// </summary>
|
|
///
|
|
public static T Max<T>(this T[] values, int length)
|
|
where T : IComparable<T>
|
|
{
|
|
int imax;
|
|
return Max(values, length, out imax);
|
|
}
|
|
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector up to a fixed length.
|
|
/// </summary>
|
|
///
|
|
public static T Min<T>(this T[] values, int length, out int imax)
|
|
where T : IComparable<T>
|
|
{
|
|
imax = 0;
|
|
T max = values[0];
|
|
for (int i = 1; i < length; i++)
|
|
{
|
|
if (values[i].CompareTo(max) < 0)
|
|
{
|
|
max = values[i];
|
|
imax = i;
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the minimum element in a vector up to a fixed length.
|
|
/// </summary>
|
|
///
|
|
public static T Min<T>(this T[] values, int length)
|
|
where T : IComparable<T>
|
|
{
|
|
int imin;
|
|
return Min(values, length, out imin);
|
|
}
|
|
#endregion
|
|
|
|
}
|
|
}
|