Open Source C++ Admin Templates for Windows

The advantage of this project is that you can use this hash map by including only 2 files to your project. (or 1 if you want by cut/paste pool.hpp content directly in hashmap.hpp if you want). It is template and doesn't require that your contained types are PODs, it doesn't require to set delete_key and empty_key. Unlike google densemap. It is mostly "C++ unordered_map" standard conformant and if you download it, you'll find a visual studio project, or a CMakeLists.txt that integrates the test suite from GCC for unordered_map. Which this map passes. Some bench: == 1 million int pushes == *open address: 275.852 ms *reserved openaddr: 110.268 ms std unordered: 277.544 ms == 100k random erasures == *openaddr: 8.70804 ms std unordered: 20.6305 ms == 1M iteration == *openaddr: 185.528 ms std unordered: 1010.53 ms == 50k finds in 1M == *openaddr: 4.24 ms std unordered: 10.44 ms

Embedded HTTP Server (EHS) is a C++ class library which can be inherited from to add HTTP(S) server functionality to any class or application. It is easily extendable (samples included) and supports SSL, form data via POST or GET, uploads via multi-part form attachments and WebSockets. Operation modes include single- and multi-threaded operation.

This C++ library adds reference-counting to user classes, as well as custom deleters and weak ptrs support. Thus it almost eliminates the need in tr1:shared_ptr. Wrapped objects could be used with tr1:intrusive_ptr or with this library smart pointers

A starter project for creating a windows service.

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.