Explore >> Select a destination
|
You are here 
|
cppstories.com | ||
| | | | |
berthub.eu
|
|
| | | | | Welcome back! In part 4 we went over the nitty-gritty of lambdas and how to store them, we explored the relation between the various C++ algorithms and containers, plus we took a stroll through some non-standard containers with exceptional capabilities. Note: part 1 is here. In this probably final part 5, we'll be going over some of the most powerful stuff in modern C++: "perfect" reference counting and the concept of std::move. | |
| | | | |
binarydebt.wordpress.com
|
|
| | | | | System call table is an array of function pointers. It is defined in kernel space as variable sys_call_table and it contains pointers to functions which implement system calls. Index of each function pointer in the array is the system call number for that syscall. These are denoted by NR_* macros in header files, such as... | |
| | | | |
www.bfilipek.com
|
|
| | | | | Some time ago I covered how to use custom deleters with smart pointers. The basic idea is to specify a dedicated method that will be called when a pointer is released. One logical application of custom deleters might be resource handles like files or the WinApi HANDLE type. Lets see how can we implement such thing. | |
| | | | |
scottlocklin.wordpress.com
|
|
| | | Reversible computing is interesting as a concept. There is something called the Landauer limit, which back in 2010 I used to calculate the thermodynamic limits of AI versus the human brain. The idea here is, every bit has some minimal amount of entropy involved in its destruction. Dissipating entropy creates heat. All computers destroy bits... | ||
