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.
244 lines
7.8 KiB
C#
244 lines
7.8 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 Accord.Math.Comparers;
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using Accord.Compat;
|
|
|
|
/// <summary>
|
|
/// Static class Vector. Defines a set of extension methods
|
|
/// that operates mainly on single-dimensional arrays.
|
|
/// </summary>
|
|
///
|
|
/// <seealso cref="Jagged"/>
|
|
/// <seealso cref="Vector"/>
|
|
///
|
|
public static partial class Vector
|
|
{
|
|
/// <summary>
|
|
/// Shuffles an array.
|
|
/// </summary>
|
|
///
|
|
public static void Shuffle<T>(this T[] array)
|
|
{
|
|
var random = Accord.Math.Random.Generator.Random;
|
|
|
|
// i is the number of items remaining to be shuffled.
|
|
for (int i = array.Length; i > 1; i--)
|
|
{
|
|
// Pick a random element to swap with the i-th element.
|
|
int j = random.Next(i);
|
|
|
|
// Swap array elements.
|
|
var aux = array[j];
|
|
array[j] = array[i - 1];
|
|
array[i - 1] = aux;
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Shuffles a collection.
|
|
/// </summary>
|
|
///
|
|
public static void Shuffle<T>(this IList<T> array)
|
|
{
|
|
var random = Accord.Math.Random.Generator.Random;
|
|
|
|
// i is the number of items remaining to be shuffled.
|
|
for (int i = array.Count; i > 1; i--)
|
|
{
|
|
// Pick a random element to swap with the i-th element.
|
|
int j = random.Next(i);
|
|
|
|
// Swap array elements.
|
|
var aux = array[j];
|
|
array[j] = array[i - 1];
|
|
array[i - 1] = aux;
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static void Sort<T>(this T[] values, Comparison<T> comparison, bool stable = false, bool asc = true)
|
|
{
|
|
if (!stable)
|
|
{
|
|
Array.Sort(values, comparison);
|
|
}
|
|
else
|
|
{
|
|
var keys = new KeyValuePair<int, T>[values.Length];
|
|
for (var i = 0; i < values.Length; i++)
|
|
keys[i] = new KeyValuePair<int, T>(i, values[i]);
|
|
Array.Sort(keys, values, new StableComparer<T>(comparison));
|
|
}
|
|
|
|
if (!asc)
|
|
Array.Reverse(values);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static void Sort<T>(this T[] values, bool stable = false, bool asc = true)
|
|
where T : IComparable<T>
|
|
{
|
|
if (!stable)
|
|
{
|
|
Array.Sort(values);
|
|
}
|
|
else
|
|
{
|
|
var keys = new KeyValuePair<int, T>[values.Length];
|
|
for (var i = 0; i < values.Length; i++)
|
|
keys[i] = new KeyValuePair<int, T>(i, values[i]);
|
|
Array.Sort(keys, values, new StableComparer<T>((a, b) => a.CompareTo(b)));
|
|
}
|
|
|
|
if (!asc)
|
|
Array.Reverse(values);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static void Sort<T>(this T[] values, out int[] order, bool stable = false, ComparerDirection direction = ComparerDirection.Ascending)
|
|
where T : IComparable<T>
|
|
{
|
|
if (!stable)
|
|
{
|
|
order = Vector.Range(values.Length);
|
|
Array.Sort(values, order);
|
|
|
|
if (direction == ComparerDirection.Descending)
|
|
{
|
|
Array.Reverse(values);
|
|
Array.Reverse(order);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
var keys = new KeyValuePair<int, T>[values.Length];
|
|
for (var i = 0; i < values.Length; i++)
|
|
keys[i] = new KeyValuePair<int, T>(i, values[i]);
|
|
|
|
if (direction == ComparerDirection.Ascending)
|
|
Array.Sort(keys, values, new StableComparer<T>((a, b) => a.CompareTo(b)));
|
|
else
|
|
Array.Sort(keys, values, new StableComparer<T>((a, b) => -a.CompareTo(b)));
|
|
|
|
order = new int[values.Length];
|
|
for (int i = 0; i < keys.Length; i++)
|
|
order[i] = keys[i].Key;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
/// Shuffles an array.
|
|
/// </summary>
|
|
///
|
|
public static T[] Shuffled<T>(this T[] array)
|
|
{
|
|
var clone = (T[])array.Clone();
|
|
Shuffle(clone);
|
|
return clone;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Shuffles a collection.
|
|
/// </summary>
|
|
///
|
|
public static TList Shuffled<TList, T>(this TList array)
|
|
where TList :
|
|
#if !NETSTANDARD1_4
|
|
ICloneable,
|
|
#endif
|
|
IList<T>
|
|
{
|
|
var clone = (TList)array.Clone();
|
|
Shuffle(clone);
|
|
return clone;
|
|
}
|
|
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static T[] Sorted<T>(this T[] values, Comparison<T> comparison, bool stable = false)
|
|
{
|
|
var clone = (T[])values.Clone();
|
|
Sort(clone, comparison, stable);
|
|
return clone;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static T[] Sorted<T>(this T[] values, bool stable = false, bool asc = true)
|
|
where T : IComparable<T>
|
|
{
|
|
var clone = (T[])values.Clone();
|
|
Sort(clone, stable: stable, asc: asc);
|
|
return clone;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static T[] Sorted<T>(this ICollection<T> values, bool stable = false)
|
|
where T : IComparable<T>
|
|
{
|
|
T[] clone = new T[values.Count];
|
|
values.CopyTo(clone, 0);
|
|
Sort(clone, stable);
|
|
return clone;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Sorts the elements of an entire one-dimensional array using the given comparison.
|
|
/// </summary>
|
|
///
|
|
public static T[] Sorted<T>(this T[] values, out int[] order, bool stable = false, ComparerDirection direction = ComparerDirection.Ascending)
|
|
where T : IComparable<T>
|
|
{
|
|
var clone = (T[])values.Clone();
|
|
Sort(clone, out order, stable, direction);
|
|
return clone;
|
|
}
|
|
|
|
}
|
|
}
|