鏈表類具有雜湊表的功能

來源:互聯網
上載者:User

using System;

namespace Study
{
 /// <summary>
 /// CChain 的摘要說明。
 /// </summary>
 public class CChain
 {
  
  public class CChainNode
  {
   public object Data;
   public CChainNode NextChainNode;
   public CChainNode PreviousChainNode;
   public object Tag;
   public string Key;

   public CChainNode()
   {
    this.Data=null;
    this.Tag=null;
    this.Key=null;
    this.NextChainNode=this.PreviousChainNode=null;
   }

   public CChainNode(object vData,object vTag,string vKey)
   {
    this.Data=vData;
    this.Tag=vTag;
    this.Key=vKey;
    this.NextChainNode=this.PreviousChainNode=null;
   }
  }


  public class CChainIterator
  {
   private CChainNode pCurrentChainNode,pFirstChainNode,pLastChainNode;
   private bool pbFirst,pbLast;

   public CChainIterator(CChainNode vFirstChainNode,CChainNode vLastChainNode)
   {
    this.pCurrentChainNode=this.pFirstChainNode=this.pLastChainNode=null;
    if(vFirstChainNode!=null)
    {
     pCurrentChainNode=pFirstChainNode=vFirstChainNode;
     pbFirst=false;
    }
    if(vLastChainNode!=null)
    {
     pCurrentChainNode=pLastChainNode=vLastChainNode;
     pbLast=false;
    }
   }

   public CChainNode CurrentChainNode
   {
    get
    {
     return this.pCurrentChainNode;
    }
   }
   
   public bool NextChainNode()
   {
    if(this.pFirstChainNode==null)
    {
     return false;
    }
    if(pCurrentChainNode==pFirstChainNode && pbFirst==false)
    {
     pbFirst=true;
     return true;  
    }
    else
    {
     pCurrentChainNode=pCurrentChainNode.NextChainNode;
     if(pCurrentChainNode ==null)
     {
      return false;
     }
     else
     {
      return true;
     }
    }
   }

   public bool PreviousChainNode()
   {
    if(this.pLastChainNode==null)
    {
     return false;
    }
    if(pCurrentChainNode==pLastChainNode && pbLast==false)
    {
     pbLast=true;
     return true;  
    }
    else
    {
     pCurrentChainNode=pCurrentChainNode.PreviousChainNode;
     if(pCurrentChainNode ==null)
     {
      return false;
     }
     else
     {
      return true;
     }
    }
   }
  }
  

  public CChainNode FirstChainNode;
  public CChainNode LastChainNode;
  public CChainNode CurrentChainNode;

  public CChain()
  {
   this.FirstChainNode=this.LastChainNode=this.CurrentChainNode =null;
  }

  ~CChain()
  {

  }

  public bool IsEmpty()
  {
   if(this.FirstChainNode==null)
   {
    return true;
   }
   else
   {
    return false;
   }
  }

  public bool AppendChainNode(CChainNode vChainNode)
  { 
   
   if(vChainNode==null)
   {
    return false;
   }
   else
   {
    if(this.FirstChainNode==null)
    {
     this.FirstChainNode=vChainNode;
     this.FirstChainNode.PreviousChainNode=null;
     this.FirstChainNode.NextChainNode=null;
     this.LastChainNode=this.CurrentChainNode=this.FirstChainNode;
    }
    else
    {
     this.CurrentChainNode.NextChainNode=vChainNode;
     vChainNode.PreviousChainNode=this.CurrentChainNode;
     vChainNode.NextChainNode=null;
     this.LastChainNode=this.CurrentChainNode=vChainNode;
    }
    return true;
   }
  }

  public bool InsertChainNode(int Index,CChainNode vChainNode)
  { 
   CChainNode pCn;
   int pCount=0;
   CChain.CChainIterator pCi=new CChainIterator(this.FirstChainNode,null);
   if(vChainNode==null || Index<0)
   {
    return false;
   }
   if(Index==0)
   {
    pCn=this.FirstChainNode;
    vChainNode.NextChainNode=pCn;
    pCn.PreviousChainNode=vChainNode;
    this.FirstChainNode=vChainNode;
    vChainNode.PreviousChainNode=null;
    return true;
   }
   while(pCi.NextChainNode()==true)
   {
    pCount++;
    if(pCount==Index)
    {
     pCn=pCi.CurrentChainNode.NextChainNode;
     pCi.CurrentChainNode.NextChainNode=vChainNode;
     vChainNode.PreviousChainNode=pCi.CurrentChainNode;
     vChainNode.NextChainNode=pCn;
     if(pCn!=null)
     {
      pCn.PreviousChainNode=vChainNode;
     }
     return true;
    }
   }
   return false;
  }

  public bool ContainsKey(string vKey)
  {
   CChain.CChainIterator pCi=new CChainIterator(this.FirstChainNode,null);
   while(pCi.NextChainNode()==true)
   {
    if(pCi.CurrentChainNode.Key ==vKey)
    {
     return true;
    }
   }
   return false;
  }

  public CChain.CChainNode Item(string vKey)
  {
   CChain.CChainIterator pCi=new CChainIterator(this.FirstChainNode,null);
   while(pCi.NextChainNode()==true)
   {
    if(pCi.CurrentChainNode.Key ==vKey)
    {
     return pCi.CurrentChainNode;
    }
   }
   return null;
  }

  public object ItemData(string vKey)
  {
   CChain.CChainIterator pCi=new CChainIterator(this.FirstChainNode,null);
   while(pCi.NextChainNode()==true)
   {
    if(pCi.CurrentChainNode.Key ==vKey)
    {
     return pCi.CurrentChainNode.Data;
    }
   }
   return null;
  }

  public int ChainNodeCount()
  {
   int pCount=0;
   CChain.CChainIterator pCi=new CChainIterator(this.FirstChainNode,null);
   while(pCi.NextChainNode()==true)
   {
    pCount++;
   }
   return pCount;
  }
 }
}



相關文章

E-Commerce Solutions

Leverage the same tools powering the Alibaba Ecosystem

Learn more >

Apsara Conference 2019

The Rise of Data Intelligence, September 25th - 27th, Hangzhou, China

Learn more >

Alibaba Cloud Free Trial

Learn and experience the power of Alibaba Cloud with a free trial worth $300-1200 USD

Learn more >

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。