youmuliu/stgsharp
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

daily update on 20240315 by nitload youmu

Browse Source
This commit is contained in:
YoumuLiu
2024-03-16 03:09:00 +08:00
parent a770bbe685
commit 15bf989285
84 changed files with 1064 additions and 1981 deletions
Download Patch File Download Diff File Expand all files Collapse all files
源代码/StgSharp/Logic/Counter.cs
+55 -3
View File
@@ -1,7 +1,51 @@
using System;
using System.Xml.Serialization;
namespace StgSharp
{
public delegate void TimeSourceProvider(TimeProvider subscriber);
public class TimeProvider
{
private readonly long _spanLength;
private long _spanBegin;
private Counter<uint> timeSpanCount = new Counter<uint>(0, 1, 1);
public static TimeSourceProvider DefaultProvider
{
get
{
return new(StgSharp.SubscribeTimeProvider);
}
}
public TimeProvider(
long spanLength
)
{
_spanLength = spanLength;
}
internal void CheckTime(long microseconds)
{
if (microseconds - _spanBegin > _spanLength)
{
_spanBegin = microseconds;
timeSpanCount++;
}
}
public void SubcsribeToTimeSource(TimeSourceProvider serviceHandler)
{
serviceHandler(this);
}
public static implicit operator uint(TimeProvider provider)
{
return provider.timeSpanCount.Value;
}
}
public class Counter<T> where T : struct, IConvertible, IFormattable, IComparable
{
internal readonly T _defualtValue;
@@ -38,24 +82,34 @@ namespace StgSharp
{
case TypeCode.Byte:
break;
case TypeCode.Int16:
break;
case TypeCode.Int32:
break;
case TypeCode.Int64:
break;
case TypeCode.Double:
break;
case TypeCode.Single:
break;
case TypeCode.SByte:
break;
case TypeCode.UInt16:
break;
case TypeCode.UInt32:
break;
case TypeCode.UInt64:
break;
default:
throw new ArgumentException("Input is not number value type");
break;
@@ -66,7 +120,6 @@ namespace StgSharp
_defualtSubValue = defualtSubValue;
}
public void Add(T value)
{
_value += value;
@@ -113,6 +166,5 @@ namespace StgSharp
{
return counter.Value;
}
}
}
}
源代码/StgSharp/Logic/Exception.cs
+15 -7
View File
@@ -1,4 +1,5 @@
using StgSharp.Graphics;
using System;
using System.Collections.Generic;
using System.Linq;
@@ -10,14 +11,21 @@ namespace StgSharp.Logic
[System.Serializable]
internal class FrameTimeoutException : Exception
{
internal FrameTimeoutException() { }
internal FrameTimeoutException(string message) : base(message) { }
internal FrameTimeoutException(Form form) :
base($"Form {nameof(form)} cannot accoplish all render work at frame {form.timer.totalFrame}")
internal FrameTimeoutException()
{ }
internal FrameTimeoutException(string message, Exception inner) : base(message, inner) { }
internal FrameTimeoutException(string message) : base(message)
{
}
internal FrameTimeoutException(string message, Exception inner) : base(message, inner)
{
}
protected FrameTimeoutException(
System.Runtime.Serialization.SerializationInfo info,
System.Runtime.Serialization.StreamingContext context) : base(info, context) { }
System.Runtime.Serialization.StreamingContext context) : base(info, context)
{
}
}
}
}
源代码/StgSharp/Logic/LinkedList.cs
-249
View File
@@ -1,249 +0,0 @@
using StgSharp.Graphics;
using System;
using System.Collections;
namespace StgSharp
{
public class LinkedList<T> : IEnumerable
{
public Counter<uint> count = new Counter<uint>(0, 1, 1);
internal readonly LinkedListNode<T> _hook;
private LinkedListNode<T> _cache;
public LinkedList()
{
_hook = new LinkedListNode<T>();
}
/// <summary>
/// Whether this linked list has no members or not.
/// </summary>
public bool IsEmpty
{
get { return count == 0; }
}
/// <summary>
/// The first memeber of this linkec list.
/// Set value to this property will reset the first node.
/// </summary>
public T First
{
get { return _hook._next._value; }
/*
* This setter is ued to reset the First node,
* be careful when use this setter to avoid
* unexpected risk of this List lose all nodes.
*/
private set { _hook._next = default; }
}
/// <summary>
/// The last memeber of this linkec list.
/// Set value to this property will reset the first node.
/// </summary>
public T Tail
{
get { return _hook._previous._value; }
/*
* This setter is ued to reset the Last node,
* be careful when use this setter to avoid
* unexpected risk of this List lose all nodes.
*/
private set { _hook._previous = default; }
}
/// <summary>
/// Add an item to the tail of linked list.
/// </summary>
/// <param name="t">The item ready to add to the list</param>
public void Add(T t)
{
//checkout if the linkedlist is null
if (IsEmpty)
{
LinkedListNode<T> node = new LinkedListNode<T>(t);
_hook._next = node;
_hook._previous = node;
node.Next = _hook;
node.Previous = _hook;
}
else
{
LinkedListNode<T> node = new LinkedListNode<T>(t);
node.Next = _hook;
node.Previous = _hook.Previous;
_hook._previous._next = node;
_hook._previous = node;
}
count++;
}
/// <summary>
/// Remove all members from this list
/// </summary>
public void Clear()
{
_hook._previous = null;
_hook._next = null;
count.Reset();
GC.Collect();
}
IEnumerator IEnumerable.GetEnumerator()
{
return new LinkedListEnumrator<T>(this);
}
/// <summary>
/// Insert a member to current linkedlist,
/// the new member will be after a certain existed member.
/// </summary>
/// <param name="target">New member will be inserted after this member</param>
/// <param name="newMember">The new member to be inserted</param>
public void InsertAfter(T target, T newMember)
{
try
{
LinkedListNode<T> targetNode = Find(target);
LinkedListNode<T> targetNext = targetNode._next;
LinkedListNode<T> newNode = new LinkedListNode<T>(newMember);
targetNode._next = newNode;
newNode._next = targetNext;
targetNode._previous = newNode;
newNode._previous = targetNode;
count++;
}
catch (Exception)
{
throw;
}
}
/// <summary>
/// Remove a member from this linkedlist.
/// </summary>
/// <param name="value">Member to be removed from this list</param>
public void Remove(T value)
{
LinkedListNode<T> node = Find(value);
node._next._previous = node._previous;
node._previous._next = node._next;
node._previous = null;
node._next = null;
count--;
}
/// <summary>
/// remove the first member of the list
/// </summary>
public void RemoveFirst()
{
if (count._value == 1)
{
First = default;
}
else
{
_hook._next.Remove();
}
count--;
}
/// <summary>
/// remove the last member of the list
/// </summary>
public void RemoveTail()
{
//check out if the list has only one member
if (count._value == 1)
{
First = default;
}
else
{
_hook.Previous = _hook.Previous.Previous;
_hook.Previous.Next = _hook;
}
count--;
}
internal LinkedListNode<T> Find(T value)
{
LinkedListNode<T> enumerator = this._hook;
do
{
enumerator = enumerator._next;
} while (!enumerator.Value.Equals(value)
|| enumerator == _hook);
if (enumerator == _hook)
{
throw new Exception();
}
return enumerator;
}
/**/
internal struct LinkedListEnumrator<T> : IEnumerator
{
private LinkedList<T> _target;
private T _value;
private LinkedListNode<T> enumerator;
private uint index = 0;
public LinkedListEnumrator(LinkedList<T> target)
{
_target = target;
enumerator = target._hook;
}
object IEnumerator.Current
{
get
{
if (index == 0 || enumerator == _target._hook)
{
throw new InvalidOperationException("Out of index range");
}
else
{
_value = enumerator._value;
return _value;
}
}
}
public T Current
{
get
{
return _value;
}
}
bool IEnumerator.MoveNext()
{
enumerator = enumerator._next;
if (enumerator == _target._hook)
{
return false;
}
index++;
return true;
}
void IEnumerator.Reset()
{
enumerator = _target._hook;
}
}
/**/
}
}
源代码/StgSharp/Logic/LinkedListNode.cs
-49
View File
@@ -1,49 +0,0 @@
using System.Diagnostics.CodeAnalysis;
namespace StgSharp
{
internal class LinkedListNode<T>
{
internal readonly T _value;
internal LinkedListNode<T> _previous;
internal LinkedListNode<T> _next;
internal LinkedList<T> list;
internal LinkedListNode()
{
}
public LinkedListNode(T t)
{
_value = t;
}
public virtual LinkedListNode<T> Previous
{
get { return _previous; }
set { _previous = value; }
}
public LinkedListNode<T> Next
{
get { return _next; }
set { _next = value; }
}
public T Value
{
get { return _value; }
}
public void Remove()
{
_previous.Next = _next;
_next.Previous = _previous;
_next = null;
_previous = null;
}
}
}
源代码/StgSharp/Logic/QuickClearNode.cs
-23
View File
@@ -1,23 +0,0 @@
namespace StgSharp.Logic
{
public abstract class QuickClearNode<T> where T : QuickClearNode<T>
{
internal LinkedList<LinkedListNode<T>> _idList
= new LinkedList<LinkedListNode<T>>();
internal void QuickDestruct(LinkedList<T> list)
{
foreach (LinkedListNode<T> id in _idList)
{
if (id.list == list)
{
RecycleBin.Add(id);
break;
}
}
}
internal static LinkedList<LinkedListNode<T>> RecycleBin
= new LinkedList<LinkedListNode<T>>();
}
}