enumeration

Consider: using System; public class Test { enum State : sbyte { OK = 0, BUG = -1 } static void Main(string[] args) { var s = new State[1, 1]; s[0, 0] = State.BUG; State a = s[0, 0]; Console.WriteLine(a == s[0, 0]); // False } } How can this be explained? It occurs in debug builds in Visual Studio 2015 when running in the x86 JIT. A release build or running in the x64 JIT prints True as expected. To reproduce from the command line: csc Test.cs /platform:x86 /debug ( /debug:pdbonly , /debug:portable and /debug:full also reproduce.) You found a code generation bug in the .NET 4 x86 jitter. It is

In MSDN it says that RegEnumValue should not be used when calling function that change the registry keys being enumerated. So does this also apply to deleting registry key values? Like this code does: if (RegOpenKeyEx(m_hkey,m_path.c_str(),0,KEY_ALL_ACCESS,&key) == ERROR_SUCCESS) { bool error=false; idx=0; while (RegEnumValue(key,idx,name,&namesize,NULL,NULL,NULL,NULL) == ERROR_SUCCESS && !error) { error=(RegDeleteValue(key,name)!=ERROR_SUCCESS); idx++; } RegCloseKey(key); } Your code does not work. When you delete index 0, the next item becomes index 0, and you do not delete that. So yes, it

I consider myself a JS veteran but just now for the first time I have realised that the for ... in loop does something very different from the in operator: "length" in []; // true for (k in []) { if(k == "length") alert(); }; // k will never be "length" So this brings me to my question: why is the in operator at all present in the for ... in loop? Imho it is totally misleading, as it does different things. Also the notion that first the for operation makes the JS engine take all enumerable properties and then on that subset the in operator is used is imho wrong: simply because the in operator

In my Python 2.7.2 IDLE interpreter: >>> mylist = [1, 2, 3, 4, 5] >>> for item in mylist: mylist.remove(item) >>> mylist [2, 4] Why? It's because when you iterate over a list, python keeps track of the index in the list . Consider the following code instead: for i in range(len(mylist)): if i >= len(mylist): break item = mylist[i] mylist.remove(item) If we track this (which is essentially what python is doing in your code), then we see that when we remove an item in the list, the number to the right shifts one position to the left to fill the void left when we removed the item. The right item

I have an array: a = [1, 2, 3, 3, 6, 8, 1, 9] I want to display each unique element value and its associated element count like this: 1: 2 2: 1 3: 2 6: 1 8: 1 9: 1 So far I have: a.sort.group_by { |x| x } { 1 => [ [0] 1, [1] 1 ], 2 => [ [0] 2 ], 3 => [ [0] 3, [1] 3 ], 6 => [ [0] 6 ], 8 => [ [0] 8 ], 9 => [ [0] 9 ] } So each element of the Hash contains an array. I can use that array's count to get my answer, but I'm having trouble figuring out how to process the hash concisely. Is this a horrible implementation? a.sort.group_by { |x| x }.each {|x| puts "#{x[0]} #{x[1].count}" } How about: a