// Generated by Haxe 4.3.7

#pragma warning disable 109, 114, 219, 429, 168, 162
namespace haxe.lang {
	public sealed class FieldHashConflict {
		
		public FieldHashConflict(int hash, string name, object @value, global::haxe.lang.FieldHashConflict next) {
			this.hash = hash;
			this.name = name;
			this.@value = @value;
			this.next = next;
		}
		
		
		public readonly int hash;
		
		public readonly string name;
		
		public object @value;
		
		public global::haxe.lang.FieldHashConflict next;
		
	}
}



#pragma warning disable 109, 114, 219, 429, 168, 162
namespace haxe.lang {
	public sealed class FieldLookup {
		
		#pragma warning disable 628
		static FieldLookup() {
			global::haxe.lang.FieldLookup.length = ( global::haxe.lang.FieldLookup.fieldIds as global::System.Array ).Length;
		}
		
		
		public FieldLookup() {
		}
		
		
		protected static int[] fieldIds = new int[]{97, 98, 99, 102, 104, 105, 107, 109, 113, 115, 120, 121, 122, 22848, 22862, 23072, 23296, 23520, 23977, 1332402, 1821933, 4745537, 4846113, 4849249, 4899635, 4947588, 4949376, 4995541, 4996429, 5047484, 5049505, 5144726, 5145602, 5194459, 5243965, 5246186, 5343647, 5393365, 5442204, 5442212, 5443986, 5541879, 5594513, 5594516, 5693967, 5695307, 5741474, 5744817, 5745024, 5841808, 9342585, 10319920, 22835468, 24046298, 25738091, 42740551, 43737796, 46374763, 52644165, 57219237, 67856200, 67859554, 68006728, 72252782, 76061764, 78945784, 87367608, 96903864, 103479213, 108828507, 127488538, 132916898, 133414859, 142151465, 142301684, 151307603, 159136996, 172955042, 179047623, 188431961, 207609411, 208459108, 221637784, 222029606, 226931207, 234584065, 243225909, 244830897, 247036618, 252173918, 252174139, 252174360, 253048465, 261031087, 262801146, 274435967, 281751194, 288167040, 293985672, 302979532, 309502035, 311106773, 311106994, 312752480, 328878574, 334695532, 336655392, 341784511, 343868310, 350619104, 350619108, 353204262, 358990357, 359333139, 365188593, 376065817, 391692349, 400509660, 404153790, 407283053, 437335495, 451001976, 452737314, 465747725, 474209209, 474773467, 480756972, 481768284, 493819893, 499574632, 501039929, 502768344, 502769015, 520590566, 520665567, 528448451, 537630174, 540399897, 542823803, 572311959, 573867665, 589000550, 589599061, 591404329, 596483356, 598785079, 605915487, 610723709, 614073432, 625308696, 630156697, 640252688, 650414942, 651890926, 652994848, 666925948, 679246149, 694381261, 701410669, 703544457, 724060212, 727112898, 742854407, 744386181, 746281503, 772311838, 772312059, 784433846, 790737991, 813914181, 830800965, 834174833, 845179051, 855935792, 863972113, 877441228, 878103594, 887376854, 889051340, 893862549, 910198946, 912604165, 914669677, 922037898, 922671056, 925597908, 930986349, 930987020, 937267591, 942927226, 946786476, 993950564, 995006396, 1021796563, 1058556349, 1066783641, 1067353468, 1071652316, 1081380189, 1092171829, 1102715038, 1103412149, 1113806382, 1126920507, 1136381564, 1136381571, 1151917883, 1154932936, 1155848147, 1158359328, 1169995914, 1170195731, 1171620962, 1177754921, 1181037546, 1191633396, 1191829406, 1202522710, 1202718727, 1203028895, 1203218020, 1204059472, 1204816148, 1212528822, 1213952397, 1214305123, 1214453688, 1224901644, 1224901875, 1225098545, 1230265810, 1238832007, 1247723251, 1247875546, 1257164128, 1257939113, 1269206179, 1269254998, 1269755426, 1271070480, 1273207865, 1274465926, 1280345464, 1280549057, 1280638028, 1280638699, 1280845662, 1281093634, 1282943179, 1291436593, 1302870512, 1309344294, 1312666830, 1313416818, 1315911912, 1324505717, 1348037855, 1352270080, 1352786672, 1381630732, 1390395051, 1390578741, 1390578962, 1390579183, 1395555037, 1400771174, 1445635792, 1450762973, 1460447810, 1462163331, 1484998194, 1489662016, 1491961287, 1503920168, 1512997393, 1532710347, 1537812987, 1547539107, 1558459130, 1576149820, 1592770151, 1614780307, 1620824029, 1621420777, 1623148745, 1639293562, 1648581351, 1651365158, 1705629508, 1723805383, 1763375486, 1768164316, 1789423016, 1794072594, 1797611211, 1815533258, 1825849507, 1828505873, 1830310359, 1837892969, 1840455391, 1863724791, 1864494649, 1873474154, 1887596712, 1889717695, 1891834246, 1894423562, 1895567566, 1915412854, 1916009602, 1937159360, 1981972957, 2005380545, 2010580328, 2011811227, 2012934199, 2022294396, 2025055113, 2025238049, 2029008698, 2036759185, 2048392659, 2079583163, 2082663554, 2083500811, 2103468489, 2113708439, 2123232567, 2127021138};
		
