Comments by "yapdog" (@yapdog) on "ThePrimeTime"
channel.
-
152
-
25
-
25
-
23
-
21
-
21
-
17
-
15
-
12
-
11
-
8
-
8
-
8
-
7
-
7
-
7
-
7
-
6
-
6
-
6
-
6
-
5
-
5
-
5
-
5
-
@Asto508 So, you think that because I still write in C that I missed the changes in languages? Interesting assumption. Others might assume that I'm pretty good at what I do, where changes in languages are irrelevant. 🤷♂ Here's the truth: languages are just interfaces. No advance in languages award skills: you still need to know not just how to program, but what should be programmed.
Any programmer who uses C for any length of time, developing anything of note, will gain not just skills over that time, but will create tools and libraries to make the job easier. Most of what gets developed for other languages tend to be outgrowths of that, i.e. they tend to prevent the user from doing dumb sh!t. Rust is just a newer outgrowth. Even so, some long-time C coders may see tool/methodology development as a hindrance. Also, pointers, for example, can be the bane of even some of the most seasoned C coders' existence. None of that is true for me.
I have gained a level of discipline with C that would probably drive others mad. I have developed my own set of tools that allow me the freedom to not have to worry about pointers during regular coding, while allowing me to do some really dangerous sh!t when I need it. I don't need someone else's predefined parameters to keep me constrained in order to write good code and solve problems (<--that's what it's all about).
Again, languages are just interfaces. If advances, i.e. language features, are what move you, great. But don't mistake those advances for skill or competence in problem-solving.
5
-
5
-
5
-
4
-
4
-
4
-
4
-
4
-
4
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
3
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
I created my own regex engine that's not susceptible to that kind of error. This classic test regex from Rexegg:
"^(A+)*B"
With that pattern, a string as simple as "AAAAAAAAAAC" would require 3,584 steps. But a string with 100 A's followed by 1 C would cause a catastrophic backtracking failure, requiring 4,436,777,100,798,802,905,238,461,218,816 steps. Those numbers scared the sh!t out of me!😱 And if they don't scare you, then you haven't been paying attention.
I finally just dumped all the standard regex models and built one completely from scratch (yes, in C😛). My engine significantly reduces the amount of backtracking: the 100 A string is resolved in just 1295 steps. 😁😁😁I'm still benchmarking it, but this engine is incredibly promising.........🤞
1
-
1
-
1
-
1
-
1
-
1