<commit_before>CDS C++ library
===============
[![GitHub version](https://badge.fury.io/gh/khizmax%2Flibcds.svg)](http://badge.fury.io/gh/khizmax%2Flibcds)
[![Code Health](https://landscape.io/github/khizmax/libcds/dev/landscape.svg?style=plastic)](https://landscape.io/github/khizmax/libcds/dev)
[![Coverity Scan Build Status](https://scan.coverity.com/projects/4445/badge.svg)](https://scan.coverity.com/projects/4445)

The Concurrent Data Structures (CDS) library is a collection of concurrent containers
that don't require external (manual) synchronization for shared access, and safe memory reclamation (SMR) 
algorithms like [Hazard Pointer](http://en.wikipedia.org/wiki/Hazard_pointer) 
and user-space [RCU](http://en.wikipedia.org/wiki/Read-copy-update). 
CDS is mostly header-only template library. Only SMR core implementation is segregated to .so/.dll file.

The library contains the implementations of the following containers:
  - [lock-free](http://en.wikipedia.org/wiki/Non-blocking_algorithm) stack with optional elimination support
  - several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,
    the flat combining queue, the segmented queue.
  - several implementation of unordered set/map - lock-free and fine-grained lock-based
  - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique
  - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)
  
Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to 
*cds::intrusive* and *cds::container* namespace respectively.<commit_msg>Revert "Added Landscape.io badge"<commit_after>CDS C++ library
===============
[![GitHub version](https://badge.fury.io/gh/khizmax%2Flibcds.svg)](http://badge.fury.io/gh/khizmax%2Flibcds)
[![Coverity Scan Build Status](https://scan.coverity.com/projects/4445/badge.svg)](https://scan.coverity.com/projects/4445)

The Concurrent Data Structures (CDS) library is a collection of concurrent containers
that don't require external (manual) synchronization for shared access, and safe memory reclamation (SMR) 
algorithms like [Hazard Pointer](http://en.wikipedia.org/wiki/Hazard_pointer) 
and user-space [RCU](http://en.wikipedia.org/wiki/Read-copy-update). 
CDS is mostly header-only template library. Only SMR core implementation is segregated to .so/.dll file.

The library contains the implementations of the following containers:
  - [lock-free](http://en.wikipedia.org/wiki/Non-blocking_algorithm) stack with optional elimination support
  - several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,
    the flat combining queue, the segmented queue.
  - several implementation of unordered set/map - lock-free and fine-grained lock-based
  - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique
  - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)
  
Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to 
*cds::intrusive* and *cds::container* namespace respectively.
{'fraction_non_alphanumeric': 0.12849341471249598, 'fraction_numerical': 0.006424670735624799, 'mean_word_length': 5.0939334637964775, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 8, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7672469', 'n_tokens_mistral': 972, 'n_tokens_neox': 914, 'n_words': 250}