A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.

Overview
You might also like...
Variant - C++17 `std::variant` for C++11/14/17

MPark.Variant C++17 std::variant for C++11/14/17 Introduction MPark.Variant is an implementation of C++17 std::variant for C++11/14/17. Based on my im

Finite State Machine implementation using std::variant

mp::fsm Implementation of Finite State Machine presented by me on CppCon 2018 in a talk Effective replacement of dynamic polymorphism with std::varian

Replacements to standard numeric types which throw exceptions on errors

safe_numerics Arithmetic operations in C++ are NOT guaranteed to yield a correct mathematical result. This feature is inherited from the early days of

A Simple Stack Machine VM
A Simple Stack Machine VM

Arkam - Stack Machine VM Purposes Build small cli tools Sound/Graphic tinkering environment Status 2021-05-06 start Influenced by uxn Mako Retro Neste

Own implementation of a linked list stack in C++.

Linked-List-Stack-CPP Own implementation of a linked list stack in C++. This is my manual implementation of a linked list stack. This stack is abstrac

Like neofetch, but much faster because written in c. Only Linux.
Like neofetch, but much faster because written in c. Only Linux.

fastfetch fastfetch is a neofetch like tool for fetching system information and displaying them in a pretty way. It is written in c to achieve much be

This is like Inverting Binary Tree, but instead of a Binary Tree it's a File Tree.
This is like Inverting Binary Tree, but instead of a Binary Tree it's a File Tree.

Invert File Tree in C++ This is like Inverting Binary Tree, but instead of the Binary Tree it's a File Tree. This is intended as a simple exercise to

Another neofetch-like utility but this time it's fast.

SystemFetch Another neofetch-like utility but this time it's fast. Example Speed Here is a table of the time it took to execute all of these programs,

Strong typedef - A class template that creates a new type that is distinct from the underlying type, but convertible to and from it

jss::strong_typedef Tag, ValueType, Properties... This is an implementation of a C++17 class template that provides a wrapper type that is convertib

Comments
  • change_group_sizes and related functions not available.

    change_group_sizes and related functions not available.

    Hello !! After a couple compilation error, I did a simple crtl-F on my file and in the repository. it seems that change_group_sizes and alike are not present anymore, but are still documented on your website. I don't have an urgent need, but it would be great to know if they are going to be added soon/ removed. My repo version dates from 19/09/2020, so this problem is present at least from this point in time. I will update my repo.

    opened by cppmadguy 3
  • Compilation error with clang:

    Compilation error with clang: "error: expected expression"

    Compilation of the example in https://plflib.org/stack.htm fails with clang (at least clang 11) on Linux, since 1.61:

    /home/conan/w/prod/BuildSingleReference/.conan/data/plf_stack/1.62/_/_/package/5ab84d6acfe1f23c4fae0ab88f26e3a396351ac9/include/plf_stack.h:901:6: error: expected expression
                                            if PLF_CONSTEXPR (std::is_standard_layout<stack>::value && (std::is_trivially_copyable<allocator_type>::value || std::allocator_traits<allocator_type>::is_always_equal::value) &&
                                            ^
    1 error generated.
    
    opened by SpaceIm 1
Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).

M*LIB: Generic type-safe Container Library for C language Overview M*LIB (M star lib) is a C library enabling to use generic and type safe container i

PpHd 553 Nov 21, 2022
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes

The Piecewise Geometric Model index (PGM-index) is a data structure that enables fast lookup, predecessor, range searches and updates in arrays of bil

Giorgio Vinciguerra 643 Nov 22, 2022
Cross-platform STL-styled and STL-compatible library with implementing containers, ranges, iterators, type traits and other tools; actors system; type-safe config interface.

Yato A small repository where I'm gatherting useful snippets and abstractions for C++ development. Yato includes 3 main modules: multidimensional cont

Alexey 9 Jul 22, 2022
Allocator Aware Containers Made Easy

Custom Allocator Aware containers made easy with "wit" Have you ever looked at the allocator specification and thought about how hard it would be to

Darth Rubik 4 Sep 25, 2021
A family of header-only, very fast and memory-friendly hashmap and btree containers.

The Parallel Hashmap Overview This repository aims to provide a set of excellent hash map implementations, as well as a btree alternative to std::map

Gregory Popovitch 1.7k Nov 25, 2022
Sorting data on a stack with a limited set of instructions

push_swap Sorting data on a stack with a limited set of instructions Final Score: 125/100 Average 100 set speed: 575 Actions (Minimum 490 / Maximum 61

null 14 Nov 22, 2022
Data Structure Studying Group: array, linked list, stack, queue, deque, tree, graph. Summary of these concepts are descripted in the markdown files.

DATA_STRUCTURE STUDY ?? CURRICULUM ✔️ Day1 array linked list ✔️ Day2 circular linked list double linked list polynomial addtion reverse linked list ✔️

Soyeon Kim 3 Jul 22, 2022
Benchmarking a trivial replacement for std::vector

std::vector replacement benchmark Dependencies You'll need gnuplot and bash to run ./bench.sh. In addition to that, you'll need to have gcc and clang

Dale Weiler 9 Aug 27, 2022
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on average. 20-24% speed increase in use-case testing.

plf::list A drop-in replacement for std::list with (on average): 293% faster insertion 57% faster erasure 17% faster iteration 77% faster sorting 70%

Matt Bentley 117 Nov 8, 2022