Skip to content
cpphinditutorials.com
cpphinditutorials.com

What are You Looking For?

Trending News

Deep Recursion Does Not Fail Gracefully

Deep Recursion Does Not Fail Gracefully

on October 28, 2026
Posted by Ruaridh Kensington-Oyelaran
Passing by Value Is Sometimes the Fastest Option

Passing by Value Is Sometimes the Fastest Option

on October 28, 2026October 28, 2026
Posted by Ruaridh Kensington-Oyelaran
Shared Pointer Costs an Atomic Increment You Can Often Avoid

Shared Pointer Costs an Atomic Increment You Can Often Avoid

on October 25, 2026
Posted by Ruaridh Kensington-Oyelaran
  • About Us
  • Contact Us
  • Disclaimer
  • Privacy Policy
  • Terms and Conditions
© All rights reserved. Proudly powered by WordPress. Theme NewsMaster designed by WPInterface.
  • Home
  • Memory

Memory

42 posts
Passing by Value Is Sometimes the Fastest Option
Posted in Memory

Passing by Value Is Sometimes the Fastest Option

on October 28, 2026October 28, 2026
Ruaridh Kensington-Oyelaran
Shared Pointer Costs an Atomic Increment You Can Often Avoid
Posted in Memory

Shared Pointer Costs an Atomic Increment You Can Often Avoid

on October 25, 2026
Ruaridh Kensington-Oyelaran
Volatile Was Designed for Hardware Registers, Not Concurrency
Posted in Memory

Volatile Was Designed for Hardware Registers, Not Concurrency

on October 14, 2026October 21, 2026
Ruaridh Kensington-Oyelaran
Your Writes Do Not Reach Other Threads in the Order You Wrote Them
Posted in Memory

Your Writes Do Not Reach Other Threads in the Order You Wrote Them

on October 5, 2026October 12, 2026
Ruaridh Kensington-Oyelaran
Two Threads Writing Adjacent Variables Fight Over One Cache Line
Posted in Memory

Two Threads Writing Adjacent Variables Fight Over One Cache Line

on September 28, 2026September 28, 2026
Ruaridh Kensington-Oyelaran
Splitting One Struct Into Five Arrays Can Double Throughput
Posted in Memory

Splitting One Struct Into Five Arrays Can Double Throughput

on September 23, 2026September 23, 2026
Ruaridh Kensington-Oyelaran
The Same Algorithm Runs Ten Times Faster in a Different Layout
Posted in Memory

The Same Algorithm Runs Ten Times Faster in a Different Layout

on September 19, 2026September 26, 2026
Ruaridh Kensington-Oyelaran
Where Your Arguments Live Depends on the Platform
Posted in Memory

Where Your Arguments Live Depends on the Platform

on September 10, 2026
Ruaridh Kensington-Oyelaran
Malloc Is a Data Structure, Not a System Call
Posted in Memory

Malloc Is a Data Structure, Not a System Call

on September 3, 2026September 3, 2026
Ruaridh Kensington-Oyelaran
A Union Without a Tag Is a Bug You Have Not Hit Yet
Posted in Memory

A Union Without a Tag Is a Bug You Have Not Hit Yet

on August 26, 2026
Ruaridh Kensington-Oyelaran

Posts navigation

← Older Articles

Recent Posts

  • Deep Recursion Does Not Fail Gracefully
  • Passing by Value Is Sometimes the Fastest Option
  • Shared Pointer Costs an Atomic Increment You Can Often Avoid
  • Braces Prevent Narrowing and Cause Surprises in Equal Measure
  • The Stack Is Faster Because It Never Has to Search

Recent Comments

No comments to show.

Archives

  • October 2026
  • September 2026
  • August 2026
  • July 2026
  • June 2026
  • May 2026
  • April 2026
  • March 2026
  • February 2026
  • January 2026

Categories

  • Build Tools
  • Concurrency
  • Fundamentals
  • Memory
  • STL

No widgets added yet. Add widgets on Off-canvas Drawer .

© All rights reserved. Proudly powered by WordPress. Theme NewsMaster designed by WPInterface.