		protected static string[] fields = new string[]{"a", "b", "c", "f", "h", "i", "k", "m", "q", "s", "x", "y", "z", "ff", "ft", "gg", "hh", "ii", "kt", "get_position", "isGlobal", "__a", "add", "arr", "buf", "cmn", "cur", "dev", "dir", "eof", "ext", "get", "gid", "hex", "idx", "ino", "key", "len", "map", "max", "min", "obj", "pop", "pos", "rol", "run", "set", "str", "sub", "uid", "fields", "first", "oneTimeEvents", "split", "exitCode", "flags", "flush", "readAll", "match", "compare", "stack", "start", "stdin", "helper", "remove", "__previousException", "filter", "merge", "progress", "repeat", "waitCount", "stderr", "stdout", "classString", "resize", "helperAdd", "matched", "getFullYear", "readString", "getHours", "isEmpty", "parseString", "__nativeException", "setLoop", "getString", "doEncode", "readBytes", "compareArg", "thread", "readInt16", "readInt24", "readInt32", "getUTCMinutes", "get_length", "mtime", "mutex", "setFloat", "stream", "releaseCount", "methodName", "setDouble", "readUInt16", "readUInt24", "get_native", "iterator", "indent", "toHex", "isBlocking", "dateUTC", "getData", "getDate", "set_position", "getUInt16", "lastIndexOf", "getUTCSeconds", "events", "writeFloat", "totlen", "replacer", "hasNext", "message", "keysLoop", "reverse", "promisedEventsCount", "addme", "tryAcquire", "nOccupied", "parseNumber", "getBytes", "nlink", "insert", "getInt32", "getInt64", "length", "addSub", "getTime", "get_message", "anyTime", "bigEndian", "native", "cancelled", "getDay", "getPid", "getMinutes", "balance", "previous", "sendMessage", "writeFullBytes", "matchedRight", "nextRun", "array", "writeString", "set_bigEndian", "atime", "invalidNumber", "getUTCDate", "interval", "__progress", "invalidChar", "getSeconds", "replace", "details", "readDouble", "insertEventByTime", "contains", "writeUInt16", "writeUInt24", "pretty", "getDouble", "nextRunTime", "__meta__", "value", "quotient", "bitOR", "__nativeStack", "lockObj", "fieldsString", "acquire", "messages", "regularEvents", "compareArgs", "statics", "isMainThread", "addBytes", "cachedIndex", "runPromised", "addInt32", "addInt64", "prepare", "cancel", "toString", "priority", "hashes", "releaseEvent", "_eof", "__exceptionStack", "splice", "exists", "args", "blit", "call", "copy", "date", "matchSub", "file", "fill", "storage", "removeLoop", "minBinding", "head", "ipad", "item", "getTimezoneOffset", "__skipStack", "join", "keys", "kill", "last", "left", "get_stack", "loop", "writeDouble", "concat", "backslash", "clear", "mode", "close", "newl", "next", "nind", "addString", "writeByte", "prev", "push", "keyValueIterator", "position", "rdev", "read", "root", "matchedPos", "current", "__shiftStack", "seek", "size", "setInt32", "setInt64", "sort", "stop", "quicksort", "tell", "ctime", "readFullBytes", "getUTCDay", "vals", "writeInt8", "wait", "write", "waitLock", "spliceVoid", "writeBytes", "writeInput", "writeInt16", "writeInt24", "writeInt32", "cachedKey", "readFloat", "eventHandler", "parseRec", "__ownStack", "delay", "getUTCMonth", "get_previous", "release", "objString", "posInfos", "concatNative", "nBuckets", "className", "nextEventAt", "quote", "childErrors", "offset", "__unsafe_get", "__unsafe_set", "indexOf", "lookup", "fileName", "getFloat", "toDynamic", "regex", "readByte", "right", "canSeek", "addDouble", "getDefault", "getMonth", "unwrap", "readMessage", "customParams", "nextChar", "readInt8", "nested", "addEvent", "readLine", "doParse", "get_canSeek", "_height", "bitAND", "bitXOR", "__get", "__set", "__hx_deleteField", "lineNumber", "getUTCHours", "readUntil", "promise", "modulus", "upperBound", "unshift", "setUInt16", "getUTCFullYear", "oneTimeEventsIdx", "_keys", "addFloat", "shift", "matchedLeft", "addByte", "addChar", "removeMinBinding", "slice"};
		
