121 lines
3.9 KiB
C#
121 lines
3.9 KiB
C#
namespace AOC.Common;
|
|
|
|
public static class Extensions
|
|
{
|
|
public static IEnumerable<string> Chunk(this string str, int chunkSize)
|
|
{
|
|
for (var i = 0; i < str.Length; i += chunkSize)
|
|
yield return str.Substring(i, chunkSize);
|
|
}
|
|
|
|
public static string ToDelimitedString<T>(this IEnumerable<T> enumerable, string delimiter = "")
|
|
{
|
|
return string.Join(delimiter, enumerable);
|
|
}
|
|
|
|
public static IEnumerable<T> Repeat<T>(this IEnumerable<T> sequence, int? count = null)
|
|
{
|
|
while (count == null || count-- > 0)
|
|
foreach (var item in sequence)
|
|
yield return item;
|
|
}
|
|
|
|
/// <summary>
|
|
/// increased accuracy for stopwatch based on frequency.
|
|
/// <see
|
|
/// href="http://geekswithblogs.net/BlackRabbitCoder/archive/2012/01/12/c.net-little-pitfalls-stopwatch-ticks-are-not-timespan-ticks.aspx">
|
|
/// blog
|
|
/// details here
|
|
/// </see>
|
|
/// </summary>
|
|
/// <param name="stopwatch"></param>
|
|
/// <returns></returns>
|
|
public static double ScaleMilliseconds(this Stopwatch stopwatch)
|
|
{
|
|
return 1_000 * stopwatch.ElapsedTicks / (double)Stopwatch.Frequency;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Given an array, it returns a rotated copy.
|
|
/// </summary>
|
|
/// <param name="array">The two dimensional jagged array to rotate.</param>
|
|
public static T[][] Rotate<T>(this T[][] array)
|
|
{
|
|
var result = new T[array[0].Length][];
|
|
for (var i = 0; i < result.Length; i++)
|
|
result[i] = new T[array.Length];
|
|
|
|
for (var i = 0; i < array.Length; i++)
|
|
for (var j = 0; j < array[i].Length; j++)
|
|
result[i][j] = array[array.Length - j - 1][i];
|
|
|
|
return result;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Given a jagged array, it returns a diagonally flipped copy.
|
|
/// </summary>
|
|
/// <param name="array">The two dimensional jagged array to flip.</param>
|
|
public static T[][] FlipHorizontally<T>(this IEnumerable<T[]> array) =>
|
|
array.Select(x => x.Reverse().ToArray()).ToArray();
|
|
|
|
/// <summary>
|
|
/// Does a <see cref="Range"/> include a given int?
|
|
/// </summary>
|
|
/// <param name="range"></param>
|
|
/// <param name="i"></param>
|
|
/// <returns></returns>
|
|
public static bool Contains(this Range range, int i) =>
|
|
i >= range.Start.Value && i <= range.End.Value;
|
|
|
|
/// <summary>
|
|
/// Creates a new BigInteger from a binary (Base2) string
|
|
/// <see href="https://gist.github.com/mjs3339/73042bc0e717f98796ee9fa131e458d4" />
|
|
/// </summary>
|
|
public static BigInteger BigIntegerFromBinaryString(this string binaryValue)
|
|
{
|
|
BigInteger res = 0;
|
|
if (binaryValue.Count(b => b == '1') + binaryValue.Count(b => b == '0') != binaryValue.Length) return res;
|
|
foreach (var c in binaryValue)
|
|
{
|
|
res <<= 1;
|
|
res += c == '1' ? 1 : 0;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
public static IEnumerable<IEnumerable<T>> Permute<T>(this IEnumerable<T> list)
|
|
{
|
|
var array = list as T[] ?? list.ToArray();
|
|
return array.Length == 1
|
|
? new[] { array }
|
|
: array.SelectMany(t => Permute(array.Where(x => !x!.Equals(t))), (v, p) => p.Prepend(v));
|
|
}
|
|
|
|
public static int Pow(this int i, int power)
|
|
{
|
|
var pow = (uint)power;
|
|
var ret = 1;
|
|
while (pow != 0)
|
|
{
|
|
if ((pow & 1) == 1) ret *= i;
|
|
i *= i;
|
|
pow >>= 1;
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
public static IEnumerable<KeyValuePair<int, T>> Indexed<T>(this IEnumerable<T> source)
|
|
{
|
|
return source.Select((t, i) => new KeyValuePair<int, T>(i, t));
|
|
}
|
|
|
|
public static IEnumerable<KeyValuePair<TKey, TValue>> WhereValue<TKey, TValue>(
|
|
this IEnumerable<KeyValuePair<TKey, TValue>> source, Func<TValue, bool> func)
|
|
{
|
|
return source.Where(pair => func(pair.Value));
|
|
}
|
|
}
|