v1.0.29

Bug Fixes:

• Towel.Mathematics.Symbolics.Parse<T>(...) bug fix while parsing operations such as "squareroot(5)"
• RedBlackTreeLinked<T, TCompare>.GetEnumerator() fixed bug when tree is empty

Changes:

• renamed Compare<TSift>(...) to CompareSift<TSift>(...) on both ISortedBinaryTree<T> to avoid naming collisions
• renamed Contains<TSift>(...) to ContainsSift<TSift>(...) on both ISortedBinaryTree<T> to avoid naming collisions
• renamed TryRemove<TSift>(...) to TryRemoveSift<TSift>(...) on both ISortedBinaryTree<T> to avoid naming collisions
• changed IAddable<T> method bool TryAdd(T, out Exception) to (bool, Exception?) TryAdd(T)
  • extension methods also adjusted
• changed IRemovable<T> method bool TryRemove(T, out Exception) to (bool, Exception?) TryRemove(T)
  • extension methods also adjusted
• removed StepperRef and StepperRefBreak methods
  • this is better handled by IFunc<T, (T, StepStatus)> than a custom method signature with ref parameters. I will likely add new methods called Mutate as a replacement in the future, but for now I just removed them. Here is a benchmark that influenced this descision: https://github.com/asc-community/dotnet-benchmarks/tree/master/Benchmarks/IterationRefParametersVsReturns.
• added T[] ToArray() to IDataStructure<T> (mainly for inheritdoc)
• added ICloneable<T> (mainly for inheritdoc)
  • there appears to be a bug in roslyn regarding this: dotnet/roslyn#54069
• exposed Bound<T> Exists and Value getters