		protected static int length;
		
		public static void addFields(int[] nids, string[] nfields) {
			unchecked {
				int[] cids = global::haxe.lang.FieldLookup.fieldIds;
				string[] cfields = global::haxe.lang.FieldLookup.fields;
				int nlen = ( nids as global::System.Array ).Length;
				int clen = global::haxe.lang.FieldLookup.length;
				if (( ( nfields as global::System.Array ).Length != nlen )) {
					throw ((global::System.Exception) (global::haxe.Exception.thrown(global::haxe.lang.Runtime.concat(global::haxe.lang.Runtime.concat(global::haxe.lang.Runtime.concat("Different fields length: ", global::haxe.lang.Runtime.toString(nlen)), " and "), global::haxe.lang.Runtime.toString(( nfields as global::System.Array ).Length)))) );
				}
				
				bool needsChange = false;
				{
					global::cs._NativeArray.NativeArrayIterator<int> _g = new global::cs._NativeArray.NativeArrayIterator<int>(((int[]) (nids) ));
					while (_g.hasNext()) {
						int i = _g.next();
						if (( global::haxe.lang.FieldLookup.findHash(i, cids, clen) < 0 )) {
							needsChange = true;
							break;
						}
						
					}
					
				}
				
				if (needsChange) {
					lock(typeof(global::haxe.lang.FieldLookup)){
						int[] ansIds = new int[( clen + nlen )];
						string[] ansFields = new string[( clen + nlen )];
						int ci = 0;
						int ni = 0;
						int ansi = 0;
						while (true) {
							if ( ! ((( (( ci < clen )) ? (( ni < nlen )) : (false) ))) ) {
								break;
							}
							
							if (( cids[ci] < nids[ni] )) {
								ansIds[ansi] = cids[ci];
								ansFields[ansi] = ((string) (cfields[ci]) );
								ci = ( ci + 1 );
							}
							else {
								ansIds[ansi] = nids[ni];
								ansFields[ansi] = ((string) (nfields[ni]) );
								ni = ( ni + 1 );
							}
							
							ansi = ( ansi + 1 );
						}
						
						if (( ci < clen )) {
							global::System.Array.Copy(((global::System.Array) (cids) ), ((int) (ci) ), ((global::System.Array) (ansIds) ), ((int) (ansi) ), ((int) (( clen - ci )) ));
							global::System.Array.Copy(((global::System.Array) (cfields) ), ((int) (ci) ), ((global::System.Array) (ansFields) ), ((int) (ansi) ), ((int) (( clen - ci )) ));
							ansi = ( ansi + (( clen - ci )) );
						}
						
						if (( ni < nlen )) {
							global::System.Array.Copy(((global::System.Array) (nids) ), ((int) (ni) ), ((global::System.Array) (ansIds) ), ((int) (ansi) ), ((int) (( nlen - ni )) ));
							global::System.Array.Copy(((global::System.Array) (nfields) ), ((int) (ni) ), ((global::System.Array) (ansFields) ), ((int) (ansi) ), ((int) (( nlen - ni )) ));
							ansi = ( ansi + (( nlen - ni )) );
						}
						
						global::haxe.lang.FieldLookup.fieldIds = ansIds;
						global::haxe.lang.FieldLookup.fields = ansFields;
						global::haxe.lang.FieldLookup.length = ansi;
					}
					;
				}
				
			}
		}
		
		
		public static int doHash(string s) {
			unchecked {
				int acc = 0;
				{
					int _g = 0;
					int _g1 = s.Length;
					while (( _g < _g1 )) {
						int i = _g++;
						acc = ( ( ( 223 * (( acc >> 1 )) ) + ((int) (s[i]) ) ) << 1 );
					}
					
				}
				
				return ((int) (( ((uint) (acc) ) >> 1 )) );
			}
		}
		
		
		public static string lookupHash(int key) {
			unchecked {
				int[] ids = global::haxe.lang.FieldLookup.fieldIds;
				int min = 0;
				int max = global::haxe.lang.FieldLookup.length;
				while (( min < max )) {
					int mid = ( min + ( (( max - min )) / 2 ) );
					int imid = ids[mid];
					if (( key < imid )) {
						max = mid;
					}
					else if (( key > imid )) {
						min = ( mid + 1 );
					}
					else {
						return ((string) (global::haxe.lang.FieldLookup.fields[mid]) );
					}
					
				}
				
				throw ((global::System.Exception) (global::haxe.Exception.thrown(global::haxe.lang.Runtime.concat("Field not found for hash ", global::haxe.lang.Runtime.toString(key)))) );
			}
		}
		
		
		public static int hash(string s) {
			unchecked {
				if (( s == null )) {
					return 0;
				}
				
				int key = global::haxe.lang.FieldLookup.doHash(s);
				int[] ids = global::haxe.lang.FieldLookup.fieldIds;
				string[] fld = global::haxe.lang.FieldLookup.fields;
				int min = 0;
				int max = global::haxe.lang.FieldLookup.length;
				int len = global::haxe.lang.FieldLookup.length;
				while (( min < max )) {
					int mid = ((int) (( min + ( ((double) ((( max - min ))) ) / 2 ) )) );
					int imid = ids[mid];
					if (( key < imid )) {
						max = mid;
					}
					else if (( key > imid )) {
						min = ( mid + 1 );
					}
					else {
						string field = ((string) (fld[mid]) );
						if (( field != s )) {
							return  ~ (key) ;
						}
						
						return key;
					}
					
				}
				
				lock(typeof(global::haxe.lang.FieldLookup)){
					if (( len != global::haxe.lang.FieldLookup.length )) {
						return global::haxe.lang.FieldLookup.hash(s);
					}
					
					global::haxe.lang.FieldLookup.fieldIds = global::haxe.lang.FieldLookup.insertInt(global::haxe.lang.FieldLookup.fieldIds, global::haxe.lang.FieldLookup.length, min, key);
					global::haxe.lang.FieldLookup.fields = global::haxe.lang.FieldLookup.insertString(global::haxe.lang.FieldLookup.fields, global::haxe.lang.FieldLookup.length, min, s);
					 ++ global::haxe.lang.FieldLookup.length;
				}
				;
				return key;
			}
		}
		
		
		public static int findHash(int hash, int[] hashs, int length) {
			unchecked {
				int min = 0;
				int max = length;
				while (( min < max )) {
					int mid = ( (( max + min )) / 2 );
					int imid = hashs[mid];
					if (( hash < imid )) {
						max = mid;
					}
					else if (( hash > imid )) {
						min = ( mid + 1 );
					}
					else {
						return mid;
					}
					
				}
				
				return  ~ (min) ;
			}
		}
		
		
		public static void removeInt(int[] a, int length, int pos) {
			unchecked {
				global::System.Array.Copy(((global::System.Array) (a) ), ((int) (( pos + 1 )) ), ((global::System.Array) (a) ), ((int) (pos) ), ((int) (( ( length - pos ) - 1 )) ));
				a[( length - 1 )] = 0;
			}
		}
		
		
		public static void removeFloat(double[] a, int length, int pos) {
			unchecked {
				global::System.Array.Copy(((global::System.Array) (a) ), ((int) (( pos + 1 )) ), ((global::System.Array) (a) ), ((int) (pos) ), ((int) (( ( length - pos ) - 1 )) ));
				a[( length - 1 )] = ((double) (0) );
			}
		}
		
		
		public static void removeDynamic(object[] a, int length, int pos) {
			unchecked {
				global::System.Array.Copy(((global::System.Array) (a) ), ((int) (( pos + 1 )) ), ((global::System.Array) (a) ), ((int) (pos) ), ((int) (( ( length - pos ) - 1 )) ));
				a[( length - 1 )] = null;
			}
		}
		
		
		public static int[] insertInt(int[] a, int length, int pos, int x) {
			unchecked {
				int[] a1 = a;
				int capacity = ( a1 as global::System.Array ).Length;
				if (( pos == length )) {
					if (( capacity == length )) {
						int[] newarr = new int[( (( length << 1 )) + 1 )];
						( a1 as global::System.Array ).CopyTo(((global::System.Array) (newarr) ), ((int) (0) ));
						a1 = newarr;
					}
					
				}
				else if (( pos == 0 )) {
					if (( capacity == length )) {
						int[] newarr1 = new int[( (( length << 1 )) + 1 )];
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr1) ), ((int) (1) ), ((int) (length) ));
						a1 = newarr1;
					}
					else {
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (1) ), ((int) (length) ));
					}
					
				}
				else if (( capacity == length )) {
					int[] newarr2 = new int[( (( length << 1 )) + 1 )];
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr2) ), ((int) (0) ), ((int) (pos) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (newarr2) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					a1 = newarr2;
				}
				else {
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (a1) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (0) ), ((int) (pos) ));
				}
				
				a1[pos] = x;
				return a1;
			}
		}
		
		
		public static double[] insertFloat(double[] a, int length, int pos, double x) {
			unchecked {
				double[] a1 = a;
				int capacity = ( a1 as global::System.Array ).Length;
				if (( pos == length )) {
					if (( capacity == length )) {
						double[] newarr = new double[( (( length << 1 )) + 1 )];
						( a1 as global::System.Array ).CopyTo(((global::System.Array) (newarr) ), ((int) (0) ));
						a1 = newarr;
					}
					
				}
				else if (( pos == 0 )) {
					if (( capacity == length )) {
						double[] newarr1 = new double[( (( length << 1 )) + 1 )];
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr1) ), ((int) (1) ), ((int) (length) ));
						a1 = newarr1;
					}
					else {
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (1) ), ((int) (length) ));
					}
					
				}
				else if (( capacity == length )) {
					double[] newarr2 = new double[( (( length << 1 )) + 1 )];
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr2) ), ((int) (0) ), ((int) (pos) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (newarr2) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					a1 = newarr2;
				}
				else {
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (a1) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (0) ), ((int) (pos) ));
				}
				
				a1[pos] = x;
				return a1;
			}
		}
		
		
		public static object[] insertDynamic(object[] a, int length, int pos, object x) {
			unchecked {
				object[] a1 = a;
				int capacity = ( a1 as global::System.Array ).Length;
				if (( pos == length )) {
					if (( capacity == length )) {
						object[] newarr = new object[( (( length << 1 )) + 1 )];
						( a1 as global::System.Array ).CopyTo(((global::System.Array) (newarr) ), ((int) (0) ));
						a1 = newarr;
					}
					
				}
				else if (( pos == 0 )) {
					if (( capacity == length )) {
						object[] newarr1 = new object[( (( length << 1 )) + 1 )];
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr1) ), ((int) (1) ), ((int) (length) ));
						a1 = newarr1;
					}
					else {
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (1) ), ((int) (length) ));
					}
					
				}
				else if (( capacity == length )) {
					object[] newarr2 = new object[( (( length << 1 )) + 1 )];
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr2) ), ((int) (0) ), ((int) (pos) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (newarr2) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					a1 = newarr2;
				}
				else {
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (a1) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (0) ), ((int) (pos) ));
				}
				
				a1[pos] = ((object) (x) );
				return a1;
			}
		}
		
		
		public static string[] insertString(string[] a, int length, int pos, string x) {
			unchecked {
				string[] a1 = a;
				int capacity = ( a1 as global::System.Array ).Length;
				if (( pos == length )) {
					if (( capacity == length )) {
						string[] newarr = new string[( (( length << 1 )) + 1 )];
						( a1 as global::System.Array ).CopyTo(((global::System.Array) (newarr) ), ((int) (0) ));
						a1 = newarr;
					}
					
				}
				else if (( pos == 0 )) {
					if (( capacity == length )) {
						string[] newarr1 = new string[( (( length << 1 )) + 1 )];
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr1) ), ((int) (1) ), ((int) (length) ));
						a1 = newarr1;
					}
					else {
						global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (1) ), ((int) (length) ));
					}
					
				}
				else if (( capacity == length )) {
					string[] newarr2 = new string[( (( length << 1 )) + 1 )];
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (newarr2) ), ((int) (0) ), ((int) (pos) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (newarr2) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					a1 = newarr2;
				}
				else {
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (pos) ), ((global::System.Array) (a1) ), ((int) (( pos + 1 )) ), ((int) (( length - pos )) ));
					global::System.Array.Copy(((global::System.Array) (a1) ), ((int) (0) ), ((global::System.Array) (a1) ), ((int) (0) ), ((int) (pos) ));
				}
				
				a1[pos] = x;
				return a1;
			}
		}
		
		
		public static global::haxe.lang.FieldHashConflict getHashConflict(global::haxe.lang.FieldHashConflict head, int hash, string name) {
			while (( head != null )) {
				if (( ( head.hash == hash ) && ( head.name == name ) )) {
					return head;
				}
				
				head = head.next;
			}
			
			return null;
		}
		
		
		public static void setHashConflict(ref global::haxe.lang.FieldHashConflict head, int hash, string name, object @value) {
			global::haxe.lang.FieldHashConflict node = head;
			while (( node != null )) {
				if (( ( node.hash == hash ) && ( node.name == name ) )) {
					node.@value = @value;
					return;
				}
				
				node = ((global::haxe.lang.FieldHashConflict) (node.next) );
			}
			
			head = ((global::haxe.lang.FieldHashConflict) (new global::haxe.lang.FieldHashConflict(hash, name, @value, ((global::haxe.lang.FieldHashConflict) (head) ))) );
		}
		
		
		public static bool deleteHashConflict(ref global::haxe.lang.FieldHashConflict head, int hash, string name) {
			if (( head == null )) {
				return false;
			}
			
			if (( ( head.hash == hash ) && ( head.name == name ) )) {
				head = ((global::haxe.lang.FieldHashConflict) (head.next) );
				return true;
			}
			
			global::haxe.lang.FieldHashConflict prev = head;
			global::haxe.lang.FieldHashConflict node = head.next;
			while (( node != null )) {
				if (( ( node.hash == hash ) && ( node.name == name ) )) {
					prev.next = node.next;
					return true;
				}
				
				node = node.next;
			}
			
			return false;
		}
		
		
		public static void addHashConflictNames(global::haxe.lang.FieldHashConflict head, global::Array<string> arr) {
			while (( head != null )) {
				arr.push(head.name);
				head = head.next;
			}
			
		}
		
		
	}
}