Here is a real world example: Fixed point multiplies on old compilers. These don’t only come handy on devices without floating point, they shine when it comes to precision as they give you 32 bits of precision with a predictable error (float only has 23 bit and it’s harder to predict precision loss). i.e. uniform … Read more
A lot of people are saying that once you get to the size where speed is actually a concern that HashSet<T> will always beat List<T>, but that depends on what you are doing. Let’s say you have a List<T> that will only ever have on average 5 items in it. Over a large number of … Read more
Executive summary: No. i++ could potentially be slower than ++i, since the old value of i might need to be saved for later use, but in practice all modern compilers will optimize this away. We can demonstrate this by looking at the code for this function, both with ++i and i++. $ cat i++.c extern … Read more
Stack allocation is much faster since all it really does is move the stack pointer. Using memory pools, you can get comparable performance out of heap allocation, but that comes with a slight added complexity and its own headaches. Also, stack vs. heap is not only a performance consideration; it also tells you a lot … Read more
public static string Reverse( string s ) { char[] charArray = s.ToCharArray(); Array.Reverse(charArray); return new string(charArray); }
It depends how exceptions are implemented. The simplest way is using setjmp and longjmp. That means all registers of the CPU are written to the stack (which already takes some time) and possibly some other data needs to be created… all this already happens in the try statement. The throw statement needs to unwind the … Read more
Finally, Microsoft SQL Server 2012 was released, I really like its simplicity for a pagination, you don’t have to use complex queries like answered here. For getting the next 10 rows just run this query: SELECT * FROM TableName ORDER BY id OFFSET 10 ROWS FETCH NEXT 10 ROWS ONLY; https://docs.microsoft.com/en-us/sql/t-sql/queries/select-order-by-clause-transact-sql#using-offset-and-fetch-to-limit-the-rows-returned Key points to consider … Read more
You can use the List.addAll() method. It accepts a Collection as an argument, and your set is a Collection. List<String> mainList = new ArrayList<String>(); mainList.addAll(set); EDIT: as respond to the edit of the question. It is easy to see that if you want to have a Map with Lists as values, in order to have … Read more
For graphics, I’d rather not prefer integers. Many systems use integers for UI painting (pixels are ints after all), but macOS, for example, uses float for everything. macOS only knows points and a point can translate to one pixel, but depending on monitor resolution, it might translate to something else. On retina screens half a … Read more
Solution in different C# versions C# 8 with at least .NET Core 3.0 or .NET Standard 2.1 public static class StringExtensions { public static string FirstCharToUpper(this string input) => input switch { null => throw new ArgumentNullException(nameof(input)), “” => throw new ArgumentException($”{nameof(input)} cannot be empty”, nameof(input)), _ => string.Concat(input[0].ToString().ToUpper(), input.AsSpan(1)) }; } Since .NET Core … Read more