warrentyexpired/ModernUO
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Adds assemblies config, fixes crash bugs. (#134)

Browse source
This commit is contained in:
Kamron Batman 2020-05-09 12:55:56 -07:00 • committed by GitHub
parent 0140eb73b4
commit 8ec166bcd0
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
3223 changed files with 191 additions and 191 deletions
Download patch file Download diff file Expand all files Collapse all files

177
Projects/Scripts/Engines/Harvest/Core/HarvestDefinition.cs
View file

@ -1,177 +0,0 @@
using System;
using System.Collections.Generic;
using System.Linq;
namespace Server.Engines.Harvest
{
public class HarvestDefinition
{
public int BankWidth { get; set; }
public int BankHeight { get; set; }
public int MinTotal { get; set; }
public int MaxTotal { get; set; }
public int[] Tiles { get; set; }
public bool RangedTiles { get; set; }
public TimeSpan MinRespawn { get; set; }
public TimeSpan MaxRespawn { get; set; }
public int MaxRange { get; set; }
public int ConsumedPerHarvest { get; set; }
public int ConsumedPerFeluccaHarvest { get; set; }
public bool PlaceAtFeetIfFull { get; set; }
public SkillName Skill { get; set; }
public int[] EffectActions { get; set; }
public int[] EffectCounts { get; set; }
public int[] EffectSounds { get; set; }
public TimeSpan EffectSoundDelay { get; set; }
public TimeSpan EffectDelay { get; set; }
public TextDefinition NoResourcesMessage { get; set; }
public TextDefinition OutOfRangeMessage { get; set; }
public TextDefinition TimedOutOfRangeMessage { get; set; }
public TextDefinition DoubleHarvestMessage { get; set; }
public TextDefinition FailMessage { get; set; }
public TextDefinition PackFullMessage { get; set; }
public TextDefinition ToolBrokeMessage { get; set; }
public HarvestResource[] Resources { get; set; }
private HarvestVein[] m_Veins;
public HarvestVein[] Veins
{
get => m_Veins;
set
{
m_Veins = value;
VeinWeights = m_Veins.Aggregate<HarvestVein, uint>(0, (current, t) => current + t.VeinChance);
}
}
public BonusHarvestResource[] BonusResources { get; set; }
public bool RaceBonus { get; set; }
public bool RandomizeVeins { get; set; }
public uint VeinWeights { get; private set; }
public Dictionary<Map, Dictionary<Point2D, HarvestBank>> Banks { get; }
= new Dictionary<Map, Dictionary<Point2D, HarvestBank>>();
public void SendMessageTo(Mobile from, object message)
{
if (message is int messageInt)
from.SendLocalizedMessage(messageInt);
else
from.SendMessage(message.ToString());
}
public HarvestBank GetBank(Map map, int x, int y)
{
if (map == null || map == Map.Internal)
return null;
x /= BankWidth;
y /= BankHeight;
if (!Banks.TryGetValue(map, out Dictionary<Point2D, HarvestBank> banks))
Banks[map] = banks = new Dictionary<Point2D, HarvestBank>();
Point2D key = new Point2D(x, y);
if (!banks.TryGetValue(key, out HarvestBank bank))
banks[key] = bank = new HarvestBank(this, GetVeinAt(map, x, y));
return bank;
}
public HarvestVein GetVeinAt(Map map, int x, int y)
{
if (Veins.Length == 1)
return Veins[0];
if (RandomizeVeins) return GetVeinFrom(Utility.Random(1000u));
// TODO: Introduce pulling primes from a config and writing them if they don't exist to the config
using Xoshiro256PlusPlus random = new Xoshiro256PlusPlus((ulong)(x * 17 + y * 11 + map.MapID * 3));
return GetVeinFrom(random.Next(VeinWeights));
}
public HarvestVein GetVeinFrom(uint randomValue)
{
if (Veins.Length == 1)
return Veins[0];
for (int i = 0; i < Veins.Length; ++i)
{
if (randomValue <= Veins[i].VeinChance)
return Veins[i];
randomValue -= Veins[i].VeinChance;
}
return null;
}
public BonusHarvestResource GetBonusResource()
{
if (BonusResources == null)
return null;
double randomValue = Utility.RandomDouble() * 100;
for (int i = 0; i < BonusResources.Length; ++i)
{
if (randomValue <= BonusResources[i].Chance)
return BonusResources[i];
randomValue -= BonusResources[i].Chance;
}
return null;
}
public bool Validate(int tileID)
{
if (RangedTiles)
{
bool contains = false;
for (int i = 0; !contains && i < Tiles.Length; i += 2)
contains = tileID >= Tiles[i] && tileID <= Tiles[i + 1];
return contains;
}
int dist = -1;
for (int i = 0; dist < 0 && i < Tiles.Length; ++i)
dist = Tiles[i] - tileID;
return dist == 0;
}
}
}