René's URL Explorer Experiment


Title: PLF Library - queue

Description: plf::queue is a container that gives the programmer the functionality of a FIFO (first-in, first-out) queue. It is a more efficient drop-in replacement for std::queue, and faster than all std:: containers in the context of a queue.

Keywords:

direct link

Domain: www.plflib.org

HandheldFriendlyTrue
Nonetext/html; charset=UTF-8

Links:

Homehttps://www.plflib.org/
Introhttps://www.plflib.org/queue.htm#intro
Implementationhttps://www.plflib.org/queue.htm#details
Licensehttps://www.plflib.org/queue.htm#license
Downloadhttps://www.plflib.org/queue.htm#download
Function Descriptions and Syntaxhttps://www.plflib.org/queue.htm#functions
Benchmarkshttps://www.plflib.org/queue.htm#benchmarks
Frequently-asked Questionshttps://www.plflib.org/queue.htm#faq
Version Historyhttps://www.plflib.org/queue.htm#version
Contacthttps://www.plflib.org/queue.htm#contact
efficienthttps://www.plflib.org/queue.htm#benchmarks
benchmarkinghttps://www.plflib.org/queue_benchmarks_i5_gcc.htm
Benchmarkedhttps://www.plflib.org/queue.htm#benchmarks
chained-group memory allocation patternhttps://www.plflib.org/chained_group_allocation_pattern.htm
zlib licensehttps://en.wikipedia.org/wiki/Zlib_License
herehttps://www.plflib.org/plf_queue_13-05-2026.zip
repositoryhttps://github.com/mattreecebentley/plf_queue
plf benchmark suitehttps://www.plflib.org/plf_benchmark_suite_22-05-2026.zip
Erasablehttps://en.cppreference.com/w/cpp/named_req/Erasable
CopyAssignablehttps://en.cppreference.com/w/cpp/named_req/CopyAssignable
CopyConstructiblehttps://en.cppreference.com/w/cpp/named_req/CopyConstructible
Erasablehttps://en.cppreference.com/w/cpp/named_req/Erasable
MoveConstructiblehttps://en.cppreference.com/w/cpp/named_req/MoveConstructible
Allocatorhttps://en.cppreference.com/w/cpp/named_req/Allocator
herehttps://www.plflib.org/queue_benchmarks_i5_gcc.htm
Martin Valgurhttps://github.com/valgur

Viewport: width=device-width

URLs of crawlers that visited me.