First, please read here for information on regular expressions. It’s worth learning. You can use this: Regex.Replace(“This is a test string, with lots of: punctuations; in it?!.”, @”[^\w\s]”, “”); Which means: [ #Character block start. ^ #Not these characters (letters, numbers). \w #Word characters. \s #Space characters. ] #Character block end. In the end it … Read more
The speed at which you can quickly recall language syntax, common library functions, and best practice patterns is directly proportional to the amount of time you spend using them. In other words you will find yourself getting faster the more you do it.
Pick a safe starting point. Can be e.g. the endpoint with maximum x. March along the line segment. Upon encountering any intersection, always turn left and march along this new segment. Upon encountering an endpoint, record it. Goto 2. Stop when you have returned to your starting point. Your list of recorded endpoints now makes … Read more
Not a solution, just a brainstorming idea: IIRC one common way to get approximate solutions to the TSP is to start with a random configuration, and then applying local operations (e.g. “swapping” two edges in the path) to try and get shorter and shorter paths. (Wikipedia link) I think something similar would be possible here: … Read more
Your code gets compiled before execution, at that step your variable will be replaced by the actual reference of the space where the value will be stored. This at least is the general principle. In reality it will be way more complecated, but still the same basic idea.
You should have a look at Parsedown. It parses Markdown text the way people do. First, it divides texts into lines. Then it looks at how these lines start and relate to each other. Finally, it looks for special characters to identify inline elements.
The word pure has different meanings in different contexts. Functional Programming When people talk about Haskell being a pure language, they mean that it has referential transparency. That is, you can replace any expression with its value without changing the meaning of the program. For example, in Haskell: square :: Int -> Int square x … Read more
Why is this happening? Trigonometric functions generally expect units in radians, while 90 is in degrees. This also applies for other functions such as cosine and tangent, not just the sine function. Most programming languages require trigonometric functions to provide their arguments in radians. This simplifies many things, especially on the implementation side as code … Read more
1.0 is the only case that can go wrong, so handle that case separately: b = floor(f >= 1.0 ? 255 : f * 256.0) Also, it might be worth forcing that f really is 0<=f<=1 to avoid incorrect behaviour due to rounding errors (eg. f=1.0000001). f2 = max(0.0, min(1.0, f)) b = floor(f2 == … Read more
If the code needs to run even when any other code throws an exception, then the finally block is the correct solution. If it need not run in the case of an exception (i.e. it’s only necessary for “normal” returns), then using finally would be abusing the feature. Personally I’d rewrite that method in the … Read more