Main Navigation Home C++ Basics CS Fundamentals Low Latency C++

Appearance

Sidebar Navigation

C++ Fundamentals

Virtual Functions and Inheritance

L-values and R-values

Copy-Move Elision

RAII

Smart Pointers

Rule of Five

Coding Problems

CPU Core Allocation Problem

Variable-Length Integer Encoding

Progressive Binary Search

Efficient itoa Implementation

Templates

Templates & Type Deduction

Variadic Templates

Perfect Forwarding

Nth Argument Access

Simple unique_ptr

Simple Tuple Implementation

shared_ptr with Custom Deleter

Multithreading

Launching Threads

Race Conditions & Mutexes

Condition Variables & Unique Lock

Atomic Operations

Memory Ordering

Compare-Exchange & Lock-Free Algorithms

Spinlock

False Sharing & Cache Performance

Queues

Linked List based Queue

Memory-Pooled Linked List Queue

Array based Queue

Resizing Array based Queue

Segmented Deque

Multithreaded Queues

Linked List Based SPSC Blocking Queue

Linked List Based MPMC Blocking Queue

Array-Based MPMC Blocking Queue

SPSC Lock-Free Queue

MPSC Lock-Free Queue

Array-Based MPSC Lock-Free Queue

System Design Basics

Design LRU Cache

Packed Struct Offset Lookup

Design LFU Cache

System Design Advanced

Order Book Implementation

Content Scheduler

Templates Advanced

Type Traits and Metafunctions

constexpr, consteval, and if constexpr

CRTP

On this page

Queues

Linked List based Queue
Memory-Pooled Linked List Queue
Array based Queue
Resizing Array based Queue
Segmented Deque

Pager

Next pageVirtual Functions and Inheritance

Mark as complete

Queues ​

Queues