#region Copyright & License Information /* * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford. * This file is part of OpenRA. * * OpenRA is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * OpenRA is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with OpenRA. If not, see . */ #endregion using System.Collections.Generic; using System.Linq; using OpenRA.Mods.RA.Activities; using OpenRA.Traits; using OpenRA.Traits.Activities; namespace OpenRA.Mods.RA { public class HarvesterInfo : ITraitInfo { public readonly int Capacity = 28; public readonly int PipCount = 7; public readonly PipType PipColor = PipType.Yellow; public readonly string[] Resources = { }; public object Create(ActorInitializer init) { return new Harvester(init.self, this); } } public class Harvester : IIssueOrder, IResolveOrder, INotifyDamage, IPips, IRenderModifier, IExplodeModifier { Dictionary contents = new Dictionary(); [Sync] public bool Visible = true; [Sync] public Actor LinkedProc = null; [Sync] public int2 LastHarvestedCell = int2.Zero; readonly HarvesterInfo Info; public Harvester(Actor self, HarvesterInfo info) { Info = info; self.QueueActivity( new CallFunc( () => ChooseNewProc(self, null))); } void ChooseNewProc(Actor self, Actor ignore) { LinkedProc = ClosestProc(self, ignore); if (LinkedProc != null) LinkedProc.traits.WithInterface().FirstOrDefault().LinkHarvester(LinkedProc,self); } Actor ClosestProc(Actor self, Actor ignore) { var refs = self.World.Queries.OwnedBy[self.Owner] .Where(x => x != ignore && x.traits.Contains()) .ToList(); var path = self.World.PathFinder.FindPath(PathSearch.FromPoints(self, refs.Select(r => r.Location + r.traits.Get().DeliverOffset), self.Location, false)); path.Reverse(); if (path.Count != 0) return refs.FirstOrDefault(x => x.Location + x.traits.Get().DeliverOffset == path[0]); else return null; } public bool IsFull { get { return contents.Values.Sum() == Info.Capacity; } } public bool IsEmpty { get { return contents.Values.Sum() == 0; } } public void AcceptResource(ResourceType type) { if (!contents.ContainsKey(type.info)) contents[type.info] = 1; else contents[type.info]++; } public void Deliver(Actor self, Actor proc) { proc.traits.Get().GiveOre(contents.Sum(kv => kv.Key.ValuePerUnit * kv.Value)); contents.Clear(); } public Order IssueOrder(Actor self, int2 xy, MouseInput mi, Actor underCursor) { if (mi.Button == MouseButton.Left) return null; if (underCursor != null && underCursor.Owner == self.Owner && underCursor.traits.Contains() && !IsEmpty) { return new Order("Deliver", self, underCursor); } var res = self.World.WorldActor.traits.Get().GetResource(xy); var info = self.Info.Traits.Get(); if (underCursor == null && res != null && info.Resources.Contains(res.info.Name)) return new Order("Harvest", self, xy); return null; } public void ResolveOrder(Actor self, Order order) { if (order.OrderString == "Harvest") { self.CancelActivity(); self.QueueActivity(new Move(order.TargetLocation, 0)); self.QueueActivity(new Harvest()); } else if (order.OrderString == "Deliver") { self.CancelActivity(); if (order.TargetActor != LinkedProc) { if (LinkedProc != null) LinkedProc.traits.WithInterface().FirstOrDefault().UnlinkHarvester(LinkedProc,self); LinkedProc = order.TargetActor; LinkedProc.traits.WithInterface().FirstOrDefault().LinkHarvester(LinkedProc,self); } self.QueueActivity(new DeliverResources()); } } public void Damaged(Actor self, AttackInfo e) { if (self.IsDead) if (LinkedProc != null) LinkedProc.traits.WithInterface().FirstOrDefault().UnlinkHarvester(LinkedProc,self); } public void LinkProc(Actor self, Actor proc) { LinkedProc = proc; } public void UnlinkProc(Actor self, Actor proc) { if (LinkedProc != proc) return; ChooseNewProc(self, proc); } public IEnumerable GetPips(Actor self) { int numPips = Info.PipCount; int n = contents.Values.Sum(); for (int i = 0; i < numPips; i++) { if (n * 1.0f / Info.Capacity > i * 1.0f / numPips) yield return Info.PipColor; else yield return PipType.Transparent; } } public IEnumerable ModifyRender(Actor self, IEnumerable r) { return Visible ? r : new Renderable[] { }; } public bool ShouldExplode(Actor self) { return !IsEmpty; } } }