source: mainline/uspace/dist/sysel/list.sy@ 94d484a

--
-- Copyright (c) 2010 Jiri Svoboda
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions
-- are met:
--
-- o Redistributions of source code must retain the above copyright
--   notice, this list of conditions and the following disclaimer.
-- o Redistributions in binary form must reproduce the above copyright
--   notice, this list of conditions and the following disclaimer in the
--   documentation and/or other materials provided with the distribution.
-- o The name of the author may not be used to endorse or promote products
--   derived from this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
-- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
-- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
-- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--

class List is
        var head : ListNode;

        fun Init() is
                head = new ListNode();
                head.prev = head;
                head.next = head;
        end

        fun Append(data : int) is
                var n : ListNode;
                var ntl : ListNode;

                ntl = head.prev;

                n = new ListNode();
                n.value = data;

                n.prev = ntl;
                n.next = head;
                n.head = head;

                ntl.next = n;
                head.prev = n;
        end

        fun GetFirst() : ListNode is
                return head.next;
        end
end

class ListNode is
        var value : int;

        var prev : ListNode;
        var next : ListNode;
        var head : ListNode;

        fun GetNext() : ListNode is
                if next != head then
                        return next;
                else
                        return nil;
                end
        end

        fun GetPrev() : ListNode is
                if prev != head then
                        return next;
                else
                        return nil;
                end
        end

        fun GetValue() : int is
                return value;
        end
end

class ListDemo is
        fun Main() is
                var list : List;

                list = new List();
                list.Init();

                list.Append(5);
                list.Append(6);
                list.Append(7);
                list.Append(8);

                var n : ListNode;

                n = list.GetFirst();
                while n != nil do
                        Builtin.WriteLine(n.value);
                        n = n.GetNext();
                end
        end
end