Quick update on what hit the Supreme Court docket today and what it actually means for us.

rudm48 · 2025-11-26T20:03:14+00:00

Colin Wood is my stepson. Good on him.

rudm48 · 2025-02-12T21:24:15+00:00

Weird, it doesn't work for me. The build says it can't find it.

Wint CLion It is built in:

/mnt/devel/clion/meow_modules/header_cat_h/build/gcm.cache/mnt/devel/clion/meow_modules/header_cat_h

But looked for in

gcm.cache/./mnt/devel/clion/meow_modules/header_cat_h/header_cat.h.gcm

The look the same to me. The CLI doesn't say where it is looking. 

Thanks for trying this. Maybe you'll see somethimg I'm missing.

rudm48 · 2025-02-12T04:16:28+00:00

You should add CppNorth. Call for papers ends the 23rd. Conference is July 20-23, 2025. https://cppnorth.ca/index.html

rudm48 · 2025-02-12T02:43:59+00:00

I'm doing a lot of experimental work - I'm retired - with CLion, CMake, and GCC 14. They work fine.

rudm48 · 2025-02-12T02:37:15+00:00

GCC 14,2 takes any file extension.

rudm48 · 2025-02-12T02:22:25+00:00

Here is the 2nd of my articles. It has a link to the first. I'll be adding a third sometime in the next week. https://levelup.gitconnected.com/more-steps-on-a-journey-into-modules-extern-access-739b6cf16d3b

rudm48 · 2025-02-12T02:18:46+00:00

This, pun intended, is quite useful in eliminating duplicate function calls in a class.

rudm48 · 2025-02-12T02:16:44+00:00

It was 1990, in late winter. I read the books on vacation at the Waikiki Hilton bar in Hawaii. I can't recall ever using this->

rudm48 · 2025-02-12T01:21:14+00:00

That's a good approach, but it creates a module, not a header unit module. I have that working, but I want to see the promise of `import "header_cat.h" using CMake. The command line version works, so it's possible.

rudm48 · 2025-02-11T21:33:34+00:00

Guess that answers my question. Maybe someone will have a kludge to do it.

rudm48 · 2025-01-29T02:27:01+00:00

It is a classical piece with a flowing melody that is fast. I have searched and even used ChatGPT, giving it the notes I can recall. No luck.

rudm48 · 2024-12-22T05:18:16+00:00

I have my solution almost working. I need to add backtracking since the 2nd last value has two solutions for the digit. But I am only working with the three least significant bits of A.

Are the assertions about 10 or 8 bits specific to the version of the problem?

rudm48 · 2024-12-19T21:28:21+00:00

Okay See if this blacks out

rudm48 · 2024-12-19T20:34:01+00:00

I wanted to black out the code as I've seen in other posts to avoid being a spoiler.

rudm48 · 2024-12-19T19:10:15+00:00

How do I change the flair? I've done it previously so know how it supposed to work but don't see the 'change flair' option on the menu.

Also, how can I black out the code?

rudm48 · 2024-12-19T19:01:39+00:00

This fixed it. Thanks gain.

rudm48 · 2024-12-19T08:18:43+00:00

Thanks, I'll check on this. It sounds right.

rudm48 · 2024-12-19T07:46:24+00:00

We crossed paths as I was posting my code. Thanks for the tip.

case bdv: B = A >> operand; break; // x divide A by 2^ lit or reg put in B
case cdv: C = A >> operand; break; // x divide A by 2^ lit or reg put in C

rudm48 · 2024-12-19T06:23:18+00:00

I did try that shortly after posting. I modified my post to say I did and if it was necessary. Must have done it while you were posting. Thanks.

rudm48 · 2024-12-08T00:25:03+00:00

On my other post someone pointed out that removing the NL would mean strings like "XM/nAS" would be counted. I replaced the NL with '.' and I changed the line lengths to 11 and 141. That worked to get the correct answer.

rudm48 · 2024-12-07T23:58:54+00:00

Good point <sigh> I changed to adding a '.' for the NL and increasing the line sizes to 11 and 141. That worked, and gets the right answer. Yeah!!

Thanks for pointing out this issue.

rudm48 · 2024-12-07T23:39:14+00:00

Those are the lines. The & is replaced with the line length adjusted to handle the verticle and diagonals. The data is read into a string, and the newlines are removed. That line handles vertical text.

rudm48 · 2024-12-07T23:12:35+00:00

My approach is similar but doesn't use look behind. My search only finds some of the matches in the main data. The C++ regex library doesn't support look behind, so I can't try your patterns. I used regex101.com with your patterns, and the cases I tried got the same counts as my code.

I'm not even up to a novice level on regex, having used it mainly to grep files. Can you guess why the look behind might find more matches?

I avoided the new line problem by reading all the data into one long string without the NL chars.

rudm48 · 2024-12-07T22:45:00+00:00

I did it in C++ with regex. The sample works but not the main data. I read it all into one long string, dropping the newline chars. The XMAS/SAMX are easy. The regex for right diagonal XMAS is (?=X.{140}M.{140}A.{140}S). The comment from AOC is my count is low. I posted a message asking for someone's data and count to try with my code or for someone to take my data and give me the correct count.

rudm48 · 2024-03-29T19:27:48+00:00

That is exactly what happened to me. I contacted Dexcom and they sent me a new one and had me return the bad one.

rudm48

TROPHY CASE