I've been trying to learn rust but it's challenging. Would be awesome to see you explaining things (many of which you may consider trivial) and creating videos for people starting to write code in rust. Btw I consider your videos really interesting.
Rust binary search could return any matching entries. Historically, it's implemented so that it returns the last entry that matches, but that behavior was never stated by the documentation and is now broken. There is no equivalent of lower_bound and upper_bound in C++.
I think you have an issue with fork-version. It would be best to break the loop after you have handled the request (child-process). Otherwise, your end up that the system will kill you since you created too many processes. As I understand, the fork-server has to have one process (root process) that distributes work to fork-processes. Still, the worker will become a servant in the current implementation after finishing the request, and you can see it in the logs. timestamp: 12:17 Original PID: 56713 First child 56810 Next request root: 56713 -> everything is fine Next request root: 56810 -> Oops, served by the child Next request : 56713 -> everything is fine Next request: 56811 -> hello, new boy. I understand that it's just an example for understanding rather than a source, so it's just info to be aware of.
Also, it would be nice if you could link related videos. There is "View more" box to link videos when you mention them :) E.g.: tree -> th-cam.com/video/wDnI8liqD-o/w-d-xo.html
I've been trying to learn rust but it's challenging. Would be awesome to see you explaining things (many of which you may consider trivial) and creating videos for people starting to write code in rust. Btw I consider your videos really interesting.
Your explanation and video quality is improving. Gread job sir!
I think it's an excellent time to create a Patreon. Your videos are outstanding, so it would be nice to have the ability to give a penny for that :)
Rust binary search could return any matching entries. Historically, it's implemented so that it returns the last entry that matches, but that behavior was never stated by the documentation and is now broken. There is no equivalent of lower_bound and upper_bound in C++.
🍻🍻
I think you have an issue with fork-version. It would be best to break the loop after you have handled the request (child-process). Otherwise, your end up that the system will kill you since you created too many processes.
As I understand, the fork-server has to have one process (root process) that distributes work to fork-processes. Still, the worker will become a servant in the current implementation after finishing the request, and you can see it in the logs.
timestamp: 12:17
Original PID: 56713
First child 56810
Next request root: 56713 -> everything is fine
Next request root: 56810 -> Oops, served by the child
Next request : 56713 -> everything is fine
Next request: 56811 -> hello, new boy.
I understand that it's just an example for understanding rather than a source, so it's just info to be aware of.
The content is rich and I am learning a lot. Do you have a repository where we can see the code?
Is there any way to make a proxy from my phone ip? Like making my phone a proxy server.
Is the code codes available on some repository i can access?
nevermind, i found it
explanation is still not very clear but improved.
Also, it would be nice if you could link related videos. There is "View more" box to link videos when you mention them :)
E.g.: tree -> th-cam.com/video/wDnI8liqD-o/w-d-xo.html