corneliusdavid

You'd have to create an issue on the Github repository and wait for someone to fix it--or better yet, clone it, fix it yourself, and create pull request!

Thank you, @havrlisan, for the plug for my book. I wrote that specifically for the Delphi programmer who already has VCL experience and wants to leverage their knowledge to expand to other platforms. I also have Andrea Magni's book and it's an excellent deep-dive into understanding and working with Firemonkey. Be aware that Linux development with Delphi requires at least the Enterprise version and does not officially support Firemonkey (yet).

I sent Tim an email about month ago. It took him a week but he did reply. I imagine the reply would've been quicker if I was a current customer.

I've done that in the past as well. In fact, there's a component in my Github library, CloseApplication, to do that. I don't know the habits or the code on this current project well enough to confidently apply that yet. For example, if I set a 3-hour timeout but someone is still in the office at 7:00 PM and I'm wanting to update at 9:00 PM, then the app could still be open. I like the idea of being able to "Remotely stop applications with user notifications." Now, my only problem is that this old project I've inherited is still in Delphi 7--this App Watcher component is in D12 so I probably can't use it yet.

Yes, and I've done that as well in some situations but I want the users to run the updated version the next day when they come into the office; if they left it running, they'll still be using the old version still in memory. Of course, I could add something that checks every minute or so and prompts to restart the app or something. Or use this--thanks for the link. So many choices!

This looks like a great solution to add to a project I inherited where the users are accustomed to running the app from a network server. I have access to the server to manage the database and update the app but sometimes they leave it running at the end of the day which locks the app from being updated.

That's what I was tempted to do as well and got part 1 done relatively quickly using that method. BUT BEWARE! It's a trap! As soon as you gleefully submit the correct answer and see what you have to do for part 2, your heart sinks because ... Instead, you have to analyze the problem, learn the patterns, then then craft something much more intelligent--in other words, more time than I had.

AoC 2024 Day 04 Part 1 I finally finished this puzzle a week after I posted this. I was so close but the small test was not getting the right answer until I added a row of "Q"s around the entire perimeter of the 2-D array (extra row top and bottom, extra column at the start and end of each row); I must've had an off-by-one error somewhere but could not see it. These challenges are definitely outside of the normal tasks I have to do at my day job; but I like stretching my mind!

There is 0.01% chance of that happening. There are still many parts of today's IDE similar to Delphi 1 from 30 years ago and even Borland Pascal before that. Some of the same hot keys and many of the sub-windows in the IDE. There are often additions and incremental changes and subtle (and not so subtle) ways of interacting but there's just too much that would need to be re-tested if they made a huge interface change. The Welcome Page has been where the bulk of the "pull the rug out from under you" changes have taken place and that's not a critical part of the daily programming task.

There's a key phrase in the explanatory text for this problem: "The asteroids are much smaller than they appear on the map, and every asteroid is exactly in the center of its marked position." So if we assume a scale like a baseball field is the square area and a golf ball in the very middle is the asteroid, then the only time an asteroid would block the view from another asteroid is if there is a DIRECT line through it; in other words, only vertical, horizontal or diagonal lines crossing another asteroid. Therefore, any asteroid whose view angle to another asteroid does not fit that is assumed to be visible. And therefore, yes, I believe this is correct.

Even if some tricky function were called to return the number of characters in a string, at some lowest point, there would still need to be an iterator to check each character. The only thing I'd say about your code is you have an unnecessary variable (ch) and character assignment (ch := s[c]). I suppose one "trick" to make your code shorter would be to replace all periods with blanks leaving a line with just hashtags; then you could simply get the Length of the line to get the count of asteroids in that line, something like this (not tested): s := StringReplace(m1.Lines.Strings[r], '.', '', [rfReplaceAll]); Inc(ac, s.Length);

LOL! No worries. Now it makes sense. I found Day 10 of 2024 to be fairly simple. It's one of the few I actually completed both parts 1 and 2. I haven't had time to finish 2024 nor look at any prior years.

Day 10 (of AoC 2024) is about trailheads, not asteroids. Are you looking at a different day or year?

comment removed.

Got it! Can't wait to dive into it and trust it'll be as good as your other books. Some of the chapter titles look like they'll provide good arguments to support the best practices I'm trying to promote to my team. Thanks, Dalija!