CodeWalker/GameFiles/Utils/Jenk.cs
2017-09-21 20:33:05 +10:00

255 lines
6.3 KiB
C#

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace CodeWalker.GameFiles
{
public class JenkHash
{
public JenkHashInputEncoding Encoding { get; set; }
public string Text { get; set; }
public int HashInt { get; set; }
public uint HashUint { get; set; }
public string HashHex { get; set; }
public JenkHash(string text, JenkHashInputEncoding encoding)
{
Encoding = encoding;
Text = text;
HashUint = GenHash(text, encoding);
HashInt = (int)HashUint;
HashHex = "0x" + HashUint.ToString("X");
}
public static uint GenHash(string text, JenkHashInputEncoding encoding)
{
uint h = 0;
byte[] chars;
switch (encoding)
{
default:
case JenkHashInputEncoding.UTF8:
chars = UTF8Encoding.UTF8.GetBytes(text);
break;
case JenkHashInputEncoding.ASCII:
chars = ASCIIEncoding.ASCII.GetBytes(text);
break;
}
for (uint i = 0; i < chars.Length; i++)
{
h += chars[i];
h += (h << 10);
h ^= (h >> 6);
}
h += (h << 3);
h ^= (h >> 11);
h += (h << 15);
return h;
}
public static uint GenHash(string text)
{
uint h = 0;
for (int i = 0; i < text.Length; i++)
{
h += (byte)text[i];
h += (h << 10);
h ^= (h >> 6);
}
h += (h << 3);
h ^= (h >> 11);
h += (h << 15);
return h;
}
public static uint GenHash(byte[] data)
{
uint h = 0;
for (uint i = 0; i < data.Length; i++)
{
h += data[i];
h += (h << 10);
h ^= (h >> 6);
}
h += (h << 3);
h ^= (h >> 11);
h += (h << 15);
return h;
}
}
public enum JenkHashInputEncoding
{
UTF8 = 0,
ASCII = 1,
}
public class JenkIndMatch
{
public string Hash { get; set; }
public string Value { get; set; }
public double Score { get; set; }
public JenkIndMatch(string hash, string val)
{
Hash = hash;
Value = val;
CalculateScore();
}
public void CalculateScore()
{
int wordlength = 0;
int wordrank = 0;
string okwordsymbs = " _-.";
string goodwordsymbs = "_";
for (int i = 0; i < Value.Length; i++)
{
char c = Value[i];
bool wordchar = (char.IsLetter(c) || char.IsDigit(c) || goodwordsymbs.Contains(c));
if (wordchar)
{
wordlength++;
}
else if (okwordsymbs.Contains(c))
{
//wordlength++; //don't add this to the score, but allow it to continue the chain
}
else
{
if (wordlength > 2)
{
wordrank += wordlength; //linear word increment, ignoring 1-2char matches
}
wordlength = 0;
}
//wordrank += wordlength; //each sequential letter in a word contributes more to the rank, ie. 1+2+3+4+...
}
if (wordlength > 2)
{
wordrank += wordlength; //linear word increment, ignoring 1-2char matches
}
if (Value.Length > 0)
{
//the max value for a given length when 1+2+3+4+5+..n = n(n+1)/2
//double n = (double)Value.Length;
//double maxscore = n * (n + 1.0) * 0.5;
double n = (double)Value.Length;
Score = (((double)wordrank) / n);
//Score = (((double)wordrank));
}
else
{
Score = 0.0;
}
}
public override string ToString()
{
return string.Format("{0} -> {1} ({2:0.##})", Hash, Value, Score);
}
}
public class JenkIndProblem
{
public string Filename { get; set; }
public string Excuse { get; set; }
public int Line { get; set; }
public JenkIndProblem(string filepath, string excuse, int line)
{
Filename = Path.GetFileName(filepath);
Excuse = excuse;
Line = line;
}
public override string ToString()
{
return string.Format("{0} : {1} at line {2}", Filename, Excuse, Line);
}
}
public static class JenkIndex
{
public static Dictionary<uint, string> Index = new Dictionary<uint, string>();
private static object syncRoot = new object();
public static void Clear()
{
lock (syncRoot)
{
Index.Clear();
}
}
public static bool Ensure(string str)
{
uint hash = JenkHash.GenHash(str);
if (hash == 0) return true;
lock (syncRoot)
{
if (!Index.ContainsKey(hash))
{
Index.Add(hash, str);
return false;
}
}
return true;
}
public static string GetString(uint hash)
{
string res;
lock (syncRoot)
{
if (!Index.TryGetValue(hash, out res))
{
res = hash.ToString();
}
}
return res;
}
public static string TryGetString(uint hash)
{
string res;
lock (syncRoot)
{
if (!Index.TryGetValue(hash, out res))
{
res = string.Empty;
}
}
return res;
}
}
}