Click here to Skip to main content
15,894,017 members
Articles / Web Development / HTML

Signum Framework Tutorials Part 2 – Southwind Logic

Rate me:
Please Sign up or sign in to vote.
4.45/5 (6 votes)
15 Nov 2012LGPL325 min read 31.5K   1K   22  
In this part, we will focus on writing business logic, LINQ queries and explain inheritance
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections;
using Signum.Utilities.Properties;

namespace Signum.Utilities.DataStructures
{
    public class ImmutableQueue<T> : IEnumerable<T>
    {
        private class ImmutableFullQueue : ImmutableQueue<T>
        {
            readonly ImmutableStack<T> backwards;
            readonly ImmutableStack<T> forwards;

            public ImmutableFullQueue(ImmutableStack<T> f, ImmutableStack<T> b)
            {
                forwards = f;
                backwards = b;
            }

            public override bool IsEmpty { get { return false; } }
            public override T Peek() { return forwards.Peek(); }

            public override ImmutableQueue<T> Enqueue(T value)
            {
                return new ImmutableFullQueue(forwards, backwards.Push(value));
            }

            public override ImmutableQueue<T> Dequeue()
            {
                ImmutableStack<T> f = forwards.Pop();
                if (!f.IsEmpty)
                    return new ImmutableFullQueue(f, backwards);
                else if (backwards.IsEmpty)
                    return ImmutableQueue<T>.Empty;
                else
                    return new ImmutableFullQueue(backwards.Reverse(), ImmutableStack<T>.Empty);
            }

            public override IEnumerator<T> GetEnumerator()
            {
                foreach (T t in forwards) yield return t;
                foreach (T t in backwards.Reverse()) yield return t;
            }

            public override string ToString()
            {
                return "[" + this.ToString(", ") + "]";
            }

        }

        static readonly ImmutableQueue<T> empty = new ImmutableQueue<T>();
        public static ImmutableQueue<T> Empty { get { return empty; } }

        private ImmutableQueue() { }

        public virtual bool IsEmpty { get { return true; } }
        public virtual T Peek() { throw new InvalidOperationException("Empty queue"); }
        public virtual ImmutableQueue<T> Enqueue(T value)
        {
            return new ImmutableFullQueue(ImmutableStack<T>.Empty.Push(value), ImmutableStack<T>.Empty);
        }

        public virtual ImmutableQueue<T> Dequeue() { throw new InvalidOperationException("Empty queue"); }
        public virtual IEnumerator<T> GetEnumerator() { yield break; }
        public override string ToString() { return "[]"; }

        IEnumerator IEnumerable.GetEnumerator() { return this.GetEnumerator(); }
    }
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The GNU Lesser General Public License (LGPLv3)


Written By
Software Developer (Senior) Signum Software
Spain Spain
I'm Computer Scientist, one of the founders of Signum Software, and the lead developer behind Signum Framework.

www.signumframework.com

I love programming in C#, Linq, Compilers, Algorithms, Functional Programming, Computer Graphics, Maths...

Comments and Discussions