Uses different pass count for elimination stack

[libcds.git] / readme.md

diff --git a/readme.md b/readme.md
index 539796d5c6ce790a6fb94426d9cd711d0f9ee57d..fa9237cfc4bd42d490434dae09deed1e9d739c4f 100644 (file)
--- a/readme.md
+++ b/readme.md
@@ -2,11 +2,8 @@ CDS C++ library
 ===============\r
 [![GitHub version](https://badge.fury.io/gh/khizmax%2Flibcds.svg)](http://badge.fury.io/gh/khizmax%2Flibcds)\r
 [![License](https://img.shields.io/:license-bsd-blue.svg?style=round-square)](https://github.com/khizmax/libcds/blob/master/LICENSE)\r
-\r
-<!---\r
-The build time for lib and hdr-test is exceed the limit of 50 minutes\r
 [![Build Status](https://travis-ci.org/khizmax/libcds.svg?branch=dev)](https://travis-ci.org/khizmax/libcds)\r
--->\r
+\r
 <!---\r
 The coverity dataset is about 4G of size and about 1G in compressed state so it is a problem to upload it to the coverity server\r
 [![Coverity Scan Build Status](https://scan.coverity.com/projects/4445/badge.svg)](https://scan.coverity.com/projects/4445)\r
@@ -24,7 +21,7 @@ The library contains the implementations of the following containers:
   - several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,\r
     the flat combining queue, the segmented queue.\r
   - several implementation of unordered set/map - lock-free and fine-grained lock-based\r
-  - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique\r
+  - [flat-combining](http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique\r
   - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)\r
   - lock-free FeldmanHashMap/Set [Multi-Level Array Hash](http://samos-conference.com/Resources_Samos_Websites/Proceedings_Repository_SAMOS/2013/Files/2013-IC-20.pdf)\r
     with thread-safe bidirectional iterator support\r