/*
 * Copyright (c) 2005-2006 Erik Tigerholm <eriktigerholm@gmail.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */
namespace OpenTraffic.Model.TrafficGenerator
{
    using System;
    using System.Collections.Generic;
    using System.Xml.Serialization;

    [Serializable]
    [XmlInclude(typeof(ProbOD))]
    [XmlInclude(typeof(NonProbOD))]
    public abstract class ODTrafficGenerator : AbstractTrafficGenerator
    {
        public List<Demand> Demands { get; set; }

        [System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Usage", "CA2227:CollectionPropertiesShouldBeReadOnly")]
        public List<TimeSlice> Times { get; set; }

        protected ODTrafficGenerator()
        {
            Demands = new List<Demand>();
            Times = new List<TimeSlice>();
        }

        abstract public override AbstractTrafficGenerator SplitDemand(IDictionary<int, int> part, int id);

        abstract public override List<Vehicle> CreateTraffic(float stopTime);

        public override float GetInflow(TrafficZone z, float t)
        {
            for (int i = 0; i < Times.Count; i++)
            {
                TimeSlice ts = Times[i];
                if (ts.StartTime <= t && t < ts.StopTime)
                {
                    float f = 0;
                    foreach (Demand d in Demands)
                    {
                        if (d.Origin == z)
                        {
                            if (i < d.Demands.Length)
                            {
                                f += d.Demands[i];
                            }
                        }
                    }
                    return f;
                }
            }

            return 0;
        }
    }
}