static void Main(string[] args) { NumberDictionary NRDictionary = new NumberDictionary(); ADDNumbersToDictionary(NRDictionary); while (UserInput != "quit") { UserInput = Console.ReadLine(); if (UserInput == "quit") { } else { int i = 0; int ii = 0; foreach (var item in NRDictionary.numbers.Keys) { i += 1; if (UserInput == item) { ii += 1; Console.WriteLine("Dictionary value => " + NRDictionary.numbers[UserInput] + "\n"); } else if (i == NRDictionary.numbers.Count && ii == 0) { Console.WriteLine("Couldnt find [" + UserInput + "] in the dictionary! \nPlease try again.\n"); } } } } }
public void findNumDict() { numDict = GameObject.FindGameObjectWithTag("numDict").GetComponent <NumberDictionary>(); if (numDict == null) { Debug.Log("error finding numdict"); } }
public IEnumerable <TaggedItem> Tag(string[] tokens) { List <TaggedItem> results = new List <TaggedItem>(); for (int index = 0; index < tokens.Length; index++) { if (String.IsNullOrEmpty(tokens[index])) { continue; } double x; int y; if (NumberDictionary.TryGetValue(tokens[index], out x)) { results.Add(new TaggedNumberItem() { TokenIndex = index, Term = tokens[index], Number = x, Tag = NaturalLang.Tag.Number }); } else if (NumberOrdDictionary.TryGetValue(tokens[index], out y)) { results.Add(new TaggedNumberItem() { TokenIndex = index, Term = tokens[index], Number = y, Tag = NaturalLang.Tag.NumberOrdinal }); } else if (Int32.TryParse(tokens[index], out y)) { results.Add(new TaggedNumberItem() { TokenIndex = index, Term = tokens[index], Number = y, Tag = NaturalLang.Tag.Number }); } else if (NumberOrdRegex.IsMatch(tokens[index])) { Int32.TryParse(tokens[index].Substring(0, tokens[index].Length - 2), out y); results.Add(new TaggedNumberItem() { TokenIndex = index, Term = tokens[index], Number = y, Tag = NaturalLang.Tag.NumberOrdinal }); } } return(results); }
// Use this for initialization void Start() { // Singleton Behaviour if (instance == null) { instance = this; } else if (instance != this) { Destroy(gameObject); } DontDestroyOnLoad(gameObject); }
public static void ADDNumbersToDictionary(NumberDictionary NRDictionary) { NRDictionary.numbers["one"] = 1; NRDictionary.numbers["two"] = 2; NRDictionary.numbers["three"] = 3; NRDictionary.numbers["four"] = 4; NRDictionary.numbers["five"] = 5; NRDictionary.numbers["six"] = 6; NRDictionary.numbers["seven"] = 7; NRDictionary.numbers["eight"] = 8; NRDictionary.numbers["nine"] = 9; NRDictionary.numbers["ten"] = 10; }
public FacetResult() { Terms = new NumberDictionary(); }
private string Convert(BigInteger number) { BigInteger offsetFirst, offsetThird, offsetFourth; string end = ""; string space = " "; string returnValue = "Error: Out of Bounds"; switch (number) { case BigInteger n when(n >= 0 && n < 20): returnValue = NumberDictionary.GetValue(number); break; case BigInteger n when(n >= 0 && n < 1000): offsetFirst = (BigInteger)(number / 100); offsetThird = number % 100; offsetFourth = 0; if (offsetThird > 19) { //Need more logic if number is greater than 19 offsetFourth = offsetThird % 10; offsetThird -= offsetFourth; end = NumberDictionary.GetValue(offsetThird); if (offsetFourth > 0) { end = end + " " + NumberDictionary.GetValue(offsetFourth); } } else { end = Convert(offsetThird); if (offsetThird == 0) { space = ""; } } returnValue = NumberDictionary.GetValue(offsetFirst) + " Hundred" + space + end; break; case BigInteger n when(n >= 0 && n < GetPow(6)): returnValue = Seperator(3, number, "Thousand"); break; case BigInteger n when(n >= 0 && n < GetPow(9)): returnValue = Seperator(6, number, "Million"); break; case BigInteger n when(n >= 0 && n < GetPow(12)): returnValue = Seperator(9, number, "Billion"); break; case BigInteger n when(n >= 0 && n < GetPow(15)): returnValue = Seperator(12, number, "Trillion"); break; case BigInteger n when(n >= 0 && n < GetPow(18)): returnValue = Seperator(15, number, "Quadrillion"); break; case BigInteger n when(n >= 0 && n < GetPow(21)): returnValue = Seperator(18, number, "Quintillion"); break; case BigInteger n when(n >= 0 && n < GetPow(24)): returnValue = Seperator(21, number, "Sextillion"); break; case BigInteger n when(n >= 0 && n < GetPow(27)): returnValue = Seperator(24, number, "Septillion"); break; case BigInteger n when(n >= 0 && n < GetPow(30)): returnValue = Seperator(27, number, "Octillion"); break; case BigInteger n when(n >= 0 && n < GetPow(33)): returnValue = Seperator(30, number, "Nonillion"); break; case BigInteger n when(n >= 0 && n < GetPow(36)): returnValue = Seperator(33, number, "Decillion"); break; case BigInteger n when(n >= 0 && n < GetPow(39)): returnValue = Seperator(36, number, "Undecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(42)): returnValue = Seperator(39, number, "Duodecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(45)): returnValue = Seperator(42, number, "Tredecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(48)): returnValue = Seperator(45, number, "Quattuordecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(51)): returnValue = Seperator(48, number, "Quindecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(54)): returnValue = Seperator(51, number, "Sexdecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(57)): returnValue = Seperator(54, number, "Septendecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(60)): returnValue = Seperator(57, number, "Octodecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(63)): returnValue = Seperator(60, number, "Novemdecillion"); break; case BigInteger n when(n >= 0 && n < GetPow(66)): returnValue = Seperator(63, number, "Vigintillion"); break; } return(returnValue); }