C# (CSharp) LinkedList DoubleListNode Examples

Example #1

File: Program.cs Project: prolificcoder/csharpcoding

 internal int priority; //lower priority is higher
 public DoubleListNode(int data, int priority, DoubleListNode next, DoubleListNode prev)
 {
     this.data     = data;
     this.next     = next;
     this.prev     = prev;
     this.priority = priority;
 }

Example #2

File: Program.cs Project: prolificcoder/csharpcoding

        internal void Enqueue(DoubleListNode newNode)
        {
            if (head == null)
            {
                head = newNode;
                return;
            }
            if (newNode.priority < head.priority)
            {
                newNode.next = head;
                head.prev    = newNode;
                head         = newNode;
                return;
            }
            DoubleListNode cur = head;

            while (cur.next != null && cur.next.priority < newNode.priority)
            {
                cur = cur.next;
            }
            if (cur.next == null)
            {
                cur.next     = newNode;
                newNode.prev = cur;
            }
            else
            {
                cur.next.prev = newNode;
                newNode.next  = cur.next;
                cur.next      = newNode;
                newNode.prev  = cur;
            }
        }

Example #3

File: Program.cs Project: prolificcoder/csharpcoding

 public DoubleListNode(int data, int priority)
 {
     this.data     = data;
     this.priority = priority;
     this.prev     = null;
     this.next     = null;
 }

Example #4

File: Program.cs Project: prolificcoder/csharpcoding

 public DoubleListNode(int data, int priority)
 {
     this.data = data;
     this.priority = priority;
     this.prev = null;
     this.next = null;
 }

Example #5

File: Program.cs Project: prolificcoder/csharpcoding

        internal int priority; //lower priority is higher

        #endregion Fields

        #region Constructors

        public DoubleListNode(int data, int priority, DoubleListNode next, DoubleListNode prev)
        {
            this.data = data;
            this.next = next;
            this.prev = prev;
            this.priority = priority;
        }

Example #6

File: Program.cs Project: prolificcoder/csharpcoding

        internal DoubleListNode Deque()
        {
            if (head == null)
            {
                return(null);
            }
            DoubleListNode temp = head;

            head = head.next;
            return(temp);
        }

Example #7

File: Program.cs Project: prolificcoder/csharpcoding

 public PriorityQueue()
 {
     head = null;
 }

Example #8

File: Program.cs Project: prolificcoder/csharpcoding

 internal void Enqueue(DoubleListNode newNode)
 {
     if (head == null)
     {
         head = newNode;
         return;
     }
     if (newNode.priority < head.priority)
     {
         newNode.next = head;
         head.prev = newNode;
         head = newNode;
         return;
     }
     DoubleListNode cur = head;
     while (cur.next != null && cur.next.priority < newNode.priority)
     {
         cur = cur.next;
     }
     if (cur.next == null)
     {
         cur.next = newNode;
         newNode.prev = cur;
     }
     else
     {
         cur.next.prev = newNode;
         newNode.next = cur.next;
         cur.next = newNode;
         newNode.prev = cur;
     }
 }

Example #9

File: Program.cs Project: prolificcoder/csharpcoding

 internal DoubleListNode Deque()
 {
     if (head == null)
         return null;
     DoubleListNode temp = head;
     head = head.next;
     return temp;
 }

Example #10

File: Program.cs Project: prolificcoder/csharpcoding

 public PriorityQueue()
 {
     head = null;
 }