コード例 #1
0
        public SelfOrganizingListNode <T> Get(T value)
        {
            if (Head == null)
            {
                return(null);
            }

            if (Head.Value.Equals(value))
            {
                return(Head);
            }

            var current  = Head.Next;
            var previous = Head;

            while (current != null)
            {
                if (current.Value.Equals(value))
                {
                    previous.Next = current.Next;
                    current.Next  = Head;
                    Head          = current;

                    return(current);
                }
                previous = current;
                current  = current.Next;
            }

            return(null);
        }
コード例 #2
0
        public void Add(T value)
        {
            if (Head == null)
            {
                Head = new SelfOrganizingListNode <T> {
                    Value = value
                };
                tail = Head;
                return;
            }

            tail.Next = new SelfOrganizingListNode <T> {
                Value = value
            };
            tail = tail.Next;
        }
コード例 #3
0
        public SelfOrganizingListNode <T> Get(T value)
        {
            if (Head == null)
            {
                return(null);
            }

            if (Head.Value.Equals(value))
            {
                return(Head);
            }

            if (Head.Next == null)
            {
                return(null);
            }

            if (Head.Next.Value.Equals(value))
            {
                var tmp = Head.Next;
                Head.Next = tmp.Next;
                tmp.Next  = Head;
                Head      = tmp;

                return(tmp);
            }

            var current     = Head.Next.Next;
            var prePrevious = Head;
            var previous    = Head.Next;

            while (current != null)
            {
                if (current.Value.Equals(value))
                {
                    Swap(prePrevious, previous, current);
                    return(current);
                }
                prePrevious = previous;
                previous    = previous.Next;
                current     = previous.Next;
            }

            return(null);
        }
コード例 #4
0
 private static void Swap(SelfOrganizingListNode <T> prePrevious, SelfOrganizingListNode <T> previous, SelfOrganizingListNode <T> current)
 {
     prePrevious.Next = current;
     previous.Next    = current.Next;
     current.Next     = previous;
 }