先C++版吧，我最先用的是C#,后來是Java，后來改用C++版的，因為現在一直在用C++，單鏈

表一直沒寫上去，因為我很少用，用的是雙鏈表。

執行代碼例子1：

int main()
{
?? ??
?? ?_DList<_string> ?sl = { "123","a1","b4","1998","wc" };

?? ?_pcn(sl);

?? ?sl.Sort_Selection();

?? ?_pcn(sl);

}

輸出：

執行代碼例子2：

void test()
{
?? ?_DList<_string> ?sl = { "123","a1","b4","1998","wc" };

?? ?std::cout << "使用內存：" << _Memory::mem_used() << "\n";

?? ?sl.Sort_Selection();

?? ?std::cout << "使用內存：" << _Memory::mem_used() << "\n";
}

int main()
{
?? ?std::cout << "使用內存：" << _Memory::mem_used() << "\n";
?? ??

?? ?test();

?? ?std::cout << "使用內存：" << _Memory::mem_used() << "\n";
}

1. C++版

_List.h

/*******************************************************************************************
文件名			： list.h作者				： 李鋒功能				： 鏈表創建時間			： 2016年07月31日最后一次修改時間	:  2021年10月23日/// 鏈表是一種用來存儲數據集合的數據結構。鏈表具有如下屬性
///（1）元素通過指針依次相連
///（2）最后一個元素的指針為空（null）。
///（3）在程序的執行過程中，鏈表的長度可以自由伸縮。
///（4）鏈表的長度可以要求的任意長度（除非系統內存耗盡）。
///（5）它不會浪費內存空間（但會需要額外的內存空間存儲指針）。記住： Virtual C++  Bug:   模板繼承用到父類成員訪問時，要用 this->********************************************************************************************/
#ifndef  __LIST_H_
#define  __LIST_H_#include "_Macro.h"
#include "_Memory.h"
#include "_ByteArray.h" 
#include "_Pair.h"_LF_BEGIN_/// <summary>
/// 排序順序
/// </summary>
enum class _SortOrder
{s_Minmax = 0,   //從小到大   s_Maxmin = 1,   //從大到小s_null = 2       //無排序順序
};/// <summary>
/// 單鏈表節點
/// </summary>
/// <typeparam name="T"></typeparam>
/// 創建時間	 2021年10月23日   最后一次修改時間	:  2021年10月23日
template<class T>
class _SListNode
{public:/// <summary>/// 節點數據/// </summary>T Data;/// <summary>/// 下一個節點/// </summary>_SListNode<T>* Next;/// <summary>/// 構造函數/// </summary>/// <param name="aData"></param>_SListNode(T aData){Data = aData;}};/// <summary>
///  C#語句：public class _DListNode<T>
/// </summary>
/// <typeparam name="T">默認數據</typeparam>
template<class T>
class _DListNode   
{
public:/// <summary>/// 節點數據/// </summary>T Data;/// <summary>/// 前一個節點/// </summary>_DListNode<T>* Prev;/// <summary>/// 下一個節點/// </summary>_DListNode<T>* Next;/// <summary>/// 構造函數/// </summary>/// <param name="aData">默認數據</param>_DListNode(const T& aData){Data = aData;Prev = null;Next = null;}_DListNode(){Prev = null;Next = null;Data = T();}
};/// <summary>
/// 單鏈表：
///     通常我們說的鏈表指的是單鏈表（singly linked list）。單鏈表包括一組結點，每個結
/// 點有一個 next 指針域，用來存儲指向（邏輯上）下一個元素對應結點的指針。最后一個結點的
/// next指針域的值為null，這預示著已經到達鏈表的尾部。
/// 
/// </summary>
/// <typeparam name="T"></typeparam>
template<class T>
class _SList  : public _Object
{
private:/// <summary>/// 第一個結點/// </summary>_SListNode<T>* _First;/// <summary>/// 結點數/// </summary>int _Count;public:inline const int& Count() { return _Count; }inline const _SListNode<T>* First() { return _First; }};//------------------------------------------LDIterator
//參考網址：  https://blog.csdn.net/qq_28398301/article/details/106321525          C++用for遍歷自定義類/// <summary>
/// 
/// </summary>
/// <typeparam name="T"></typeparam>
template<class T>
class _DListNodeIterator
{
private:_DListNode<T>* _pNode;
public:/// <summary>/// 構造函數，傳值迭代器管理的值/// </summary>/// <param name="pNode"></param>inline _DListNodeIterator(_DListNode<T>* pNode) { _pNode = pNode; }/// <summary>/// 比較實現/// </summary>/// <param name="that"></param>/// <returns></returns>bool operator != (const _DListNodeIterator& that) { return _pNode != that._pNode; }/// <summary>/// 自增實現/// </summary>/// <returns></returns>inline _DListNodeIterator& operator ++ () { _pNode = _pNode->Next;   return *this; }/// <summary>/// 解引用，取值/// </summary>/// <typeparam name="T"></typeparam>T& operator * () { return _pNode->Data; }//LDIterator(const LDIterator&) = delete;//LDIterator& operator=(const LDIterator&) = delete;//~LDIterator() = default;
};/// <summary>
/// 雙向鏈表,  數據 T 要求能夠比較大小，否則編譯會出錯。
/// </summary>
/// <typeparam name="T"></typeparam>
template<class T>
class _DList : public _Object
{
protected:_DListNode<T>*  _First;	        //第一個節點_DListNode<T>*   _Last;		    //最后一個節點int             _Count;			//節點個數int             _MaxBuffer;     //雙鏈表最大可以存儲的元素個數_SortOrder      _so;        //排序順序protected:/// <summary>/// 初臺化數據/// </summary>/// <returns></returns>inline void InitData() {_Count = 0; _First = null; _Last = null; _MaxBuffer = 100000;_so = _SortOrder::s_null;}public: //---------------------------------------------------------------------------屬性__declspec(property(get = GetSortOrder, put = SetSortOrder) )  _SortOrder SortOrder;const _SortOrder& GetSortOrder() const { return _so; }virtual void SetSortOrder(const _SortOrder so) { _so = so; }__declspec(property(get = GetCount)) const int Count;inline int GetCount() const { return _Count; }public://------------------------------------------------------------構造與析構/// <summary>/// 默認構造函數/// </summary>/// <returns></returns>inline _DList(){InitData();}inline _DList(const _DList& dl){//_cout << _t("inline _DList<T>::_DList(const _DList& dl)\n");InitData();_DListNode<T>* dn = dl.First();while (dn != null){Add(dn->Data);dn = dn->Next;}}inline _DList(const T& item) {InitData();Add(item);}/// <summary>/// 列表初始化  dList<int> idl = {1,2,3,4};/// </summary>/// <typeparam name="T"></typeparam>/// <param name="tList"></param>inline _DList(std::initializer_list<T> tList){InitData();for (T t : tList) { Add(t); }}/// <summary>/// 析構函數/// </summary>inline virtual ~_DList(){//_cout << _t("inline _DList<T>::~_DList()\n");ClearData();}//------------------------------------------------------------屬性/// <summary>/// 雙鏈表最大可以存儲的元素個數/// </summary>int MaxBuffer()const { return _MaxBuffer; }/// <summary>///設定雙鏈表最大可以存儲的元素個數/// </summary>/// <param name="nCaptionty"></param>inline void MaxBuffer(int nCaptionty) { _MaxBuffer = nCaptionty; }inline int CSharp_Count() const { return _Count; }inline _DListNode<T>* First()const { return _First; }inline _DListNode<T>* Last()const { return _Last; }inline _DListNodeIterator<T> begin()const { return _DListNodeIterator<T>(_First); }/// <summary>/// /// </summary>/// <returns></returns>inline _DListNodeIterator<T> end()const{//迭代器使用的語句//for (_DListNodeIterator<int> f = dl.begin(); f != dl.end(); f++) {       }return _DListNodeIterator<T>(null);}//-----------------------------------------------------------運算符重載/// <summary>/// 重載的下標操作符 []/// </summary>T& operator[](const int& nIndex) const {  return IndexOfNode(nIndex)->Data; }/// <summary>/// 重載的下標操作符 =/// </summary>/// 創建時間： ????-??-??      最后一次修改時間：2024-04-19     inline _DList<T>& operator = (const _DList<T>& other){if (this != &other){ClearData();Add(other);              }return *this;}/// <summary>/// 類型轉換/// </summary>inline operator _string() const{ return ToString(); }/// <summary>/// 類型轉換/// </summary>inline operator _stdstr() const { return ToString().Data; }//---------------------------------------------------------虛函數重寫/// <summary>/// 是否存在 item/// </summary>inline virtual bool Contains(const T& item){ return BinarySearch(item) != -1; }/// <summary>/// 交換兩個節點的數據/// </summary>/// <typeparam name="T"></typeparam>/// <param name="iIndex1"></param>/// <param name="iIndex2"></param>/// <returns></returns>inline bool SwapNodeData(const int& iIndex1, const int& iIndex2){_DListNode<T>* pNode1, * pNode2;pNode1 = IndexOfNode(iIndex1);pNode2 = IndexOfNode(iIndex2);if (!(pNode1 != null && pNode2 != null)){return false;}T ptmp = pNode1->Data;pNode1->Data = pNode2->Data;pNode2->Data = ptmp;return true;}/// <summary>/// 選擇排序（Selection sort）是一種簡單直觀的排序算法。它的工作原理是：第一次從待排序的數據元素中選出最小/// 或最大）的一個元素，存放在序列的起始位置，然后再從剩余的未排序元素中尋找到最小（大）元素，然后放到已排序/// 的序列的末尾。以此類推，直到全部待排序的數據元素的個數為零。選擇排序是不穩定的排序方法。/// </summary>/// <typeparam name="T"></typeparam>/// <param name="sortord"></param>/// 創建時間： ???-??-??      最后一次修改時間：???-??-??    已測試inline virtual void Sort_Selection(const _SortOrder& sortord = _SortOrder::s_Minmax){if (_Count == 0 || _Count == 1) return;_DListNode<T>* min = _First, * tmp = _First->Next;if (sortord == _SortOrder::s_Minmax) //從小到大{while (min->Next != null){while (tmp != null){if (tmp->Data < min->Data)  //交換數據{T pt = tmp->Data;tmp->Data = min->Data;min->Data = pt;}tmp = tmp->Next;}min = min->Next;tmp = min->Next;}}else{while (min->Next != null){while (tmp != null){if (tmp->Data > min->Data){T pt = tmp->Data;tmp->Data = min->Data;min->Data = pt;}tmp = tmp->Next;}min = min->Next;tmp = min->Next;}}this->_so = sortord;  //已排序}/// <summary>/// 返回索引的節點/// </summary>inline virtual _DListNode<T>* IndexOfNode(const int& iPos)const{if (iPos < 0 || iPos >= _Count) //錯誤索引:{return NULL;}unsigned int nindex = 0;if (iPos > _Count / 2){_DListNode<T>* pNode = _Last;while (pNode != null){if (nindex++ == _Count - iPos - 1) { return pNode; }pNode = pNode->Prev;}}else{_DListNode<T>* pNode = _First;while (pNode != null){if (nindex++ == iPos){return pNode;}pNode = pNode->Next;}}return null;}/// <summary>/// 把索引為nIndex的節點移到最后/// </summary>/// <typeparam name="T"></typeparam>/// <param name="iIndex"></param>/// <returns></returns>inline virtual bool MoveLast(const int& iIndex){_DListNode<T>* pNode = IndexOfNode(iIndex);if (pNode != null){if (pNode == _Last)return true;if (pNode == _First) //此時最少兩個節點{_First = _First->Next;_First->Prev = null;_Last->Next = pNode;pNode->Prev = _Last;_Last = pNode;}else{pNode->Prev->Next = pNode->Next;pNode->Next->Prev = pNode->Prev;_Last->Next = pNode;pNode->Prev = _Last;_Last = pNode;}return true;}return false;}/// <summary>/// 把節點移到最后/// </summary>/// 創建時間： 2022-02-18      最后一次修改時間：2022-02-18inline virtual bool MoveLast(_DListNode<T>* dnCurrent){if (dnCurrent == null) return false;this->_so = _SortOrder::s_null;if (_Count == 0){return false;}else if (_Count == 1){return true;}else if (_Count == 2){if (dnCurrent == _First)  //交換_First 與 _Last 數據{T tmp = _First->Data;_First->Data = _Last->Data;_Last->Data = tmp;}return true;}else{if (dnCurrent == _First){_First = _First->Next;_First->Prev = null;_Last->Next = dnCurrent;dnCurrent->Next = null;dnCurrent->Prev = _Last;_Last = dnCurrent;}else if (dnCurrent != _Last){dnCurrent->Prev->Next = dnCurrent->Next;dnCurrent->Next->Prev = dnCurrent->Prev;_Last->Next = dnCurrent;dnCurrent->Next = null;dnCurrent->Prev = _Last;_Last = dnCurrent;}return true;}}/// <summary>/// 把索引為nIndex的節點移到最前/// </summary>/// <param name="iIndex"></param>inline virtual bool MoveFirst(const int& iIndex){_DListNode<T>* pNode = IndexOfNode(iIndex);if (pNode != null){if (pNode == _First)return true;if (pNode == _Last)  //此時最少兩個節點{_Last->Prev->Next = null;_Last = _Last->Prev;pNode->Prev = null;pNode->Next = _First;_First->Prev = pNode;_First = pNode;}else{pNode->Prev->Next = pNode->Next;pNode->Next->Prev = pNode->Prev;pNode->Next = _First;_First->Prev = pNode;pNode->Prev = null;_First = pNode;}return true;}return false;}/// <summary>/// 將指定集合的元素添加到末尾/// </summary>/// <typeparam name="T"></typeparam>/// <param name="item"></param>/// <returns></returns>inline virtual bool Add(const T& item){if (_Count == 0){//_First = new _DListNode<T>(item);_First = _Memory::New< _DListNode<T> >(1);_First->Data = item;_First->Next = null;_First->Prev = null;_Last = _First;}else{_DListNode<T>* pNew = _Memory::New< _DListNode<T> >(1);pNew->Data = item;pNew->Next = null;pNew->Prev = _Last;_Last->Next = pNew;_Last = pNew;}++_Count;this->_so = _SortOrder::s_null;   //要重新排序return true;}/// <summary>/// 添加一個鏈表/// </summary>inline void  Add(const _DList<T>& dList){assert(&dList != null);_DListNode<T>* pNode = dList._First;while (pNode != null){Add(pNode->Data);pNode = pNode->Next;}}
protected:/// <summary>/// 在結點pListItem前面插入一個結點,成功，返回新的結點，否則返回null/// </summary>/// <typeparam name="T"></typeparam>/// <param name="pListItem"></param>/// <param name="rData"></param>/// <returns></returns>inline virtual _DListNode<T>* InserNodeFront(_DListNode<T>* pListItem, const T& rData){assert(pListItem != null);_DListNode<T>* pNode = _Memory::New<_DListNode<T>>(1);pNode->Data = rData;//pNode            pNode->Next = pListItem;pNode->Prev = pListItem->Prev;//--pListItem->Previf (pListItem->Prev != null){pListItem->Prev->Next = pNode;}else{_First = pNode;}//pListItempListItem->Prev = pNode;++_Count;return pNode;}/// <summary>/// 在結點pListItem后面插入一個結點,成功，返回新的結點，否則返回０；/// </summary>/// <typeparam name="T"></typeparam>/// <param name="pListItem"></param>/// <param name="rData"></param>/// <returns></returns>inline virtual _DListNode<T>* InserNodeBack(_DListNode<T>* pListItem, const T& rData){if (pListItem == null) return null;_DListNode<T>* pNode = _Memory::New<_DListNode<T>>(1);pNode->Data = rData;//pNodepNode->Prev = pListItem;pNode->Next = pListItem->Next;//pListItem->Nextif (pListItem->Next != null){pListItem->Next->Prev = pNode;}else{_Last = pNode;}//--pListItempListItem->Next = pNode;++_Count;return pNode;}//------------------------------------------------------------操作         
public:/// <summary>/// 如果已排好序，它會按二分法查找，否則它會普通查找。/// </summary>/// <param name="item"></param>/// <returns></returns>/// 創建時間： ????-??-??      最后一次修改時間：????_??_??       已測試inline int BinarySearch(const T& item)const {switch (this->_so){case _SortOrder::s_Maxmin:{if (_Count == 0){return -1;}if (_Count == 1){//return (_First.Data as IComparable).CompareTo(item) == 0 ? 0 : -1;  //C#return _First->Data == item ? 0 : -1;}if (_Count == 2){//if ((_First.Data as IComparable).CompareTo(item) == 0) return 0;//if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return 1;if (_First->Data == item) return 0;if (_First->Next->Data == item) return 1;return -1;}int nPos = (int)_Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)_Count - 1;  //右邊遠素_DListNode<T>* pNode;while (nRight >= 0 && nLeft >= 0){pNode = IndexOfNode(nPos);//int iCom = (item as IComparable).CompareTo(ld.Data);if (item > pNode->Data){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (item < pNode->Data){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case _SortOrder::s_Minmax:{if (_Count == 0){return -1;}if (_Count == 1){//return (_First.Data as IComparable).CompareTo(item) == 0 ? 0 : -1;return _First->Data == item ? 0 : -1;}if (_Count == 2){//if ((_First.Data as IComparable).CompareTo(item) == 0) return 0;//if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return 1;if (_First->Data == item) return 0;if (_First->Next->Data == item) return 1;return -1;}int nPos = (int)_Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)_Count - 1;  //右邊遠素_DListNode<T>* pNode = null;while (nRight >= 0 && nLeft >= 0){pNode = IndexOfNode(nPos);//int iCom = (item as IComparable).CompareTo(ld.Data);if (item < pNode->Data){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (item > pNode->Data){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case _SortOrder::s_null:{_DListNode<T>* pNode = _First;int iCount = 0;while (pNode != null){if (pNode->Data == item){return iCount;}pNode = pNode->Next;++iCount;}break;}default:{return -1;}}return -1;}/// <summary>/// 清除節點，并釋放內存/// </summary>/// <typeparam name="T"></typeparam>/// 創建時間： ????-??-??      最后一次修改時間：2022-12-24    (已測試）inline void ClearData() override { ClearMemory(); }/// <summary>/// 清除節點，并釋放內存/// </summary>inline void ClearMemory() override{_Count = 0;_DListNode<T>* dn = _First;while (dn != null){if (dn->Prev != null)_Memory::Delete< _DListNode<T> >(dn->Prev, 1);dn = dn->Next;}if (_Last != null)_Memory::Delete< _DListNode<T> >(_Last, 1);_First = null;_Last = null;this->_so = _SortOrder::s_null;}/// <summary>/// 復制一個鏈表，清除原來鏈表的數據/// </summary>/// <typeparam name="T"></typeparam>/// <param name="ld"></param>inline void CopyFrom(const _DList<T>& ld){if (this != &ld){ClearData();_DListNode<T>* pNode = ld._First;while (pNode != null){Add(pNode->Data);pNode = pNode->Next;}}}/// <summary>/// 移除指定索引處的元素/// </summary>/// <typeparam name="T">類型</typeparam>/// <param name="iIndex">要移除的元素的從零開始的索引。</param>/// <returns>成功返回true,否則返回false</returns>/// 創建時間：????-??-?? 最后一次修改時間：2023-04-08inline bool RemoveAt(const int& iIndex){if (iIndex < 0 || iIndex >= _Count) return false;_DListNode<T>* pNode = _First;int iCount = 0;while (pNode != null){if (iCount == iIndex){if (pNode == _First){if (_First->Next == null)   //只有一個{ClearData();return true;}else{_First = _First->Next;_First->Prev = null;--_Count;_Memory::Delete<  _DListNode<T> >(pNode, 1);return true;}}else if (pNode == _Last){if (_Last->Prev == null){ClearData();return true;}else{ _Last = _Last->Prev;_Last->Next = null;--_Count;_Memory::Delete< _DListNode<T>>(pNode, 1);return true;}}else{pNode->Prev->Next = pNode->Next;pNode->Next->Prev = pNode->Prev;--_Count;_Memory::Delete< _DListNode<T>>(pNode, 1);return true;}}pNode = pNode->Next;++iCount;}return false;}/// <summary>/// 查找一項數據/// </summary>inline _DListNode<T>* FindNodeItem(const T& item)const{switch (this->_so){case _SortOrder::s_Maxmin:{if (_Count == 0){return null;}if (_Count == 1){//return (_First.Data as IComparable).CompareTo(item) == 0 ? _First : null;return _First->Data == item ? _First : null;}if (_Count == 2){//if ((_First.Data as IComparable).CompareTo(item) == 0) return _First;//if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return _First.Next;if (_First->Data == item) return _First;if (_First->Next->Data == item) return _First->Next;return null;}int nPos = (int)(_Count / 2);   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)(_Count - 1);  //右邊遠素_DListNode<T>* pNode = null;while (nRight >= 0 && nLeft >= 0){pNode = IndexOfNode(nPos);//int iCom = (item as IComparable).CompareTo(ld.Data);if (item > pNode->Data){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (item < pNode->Data){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return pNode;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case _SortOrder::s_Minmax:{if (_Count == 0){return null;}if (_Count == 1){//return (_First.Data as IComparable).CompareTo(item) == 0 ? _First : null;return _First->Data == item ? _First : null;}if (_Count == 2){//if ((_First.Data as IComparable).CompareTo(item) == 0) return _First;//if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return _First.Next;if (_First->Data == item) return _First;if (_First->Next->Data == item) return _First->Next;return null;}int nPos = (int)(_Count / 2);   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)(_Count - 1);  //右邊遠素_DListNode<T>* pNode = null;while (nRight >= 0 && nLeft >= 0){pNode = IndexOfNode(nPos);//int iCom = (item as IComparable).CompareTo(ld.Data);if (item < pNode->Data){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (item > pNode->Data){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return pNode;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case _SortOrder::s_null:{_DListNode<T>* pNode = _First;while (pNode != null){//總結:Equals比較的永遠是變量的內容是否相同，而= =比較的則是引用地址是否相同(前提:此種類型內部沒有對Equals 或= = 進行重寫操作，//否則輸出可能會有不同)。string 類型是個特例，因為他的內部對這兩個都進行了重寫。if (item == pNode->Data){return pNode;}/*if (pNode.Data.Equals(item)){return pNode;}*/pNode = pNode->Next;}break;}default:{return null;}}return null;}/// <summary>/// 刪除鏈表中的數據/// </summary>/// <typeparam name="T"></typeparam>/// <param name="pData"></param>/// <returns></returns>inline bool RemoveItem(const T& pData){if (this->_so == _SortOrder::s_null){_DListNode<T>* pNode = _First;while (pNode != null){if (pNode->Data == pData)	//找到一項{if (pNode == _First)		//刪除的是第一個節點{if (_First->Next != null){_First->Next->Prev = null;_First = _First->Next;}else{_First = null;_Last = null;}}else if (pNode == _Last)  //刪除的是最后一個節點{if (_Last->Prev != null){_Last->Prev->Next = null;_Last = _Last->Prev;}else{_Last = null;_Last = null;}}else						//刪除的是中間的一個節點{pNode->Next->Prev = pNode->Prev;pNode->Prev->Next = pNode->Next;}--_Count;return true;}pNode = pNode->Next;}return false;}else{return RemoveAt(BinarySearch(pData));}}/// <summary>/// 刪除最后一個節點/// </summary>/// 創建時間：2020-09-12  最后一次修改時間： 2023-01-18inline bool DeleteLast(){auto pDelete = Last();if (_Count <= 0){return false;}else if (_Count == 1){_First = null;_Last = null;_Count = 0;}else if (_Count == 2){_Last = _First;_Last->Prev = null;_Last->Next = null;_First->Next = null;_First->Prev = null;--_Count;}else{_Last->Prev->Next = null;_Last = _Last->Prev;--_Count;}_Memory::Delete<_DListNode<T>>(pDelete, 1);return true;}/// <summary>/// 添加一個元素，并把它放在首位，其它元素后移,如果后面的元素刪除，總無素個數不變，如果元素個數為零，則添加一個無素。/// </summary>/// <param name="Item"></param>/// <param name="bRemoveLast"></param>/// 創建時間： 2022-04-19      最后一次修改時間：2022-04-19inline void HistoryAdd(const T& Item, bool bRemoveLast){if (_Count == 0) {Add(Item);}else if (_Count == 1) {if (bRemoveLast) {_First->Data = Item;}else {//把無素放在最前_DListNode<T>* dnNew = _Memory::New<_DListNode<T>>(1);dnNew->Data = Item;_First->Prev = dnNew;dnNew->Next = _First;_First = dnNew;++_Count;}}else {if (bRemoveLast) {_DListNode<T>* dnDelete = _Last;//刪除最后一個元素_Last = _Last->Prev;_Last->Next = null;_DListNode<T>* dnNew = _Memory::New<_DListNode<T>>(1);dnNew->Data = Item;_First->Prev = dnNew;dnNew->Next = _First;dnNew->Prev = null;_First = dnNew;_Memory::Delete< _DListNode<T>>(dnDelete, 1);}else {//把無素放在最前_DListNode<T>* dnNew = _Memory::New<_DListNode<T>>(1);dnNew->Data = Item;_First->Prev = dnNew;dnNew->Next = _First;dnNew->Prev = null;_First = dnNew;++_Count;}}}/// <summary>/// 出棧(先進后出）,刪除最后一個元素，/// </summary>/// 創建時間： 2022-04-19      最后一次修改時間：2023-04-06inline T StackPop(){assert(_Count > 0);T tResult = _Last->Data;this->RemoveAt(_Count - 1);return tResult;}//----------------------------------------------------------------------------------------------------Python List方法/// <summary>/// 將元素tItem添加到列表末尾。/// </summary>/// 創建時間： 2023-04-08      最后一次修改時間：2023-04-08inline void Python_append(const T& tItem){Add(tItem);}/// <summary>/// 在位置nIndex后面插入一個元素tItem/// </summary>inline void Python_insert(const int nIndex, const T& tItem){InserNodeBack(IndexOfNode(nIndex), tItem);}/// <summary>/// 在最前面插入一項/// </summary>/// <param name="tItem"></param>/// 創建時間： 2024-04-16      最后一次修改時間：2024-04-16inline void Inseart_front(const T& tItem){_DListNode<T>* pNode = _Memory::New<_DListNode<T>>(1);pNode->Data = tItem;if (_First != null){_First->Prev = pNode;pNode->Next = _First;pNode->Prev = null;_First = pNode;}else{ pNode->Next = null;pNode->Prev = null;_First = pNode;_Last = pNode;}++_Count;}/// <summary>/// 刪除索引位置為nIndex的元素，并返回刪除的元素值的拷貝，如果索引值nIndex = -1，則默認刪除為最后一個元素。/// </summary>/// <param name="nIndex"></param>/// <returns></returns>/// 創建時間： 2023-04-08      最后一次修改時間：2023-04-09inline T Python_pop(const int nIndex = -1){if (nIndex == -1){         return StackPop();}else{ auto dn = this->IndexOfNode(nIndex);T tmp = T();if (dn != null){tmp = dn->Data;                  DeleteNode(dn);}return tmp;}         }/// <summary>/// 刪除值為tItem的一項。/// 注意，方法remove()只刪除第一個指定的值。如果要刪除的值可能在列表中出現多次，/// 就需要使用循環來確保每個值都刪除。/// </summary>inline bool Python_remove(const T& tItem){ int n = _Count;DeleteNode(FindNodeItem(tItem));return n == _Count;}protected:/// <summary>/// 刪除鏈表中的節點/// </summary>/// <typeparam name="T"></typeparam>/// <param name="pListItem"></param>/// <returns></returns>//inline bool DeleteNode(const _DListNode<T>* pNodeDelete)//{//    if (_Count == 0 || pNodeDelete == null)//    {//        return false;//    }//    _DListNode<T>* pNode = _First.Next;//    while (pNode != null)//    {//        if (pNode == pNodeDelete)  //找到了//        {//            //pListItem->Prev//            if (pNodeDelete->Prev != null)//            {//                pNodeDelete->Prev->Next = pNodeDelete->Next;//            }//            else //刪除的是第一個節點//            {//                _First = pNodeDelete.Next;//            }//            //pListItem->Next//            if (pNodeDelete->Next != null)//            {//                pNodeDelete->Next->Prev = pNodeDelete->Prev;//            }//            else //刪除的是最后一個節點//            {//                _Last = pNodeDelete->Prev;//            }//            break;//        }//        pNode = pNode->Next;//    }//    if (pNode != null)//    {//        --_Count;//        _Memory::Delete< _DListNode<T> >(pNode,1);  //C#不用清除內存//        return true;//    }//    return false;//}/// <summary>/// 刪除鏈表中的某一節點，注意，這個節點一定要是在鏈表中的。/// </summary>/// 創建時間： 2023-04-09      最后一次修改時間：2023-04-09inline void DeleteNode(_DListNode<T>* pNodeDelete){if (_Count == 0 || pNodeDelete == null) return;if (_Count == 1){ClearMemory();}else{if (pNodeDelete == _First) //刪除的是第一個節點{_First = _First->Next;_First->Prev = null;}else if (pNodeDelete == _Last){_Last = _Last->Prev;_Last->Next = null;}else{pNodeDelete->Prev->Next = pNodeDelete->Next;pNodeDelete->Next->Prev = pNodeDelete->Prev;}--_Count;_Memory::Delete< _DListNode<T> >(pNodeDelete, 1);}}public://----------------------------------------------------------  C++inline void Push_back(const T& TypeObject) { Add(TypeObject); }public: //------------------------------------------------------------------重寫/// <summary>/// 轉換為字符串/// </summary>/// <returns></returns>/// 創建時間： 2023-05-16      最后一次修改時間：2024-01-14inline virtual  _string ToSplitString(const _string& sSplitString)  const override{//不可以這樣： const _DList<_Object>* dp = (_DList<_Object> *)pList;//就算 T 類型數據是從 _Object中繼承也不可以。_string sResult;sResult.Add(_t("{"));_string sp = sSplitString.Length == 0 ? _string(_t(",")) : sSplitString;//是否繼承處_Objectif (std::is_base_of<_Object, T>::value){  _Object* po;if (_Count == 1){po = (_Object*)(&_First->Data);sResult.Add((_string)(*po));}_DListNode<T>* dn = this->_First;while (dn != _Last){po = (_Object*)(&dn->Data);sResult.Add((_string)(*po));sResult.Add(sp);dn = dn->Next;}po = (_Object*)(&_Last->Data);sResult.Add((_string)(*po));}else{if (typeid(T) == typeid(int)){_DListNode<T>* dn = this->_First;while (dn != _Last){int* pInt = (int*)&(dn->Data);sResult.Add(_string::Java_valueOf(*pInt));sResult.Add(sp);dn = dn->Next;}if (this->Count > 0)sResult.Add(_string::Java_valueOf(*((int*)(&(_Last->Data)))));}         else if(typeid(T) == typeid(size_t)){_DListNode<T>* dn = this->_First;while (dn != _Last){size_t* pInt = (size_t*)&(dn->Data);sResult.Add(_string::Java_valueOf(*pInt));sResult.Add(sp);dn = dn->Next;}if (this->Count > 0)sResult.Add(_string::Java_valueOf(*((size_t*)(&(_Last->Data)))));}else if (typeid(T) == typeid(double)){if (_Count == 0) return sResult;double* pd;if (_Count == 1){pd = (double*)(&(_First->Data));sResult.Add(_Convert::DoubleToString(*pd));}_DListNode<T>* dn = this->_First;while (dn != _Last){pd = (double*)&(dn->Data);sResult.Add(_Convert::DoubleToString(*pd));sResult.Add(sp);dn = dn->Next;}pd = (double*)&(_Last->Data);sResult.Add(_Convert::DoubleToString(*pd));}else if (typeid(T) == typeid(_string)){_string* ps;_DListNode<T>* dn = this->_First;while (dn != _Last){ps = (_string*)(&dn->Data);sResult.Add(_t("\""));sResult.Add(*ps);sResult.Add(_t("\""));sResult.Add(sp);dn = dn->Next;}if (_Count > 0){ps = (_string*)(&_Last->Data);sResult.Add(_t("\""));sResult.Add(*ps);sResult.Add(_t("\""));}}else if (typeid(T) == typeid(_StrA)){_StrA* ps;if (_Count <= 0){}else if (_Count == 1){ps = (_StrA*)(&_First->Data);sResult.Add(_t("\""));sResult.Add(*ps);sResult.Add(_t("\""));}else{_DListNode<T>* dn = this->_First;while (dn != _Last){ps = (_StrA*)(&dn->Data);sResult.Add(_t("\""));sResult.Add(*ps);sResult.Add(_t("\""));sResult.Add(_t(','));dn = dn->Next;}ps = (_StrA*)(&_Last->Data);sResult.Add(_t("\""));sResult.Add(*ps);sResult.Add(_t("\""));}}else  //所有繼承自 _Object 類的數據類型都可以{sResult.Add(_t("_LDList::ToSplitString重寫,數據類型為："));sResult.Add(_string(typeid(T).name()));            }}sResult.Add(_t("}\n"));return sResult;}inline _string ToString()const{return ToSplitString(_t(""));}}; //--------------------------------------------------------------------------DList//-----------------------------------------------------------------------SortedDList
/// <summary>
///  C#語句：public class SortList<T> : _DList<T>
/// </summary>
/// <typeparam name="T"></typeparam>
template<class T>
class SortedDList : public _DList<T>
{};//----------------------------------------------------------------------StringList
template<class T>
class _StrList : public _DList<T>
{public:  //------------------------------------------------------------------構造與析構 _StrList() : _DList<T>() {};_StrList(const _StrList<T>& sl) : _DList<T>(sl) {};explicit _StrList(const _char* pStr, const _char* pSplit, bool bIgnoreEmptyString = false){this->InitData();SplitForSeparator(pStr, pSplit, bIgnoreEmptyString);}/// <summary>/// 要加上 explicit阻止自動轉換， 否則執行語名會自動調用這個構造函數  _StrList  ls = { L"AA",L"BB"};/// </summary>/// <param name="sText"></param>/// <param name="sSplit"></param>/// <param name="bIgnoreEmptyString"></param>explicit _StrList(const T& sText, const T& sSplit, bool bIgnoreEmptyString = false){//assert(sText != null && sSplit != null);//SplitForSeparator(sText.Data, sSplit.Data, bIgnoreEmptyString);if (sText.Length == 0) { return; }if (sSplit.Length == 0) { Add(sText);   return; }int iStart = 0;int iIndex = sText.IndexOf(sSplit, iStart);if (iIndex == -1){Add(sText);return;}while (iIndex != -1 && iStart + 1 <= sText.Length){if (iIndex != iStart)Add(sText.SubStr(iStart, iIndex - iStart));else{if (!bIgnoreEmptyString) Add(T());}iStart = iIndex + sSplit.Length;iIndex = sText.IndexOf(sSplit, iStart);if (iIndex == -1 && sText.Length != iStart)Add(sText.SubStr(iStart, sText.Length - iStart));  //拷貝最后一個}}_StrList(std::initializer_list<T> aList){for (T s : aList){Add(s);}}public: //------------------------------------------------------------------操作void writeToFile(const T& sFullPathName){}bool readToFile(const T& sFullPathName){return false;}bool readToUnicodeFile(const T& sFileName, const T& sSplit){return false;}/// <summary>/// 獲取所有字符串的總共長度/// </summary>/// <returns></returns>/// 創建時間：  2022-11-05    最后一次修改時間：  2022-11-05 int GetStringLength() const{int iSum = 0;auto dn = this->_First;while (dn != null) {iSum += (int)dn->Data.Length;dn = dn->Next;}return iSum;}T connectForSeparator(const T& sConnector)const{if (this->_Count == 0) return _t("");if (this->_Count == 1) return this->_First->Data;T tmp(_t(""), GetStringLength() + sConnector.Length * this->_Count + 100);_DListNode<T>* ldNode = this->_First;while (ldNode != this->_Last){tmp += ldNode->Data;tmp += sConnector;ldNode = ldNode->Next;}tmp += this->_Last->Data;       //加入最后一項return tmp;}T connectForSeparator(const _char& cConnector) const{return connectForSeparator(&cConnector);}/// <summary>/// 返回分隔后的字符串列表/// </summary>/// <param name="pStr">原文本</param>/// <param name="pSplit">分隔字符串</param>/// <param name="bIgnoreEmptyString">是否忽略空字符串</param>/// <returns>返回一個字符串列表</returns>/// 創建時間： 2022-10-04     最后一修改時間：2022-10-05       已測試_StrList<T>& SplitForSeparator(const _char* pStr, const _char* pSplit, bool bIgnoreEmptyString){if (pStr == null || pSplit == null){_cout << "在中_StrList::SplitForSeparator中" << L"pStr == null || pSplit == null" << "\n";throw "pStr == null || pSplit == null";}this->ClearData();if (pStr[0] == 0 || pSplit[0] == 0){Add(_t(""), 0, 0);return *this;}int i = 0;int j = 0;int nStart = 0, nEnd = 0;while (pStr[i] != 0) {// _cout << _t("pStr[i] = ") << pStr[i] << _t("\n");  //此句出錯，無任何提示bool bFind = true;j = 0;while (pSplit[j] != 0) {if (pStr[i + j] != pSplit[j]) {bFind = false;break;}++j;}if (bFind) {nEnd = i - 1;     //此處如果 nEnd 是 int ，則 nEnd = i - 1 => nEnd = 18446744073709551615 => 溢出錯誤 if (bIgnoreEmptyString) {if (nStart <= nEnd) {Add(pStr, nStart, nEnd);  //這里應nStart <= nEnd，而不是 nStart < nEnd，因為當 nStart = nEnd 還是有一個字符的}}else {Add(pStr, nStart, nEnd);}nStart = i + j;i = nStart - 1;}++i;}//拷貝右邊最后一項if (bIgnoreEmptyString) {if (nStart <= i - 1) {Add(pStr, nStart, (int)i - 1);}}else {Add(pStr, nStart, (int)i - 1);}return *this;}//int SplitForSeparator(const T& sText, const _char& cSplit);int IndexOf(const T& s){int nIndex = 0;auto dn = this->_First;while (dn){if (dn->Data == s) { return nIndex; }++nIndex;dn = dn->Next;}return -1;}int GetMaxSpaceLength(int nTabCount = 9, int nChineseCharactersCount = 3)const{int nMax = 0;auto dn = this->_First;while (dn){int n = gs.s_length_space(dn->Data.Data, nTabCount, nChineseCharactersCount);if (n > nMax) nMax = n;dn = dn->Next;}return nMax;}/// <summary>/// 用tab鍵使每行等長/// </summary>/// <param name="nTabCount"></param>/// <returns></returns>/// 創建時間：  2022-10-30    最后一次修改時間：  2022-10-30 T equilongTabLine(int nTabCount = 9){this->RemoveHeadTab();int iMax = GetMaxSpaceLength(nTabCount);for (T& s : *this) {int nSapceLength = gs.s_length_space(s.Data);int n = (iMax - nSapceLength) / 9;if (iMax - nSapceLength - n * 9 >= 5)++n;else--n;for (int j = 0; j < n; j++){s.Add(_t("\t"));}}return connectForSeparator(_t('\n')) + _t('\n');}/// <summary>/// 計算所有行，如果每行都有開始處都有 \t ，則每行除去 \t , 除去個數以最少 \t 行為準。/// 例：/// \t\t abc/// \t bcd/// \t\t\t dd/// 運行函數后變成/// \t abc/// bcd/// \t\t dd/// </summary>/// 創建時間：  2022-11-05    最后一次修改時間：  2022-11-05 void RemoveHeadTab(){int iMin = 100000000;for (T& s : *this) {if (s.Length > 0){int iCount = gs.s_headTabCount(s.Data);if (iCount < iMin) { iMin = iCount; }//log::d("iCount=" + iCount.ToString(), s);}}//log::d("iMin=" + iMin.ToString());if (iMin > 0){for (T& s : *this) {s = s.SubStr(iMin, s.Length - iMin);}}}//-----------------------------------------------------------------------虛函數virtual bool Add(const T& item) override{//_cout << item << "\n";return _DList<T>::Add(item);}void Add(const _StrList<T>& ls)   //覆蓋 父類重載函數 virtual bool Add(const T& item);{_DListNode<T>* pNode = ls._First;while (pNode != null){Add(pNode->Data);pNode = pNode->Next;}}bool Add(const T& str, int nStartPos, int nEndPos){if (str.Length == 0 || nEndPos - nStartPos < 0){Add(T());}else {int nLength = nEndPos - nStartPos + 1;/*_Mem<_char> m(nLength + 1);for (int i = 0; i < nLength; ++i){m.Data[i] = pStr[nStartPos + i];}m.Data[nLength] = 0;*/Add(str.SubStr(nStartPos, nLength));}return false;}_string  ToSplitString(const _string& sSplitString) const  override{/**  auto dn = this->_First;T sResult;while (dn != this->_Last){           sResult.std_append(dn->Data);                          sResult.std_append(sConnector);dn = dn->Next;}if (this->_Last != null){sResult.std_append(dn->Data);}char c = '\n';sResult.std_append(c );return sResult;*/return _DList<T>::ToSplitString(sSplitString);}
};/// <summary>
/// 不重復的字符串列表
/// </summary>
/// <typeparam name="T"></typeparam>
/// 創建時間： 2023-05-11      最后一次修改時間：2023-05-11
template<class T>  
class _UStrList : public _StrList<T>
{ 
public:/// <summary>/// 加入一個串，如果這個串存在，則把這項移到最后。/// </summary>/// <param name="item"></param>/// 創建時間： ????-??-??      最后一次修改時間：2023-05-11 (已測試）bool Add(const T& item)override{  bool bFind = false;_DListNode<T>* dnTemp = this->_First;while (dnTemp != null){if (dnTemp->Data == item){this->MoveLast(dnTemp);return false;}dnTemp = dnTemp->Next;}_StrList<T>::Add(item);return true;}};/// <summary>
/// 值都是唯一的字符串列表，  Case Insensitive(不區分大小寫)
/// </summary>
template<class T>
class _UStrListCI : public _StrList<T>
{public:/// <summary>/// 加入一個串，如果這個串存在，則把這項移到最后。/// </summary>/// <param name="item"></param>/// 創建時間： ????-??-??      最后一次修改時間：2022-02-18bool Add(const T& item)override{bool bFind = false;_DListNode<T>* dnTemp = this->_First;while (dnTemp != null){if (dnTemp->Data.CSharp_ToLower() == item.CSharp_ToLower()){this->MoveLast(dnTemp);return false;}dnTemp = dnTemp->Next;}_StrList<T>::Add(item);return true;}/*/// <summary>/// 返回前面一個值/// </summary>/// <param name="tCurrValue"></param>/// <returns></returns>T& GetForward(T& sCurr){int iIndex = BinarySearch(sCurr);if (iIndex != -1){if (iIndex + 1 < _Count)return this[iIndex + 1];}return null;}/// <summary>/// 返回后面的一個值/// </summary>/// <param name="sCurr"></param>/// <returns></returns>T& GetBack(T& sCurr){int iIndex = BinarySearch(sCurr);if (iIndex != -1){if (iIndex - 1 < _Count && iIndex - 1 >= 0)return this[iIndex - 1];}return null;}*/
};/// <summary>
/// 已排序好的字符串列表
/// </summary>
template<class T>
class _SStrList : public  _StrList<T>
{
public:_SStrList(const _SortOrder so = _SortOrder::s_Minmax){this->_so = so;if (this->_so == _SortOrder::s_null){throw  _t("排序不能為空！");}}//-------------------------------------------------------------------------------重寫/// <summary>/// 快速添加字符串，差不多用了8個小時(兩天），才寫成。/// </summary>/// <param name="s"></param>/// <returns></returns>bool Add(const T& item) override{if (this->_Count < 3){bool bInsert = false;_DListNode<T>* ld = this->_First;while (ld != null){if (this->_so == _SortOrder::s_Maxmin){if (item >= ld->Data){_StrList<T>::InserNodeFront(ld, item); bInsert = true;break;}}else{if (item <= ld->Data){_StrList<T>::InserNodeFront(ld, item); bInsert = true; break;}}ld = ld->Next;}if (!bInsert) _StrList<T>::Add(item);return true;}int nPos = this->_Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = this->_Count - 1;  //右邊遠素if (this->_so == _SortOrder::s_Maxmin){_DListNode<T>* ld = null;while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);if (item >= ld->Data){if (nRight == nLeft || nPos == nLeft){this->InserNodeFront(ld, item);return true;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){this->InserNodeBack(ld, item);return true;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{_DListNode<T>* ld = null;while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);if (item <= ld->Data){if (nRight == nLeft || nPos == nLeft){this->InserNodeFront(ld, item);return true;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){this->InserNodeBack(ld, item);return true;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return true;}/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>bool Contains(const T& item) override{if (this->_Count == 0) return false;if (this->_Count == 1) return this->_First->Data == item;if (this->_Count == 2) return this->_First->Data == item || this->_First->Next->Data == item;int nPos = (int)this->_Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)this->_Count - 1;  //右邊遠素_DListNode<T>* ld = null;if (this->_so == _SortOrder::s_Maxmin){while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);int iCom = item.CompareTo(ld->Data);if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);int iCom = item.CompareTo(ld->Data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return false;}};/// <summary>
/// 值都是唯一的字符串列表,且已排好序，區分大小寫
/// </summary>
template<class T>
class _SUStrList : public  _SStrList<T>
{
public:bool Add(const T& item)override{if (this->Contains(item))return false;return _SStrList<T>::Add(item);}_SUStrList(_SortOrder so = _SortOrder::s_Minmax) : _SStrList<T>(so){}};/// <summary>
/// UStringListCI_值都是唯一,且已排序的字符串列表，不區分大小寫
/// </summary>
template<class T>
class _SUStrListUI : public _SUStrList<T>
{
public:_SUStrListUI(_SortOrder  st) : _SUStrList<T>(st){}/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>bool Contains(const T& item) override{if (this->_Count == 0) return false;if (this->_Count == 1) return this->_First->Data.ToLower().CompareTo(item.ToLower()) == 0;if (this->_Count == 2) return this->_First->Data.ToLower().CompareTo(item.ToLower()) == 0 || this->_First->Next->Data.ToLower().CompareTo(item.ToLower()) == 0;int nPos = (int)this->_Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)this->_Count - 1;  //右邊遠素_DListNode<T>* ld = null;if (this->_so == _SortOrder::s_Maxmin){while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);int iCom = item.ToLower().CompareTo(ld->Data.ToLower());if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{while (nRight >= 0 && nLeft >= 0){ld = this->IndexOfNode(nPos);int iCom = item.ToLower().CompareTo(ld->Data.ToLower());if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return false;}
};_LF_END_
#endif

2.?C#版

/*****************************************************************************創建時間          :  2006年12月19日文件名            ： List_.cs作者              ： 李鋒Email            :   ruizhilf@139.com聯系電話          :  13828778863,25722732－－－－－－－－－－－－－－－－－－－－－－最后一次修改時間：2022年10月10日*******************************************************************************/
using System;
using System.Collections.Generic;
using System.Collections;
using System.Text.RegularExpressions;
using System.IO;
using System.Diagnostics;namespace lf
{#region DListNote_(雙向鏈表的節點)/// <summary>/// 雙向鏈表的節點/// </summary>/// <typeparam name="T"></typeparam>public class DListNote_<T>{/// <summary>/// 節點數據/// </summary>public T Data;/// <summary>/// 前一個節點/// </summary>public DListNote_<T> Prev;/// <summary>/// 下一個節點/// </summary>public DListNote_<T> Next;public DListNote_(T aData){Data = aData;            Prev = null;Next = null;}}#endregion#region  Sortord_( 排序方式)/// <summary>/// 排序順序/// </summary>public enum Sortord_{  s_min_max,   //從小到大   s_max_min,   //從大到小s_null       //無排序順序}#endregion#region //====================================================== DList_(雙向鏈表)/// <summary>/// 雙向鏈表/// </summary>/// <typeparam name="T"></typeparam>public class DList_<T> : IEnumerable{protected DListNote_<T> _First;			        //第一個節點protected DListNote_<T> _Last;			        //最后一個節點protected int  _Count;			                //節點個數     protected Sortord_ _sortord;                    //排序順序//------------------------------------------------------------------------------------------屬性/// <summary>/// 實際包含的元素數/// </summary>public int Count {get{return _Count;}}        /// <summary>/// 獲取或設置指定索引處的元素/// </summary>/// <param name="index">要獲得或設置的元素從零開始的索引</param>/// <returns>指定索引處的元素</returns>public virtual T this[int index]{get{return IndexOfNote(index).Data;         }set{IndexOfNote(index).Data = value;            }}//---------------------------------------------------------------------------------構造與析構//---------------------------------------------------------------------------------運算符重載/// <summary>/// /// </summary>/// <param name="dLeft"></param>/// <param name="dlRight"></param>/// <returns></returns>/// 創建時間： 2021-11-07      最后一次修改時間：2021-11-07public static DList_<T> operator +(DList_<T> dLeft, DList_<T> dlRight){/*DList_<T> dlResult = new DList_<T> ();dlResult.Add(dLeft);dlResult.Add(dlRight);return dlResult;*/return new DList_<T> { dLeft, dlRight };}//---------------------------------------------------------------------------------功能函數/// <summary>/// 將指定集合的元素添加到末尾/// </summary>/// <param name="item">要添加到的末尾處的對象。對于引用類型，該值可以為 null</param>/// <returns>如成功，返回真，否則返回假</returns>public virtual void Add(T item){ if (_Count == 0){_First = new DListNote_<T>(item);_First.Next = null;_First.Prev = null;_Last = _First;}else{DListNote_<T> pNew = new DListNote_<T>(item);pNew.Next = null;pNew.Prev = _Last;_Last.Next = pNew;_Last = pNew;}++_Count;_sortord = Sortord_.s_null;   //要重新排序}/// <summary>/// /// </summary>/// <param name="nIndex"></param>/// <param name="item"></param>/// <returns></returns>/// 創建時間： 2022-08-11      最后一次修改時間：2022-08-12public virtual void Insert(int nIndex, T item){if ((uint)nIndex > (uint)_Count){throw new Exception("DList_.Insert 插入位置錯誤！");}if (nIndex == 0){                if(_First != null){                    DListNote_<T> dnNew = new DListNote_<T>(item);_First.Prev = dnNew;dnNew.Next = _First;_First = dnNew;                     ++_Count;_sortord = Sortord_.s_null;}else{Add(item);}}else if(nIndex == _Count){Add(item);}else{DListNote_<T> dnNew = new DListNote_<T>(item);DListNote_<T> dnNext = IndexOfNote(nIndex);DListNote_<T> dnPrev = dnNext.Prev;dnNew.Next = dnNext;dnNew.Prev = dnPrev;dnNext.Prev = dnNew;dnPrev.Next = dnNew;  ++_Count;_sortord = Sortord_.s_null;}                       }public void  Add(DList_<T> dList){if (dList == null){throw new System.Exception("DList_<T>.Add中參數dList==null");}DListNote_<T> ld = dList._First;while (ld != null){Add(ld.Data);ld =  ld.Next;} }public override string ToString(){string sResult = "";DListNote_<T> dnNote = _First;while (dnNote != null){sResult += dnNote.Data.ToString();sResult += "\n";dnNote = dnNote.Next;}return sResult;}public string ToString(string sSplit){string sResult = "";DListNote_<T> dnNote = _First;while (dnNote != null){sResult += dnNote.Data.ToString();if(dnNote != Last)sResult += sSplit;dnNote = dnNote.Next;}return sResult;}/// <summary>/// 使用指定的比較器在整個已排序的 中搜索元素，并返回該元素從零開始的索引/// </summary>/// <param name="item">要定位的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果找到 item，則為已排序的  的從零開始的索引；否則為-1; </returns>public  int BinarySearch(T item){          switch (_sortord){case Sortord_.s_max_min:{if (Count == 0){return -1;}if (Count == 1){return (_First.Data as IComparable).CompareTo(item) == 0 ? 0 : -1;          }if (Count == 2){if( (_First.Data as IComparable).CompareTo(item) == 0) return 0;if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return 1;return -1;}int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<T> ld;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = (item as IComparable).CompareTo(ld.Data);                            if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;} case Sortord_.s_min_max:{   if (Count == 0){return -1;}if (Count == 1){return (_First.Data as IComparable).CompareTo(item) == 0 ? 0 : -1;           }if (Count == 2){if ((_First.Data as IComparable).CompareTo(item) == 0) return 0;if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return 1;return -1;}int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ ld = IndexOfNote(nPos);int iCom = (item as IComparable).CompareTo(ld.Data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case Sortord_.s_null:{DListNote_<T> pNote = _First;int iCount = 0;while (pNote != null){ if (pNote.Data.Equals(item)){return iCount;}pNote = pNote.Next;++iCount;}break;}default:{return -1;}}return -1;}/*** 功能：清空所有元素的所有數據，并清空鏈表* 創建時間：????/??/??* 最后一次修改時間：2022-07-02*/public void Clear(){_Count = 0;DListNote_<T> pTemp1 = _First;while (pTemp1 != null){DListNote_<T> pTemp2 = pTemp1.Next;pTemp1.Data = default(T);pTemp1.Next = null;pTemp1.Prev = null;pTemp1 = pTemp2;}_First = null;_Last = null;}/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>public virtual bool Contains(T item){   return BinarySearch(item) != -1;             }/// <summary>/// 復制一個鏈表，清除原來鏈表的數據/// </summary>/// <param name="ld"></param>public void CopyFrom(DList_<T> ld){         if (!this.Equals(ld)){Clear();DListNote_<T> ldItem = ld._First;while (ldItem != null){Add(ldItem.Data);ldItem = ldItem.Next;}}}/*public int IndexOf(T item){return -1;}public int IndexOf(T item, int index){return -1;}public void Insert(int index, T item){}public int LastIndexOf(T item){return -1;}public int LastIndexOf(T item, int index, int Count){return -1;}*//// <summary>/// 移除指定索引處的元素/// </summary>/// <param name="iIndex">要移除的元素的從零開始的索引。</param>/// <returns>成功返回true,否則返回false</returns>public bool RemoveAt(int iIndex){                   if (iIndex < 0 || iIndex + 1 > _Count) { return false; }DListNote_<T> pNode = _First;int iCount = 0;while (pNode != null){if (iCount == iIndex){if (pNode == _First){                        if (_First.Next == null)   //只有一個{      Clear();return true; }         else   {_First = _First.Next;_First.Prev = null;--_Count;                     return true;}}else if (pNode == _Last){if (_Last.Prev == null){Clear();return true;}else{                            _Last = _Last.Prev;_Last.Next = null;                     --_Count;return true;}}else{pNode.Prev.Next = pNode.Next;pNode.Next.Prev = pNode.Prev;pNode = null;--_Count;return true;}}pNode = pNode.Next;++iCount;}return false;}/// <summary>///  反向排列鏈表/// </summary>/// 創建時間： 2022-04-20      最后一次修改時間：2022-04-20public virtual void Reverse(){DListNote_<T> dnTemp = First;while(dnTemp != null){LMath.Swap(ref dnTemp.Next, ref dnTemp.Prev);dnTemp = dnTemp.Prev;}LMath.Swap(ref _First, ref _Last);            }/// <summary>/// 添加一個元素，并把它放在首位，其它元素后移,如棵后面的元素刪除，總無素個數不變，如果無素個數為零，則添加一個無素。/// </summary>/// <param name="Item"></param>/// <param name="bRemoveLast"></param>/// 創建時間： 2022-04-19      最后一次修改時間：2022-04-19public void StackPush(T Item, bool bRemoveLast = false){if (_Count == 0){Add(Item);}else if (_Count == 1){if (bRemoveLast){_First.Data = Item;}else{//把無素放在最前DListNote_<T> dnNew = new DListNote_<T>(Item);_First.Prev = dnNew;dnNew.Next = _First;_First = dnNew;++_Count;}}else{if (bRemoveLast){//刪除最后一個元素_Last = _Last.Prev;_Last.Next = null;//把無素放在最前DListNote_<T> dnNew = new DListNote_<T>(Item);_First.Prev = dnNew;dnNew.Next = _First;dnNew.Prev = null;_First = dnNew;}else {//把無素放在最前DListNote_<T> dnNew = new DListNote_<T>(Item);_First.Prev = dnNew;dnNew.Next = _First;dnNew.Prev = null;_First = dnNew;++_Count;}                 }   }/// <summary>/// 刪除第一個元素，出棧/// </summary>/// 創建時間： 2022-04-19      最后一次修改時間：2022-04-19public void StackPop(){ RemoveAt(0); }/// <summary>/// 轉換成數組/// </summary>/// <returns></returns>public T[] ToArray(){T[]  aResult = new T[Count];int n = 0;DListNote_<T> pNoteTemp = _First;while (pNoteTemp != null){aResult[n++] = pNoteTemp.Data;pNoteTemp = pNoteTemp.Next;}return aResult;}/// <summary>/// 交換兩個節點的數據/// </summary>/// <param name="nIndex1"></param>/// <param name="nIndex2"></param>/// <returns></returns>protected virtual bool swapNoteData(int iIndex1, int iIndex2){ DListNote_<T> pNote1, pNote2;pNote1 = IndexOfNote(iIndex1);pNote2 = IndexOfNote(iIndex2);if (!(pNote1 != null && pNote2 != null)){return false;}T ptmp = pNote1.Data;pNote1.Data = pNote2.Data;pNote2.Data = ptmp;return true;}/// <summary>/// 選擇排序可以說是最簡單的一種排序方法：/// 1.找到數組中最小的那個元素/// 2.將最小的這個元素和數組中第一個元素交換位置/// 3.在剩下的元素中找到最小的的元素，與數組第二個元素交換位置/// 重復以上步驟，即可以得到有序數組。/// </summary>public virtual void sort_selection(Sortord_ sortord){if (_Count == 0 || _Count == 1) return;//is關鍵字用于檢查對象是否與給定類型兼容。注意了，這里is并不是“是”的意思，而是“兼容”。if (!(_First.Data is IComparable)) // 判斷是否具有IComparable接口，以確定是否存在CompareTo()方法{throw new Exception("沒有IComparable接口");}           DListNote_<T> min = _First, tmp = _First.Next;if (sortord == Sortord_.s_min_max){while (min.Next != null){while (tmp != null){if ((tmp.Data as IComparable).CompareTo(min.Data) < 0)  //交換位置{T pt = tmp.Data;       tmp.Data = min.Data;min.Data = pt;}tmp = tmp.Next;}min = min.Next;tmp = min.Next;}}else{while (min.Next != null){while (tmp != null){if ((tmp.Data as IComparable).CompareTo(min.Data) > 0){T pt = tmp.Data;tmp.Data = min.Data;min.Data = pt;}tmp = tmp.Next;}min = min.Next;tmp = min.Next;}}_sortord = sortord;  //已排序}/// <summary>/// 返回索引的節點,從零開始/// </summary>/// <param name="nPos"></param>/// <returns></returns>public virtual DListNote_<T> IndexOfNote(int iPos){          if (iPos >= _Count || iPos < 0) throw new System.Exception("DListNote_<T>.IndexOfNote  錯誤索引: " + iPos.ToString() + "！");uint nindex = 0;if (iPos > _Count / 2){DListNote_<T> pNote = _Last;while (pNote != null){if (nindex++ == _Count - iPos - 1){ return pNote;}pNote = pNote.Prev;}}else{DListNote_<T> pNote = _First;while (pNote != null){if (nindex++ == iPos){             return pNote;}pNote = pNote.Next;}}return null;}/// <summary>/// 在結點pListItem前面插入一個結點,成功，返回新的結點，否則返回０/// </summary>/// <param name="pListItem"></param>/// <param name="pData"></param>/// <returns></returns>protected virtual DListNote_<T> InserNoteFront(DListNote_<T> pListItem, T pData){if (pListItem == null){throw new System.Exception("函數提示：pListItem = null");}DListNote_<T> pNote = new DListNote_<T>(pData);//pNote            pNote.Next = pListItem;pNote.Prev = pListItem.Prev;//--pListItem->Previf (pListItem.Prev != null){pListItem.Prev.Next = pNote;}else{_First = pNote;}//pListItempListItem.Prev = pNote;++_Count;return pNote;}/// <summary>/// 在結點pListItem后面插入一個結點,成功，返回新的結點，否則返回０；/// </summary>/// <param name="pListItem"></param>/// <param name="pData"></param>/// <returns></returns>protected virtual DListNote_<T> InserNoteBack(DListNote_<T> pListItem, T pData){if (pListItem == null) return null;DListNote_<T> pNote = new DListNote_<T>(pData);//pNotepNote.Prev = pListItem;pNote.Next = pListItem.Next;//pListItem->Nextif (pListItem.Next != null){pListItem.Next.Prev = pNote;}else{_Last = pNote;}//--pListItempListItem.Next = pNote;++_Count;return pNote;}/// <summary>/// 找查一個項，而不是節點，返回的這個節點相當于指針。/// </summary>/// <param name="pData">項值</param>/// <returns></returns>public  DListNote_<T> FindNoteItem(T item){switch (_sortord){case Sortord_.s_max_min:{if (Count == 0){return null;}if (Count == 1){return (_First.Data as IComparable).CompareTo(item) == 0 ? _First : null;}if (Count == 2){if ((_First.Data as IComparable).CompareTo(item) == 0) return _First;if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return _First.Next;return null;}int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = (item as IComparable).CompareTo(ld.Data);if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return ld;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case Sortord_.s_min_max:{if (Count == 0){return null;}if (Count == 1){return (_First.Data as IComparable).CompareTo(item) == 0 ? _First : null;}if (Count == 2){if ((_First.Data as IComparable).CompareTo(item) == 0) return _First;if ((_First.Next.Data as IComparable).CompareTo(item) == 0) return _First.Next;return null;}int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = (item as IComparable).CompareTo(ld.Data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return ld;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case Sortord_.s_null:{DListNote_<T> pNote = _First;                   while (pNote != null){//總結:Equals比較的永遠是變量的內容是否相同，而= =比較的則是引用地址是否相同(前提:此種類型內部沒有對Equals 或= = 進行重寫操作，//否則輸出可能會有不同)。string 類型是個特例，因為他的內部對這兩個都進行了重寫。if ((item as IComparable).CompareTo(pNote.Data) == 0){return pNote;}/*if (pNote.Data.Equals(item)){return pNote;}*/pNote = pNote.Next;                        }break;}default:{return null;}}return null;}/// <summary>/// 把索引為nIndex的節點移到最后/// </summary>/// <param name="nIndex"></param>/// <returns></returns>protected virtual bool MoveLast(int iIndex){DListNote_<T> pNote = IndexOfNote(iIndex);if (pNote != null){if (pNote == _Last)return true;if (pNote == _First) //此時最少兩個節點{_First = _First.Next;_First.Prev = null;_Last.Next = pNote;pNote.Prev = _Last;_Last = pNote;}else{pNote.Prev.Next = pNote.Next;pNote.Next.Prev = pNote.Prev;_Last.Next = pNote;pNote.Prev = _Last;_Last = pNote;}return true;}return false;}/// <summary>/// /// </summary>/// <param name="dnCurrent"></param>/// <returns></returns>/// 創建時間： 2022-02-18      最后一次修改時間：2022-02-18protected virtual bool MoveLast(DListNote_<T> dnCurrent){if (dnCurrent == null) return false;_sortord = Sortord_.s_null;if(_Count == 0){return false;}else if(_Count == 1){return true;}else if(_Count == 2)  {if(dnCurrent == _First)  //交換_First 與 _Last 數據{              T tmp = _First.Data;_First.Data = _Last.Data;_Last.Data = tmp;                     }return true;}else{if (dnCurrent == _First){_First = _First.Next;_First.Prev = null;_Last.Next = dnCurrent;dnCurrent.Next = null;dnCurrent.Prev = _Last;_Last = dnCurrent;}else if (dnCurrent != _Last){dnCurrent.Prev.Next = dnCurrent.Next;dnCurrent.Next.Prev = dnCurrent.Prev;_Last.Next = dnCurrent;dnCurrent.Next = null;dnCurrent.Prev = _Last;_Last = dnCurrent;}return true;}}/// <summary>/// 把索引為nIndex的節點移到最前/// </summary>/// <param name="nIndex"></param>/// <returns></returns>protected virtual bool MoveFirst(int iIndex){DListNote_<T> pNote = IndexOfNote(iIndex);if (pNote != null){if (pNote == _First)return true;if (pNote == _Last)  //此時最少兩個節點{_Last.Prev.Next = null;_Last = _Last.Prev;pNote.Prev = null;pNote.Next = _First;_First.Prev = pNote;_First = pNote;}else{pNote.Prev.Next = pNote.Next;pNote.Next.Prev = pNote.Prev;pNote.Next = _First;_First.Prev = pNote;pNote.Prev = null;_First = pNote;}return true;}return false;}/// <summary>/// 返回第一個節點/// </summary>public  DListNote_<T> First{get{          return _First; }}  /// <summary>/// 返回最后一個節點/// </summary>public  DListNote_<T> Last{get {  return _Last;   }}//--------------------------------------------------------------------------------------/// <summary>/// 構造函數/// </summary>public DList_(){_Count = 0; _First = null; _Last = null;  _sortord = Sortord_.s_null;}/// <summary>/// 刪除鏈表中的數據/// </summary>/// <param name="pData"></param>/// <returns></returns>public bool RemoveItem(T pData){if (_sortord == Sortord_.s_null){DListNote_<T> pListItem = _First;while (pListItem != null){if (pListItem.Data.Equals(pData))	//找到一項{if (pListItem == _First)		//刪除的是第一個節點{if (_First.Next != null){_First.Next.Prev = null;_First = _First.Next;}else{_First = null;_Last = null;}}else if (pListItem == _Last)  //刪除的是最后一個節點{if (_Last.Prev != null){_Last.Prev.Next = null;_Last = _Last.Prev;}else{_First = null;_Last = null;}}else						//刪除的是中間的一個節點{pListItem.Next.Prev = pListItem.Prev;pListItem.Prev.Next = pListItem.Next;}--_Count;return true;}pListItem = pListItem.Next;}return false;}else{return RemoveAt(BinarySearch(pData));}}/// <summary>/// 刪除鏈表中的節點/// </summary>/// <param name="pListItem"></param>/// <returns></returns>public bool DeleteNode(DListNote_<T> pListItem){if (_Count == 0 || pListItem == null){return false;}DListNote_<T> pNote = _First.Next;while (pNote != null){if (pNote == pListItem)  //找到了{//pListItem->Previf (pListItem.Prev != null){pListItem.Prev.Next = pListItem.Next;}else //刪除的是第一個節點{_First = pListItem.Next;}//pListItem->Nextif (pListItem.Next != null){pListItem.Next.Prev = pListItem.Prev;}else //刪除的是最后一個節點{_Last = pListItem.Prev;}break;}pNote = pNote.Next;}if (pNote != null){--_Count;return true;}return false;}/// <summary>/// 刪除最后一個節點/// </summary>/// 創建時間：2020-09-12  最后一次修改時間： 2020-09-12public bool DeleteLast(){if (_Count <= 0){return false;}else if (_Count == 1){_First = null;_Last = null;_Count = 0;return true;}else if(_Count == 2){_Last = _First;_Last.Prev = null;_Last.Next = null;_First.Next = null;_First.Prev = null;--_Count;}else{_Last.Prev.Next = null;_Last = _Last.Prev;--_Count;}return true; ;             }//--------------------------------------------------------------------------接口/// <summary>//示例為了使一個類支持集合初始化器，它必須實現IEnumerable接口并至少具有一個Add方法。從C＃6開始，//IEnumerable可以Add使用擴展方法使用自定義方法擴展任何實現的集合。/// </summary>/// 創建時間：2020-05-07  最后一次修改時間： 2020-05-07/// <returns></returns>public IEnumerator GetEnumerator(){ return new DListNoteEnum_<T>(_First);}   }/// <summary>/// 節點數據的foreach迭代/// </summary>/// 創建時間：2020-05-07  最后一次修改時間： 2022-10-10/// <typeparam name="T"></typeparam>public class DListNoteEnum_<T> : IEnumerator{private DListNote_<T> _dn;private DListNote_<T> _dnCurr;private int _iIndex;public DListNoteEnum_(DListNote_<T> dn){_dn = dn;_iIndex = -1;}/// <summary>/// IEnumerator最終調用的是這個函數訪問/// </summary>public Object Current {  get{  return _dnCurr.Data; }  }public virtual bool MoveNext(){++_iIndex; //指針首先向前移動一位if (_dnCurr == null){_dnCurr = _dn;}else{_dnCurr = _dnCurr.Next;}return _dnCurr != null;}public virtual void Reset(){_dnCurr = null;_iIndex = -1;}};#endregion#region//====================================================== SortList_ 已排序的鏈表
/// <summary>
/// 已排序的鏈表
/// </summary>
/// <typeparam name="T"></typeparam>
public class SortList_<T> : DList_<T>{public SortList_(Sortord_ sortord){_sortord = sortord;}//-------------------------------------------------------------------------------重寫/// <summary>/// 添加一項到結尾處，item不能為NULL./// </summary>/// <param name="item">項</param>/// 創建時間： ????-??-??      最后一次修改時間：2021-11-07public override void Add(T item){   if (item == null){throw new System.Exception("SortList_.Add 方法提示：類型值不能為null！");}if ( !(item is IComparable) ) // 判斷是否具有IComparable接口，以確定是否存在CompareTo()方法{throw new System.Exception("SortList_<" + item.GetType().Name + ">.Add 方法提示：類型“" + item.GetType().Name + "”沒有IComparable接口！");}if (Count < 3){bool bInsett = false; DListNote_<T> ldNote = First;while (ldNote != null){if (_sortord == Sortord_.s_max_min){if ((item as IComparable).CompareTo(ldNote.Data) >= 0){base.InserNoteFront(ldNote, item); bInsett = true; break;}}else{if ((item as IComparable).CompareTo(ldNote.Data) <= 0){base.InserNoteFront(ldNote, item); bInsett = true; break;}}ldNote = ldNote.Next;}if (!bInsett) base.Add(item);return;}int nPos = Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = Count - 1;  //右邊遠素if (_sortord == Sortord_.s_max_min){DListNote_<T> ldNote = null;while (nRight >= 0 && nLeft >= 0){ldNote = IndexOfNote(nPos);if ((item as IComparable).CompareTo(ldNote.Data) >= 0){if (nRight == nLeft || nPos == nLeft){InserNoteFront(ldNote, item);return;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){InserNoteBack(ldNote, item); return;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);if ((item as IComparable).CompareTo(ld.Data) <= 0){if (nRight == nLeft || nPos == nLeft){InserNoteFront(ld, item); return;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){InserNoteBack(ld, item);return;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return;}}#endregion#region//================================================= UniqueList_ 每個項的值都是唯一的鏈表/// <summary>/// 每個項的值都是唯一的鏈表 /// </summary>/// <typeparam name="T"></typeparam>public class UniqueList_<T> : DList_<T>{public override void Add(T item){         if (BinarySearch(item) == -1){base.Add(item);}}}#endregion#region //========================== =========SUList_,已排序，且每一項的值都是唯一的鏈表/// <summary>/// SUList_,已排序，且每一項的值都是唯一的鏈表/// </summary>/// <typeparam name="T"></typeparam>public class SUList_<T> : SortList_<T>{/// <summary>/// 將指定集合的元素添加到末尾/// </summary>/// <param name="item">要添加到的末尾處的對象。對于引用類型，該值可以為 null</param>/// <returns>如成功，返回真，否則返回假</returns>public override void Add(T item){           if (BinarySearch(item) == -1){base.Add(item);}    }public SUList_(Sortord_ sortord): base(sortord){}}#endregion#region //================================＝＝=======StringList_字符串列表/// <summary>/// 字符串列表/// </summary>public class StringList_ : DList_<string>{/// <summary>/// 默認構函數/// </summary>public StringList_()   {}/// <summary>/// 以分隔符構造一個字符串列表/// </summary>/// <param name="sText">原文字符串</param>/// <param name="sSplit">分隔符</param>/// <param name="bIgnoreEmptyString">返回列表，空字符串不忽略，如果沒有分隔符，則回原字符</param>/// 創建時間： ????-??-??     最后一修改時間：2020-09-03public StringList_(string sText, string sSplit, bool bIgnoreEmptyString = false){if(sText == null || sText.Length == 0){ return; }if(sSplit.Length == 0)  {  Add(sText);   return;  }int nPos = sText.IndexOf(sSplit);int nFindStart = 0;while(nPos != -1){if (nPos - nFindStart == 0){if (!bIgnoreEmptyString){Add("");}               }else{Add(sText.Substring(nFindStart, nPos - nFindStart));}nFindStart = nPos + sSplit.Length;nPos = sText.IndexOf(sSplit, nFindStart);if(nPos == -1)  //拷貝最后一個{if(nFindStart < sText.Length){Add(sText.Substring(nFindStart, sText.Length - nFindStart));}else{if (!bIgnoreEmptyString){Add("");}}}}}#if !WINDOWS_UWP/// <summary>/// 把列表寫入文件/// </summary>/// <param name="sFileName">文件名</param>public void WriteToFile(string sFileName){System.IO.File.Delete(sFileName);DListNote_<string> dl = First;FileStream fs = File.Create(sFileName);     while (dl != null){byte[] bArray = System.Text.Encoding.Default.GetBytes(dl.Data);fs.Write(bArray, 0, bArray.Length);bArray =   System.Text.Encoding.Default.GetBytes("\r\n");//fs.WriteByte((byte)'\r');  不行，UNICODE代碼//fs.WriteByte((byte)'\n');fs.Write(bArray, 0, bArray.Length);dl = dl.Next;}fs.Close();}/// <summary>/// 從文件中讀取列表分隔符為"\r\n";/// </summary>/// <param name="sFileName">文件名</param>/// <returns></returns>public bool ReadToFile(string sFileName){if (File.Exists(sFileName)){FileStream fs = new FileStream(sFileName, FileMode.Open, FileAccess.Read);Byte[] bArray = new Byte[fs.Length];fs.Read(bArray, 0, bArray.Length);fs.Close();CopyFrom(System.Text.Encoding.Default.GetString(bArray)._Split("\r\n"));return true;}return false;}/// <summary>/// 從文件中讀取列表分隔符/// </summary>/// <param name="sFileName"></param>/// <param name="sSplit"></param>/// <returns></returns>public bool readToUnicodeFile(string sFileName,string sSplit){if (File.Exists(sFileName)){FileStream fs = new FileStream(sFileName, FileMode.Open, FileAccess.Read);Byte[] bArray = new Byte[fs.Length];fs.Read(bArray, 0, bArray.Length);fs.Close();CopyFrom(System.Text.Encoding.Unicode.GetString(bArray)._Split(sSplit));return true;}return false;}public void SaveToUnicodeFile(string sFileName, string sSplit){/*if(_Count > 0){ string sContent = "";int n = 1;foreach(string s in this){sContent += s;if(n != _Count)sContent += sSplit;  }Byte[] bArray = System.Text.ASCIIEncoding.ASCII.GetBytes(sContent);FileStream fs = new FileStream(sFileName, FileMode.Create, FileAccess.Write);fs.Write(bArray, 0, bArray.Length);fs.Close();}*/}/// <summary>/// 把所有字符串寫入磁盤，但每個字符串中的空格和不可打印字符都不會寫入，每15個字符串加入一個換行符。/// </summary>/// <param name="sFileName"></param>/// <param name="sSplit"></param>/// 創建時間： 2022-02-09      最后一次修改時間：2022-02-09 public void WriteToTxtFile(string sFileName, string sSplit){ if (_Count > 0){string sContent = "";int n = 1;foreach (string s in this){                   sContent += s._RemoveUnprintableAndWhitespace();if (n != _Count)sContent += sSplit;if(n % 15 == 0)sContent += "\n";   ++n;}File.WriteAllText(sFileName,sContent);}}/// <summary>/// 用分隔 符讀取文本文件，空格和不可打印字符都不讀取。/// </summary>/// <param name="sFileName"></param>/// <param name="sSplit"></param>/// 創建時間： 2022-02-09      最后一次修改時間：2022-02-18 public void ReadFromTxtFile(string sFileName, string sSplit){if (!File.Exists(sFileName))return;string sContent = File.ReadAllText(sFileName)._RemoveUnprintableAndWhitespace();if(sContent.Trim().Length > 0){CopyFrom(sContent._Split(sSplit));  } }
#endif/// <summary>/// 用分隔符把每個項連成一片，如果分隔符為空，則直接連成一片/// </summary>/// <param name="sSeparator">分隔符</param>/// <returns></returns>public string ConnectForSeparator(string  sSeparator){if (Count == 0) return "";if (Count == 1) return First.Data;string tmp = "";DListNote_<string> ldNote = First;while (ldNote != Last){tmp += ldNote.Data;tmp += sSeparator;ldNote = ldNote.Next;}tmp += Last.Data;       //加入最后一項return tmp;}/// <summary>/// 用分隔符把每個項連成一片，如果分隔符為空，則直接連成一片/// </summary>/// <param name="cSeparator">分隔符</param>/// <returns></returns>public string ConnectForSeparator(char cSeparator){return ConnectForSeparator(cSeparator.ToString());}/// <summary>/// 清空列表，用分隔符把字符串分裂成多項,返回項數/// </summary>/// <param name="sText"></param>/// <param name="sSplit"></param>/// <returns></returns>public int splitForSeparator(string sText, char cSplit){Clear();string[] sl = sText.Split(cSplit);for (int i = 0; i < sl.Length; ++i){Add(sl[i]);}return Count;}/// <summary>/// 查找第一個可印的字符串，如果找到則返回它的值，沒找到返回空字符中。/// </summary>/// <returns></returns>/// 創建時間： 2022-01-21      最后一次修改時間：2022-01-21public string FindFirstPrintableStringValue(){DListNote_<string> pNote = _First;while (pNote != null){if(pNote.Data._IsHavePrintableChar()){return pNote.Data;}pNote = pNote.Next;}return "";}/// <summary>/// 查找第一個可印的字符串的索引，如果找到則返回它的索引，沒找到返回-1。/// </summary>/// <returns></returns>/// 創建時間： 2022-01-21      最后一次修改時間：2022-01-21public int FindFirstPrintableStringIndex(){DListNote_<string> pNote = _First;int nResult = 0;while (pNote != null){if (pNote.Data._IsHavePrintableChar()){return nResult;}pNote = pNote.Next;++nResult;}return -1;}/// <summary>/// /// </summary>/// <param name="ls"></param>/// <returns></returns>/// 創建時間： ????-??-??      最后一次修改時間：2021-10-10public virtual bool Add(StringList_ ls){DListNote_<string> pNote = ls._First;while (pNote != null){Add(pNote.Data);pNote = pNote.Next;}return true;     }/// <summary>/// 是開頭插入一個字符串/// </summary>/// <param name="sItem"></param>/// <returns></returns>/// 創建時間： 2022-01-18      最后一次修改時間：2022-01-18public virtual bool InserFront(string sItem){if(_Count == 0)Add(sItem);InserNoteFront(_First,sItem);return true;}/// <summary>/// 查找字符呂 S /// </summary>/// <param name="s"></param>/// <returns></returns>/// <exception cref="Exception"></exception>/// 創建時間： ????-??-??      最后一次修改時間：2022-09-18public int IndexOf(string s){//if(s.Length == 0){ throw new Exception("字符串不能為空！");}    DListNote_<string> pNote = _First;int iIndex = 0;while (pNote != null){if (pNote.Data == s){return iIndex;}pNote = pNote.Next;++iIndex;}return - 1;}}#endregion#region //================================＝＝=======LSStringList已排序好的字符串列表/// <summary>/// 已排序好的字符串列表/// </summary>public class SStringList_ : StringList_{public SStringList_(Sortord_ sortord){if (sortord == Sortord_.s_null){throw  new System.Exception("排序不能為空！");}_sortord = sortord;}//-------------------------------------------------------------------------------重寫/// <summary>/// 快速添加字符串，差不多用了8個小時(兩天），才寫成。/// </summary>/// <param name="s"></param>/// <returns></returns>public override void Add(string item){ if (Count < 3){bool bInsett = false;      DListNote_<string> ld = First;while (ld != null){if (_sortord == Sortord_.s_max_min){if (item.CompareTo(ld.Data) >= 0){base.InserNoteFront(ld, item); bInsett = true; break;}}else{if (item.CompareTo(ld.Data) <= 0){base.InserNoteFront(ld, item); bInsett = true; break;}}ld = ld.Next;               }if (!bInsett) base.Add(item);return;}int nPos = Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = Count - 1;  //右邊遠素if (_sortord == Sortord_.s_max_min){DListNote_<string> ld = null;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);if (item.CompareTo(ld.Data) >= 0){if (nRight == nLeft || nPos == nLeft){InserNoteFront(ld, item); return;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){InserNoteBack(ld, item);return;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{DListNote_<string> ld = null;while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);if (item.CompareTo(ld.Data) <= 0){if (nRight == nLeft || nPos == nLeft){InserNoteFront(ld, item);return;}nRight = nPos - 1;}else{if (nRight == nLeft || nPos == nRight){InserNoteBack(ld, item); return;}nLeft = nPos + 1;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return;}/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>public override bool Contains(string item){if (Count == 0) return false;if (Count == 1) return First.Data.CompareTo(item) == 0;if (Count == 2) return First.Data.CompareTo(item) == 0 || First.Next.Data.CompareTo(item) == 0;int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<string> ld = null;if (_sortord == Sortord_.s_max_min){while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = item.CompareTo(ld.Data);if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = item.CompareTo(ld.Data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return false;}}
#endregion#region //================================＝＝=======UStringList_值都是唯一的字符串列表，區分大小寫/// <summary>/// 值都是唯一的字符串列表/// </summary>/// <typeparam name="T"></typeparam>public class UStringList_ : StringList_{public override void Add(string item){if(BinarySearch(item) == -1)base.Add(item);}public void Add(string[] sArray){for (int i = 0; i < sArray.Length; ++i){Add(sArray[i]);}}public override bool Add(StringList_ ls){    bool bResult = true;DListNote_<string> pFirst = ls.First;while (pFirst != null){if (BinarySearch(pFirst.Data) == -1){base.Add(pFirst.Data);}else{bResult = false;}pFirst = pFirst.Next;}return bResult;}}
#endregion#region//======================================SUStringList_ 值都是唯一的字符串列表,且已排好序，區分大小寫/// <summary>/// 值都是唯一的字符串列表,且已排好序，區分大小寫/// </summary>public class SUStringList_ : SStringList_{ public override void Add(string item){if (Contains(item)) return;base.Add(item); }public SUStringList_(Sortord_ sortord): base(sortord){}}#endregion#region //================================＝＝=======UStringListCI_值都是唯一的字符串列表，不區分大小寫/// <summary>/// 值都是唯一的字符串列表，  Case Insensitive(不區分大小寫)/// </summary>public class UStringListCI_ : StringList_{/// <summary>/// 加入一個串，如果這個串存在，則把這項移到最后。/// </summary>/// <param name="item"></param>/// 創建時間： ????-??-??      最后一次修改時間：2022-02-18public override void Add(string item){bool bFind = false;DListNote_<string> dnTemp = First;while(dnTemp != null){if(dnTemp.Data.ToLower() == item.ToLower()){MoveLast(dnTemp);bFind = true;break;}dnTemp = dnTemp.Next;}if (!bFind)base.Add(item);}/// <summary>/// 返回前面一個值/// </summary>/// <param name="tCurrValue"></param>/// <returns></returns>public string GetForward(string sCurr){int iIndex = BinarySearch(sCurr);if (iIndex != -1){if (iIndex + 1 < Count)return this[iIndex + 1];}return null;}/// <summary>/// 返回后面的一個值/// </summary>/// <param name="sCurr"></param>/// <returns></returns>public string GetBack(string sCurr){int iIndex = BinarySearch(sCurr);if (iIndex != -1){if (iIndex - 1 < Count && iIndex - 1 >= 0)return this[iIndex - 1];}return null;}}
#endregion#region //================================＝＝=======UStringListCI_值都是唯一,且已排序的字符串列表，不區分大小寫/// <summary>/// UStringListCI_值都是唯一,且已排序的字符串列表，不區分大小寫/// </summary>public class SUStringListUI_ : SUStringList_{public  SUStringListUI_(Sortord_ sortord): base(sortord) {}/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>public override bool Contains(string item){if (Count == 0) return false;if (Count == 1) return First.Data.ToLower().CompareTo(item.ToLower()) == 0;if (Count == 2) return First.Data.ToLower().CompareTo(item.ToLower()) == 0 || First.Next.Data.ToLower().CompareTo(item.ToLower()) == 0;int nPos = (int)Count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)Count - 1;  //右邊遠素DListNote_<string> ld = null;if (_sortord == Sortord_.s_max_min){while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = item.ToLower().CompareTo(ld.Data.ToLower());if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}else{while (nRight >= 0 && nLeft >= 0){ld = IndexOfNote(nPos);int iCom = item.ToLower().CompareTo(ld.Data.ToLower());if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return false;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return false;}nLeft = nPos + 1;}else{return true;}nPos = nLeft + (nRight - nLeft + 1) / 2;}}return false;}}#endregion/// <summary>/// 歷史記錄，相當于棧/// </summary>/// <typeparam name="T"></typeparam>/// 創建時間：2022-03-06    最后一次修改時間：2022-04-19public class UniqueStack_<T>  {private DList_<T> m_List;private int m_Capacity;public DList_<T> List => m_List;/// <summary>/// 元素容量/// </summary>public int Capacity => m_Capacity;/// <summary>/// 無素個數/// </summary>public int Count => m_List.Count;public UniqueStack_(int nCapacity = 15){if(nCapacity <= 0){lg.ShowError("容量不能小于等于 0 ！");m_Capacity = 15;}else{ m_Capacity = nCapacity;}m_List = new DList_<T>();}/// <summary>/// 添加一項/// </summary>/// <param name="item"></param>/// 創建時間： 2022-04-19      最后一次修改時間：2022-04-19public void Push(T item){ bool bFind = m_List.RemoveItem(item);  //如果找到，則刪除if (!bFind){if (m_List.Count < m_Capacity){m_List.StackPush(item);}else{//插入一個Item，所有元素后移一位m_List.StackPush(item,true);}}else{ //插入一個Item，所有元素后移一位m_List.StackPush(item);                 }            }/// <summary>/// 出棧/// </summary>public void Pop() => List.StackPop();} public class HistoryStringList_ : UniqueStack_<string>{public override string ToString(){string sResult = "";foreach (string s in List){sResult += s + "||";}if (sResult != ""){sResult = sResult.Substring(0, sResult.Length - 2);}return sResult;}public void FromString(string sVaule){List.Clear();StringList_ ls = sVaule._Split("||");DListNote_<string> dnNote = ls.Last;while (dnNote != null){             Push(dnNote.Data);                dnNote = dnNote.Prev;}}public HistoryStringList_(int nCapacity = 15) : base(nCapacity) { }}public class HistoryStringListPair_ : UniqueStack_<Pair_<string, string>>{public override string ToString(){string sResult = "";foreach (Pair_<string, string> pair in List){sResult += pair.First + "," + pair.Second + "||";}if (sResult != ""){sResult = sResult.Substring(0, sResult.Length - 2);}return sResult;}public void FromString(string sVaule){List.Clear();StringList_ ls1 = sVaule._Split("||");DListNote_<string> dnNote = ls1.Last;while (dnNote != null){StringList_ ls2 = dnNote.Data._Split(",");if (ls2.Count == 2){Push(ls2[0], ls2[1]);}dnNote = dnNote.Prev;}}public HistoryStringListPair_(int nCapacity = 15) : base(nCapacity) { }public void Push(string s1, string s2) { base.Push(new Pair_<string, string>(s1, s2)); }public Pair_<string, string> IndexOfFirst(string sFirst){foreach (Pair_<string, string> pair in List){if (pair.First == sFirst)return pair;}return null;}public Pair_<string, string> IndexOfSecond(string sSecond){foreach(Pair_<string, string> pair in List){if(pair.Second == sSecond)return pair;}return null;}}public class LPairList<T1, T2> : IEnumerable{DList_<Pair_<T1, T2>> m_list;public DList_<Pair_<T1, T2>> List { get { return m_list; } }public LPairList(){m_list = new DList_<Pair_<T1, T2>>();}public Pair_<T1, T2> GetIndex(int iIndex){DListNote_<Pair_<T1, T2>> dn = m_list.IndexOfNote(iIndex);if (dn == null)return null;elsereturn dn.Data;}public void RemoveAt(int iIndex){m_list.RemoveAt(iIndex);}public void Clear(){m_list.Clear();}public void Add(T1 First, T2 Second){m_list.Add(new Pair_<T1, T2>(First, Second));}public void Add(Pair_<T1, T2> p){m_list.Add(p);}public void CopyTo(IList il1, IList il2){il1.Clear();il2.Clear();foreach (DListNote_<Pair_<T1, T2>> dn in m_list){il1.Add(dn.Data.First);il2.Add(dn.Data.First);}}public int Count { get { return m_list.Count; } }/// <summary>      /// 創建時間： ????-??-??      最后一次修改時間：2020-05-31/// 查找sFirstStringValue,找不到返回NULL/// </summary>/// <param name="sFirst"></param>/// <returns></returns>public Pair_<T1, T2> IndexFirst(T1 sFirstStringValue){foreach (Pair_<T1, T2> p in m_list){if (p.First.Equals(sFirstStringValue))return p;}return null;}/// <summary>/// 創建時間： ????-??-??      最后一次修改時間：2020-05-31/// 查找sSecondStringValue,找不到返回NULL/// </summary>/// <param name="sFirst"></param>/// <returns></returns>public Pair_<T1, T2> IndexSecond(T2 sSecondStringValue){foreach (Pair_<T1, T2> p in m_list){if (p.Second.Equals(sSecondStringValue))return p;}return null;}/// <summary>/// 創建時間： 2020-05-31      最后一次修改時間：2020-05-31/// 查找第一項，找到返回第二項的值，沒找到返回第二項的默認值。/// </summary>/// <param name="sFirstStringValue"></param>/// <returns></returns>public T2 IndexFirstValue(T1 sFirstStringValue){foreach (Pair_<T1, T2> p in m_list){if (p.First.Equals(sFirstStringValue))return p.Second;}return default(T2);}/// <summary>/// 創建時間： 2020-05-31      最后一次修改時間：2020-05-31/// 查找第三項，找到返回第一項的值，沒找到返回第一項的默認值。/// </summary>/// <param name="sSecondStringValue"></param>/// <returns></returns>public T1 IndexSecondValue(T2 sSecondStringValue){foreach (Pair_<T1, T2> p in m_list){if (p.Second.Equals(sSecondStringValue))return p.First;}return default(T1);}IEnumerator IEnumerable.GetEnumerator(){return m_list.GetEnumerator();}}public class LStringPairList : LPairList<string, string>{/// <summary>/// 依據slFirst查找Second/// </summary>/// <param name="slFirst"></param>/// 創建時間：2020-05-09   最后一次修改時間：2020-05-09  /// <returns></returns>public StringList_ GetSecondList(StringList_ slFirst){StringList_ slResult = new StringList_();foreach (Pair_<string, string> p in this){if (slFirst.FindNoteItem(p.First) != null){slResult.Add(p.Second);}}return slResult;}/// <summary>/// 依據slSecond查找First/// </summary>/// <param name="slSecond"></param>/// 創建時間：2020-05-09   最后一次修改時間：2020-05-09  /// <returns></returns>public StringList_ GetFirstList(StringList_ slSecond){StringList_ slResult = new StringList_();foreach (Pair_<string, string> p in this){if (slSecond.FindNoteItem(p.Second) != null){slResult.Add(p.First);}}return slResult;}}}

3.?Java 版

/***************************************************************************************************創建時間            :   2020年01月12日文件名:             :   LDList.java作者                :   李鋒Email              :   ruizhilf@139.com聯系電話            :   13828778863作用               :   雙向鏈表此文件暫時以 C# 編程風格，因為 C#也有一份代碼，是從C#移植過來的。----------------------------------------------------------------------最后一次修改時間： 2022年07月02日**************************************************************************************************/package JavaPlatform.System;import java.util.ArrayList;
import java.util.Iterator;
import JavaPlatform.jp;class DListNote_<T>
{/*** 節點數據*/public T data;/*** 前一個節點*/public DListNote_<T> prev;/*** 下一個節點*/public DListNote_<T> next;/*** 功能：定位節點指針。** @param nMove 指針移動的個數，0為不變，負數是向上prev方法移動，正數是向下next移動。* @return 返回指向節點的指針  ，移動超出范圍返回值為null。 * 創建時間：2022/07/02 最后一次修改時間：2022/07/02*/public DListNote_<T> pointerTo(int nMove){if ( nMove >= 0){   //向下int n = 0;DListNote_<T> pTemp = this;			//計數while(pTemp != null){	    				if( n ==  nMove) break;				pTemp = pTemp.next;	++ n;  }    					return pTemp;			}else{  //向上int n = 0;DListNote_<T> pTemp = this;			//計數while(pTemp != null){	    				if( n == - nMove ) break;				pTemp = pTemp.prev;	++ n;  }    					return pTemp;	   }   }public DListNote_(T adata) {data = adata;}
}/*** The type D list.** @param <T> the type parameter*/
public class DList_<T extends Comparable<T>> implements Iterable<T>{/*** 排序方式*/public enum Sortord_{s_min_max,   //從小到大s_max_min,   //從大到小s_null       //無排序順序}protected DListNote_<T>  _first;			 //第一個節點protected DListNote_<T>  _last;			    //最后一個節點protected int  _count;			            //節點個數protected Sortord_ _sortord;                //排序順序/*** 適用于 foreach 語句* @return*/public Iterator<T> iterator() {/*return new Iterator() {private int m_cursor = -1;@Overridepublic T next() {++m_cursor;return indexOfNote(m_cursor).data;}@Overridepublic boolean hasNext() {return m_cursor + 1 < _count;}};*/return new DListNoteEnum_<T>(_first);}private void initData(){_count = 0;_first = null;_last = null;_sortord = Sortord_.s_null;}/*** Instantiates a new D list.*//// <summary>/// 構造函數/// </summary>public DList_() { initData();  }@SafeVarargspublic DList_(T... args){initData();for( T t: args){ add(t); }}/*** Get first d list note.** @return the d list note*/public DListNote_<T> getFirst(){ return _first; }/*** Get last d list note.** @return the d list note*/public DListNote_<T>  getLast(){ return _last; }/*** Get sortord sortord.** @return the sortord*/public Sortord_ getSortord(){ return _sortord; }/*** Get count int.** @return the int*/
/// <summary>/// 實際包含的元素數/// </summary>public int getCount(){return _count;}/*** Add boolean.** @param item the item* @return the boolean*/
/// <summary>/// 將指定集合的元素添加到末尾/// </summary>/// <param name="item">要添加到的末尾處的對象。對于引用類型，該值可以為 null</param>/// <returns>如成功，返回真，否則返回假</returns>public Boolean add(T item){if (_count == 0){_first = new DListNote_<T>(item);_first.next = null;_first.prev = null;_last = _first;}else{DListNote_ pNew = new DListNote_<T>(item);pNew.next = null;pNew.prev = _last;_last.next = pNew;_last = pNew;}++_count;return true;}/*** Add.** @param dList the d list*/public void  add(DList_<T> dList){if (dList == null){throw new NullPointerException();}DListNote_<T> ld = dList._first;while (ld != null){add(ld.data);ld =  ld.next;}}/*** Index of note d list note.** @param iPos the pos* @return the d list note*/
/// <summary>/// 返回索引的節點,從零開始/// </summary>/// <param name="nPos"></param>/// <returns></returns>public  DListNote_<T> indexOfNote(int iPos){if (iPos >= _count || iPos < 0) throw new IndexOutOfBoundsException();int nindex = 0;if (iPos > _count / 2){DListNote_<T> pNote = _last;while (pNote != null){if (nindex++ == _count - iPos - 1){ return pNote;}pNote = pNote.prev;}}else{DListNote_<T> pNote = _first;while (pNote != null){if (nindex++ == iPos){return pNote;}pNote = pNote.next;}}return null;}/*** Bnary search int.** @param item the item* @return the int*/
/// <summary>/// 使用指定的比較器在整個已排序的 中搜索元素，并返回該元素從零開始的索引/// </summary>/// <param name="item">要定位的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果找到 item，則為已排序的  的從零開始的索引；否則為-1; </returns>public  int bnarySearch(T item){switch (_sortord){case s_max_min:{if (_count == 0){return -1;}if (_count == 1){return _first.data.compareTo(item) == 0 ? 0 : -1;}if (_count == 2){if( _first.data.compareTo(item) == 0) return 0;if ( _first.next.data.compareTo(item) == 0) return 1;return -1;}int nPos = _count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = _count - 1;  //右邊遠素DListNote_<T> ld;while (nRight >= 0 && nLeft >= 0){ld = indexOfNote(nPos);int iCom = item.compareTo(ld.data);if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case s_min_max:{if (_count == 0){return -1;}if (_count == 1){return _first.data.compareTo(item) == 0 ? 0 : -1;}if (_count == 2){if (_first.data.compareTo(item) == 0) return 0;if (_first.next.data.compareTo(item) == 0) return 1;return -1;}int nPos = (int)_count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = (int)_count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = indexOfNote(nPos);int iCom = item.compareTo(ld.data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return -1;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return -1;}nLeft = nPos + 1;}else{return nPos;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case s_null:{DListNote_<T> pNote = _first;int iCount = 0;while (pNote != null){if (pNote.data.equals(item)){return iCount;}pNote = pNote.next;++iCount;}break;}default:{return -1;}}return -1;}/*** Contains boolean.** @param item the item* @return the boolean*/
/// <summary>/// 確定某元素是否在列表中/// </summary>/// <param name="item">查找的對象。對于引用類型，該值可以為 null。</param>/// <returns>如果在列表中找到 item，則為 true，否則為 false。</returns>public  boolean contains(T item){return bnarySearch(item) != -1;}/*** Copy from.** @param ld the ld*/
/// <summary>/// 復制一個鏈表，清除原來鏈表的數據/// </summary>/// <param name="ld"></param>public void copyFrom(DList_<T> ld){if (!this.equals(ld)){clear();DListNote_<T> ldItem = ld._first;while (ldItem != null){add(ldItem.data);ldItem = ldItem.next;}}}/*/// <summary>/// 轉換成數組/// </summary>/// <returns></returns>public T[] toArray(){T[]  aResult = new T[_count]; //錯誤: 創建泛型數組int n = 0;DListNote_ pNoteTemp = _first;while (pNoteTemp != null){aResult[n++] = pNoteTemp.data;pNoteTemp = pNoteTemp.next;}return aResult;}*//*** Swap notedata boolean.** @param iIndex1 the index 1* @param iIndex2 the index 2* @return the boolean*/
/// <summary>/// 交換兩個節點的數據/// </summary>/// <param name="nIndex1"></param>/// <param name="nIndex2"></param>/// <returns></returns>public   boolean swapNotedata(int iIndex1, int iIndex2){DListNote_<T> pNote1, pNote2;pNote1 = indexOfNote(iIndex1);pNote2 = indexOfNote(iIndex2);if (!(pNote1 != null && pNote2 != null)){return false;}T pTmp = pNote1.data;pNote1.data = pNote2.data;pNote2.data = pTmp;return true;}/*** Sort selection.** @param sortord the sortord*/
/// <summary>/// 選擇排序可以說是最簡單的一種排序方法：/// 1.找到數組中最小的那個元素/// 2.將最小的這個元素和數組中第一個元素交換位置/// 3.在剩下的元素中找到最小的的元素，與數組第二個元素交換位置/// 重復以上步驟，即可以得到有序數組。/// </summary>public void sort_selection(Sortord_ sortord){_sortord = sortord;  //已排序if (_count == 0 || _count == 1) return;DListNote_<T> min = _first, tmp = _first.next;if (sortord == Sortord_.s_min_max){while (min.next != null){while (tmp != null){if ( tmp.data.compareTo(min.data) < 0)  //交換位置{T pt = tmp.data;tmp.data = min.data;min.data = pt;}tmp = tmp.next;}min = min.next;tmp = min.next;}}else{while (min.next != null){while (tmp != null){if (tmp.data.compareTo(min.data) > 0){T pt = tmp.data;tmp.data = min.data;min.data = pt;}tmp = tmp.next;}min = min.next;tmp = min.next;}}}/*** Inser note front d list note.** @param pListItem the p list item* @param pData     the p data* @return the d list note*/
/// <summary>/// 在結點pListItem前面插入一個結點,成功，返回新的結點，否則返回０/// </summary>/// <param name="pListItem"></param>/// <param name="pData"></param>/// <returns></returns>protected  DListNote_ InserNoteFront(DListNote_ pListItem, T pData){if (pListItem == null){throw new NullPointerException();}DListNote_ pNote = new DListNote_(pData);//pNotepNote.next = pListItem;pNote.prev = pListItem.prev;//--pListItem->previf (pListItem.prev != null){pListItem.prev.next = pNote;}else{_first = pNote;}//pListItempListItem.prev = pNote;++_count;return pNote;}/*** Inser note back d list note.** @param pListItem the p list item* @param pData     the p data* @return the d list note*/
/// <summary>/// 在結點pListItem后面插入一個結點,成功，返回新的結點，否則返回０；/// </summary>/// <param name="pListItem"></param>/// <param name="pData"></param>/// <returns></returns>protected  DListNote_ InserNoteBack(DListNote_ pListItem, T pData){if (pListItem == null) return null;DListNote_ pNote = new DListNote_(pData);//pNotepNote.prev = pListItem;pNote.next = pListItem.next;//pListItem->nextif (pListItem.next != null){pListItem.next.prev = pNote;}else{_last = pNote;}//--pListItempListItem.next = pNote;++_count;return pNote;}/*** Find note item d list note.** @param item the item* @return the d list note*/
/// <summary>/// 找查一個項，而不是節點，返回的這個節點相當于指針。/// </summary>/// <param name="pData">項值</param>/// <returns></returns>public  DListNote_ findNoteItem(T item){switch (_sortord){case s_max_min:{if (_count == 0){return null;}if (_count == 1){return _first.data.compareTo(item) == 0 ? _first : null;}if (_count == 2){if (_first.data.compareTo(item) == 0) return _first;if (_first.next.data.compareTo(item) == 0) return _first.next;return null;}int nPos = _count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = _count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = indexOfNote(nPos);int iCom = item.compareTo(ld.data);if (iCom > 0){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (iCom < 0){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return ld;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case s_min_max:{if (_count == 0){return null;}if (_count == 1){return _first.data.compareTo(item) == 0 ? _first : null;}if (_count == 2){if (_first.data.compareTo(item) == 0) return _first;if (_first.next.data.compareTo(item) == 0) return _first.next;return null;}int nPos = _count / 2;   //nPos在中間，所以無素一定要大于等于3才行int nLeft = 0;   //左邊遠素int nRight = _count - 1;  //右邊遠素DListNote_<T> ld = null;while (nRight >= 0 && nLeft >= 0){ld = indexOfNote(nPos);int iCom = item.compareTo(ld.data);if (iCom < 0){if (nRight == nLeft || nPos == nLeft){return null;}nRight = nPos - 1;}else if (iCom > 0){if (nRight == nLeft || nPos == nRight){return null;}nLeft = nPos + 1;}else{return ld;}nPos = nLeft + (nRight - nLeft + 1) / 2;}break;}case s_null:{DListNote_<T> pNote = _first;while (pNote != null){//總結:Equals比較的永遠是變量的內容是否相同，而= =比較的則是引用地址是否相同(前提:此種類型內部沒有對Equals 或= = 進行重寫操作，//否則輸出可能會有不同)。string 類型是個特例，因為他的內部對這兩個都進行了重寫。if (item.compareTo(pNote.data) == 0){return pNote;}/*if (pNote.data.Equals(item)){return pNote;}*/pNote = pNote.next;}break;}default:{return null;}}return null;}/*** Move last boolean.** @param iIndex the index* @return the boolean*/
/// <summary>/// 把索引為nIndex的節點移到最后/// </summary>/// <param name="nIndex"></param>/// <returns></returns>protected boolean moveLast(int iIndex){DListNote_ pNote = indexOfNote(iIndex);if (pNote != null){if (pNote == _last)return true;if (pNote == _first) //此時最少兩個節點{_first = _first.next;_first.prev = null;_last.next = pNote;pNote.prev = _last;_last = pNote;}else{pNote.prev.next = pNote.next;pNote.next.prev = pNote.prev;_last.next = pNote;pNote.prev = _last;_last = pNote;}return true;}return false;}/*** Move first boolean.** @param iIndex the index* @return the boolean*/
/// <summary>/// 把索引為nIndex的節點移到最前/// </summary>/// <param name="nIndex"></param>/// <returns></returns>protected boolean moveFirst(int iIndex){DListNote_ pNote = indexOfNote(iIndex);if (pNote != null){if (pNote == _first)return true;if (pNote == _last)  //此時最少兩個節點{_last.prev.next = null;_last = _last.prev;pNote.prev = null;pNote.next = _first;_first.prev = pNote;_first = pNote;}else{pNote.prev.next = pNote.next;pNote.next.prev = pNote.prev;pNote.next = _first;_first.prev = pNote;pNote.prev = null;_first = pNote;}return true;}return false;}/*** Remove item boolean.** @param pData the p data* @return the boolean*/
/// <summary>/// 刪除鏈表中的數據/// </summary>/// <param name="pData"></param>/// <returns></returns>public  boolean  RemoveItem(T pData){if (_sortord == Sortord_.s_null){DListNote_ pListItem = _first;while (pListItem != null){if (pListItem.data.equals(pData))	//找到一項{if (pListItem == _first)		//刪除的是第一個節點{if (_first.next != null){_first.next.prev = null;_first = _first.next;}else{_first = null;_last = null;}}else if (pListItem == _last)  //刪除的是最后一個節點{if (_last.prev != null){_last.prev.next = null;_last = _last.prev;}else{_first = null;_last = null;}}else						//刪除的是中間的一個節點{pListItem.next.prev = pListItem.prev;pListItem.prev.next = pListItem.next;}--_count;return true;}pListItem = pListItem.next;}return false;}else{return removeAt(bnarySearch(pData));}}/*** Delete node boolean.** @param pListItem the p list item* @return the boolean*/
/// <summary>/// 刪除鏈表中的節點/// </summary>/// <param name="pListItem"></param>/// <returns></returns>protected boolean deleteNode(DListNote_ pListItem){if (_count == 0 || pListItem == null){return false;}DListNote_ pNote = _first.next;while (pNote != null){if (pNote == pListItem)  //找到了{//pListItem->previf (pListItem.prev != null){pListItem.prev.next = pListItem.next;}else //刪除的是第一個節點{_first = pListItem.next;}//pListItem->nextif (pListItem.next != null){pListItem.next.prev = pListItem.prev;}else //刪除的是最后一個節點{_last = pListItem.prev;}break;}pNote = pNote.next;}if (pNote != null){--_count;return true;}return false;}/*** 功能：清空所有元素的所有數據，并清空鏈表* 創建時間：????/??/??* 最后一次修改時間：2022-07-02*/public void clear(){_count = 0;DListNote_ pTemp1 = _first;while (pTemp1 != null){DListNote_ pTemp2 = pTemp1.next;pTemp1.data = null;pTemp1.next = null;pTemp1.prev = null;pTemp1 = pTemp2;}_first = null;_last = null;}/*** Remove at boolean.** @param iIndex the index* @return the boolean*/
/// <summary>/// 移除指定索引處的元素/// </summary>/// <param name="iIndex">要移除的元素的從零開始的索引。</param>/// <returns>成功返回true,否則返回false</returns>public Boolean removeAt(int iIndex){if (iIndex < 0 || iIndex + 1 > _count) { return false; }DListNote_ pNode = _first;int iCount = 0;while (pNode != null){if (iCount == iIndex){if (pNode == _first){if (_first.next == null)   //只有一個{clear();return true;}else{_first = _first.next;_first.prev = null;--_count;return true;}}else if (pNode == _last){if (_last.prev == null){clear();return true;}else{_last = _last.prev;_last.next = null;--_count;return true;}}else{pNode.prev.next = pNode.next;pNode.next.prev = pNode.prev;pNode = null;--_count;return true;}}pNode = pNode.next;++iCount;}return false;}/*** Printlf.*/public void printlf(){jp.p(toString()); }/*** 功能：刪除一段鏈表，注意：pDeleteNoteStart 一定要在鏈表內。** @param pDeleteNoteStart 開始刪除的位置* @param bDown            刪除方向，向下還是向上，prev 為向上，next 為向上* @param nCount           要刪除的個數，包括 pDeleteNoteStart* @return 返回實際刪除的個數   作者：李鋒 創建時間：2022/07/02 最后一次修改時間：2022/07/02*/public int removeNotes(DListNote_ pDeleteNoteStart,boolean bDown,int nCount){if(_count <= 0 || nCount <= 0 || pDeleteNoteStart == null ) return 0;    	if(pDeleteNoteStart == _first){         //如果刪除的開始位置是鏈表中的第一個節點if( bDown ){  //向下int n = 0;DListNote_ pTemp = _first;        			//計數while(pTemp != null){ 	++ n;   pTemp.data = null;pTemp = pTemp.next;    if( n ==  nCount) break;   	    		    	} 			   if(pTemp == null){    clear();    	return _count;}else {    	//重新設置 _firstpTemp.prev = null;_first = pTemp;_count -= nCount;   return nCount;}  	    			} else{  //向上，只刪除一個,重新設置 _firstif(_count == 1){clear();}else{		-- _count;_first.data = null;DListNote_ pTemp = _first.next;pTemp.prev = null;_first = pTemp;}return 1;}	}else if(pDeleteNoteStart == _last){  //如果刪除的開始位置是鏈表中的最后一個節點   	if( bDown ){  //向下,只刪除一個,重新設置 _lastif(_count == 1){clear();}else{-- _count;_last.data = null;DListNote_ pTemp = _last.prev;pTemp.next = null;_last = pTemp;}return 1;} else{  //向上int n = 0;DListNote_ pTemp = _last;        			//計數while(pTemp != null){ 	++ n;   pTemp.data = null;pTemp = pTemp.prev;    if( n ==  nCount) break;}if(pTemp == null){clear();return _count;}else {    	//重新設置 _lastpTemp.next = null;_last = pTemp;_count -= nCount;   return nCount;}}	  		}else{if( bDown ){  			 int n = 0;DListNote_ pTemp = pDeleteNoteStart;        			//計數while(pTemp != null){ 	++ n;   pTemp.data = null;pTemp = pTemp.next;  if( n ==  nCount) break;    				      		  }if(pTemp == null)  //_last也刪掉了{  				 pDeleteNoteStart.prev.next = null;_last = pDeleteNoteStart.prev;    				 _count -= n;   return n;   //實際刪除個數}else {   	    				pDeleteNoteStart.prev.next = pTemp;pTemp.prev = pDeleteNoteStart.prev;    			 _count -= nCount;   return nCount;}    			} else{int n = 0;DListNote_ pTemp = pDeleteNoteStart;        			//計數while(pTemp != null){ 	++ n;   pTemp.data = null;pTemp = pTemp.prev;    if( n ==  nCount) break;}if(pTemp == null) { //_first 也刪掉了pDeleteNoteStart.next.prev = null;    				_first = pDeleteNoteStart.next;_count -= n;   			return n;   //實際刪除個數}else {   	pTemp.next = pDeleteNoteStart.next;pDeleteNoteStart.next.prev = pTemp;        			 _count -= nCount;   return nCount;}    	  }}  	  	    }/*** 添加一個元素，并把它放在首位，其它元素后移,如果后面的元素刪除，總無素個數不變，如果無素個數為零，則添加一個無素。** @param Item        the item* @param bRemoveLast 創建時間： 2022-04-19      最后一次修改時間：2022-04-19*/public void stackPush(T Item, boolean bRemoveLast){if (_count == 0){add(Item);}else if (_count == 1){if (bRemoveLast){_first.data = Item;}else{//把無素放在最前DListNote_ dnNew = new DListNote_(Item);_first.prev = dnNew;dnNew.next = _first;_first = dnNew;++_count;}}else{if (bRemoveLast){//刪除最后一個元素_last = _last.prev;_last.next = null;//把無素放在最前DListNote_ dnNew = new DListNote_(Item);_first.prev = dnNew;dnNew.next = _first;dnNew.prev = null;_first = dnNew;}else {//把無素放在最前DListNote_ dnNew = new DListNote_(Item);_first.prev = dnNew;dnNew.next = _first;dnNew.prev = null;_first = dnNew;++_count;}}}/*** Stack pop.*/
/// <summary>/// 刪除第一個元素，出棧/// </summary>/// 創建時間： 2022-04-19      最后一次修改時間：2022-04-19public void stackPop(){ removeAt(0); }/*** To array list array list.** @return the array list*/public ArrayList<T> toArrayList(){ArrayList<T> la = new ArrayList<T>();for(T value : this){la.add(value); }return la;}/*** 功能: 轉為字符串格式  類名：{ a 分隔符 b 分隔符 c }** @param separator 分隔符* @return string* @author 李鋒* @since 創建日期 :2022-08-08,最后一次修改日期:2022-08-08*/public String toString(String  sConnector){String info = this.getClass() + " :\t";//info += "{";int i = 0;for ( T  t : this) {info += t.toString();++ i ;if( i != _count)info +=  sConnector;}//info += "}";return info;}/*** 功能: 轉為字符串格式  類名：{ a , b , c }* @return* @since 創建日期:2022-08-08,最后一次修改日期:2022-08-08* @author 李鋒*/@Overridepublic String toString() {return  toString(",");}}class DListNoteEnum_<T> implements Iterator<T> {private DListNote_<T> _dnCurr;private int _index = -1;public DListNoteEnum_(DListNote_<T> dn){_dnCurr = dn;}@Overridepublic boolean hasNext() {return _dnCurr.next != null;}@Overridepublic T next() {   ++ _index;if( _index > 0){_dnCurr = _dnCurr.next;}        return _dnCurr.data; }
}