Set version to 0.20.0

Fix JobQueue
Improve diagnostics for ResourceManager
2025-11-04 19:25:51 +00:00 · 2014-01-08 16:15:12 -08:00 · 2014-01-08 14:55:10 -08:00 · 2014-01-08 11:18:46 -08:00 · 2014-01-08 11:18:45 -08:00 · 2014-01-07 21:14:14 -08:00
379 changed files with 13753 additions and 35884 deletions
--- a/Builds/QtCreator/rippled.pro
+++ b/Builds/QtCreator/rippled.pro
@@ -65,13 +65,13 @@ UI_HEADERS_DIR += ../../src/ripple_basics
 SOURCES += \
    ../../src/ripple/beast/ripple_beast.cpp \
    ../../src/ripple/beast/ripple_beastc.c \
+    ../../src/ripple/common/ripple_common.cpp \
    ../../src/ripple/http/ripple_http.cpp \
    ../../src/ripple/json/ripple_json.cpp \
    ../../src/ripple/peerfinder/ripple_peerfinder.cpp \
    ../../src/ripple/resource/ripple_resource.cpp \
    ../../src/ripple/rpc/ripple_rpc.cpp \
    ../../src/ripple/sitefiles/ripple_sitefiles.cpp \
-    ../../src/ripple/sophia/ripple_sophia.c \
    ../../src/ripple/sslutil/ripple_sslutil.cpp \
    ../../src/ripple/testoverlay/ripple_testoverlay.cpp \
    ../../src/ripple/types/ripple_types.cpp \
@@ -95,7 +95,6 @@ SOURCES += \
    ../../src/ripple_data/ripple_data.cpp \
    ../../src/ripple_hyperleveldb/ripple_hyperleveldb.cpp \
    ../../src/ripple_leveldb/ripple_leveldb.cpp \
-    ../../src/ripple_mdb/ripple_mdb.c \
    ../../src/ripple_net/ripple_net.cpp \
    ../../src/ripple_websocket/ripple_websocket.cpp

--- a/Builds/VisualStudio2012/RippleD.vcxproj
+++ b/Builds/VisualStudio2012/RippleD.vcxproj
@@ -22,6 +22,13 @@
    <ClCompile Include="..\..\build\proto\ripple.pb.cc" />
    <ClCompile Include="..\..\src\ripple\beast\ripple_beast.cpp" />
    <ClCompile Include="..\..\src\ripple\beast\ripple_beastc.c" />
+    <ClCompile Include="..\..\src\ripple\common\functional\impl\counted_bind.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple\common\ripple_common.cpp" />
    <ClCompile Include="..\..\src\ripple\http\impl\Port.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -635,7 +642,6 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
    <ClCompile Include="..\..\src\ripple\sitefiles\ripple_sitefiles.cpp" />
-    <ClCompile Include="..\..\src\ripple\sophia\ripple_sophia.c" />
    <ClCompile Include="..\..\src\ripple\sslutil\impl\CBigNum.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -686,6 +692,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple\types\impl\RippleAssets.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\src\ripple\types\impl\RippleIdentifierTests.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -904,6 +916,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\main\CollectorManager.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\src\ripple_app\main\IoServicePool.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1096,6 +1114,9 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\peers\NameResolver.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\src\ripple_app\peers\PackedMessage.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1193,6 +1214,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\shamap\FetchPackTests.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\src\ripple_app\shamap\SHAMap.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1235,6 +1262,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\shamap\RadixMapTest.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\src\ripple_app\shamap\SHAMapTreeNode.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1482,24 +1515,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\KeyvaDBFactory.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\LevelDBFactory.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\MdbFactory.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\MemoryFactory.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1512,7 +1533,7 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\SophiaFactory.cpp">
+    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\RocksDBFactory.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
@@ -1684,7 +1705,6 @@
    <ClCompile Include="..\..\src\ripple_data\ripple_data.cpp" />
    <ClCompile Include="..\..\src\ripple_hyperleveldb\ripple_hyperleveldb.cpp" />
    <ClCompile Include="..\..\src\ripple_leveldb\ripple_leveldb.cpp" />
-    <ClCompile Include="..\..\src\ripple_mdb\ripple_mdb.c" />
    <ClCompile Include="..\..\src\ripple_net\basics\RippleSSLContext.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -2113,7 +2133,9 @@
  </ItemGroup>
  <ItemGroup>
    <ClInclude Include="..\..\src\ripple\algorithm\api\CycledSet.h" />
+    <ClInclude Include="..\..\src\ripple\algorithm\api\DecayingSample.h" />
    <ClInclude Include="..\..\src\ripple\algorithm\api\DiscreteClock.h" />
+    <ClInclude Include="..\..\src\ripple\common\functional\counted_bind.h" />
    <ClInclude Include="..\..\src\ripple\http\api\Handler.h" />
    <ClInclude Include="..\..\src\ripple\http\api\Server.h" />
    <ClInclude Include="..\..\src\ripple\http\api\Port.h" />
@@ -2165,13 +2187,11 @@
    <ClInclude Include="..\..\src\ripple\resource\api\LegacyFees.h" />
    <ClInclude Include="..\..\src\ripple\resource\api\Manager.h" />
    <ClInclude Include="..\..\src\ripple\resource\api\Types.h" />
-    <ClInclude Include="..\..\src\ripple\resource\impl\DecayingSample.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Entry.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Import.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Key.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Kind.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Logic.h" />
-    <ClInclude Include="..\..\src\ripple\resource\impl\LogicType.h" />
    <ClInclude Include="..\..\src\ripple\resource\impl\Tuning.h" />
    <ClInclude Include="..\..\src\ripple\resource\ripple_resource.h" />
    <ClInclude Include="..\..\src\ripple\rocksdb\ripple_rocksdb.h" />
@@ -2276,7 +2296,6 @@
    <ClInclude Include="..\..\src\ripple\sitefiles\impl\Logic.h" />
    <ClInclude Include="..\..\src\ripple\sitefiles\impl\Site.h" />
    <ClInclude Include="..\..\src\ripple\sitefiles\ripple_sitefiles.h" />
-    <ClInclude Include="..\..\src\ripple\sophia\ripple_sophia.h" />
    <ClInclude Include="..\..\src\ripple\sslutil\api\bignum_error.h" />
    <ClInclude Include="..\..\src\ripple\sslutil\api\CAutoBN_CTX.h" />
    <ClInclude Include="..\..\src\ripple\sslutil\api\CBigNum.h" />
@@ -2308,6 +2327,7 @@
    <ClInclude Include="..\..\src\ripple\types\api\RippleAccountPrivateKey.h" />
    <ClInclude Include="..\..\src\ripple\types\api\RippleAccountPublicKey.h" />
    <ClInclude Include="..\..\src\ripple\types\api\CryptoIdentifier.h" />
+    <ClInclude Include="..\..\src\ripple\types\api\RippleAssets.h" />
    <ClInclude Include="..\..\src\ripple\types\api\RippleLedgerHash.h" />
    <ClInclude Include="..\..\src\ripple\types\api\RipplePrivateKey.h" />
    <ClInclude Include="..\..\src\ripple\types\api\RipplePublicKey.h" />
@@ -2350,6 +2370,7 @@
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerMaster.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerProposal.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerTiming.h" />
+    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerHolder.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\OrderBookDB.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\AcceptedLedger.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\AcceptedLedgerTx.h" />
@@ -2358,6 +2379,7 @@
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerEntrySet.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerHistory.h" />
    <ClInclude Include="..\..\src\ripple_app\ledger\SerializedValidation.h" />
+    <ClInclude Include="..\..\src\ripple_app\main\CollectorManager.h" />
    <ClInclude Include="..\..\src\ripple_app\main\IoServicePool.h" />
    <ClInclude Include="..\..\src\ripple_app\main\NodeStoreScheduler.h" />
    <ClInclude Include="..\..\src\ripple_app\main\ParameterTable.h" />
@@ -2391,6 +2413,7 @@
    <ClInclude Include="..\..\src\ripple_app\paths\RippleCalc.h" />
    <ClInclude Include="..\..\src\ripple_app\paths\RippleLineCache.h" />
    <ClInclude Include="..\..\src\ripple_app\paths\RippleState.h" />
+    <ClInclude Include="..\..\src\ripple_app\peers\NameResolver.h" />
    <ClInclude Include="..\..\src\ripple_app\peers\PackedMessage.h" />
    <ClInclude Include="..\..\src\ripple_app\peers\PeerDoor.h" />
    <ClInclude Include="..\..\src\ripple_app\peers\ClusterNodeStatus.h" />
@@ -2408,6 +2431,7 @@
    <ClInclude Include="..\..\src\ripple_app\shamap\SHAMapNode.h" />
    <ClInclude Include="..\..\src\ripple_app\shamap\SHAMapSyncFilter.h" />
    <ClInclude Include="..\..\src\ripple_app\shamap\SHAMapSyncFilters.h" />
+    <ClInclude Include="..\..\src\ripple_app\shamap\RadixMapTest.h" />
    <ClInclude Include="..\..\src\ripple_app\shamap\SHAMapTreeNode.h" />
    <ClInclude Include="..\..\src\ripple_app\tx\AccountSetTransactor.h" />
    <ClInclude Include="..\..\src\ripple_app\tx\ChangeTransactor.h" />
@@ -2428,7 +2452,6 @@
    <ClInclude Include="..\..\src\ripple_app\websocket\WSConnection.h" />
    <ClInclude Include="..\..\src\ripple_app\websocket\WSDoor.h" />
    <ClInclude Include="..\..\src\ripple_app\websocket\WSServerHandler.h" />
-    <ClInclude Include="..\..\src\ripple_basics\containers\BlackList.h" />
    <ClInclude Include="..\..\src\ripple_basics\containers\KeyCache.h" />
    <ClInclude Include="..\..\src\ripple_basics\containers\RangeSet.h" />
    <ClInclude Include="..\..\src\ripple_basics\containers\TaggedCache.h" />
@@ -2467,12 +2490,10 @@
    <ClInclude Include="..\..\src\ripple_core\nodestore\api\Types.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\api\VisitCallback.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\HyperDBFactory.h" />
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\KeyvaDBFactory.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\LevelDBFactory.h" />
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\MdbFactory.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\MemoryFactory.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\NullFactory.h" />
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\SophiaFactory.h" />
+    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\RocksDBFactory.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\impl\BatchWriter.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\impl\DatabaseImp.h" />
    <ClInclude Include="..\..\src\ripple_core\nodestore\impl\DecodedBlob.h" />
@@ -2504,7 +2525,6 @@
    <ClInclude Include="..\..\src\ripple_data\utility\UptimeTimerAdapter.h" />
    <ClInclude Include="..\..\src\ripple_hyperleveldb\ripple_hyperleveldb.h" />
    <ClInclude Include="..\..\src\ripple_leveldb\ripple_leveldb.h" />
-    <ClInclude Include="..\..\src\ripple_mdb\ripple_mdb.h" />
    <ClInclude Include="..\..\src\ripple_net\basics\impl\MultiSocketType.h" />
    <ClInclude Include="..\..\src\ripple_net\basics\impl\RPCServerImp.h" />
    <ClInclude Include="..\..\src\ripple_net\basics\RippleSSLContext.h" />
--- a/Builds/VisualStudio2012/RippleD.vcxproj.filters
+++ b/Builds/VisualStudio2012/RippleD.vcxproj.filters
@@ -130,9 +130,6 @@
    <Filter Include="[2] Old Ripple\ripple_net\rpc">
      <UniqueIdentifier>{045285aa-9043-4cee-b8ca-cc8881e52f6a}</UniqueIdentifier>
    </Filter>
-    <Filter Include="[2] Old Ripple\ripple_mdb">
-      <UniqueIdentifier>{6a769530-8edf-4836-afc8-8836fe315603}</UniqueIdentifier>
-    </Filter>
    <Filter Include="[2] Old Ripple\ripple_hyperleveldb">
      <UniqueIdentifier>{571acd5b-065c-4202-8de3-8692735171dc}</UniqueIdentifier>
    </Filter>
@@ -166,9 +163,6 @@
    <Filter Include="[1] Ripple\beast">
      <UniqueIdentifier>{458b9099-fcf6-49fe-b3fb-a27beb2ee070}</UniqueIdentifier>
    </Filter>
-    <Filter Include="[1] Ripple\sophia">
-      <UniqueIdentifier>{29b20c8e-267a-487a-9086-fb0c85a922f6}</UniqueIdentifier>
-    </Filter>
    <Filter Include="[1] Ripple\json">
      <UniqueIdentifier>{d95b931f-b5fd-4d15-a040-e832ac1e2f87}</UniqueIdentifier>
    </Filter>
@@ -295,6 +289,15 @@
    <Filter Include="[1] Ripple\rocksdb\rocksdb\include\utilities">
      <UniqueIdentifier>{013f0eb9-bf1d-4b11-8c2c-3fd99d4b8ef5}</UniqueIdentifier>
    </Filter>
+    <Filter Include="[1] Ripple\common">
+      <UniqueIdentifier>{b99052d6-a903-4dfd-9c68-ff767a7d8f63}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="[1] Ripple\common\functional">
+      <UniqueIdentifier>{70365f6a-d1e6-45f2-a064-0e842b0fdd78}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="[1] Ripple\common\functional\impl">
+      <UniqueIdentifier>{9b8137bd-737d-4825-98bf-897a0635293a}</UniqueIdentifier>
+    </Filter>
  </ItemGroup>
  <ItemGroup>
    <ClCompile Include="..\..\src\ripple_basics\containers\RangeSet.cpp">
@@ -936,9 +939,6 @@
    <ClCompile Include="..\..\src\ripple_hyperleveldb\ripple_hyperleveldb.cpp">
      <Filter>[2] Old Ripple\ripple_hyperleveldb</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_mdb\ripple_mdb.c">
-      <Filter>[2] Old Ripple\ripple_mdb</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_net\ripple_net.cpp">
      <Filter>[2] Old Ripple\ripple_net</Filter>
    </ClCompile>
@@ -963,9 +963,6 @@
    <ClCompile Include="..\..\src\ripple_app\main\IoServicePool.cpp">
      <Filter>[2] Old Ripple\ripple_app\main</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple\sophia\ripple_sophia.c">
-      <Filter>[1] Ripple\sophia</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple\json\impl\json_reader.cpp">
      <Filter>[1] Ripple\json\impl</Filter>
    </ClCompile>
@@ -996,24 +993,15 @@
    <ClCompile Include="..\..\src\ripple_core\nodestore\tests\TimingTests.cpp">
      <Filter>[2] Old Ripple\ripple_core\nodestore\tests</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\SophiaFactory.cpp">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\NullFactory.cpp">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\MemoryFactory.cpp">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\MdbFactory.cpp">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\LevelDBFactory.cpp">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\KeyvaDBFactory.cpp">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\HyperDBFactory.cpp">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClCompile>
@@ -1404,6 +1392,30 @@
    <ClCompile Include="..\..\src\ripple_app\ledger\LedgerCleaner.cpp">
      <Filter>[2] Old Ripple\ripple_app\ledger</Filter>
    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\main\CollectorManager.cpp">
+      <Filter>[2] Old Ripple\ripple_app\main</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\peers\NameResolver.cpp">
+      <Filter>[2] Old Ripple\ripple_app\peers</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\shamap\FetchPackTests.cpp">
+      <Filter>[2] Old Ripple\ripple_app\shamap</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_app\shamap\RadixMapTest.cpp">
+      <Filter>[2] Old Ripple\ripple_app\shamap</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple\types\impl\RippleAssets.cpp">
+      <Filter>[1] Ripple\types\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple\common\ripple_common.cpp">
+      <Filter>[1] Ripple\common</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple\common\functional\impl\counted_bind.cpp">
+      <Filter>[1] Ripple\common\functional\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\src\ripple_core\nodestore\backend\RocksDBFactory.cpp">
+      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
+    </ClCompile>
  </ItemGroup>
  <ItemGroup>
    <ClInclude Include="..\..\src\ripple_basics\containers\KeyCache.h">
@@ -1760,6 +1772,9 @@
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerTiming.h">
      <Filter>[2] Old Ripple\ripple_app\ledger</Filter>
    </ClInclude>
+    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerHolder.h">
+      <Filter>[2] Old Ripple\ripple_app\ledger</Filter>
+    </ClInclude>
    <ClInclude Include="..\..\src\ripple_app\ledger\OrderBookDB.h">
      <Filter>[2] Old Ripple\ripple_app\ledger</Filter>
    </ClInclude>
@@ -2166,9 +2181,6 @@
    <ClInclude Include="..\..\src\ripple_leveldb\ripple_leveldb.h">
      <Filter>[2] Old Ripple\ripple_leveldb</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple_mdb\ripple_mdb.h">
-      <Filter>[2] Old Ripple\ripple_mdb</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple_net\ripple_net.h">
      <Filter>[2] Old Ripple\ripple_net</Filter>
    </ClInclude>
@@ -2187,9 +2199,6 @@
    <ClInclude Include="..\..\src\ripple_app\main\IoServicePool.h">
      <Filter>[2] Old Ripple\ripple_app\main</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple\sophia\ripple_sophia.h">
-      <Filter>[1] Ripple\sophia</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple\json\api\json_features.h">
      <Filter>[1] Ripple\json\api</Filter>
    </ClInclude>
@@ -2256,24 +2265,15 @@
    <ClInclude Include="..\..\src\ripple_core\nodestore\api\VisitCallback.h">
      <Filter>[2] Old Ripple\ripple_core\nodestore\api</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\SophiaFactory.h">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\NullFactory.h">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClInclude>
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\MemoryFactory.h">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\MdbFactory.h">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\LevelDBFactory.h">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\KeyvaDBFactory.h">
-      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\HyperDBFactory.h">
      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
    </ClInclude>
@@ -2427,9 +2427,6 @@
    <ClInclude Include="..\..\src\ripple\types\api\CryptoIdentifier.h">
      <Filter>[1] Ripple\types\api</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple_basics\containers\BlackList.h">
-      <Filter>[2] Old Ripple\ripple_basics\containers</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple_core\functional\LoadFeeTrackImp.h">
      <Filter>[2] Old Ripple\ripple_core\functional</Filter>
    </ClInclude>
@@ -2532,9 +2529,6 @@
    <ClInclude Include="..\..\src\ripple\resource\api\Manager.h">
      <Filter>[1] Ripple\resource\api</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple\resource\impl\DecayingSample.h">
-      <Filter>[1] Ripple\resource\impl</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple\resource\impl\Kind.h">
      <Filter>[1] Ripple\resource\impl</Filter>
    </ClInclude>
@@ -2562,9 +2556,6 @@
    <ClInclude Include="..\..\src\ripple\resource\api\LegacyFees.h">
      <Filter>[1] Ripple\resource\api</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\src\ripple\resource\impl\LogicType.h">
-      <Filter>[1] Ripple\resource\impl</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\src\ripple\peerfinder\impl\LogicType.h">
      <Filter>[1] Ripple\peerfinder\impl</Filter>
    </ClInclude>
@@ -2880,6 +2871,27 @@
    <ClInclude Include="..\..\src\ripple_app\ledger\LedgerCleaner.h">
      <Filter>[2] Old Ripple\ripple_app\ledger</Filter>
    </ClInclude>
+    <ClInclude Include="..\..\src\ripple\algorithm\api\DecayingSample.h">
+      <Filter>[1] Ripple\algorithm\api</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple_app\main\CollectorManager.h">
+      <Filter>[2] Old Ripple\ripple_app\main</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple_app\peers\NameResolver.h">
+      <Filter>[2] Old Ripple\ripple_app\peers</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple_app\shamap\RadixMapTest.h">
+      <Filter>[2] Old Ripple\ripple_app\shamap</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple\types\api\RippleAssets.h">
+      <Filter>[1] Ripple\types\api</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple\common\functional\counted_bind.h">
+      <Filter>[1] Ripple\common\functional</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\src\ripple_core\nodestore\backend\RocksDBFactory.h">
+      <Filter>[2] Old Ripple\ripple_core\nodestore\backend</Filter>
+    </ClInclude>
  </ItemGroup>
  <ItemGroup>
    <CustomBuild Include="..\..\src\ripple_data\protocol\ripple.proto">
--- a/11
+++ b/11
@@ -48,8 +48,8 @@ if OSX:
    env.Replace(CC= 'clang')
    env.Replace(CXX= 'clang++')
    env.Append(CXXFLAGS = ['-std=c++11', '-stdlib=libc++'])
-    env.Append(LINKFLAGS='-stdlib=libc++')
-    env['FRAMEWORKS'] = ['AppKit']
+    env.Append(LINKFLAGS='-stdlib=libc++') 
+    env['FRAMEWORKS'] = ['AppKit','Foundation']

 GCC_VERSION = re.split('\.', commands.getoutput(env['CXX'] + ' -dumpversion'))

@@ -93,13 +93,13 @@ BOOST_LIBS = [
    'boost_regex',
    'boost_system',
    'boost_thread',
-    'boost_random',
 ]

 # We whitelist platforms where the non -mt version is linked with pthreads. This
 # can be verified with: ldd libboost_filesystem.* If a threading library is
 # included the platform can be whitelisted.
-if FreeBSD or Ubuntu or Archlinux or OSX:
+if FreeBSD or Ubuntu or Archlinux:
+# if FreeBSD or Ubuntu or Archlinux or OSX:    
    # non-mt libs do link with pthreads.
    env.Append(
        LIBS = BOOST_LIBS
@@ -156,6 +156,7 @@ COMPILED_FILES.extend (['src/ripple/beast/ripple_beastc.c'])
 # New-style Ripple unity sources
 #
 COMPILED_FILES.extend([
+    'src/ripple/common/ripple_common.cpp',
    'src/ripple/http/ripple_http.cpp',
    'src/ripple/json/ripple_json.cpp',
    'src/ripple/peerfinder/ripple_peerfinder.cpp',
@@ -163,7 +164,6 @@ COMPILED_FILES.extend([
    'src/ripple/rocksdb/ripple_rocksdb.cpp',
    'src/ripple/rpc/ripple_rpc.cpp',
    'src/ripple/sitefiles/ripple_sitefiles.cpp',
-    'src/ripple/sophia/ripple_sophia.c',
    'src/ripple/sslutil/ripple_sslutil.cpp',
    'src/ripple/testoverlay/ripple_testoverlay.cpp',
    'src/ripple/types/ripple_types.cpp',
@@ -188,7 +188,6 @@ COMPILED_FILES.extend([
    'src/ripple_data/ripple_data.cpp',
    'src/ripple_hyperleveldb/ripple_hyperleveldb.cpp',
    'src/ripple_leveldb/ripple_leveldb.cpp',
-    'src/ripple_mdb/ripple_mdb.c',
    'src/ripple_net/ripple_net.cpp',
    'src/ripple_websocket/ripple_websocket.cpp'
    ])
--- a/doc/rippled-example.cfg
+++ b/doc/rippled-example.cfg
@@ -655,9 +655,8 @@
 #   Choices for 'type' (not case-sensitive)
 #       HyperLevelDB        Use an improved version of LevelDB (preferred)
 #       LevelDB             Use Google's LevelDB database (deprecated)
-#       MDB                 Use MDB
 #       none                Use no backend
-#		RocksDB				Use Facebook's RocksDB database
+#       RocksDB             Use Facebook's RocksDB database
 #       SQLite              Use SQLite
 #
 #   Required keys:
@@ -708,6 +707,41 @@
 #
 #
 #
+# [insight]
+#
+#   Configuration parameters for the Beast.Insight stats collection module.
+#
+#   Insight is a module that collects information from the areas of rippled
+#   that have instrumentation. The configuration paramters control where the
+#   collection metrics are sent. The parameters are expressed as key = value
+#   pairs with no white space. The main parameter is the choice of server:
+#
+#     "server"
+#
+#       Choice of server to send metrics to. Currently the only choice is
+#       "statsd" which sends UDP packets to a StatsD daemon, which must be
+#       running while rippled is running. More information on StatsD is
+#       available here:
+#           https://github.com/b/statsd_spec
+#
+#       When server=statsd, these additional keys are used:
+#
+#       "address" The UDP address and port of the listening StatsD server,
+#                 in the format, n.n.n.n:port.
+#
+#       "prefix"  A string prepended to each collected metric. This is used
+#                 to distinguish between different running instances of rippled.
+#
+#     If this section is missing, or the server type is unspecified or unknown,
+#     statistics are not collected or reported.
+#
+#   Example:
+#
+#     [insight]
+#     server=statsd
+#     address=192.168.0.95:4201
+#     prefix=my_validator
+#   
 #-------------------------------------------------------------------------------

 # Allow other peers to connect to this server.
@@ -749,13 +783,14 @@
 medium

 # Note that HyperLevelDB is unavailable on Windows platforms
-#
 [node_db]
 type=HyperLevelDB
-path=db/hyperldb
+path=/etc/ripple/db/hyperldb

+# This needs to be an absolute directory reference, not a relative one.
+# Modify this value as required.
 [debug_logfile]
-log/debug.log
+/var/log/rippled/debug.log

 [sntp_servers]
 time.windows.com
@@ -773,3 +808,17 @@ pool.ntp.org
 107.21.251.218 51235
 184.73.226.101 51235
 23.23.201.55   51235
+
+# These validators are taken from the v0.16 release notes on the wiki:
+# https://ripple.com/wiki/Latest_rippled_release_notes
+[validators]
+n9KPnVLn7ewVzHvn218DcEYsnWLzKerTDwhpofhk4Ym1RUq4TeGw    RIP1
+n9LFzWuhKNvXStHAuemfRKFVECLApowncMAM5chSCL9R5ECHGN4V    RIP2
+n94rSdgTyBNGvYg8pZXGuNt59Y5bGAZGxbxyvjDaqD9ceRAgD85P    RIP3
+n9LeQeDcLDMZKjx1TZtrXoLBLo5q1bR1sUQrWG7tEADFU6R27UBp    RIP4
+n9KF6RpvktjNs2MDBkmxpJbup4BKrKeMKDXPhaXkq7cKTwLmWkFr    RIP5
+
+# Ditto.
+[validation_quorum]
+3
+
--- a/doc/rippled.init
+++ b/doc/rippled.init
@@ -0,0 +1,114 @@
+#!/bin/sh
+
+### BEGIN INIT INFO
+# Provides:          ripple
+# Required-Start:    $local_fs $remote_fs $network $syslog
+# Required-Stop:     $local_fs $remote_fs $network $syslog
+# Default-Start:     2 3 4 5
+# Default-Stop:      0 1 6
+# Short-Description: starts the ripple network node
+# Description:       starts rippled using start-stop-daemon
+### END INIT INFO
+
+set -e
+
+NAME=rippled
+USER="rippled"
+GROUP="rippled"
+PIDFILE=/var/run/$NAME.pid
+DAEMON=/usr/local/sbin/rippled
+DAEMON_OPTS="--conf /etc/ripple/rippled.cfg"
+NET_OPTS="--net $DAEMON_OPTS"
+LOGDIR="/var/log/rippled"
+DBDIR="/var/db/rippled/db/hyperldb"
+
+export PATH="${PATH:+$PATH:}/usr/sbin:/sbin"
+
+# I wish it didn't come down to this, but this is the easiest way to ensure
+# sanity of an install.
+if [ ! -d $LOGDIR ]; then
+	mkdir -p $LOGDIR
+	chown $USER:$GROUP $LOGDIR
+fi
+if [ ! -d $DBDIR ]; then
+	mkdir -p $DBDIR
+	chown -R $USER:$GROUP $DBDIR
+fi
+
+case "$1" in
+    start)
+        echo -n "Starting daemon: "$NAME
+        start-stop-daemon --start --quiet --background -m --pidfile $PIDFILE \
+            --exec $DAEMON --chuid $USER --group $GROUP --verbose -- $NET_OPTS
+        echo "."
+        ;;
+
+    stop)
+        echo -n "Stopping daemon: "$NAME
+        $DAEMON $DAEMON_OPTS stop
+        rm -f $PIDFILE
+        echo "."
+        ;;
+
+    restart)
+        echo -n "Restarting daemon: "$NAME
+        $DAEMON $DAEMON_OPTS stop
+        rm -f $PIDFILE
+        start-stop-daemon --start --quiet --background -m --pidfile $PIDFILE \
+            --exec $DAEMON --chuid $USER --group $GROUP -- $NET_OPTS
+        echo "."
+        ;;
+
+    status)
+        echo "Status of $NAME:"
+        echo -n "PID of $NAME: "
+        if [ -f "$PIDFILE" ]; then
+                cat $PIDFILE
+                $DAEMON $DAEMON_OPTS server_info
+        else
+                echo "$NAME not running."
+        fi
+        echo "."
+        ;;
+
+    fetch)
+        echo "$NAME ledger fetching info:"
+        $DAEMON $DAEMON_OPTS fetch_info
+        echo "."
+        ;;
+
+    uptime)
+        echo "$NAME uptime:"
+        $DAEMON $DAEMON_OPTS get_counts
+        echo "."
+        ;;
+
+    startconfig)
+        echo "$NAME is being started with the following command line:"
+        echo "$DAEMON $NET_OPTS"
+        echo "."
+        ;;
+
+    command)
+        # Truncate the script's argument vector by one position to get rid of
+        # this entry.
+        shift
+
+        # Pass the remainder of the argument vector to rippled.
+        $DAEMON $DAEMON_OPTS "$@"
+        echo "."
+        ;;
+
+    test)
+        $DAEMON $DAEMON_OPTS ping
+        echo "."
+        ;;
+
+    *)
+        echo "Usage: $0 {start|stop|restart|status|fetch|uptime|startconfig|"
+        echo "           command|test}"
+        exit 1
+esac
+
+exit 0
+
--- a/package.json
+++ b/package.json
@@ -22,7 +22,7 @@
  },

  "scripts": {
-    "test": "mocha test/*-test.{js,coffee}"
+    "test": "mocha"
  },

  "repository": {
--- a/src/BeastConfig.h
+++ b/src/BeastConfig.h
@@ -163,6 +163,20 @@

 //------------------------------------------------------------------------------

+// These control whether or not certain functionality gets
+// compiled into the resulting rippled executable
+
+/** Config: RIPPLE_ROCKSDB_AVAILABLE
+    Controls whether or not the RocksDB database back-end is compiled into
+    rippled. RocksDB requires a relatively modern C++ compiler (tested with
+    gcc versions 4.8.1 and later) that supports some C++11 features.
+*/
+#ifndef   RIPPLE_ROCKSDB_AVAILABLE
+//#define RIPPLE_ROCKSDB_AVAILABLE 0
+#endif
+
+//------------------------------------------------------------------------------
+
 // Here temporarily to turn off new Validations code while it
 // is being written.
 //
--- a/src/beast/Builds/VisualStudio2012/beast.vcxproj
+++ b/src/beast/Builds/VisualStudio2012/beast.vcxproj
@@ -88,7 +88,11 @@
    <ClInclude Include="..\..\beast\Boost.h" />
    <ClInclude Include="..\..\beast\boost\ErrorCode.h" />
    <ClInclude Include="..\..\beast\ByteOrder.h" />
+    <ClInclude Include="..\..\beast\chrono\chrono_io.h" />
    <ClInclude Include="..\..\beast\chrono\CPUMeter.h" />
+    <ClInclude Include="..\..\beast\chrono\abstract_clock.h" />
+    <ClInclude Include="..\..\beast\chrono\manual_clock.h" />
+    <ClInclude Include="..\..\beast\chrono\ratio_io.h" />
    <ClInclude Include="..\..\beast\chrono\RelativeTime.h" />
    <ClInclude Include="..\..\beast\chrono\ScopedTimeInterval.h" />
    <ClInclude Include="..\..\beast\Config.h" />
@@ -110,44 +114,54 @@
    <ClInclude Include="..\..\beast\config\SelectStdlibConfig.h" />
    <ClInclude Include="..\..\beast\config\StandardConfig.h" />
    <ClInclude Include="..\..\beast\Crypto.h" />
+    <ClInclude Include="..\..\beast\crypto\BinaryEncoding.h" />
    <ClInclude Include="..\..\beast\crypto\impl\sha2\sha2.h" />
    <ClInclude Include="..\..\beast\crypto\MurmurHash.h" />
    <ClInclude Include="..\..\beast\crypto\Sha256.h" />
+    <ClInclude Include="..\..\beast\crypto\UnsignedInteger.h" />
+    <ClInclude Include="..\..\beast\crypto\UnsignedIntegerCalc.h" />
    <ClInclude Include="..\..\beast\CStdInt.h" />
+    <ClInclude Include="..\..\beast\cyclic_iterator.h" />
    <ClInclude Include="..\..\beast\FixedArray.h" />
    <ClInclude Include="..\..\beast\HeapBlock.h" />
    <ClInclude Include="..\..\beast\HTTP.h" />
    <ClInclude Include="..\..\beast\http\impl\http-parser\http_parser.h" />
    <ClInclude Include="..\..\beast\http\ParsedURL.h" />
    <ClInclude Include="..\..\beast\http\URL.h" />
+    <ClInclude Include="..\..\beast\Insight.h" />
+    <ClInclude Include="..\..\beast\insight\Collector.h" />
+    <ClInclude Include="..\..\beast\insight\Counter.h" />
+    <ClInclude Include="..\..\beast\insight\CounterImpl.h" />
+    <ClInclude Include="..\..\beast\insight\Event.h" />
+    <ClInclude Include="..\..\beast\insight\EventImpl.h" />
+    <ClInclude Include="..\..\beast\insight\Gauge.h" />
+    <ClInclude Include="..\..\beast\insight\GaugeImpl.h" />
+    <ClInclude Include="..\..\beast\insight\Hook.h" />
+    <ClInclude Include="..\..\beast\insight\HookImpl.h" />
+    <ClInclude Include="..\..\beast\insight\Meter.h" />
+    <ClInclude Include="..\..\beast\insight\MeterImpl.h" />
+    <ClInclude Include="..\..\beast\insight\NullCollector.h" />
+    <ClInclude Include="..\..\beast\insight\StatsDCollector.h" />
    <ClInclude Include="..\..\beast\Intrusive.h" />
-    <ClInclude Include="..\..\beast\intrusive\ForwardList.h" />
-    <ClInclude Include="..\..\beast\intrusive\IntrusiveArray.h" />
    <ClInclude Include="..\..\beast\intrusive\List.h" />
    <ClInclude Include="..\..\beast\intrusive\LockFreeStack.h" />
-    <ClInclude Include="..\..\beast\intrusive\PointerTraits.h" />
    <ClInclude Include="..\..\beast\Memory.h" />
    <ClInclude Include="..\..\beast\MPL.h" />
-    <ClInclude Include="..\..\beast\mpl\AddConst.h" />
-    <ClInclude Include="..\..\beast\mpl\CopyConst.h" />
-    <ClInclude Include="..\..\beast\mpl\IfCond.h" />
    <ClInclude Include="..\..\beast\mpl\IsCallPossible.h" />
-    <ClInclude Include="..\..\beast\mpl\PointerToOther.h" />
-    <ClInclude Include="..\..\beast\mpl\RemoveConst.h" />
-    <ClInclude Include="..\..\beast\mpl\RemoveConstVolatile.h" />
-    <ClInclude Include="..\..\beast\mpl\RemoveReference.h" />
-    <ClInclude Include="..\..\beast\mpl\RemoveVolatile.h" />
    <ClInclude Include="..\..\beast\Net.h" />
    <ClInclude Include="..\..\beast\net\BufferType.h" />
    <ClInclude Include="..\..\beast\net\DynamicBuffer.h" />
    <ClInclude Include="..\..\beast\net\IPAddress.h" />
    <ClInclude Include="..\..\beast\SafeBool.h" />
    <ClInclude Include="..\..\beast\SmartPtr.h" />
+    <ClInclude Include="..\..\beast\smart_ptr\AbstractObject.h" />
    <ClInclude Include="..\..\beast\smart_ptr\ContainerDeletePolicy.h" />
    <ClInclude Include="..\..\beast\smart_ptr\ScopedPointer.h" />
    <ClInclude Include="..\..\beast\smart_ptr\SharedObject.h" />
    <ClInclude Include="..\..\beast\smart_ptr\SharedPtr.h" />
    <ClInclude Include="..\..\beast\StaticAssert.h" />
+    <ClInclude Include="..\..\beast\STL.h" />
+    <ClInclude Include="..\..\beast\stl\shared_ptr.h" />
    <ClInclude Include="..\..\beast\Strings.h" />
    <ClInclude Include="..\..\beast\strings\CharacterFunctions.h" />
    <ClInclude Include="..\..\beast\strings\CharPointer_ASCII.h" />
@@ -164,6 +178,7 @@
    <ClInclude Include="..\..\beast\threads\detail\DispatchedHandler.h" />
    <ClInclude Include="..\..\beast\threads\LockGuard.h" />
    <ClInclude Include="..\..\beast\threads\RecursiveMutex.h" />
+    <ClInclude Include="..\..\beast\threads\semaphore.h" />
    <ClInclude Include="..\..\beast\threads\ServiceQueue.h" />
    <ClInclude Include="..\..\beast\threads\SharedData.h" />
    <ClInclude Include="..\..\beast\threads\SharedLockGuard.h" />
@@ -187,6 +202,7 @@
    <ClInclude Include="..\..\beast\utility\Debug.h" />
    <ClInclude Include="..\..\beast\utility\EnableIf.h" />
    <ClInclude Include="..\..\beast\utility\Error.h" />
+    <ClInclude Include="..\..\beast\utility\hash_pair.h" />
    <ClInclude Include="..\..\beast\utility\Journal.h" />
    <ClInclude Include="..\..\beast\utility\LeakChecked.h" />
    <ClInclude Include="..\..\beast\utility\PropertyStream.h" />
@@ -244,19 +260,15 @@
    <ClInclude Include="..\..\modules\beast_asio\tests\PeerTest.h" />
    <ClInclude Include="..\..\modules\beast_asio\tests\TestPeerType.h" />
    <ClInclude Include="..\..\modules\beast_core\beast_core.h" />
-    <ClInclude Include="..\..\modules\beast_core\containers\AbstractFifo.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\Array.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\ArrayAllocationBase.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\DynamicObject.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\ElementComparator.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\LinkedListPointer.h" />
-    <ClInclude Include="..\..\modules\beast_core\containers\LockFreeQueue.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\NamedValueSet.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\OwnedArray.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\PropertySet.h" />
-    <ClInclude Include="..\..\modules\beast_core\containers\SharedObjectArray.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\ScopedValueSetter.h" />
-    <ClInclude Include="..\..\modules\beast_core\containers\SortedSet.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\SparseSet.h" />
    <ClInclude Include="..\..\modules\beast_core\containers\Variant.h" />
    <ClInclude Include="..\..\modules\beast_core\diagnostic\FatalError.h" />
@@ -278,24 +290,16 @@
    <ClInclude Include="..\..\modules\beast_core\logging\FileLogger.h" />
    <ClInclude Include="..\..\modules\beast_core\logging\Logger.h" />
    <ClInclude Include="..\..\modules\beast_core\maths\BigInteger.h" />
-    <ClInclude Include="..\..\modules\beast_core\maths\Expression.h" />
-    <ClInclude Include="..\..\modules\beast_core\maths\Interval.h" />
    <ClInclude Include="..\..\modules\beast_core\maths\Math.h" />
    <ClInclude Include="..\..\modules\beast_core\maths\Random.h" />
    <ClInclude Include="..\..\modules\beast_core\maths\Range.h" />
    <ClInclude Include="..\..\modules\beast_core\maths\uint24.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicCounter.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicFlag.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicPointer.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicState.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\CacheLine.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\MemoryAlignment.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\MemoryBlock.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\OptionalScopedPointer.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\RecycledObjectPool.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\SharedFunction.h" />
    <ClInclude Include="..\..\modules\beast_core\memory\SharedSingleton.h" />
-    <ClInclude Include="..\..\modules\beast_core\memory\WeakReference.h" />
    <ClInclude Include="..\..\modules\beast_core\misc\Main.h" />
    <ClInclude Include="..\..\modules\beast_core\misc\Result.h" />
    <ClInclude Include="..\..\modules\beast_core\misc\Uuid.h" />
@@ -342,7 +346,6 @@
    <ClInclude Include="..\..\modules\beast_core\threads\ScopedWriteLock.h" />
    <ClInclude Include="..\..\modules\beast_core\threads\SpinDelay.h" />
    <ClInclude Include="..\..\modules\beast_core\thread\DeadlineTimer.h" />
-    <ClInclude Include="..\..\modules\beast_core\thread\Semaphore.h" />
    <ClInclude Include="..\..\modules\beast_core\thread\Workers.h" />
    <ClInclude Include="..\..\modules\beast_core\thread\detail\ScopedLock.h" />
    <ClInclude Include="..\..\modules\beast_core\thread\detail\TrackedMutex.h" />
@@ -370,14 +373,6 @@
    <ClInclude Include="..\..\modules\beast_core\zip\zlib\zconf.in.h" />
    <ClInclude Include="..\..\modules\beast_core\zip\zlib\zlib.h" />
    <ClInclude Include="..\..\modules\beast_core\zip\zlib\zutil.h" />
-    <ClInclude Include="..\..\modules\beast_crypto\beast_crypto.h" />
-    <ClInclude Include="..\..\modules\beast_crypto\math\BinaryEncoding.h" />
-    <ClInclude Include="..\..\modules\beast_crypto\math\UnsignedInteger.h" />
-    <ClInclude Include="..\..\modules\beast_crypto\math\UnsignedIntegerCalc.h" />
-    <ClInclude Include="..\..\modules\beast_db\beast_db.h" />
-    <ClInclude Include="..\..\modules\beast_db\keyvalue\KeyvaDB.h" />
-    <ClInclude Include="..\..\modules\beast_extras\beast_extras.h" />
-    <ClInclude Include="..\..\modules\beast_extras\traits\BoostLockableTraits.h" />
    <ClInclude Include="..\..\modules\beast_sqdb\api\backend.h" />
    <ClInclude Include="..\..\modules\beast_sqdb\api\blob.h" />
    <ClInclude Include="..\..\modules\beast_sqdb\api\into.h" />
@@ -412,12 +407,24 @@
    </ClCompile>
    <ClCompile Include="..\..\beast\boost\Boost.cpp" />
    <ClCompile Include="..\..\beast\chrono\Chrono.cpp" />
+    <ClCompile Include="..\..\beast\chrono\impl\chrono_io.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\beast\chrono\impl\CPUMeter.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\beast\chrono\impl\abstract_clock.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\beast\chrono\impl\RelativeTime.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -425,6 +432,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
    <ClCompile Include="..\..\beast\crypto\Crypto.cpp" />
+    <ClCompile Include="..\..\beast\crypto\impl\BinaryEncoding.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\beast\crypto\impl\MurmurHash.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -455,6 +468,12 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\beast\crypto\impl\UnsignedInteger.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\beast\http\HTTP.cpp" />
    <ClCompile Include="..\..\beast\http\impl\http_parser.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -498,6 +517,37 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Collector.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Hook.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Metric.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\NullCollector.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\StatsDCollector.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\Insight.cpp" />
    <ClCompile Include="..\..\beast\net\impl\DynamicBuffer.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -511,7 +561,14 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
    <ClCompile Include="..\..\beast\net\Net.cpp" />
+    <ClCompile Include="..\..\beast\smart_ptr\impl\AbstractObject.cpp">
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
+      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
+    </ClCompile>
    <ClCompile Include="..\..\beast\smart_ptr\SmartPtr.cpp" />
+    <ClCompile Include="..\..\beast\stl\STL.cpp" />
    <ClCompile Include="..\..\beast\strings\impl\CharacterFunctions.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -755,12 +812,6 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\beast_core.cpp" />
-    <ClCompile Include="..\..\modules\beast_core\containers\AbstractFifo.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\containers\DynamicObject.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
@@ -879,12 +930,6 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_core\maths\Expression.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\maths\Random.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
@@ -1185,12 +1230,6 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_core\thread\Semaphore.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\thread\Workers.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1317,27 +1356,6 @@
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_crypto\beast_crypto.cpp" />
-    <ClCompile Include="..\..\modules\beast_crypto\math\BinaryEncoding.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_crypto\math\UnsignedInteger.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_db\beast_db.cpp" />
-    <ClCompile Include="..\..\modules\beast_db\keyvalue\KeyvaDB.cpp">
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">true</ExcludedFromBuild>
-      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_extras\beast_extras.cpp" />
    <ClCompile Include="..\..\modules\beast_sqdb\beast_sqdb.cpp" />
    <ClCompile Include="..\..\modules\beast_sqdb\source\blob.cpp">
      <ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">true</ExcludedFromBuild>
@@ -1482,6 +1500,8 @@
      <Optimization>Disabled</Optimization>
      <PreprocessorDefinitions>WIN32;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
      <AdditionalIncludeDirectories>$(ProjectDir);%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableLanguageExtensions>false</DisableLanguageExtensions>
+      <RuntimeTypeInfo>true</RuntimeTypeInfo>
    </ClCompile>
    <Link>
      <SubSystem>Windows</SubSystem>
@@ -1510,6 +1530,8 @@
      <IntrinsicFunctions>true</IntrinsicFunctions>
      <PreprocessorDefinitions>WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
      <AdditionalIncludeDirectories>$(ProjectDir);%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableLanguageExtensions>false</DisableLanguageExtensions>
+      <RuntimeTypeInfo>true</RuntimeTypeInfo>
    </ClCompile>
    <Link>
      <SubSystem>Windows</SubSystem>
--- a/src/beast/Builds/VisualStudio2012/beast.vcxproj.filters
+++ b/src/beast/Builds/VisualStudio2012/beast.vcxproj.filters
@@ -135,18 +135,6 @@
    <Filter Include="beast_core\diagnostic">
      <UniqueIdentifier>{69e28551-92ea-420b-a465-75ed248e3b59}</UniqueIdentifier>
    </Filter>
-    <Filter Include="beast_crypto">
-      <UniqueIdentifier>{62b1f8e3-79e4-46cc-b3fb-a12754aef249}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast_crypto\math">
-      <UniqueIdentifier>{1170f2bc-2456-410a-ab2b-c45f6ed37b9e}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast_db">
-      <UniqueIdentifier>{4834218f-f13f-41bc-a8a0-50314a3a99a3}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast_db\keyvalue">
-      <UniqueIdentifier>{15a98fee-1b52-45eb-9480-514b8750d755}</UniqueIdentifier>
-    </Filter>
    <Filter Include="beast_sqlite">
      <UniqueIdentifier>{cbf5f5a3-5d66-4b6d-996d-20ed14b41793}</UniqueIdentifier>
    </Filter>
@@ -195,12 +183,6 @@
    <Filter Include="beast_core\thread\impl">
      <UniqueIdentifier>{91538dcf-b219-4c80-9861-bb4949089775}</UniqueIdentifier>
    </Filter>
-    <Filter Include="beast_extras">
-      <UniqueIdentifier>{2f5b95a8-1adf-4319-8464-ddc2b2e03f0b}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast_extras\traits">
-      <UniqueIdentifier>{bf498396-2e1f-4903-be68-3053ba439af5}</UniqueIdentifier>
-    </Filter>
    <Filter Include="beast_asio\protocol">
      <UniqueIdentifier>{c0724499-ab69-40c3-90e2-65242dbd2eaa}</UniqueIdentifier>
    </Filter>
@@ -255,15 +237,6 @@
    <Filter Include="beast\config">
      <UniqueIdentifier>{1fff3bd8-44ae-41df-8dd4-8bb6f07b2908}</UniqueIdentifier>
    </Filter>
-    <Filter Include="beast\crypto">
-      <UniqueIdentifier>{9c1ef4c4-5623-4500-859f-12d6ce5ae362}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast\crypto\impl">
-      <UniqueIdentifier>{fc3d3f14-9ba1-43e4-b086-cbbd2f63b944}</UniqueIdentifier>
-    </Filter>
-    <Filter Include="beast\crypto\impl\sha2">
-      <UniqueIdentifier>{44489531-f44a-439a-a6ea-d32c252b1e8b}</UniqueIdentifier>
-    </Filter>
    <Filter Include="beast\chrono">
      <UniqueIdentifier>{57dc7059-cbb2-437c-9c52-79825d9a4cf5}</UniqueIdentifier>
    </Filter>
@@ -303,14 +276,32 @@
    <Filter Include="beast\asio\impl">
      <UniqueIdentifier>{30b0fdfb-02b6-47dd-bdd9-ffc1f57e1f2c}</UniqueIdentifier>
    </Filter>
+    <Filter Include="beast\smart_ptr\impl">
+      <UniqueIdentifier>{df4f2935-13a1-4afe-90cc-d86472ec2466}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\stl">
+      <UniqueIdentifier>{793e2d61-14f6-4fa1-a17f-af6bbec13ba1}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\insight">
+      <UniqueIdentifier>{174b9125-76a7-4796-be97-79c2dcc751f1}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\insight\impl">
+      <UniqueIdentifier>{04f27818-7843-4ef3-967c-1761dc892342}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\crypto">
+      <UniqueIdentifier>{9c1ef4c4-5623-4500-859f-12d6ce5ae362}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\crypto\impl">
+      <UniqueIdentifier>{fc3d3f14-9ba1-43e4-b086-cbbd2f63b944}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="beast\crypto\impl\sha2">
+      <UniqueIdentifier>{44489531-f44a-439a-a6ea-d32c252b1e8b}</UniqueIdentifier>
+    </Filter>
  </ItemGroup>
  <ItemGroup>
    <ClInclude Include="..\..\modules\beast_core\beast_core.h">
      <Filter>beast_core</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\containers\AbstractFifo.h">
-      <Filter>beast_core\containers</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\containers\Array.h">
      <Filter>beast_core\containers</Filter>
    </ClInclude>
@@ -338,9 +329,6 @@
    <ClInclude Include="..\..\modules\beast_core\containers\ScopedValueSetter.h">
      <Filter>beast_core\containers</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\containers\SortedSet.h">
-      <Filter>beast_core\containers</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\containers\SparseSet.h">
      <Filter>beast_core\containers</Filter>
    </ClInclude>
@@ -380,9 +368,6 @@
    <ClInclude Include="..\..\modules\beast_core\maths\BigInteger.h">
      <Filter>beast_core\maths</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\maths\Expression.h">
-      <Filter>beast_core\maths</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\maths\Random.h">
      <Filter>beast_core\maths</Filter>
    </ClInclude>
@@ -395,9 +380,6 @@
    <ClInclude Include="..\..\modules\beast_core\memory\OptionalScopedPointer.h">
      <Filter>beast_core\memory</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\WeakReference.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\misc\Result.h">
      <Filter>beast_core\misc</Filter>
    </ClInclude>
@@ -563,21 +545,6 @@
    <ClInclude Include="..\..\modules\beast_core\memory\MemoryAlignment.h">
      <Filter>beast_core\memory</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicCounter.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicFlag.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicPointer.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\AtomicState.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\containers\LockFreeQueue.h">
-      <Filter>beast_core\containers</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\threads\SpinDelay.h">
      <Filter>beast_core\threads</Filter>
    </ClInclude>
@@ -587,33 +554,15 @@
    <ClInclude Include="..\..\modules\beast_core\diagnostic\Throw.h">
      <Filter>beast_core\diagnostic</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\maths\Interval.h">
-      <Filter>beast_core\maths</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\diagnostic\UnitTest.h">
      <Filter>beast_core\diagnostic</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_crypto\beast_crypto.h">
-      <Filter>beast_crypto</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\containers\SharedObjectArray.h">
-      <Filter>beast_core\containers</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\files\RandomAccessFile.h">
      <Filter>beast_core\files</Filter>
    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\diagnostic\UnitTestUtilities.h">
      <Filter>beast_core\diagnostic</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\memory\RecycledObjectPool.h">
-      <Filter>beast_core\memory</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_db\beast_db.h">
-      <Filter>beast_db</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_db\keyvalue\KeyvaDB.h">
-      <Filter>beast_db\keyvalue</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_sqlite\beast_sqlite.h">
      <Filter>beast_sqlite</Filter>
    </ClInclude>
@@ -719,9 +668,6 @@
    <ClInclude Include="..\..\modules\beast_core\thread\DeadlineTimer.h">
      <Filter>beast_core\thread</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_core\thread\Semaphore.h">
-      <Filter>beast_core\thread</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\thread\Workers.h">
      <Filter>beast_core\thread</Filter>
    </ClInclude>
@@ -740,12 +686,6 @@
    <ClInclude Include="..\..\modules\beast_asio\system\BoostIncludes.h">
      <Filter>beast_asio\system</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_extras\traits\BoostLockableTraits.h">
-      <Filter>beast_extras\traits</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_extras\beast_extras.h">
-      <Filter>beast_extras</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\system\BeforeBoost.h">
      <Filter>beast_core\system</Filter>
    </ClInclude>
@@ -764,30 +704,6 @@
    <ClInclude Include="..\..\modules\beast_core\system\SystemStats.h">
      <Filter>beast_core\system</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\beast\intrusive\ForwardList.h">
-      <Filter>beast\intrusive</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\intrusive\PointerTraits.h">
-      <Filter>beast\intrusive</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\RemoveConst.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\RemoveConstVolatile.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\RemoveReference.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\RemoveVolatile.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\AddConst.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\PointerToOther.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_asio\async\ComposedAsyncOperation.h">
      <Filter>beast_asio\async</Filter>
    </ClInclude>
@@ -902,9 +818,6 @@
    <ClInclude Include="..\..\modules\beast_asio\http\HTTPParserImpl.h">
      <Filter>beast_asio\http</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\IfCond.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_asio\basics\BuffersType.h">
      <Filter>beast_asio\basics</Filter>
    </ClInclude>
@@ -920,15 +833,6 @@
    <ClInclude Include="..\..\modules\beast_core\diagnostic\FatalError.h">
      <Filter>beast_core\diagnostic</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_crypto\math\UnsignedInteger.h">
-      <Filter>beast_crypto\math</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_crypto\math\UnsignedIntegerCalc.h">
-      <Filter>beast_crypto\math</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\modules\beast_crypto\math\BinaryEncoding.h">
-      <Filter>beast_crypto\math</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\modules\beast_core\memory\SharedFunction.h">
      <Filter>beast_core\memory</Filter>
    </ClInclude>
@@ -992,12 +896,6 @@
    <ClInclude Include="..\..\beast\intrusive\LockFreeStack.h">
      <Filter>beast\intrusive</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\beast\intrusive\List.h">
-      <Filter>beast\intrusive</Filter>
-    </ClInclude>
-    <ClInclude Include="..\..\beast\mpl\CopyConst.h">
-      <Filter>beast\mpl</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\beast\http\impl\http-parser\http_parser.h">
      <Filter>beast\http\impl\http-parser</Filter>
    </ClInclude>
@@ -1079,9 +977,6 @@
    <ClInclude Include="..\..\beast\FixedArray.h">
      <Filter>beast</Filter>
    </ClInclude>
-    <ClInclude Include="..\..\beast\intrusive\IntrusiveArray.h">
-      <Filter>beast\intrusive</Filter>
-    </ClInclude>
    <ClInclude Include="..\..\beast\Crypto.h">
      <Filter>beast</Filter>
    </ClInclude>
@@ -1263,11 +1158,92 @@
    <ClInclude Include="..\..\beast\crypto\MurmurHash.h">
      <Filter>beast\crypto</Filter>
    </ClInclude>
+    <ClInclude Include="..\..\beast\smart_ptr\AbstractObject.h">
+      <Filter>beast\smart_ptr</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\stl\shared_ptr.h">
+      <Filter>beast\stl</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\STL.h">
+      <Filter>beast</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\Insight.h">
+      <Filter>beast</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Collector.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Counter.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\CounterImpl.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Event.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\EventImpl.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Gauge.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\GaugeImpl.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Meter.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\MeterImpl.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\NullCollector.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\StatsDCollector.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\Hook.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\insight\HookImpl.h">
+      <Filter>beast\insight</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\cyclic_iterator.h">
+      <Filter>beast</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\threads\semaphore.h">
+      <Filter>beast\threads</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\intrusive\List.h">
+      <Filter>beast\intrusive</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\crypto\BinaryEncoding.h">
+      <Filter>beast\crypto</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\crypto\UnsignedInteger.h">
+      <Filter>beast\crypto</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\crypto\UnsignedIntegerCalc.h">
+      <Filter>beast\crypto</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\chrono\abstract_clock.h">
+      <Filter>beast\chrono</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\chrono\manual_clock.h">
+      <Filter>beast\chrono</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\chrono\ratio_io.h">
+      <Filter>beast\chrono</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\chrono\chrono_io.h">
+      <Filter>beast\chrono</Filter>
+    </ClInclude>
+    <ClInclude Include="..\..\beast\utility\hash_pair.h">
+      <Filter>beast\utility</Filter>
+    </ClInclude>
  </ItemGroup>
  <ItemGroup>
-    <ClCompile Include="..\..\modules\beast_core\containers\AbstractFifo.cpp">
-      <Filter>beast_core\containers</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\containers\DynamicObject.cpp">
      <Filter>beast_core\containers</Filter>
    </ClCompile>
@@ -1310,9 +1286,6 @@
    <ClCompile Include="..\..\modules\beast_core\maths\BigInteger.cpp">
      <Filter>beast_core\maths</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_core\maths\Expression.cpp">
-      <Filter>beast_core\maths</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\maths\Random.cpp">
      <Filter>beast_core\maths</Filter>
    </ClCompile>
@@ -1514,12 +1487,6 @@
    <ClCompile Include="..\..\modules\beast_core\diagnostic\UnitTestUtilities.cpp">
      <Filter>beast_core\diagnostic</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_db\beast_db.cpp">
-      <Filter>beast_db</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_db\keyvalue\KeyvaDB.cpp">
-      <Filter>beast_db\keyvalue</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_sqlite\beast_sqlite.c">
      <Filter>beast_sqlite</Filter>
    </ClCompile>
@@ -1577,9 +1544,6 @@
    <ClCompile Include="..\..\modules\beast_core\thread\DeadlineTimer.cpp">
      <Filter>beast_core\thread</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_core\thread\Semaphore.cpp">
-      <Filter>beast_core\thread</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\thread\Workers.cpp">
      <Filter>beast_core\thread</Filter>
    </ClCompile>
@@ -1658,9 +1622,6 @@
    <ClCompile Include="..\..\modules\beast_asio\http\HTTPParser.cpp">
      <Filter>beast_asio\http</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_crypto\beast_crypto.cpp">
-      <Filter>beast_crypto</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\modules\beast_core\beast_core.cpp">
      <Filter>beast_core</Filter>
    </ClCompile>
@@ -1676,15 +1637,6 @@
    <ClCompile Include="..\..\modules\beast_core\diagnostic\FatalError.cpp">
      <Filter>beast_core\diagnostic</Filter>
    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_crypto\math\UnsignedInteger.cpp">
-      <Filter>beast_crypto\math</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_crypto\math\BinaryEncoding.cpp">
-      <Filter>beast_crypto\math</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\modules\beast_extras\beast_extras.cpp">
-      <Filter>beast_extras</Filter>
-    </ClCompile>
    <ClCompile Include="..\..\beast\net\Net.cpp">
      <Filter>beast\net</Filter>
    </ClCompile>
@@ -1817,6 +1769,42 @@
    <ClCompile Include="..\..\beast\crypto\impl\MurmurHash.cpp">
      <Filter>beast\crypto\impl</Filter>
    </ClCompile>
+    <ClCompile Include="..\..\beast\smart_ptr\impl\AbstractObject.cpp">
+      <Filter>beast\smart_ptr\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\stl\STL.cpp">
+      <Filter>beast\stl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\Insight.cpp">
+      <Filter>beast\insight</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Collector.cpp">
+      <Filter>beast\insight\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Metric.cpp">
+      <Filter>beast\insight\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\NullCollector.cpp">
+      <Filter>beast\insight\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\StatsDCollector.cpp">
+      <Filter>beast\insight\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\insight\impl\Hook.cpp">
+      <Filter>beast\insight\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\chrono\impl\abstract_clock.cpp">
+      <Filter>beast\chrono\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\chrono\impl\chrono_io.cpp">
+      <Filter>beast\chrono\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\crypto\impl\BinaryEncoding.cpp">
+      <Filter>beast\crypto\impl</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\beast\crypto\impl\UnsignedInteger.cpp">
+      <Filter>beast\crypto\impl</Filter>
+    </ClCompile>
  </ItemGroup>
  <ItemGroup>
    <Text Include="..\..\TODO.txt">
--- a/src/beast/TODO.txt
+++ b/src/beast/TODO.txt
@@ -52,8 +52,6 @@ BEAST TODO

 - Rename include guards to boost style, e.g. BEAST_THROW_H_INCLUDED

- Decide if we should get rid of AtomicCounter, AtomicFlag, AtomicPointer, AtomicState
-
 - Clean up CacheLine, StaticObject

 - Clean up ConcurrentObject
--- a/src/beast/beast/Boost.h
+++ b/src/beast/beast/Boost.h
@@ -3,10 +3,6 @@
    This file is part of Beast: https://github.com/vinniefalco/Beast
    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>

-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
    Permission to use, copy, modify, and/or distribute this software for any
    purpose  with  or without fee is hereby granted, provided that the above
    copyright notice and this permission notice appear in all copies.
--- a/src/beast/beast/Chrono.h
+++ b/src/beast/beast/Chrono.h
@@ -20,6 +20,11 @@
 #ifndef BEAST_CHRONO_H_INCLUDED
 #define BEAST_CHRONO_H_INCLUDED

+#include "chrono/abstract_clock.h"
+#include "chrono/chrono_io.h"
+#include "chrono/manual_clock.h"
+#include "chrono/ratio_io.h"
+
 #include "chrono/CPUMeter.h"
 #include "chrono/RelativeTime.h"
 #include "chrono/ScopedTimeInterval.h"
--- a/src/beast/beast/Crypto.h
+++ b/src/beast/beast/Crypto.h
@@ -20,8 +20,11 @@
 #ifndef BEAST_CRYPTO_H_INCLUDED
 #define BEAST_CRYPTO_H_INCLUDED

+#include "crypto/BinaryEncoding.h"
 #include "crypto/MurmurHash.h"
 #include "crypto/Sha256.h"
+#include "crypto/UnsignedInteger.h"
+#include "crypto/UnsignedIntegerCalc.h"

 #endif

--- a/src/beast/beast/FixedArray.h
+++ b/src/beast/beast/FixedArray.h
@@ -139,7 +139,8 @@ bool operator!= (FixedArray <T, N> const& lhs, FixedArray <T, N> const& rhs)
 template <class T, std::size_t N>
 bool operator< (FixedArray <T, N> const& lhs, FixedArray <T, N> const& rhs)
 {
-    return std::lexicographical_compare (lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
+    return std::lexicographical_compare (
+        lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
 }

 template <class T, std::size_t N>
--- a/src/beast/beast/Insight.h
+++ b/src/beast/beast/Insight.h
@@ -0,0 +1,35 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_H_INCLUDED
+#define BEAST_INSIGHT_H_INCLUDED
+
+#include "insight/Counter.h"
+#include "insight/CounterImpl.h"
+#include "insight/Event.h"
+#include "insight/EventImpl.h"
+#include "insight/Gauge.h"
+#include "insight/GaugeImpl.h"
+#include "insight/Hook.h"
+#include "insight/HookImpl.h"
+#include "insight/Collector.h"
+#include "insight/NullCollector.h"
+#include "insight/StatsDCollector.h"
+
+#endif
--- a/src/beast/beast/Intrusive.h
+++ b/src/beast/beast/Intrusive.h
@@ -20,8 +20,6 @@
 #ifndef BEAST_INTRUSIVE_H_INCLUDED
 #define BEAST_INTRUSIVE_H_INCLUDED

-#include "intrusive/ForwardList.h"
-#include "intrusive/IntrusiveArray.h"
 #include "intrusive/List.h"
 #include "intrusive/LockFreeStack.h"

--- a/src/beast/beast/MPL.h
+++ b/src/beast/beast/MPL.h
@@ -20,14 +20,6 @@
 #ifndef BEAST_MPL_H_INCLUDED
 #define BEAST_MPL_H_INCLUDED

-#include "mpl/AddConst.h"
-#include "mpl/CopyConst.h"
-#include "mpl/IfCond.h"
 #include "mpl/IsCallPossible.h"
-#include "mpl/PointerToOther.h"
-#include "mpl/RemoveConst.h"
-#include "mpl/RemoveConstVolatile.h"
-#include "mpl/RemoveReference.h"
-#include "mpl/RemoveVolatile.h"

 #endif
--- a/src/beast/beast/Memory.h
+++ b/src/beast/beast/Memory.h
@@ -27,6 +27,7 @@
 #include <cstring>
    
 #include "Config.h"
+#include "Uncopyable.h"

 namespace beast {

--- a/src/beast/beast/STL.h
+++ b/src/beast/beast/STL.h
@@ -0,0 +1,25 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_STL_H_INCLUDED
+#define BEAST_STL_H_INCLUDED
+
+#include "stl/shared_ptr.h"
+
+#endif
--- a/src/beast/beast/SmartPtr.h
+++ b/src/beast/beast/SmartPtr.h
@@ -22,6 +22,7 @@

 #include "Config.h"

+#include "smart_ptr/AbstractObject.h"
 #include "smart_ptr/ContainerDeletePolicy.h"
 #include "smart_ptr/SharedObject.h"
 #include "smart_ptr/SharedPtr.h"
--- a/src/beast/beast/Threads.h
+++ b/src/beast/beast/Threads.h
@@ -34,4 +34,6 @@
 #include "threads/WaitableEvent.h"
 #include "threads/ScopedWrapperContext.h"

+#include "threads/semaphore.h"
+
 #endif
--- a/src/beast/beast/Utility.h
+++ b/src/beast/beast/Utility.h
@@ -29,5 +29,7 @@
 #include "utility/PropertyStream.h"
 #include "utility/StaticObject.h"

+#include "utility/hash_pair.h"
+
 #endif

--- a/src/beast/beast/chrono/Chrono.cpp
+++ b/src/beast/beast/chrono/Chrono.cpp
@@ -19,5 +19,11 @@

 #include "BeastConfig.h"

+#include "../Config.h"
+#include "../../modules/beast_core/beast_core.h" // for UnitTest
+
+#include "impl/abstract_clock.cpp"
+#include "impl/chrono_io.cpp"
+
 #include "impl/CPUMeter.cpp"
 #include "impl/RelativeTime.cpp"
--- a/src/beast/beast/chrono/abstract_clock.h
+++ b/src/beast/beast/chrono/abstract_clock.h
@@ -0,0 +1,166 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_CHRONO_ABSTRACT_CLOCK_H_INCLUDED
+#define BEAST_CHRONO_ABSTRACT_CLOCK_H_INCLUDED
+
+#include <chrono>
+
+#include "chrono_io.h"
+
+namespace beast {
+
+/** Abstract interface to a clock.
+
+    The abstract clock interface allows a dependency injection to take
+    place so that the choice of implementation can be made at run-time
+    instead of compile time. The trade-off is that the Duration used to
+    represent the clock must be chosen at compile time and cannot be
+    changed. This includes both the choice of representation (integers
+    for example) and the period in ticks corresponding to one second.
+
+    Example:
+
+    @code
+
+    struct Implementation
+    {
+        abstract_clock <std::chrono::seconds>& m_clock;
+
+        // Dependency injection
+        //
+        explicit Implementation (
+            abstract_clock <std::chrono::seconds>& clock)
+            : m_clock (clock)
+        {
+        }
+    };
+
+    @endcode
+
+    @tparam The length of time, in seconds, corresponding to one tick.
+*/
+template <class Duration>
+class abstract_clock
+{
+public:
+    typedef typename Duration::rep rep;
+    typedef typename Duration::period period;
+    typedef Duration duration;
+    typedef std::chrono::time_point <
+        abstract_clock, duration> time_point;
+
+    virtual ~abstract_clock () { }
+
+    /** Returns `true` if this is a steady clock. */
+    virtual bool is_steady () const = 0;
+
+    /** Returns the current time. */
+    virtual time_point now () = 0;
+
+    /** Convert the specified time point to a string. */
+    /** @{ */
+    virtual std::string to_string (time_point const& tp) = 0;
+
+    template <class Duration2>
+    std::string to_string (
+        std::chrono::time_point <abstract_clock, Duration2> const& tp)
+    {
+        return to_string (
+            std::chrono::time_point_cast <Duration> (tp));
+    }
+    /** @} */
+
+    /** Returning elapsed ticks since the epoch. */
+    rep elapsed ()
+    {
+        return now().time_since_epoch().count();
+    }
+};
+
+//------------------------------------------------------------------------------
+
+namespace detail {
+
+template <class TrivialClock, class Duration>
+struct basic_abstract_clock_wrapper : public abstract_clock <Duration>
+{
+    using typename abstract_clock <Duration>::duration;
+    using typename abstract_clock <Duration>::time_point;
+
+    bool is_steady () const
+    {
+        return TrivialClock::is_steady;
+    }
+
+    time_point now ()
+    {
+        return time_point (duration (
+            std::chrono::duration_cast <duration> (
+                TrivialClock::now().time_since_epoch ()).count ()));
+    }
+};
+
+template <class TrivialClock, class Duration>
+struct abstract_clock_wrapper
+    : public basic_abstract_clock_wrapper <TrivialClock, Duration>
+{
+       // generic conversion displays the duration
+    std::string to_string (typename basic_abstract_clock_wrapper <
+        TrivialClock, Duration>::time_point const& tp)
+    {
+        std::stringstream ss;
+        ss << tp.time_since_epoch();
+        return ss.str ();
+    }
+};
+
+/*
+template <class Duration>
+struct abstract_clock_wrapper <std::chrono::system_clock, Duration>
+    : public basic_abstract_clock_wrapper <std::chrono::system_clock, Duration>
+{
+    typedef std::chrono::system_clock clock_type;
+    std::string to_string (time_point const& tp)
+    {
+        std::stringstream ss;
+        ss << clock_type::time_point (tp.time_since_epoch ());
+        return ss.str ();
+    }
+};
+*/
+
+}
+
+//------------------------------------------------------------------------------
+
+/** Retrieve a discrete clock for a type implementing the Clock concept.
+    The interface is created as an object with static storage duration.
+*/
+template <class TrivialClock, class Duration>
+abstract_clock <Duration>& get_abstract_clock ()
+{
+    static detail::abstract_clock_wrapper <
+        TrivialClock, Duration> clock;
+    return clock;
+}
+
+}
+
+#endif
--- a/src/beast/beast/chrono/chrono_io.h
+++ b/src/beast/beast/chrono/chrono_io.h
--- a/src/beast/beast/chrono/impl/RelativeTime.cpp
+++ b/src/beast/beast/chrono/impl/RelativeTime.cpp
@@ -256,23 +256,29 @@ std::string RelativeTime::to_string () const
 }

 }
-
-namespace beast {
-	
-namespace detail {
 	
 #if BEAST_WINDOWS

 #include <windows.h>

+namespace beast {
+namespace detail {
+
 static double monotonicCurrentTimeInSeconds()
 {
 	return GetTickCount64() / 1000.0;
 }
+ 
+}
+}
 	
 #elif BEAST_MAC || BEAST_IOS

-#include <time.h>
+#include <mach/mach_time.h>
+#include <mach/mach.h>
+
+namespace beast {
+namespace detail {
 	
 static double monotonicCurrentTimeInSeconds()
 {
@@ -309,20 +315,31 @@ static double monotonicCurrentTimeInSeconds()

    return mach_absolute_time() * data.ratio;
 }
+}
+}

 #else
 	
 #include <time.h>

+namespace beast {
+namespace detail {
+
 static double monotonicCurrentTimeInSeconds()
 {
 	timespec t;
 	clock_gettime (CLOCK_MONOTONIC, &t);
 	return t.tv_sec + t.tv_nsec / 1000000000.0;
 }
+
+}
+}
 	
 #endif

+namespace beast {
+namespace detail {
+
 // Records and returns the time from process startup
 static double getStartupTime()
 {
--- a/src/beast/beast/chrono/impl/abstract_clock.cpp
+++ b/src/beast/beast/chrono/impl/abstract_clock.cpp
@@ -0,0 +1,98 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#include "../abstract_clock.h"
+#include "../manual_clock.h"
+
+#include <thread>
+
+#include <string>
+#include <sstream>
+
+namespace beast {
+
+class abstract_clock_tests : public UnitTest
+{
+public:
+    void test (abstract_clock <std::chrono::seconds>& c)
+    {
+        {
+            auto const t1 (c.now ());
+            std::this_thread::sleep_for (
+                std::chrono::milliseconds (1500));
+            auto const t2 (c.now ());
+
+            std::stringstream ss;
+            ss <<
+                "t1= " << c.to_string (t1) <<
+                ", t2= " << c.to_string (t2) <<
+                ", elapsed= " << (t2 - t1);
+            logMessage (ss.str());
+        }
+    }
+
+    void test_manual ()
+    {
+        typedef manual_clock <std::chrono::seconds> clock_type;
+        clock_type c;
+
+        std::stringstream ss;
+
+        ss << "now() = " << c.to_string (c.now ()) << std::endl;
+
+        c.set (clock_type::time_point (std::chrono::seconds (1)));
+        ss << "now() = " << c.to_string (c.now ()) << std::endl;
+
+        c.set (clock_type::time_point (std::chrono::seconds (2)));
+        ss << "now() = " << c.to_string (c.now ()) << std::endl;
+
+        logMessage (ss.str());
+    }
+
+    void runTest ()
+    {
+        beginTestCase ("Syntax");
+
+        logMessage ("steady_clock");
+        test (get_abstract_clock <std::chrono::steady_clock,
+            std::chrono::seconds> ());
+
+        logMessage ("system_clock");
+        test (get_abstract_clock <std::chrono::system_clock,
+            std::chrono::seconds> ());
+
+        logMessage ("high_resolution_clock");
+        test (get_abstract_clock <std::chrono::high_resolution_clock,
+            std::chrono::seconds> ());
+
+        logMessage ("manual_clock");
+        test_manual ();
+
+        pass ();
+    }
+
+    abstract_clock_tests ()
+        : UnitTest ("abstract_clock", "beast", runManual)
+    {
+    }
+};
+
+static abstract_clock_tests abstract_clock_tests_;
+
+}
--- a/src/beast/beast/chrono/impl/chrono_io.cpp
+++ b/src/beast/beast/chrono/impl/chrono_io.cpp
@@ -17,30 +17,25 @@
 */
 //==============================================================================

-#ifndef BEAST_MPL_IFCOND_H_INCLUDED
-#define BEAST_MPL_IFCOND_H_INCLUDED
+//  chrono_io
+//
+//  (C) Copyright Howard Hinnant
+//  Use, modification and distribution are subject to the Boost Software License,
+//  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt).

-namespace beast {
-namespace mpl {
+#include "../chrono_io.h"

-// Ideas based on boost
+//_LIBCPP_BEGIN_NAMESPACE_STD
+namespace std {

-/** Select between T1 or T2 depending on Condition. */
-/** @{ */
-template <bool Condition, typename T1, typename T2>
-struct IfCond
+namespace chrono
 {
-    typedef T1 type;
-};

-template <typename T1, typename T2>
-struct IfCond <false, T1, T2>
-{
-    typedef T2 type;
-};
-/** @} */
+locale::id
+durationpunct::id;

+}  // chrono
+
+//_LIBCPP_END_NAMESPACE_STD
 }
-}
-
-#endif
--- a/src/beast/beast/chrono/manual_clock.h
+++ b/src/beast/beast/chrono/manual_clock.h
@@ -0,0 +1,92 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_CHRONO_MANUAL_CLOCK_H_INCLUDED
+#define BEAST_CHRONO_MANUAL_CLOCK_H_INCLUDED
+
+#include "abstract_clock.h"
+
+namespace beast {
+
+/** Manual clock implementation.
+    This concrete class implements the @ref abstract_clock interface and
+    allows the time to be advanced manually, mainly for the purpose of
+    providing a clock in unit tests.
+    @tparam The length of time, in seconds, corresponding to one tick.
+*/
+template <class Duration, bool IsSteady = true>
+class manual_clock : public abstract_clock <Duration>
+{
+public:
+    using typename abstract_clock <Duration>::rep;
+    using typename abstract_clock <Duration>::duration;
+    using typename abstract_clock <Duration>::time_point;
+
+    explicit manual_clock (time_point const& t = time_point (Duration (0)))
+        : m_now (t)
+    {
+    }
+
+    bool is_steady () const
+    {
+        return IsSteady;
+    }
+
+    time_point now ()
+    {
+        return m_now;
+    }
+
+    std::string to_string (time_point const& tp)
+    {
+        std::stringstream ss;
+        ss << tp.time_since_epoch() << " from start";
+        return ss.str ();
+    }
+
+    /** Set the current time of the manual clock.
+        Precondition:
+            ! IsSteady || t > now()
+    */
+    void set (time_point const& t)
+    {
+        //if (IsSteady)
+        m_now = t;
+    }
+
+    /** Convenience for setting the time using a duration in @ref rep units. */
+    void set (rep v)
+    {
+        set (time_point (duration (v)));
+    }
+
+    /** Convenience for advancing the clock by one. */
+    manual_clock& operator++ ()
+    {
+        m_now += duration (1);
+        return *this;
+    }
+
+private:
+    time_point m_now;
+};
+
+}
+
+#endif
--- a/src/beast/beast/chrono/ratio_io.h
+++ b/src/beast/beast/chrono/ratio_io.h
@@ -0,0 +1,622 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+//  ratio_io
+//
+//  (C) Copyright Howard Hinnant
+//  Use, modification and distribution are subject to the Boost Software License,
+//  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt).
+
+#ifndef BEAST_CHRONO_RATIO_IO_H_INCLUDED
+#define BEAST_CHRONO_RATIO_IO_H_INCLUDED
+
+/*
+
+    ratio_io synopsis
+
+#include <ratio>
+#include <string>
+
+namespace std
+{
+
+template <class Ratio, class charT>
+struct ratio_string
+{
+    static basic_string<charT> symbol();
+    static basic_string<charT> prefix();
+};
+
+}  // std
+
+*/
+
+#include <ratio>
+#include <string>
+#include <sstream>
+
+//_LIBCPP_BEGIN_NAMESPACE_STD
+namespace std {
+
+template <class _Ratio, class _CharT>
+struct ratio_string
+{
+    static basic_string<_CharT> symbol() {return prefix();}
+    static basic_string<_CharT> prefix();
+};
+
+template <class _Ratio, class _CharT>
+basic_string<_CharT>
+ratio_string<_Ratio, _CharT>::prefix()
+{
+    basic_ostringstream<_CharT> __os;
+    __os << _CharT('[') << _Ratio::num << _CharT('/')
+                        << _Ratio::den << _CharT(']');
+    return __os.str();
+}
+
+// atto
+
+template <>
+struct ratio_string<atto, char>
+{
+    static string symbol() {return string(1, 'a');}
+    static string prefix()  {return string("atto");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<atto, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'a');}
+    static u16string prefix()  {return u16string(u"atto");}
+};
+
+template <>
+struct ratio_string<atto, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'a');}
+    static u32string prefix()  {return u32string(U"atto");}
+};
+
+#endif
+
+template <>
+struct ratio_string<atto, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'a');}
+    static wstring prefix()  {return wstring(L"atto");}
+};
+
+// femto
+
+template <>
+struct ratio_string<femto, char>
+{
+    static string symbol() {return string(1, 'f');}
+    static string prefix()  {return string("femto");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<femto, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'f');}
+    static u16string prefix()  {return u16string(u"femto");}
+};
+
+template <>
+struct ratio_string<femto, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'f');}
+    static u32string prefix()  {return u32string(U"femto");}
+};
+
+#endif
+
+template <>
+struct ratio_string<femto, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'f');}
+    static wstring prefix()  {return wstring(L"femto");}
+};
+
+// pico
+
+template <>
+struct ratio_string<pico, char>
+{
+    static string symbol() {return string(1, 'p');}
+    static string prefix()  {return string("pico");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<pico, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'p');}
+    static u16string prefix()  {return u16string(u"pico");}
+};
+
+template <>
+struct ratio_string<pico, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'p');}
+    static u32string prefix()  {return u32string(U"pico");}
+};
+
+#endif
+
+template <>
+struct ratio_string<pico, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'p');}
+    static wstring prefix()  {return wstring(L"pico");}
+};
+
+// nano
+
+template <>
+struct ratio_string<nano, char>
+{
+    static string symbol() {return string(1, 'n');}
+    static string prefix()  {return string("nano");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<nano, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'n');}
+    static u16string prefix()  {return u16string(u"nano");}
+};
+
+template <>
+struct ratio_string<nano, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'n');}
+    static u32string prefix()  {return u32string(U"nano");}
+};
+
+#endif
+
+template <>
+struct ratio_string<nano, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'n');}
+    static wstring prefix()  {return wstring(L"nano");}
+};
+
+// micro
+
+template <>
+struct ratio_string<micro, char>
+{
+    static string symbol() {return string("\xC2\xB5");}
+    static string prefix()  {return string("micro");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<micro, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'\xB5');}
+    static u16string prefix()  {return u16string(u"micro");}
+};
+
+template <>
+struct ratio_string<micro, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'\xB5');}
+    static u32string prefix()  {return u32string(U"micro");}
+};
+
+#endif
+
+template <>
+struct ratio_string<micro, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'\xB5');}
+    static wstring prefix()  {return wstring(L"micro");}
+};
+
+// milli
+
+template <>
+struct ratio_string<milli, char>
+{
+    static string symbol() {return string(1, 'm');}
+    static string prefix()  {return string("milli");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<milli, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'm');}
+    static u16string prefix()  {return u16string(u"milli");}
+};
+
+template <>
+struct ratio_string<milli, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'm');}
+    static u32string prefix()  {return u32string(U"milli");}
+};
+
+#endif
+
+template <>
+struct ratio_string<milli, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'm');}
+    static wstring prefix()  {return wstring(L"milli");}
+};
+
+// centi
+
+template <>
+struct ratio_string<centi, char>
+{
+    static string symbol() {return string(1, 'c');}
+    static string prefix()  {return string("centi");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<centi, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'c');}
+    static u16string prefix()  {return u16string(u"centi");}
+};
+
+template <>
+struct ratio_string<centi, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'c');}
+    static u32string prefix()  {return u32string(U"centi");}
+};
+
+#endif
+
+template <>
+struct ratio_string<centi, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'c');}
+    static wstring prefix()  {return wstring(L"centi");}
+};
+
+// deci
+
+template <>
+struct ratio_string<deci, char>
+{
+    static string symbol() {return string(1, 'd');}
+    static string prefix()  {return string("deci");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<deci, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'd');}
+    static u16string prefix()  {return u16string(u"deci");}
+};
+
+template <>
+struct ratio_string<deci, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'd');}
+    static u32string prefix()  {return u32string(U"deci");}
+};
+
+#endif
+
+template <>
+struct ratio_string<deci, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'd');}
+    static wstring prefix()  {return wstring(L"deci");}
+};
+
+// deca
+
+template <>
+struct ratio_string<deca, char>
+{
+    static string symbol() {return string("da");}
+    static string prefix()  {return string("deca");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<deca, char16_t>
+{
+    static u16string symbol() {return u16string(u"da");}
+    static u16string prefix()  {return u16string(u"deca");}
+};
+
+template <>
+struct ratio_string<deca, char32_t>
+{
+    static u32string symbol() {return u32string(U"da");}
+    static u32string prefix()  {return u32string(U"deca");}
+};
+
+#endif
+
+template <>
+struct ratio_string<deca, wchar_t>
+{
+    static wstring symbol() {return wstring(L"da");}
+    static wstring prefix()  {return wstring(L"deca");}
+};
+
+// hecto
+
+template <>
+struct ratio_string<hecto, char>
+{
+    static string symbol() {return string(1, 'h');}
+    static string prefix()  {return string("hecto");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<hecto, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'h');}
+    static u16string prefix()  {return u16string(u"hecto");}
+};
+
+template <>
+struct ratio_string<hecto, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'h');}
+    static u32string prefix()  {return u32string(U"hecto");}
+};
+
+#endif
+
+template <>
+struct ratio_string<hecto, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'h');}
+    static wstring prefix()  {return wstring(L"hecto");}
+};
+
+// kilo
+
+template <>
+struct ratio_string<kilo, char>
+{
+    static string symbol() {return string(1, 'k');}
+    static string prefix()  {return string("kilo");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<kilo, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'k');}
+    static u16string prefix()  {return u16string(u"kilo");}
+};
+
+template <>
+struct ratio_string<kilo, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'k');}
+    static u32string prefix()  {return u32string(U"kilo");}
+};
+
+#endif
+
+template <>
+struct ratio_string<kilo, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'k');}
+    static wstring prefix()  {return wstring(L"kilo");}
+};
+
+// mega
+
+template <>
+struct ratio_string<mega, char>
+{
+    static string symbol() {return string(1, 'M');}
+    static string prefix()  {return string("mega");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<mega, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'M');}
+    static u16string prefix()  {return u16string(u"mega");}
+};
+
+template <>
+struct ratio_string<mega, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'M');}
+    static u32string prefix()  {return u32string(U"mega");}
+};
+
+#endif
+
+template <>
+struct ratio_string<mega, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'M');}
+    static wstring prefix()  {return wstring(L"mega");}
+};
+
+// giga
+
+template <>
+struct ratio_string<giga, char>
+{
+    static string symbol() {return string(1, 'G');}
+    static string prefix()  {return string("giga");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<giga, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'G');}
+    static u16string prefix()  {return u16string(u"giga");}
+};
+
+template <>
+struct ratio_string<giga, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'G');}
+    static u32string prefix()  {return u32string(U"giga");}
+};
+
+#endif
+
+template <>
+struct ratio_string<giga, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'G');}
+    static wstring prefix()  {return wstring(L"giga");}
+};
+
+// tera
+
+template <>
+struct ratio_string<tera, char>
+{
+    static string symbol() {return string(1, 'T');}
+    static string prefix()  {return string("tera");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<tera, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'T');}
+    static u16string prefix()  {return u16string(u"tera");}
+};
+
+template <>
+struct ratio_string<tera, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'T');}
+    static u32string prefix()  {return u32string(U"tera");}
+};
+
+#endif
+
+template <>
+struct ratio_string<tera, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'T');}
+    static wstring prefix()  {return wstring(L"tera");}
+};
+
+// peta
+
+template <>
+struct ratio_string<peta, char>
+{
+    static string symbol() {return string(1, 'P');}
+    static string prefix()  {return string("peta");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<peta, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'P');}
+    static u16string prefix()  {return u16string(u"peta");}
+};
+
+template <>
+struct ratio_string<peta, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'P');}
+    static u32string prefix()  {return u32string(U"peta");}
+};
+
+#endif
+
+template <>
+struct ratio_string<peta, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'P');}
+    static wstring prefix()  {return wstring(L"peta");}
+};
+
+// exa
+
+template <>
+struct ratio_string<exa, char>
+{
+    static string symbol() {return string(1, 'E');}
+    static string prefix()  {return string("exa");}
+};
+
+#if HAS_UNICODE_SUPPORT
+
+template <>
+struct ratio_string<exa, char16_t>
+{
+    static u16string symbol() {return u16string(1, u'E');}
+    static u16string prefix()  {return u16string(u"exa");}
+};
+
+template <>
+struct ratio_string<exa, char32_t>
+{
+    static u32string symbol() {return u32string(1, U'E');}
+    static u32string prefix()  {return u32string(U"exa");}
+};
+
+#endif
+
+template <>
+struct ratio_string<exa, wchar_t>
+{
+    static wstring symbol() {return wstring(1, L'E');}
+    static wstring prefix()  {return wstring(L"exa");}
+};
+
+//_LIBCPP_END_NAMESPACE_STD
+}
+
+#endif  // _RATIO_IO
--- a/src/beast/beast/config/PlatformConfig.h
+++ b/src/beast/beast/config/PlatformConfig.h
@@ -174,7 +174,6 @@

 #ifdef __clang__
 #define BEAST_CLANG 1
- #define BEAST_GCC 1
 #elif defined (__GNUC__)
  #define BEAST_GCC 1
 #elif defined (_MSC_VER)
--- a/src/beast/modules/beast_crypto/math/BinaryEncoding.h
+++ b/src/beast/modules/beast_crypto/math/BinaryEncoding.h
@@ -20,5 +20,4 @@
 #ifndef BEAST_CRYPTO_BINARYENCODING_H_INCLUDED
 #define BEAST_CRYPTO_BINARYENCODING_H_INCLUDED

-
 #endif
--- a/src/beast/beast/crypto/Crypto.cpp
+++ b/src/beast/beast/crypto/Crypto.cpp
@@ -19,5 +19,9 @@

 #include "BeastConfig.h"

+#include "../../modules/beast_core/beast_core.h" // for UnitTest
+
+#include "impl/BinaryEncoding.cpp"
 #include "impl/MurmurHash.cpp"
 #include "impl/Sha256.cpp"
+#include "impl/UnsignedInteger.cpp"
--- a/src/beast/modules/beast_crypto/math/UnsignedInteger.h
+++ b/src/beast/modules/beast_crypto/math/UnsignedInteger.h
@@ -20,6 +20,15 @@
 #ifndef BEAST_CRYPTO_UNSIGNEDINTEGER_H_INCLUDED
 #define BEAST_CRYPTO_UNSIGNEDINTEGER_H_INCLUDED

+#include "../SafeBool.h"
+#include "UnsignedIntegerCalc.h"
+#include "MurmurHash.h"
+
+#include <cstdint>
+#include <memory>
+
+namespace beast {
+
 /** Represents a set of bits of fixed size.

    The data is stored in "canonical" format which is network (big endian)
@@ -36,13 +45,13 @@ public:
    static std::size_t const size = Bytes;

    // The underlying integer type we use when converting to calculation format.
-    typedef uint32             IntCalcType;
+    typedef std::uint32_t IntCalcType;

    // The type of object resulting from a conversion to calculation format.
    typedef UnsignedIntegerCalc <IntCalcType> CalcType;

    // Standard container compatibility
-    typedef uint8              value_type;
+    typedef std::uint8_t value_type;
    typedef value_type*        iterator;
    typedef value_type const*  const_iterator;

@@ -135,7 +144,8 @@ public:
    template <class UnsignedIntegralType>
    static UnsignedInteger createFromInteger (UnsignedIntegralType value)
    {
-        static_bassert (Bytes >= sizeof (UnsignedIntegralType));
+        static_assert (Bytes >= sizeof (UnsignedIntegralType),
+            "Bytes is too small.");
        UnsignedInteger <Bytes> result;
        value = toNetworkByteOrder <UnsignedIntegralType> (value);
        result.clear ();
@@ -296,4 +306,6 @@ private:
    IntCalcType m_values [CalcCount];
 };

+}
+
 #endif
--- a/src/beast/modules/beast_crypto/math/UnsignedIntegerCalc.h
+++ b/src/beast/modules/beast_crypto/math/UnsignedIntegerCalc.h
@@ -20,22 +20,25 @@
 #ifndef BEAST_CRYPTO_UNSIGNEDINTEGERCALC_H_INCLUDED
 #define BEAST_CRYPTO_UNSIGNEDINTEGERCALC_H_INCLUDED

-namespace detail
-{
+#include <cstdint>
+
+namespace beast {
+
+namespace detail {

 template <typename UInt>
 struct DoubleWidthUInt;

 template <>
-struct DoubleWidthUInt <uint16>
+struct DoubleWidthUInt <std::uint16_t>
 {
-    typedef uint32 type;
+    typedef std::uint32_t type;
 };

 template <>
-struct DoubleWidthUInt <uint32>
+struct DoubleWidthUInt <std::uint32_t>
 {
-    typedef uint64 type;
+    typedef std::uint64_t type;
 };

 }
@@ -427,4 +430,6 @@ private:
    UInt* m_values;
 };

+}
+
 #endif
--- a/src/beast/modules/beast_crypto/math/BinaryEncoding.cpp
+++ b/src/beast/modules/beast_crypto/math/BinaryEncoding.cpp
@@ -17,6 +17,14 @@
 */
 //==============================================================================

+#include "../BinaryEncoding.h"
+#include "../UnsignedInteger.h"
+
+#include <cstddef>
+#include <string>
+
+namespace beast {
+
 /** Generic algorithms for base encoding and decoding. */
 class BinaryEncoding
 {
@@ -393,3 +401,5 @@ public:
 };

 static BinaryEncodingTests BinaryEncodingTests;
+
+}
--- a/src/beast/modules/beast_crypto/math/UnsignedInteger.cpp
+++ b/src/beast/modules/beast_crypto/math/UnsignedInteger.cpp
@@ -3,6 +3,10 @@
    This file is part of Beast: https://github.com/vinniefalco/Beast
    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>

+    Portions are Copyright (c) 2013 the authors listed at the following URL,
+    and/or the authors of referenced articles or incorporated external code:
+    http://en.literateprograms.org/Arbitrary-precision_integer_arithmetic_(C)?action=history&offset=20100923155004
+
    Permission to use, copy, modify, and/or distribute this software for any
    purpose  with  or without fee is hereby granted, provided that the above
    copyright notice and this permission notice appear in all copies.
@@ -17,7 +21,13 @@
 */
 //==============================================================================

-//------------------------------------------------------------------------------
+#include "../UnsignedInteger.h"
+
+namespace beast {
+
+namespace multiprecsion {
+
+#if 0

 /*  Copyright (c) 2013 the authors listed at the following URL, and/or
    the authors of referenced articles or incorporated external code:
@@ -41,15 +51,11 @@
    CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
    TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-    Retrieved from: http://en.literateprograms.org/Arbitrary-precision_integer_arithmetic_(C)?oldid=16902
 */

-namespace multiprecsion
-{
-
-#if 0
-//------------------------------------------------------------------------------
+//
+// Retrieved from: http://en.literateprograms.org/Arbitrary-precision_integer_arithmetic_(C)?oldid=16902
+//

 typedef unsigned short component_t;
 typedef unsigned long double_component_t;
@@ -394,3 +400,5 @@ private:
 };

 static UnsignedIntegerTests unsignedIntegerTests;
+
+}
--- a/src/beast/beast/cyclic_iterator.h
+++ b/src/beast/beast/cyclic_iterator.h
@@ -0,0 +1,513 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Based on work with these copyrights:
+        Copyright Carl Philipp Reh 2009 - 2013.
+        Copyright Philipp Middendorf 2009 - 2013.
+        Distributed under the Boost Software License, Version 1.0.
+        (See accompanying file LICENSE_1_0.txt or copy at
+        http://www.boost.org/LICENSE_1_0.txt)
+
+    Original code taken from
+        https://github.com/freundlich/fcppt
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_CYCLIC_ITERATOR_H_INCLUDED
+#define BEAST_CYCLIC_ITERATOR_H_INCLUDED
+
+#include <iterator>
+#include <boost/iterator/iterator_facade.hpp>
+
+namespace beast {
+
+//
+// cyclic_iterator_fwd.hpp
+//
+
+template<
+        typename ContainerIterator
+>
+class cyclic_iterator;
+
+//
+// cyclic_iterator_category.hpp
+//
+
+namespace detail
+{
+
+template<
+        typename SourceCategory
+>
+struct cyclic_iterator_category;
+
+template<>
+struct cyclic_iterator_category<
+        std::forward_iterator_tag
+>
+{
+        typedef std::forward_iterator_tag type;
+};
+
+template<>
+struct cyclic_iterator_category<
+        std::bidirectional_iterator_tag
+>
+{
+        typedef std::bidirectional_iterator_tag type;
+};
+
+template<>
+struct cyclic_iterator_category<
+        std::random_access_iterator_tag
+>
+{
+        typedef std::bidirectional_iterator_tag type;
+};
+
+}
+
+//
+// cyclic_iterator_base.hpp
+//
+
+namespace detail
+{
+
+template<
+        typename ContainerIterator
+>
+struct cyclic_iterator_base
+{
+        typedef boost::iterator_facade<
+                cyclic_iterator<
+                        ContainerIterator
+                >,
+                typename std::iterator_traits<
+                        ContainerIterator
+                >::value_type,
+                typename detail::cyclic_iterator_category<
+                        typename std::iterator_traits<
+                                ContainerIterator
+                        >::iterator_category
+                >::type,
+                typename std::iterator_traits<
+                        ContainerIterator
+                >::reference
+        > type;
+};
+
+}
+
+//
+// cyclic_iterator_decl.hpp 
+//
+
+/**
+\brief An iterator adaptor that cycles through a range
+
+\ingroup fcpptmain
+
+\tparam ContainerIterator The underlying iterator which must be at least a
+forward iterator
+
+A cyclic iterator can be useful in cases where you want <code>end()</code> to
+become <code>begin()</code> again. For example, imagine a cycling through a
+list of items which means if you skip over the last, you will return to the
+first one.
+
+This class can only increment or decrement its underlying iterator, random
+access is not supported. The iterator category will be at most bidirectional.
+It inherits all capabilities from <code>boost::iterator_facade</code> which
+means that it will have the usual iterator operations with their semantics.
+
+Here is a short example demonstrating its use.
+
+\snippet cyclic_iterator.cpp cyclic_iterator
+*/
+template<
+	typename ContainerIterator
+>
+class cyclic_iterator
+:
+	public detail::cyclic_iterator_base<
+		ContainerIterator
+	>::type
+{
+public:
+	/**
+	\brief The base type which is a <code>boost::iterator_facade</code>
+	*/
+	typedef typename detail::cyclic_iterator_base<
+		ContainerIterator
+	>::type base_type;
+
+	/**
+	\brief The underlying iterator type
+	*/
+	typedef ContainerIterator container_iterator_type;
+
+	/**
+	\brief The value type adapted from \a ContainerIterator
+	*/
+	typedef typename base_type::value_type value_type;
+
+	/**
+	\brief The reference type adapted from \a ContainerIterator
+	*/
+	typedef typename base_type::reference reference;
+
+	/**
+	\brief The pointer type adapted from \a ContainerIterator
+	*/
+	typedef typename base_type::pointer pointer;
+
+	/**
+	\brief The difference type adapted from \a ContainerIterator
+	*/
+	typedef typename base_type::difference_type difference_type;
+
+	/**
+	\brief The iterator category, either Forward or Bidirectional
+	*/
+	typedef typename base_type::iterator_category iterator_category;
+
+	/**
+	\brief Creates a singular iterator
+	*/
+	cyclic_iterator();
+
+	/**
+	\brief Copy constructs from another cyclic iterator
+
+	Copy constructs from another cyclic iterator \a other. This only works
+	if the underlying iterators are convertible.
+
+	\param other The iterator to copy construct from
+	*/
+	template<
+		typename OtherIterator
+	>
+	explicit
+	cyclic_iterator(
+		cyclic_iterator<OtherIterator> const &other
+	);
+
+	/**
+	\brief Constructs a new cyclic iterator
+
+	Constructs a new cyclic iterator, starting at \a it, inside
+	a range from \a begin to \a end.
+
+	\param pos The start of the iterator
+	\param begin The beginning of the range
+	\param end The end of the range
+
+	\warning The behaviour is undefined if \a pos isn't between \a begin
+	and \a end. Also, the behaviour is undefined, if \a begin and \a end
+	don't form a valid range.
+	*/
+	cyclic_iterator(
+		container_iterator_type const &pos,
+		container_iterator_type const &begin,
+		container_iterator_type const &end
+	);
+
+	/**
+	\brief Assigns from another cyclic iterator
+
+	Assigns from another cyclic iterator \a other. This only works if the
+	underlying iterators are convertible.
+
+	\param other The iterator to assign from
+
+	\return <code>*this</code>
+	*/
+	template<
+		typename OtherIterator
+	>
+	cyclic_iterator<ContainerIterator> &
+	operator=(
+		cyclic_iterator<OtherIterator> const &other
+	);
+
+	/**
+	\brief Returns the beginning of the range
+	*/
+	container_iterator_type
+	begin() const;
+
+	/**
+	\brief Returns the end of the range
+	*/
+	container_iterator_type
+	end() const;
+
+	/**
+	\brief Returns the underlying iterator
+	*/
+	container_iterator_type
+	get() const;
+private:
+	friend class boost::iterator_core_access;
+
+	void
+	increment();
+
+	void
+	decrement();
+
+	bool
+	equal(
+		cyclic_iterator const &
+	) const;
+
+	reference
+	dereference() const;
+
+	difference_type
+	distance_to(
+		cyclic_iterator const &
+	) const;
+private:
+	container_iterator_type
+		it_,
+		begin_,
+		end_;
+};
+
+//
+// cyclic_iterator_impl.hpp
+//
+
+template<
+        typename ContainerIterator
+>
+cyclic_iterator<
+        ContainerIterator
+>::cyclic_iterator()
+:
+        it_(),
+        begin_(),
+        end_()
+{
+}
+
+template<
+        typename ContainerIterator
+>
+template<
+        typename OtherIterator
+>
+cyclic_iterator<
+        ContainerIterator
+>::cyclic_iterator(
+        cyclic_iterator<
+                OtherIterator
+        > const &_other
+)
+:
+        it_(
+                _other.it_
+        ),
+        begin_(
+                _other.begin_
+        ),
+        end_(
+                _other.end_
+        )
+{
+}
+
+template<
+        typename ContainerIterator
+>
+cyclic_iterator<
+        ContainerIterator
+>::cyclic_iterator(
+        container_iterator_type const &_it,
+        container_iterator_type const &_begin,
+        container_iterator_type const &_end
+)
+:
+        it_(
+                _it
+        ),
+        begin_(
+                _begin
+        ),
+        end_(
+                _end
+        )
+{
+}
+
+template<
+        typename ContainerIterator
+>
+template<
+        typename OtherIterator
+>
+cyclic_iterator<
+        ContainerIterator
+> &
+cyclic_iterator<
+        ContainerIterator
+>::operator=(
+        cyclic_iterator<
+                OtherIterator
+        > const &_other
+)
+{
+        it_ = _other.it_;
+
+        begin_ = _other.begin_;
+
+        end_ = _other.end_;
+
+        return *this;
+}
+
+template<
+        typename ContainerIterator
+>
+typename cyclic_iterator<
+        ContainerIterator
+>::container_iterator_type
+cyclic_iterator<
+        ContainerIterator
+>::begin() const
+{
+        return begin_;
+}
+
+template<
+        typename ContainerIterator
+>
+typename cyclic_iterator<
+        ContainerIterator
+>::container_iterator_type
+cyclic_iterator<
+        ContainerIterator
+>::end() const
+{
+        return end_;
+}
+
+template<
+        typename ContainerIterator
+>
+typename cyclic_iterator<
+        ContainerIterator
+>::container_iterator_type
+cyclic_iterator<
+        ContainerIterator
+>::get() const
+{
+        return it_;
+}
+
+template<
+        typename ContainerIterator
+>
+void
+cyclic_iterator<
+        ContainerIterator
+>::increment()
+{
+        if(
+                begin_ != end_
+                && ++it_ == end_
+        )
+                it_ = begin_;
+}
+
+template<
+        typename ContainerIterator
+>
+void
+cyclic_iterator<
+        ContainerIterator
+>::decrement()
+{
+        if(
+                begin_ == end_
+        )
+                return;
+
+        if(
+                it_ == begin_
+        )
+                it_ =
+                        std::prev(
+                                end_
+                        );
+        else
+                --it_;
+}
+
+template<
+        typename ContainerIterator
+>
+bool
+cyclic_iterator<
+        ContainerIterator
+>::equal(
+        cyclic_iterator const &_other
+) const
+{
+        return it_ == _other.it;
+}
+
+template<
+        typename ContainerIterator
+>
+typename cyclic_iterator<
+        ContainerIterator
+>::reference
+cyclic_iterator<
+        ContainerIterator
+>::dereference() const
+{
+        return *it_;
+}
+
+template<
+        typename ContainerIterator
+>
+typename cyclic_iterator<
+        ContainerIterator
+>::difference_type
+cyclic_iterator<
+        ContainerIterator
+>::distance_to(
+        cyclic_iterator const &_other
+) const
+{
+        return _other.it_ - it_;
+}
+
+// Convenience function for template argument deduction
+template <typename ContainerIterator>
+cyclic_iterator <ContainerIterator> make_cyclic (
+    ContainerIterator const& pos,
+    ContainerIterator const& begin,
+    ContainerIterator const& end);
+}
+
+#endif
--- a/src/beast/beast/insight/Collector.h
+++ b/src/beast/beast/insight/Collector.h
@@ -0,0 +1,95 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_COLLECTOR_H_INCLUDED
+#define BEAST_INSIGHT_COLLECTOR_H_INCLUDED
+
+#include <string>
+
+#include "Counter.h"
+#include "Event.h"
+#include "Gauge.h"
+#include "Hook.h"
+#include "Meter.h"
+
+namespace beast {
+namespace insight {
+
+/** Interface for a manager that allows collection of metrics.
+
+    To export metrics from a class, pass and save a shared_ptr to this
+    interface in the class constructor. Create the metric objects
+    as desired (counters, events, gauges, meters, and an optional hook)
+    using the interface.
+
+    @see Counter, Event, Gauge, Hook, Meter
+    @see NullCollector, StatsDCollector
+*/
+class Collector
+{
+public:
+    virtual ~Collector() = 0;
+
+    /** Create a hook.
+        
+        A hook is called at each collection interval, on an implementation
+        defined thread. This is a convenience facility for gathering metrics
+        in the polling style. The typical usage is to update all the metrics
+        of interest in the handler.
+
+        Handler will be called with this signature:
+            void handler (void)
+
+        @see Hook
+    */
+    /** @{ */
+    template <class Handler>
+    Hook make_hook (Handler handler)
+    {
+        return make_hook (HookImpl::HandlerType (handler));
+    }
+
+    virtual Hook make_hook (HookImpl::HandlerType const& handler) = 0;
+    /** @} */
+
+    /** Create a counter with the specified name.
+        @see Counter
+    */
+    virtual Counter make_counter (std::string const& name) = 0;
+
+    /** Create an event with the specified name.
+        @see Event
+    */
+    virtual Event make_event (std::string const& name) = 0;
+
+    /** Create a gauge with the specified name. 
+        @see Gauge
+    */
+    virtual Gauge make_gauge (std::string const& name) = 0;
+
+    /** Create a meter with the specified name.
+        @see Meter
+    */
+    virtual Meter make_meter (std::string const& name) = 0;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/Counter.h
+++ b/src/beast/beast/insight/Counter.h
@@ -0,0 +1,109 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_COUNTER_H_INCLUDED
+#define BEAST_INSIGHT_COUNTER_H_INCLUDED
+
+#include <memory>
+
+#include "CounterImpl.h"
+
+namespace beast {
+namespace insight {
+
+/** A metric for measuring an integral value.
+    
+    A counter is a gauge calculated at the server. The owner of the counter
+    may increment and decrement the value by an amount.
+
+    This is a lightweight reference wrapper which is cheap to copy and assign.
+    When the last reference goes away, the metric is no longer collected.
+*/
+class Counter
+{
+public:
+    typedef CounterImpl::value_type value_type;
+
+    /** Create a null metric.
+        A null metric reports no information.
+    */
+    Counter ()
+    {
+    }
+
+    /** Create the metric reference the specified implementation.
+        Normally this won't be called directly. Instead, call the appropriate
+        factory function in the Collector interface.
+        @see Collector.
+    */
+    explicit Counter (std::shared_ptr <CounterImpl> const& impl)
+        : m_impl (impl)
+    {
+    }
+
+    /** Set a handler for polling.
+        If a handler is set, it will be called once per collection interval.
+        This may be used to implement polling style collection instead of
+        push style.
+        
+        Handler will be called with this signature:
+            void Handler (Counter const&);
+    */
+    template <class Handler>
+    void set_handler (Handler handler) const
+    {
+        if (m_impl)
+            m_impl->set_handler (handler);
+    }
+
+    /** Increment the counter. */
+    /** @{ */
+    void increment (value_type amount) const
+    {
+        if (m_impl)
+            m_impl->increment (amount);
+    }
+
+    Counter const& operator+= (value_type amount) const
+        { increment (amount); return *this; }
+
+    Counter const& operator-= (value_type amount) const
+        { increment (-amount); return *this; }
+
+    Counter const& operator++ () const
+        { increment (1); return *this; }
+
+    Counter const& operator++ (int) const
+        { increment (1); return *this; }
+
+    Counter const& operator-- () const
+        { increment (-1); return *this; }
+
+    Counter const& operator-- (int) const
+        { increment (-1); return *this; }
+    /** @} */
+
+private:
+    std::shared_ptr <CounterImpl> m_impl;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/CounterImpl.h
+++ b/src/beast/beast/insight/CounterImpl.h
@@ -0,0 +1,45 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_COUNTERIMPL_H_INCLUDED
+#define BEAST_INSIGHT_COUNTERIMPL_H_INCLUDED
+
+#include <functional>
+#include <memory>
+
+namespace beast {
+namespace insight {
+
+class Counter;
+
+class CounterImpl : public std::enable_shared_from_this <CounterImpl>
+{
+public:
+    typedef int64 value_type;
+    typedef std::function <void (Counter const&)> HandlerType;
+   
+    virtual ~CounterImpl () = 0;
+    virtual void increment (value_type amount) = 0;
+    virtual void set_handler (HandlerType const& handler) = 0;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/Event.h
+++ b/src/beast/beast/insight/Event.h
@@ -0,0 +1,78 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_EVENT_H_INCLUDED
+#define BEAST_INSIGHT_EVENT_H_INCLUDED
+
+#include <memory>
+
+#include "EventImpl.h"
+
+namespace beast {
+namespace insight {
+
+/** A metric for reporting event timing.
+    
+    An event is an operation that has an associated millisecond time, or
+    other integral value. Because events happen at a specific moment, the
+    metric only supports a push-style interface.
+
+    This is a lightweight reference wrapper which is cheap to copy and assign.
+    When the last reference goes away, the metric is no longer collected.
+*/
+class Event
+{
+public:
+    typedef EventImpl::value_type value_type;
+
+    /** Create a null metric.
+        A null metric reports no information.
+    */
+    Event ()
+    {
+    }
+
+    /** Create the metric reference the specified implementation.
+        Normally this won't be called directly. Instead, call the appropriate
+        factory function in the Collector interface.
+        @see Collector.
+    */
+    explicit Event (std::shared_ptr <EventImpl> const& impl)
+        : m_impl (impl)
+    {
+    }
+
+    /** Push an event notification.
+        The value specifies the elapsed time in milliseconds, or any other
+        domain specific value.
+    */
+    void notify (value_type value) const
+    {
+        if (m_impl)
+            m_impl->notify (value);
+    }
+
+private:
+    std::shared_ptr <EventImpl> m_impl;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/EventImpl.h
+++ b/src/beast/beast/insight/EventImpl.h
@@ -17,28 +17,24 @@
 */
 //==============================================================================

-#ifndef BEAST_MPL_REMOVECONST_H_INCLUDED
-#define BEAST_MPL_REMOVECONST_H_INCLUDED
+#ifndef BEAST_INSIGHT_EVENTIMPL_H_INCLUDED
+#define BEAST_INSIGHT_EVENTIMPL_H_INCLUDED

-// Ideas based on boost
+#include <memory>

 namespace beast {
-namespace mpl {
+namespace insight {

-/** Remove the `const` qualifier from a type. */
-/** @{ */
-template <typename T>
-struct RemoveConst
-{
-    typedef T type;
-};
+class Event;

-template <typename T>
-struct RemoveConst <T const>
+class EventImpl : public std::enable_shared_from_this <EventImpl>
 {
-    typedef T type;
+public:
+    typedef uint64 value_type;
+
+    virtual ~EventImpl () = 0;
+    virtual void notify (value_type value) = 0;
 };
-/** @} */

 }
 }
--- a/src/beast/beast/insight/Gauge.h
+++ b/src/beast/beast/insight/Gauge.h
@@ -0,0 +1,127 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_GAUGE_H_INCLUDED
+#define BEAST_INSIGHT_GAUGE_H_INCLUDED
+
+#include <memory>
+
+#include "GaugeImpl.h"
+
+namespace beast {
+namespace insight {
+
+/** A metric for measuring an integral value.
+    
+    A gauge is an instantaneous measurement of a value, like the gas gauge
+    in a car. The caller directly sets the value, or adjusts it by a
+    specified amount. The value is kept in the client rather than the collector.
+
+    This is a lightweight reference wrapper which is cheap to copy and assign.
+    When the last reference goes away, the metric is no longer collected.
+*/
+class Gauge
+{
+public:
+    typedef GaugeImpl::value_type      value_type;
+    typedef GaugeImpl::difference_type difference_type;
+
+    /** Create a null metric.
+        A null metric reports no information.
+    */
+    Gauge ()
+    {
+    }
+
+    /** Create the metric reference the specified implementation.
+        Normally this won't be called directly. Instead, call the appropriate
+        factory function in the Collector interface.
+        @see Collector.
+    */
+    explicit Gauge (std::shared_ptr <GaugeImpl> const& impl)
+        : m_impl (impl)
+    {
+    }
+
+    /** Set a handler for polling.
+        If a handler is set, it will be called once per collection interval.
+        This may be used to implement polling style collection instead of
+        push style.
+        
+        Handler will be called with this signature:
+            void Handler (Gauge const&);
+    */
+    template <class Handler>
+    void set_handler (Handler handler) const
+    {
+        if (m_impl)
+            m_impl->set_handler (handler);
+    }
+
+    /** Set the value on the gauge.
+        A Collector implementation should combine multiple calls to value
+        changes into a single change if the calls occur within a single
+        collection interval.
+    */
+    /** @{ */
+    void set (value_type value) const
+    {
+        if (m_impl)
+            m_impl->set (value);
+    }
+
+    Gauge const& operator= (value_type value) const
+        { set (value); return *this; }
+    /** @} */
+
+    /** Adjust the value of the gauge. */
+    /** @{ */
+    void increment (difference_type amount) const
+    {
+        if (m_impl)
+            m_impl->increment (amount);
+    }
+
+    Gauge const& operator+= (difference_type amount) const
+        { increment (amount); return *this; }
+
+    Gauge const& operator-= (difference_type amount) const
+        { increment (-amount); return *this; }
+
+    Gauge const& operator++ () const
+        { increment (1); return *this; }
+
+    Gauge const& operator++ (int) const
+        { increment (1); return *this; }
+
+    Gauge const& operator-- () const
+        { increment (-1); return *this; }
+
+    Gauge const& operator-- (int) const
+        { increment (-1); return *this; }
+    /** @} */
+
+private:
+    std::shared_ptr <GaugeImpl> m_impl;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/GaugeImpl.h
+++ b/src/beast/beast/insight/GaugeImpl.h
@@ -0,0 +1,44 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_GAUGEIMPL_H_INCLUDED
+#define BEAST_INSIGHT_GAUGEIMPL_H_INCLUDED
+
+namespace beast {
+namespace insight {
+
+class Gauge;
+
+class GaugeImpl : public std::enable_shared_from_this <GaugeImpl>
+{
+public:
+    typedef uint64  value_type;
+    typedef int64   difference_type;
+    typedef std::function <void (Gauge const&)> HandlerType;
+
+    virtual ~GaugeImpl () = 0;
+    virtual void set (value_type value) = 0;
+    virtual void increment (difference_type amount) = 0;
+    virtual void set_handler (HandlerType const& handler) = 0;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/Hook.h
+++ b/src/beast/beast/insight/Hook.h
@@ -0,0 +1,57 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_HOOK_H_INCLUDED
+#define BEAST_INSIGHT_HOOK_H_INCLUDED
+
+#include "HookImpl.h"
+
+#include "../stl/shared_ptr.h"
+
+namespace beast {
+namespace insight {
+    
+/** A reference to a handler for performing polled collection. */
+class Hook
+{
+public:
+    /** Create a null hook.
+        A null hook has no associated handler.
+    */
+    Hook ()
+        { }
+
+    /** Create a hook referencing the specified implementation.
+        Normally this won't be called directly. Instead, call the appropriate
+        factory function in the Collector interface.
+        @see Collector.
+    */
+    explicit Hook (std::shared_ptr <HookImpl> const& impl)
+        : m_impl (impl)
+    {
+    }
+
+private:
+    std::shared_ptr <HookImpl> m_impl;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/mpl/RemoveReference.h
+++ b/src/beast/beast/mpl/RemoveReference.h
@@ -17,28 +17,22 @@
 */
 //==============================================================================

-#ifndef BEAST_MPL_REMOVEREFERENCE_H_INCLUDED
-#define BEAST_MPL_REMOVEREFERENCE_H_INCLUDED
+#ifndef BEAST_INSIGHT_HOOKIMPL_H_INCLUDED
+#define BEAST_INSIGHT_HOOKIMPL_H_INCLUDED
+
+#include <functional>
+#include <memory>

 namespace beast {
-namespace mpl {
+namespace insight {

-// Ideas based on boost
-
-/** Remove the reference qualifier from a type. */
-/** @{ */
-template <class T>
-struct RemoveReference
+class HookImpl : public std::enable_shared_from_this <HookImpl>
 {
-   typedef T type;
-};
+public:
+    typedef std::function <void (void)> HandlerType;

-template <class T>
-struct RemoveReference <T&>
-{
-   typedef T type;
+    virtual ~HookImpl () = 0;
 };
-/** @} */

 }
 }
--- a/src/beast/modules/beast_db/beast_db.cpp
+++ b/src/beast/modules/beast_db/beast_db.cpp
@@ -19,20 +19,14 @@

 #include "BeastConfig.h"

-#include "beast_db.h"
+#include "../Config.h"

-#include "../beast_crypto/beast_crypto.h"
+#include "../../modules/beast_core/beast_core.h" // for UnitTest

-namespace beast
-{
+#include "../Insight.h"

-#if BEAST_GCC
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
-#endif
-#include "keyvalue/KeyvaDB.cpp"
-#if BEAST_GCC
-#pragma GCC diagnostic pop
-#endif
-
-}
+#include "impl/Collector.cpp"
+#include "impl/Hook.cpp"
+#include "impl/Metric.cpp"
+#include "impl/NullCollector.cpp"
+#include "impl/StatsDCollector.cpp"
--- a/src/beast/beast/insight/Meter.h
+++ b/src/beast/beast/insight/Meter.h
@@ -0,0 +1,98 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_METER_H_INCLUDED
+#define BEAST_INSIGHT_METER_H_INCLUDED
+
+#include "MeterImpl.h"
+
+#include "../stl/shared_ptr.h"
+
+namespace beast {
+namespace insight {
+
+/** A metric for measuring an integral value.
+    
+    A meter may be thought of as an increment-only counter.
+
+    This is a lightweight reference wrapper which is cheap to copy and assign.
+    When the last reference goes away, the metric is no longer collected.
+*/
+class Meter
+{
+public:
+    typedef MeterImpl::value_type value_type;
+
+    /** Create a null metric.
+        A null metric reports no information.
+    */
+    Meter ()
+    {
+    }
+
+    /** Create the metric reference the specified implementation.
+        Normally this won't be called directly. Instead, call the appropriate
+        factory function in the Collector interface.
+        @see Collector.
+    */
+    explicit Meter (std::shared_ptr <MeterImpl> const& impl)
+        : m_impl (impl)
+    {
+    }
+
+    /** Set a handler for polling.
+        If a handler is set, it will be called once per collection interval.
+        This may be used to implement polling style collection instead of
+        push style.
+        
+        Handler will be called with this signature:
+            void Handler (Meter const&);
+    */
+    template <class Handler>
+    void set_handler (Handler handler) const
+    {
+        m_impl->set_handler (handler);
+    }
+
+    /** Increment the meter. */
+    /** @{ */
+    void increment (value_type amount) const
+    {
+        if (m_impl)
+            m_impl->increment (amount);
+    }
+
+    Meter const& operator+= (value_type amount) const
+        { increment (amount); return *this; }
+
+    Meter const& operator++ () const
+        { increment (1); return *this; }
+
+    Meter const& operator++ (int) const
+        { increment (1); return *this; }
+    /** @} */
+
+private:
+    std::shared_ptr <MeterImpl> m_impl;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/MeterImpl.h
+++ b/src/beast/beast/insight/MeterImpl.h
@@ -17,28 +17,27 @@
 */
 //==============================================================================

-#ifndef BEAST_MPL_COPYCONST_H_INCLUDED
-#define BEAST_MPL_COPYCONST_H_INCLUDED
+#ifndef BEAST_INSIGHT_METERIMPL_H_INCLUDED
+#define BEAST_INSIGHT_METERIMPL_H_INCLUDED

-#include "RemoveConst.h"
+#include <functional>
+#include <memory>

 namespace beast {
-namespace mpl {
+namespace insight {

-/** Copy `const` attribute from T to U if present. */
-/** @{ */
-template <typename T, typename U>
-struct CopyConst
-{
-    typedef typename RemoveConst<U>::type type;
-};
+class Meter;

-template <typename T, typename U>
-struct CopyConst <T const, U>
+class MeterImpl : public std::enable_shared_from_this <MeterImpl>
 {
-    typedef typename RemoveConst<U>::type const type;
+public:
+    typedef uint64 value_type;
+    typedef std::function <void (Meter const&)> HandlerType;
+
+    virtual ~MeterImpl () = 0;
+    virtual void increment (value_type amount) = 0;
+    virtual void set_handler (HandlerType const& handler) = 0;
 };
-/** @} */

 }
 }
--- a/src/beast/beast/insight/NullCollector.h
+++ b/src/beast/beast/insight/NullCollector.h
@@ -0,0 +1,38 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_NULLCOLLECTOR_H_INCLUDED
+#define BEAST_INSIGHT_NULLCOLLECTOR_H_INCLUDED
+
+#include "Collector.h"
+
+namespace beast {
+namespace insight {
+    
+/** A Collector which does not collect metrics. */
+class NullCollector : public Collector
+{
+public:
+    static std::shared_ptr <Collector> New ();
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/insight/StatsDCollector.h
+++ b/src/beast/beast/insight/StatsDCollector.h
@@ -0,0 +1,49 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_INSIGHT_STATSDCOLLECTOR_H_INCLUDED
+#define BEAST_INSIGHT_STATSDCOLLECTOR_H_INCLUDED
+
+#include "Collector.h"
+
+#include "../net/IPAddress.h"
+
+namespace beast {
+namespace insight {
+
+/** A Collector that reports metrics to a StatsD server.
+    Reference:
+        https://github.com/b/statsd_spec
+*/
+class StatsDCollector : public Collector
+{
+public:
+    /** Create a StatsD collector.
+        @param address The IP address and port of the StatsD server.
+        @param prefix A string pre-pended before each metric name.
+        @param journal Destination for logging output.
+    */
+    static std::shared_ptr <StatsDCollector> New (IPAddress const& address,
+        std::string const& prefix, Journal journal);
+};
+
+}
+}
+
+#endif
--- a/src/beast/modules/beast_crypto/beast_crypto.cpp
+++ b/src/beast/modules/beast_crypto/beast_crypto.cpp
@@ -17,14 +17,12 @@
 */
 //==============================================================================

-#include "BeastConfig.h"
+namespace beast {
+namespace insight {

-#include "beast_crypto.h"
-
-namespace beast
+Collector::~Collector ()
 {
-
-#include "math/BinaryEncoding.cpp"
-#include "math/UnsignedInteger.cpp"
+}

 }
+}
--- a/src/beast/beast/insight/impl/Hook.cpp
+++ b/src/beast/beast/insight/impl/Hook.cpp
@@ -0,0 +1,28 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+namespace beast {
+namespace insight {
+
+HookImpl::~HookImpl ()
+{
+}
+
+}
+}
--- a/src/beast/beast/insight/impl/Metric.cpp
+++ b/src/beast/beast/insight/impl/Metric.cpp
@@ -0,0 +1,40 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+namespace beast {
+namespace insight {
+
+CounterImpl::~CounterImpl ()
+{
+}
+
+EventImpl::~EventImpl ()
+{
+}
+
+GaugeImpl::~GaugeImpl ()
+{
+}
+
+MeterImpl::~MeterImpl ()
+{
+}
+
+}
+}
--- a/src/beast/beast/insight/impl/NullCollector.cpp
+++ b/src/beast/beast/insight/impl/NullCollector.cpp
@@ -0,0 +1,149 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+namespace beast {
+namespace insight {
+
+namespace detail {
+
+class NullHookImpl : public HookImpl
+{
+private:
+    NullHookImpl& operator= (NullHookImpl const&);
+};
+
+//------------------------------------------------------------------------------
+
+class NullCounterImpl : public CounterImpl
+{
+public:
+    void increment (value_type)
+    {
+    }
+
+    void set_handler (HandlerType const&)
+    {
+    }
+
+private:
+    NullCounterImpl& operator= (NullCounterImpl const&);
+};
+
+//------------------------------------------------------------------------------
+
+class NullEventImpl : public EventImpl
+{
+public:
+    void notify (value_type)
+    {
+    }
+
+private:
+    NullEventImpl& operator= (NullEventImpl const&);
+};
+
+//------------------------------------------------------------------------------
+
+class NullGaugeImpl : public GaugeImpl
+{
+public:
+    void set (value_type)
+    {
+    }
+
+    void increment (difference_type)
+    {
+    }
+
+    void set_handler (HandlerType const&)
+    {
+    }
+
+private:
+    NullGaugeImpl& operator= (NullGaugeImpl const&);
+};
+
+//------------------------------------------------------------------------------
+
+class NullMeterImpl : public MeterImpl
+{
+public:
+    void increment (value_type)
+    {
+    }
+
+    void set_handler (HandlerType const&)
+    {
+    }
+
+private:
+    NullMeterImpl& operator= (NullMeterImpl const&);
+};
+
+//------------------------------------------------------------------------------
+
+class NullCollectorImp : public NullCollector
+{
+private:
+public:
+    NullCollectorImp ()
+    {
+    }
+
+    ~NullCollectorImp ()
+    {
+    }
+
+    Hook make_hook (HookImpl::HandlerType const&)
+    {
+        return Hook (std::make_shared <detail::NullHookImpl> ());
+    }
+
+    Counter make_counter (std::string const&)
+    {
+        return Counter (std::make_shared <detail::NullCounterImpl> ());
+    }
+
+    Event make_event (std::string const&)
+    {
+        return Event (std::make_shared <detail::NullEventImpl> ());
+    }
+
+    Gauge make_gauge (std::string const&)
+    {
+        return Gauge (std::make_shared <detail::NullGaugeImpl> ());
+    }
+    
+    Meter make_meter (std::string const&)
+    {
+        return Meter (std::make_shared <detail::NullMeterImpl> ());
+    }
+};
+
+}
+
+//------------------------------------------------------------------------------
+
+std::shared_ptr <Collector> NullCollector::New ()
+{
+    return std::make_shared <detail::NullCollectorImp> ();
+}
+
+}
+}
--- a/src/beast/beast/insight/impl/StatsDCollector.cpp
+++ b/src/beast/beast/insight/impl/StatsDCollector.cpp
@@ -0,0 +1,716 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#include "../../asio/IPAddressConversion.h"
+#include "../../threads/SharedData.h"
+
+#include <deque>
+#include <climits>
+#include <set>
+#include <sstream>
+#include <thread>
+
+#include <boost/asio.hpp>
+#include <boost/bind.hpp>
+#include <boost/move/move.hpp>
+#include <boost/optional.hpp>
+
+#ifndef BEAST_STATSDCOLLECTOR_TRACING_ENABLED
+#define BEAST_STATSDCOLLECTOR_TRACING_ENABLED 0
+#endif
+
+namespace beast {
+namespace insight {
+
+namespace detail {
+
+class StatsDCollectorImp;
+
+//------------------------------------------------------------------------------
+
+class StatsDMetricBase : public List <StatsDMetricBase>::Node
+{
+public:
+    virtual void do_process () = 0;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDHookImpl
+    : public HookImpl
+    , public StatsDMetricBase
+{
+public:
+    StatsDHookImpl (
+        HandlerType const& handler,
+            std::shared_ptr <StatsDCollectorImp> const& impl);
+
+    ~StatsDHookImpl ();
+
+    void do_process ();
+
+private:
+    StatsDHookImpl& operator= (StatsDHookImpl const&);
+
+    std::shared_ptr <StatsDCollectorImp> m_impl;
+    HandlerType m_handler;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDCounterImpl
+    : public CounterImpl
+    , public StatsDMetricBase
+{
+public:
+    StatsDCounterImpl (std::string const& name,
+        std::shared_ptr <StatsDCollectorImp> const& impl);
+
+    ~StatsDCounterImpl ();
+
+    void increment (CounterImpl::value_type amount);
+    void set_handler (HandlerType const& handler);
+
+    void flush ();
+    void do_increment (CounterImpl::value_type amount);
+    void do_process ();
+
+private:
+    StatsDCounterImpl& operator= (StatsDCounterImpl const&);
+
+    std::shared_ptr <StatsDCollectorImp> m_impl;
+    std::string m_name;
+    CounterImpl::value_type m_value;
+    bool m_dirty;
+    HandlerType m_handler;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDEventImpl
+    : public EventImpl
+{
+public:
+    StatsDEventImpl (std::string const& name,
+        std::shared_ptr <StatsDCollectorImp> const& impl);
+
+    ~StatsDEventImpl ();
+
+    void notify (EventImpl::value_type value);
+
+    void do_notify (EventImpl::value_type value);
+    void do_process ();
+
+private:
+    StatsDEventImpl& operator= (StatsDEventImpl const&);
+
+    std::shared_ptr <StatsDCollectorImp> m_impl;
+    std::string m_name;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDGaugeImpl
+    : public GaugeImpl
+    , public StatsDMetricBase
+{
+public:
+    StatsDGaugeImpl (std::string const& name,
+        std::shared_ptr <StatsDCollectorImp> const& impl);
+
+    ~StatsDGaugeImpl ();
+
+    void set (GaugeImpl::value_type value);
+    void increment (GaugeImpl::difference_type amount);
+    void set_handler (HandlerType const& handler);
+
+    void flush ();
+    void do_set (GaugeImpl::value_type value);
+    void do_increment (GaugeImpl::difference_type amount);
+    void do_process ();
+
+private:
+    StatsDGaugeImpl& operator= (StatsDGaugeImpl const&);
+
+    std::shared_ptr <StatsDCollectorImp> m_impl;
+    std::string m_name;
+    GaugeImpl::value_type m_last_value;
+    GaugeImpl::value_type m_value;
+    bool m_dirty;
+    HandlerType m_handler;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDMeterImpl
+    : public MeterImpl
+    , public StatsDMetricBase
+{
+public:
+    explicit StatsDMeterImpl (std::string const& name,
+        std::shared_ptr <StatsDCollectorImp> const& impl);
+
+    ~StatsDMeterImpl ();
+
+    void increment (MeterImpl::value_type amount);
+    void set_handler (HandlerType const& handler);
+
+    void flush ();
+    void do_increment (MeterImpl::value_type amount);
+    void do_process ();
+
+private:
+    StatsDMeterImpl& operator= (StatsDMeterImpl const&);
+
+    std::shared_ptr <StatsDCollectorImp> m_impl;
+    std::string m_name;
+    MeterImpl::value_type m_value;
+    bool m_dirty;
+    HandlerType m_handler;
+};
+
+//------------------------------------------------------------------------------
+
+class StatsDCollectorImp
+    : public StatsDCollector
+    , public std::enable_shared_from_this <StatsDCollectorImp>
+{
+private:
+    enum
+    {
+        //max_packet_size = 484
+        max_packet_size = 1472
+    };
+
+    struct StateType
+    {
+        List <StatsDMetricBase> metrics;
+    };
+
+    typedef SharedData <StateType> State;
+
+    Journal m_journal;
+    IPAddress m_address;
+    std::string m_prefix;
+    boost::asio::io_service m_io_service;
+    boost::optional <boost::asio::io_service::work> m_work;
+    boost::asio::deadline_timer m_timer;
+    boost::asio::ip::udp::socket m_socket;
+    std::deque <std::string> m_data;
+    State m_state;
+
+    // Must come last for order of init
+    std::thread m_thread;
+
+    static boost::asio::ip::udp::endpoint to_endpoint (
+        IPAddress const &address)
+    {
+        if (address.isV4 ())
+        {
+            return boost::asio::ip::udp::endpoint (
+                boost::asio::ip::address_v4 (
+                    address.v4().value), address.port ());
+        }
+
+        // VFALCO TODO IPv6 support
+        bassertfalse;
+        return boost::asio::ip::udp::endpoint (
+            boost::asio::ip::address_v6 (), 0);
+    }
+
+public:
+    StatsDCollectorImp (
+        IPAddress const& address,
+        std::string const& prefix,
+        Journal journal)
+        : m_journal (journal)
+        , m_address (address)
+        , m_prefix (prefix)
+        , m_work (boost::ref (m_io_service))
+        , m_timer (m_io_service)
+        , m_socket (m_io_service)
+        , m_thread (&StatsDCollectorImp::run, this)
+    {
+    }
+
+    ~StatsDCollectorImp ()
+    {
+        boost::system::error_code ec;
+        m_timer.cancel (ec);
+
+        m_work = boost::none;
+        m_thread.join ();
+    }
+
+    Hook make_hook (HookImpl::HandlerType const& handler)
+    {
+        return Hook (std::make_shared <detail::StatsDHookImpl> (
+            handler, shared_from_this ()));
+    }
+
+    Counter make_counter (std::string const& name)
+    {
+        return Counter (std::make_shared <detail::StatsDCounterImpl> (
+            name, shared_from_this ()));
+    }
+
+    Event make_event (std::string const& name)
+    {
+        return Event (std::make_shared <detail::StatsDEventImpl> (
+            name, shared_from_this ()));
+    }
+
+    Gauge make_gauge (std::string const& name)
+    {
+        return Gauge (std::make_shared <detail::StatsDGaugeImpl> (
+            name, shared_from_this ()));
+    }
+
+    Meter make_meter (std::string const& name)
+    {
+        return Meter (std::make_shared <detail::StatsDMeterImpl> (
+            name, shared_from_this ()));
+    }
+
+    //--------------------------------------------------------------------------
+
+    void add (StatsDMetricBase& metric)
+    {
+        State::Access state (m_state);
+        state->metrics.push_back (metric);
+    }
+
+    void remove (StatsDMetricBase& metric)
+    {
+        State::Access state (m_state);
+        state->metrics.erase (state->metrics.iterator_to (metric));
+    }
+
+    //--------------------------------------------------------------------------
+
+    boost::asio::io_service& get_io_service ()
+    {
+        return m_io_service;
+    }
+
+    std::string const& prefix () const
+    {
+        return m_prefix;
+    }
+
+    void do_post_buffer (std::string const& buffer)
+    {
+#if BEAST_STATSDCOLLECTOR_TRACING_ENABLED
+        m_journal.trace << std::endl << buffer;
+#endif
+        m_data.emplace_back (buffer);
+    }
+
+    void post_buffer (std::string&& buffer)
+    {
+        m_io_service.dispatch (std::bind (
+            &StatsDCollectorImp::do_post_buffer, this,
+                std::move (buffer)));
+    }
+
+    void on_send (boost::system::error_code ec, std::size_t)
+    {
+        if (ec == boost::asio::error::operation_aborted)
+            return;
+
+        if (ec)
+        {
+            m_journal.error <<
+                "async_send failed: " << ec.message();
+            return;
+        }
+    }
+
+    // Send what we have
+    void send_buffers ()
+    {
+        // Break up the array of strings into blocks
+        // that each fit into one UDP packet.
+        //
+        boost::system::error_code ec;
+        std::vector <boost::asio::const_buffer> buffers;
+        buffers.reserve (m_data.size ());
+        std::size_t size (0);
+        for (std::deque <std::string>::const_iterator iter (m_data.begin());
+            iter != m_data.end(); ++iter)
+        {
+            std::string const& buffer (*iter);
+            std::size_t const length (buffer.size ());
+            check_precondition (! buffer.empty ());
+            if (! buffers.empty () && (size + length) > max_packet_size)
+            {
+                m_socket.async_send (buffers, boost::bind (
+                    &StatsDCollectorImp::on_send, this,
+                        boost::asio::placeholders::error,
+                            boost::asio::placeholders::bytes_transferred));
+                buffers.clear ();
+                size = 0;
+            }
+            buffers.emplace_back (&buffer[0], length);
+            size += length;
+        }
+        if (! buffers.empty ())
+        {
+            m_socket.async_send (buffers, boost::bind (
+                &StatsDCollectorImp::on_send, this,
+                    boost::asio::placeholders::error,
+                        boost::asio::placeholders::bytes_transferred));
+        }
+        m_data.clear ();
+    }
+
+    void set_timer ()
+    {
+        m_timer.expires_from_now (boost::posix_time::seconds (1));
+        m_timer.async_wait (boost::bind (
+            &StatsDCollectorImp::on_timer, this,
+                boost::asio::placeholders::error));
+    }
+
+    void on_timer (boost::system::error_code ec)
+    {
+        if (ec == boost::asio::error::operation_aborted)
+            return;
+
+        if (ec)
+        {
+            m_journal.error <<
+                "on_timer failed: " << ec.message();
+            return;
+        }
+
+        State::Access state (m_state);
+
+        for (List <StatsDMetricBase>::iterator iter (state->metrics.begin());
+            iter != state->metrics.end(); ++iter)
+            iter->do_process();
+
+        send_buffers ();
+
+        set_timer ();
+    }
+
+    void run ()
+    {
+        m_journal.sink().console (true);
+
+        boost::system::error_code ec;
+
+        if (m_socket.connect (to_endpoint (m_address), ec))
+        {
+            m_journal.error <<
+                "Connect failed: " << ec.message();
+            return;
+        }
+
+        set_timer ();
+
+        m_io_service.run ();
+
+        m_socket.shutdown (
+            boost::asio::ip::udp::socket::shutdown_send, ec);
+
+        m_socket.close ();
+
+        m_io_service.poll ();
+    }
+};
+
+//------------------------------------------------------------------------------
+
+StatsDHookImpl::StatsDHookImpl (HandlerType const& handler,
+    std::shared_ptr <StatsDCollectorImp> const& impl)
+    : m_impl (impl)
+    , m_handler (handler)
+{
+    m_impl->add (*this);
+}
+
+StatsDHookImpl::~StatsDHookImpl ()
+{
+    m_impl->remove (*this);
+}
+
+void StatsDHookImpl::do_process ()
+{
+    m_handler ();
+}
+
+//------------------------------------------------------------------------------
+
+StatsDCounterImpl::StatsDCounterImpl (std::string const& name,
+    std::shared_ptr <StatsDCollectorImp> const& impl)
+    : m_impl (impl)
+    , m_name (name)
+    , m_value (0)
+    , m_dirty (false)
+{
+    m_impl->add (*this);
+}
+
+StatsDCounterImpl::~StatsDCounterImpl ()
+{
+    m_impl->remove (*this);
+}
+
+void StatsDCounterImpl::increment (CounterImpl::value_type amount)
+{
+    m_impl->get_io_service().dispatch (std::bind (
+        &StatsDCounterImpl::do_increment,
+            std::static_pointer_cast <StatsDCounterImpl> (
+                shared_from_this ()), amount));
+}
+
+void StatsDCounterImpl::set_handler (HandlerType const& handler)
+{
+    m_handler = handler;
+}
+
+void StatsDCounterImpl::flush ()
+{
+    if (m_dirty)
+    {
+        m_dirty = false;
+        std::stringstream ss;
+        ss <<
+            m_impl->prefix() << "." <<
+            m_name << ":" <<
+            m_value << "|c" <<
+            "\n";
+        m_value = 0;
+        m_impl->post_buffer (ss.str ());
+    }
+}
+
+void StatsDCounterImpl::do_increment (CounterImpl::value_type amount)
+{
+    m_value += amount;
+    m_dirty = true;
+}
+
+void StatsDCounterImpl::do_process ()
+{
+    if (m_handler)
+        m_handler (Counter (shared_from_this ()));
+    flush ();
+}
+
+//------------------------------------------------------------------------------
+
+StatsDEventImpl::StatsDEventImpl (std::string const& name,
+    std::shared_ptr <StatsDCollectorImp> const& impl)
+    : m_impl (impl)
+    , m_name (name)
+{
+}
+
+StatsDEventImpl::~StatsDEventImpl ()
+{
+}
+
+void StatsDEventImpl::notify (EventImpl::value_type value)
+{
+    m_impl->get_io_service().dispatch (std::bind (
+        &StatsDEventImpl::do_notify,
+            std::static_pointer_cast <StatsDEventImpl> (
+                shared_from_this ()), value));
+}
+
+void StatsDEventImpl::do_notify (EventImpl::value_type value)
+{
+    std::stringstream ss;
+    ss <<
+        m_impl->prefix() << "." <<
+        m_name << ":" <<
+        value << "|ms" <<
+        "\n";
+    m_impl->post_buffer (ss.str ());
+}
+
+//------------------------------------------------------------------------------
+
+StatsDGaugeImpl::StatsDGaugeImpl (std::string const& name,
+    std::shared_ptr <StatsDCollectorImp> const& impl)
+    : m_impl (impl)
+    , m_name (name)
+    , m_last_value (0)
+    , m_value (0)
+    , m_dirty (false)
+{
+    m_impl->add (*this);
+}
+
+StatsDGaugeImpl::~StatsDGaugeImpl ()
+{
+    m_impl->remove (*this);
+}
+
+void StatsDGaugeImpl::set (GaugeImpl::value_type value)
+{
+    m_impl->get_io_service().dispatch (std::bind (
+        &StatsDGaugeImpl::do_set,
+            std::static_pointer_cast <StatsDGaugeImpl> (
+                shared_from_this ()), value));
+}
+
+void StatsDGaugeImpl::increment (GaugeImpl::difference_type amount)
+{
+    m_impl->get_io_service().dispatch (std::bind (
+        &StatsDGaugeImpl::do_increment,
+            std::static_pointer_cast <StatsDGaugeImpl> (
+                shared_from_this ()), amount));
+}
+
+void StatsDGaugeImpl::set_handler (HandlerType const& handler)
+{
+    m_handler = handler;
+}
+
+void StatsDGaugeImpl::flush ()
+{
+    if (m_dirty)
+    {
+        m_dirty = false;
+        std::stringstream ss;
+        ss <<
+            m_impl->prefix() << "." <<
+            m_name << ":" <<
+            m_value << "|c" <<
+            "\n";
+        m_impl->post_buffer (ss.str ());
+    }
+}
+
+void StatsDGaugeImpl::do_set (GaugeImpl::value_type value)
+{
+    m_value = value;
+    
+    if (m_value != m_last_value)
+    {
+        m_last_value = m_value;
+        m_dirty = true;
+    }
+}
+
+void StatsDGaugeImpl::do_increment (GaugeImpl::difference_type amount)
+{
+    GaugeImpl::value_type value (m_value);
+
+    if (amount > 0)
+    {
+        value +=
+            (amount >= std::numeric_limits <GaugeImpl::value_type>::max() - m_value)
+            ? std::numeric_limits <GaugeImpl::value_type>::max() - m_value
+            : GaugeImpl::value_type (amount);
+    }
+    else if (amount < 0)
+    {
+        value -=
+            (std::abs (amount) >= m_value)
+            ? m_value
+            : std::abs (amount);
+    }
+
+    do_set (value);
+}
+
+void StatsDGaugeImpl::do_process ()
+{
+    if (m_handler)
+        m_handler (Gauge (shared_from_this ()));
+    flush ();
+}
+
+//------------------------------------------------------------------------------
+
+StatsDMeterImpl::StatsDMeterImpl (std::string const& name,
+    std::shared_ptr <StatsDCollectorImp> const& impl)
+    : m_impl (impl)
+    , m_name (name)
+    , m_value (0)
+    , m_dirty (false)
+{
+    m_impl->add (*this);
+}
+
+StatsDMeterImpl::~StatsDMeterImpl ()
+{
+    m_impl->remove (*this);
+}
+
+void StatsDMeterImpl::increment (MeterImpl::value_type amount)
+{
+    m_impl->get_io_service().dispatch (std::bind (
+        &StatsDMeterImpl::do_increment,
+            std::static_pointer_cast <StatsDMeterImpl> (
+                shared_from_this ()), amount));
+}
+
+void StatsDMeterImpl::set_handler (HandlerType const& handler)
+{
+    m_handler = handler;
+}
+
+void StatsDMeterImpl::flush ()
+{
+    if (m_dirty)
+    {
+        m_dirty = false;
+        std::stringstream ss;
+        ss <<
+            m_impl->prefix() << "." <<
+            m_name << ":" <<
+            m_value << "|m" <<
+            "\n";
+        m_value = 0;
+        m_impl->post_buffer (ss.str ());
+    }
+}
+
+void StatsDMeterImpl::do_increment (MeterImpl::value_type amount)
+{
+    m_value += amount;
+    m_dirty = true;
+}
+
+void StatsDMeterImpl::do_process ()
+{
+    if (m_handler)
+        m_handler (Meter (shared_from_this ()));
+    flush ();
+}
+
+}
+
+//------------------------------------------------------------------------------
+
+std::shared_ptr <StatsDCollector> StatsDCollector::New (
+    IPAddress const& address, std::string const& prefix, Journal journal)
+{
+    return std::make_shared <detail::StatsDCollectorImp> (
+        address, prefix, journal);
+}
+
+}
+}
--- a/src/beast/beast/intrusive/ForwardList.h
+++ b/src/beast/beast/intrusive/ForwardList.h
@@ -1,448 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_INTRUSIVE_FORWARDLIST_H_INCLUDED
-#define BEAST_INTRUSIVE_FORWARDLIST_H_INCLUDED
-
-#include "../Config.h"
-
-#include "PointerTraits.h"
-
-#include "../MPL.h"
-
-#include <iterator>
-
-// Ideas based on boost
-
-namespace beast {
-namespace intrusive {
-
-//------------------------------------------------------------------------------
-
-namespace detail {
-
-// Holds the size field
-struct SizeHolder
-{
-public:
-    typedef std::size_t size_type;
-   
-    inline size_type size () const noexcept
-    {
-        return m_size;
-    }
-
-    inline void set (size_type new_size) noexcept
-    {
-        m_size = new_size;
-    }
-
-    inline void increment () noexcept
-    {
-        ++m_size;
-    }
-
-    inline void decrement () noexcept
-    {
-        --m_size;
-    }
-
-private:
-    size_type m_size;
-};
-
-}
-
-//------------------------------------------------------------------------------
-
-template <class VoidPointer>
-struct ForwardListNode
-{
-    typedef typename PointerTraits <VoidPointer>::template rebind_pointer <ForwardListNode>::type node_ptr;
-
-    node_ptr next;
-};
-
-//------------------------------------------------------------------------------
-
-// Provides value_traits for when T derives from Node
-template <class T, class NodeTraits>
-struct DerivedValueTraits
-{
-    typedef NodeTraits                                             node_traits;
-    typedef T                                                      value_type;
-    typedef typename node_traits::node                             node;
-    typedef typename node_traits::node_ptr                         node_ptr;
-    typedef typename node_traits::const_node_ptr                   const_node_ptr;
-    typedef typename mpl::PointerToOther <node_ptr, T>::type       pointer;
-    typedef typename mpl::PointerToOther <node_ptr, const T>::type const_pointer;
-    typedef typename PointerTraits <pointer>::reference            reference;
-    typedef typename PointerTraits <const_pointer>::reference      const_reference;
-
-    static node_ptr to_node_ptr (reference value)
-    {
-        return node_ptr (&value);
-    }
-
-    static const_node_ptr to_node_ptr (const_reference value)
-    {
-        return node_ptr (&value);
-    }
-
-    static pointer to_value_ptr (node_ptr const& n)
-    {
-        return pointer (&static_cast <value_type&> (*n));
-    }
-
-    static const_pointer to_value_ptr (const_node_ptr const &n)
-    {
-        return const_pointer (&static_cast <value_type const&> (*n));
-    }
-};
-
-//------------------------------------------------------------------------------
-
-template <class VoidPointer, typename Tag>
-struct ForwardListNodeTraits
-{
-    typedef ForwardListNode <VoidPointer> node;
-
-    typedef typename PointerTraits <VoidPointer>::
-        template rebind_pointer <node> node_ptr;
-
-    typedef typename PointerTraits <VoidPointer>::
-        template rebind_pointer <node const> const_node_ptr;
-
-    static node_ptr get_next (const_node_ptr const& n)
-    {
-        return n->m_next;
-    }
-
-    static node_ptr get_next (node_ptr const& n)
-    {
-        return n->m_next;
-    }
-
-    static void set_next (node_ptr const& n, node_ptr const& next)
-    {
-        n->m_next = next;
-    }
-};
-
-//------------------------------------------------------------------------------
-
-template <class Container, bool IsConst>
-class ForwardListIterator
-    : public std::iterator <
-        std::forward_iterator_tag,
-        typename Container::value_type,
-        typename Container::difference_type,
-        typename mpl::IfCond <IsConst,
-            typename Container::const_pointer,
-            typename Container::pointer>::type,
-        typename mpl::IfCond <IsConst,
-            typename Container::const_reference,
-            typename Container::reference>::type>
-{
-protected:
-    typedef typename Container::value_traits value_traits;
-    typedef typename Container::node_traits  node_traits;
-    typedef typename node_traits::node       node;
-    typedef typename node_traits::node_ptr   node_ptr;
-    typedef typename PointerTraits <node_ptr>::
-        template rebind_pointer <void>::type void_pointer;
-
-public:
-    typedef typename Container::value_type value_type;
-    typedef typename mpl::IfCond <IsConst,
-        typename Container::const_pointer,
-        typename Container::pointer>::type pointer;
-    typedef typename mpl::IfCond <IsConst,
-        typename Container::const_reference,
-        typename Container::reference>::type reference;
-
-    ForwardListIterator ()
-        : m_node ()
-    {
-    }
-
-    explicit ForwardListIterator (ForwardListIterator <Container, false> const& other)
-        : m_node (other.pointed_node ())
-    {
-    }
-
-    node_ptr const& pointed_node () const noexcept
-    {
-        return m_node;
-    }
-
-    ForwardListIterator& operator= (node_ptr const& node)
-    {
-        m_node = node;
-        return static_cast <ForwardListIterator&> (*this);
-    }
-
-    ForwardListIterator& operator++ ()
-    {
-        m_node = node_traits::get_next (m_node);
-        return static_cast <ForwardListIterator&> (*this);
-    }
-
-    ForwardListIterator operator++ (int)
-    {
-        ForwardListIterator result (*this);
-        m_node = node_traits::get_next (m_node);
-        return result;
-    }
-
-    friend bool operator== (ForwardListIterator const& lhs,
-        ForwardListIterator const& rhs)
-    {
-        return lhs.m_node == rhs.m_node;
-    }
-
-    friend bool operator!= (ForwardListIterator const& lhs,
-        ForwardListIterator const& rhs)
-    {
-        return ! (lhs == rhs);
-    }
-
-    reference operator* () const
-    {
-        return *this->operator-> ();
-    }
-
-    pointer operator-> () const
-    {
-        return value_traits::to_value_ptr (m_node);
-    }
-
-private:
-    node_ptr m_node;
-};
-
-//------------------------------------------------------------------------------
-
-template <class NodeTraits>
-class ForwardListAlgorithms
-{
-public:
-    typedef typename NodeTraits::node           node;
-    typedef typename NodeTraits::node_ptr       node_ptr;
-    typedef typename NodeTraits::const_node_ptr const_node_ptr;
-    typedef NodeTraits                          node_traits;
-
-    static void init (node_ptr const& n)
-    {
-        NodeTraits::set_next (n, node_ptr());
-    }
-
-    static bool unique (const_node_ptr const& this_node)
-    {
-        node_ptr next = NodeTraits::get_next (this_node);
-        return !next || next == this_node;
-    }
-
-    static void link_after (node_ptr const& prev_node, node_ptr const& this_node)
-    {
-        NodeTraits::set_next (this_node, NodeTraits::get_next (prev_node));
-        NodeTraits::set_next (prev_node, this_node);
-    }
-
-    static void unlink_after (node_ptr const& prev_node)
-    {
-        const_node_ptr this_node (NodeTraits::get_next (prev_node));
-        NodeTraits::set_next (prev_node, NodeTraits::get_next (this_node));
-    }
-};
-
-//------------------------------------------------------------------------------
-
-/** Singly-linked intrusive list. */
-template <typename T, typename Tag = void>
-class ForwardList
-{
-public:
-    typedef DerivedValueTraits <T, ForwardListNodeTraits <T, Tag> >
-                                                              value_traits;
-    typedef typename value_traits::pointer                    pointer;
-    typedef typename value_traits::const_pointer              const_pointer;
-    typedef typename PointerTraits <pointer>::element_type    value_type;
-    typedef typename PointerTraits <pointer>::reference       reference;
-    typedef typename PointerTraits <pointer>::const_reference const_reference;
-    typedef typename PointerTraits <pointer>::difference_type difference_type;
-    typedef std::size_t                                       size_type;
-    typedef ForwardListIterator <ForwardList, false>          iterator;
-    typedef ForwardListIterator <ForwardList, true>           const_iterator;
-    typedef typename value_traits::node_traits                node_traits;
-    typedef typename node_traits::node                        node;
-    typedef typename node_traits::node_ptr                    node_ptr;
-    typedef typename node_traits::const_node_ptr              const_node_ptr;
-    typedef ForwardListAlgorithms <node_traits>               node_algorithms;
-
-    typedef node Node;
-
-private:
-    typedef detail::SizeHolder size_traits;
-
-    void default_construct ()
-    {
-        get_size_traits ().set (size_type (0));
-        node_algorithms::init (this->get_root_node ());
-    }
-
-    node_ptr get_end_node ()
-    {
-        return node_ptr ();
-    }
-
-    const_node_ptr get_end_node () const
-    {
-        return const_node_ptr ();
-    }
-
-    node_ptr get_root_node ()
-    {
-        return PointerTraits <node_ptr>::pointer_to (m_root);
-    }
-
-    const_node_ptr get_root_node () const
-    {
-        return PointerTraits <const_node_ptr>::pointer_to (m_root);
-    }
-
-    size_traits& get_size_traits () noexcept
-    {
-        return m_size;
-    }
-
-    size_traits const& get_size_traits () const noexcept
-    {
-        return m_size;
-    }
-
-    static node_ptr uncast (const_node_ptr const& ptr)
-    {
-        return PointerTraits <node_ptr>::const_cast_from (ptr);
-    }
-
-public:
-    ForwardList ()
-    {
-        default_construct ();
-    }
-
-    void clear ()
-    {
-        default_construct ();
-    }
-
-    void push_front (reference value)
-    {
-        node_ptr this_node (value_traits::to_node_ptr (value));
-        node_algorithms::link_after (this->get_root_node (), this_node);
-        this->get_size_traits ().increment ();
-    }
-
-    void pop_front ()
-    {
-        //node_ptr this_node (node_traits::get_next (this->get_root ()));
-        node_algorithms::unlink_after (this->get_root_node ());
-        this->get_size_traits ().decrement ();
-    }
-
-    reference front ()
-    {
-        return *value_traits::to_value_ptr (node_traits::get_next (this->get_root_node ()));
-    }
-
-    const_reference front () const
-    {
-        return *value_traits::to_value_ptr (uncat (node_traits::get_next (this->get_root_node ())));
-    }
-
-    iterator begin ()
-    {
-        return iterator (node_traits::get_next (this->get_root_node (), this));
-    }
-
-    const_iterator begin () const
-    {
-        return const_iterator (node_traits::get_next (this->get_root_node (), this));
-    }
-
-    const_iterator cbegin () const
-    {
-        return this->begin ();
-    }
-
-    iterator end ()
-    {
-        return iterator (this->get_end_node (), this);
-    }
-
-    const_iterator end () const
-    {
-        return const_iterator (this->get_end_node (), this);
-    }
-
-    const_iterator cend () const
-    {
-        return this->end ();
-    }
-
-    iterator before_begin ()
-    {
-        return iterator (this->get_root_node (), this);
-    }
-
-    const_iterator before_begin () const
-    {
-        return const_iterator (this->get_root_node (), this);
-    }
-
-    const_iterator cbefore_begin () const
-    {
-        return before_begin ();
-    }
-
-    bool empty () const
-    {
-        return node_algorithms::unique (this->get_root_node ());
-    }
-
-    iterator iterator_to (reference value)
-    {
-        return iterator (value_traits::to_node_ptr (value), this);
-    }
-
-    const_iterator iterator_to (const_reference value) const
-    {
-        return const_iterator (value_traits::to_node_ptr (const_cast <reference> (value)), this);
-    }
-
-private:
-    node m_root;
-    size_traits m_size;
-};
-
-}
-}
-
-#endif
--- a/src/beast/beast/intrusive/IntrusiveArray.h
+++ b/src/beast/beast/intrusive/IntrusiveArray.h
@@ -1,187 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_INTRUSIVE_INTRUSIVEARRAY_H_INCLUDED
-#define BEAST_INTRUSIVE_INTRUSIVEARRAY_H_INCLUDED
-
-#include "../Config.h"
-
-#include <cstddef>
-#include <iterator>
-#include <stdexcept>
-#include <vector>
-
-namespace beast {
-
-/** A run-time fixed size array that references outside storage.
-    The interface tries to follow std::vector as closely as possible within
-    the limitations of a fixed size and unowned storage.
-*/
-template <class T>
-class IntrusiveArray
-{
-private:
-    T* m_begin;
-    T* m_end;
-
-public:
-    typedef T                value_type;
-    typedef T*               iterator;
-    typedef T const*         const_iterator;
-    typedef T&               reference;
-    typedef T const&         const_reference;
-    typedef std::size_t      size_type;
-    typedef std::ptrdiff_t   difference_type;
-
-    // Calling methods on a default constructed
-    // array results in undefined behavior!
-    //
-    IntrusiveArray ()
-        : m_begin (nullptr), m_end (nullptr)
-        { }
-    IntrusiveArray (T* begin, T* end)
-        : m_begin (begin), m_end (end)
-        { }
-    IntrusiveArray (IntrusiveArray const& other)
-        : m_begin (other.m_begin), m_end (other.m_end)
-        { }
-    IntrusiveArray (std::vector <T> const& v)
-        : m_begin (&v.front()), m_end (&v.back()+1)
-        { }
-    IntrusiveArray (std::vector <T>& v)
-        : m_begin (&v.front()), m_end (&v.back()+1)
-        { }
-    IntrusiveArray& operator= (IntrusiveArray const& other)
-    {
-        m_begin = other.m_begin;
-        m_end = other.m_end;
-        return *this;
-    }
-
-    // iterators
-    iterator        begin()       { return m_begin; }
-    const_iterator  begin() const { return m_begin; }
-    const_iterator cbegin() const { return m_begin; }
-    iterator        end()       { return m_end; }
-    const_iterator  end() const { return m_end; }
-    const_iterator cend() const { return m_end; }
-
-    typedef std::reverse_iterator <iterator> reverse_iterator;
-    typedef std::reverse_iterator <const_iterator> const_reverse_iterator;
-
-    reverse_iterator rbegin() { return reverse_iterator(end()); }
-    const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
-    const_reverse_iterator crbegin() const { return const_reverse_iterator(end()); }
-    reverse_iterator rend() { return reverse_iterator(begin()); }
-    const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
-    const_reverse_iterator crend() const { return const_reverse_iterator(begin()); }
-
-    reference operator[](size_type i)
-    {
-        bassert (i < size());
-        return m_begin[i];
-    }
-
-    const_reference operator[](size_type i) const
-    {
-        bassert (i < size());
-        return m_begin[i];
-    }
-
-    reference at(size_type i) { rangecheck(i); return m_begin[i]; }
-    const_reference at(size_type i) const { rangecheck(i); return m_begin[i]; }
-
-    reference front() { return m_begin[0]; }
-    reference back()  { return m_end[-1]; }
-    const_reference front () const { return m_begin; }
-    const_reference back()   const { return m_end[-1]; }
-
-    size_type size() const { return std::distance (m_begin, m_end); }
-    bool empty() const { return m_begin == m_end; }
-
-    T const* data() const { return m_begin; }
-    T* data() { return m_begin; }
-    T* c_array() { return m_begin; }
-
-    void assign (T const& value) { fill (value); }
-
-    void fill (T const& value)
-    {
-        std::fill_n (begin(), size(), value);
-    }
-
-    void clear ()
-    {
-        fill (T ());
-    }
-
-    void rangecheck (size_type i)
-    {
-        if (i >= size())
-            throw std::out_of_range ("IntrusiveArray<>: index out of range");
-    }
-};
-
-//------------------------------------------------------------------------------
-
-template <class T>
-bool operator== (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    if ((lhs.begin() == rhs.begin()) && (lhs.end() == rhs.end()))
-        return true;
-    if (lhs.size() != rhs.size())
-        return false;
-    return std::equal (lhs.begin(), lhs.end(), rhs.begin());
-}
-
-template <class T>
-bool operator!= (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    return !(lhs==rhs);
-}
-
-template <class T>
-bool operator< (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    if ((lhs.begin() == rhs.begin()) && (lhs.end() == rhs.end()))
-        return false;
-    return std::lexicographical_compare (lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
-}
-
-template <class T>
-bool operator> (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    return rhs<lhs;
-}
-
-template <class T>
-bool operator<= (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    return !(rhs<lhs);
-}
-
-template <class T>
-bool operator>= (IntrusiveArray <T> const& lhs, IntrusiveArray <T> const& rhs)
-{
-    return !(lhs<rhs);
-}
-
-}
-
-#endif
--- a/src/beast/beast/intrusive/List.h
+++ b/src/beast/beast/intrusive/List.h
@@ -21,20 +21,32 @@
 #define BEAST_INTRUSIVE_LIST_H_INCLUDED

 #include "../Config.h"
-
-#include "../mpl/CopyConst.h"
-
 #include "../Uncopyable.h"

 #include <iterator>
+#include <type_traits>

 namespace beast {

 template <typename, typename>
 class List;

-namespace detail
+namespace detail {
+
+/** Copy `const` attribute from T to U if present. */
+/** @{ */
+template <typename T, typename U>
+struct CopyConst
 {
+    typedef typename std::remove_const <U>::type type;
+};
+
+template <typename T, typename U>
+struct CopyConst <T const, U>
+{
+    typedef typename std::remove_const <U>::type const type;
+};
+/** @} */

 // This is the intrusive portion of the doubly linked list.
 // One derivation per list that the object may appear on
@@ -62,11 +74,11 @@ class ListIterator : public std::iterator <
    std::bidirectional_iterator_tag, std::size_t>
 {
 public:
-    typedef typename mpl::CopyConst<N, typename N::value_type>::type
-                                   value_type;
-    typedef value_type*            pointer;
-    typedef value_type&            reference;
-    typedef std::size_t            size_type;
+    typedef typename detail::CopyConst <
+        N, typename N::value_type>::type value_type;
+    typedef value_type* pointer;
+    typedef value_type& reference;
+    typedef std::size_t size_type;

    ListIterator (N* node = nullptr) noexcept
        : m_node (node)
--- a/src/beast/beast/intrusive/LockFreeStack.h
+++ b/src/beast/beast/intrusive/LockFreeStack.h
@@ -20,11 +20,12 @@
 #ifndef BEAST_INTRUSIVE_LOCKFREESTACK_H_INCLUDED
 #define BEAST_INTRUSIVE_LOCKFREESTACK_H_INCLUDED

-#include <iterator>
-#include "../mpl/IfCond.h"
 #include "../Atomic.h"
 #include "../Uncopyable.h"

+#include <iterator>
+#include <type_traits>
+
 namespace beast {

 //------------------------------------------------------------------------------
@@ -35,23 +36,24 @@ class LockFreeStackIterator
        std::forward_iterator_tag,
        typename Container::value_type,
        typename Container::difference_type,
-        typename mpl::IfCond <IsConst,
+        typename std::conditional <IsConst,
            typename Container::const_pointer,
            typename Container::pointer>::type,
-        typename mpl::IfCond <IsConst,
+        typename std::conditional <IsConst,
            typename Container::const_reference,
            typename Container::reference>::type>
 {
 protected:
    typedef typename Container::Node Node;
-    typedef typename mpl::IfCond <IsConst, Node const*, Node*>::type NodePtr;
+    typedef typename std::conditional <
+        IsConst, Node const*, Node*>::type NodePtr;

 public:
    typedef typename Container::value_type value_type;
-    typedef typename mpl::IfCond <IsConst,
+    typedef typename std::conditional <IsConst,
        typename Container::const_pointer,
        typename Container::pointer>::type pointer;
-    typedef typename mpl::IfCond <IsConst,
+    typedef typename std::conditional <IsConst,
        typename Container::const_reference,
        typename Container::reference>::type reference;

@@ -199,6 +201,7 @@ public:
        @return `true` if the stack was previously empty. If multiple threads
                are attempting to push, only one will receive `true`.
    */
+    // VFALCO NOTE Fix this, shouldn't it be a reference like intrusive list?
    bool push_front (Node* node)
    {
        bool first;
--- a/src/beast/beast/intrusive/PointerTraits.h
+++ b/src/beast/beast/intrusive/PointerTraits.h
@@ -1,89 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_INTRUSIVE_POINTERTRAITS_H_INCLUDED
-#define BEAST_INTRUSIVE_POINTERTRAITS_H_INCLUDED
-
-#include <cstddef>
-
-namespace beast {
-namespace intrusive {
-
-// an unspecialized PointerTraits is ill-defined
-template <typename P>
-struct PointerTraits;
-
-// specializations to remove cv-qualifiers
-template <typename P>
-struct PointerTraits <P const> : PointerTraits <P> { };
-template <typename P>
-struct PointerTraits <P volatile> : PointerTraits <P> { };
-template <typename P>
-struct PointerTraits <P const volatile> : PointerTraits <P> { };
-// specialization to remove a reference attribute
-template <typename P>
-struct PointerTraits <P&> : PointerTraits <P> { };
-
-// specialization for raw pointers
-template <typename T>
-struct PointerTraits <T*>
-{
-    typedef T               element_type;
-    typedef T*              pointer;
-    typedef T&              reference;
-    typedef std::ptrdiff_t  difference_type;
-
-    template <class U>
-    struct rebind_pointer
-    {
-        typedef U* type;
-    };
-
-    static pointer pointer_to (reference r)
-    {
-        return static_cast <pointer> (
-            static_cast <void*> (
-                const_cast <char*> (
-                    &reinterpret_cast <const char&> (
-                        r))));
-    }
-
-    template <class U>
-    static pointer static_cast_from (U* u)
-    {
-        return static_cast <pointer> (u);
-    }
-
-    template <class U>
-    static pointer const_cast_from (U* u)
-    {
-        return const_cast <pointer> (u);
-    }
-
-    template <class U>
-    static pointer dynamic_cast_from (U* u)
-    {
-        return dynamic_cast <pointer> (u);
-    }
-};
-
-}
-}
-
-#endif
--- a/src/beast/beast/mpl/PointerToOther.h
+++ b/src/beast/beast/mpl/PointerToOther.h
@@ -1,68 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_MPL_POINTERTOOTHERH_INCLUDED
-#define BEAST_MPL_POINTERTOOTHERH_INCLUDED
-
-namespace beast {
-namespace mpl {
-
-// Ideas based on boost
-
-/** Declares a type which is a pointer or smart pointer to U, depending on T.
-    This works for smart pointer containers with up to three template
-    parameters. More specializations can be added for containers with
-    more than three template parameters.
-*/
-/** @{ */
-template <class T, class U>
-struct PointerToOther;
-
-template <class T, class U,
-    template <class> class SmartPointer>
-struct PointerToOther <SmartPointer <T>, U>
-{
-   typedef SmartPointer <U> type;
-};
-
-template <class T, class T2, class U,
-    template <class, class> class SmartPointer>
-struct PointerToOther <SmartPointer <T, T2>, U>
-{
-   typedef SmartPointer <U, T2> type;
-};
-
-template <class T, class T2, class T3, class U,
-        template<class, class, class> class SmartPointer>
-struct PointerToOther <SmartPointer <T, T2, T3>, U>
-{
-   typedef SmartPointer <U, T2, T3> type;
-};
-
-template <class T, class U>
-struct PointerToOther <T*, U>
-{
-   typedef U* type;
-};
-/** @} */
-
-}
-}
-
-#endif
--- a/src/beast/beast/mpl/RemoveConstVolatile.h
+++ b/src/beast/beast/mpl/RemoveConstVolatile.h
@@ -1,43 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_MPL_REMOVECONSTVOLATILE_H_INCLUDED
-#define BEAST_MPL_REMOVECONSTVOLATILE_H_INCLUDED
-
-#include "RemoveConst.h"
-#include "RemoveVolatile.h"
-
-// Ideas based on boost
-
-namespace beast {
-namespace mpl {
-
-/** Remove both the `const` and `volatile` qualifiers from a type. */
-template <typename T>
-struct RemoveConstVolatile
-{
-    typedef typename RemoveConst <
-        typename RemoveVolatile <T>::type
-            >::type type;
-};
-
-}
-}
-
-#endif
--- a/src/beast/beast/mpl/RemoveVolatile.h
+++ b/src/beast/beast/mpl/RemoveVolatile.h
@@ -1,46 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_MPL_REMOVEVOLATILE_H_INCLUDED
-#define BEAST_MPL_REMOVEVOLATILE_H_INCLUDED
-
-// Ideas based on boost
-
-namespace beast {
-namespace mpl {
-
-/** Remove the `volatile` qualifier from a type. */
-/** @{ */
-template <typename T>
-struct RemoveVolatile
-{
-    typedef T type;
-};
-
-template <typename T>
-struct RemoveVolatile <T volatile>
-{
-    typedef T type;
-};
-/** @} */
-
-}
-}
-
-#endif
--- a/src/beast/beast/net/BufferType.h
+++ b/src/beast/beast/net/BufferType.h
@@ -20,7 +20,7 @@
 #ifndef BEAST_NET_BASICS_BUFFERTYPE_H_INCLUDED
 #define BEAST_NET_BASICS_BUFFERTYPE_H_INCLUDED

-#include "../mpl/IfCond.h"
+#include <type_traits>

 namespace beast {

@@ -34,13 +34,11 @@ template <bool IsConst>
 class BufferType
 {
 private:
-    typedef typename mpl::IfCond <IsConst,
-        void const*,
-        void*>::type pointer_type;
+    typedef typename std::conditional <IsConst,
+        void const*, void*>::type pointer_type;

-    typedef typename mpl::IfCond <IsConst,
-        uint8 const,
-        uint8>::type byte_type;
+    typedef typename std::conditional <IsConst,
+        uint8 const, uint8>::type byte_type;

 public:
    typedef std::size_t size_type;
--- a/src/beast/beast/net/IPAddress.h
+++ b/src/beast/beast/net/IPAddress.h
@@ -25,7 +25,6 @@
 #include <sstream>
    
 #include "../CStdInt.h"
-#include "../mpl/IfCond.h"

 namespace std {

@@ -115,7 +114,8 @@ public:
        class Proxy
        {
        public:
-            typedef typename mpl::IfCond <IsConst, uint32 const*, uint32*>::type Pointer;
+            typedef typename std::conditional <
+                IsConst, uint32 const*, uint32*>::type Pointer;

            Proxy (int shift, Pointer value)
                : m_shift (shift)
@@ -325,6 +325,18 @@ public:

    struct key_equal;

+    /** LessThanComparable functor that ignores the port. */
+    struct LessWithoutPort
+    {
+        bool operator() (IPAddress const& lhs, IPAddress const& rhs) const;
+    };
+
+    /** EqualityComparable functor that ignores the port. */
+    struct EqualWithoutPort
+    {
+        bool operator() (IPAddress const& lhs, IPAddress const& rhs) const;
+    };
+
 private:
    Type m_type;
    uint16 m_port;
@@ -334,7 +346,6 @@ private:

 /** Comparison. */
 /** @{ */
-int  compare    (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
 bool operator== (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
 bool operator!= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
 bool operator<  (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
@@ -342,7 +353,6 @@ bool operator<= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
 bool operator>  (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);
 bool operator>= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs);

-int  compare    (IPAddress const& lhs, IPAddress const& rhs);
 bool operator== (IPAddress const& lhs, IPAddress const& rhs);
 bool operator!= (IPAddress const& lhs, IPAddress const& rhs);
 bool operator<  (IPAddress const& lhs, IPAddress const& rhs);
@@ -372,6 +382,18 @@ struct IPAddress::key_equal
    }
 };

+inline bool IPAddress::LessWithoutPort::operator() (
+    IPAddress const& lhs, IPAddress const& rhs) const
+{
+    return lhs.withPort (0) < rhs.withPort (0);
+}
+
+inline bool IPAddress::EqualWithoutPort::operator() (
+    IPAddress const& lhs, IPAddress const& rhs) const
+{
+    return lhs.withPort (0) == rhs.withPort (0);
+}
+
 }

 //------------------------------------------------------------------------------
--- a/src/beast/beast/net/impl/IPAddress.cpp
+++ b/src/beast/beast/net/impl/IPAddress.cpp
@@ -554,58 +554,81 @@ IPAddress IPAddress::from_string_altform (std::string const& s)

 //------------------------------------------------------------------------------

-int compare (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+bool operator== (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return lhs.value == rhs.value; }
+
+bool operator< (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return lhs.value < rhs.value; }
+
+bool operator!= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return ! (lhs == rhs); }
+
+bool operator> (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return rhs < lhs; }
+
+bool operator<= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return ! (rhs < lhs); }
+
+bool operator>= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs)
+    { return ! (lhs < rhs); }
+
+//------------------------------------------------------------------------------
+
+bool operator== (IPAddress const& lhs, IPAddress const& rhs)
 {
-    if (lhs.value < rhs.value)
-        return -1;
-    else if (lhs.value > rhs.value)
-        return 1;
-    return 0;
-}
-
-bool operator== (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) == 0; }
-bool operator!= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) != 0; }
-bool operator<  (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) <  0; }
-bool operator<= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) <= 0; }
-bool operator>  (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) >  0; }
-bool operator>= (IPAddress::V4 const& lhs, IPAddress::V4 const& rhs) { return compare (lhs, rhs) >= 0; }
-
-static int type_compare (IPAddress const& lhs, IPAddress const& rhs)
-{
-    if (lhs.type() < rhs.type())
-        return -1;
-    else if (lhs.type() > rhs.type())
-        return 1;
-    return 0;
-}
-
-int compare (IPAddress const& lhs, IPAddress const& rhs)
-{
-    int const tc (type_compare (lhs, rhs));
-
-    if (tc < 0)
-        return -1;
-    else if (tc > 0)
-        return 1;
-
+    if (lhs.type() != rhs.type())
+        return false;
    switch (lhs.type())
    {
-    case IPAddress::none: return 0;
-    case IPAddress::ipv4: return compare (lhs.v4(), rhs.v4());
-    default:
+    case IPAddress::none: return true;
+    case IPAddress::ipv4:
+        if (lhs.v4() != rhs.v4())
+            return false;
+        if (lhs.port() != rhs.port())
+            return false;
+        return true;
    case IPAddress::ipv6:
-        break;
-    };
-    bassertfalse;
-    return 0;
+    default:
+        bassertfalse;
+    }
+    return false;
 }

-bool operator== (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) == 0; }
-bool operator!= (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) != 0; }
-bool operator<  (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) <  0; }
-bool operator<= (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) <= 0; }
-bool operator>  (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) >  0; }
-bool operator>= (IPAddress const& lhs, IPAddress const& rhs) { return compare (lhs, rhs) >= 0; }
+bool operator< (IPAddress const& lhs, IPAddress const& rhs)
+{
+    if (lhs.type() > rhs.type())
+        return false;
+    if (lhs.type() < rhs.type())
+        return true;
+    switch (lhs.type())
+    {
+    case IPAddress::none: return true;
+    case IPAddress::ipv4:
+        if (lhs.v4() < rhs.v4())
+            return true;
+        if (lhs.v4() > rhs.v4())
+            return false;
+        return lhs.port() < rhs.port();
+    case IPAddress::ipv6:
+    default:
+        bassertfalse;
+    }
+    return false;
+}
+
+bool operator!= (IPAddress const& lhs, IPAddress const& rhs)
+    { return ! (lhs == rhs); }
+
+bool operator> (IPAddress const& lhs, IPAddress const& rhs)
+    { return rhs < lhs; }
+
+bool operator<= (IPAddress const& lhs, IPAddress const& rhs)
+    { return ! (rhs < lhs); }
+
+bool operator>= (IPAddress const& lhs, IPAddress const& rhs)
+    { return ! (lhs < rhs); }
+
+//------------------------------------------------------------------------------

 std::ostream& operator<< (std::ostream &os, IPAddress::V4 const& addr)
 {
--- a/src/beast/beast/smart_ptr/AbstractObject.h
+++ b/src/beast/beast/smart_ptr/AbstractObject.h
@@ -0,0 +1,255 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Portions of this file are from JUCE.
+    Copyright (c) 2013 - Raw Material Software Ltd.
+    Please visit http://www.juce.com
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_SMARTPTR_ABSTRACTOBJECT_H_INCLUDED
+#define BEAST_SMARTPTR_ABSTRACTOBJECT_H_INCLUDED
+
+#include <list>
+#include <memory>
+#include <stdexcept>
+#include <typeinfo>
+#include "../Atomic.h"
+#include "../Config.h"
+#include "../Uncopyable.h"
+#include "../intrusive/LockFreeStack.h"
+
+namespace beast {
+namespace abstract {
+
+/** Base for all abstract interfaces. */
+class BasicInterface
+{
+public:
+    virtual ~BasicInterface() { }
+
+    /** Returns the unique ID of this interface type.
+        The ID must be the same for all instances of the
+        derived interface.
+    */
+    virtual std::size_t id () const = 0;
+
+    /** Returns the unique ID associated with the Derived type. */
+    template <typename Derived>
+    static std::size_t type_id ()
+    {
+        static std::size_t const value (next_id ());
+        return value;
+    }
+
+private:
+    // Returns a new unique id
+    static std::size_t next_id ()
+    {
+        static Atomic <std::size_t> value;
+        return ++value;
+    }
+};
+
+//------------------------------------------------------------------------------
+
+/** Base for a derived interface. */
+template <typename Derived>
+class Interface : public BasicInterface
+{
+public:
+    // Returns the unique ID for all instances of Derived
+    std::size_t id () const
+    {
+        return BasicInterface::type_id <Derived> ();
+    }
+};
+
+//------------------------------------------------------------------------------
+
+/** Factory for producing interfaces on a specific object. */
+template <typename Object>
+class Factory
+{
+public:
+    class Callback;
+
+private:
+    struct Item;
+
+    typedef LockFreeStack <Item> Items;
+
+    struct Item : Items::Node
+    {
+        Item (Callback& owner_)
+         : owner (owner_)
+            { }
+        Callback& owner;
+    };
+
+    Items m_items;
+
+public:
+    /** Base for hooking object creation. */
+    class Callback
+    {
+    public:
+        /** Create the callback and insert it into the factory. */
+        explicit Callback (Factory& factory)
+            : m_item (*this)
+        {
+            factory.m_items.push_front (&m_item);
+        }
+
+        /** Called when Object is created.
+            Object must be fully constructed. The order of calls to callbacks
+            is not defined.
+        */
+        virtual void create_interfaces (Object& object) = 0;
+
+    private:
+        Item m_item;
+    };
+
+    /** Invokes the callbacks for an instance of Object.
+        This must be called after the object is fully constructed, for example
+        as the last statement in the constructor.
+    */
+    void create_interfaces (Object& object)
+    {
+        for (typename Items::iterator iter (m_items.begin());
+            iter != m_items.end(); ++iter)
+            iter->owner.create_interfaces (object);
+    }
+};
+
+//------------------------------------------------------------------------------
+
+/** A container of polymorphic interfaces.
+    The Object type associated with the container is used to gain access
+    to the corresponding factory.
+*/
+template <typename Object>
+class Interfaces : public Uncopyable
+{
+public:
+    Interfaces ()
+    {
+    }
+
+    /** Returns a reference to the specified interface.
+        The interface must exist in the container or an exception is thrown.
+        Requirements:
+            Derived must be a subclass of Interface
+    */
+    /** @{ */
+    template <typename Derived>
+    Derived& get_interface()
+    {
+        Derived* derived (find_interface <Derived> ());
+        if (derived == nullptr)
+            throw std::bad_cast ();
+        return *derived;
+    }
+
+    template <typename Derived>
+    Derived const& get_interface() const
+    {
+        Derived const* derived (find_interface <Derived> ());
+        if (derived == nullptr)
+            throw std::bad_cast ();
+        return *derived;
+    }
+    /** @} */
+
+    /** Returns a pointer to the specified interface.
+        If the interface does not exist, `nullptr` is returned.
+        Requirements:
+            Derived must be a subclass of Interface
+    */
+    /** @{ */
+    template <typename Derived>
+    Derived* find_interface()
+    {
+        std::size_t const id = BasicInterface::type_id <Derived> ();
+
+        for (typename Set::iterator iter (m_set.begin());
+            iter != m_set.end(); ++iter)
+        {
+            if ((*iter)->id() == id)
+            {
+                Derived* const derived (
+                    dynamic_cast <Derived*> (iter->get()));
+                check_postcondition (derived != nullptr);
+                return derived;
+            }
+        }
+        return nullptr;
+    }
+
+    template <typename Derived>
+    Derived const* find_interface() const
+    {
+        std::size_t const id = BasicInterface::type_id <Derived> ();
+
+        for (typename Set::const_iterator iter (m_set.begin());
+            iter != m_set.end(); ++iter)
+        {
+            if ((*iter)->id() == id)
+            {
+                Derived const* const derived (
+                    dynamic_cast <Derived const*> (iter->get()));
+                check_postcondition (derived != nullptr);
+                return derived;
+            }
+        }
+        return nullptr;
+    }
+
+    template <typename Derived>
+    bool has_interface() const
+    {
+        return find_interface <Derived> () != nullptr;
+    }
+    /** @} */
+
+    /** Adds the specified interface to the container.
+        Ownership of the object, which must be allocated via operator new,
+        is transferred to the container. If the interface already exists,
+        an exception is thrown.
+        Requirements:
+            Derived must be a subclass of Interface
+    */
+    template <typename Derived>
+    void add_interface (Derived* derived)
+    {
+        std::unique_ptr <BasicInterface> base_interface (
+            derived);
+        if (has_interface <Derived> ())
+            throw std::invalid_argument ("non-unique");
+        m_set.emplace_back (base_interface.release ());
+    }
+
+private:
+    typedef std::list <std::unique_ptr <BasicInterface>> Set;
+    Set m_set;
+};
+
+}
+}
+
+#endif
--- a/src/beast/beast/smart_ptr/SharedObject.h
+++ b/src/beast/beast/smart_ptr/SharedObject.h
@@ -24,8 +24,9 @@
 #ifndef BEAST_SHAREDOBJECT_H_INCLUDED
 #define BEAST_SHAREDOBJECT_H_INCLUDED

+#include <atomic>
+
 #include "../Config.h"
-#include "../Atomic.h"
 #include "../Uncopyable.h"

 namespace beast {
@@ -71,7 +72,7 @@ public:
        This is done automatically by the smart pointer, but is public just
        in case it's needed for nefarious purposes.
    */
-    inline void incReferenceCount() const noexcept
+    void incReferenceCount() const noexcept
    {
        ++refCount;
    }
@@ -93,15 +94,16 @@ public:
    }

    /** Returns the object's current reference count. */
-    inline int getReferenceCount() const noexcept
+    int getReferenceCount() const noexcept
    {
-        return refCount.get();
+        return refCount.load();
    }

 protected:
    //==============================================================================
    /** Creates the reference-counted object (with an initial ref count of zero). */
    SharedObject()
+        : refCount (0)
    {
    }

@@ -125,79 +127,12 @@ protected:
    */
    void resetReferenceCount() noexcept
    {
-        refCount = 0;
+        refCount.store (0);
    }

 private:
    //==============================================================================
-    Atomic <int> mutable refCount;
-};
-
-//==============================================================================
-/**
-    Adds reference-counting to an object.
-
-    This is effectively a version of the SharedObject class, but which
-    uses a non-atomic counter, and so is not thread-safe (but which will be more
-    efficient).
-    For more details on how to use it, see the SharedObject class notes.
-
-    @see SharedObject, SharedPtr, SharedObjectArray
-*/
-class BEAST_API SingleThreadedSharedObject : public Uncopyable
-{
-public:
-    //==============================================================================
-    /** Increments the object's reference count.
-
-        This is done automatically by the smart pointer, but is public just
-        in case it's needed for nefarious purposes.
-    */
-    inline void incReferenceCount() noexcept
-    {
-        ++refCount;
-    }
-
-    /** Decreases the object's reference count.
-
-        If doDelete is true the object will be deleted when the reference
-        count drops to zero. The delete is performed using the regular
-        operator and does NOT go through the ContainerDeletePolicy.
-
-        The return value indicates if the reference count dropped to zero,
-        so callers who know the derived type can use the ContainerDeletePolicy.
-    */
-    inline void decReferenceCount ()
-    {
-        bassert (getReferenceCount() > 0);
-        if (--refCount == 0)
-            destroy ();
-    }
-
-    /** Returns the object's current reference count. */
-    inline int getReferenceCount() const noexcept       { return refCount; }
-
-
-protected:
-    //==============================================================================
-    /** Creates the reference-counted object (with an initial ref count of zero). */
-    SingleThreadedSharedObject() : refCount (0)  {}
-
-    /** Destructor. */
-    virtual ~SingleThreadedSharedObject()
-    {
-        // it's dangerous to delete an object that's still referenced by something else!
-        bassert (getReferenceCount() == 0);
-    }
-
-    virtual void destroy () const
-    {
-        delete this;
-    }
-
-private:
-    //==============================================================================
-    int refCount;
+    std::atomic <int> mutable refCount;
 };

 }
--- a/src/beast/beast/smart_ptr/SmartPtr.cpp
+++ b/src/beast/beast/smart_ptr/SmartPtr.cpp
@@ -19,7 +19,13 @@

 #include "BeastConfig.h"

+#include "../Config.h"
+
 #include "ContainerDeletePolicy.h"
 #include "ScopedPointer.h"
 #include "SharedObject.h"
 #include "SharedPtr.h"
+
+#include "../../modules/beast_core/beast_core.h" // for UnitTest
+
+#include "impl/AbstractObject.cpp"
--- a/src/beast/beast/smart_ptr/impl/AbstractObject.cpp
+++ b/src/beast/beast/smart_ptr/impl/AbstractObject.cpp
@@ -0,0 +1,147 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Portions of this file are from JUCE.
+    Copyright (c) 2013 - Raw Material Software Ltd.
+    Please visit http://www.juce.com
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#include "../AbstractObject.h"
+
+namespace beast {
+namespace abstract {
+
+class AbstractObjectTests : public UnitTest
+{
+public:
+    class Object : public Interfaces <Object>
+    {
+    public:
+        explicit Object (UnitTest& test)
+            : m_test (test)
+        {
+        }
+
+        UnitTest& test ()
+        {
+            return m_test;
+        }
+
+    private:
+        UnitTest& m_test;
+    };
+
+    //--------------------------------------------------------------------------
+
+    class Interface1 : public Interface <Interface1>
+    {
+    public:
+        Interface1 ()
+        {
+        }
+    };
+
+    class Callback1 : public Factory <Object>::Callback
+    {
+    public:
+        explicit Callback1 (Factory <Object>& factory)
+            : Factory <Object>::Callback (factory)
+        {
+        }
+
+        void create_interfaces (Object& object)
+        {
+            object.add_interface (new Interface1);
+        }
+    };
+
+    //--------------------------------------------------------------------------
+
+    class Interface2 : public Interface <Interface2>
+    {
+    public:
+        Interface2 ()
+        {
+        }
+    };
+
+    class Callback2 : public Factory <Object>::Callback
+    {
+    public:
+        explicit Callback2 (Factory <Object>& factory)
+            : Factory <Object>::Callback (factory)
+        {
+        }
+
+        void create_interfaces (Object& object)
+        {
+            object.add_interface (new Interface2);
+        }
+    };
+
+    //--------------------------------------------------------------------------
+
+    void runTest ()
+    {
+        beginTestCase ("create");
+
+        Factory <Object> factory;
+        Callback1 callback1 (factory);
+        Callback2 callback2 (factory);
+
+        Object object (*this);
+        factory.create_interfaces (object);
+
+        // find existing interfaces
+        expect (object.find_interface <Interface1> () != nullptr);
+        expect (object.find_interface <Interface2> () != nullptr);
+         
+        // add duplicate interface
+        try
+        {
+            object.add_interface (new Interface1);
+            fail ("uncaught exeption");
+        }
+        catch (std::invalid_argument const&)
+        {
+            pass ();
+        }
+
+        // request missing interface
+        try
+        {
+            struct MissingInterface { };
+            object.get_interface <MissingInterface> ();
+            fail ("uncaught exeption");
+        }
+        catch (std::bad_cast const&)
+        {
+            pass ();
+        }
+    }
+
+    AbstractObjectTests () : UnitTest (
+        "AbstractObject", "beast", runManual)
+    {
+    }
+};
+
+static AbstractObjectTests abstractObjectTests;
+
+}
+}
--- a/src/beast/modules/beast_extras/beast_extras.cpp
+++ b/src/beast/modules/beast_extras/beast_extras.cpp
@@ -19,11 +19,4 @@

 #include "BeastConfig.h"

-#include "beast_extras.h"
-
-namespace beast
-{
-
-
-
-}
+#include "shared_ptr.h"
--- a/src/beast/beast/stl/shared_ptr.h
+++ b/src/beast/beast/stl/shared_ptr.h
@@ -17,24 +17,17 @@
 */
 //==============================================================================

-#ifndef BEAST_MPL_ADDCONST_H_INCLUDED
-#define BEAST_MPL_ADDCONST_H_INCLUDED
+#ifndef BEAST_STL_SHARED_PTR_H_INCLUDED
+#define BEAST_STL_SHARED_PTR_H_INCLUDED

-#include "RemoveConst.h"
-
-// Ideas based on boost
+#include <boost/smart_ptr.hpp>

 namespace beast {
-namespace mpl {

-/** Add the `const` qualifier to a type. */
-template <typename T>
-struct AddConst
-{
-    typedef typename RemoveConst<T>::type const type;
-};
+using boost::shared_ptr;
+using boost::make_shared;
+using boost::enable_shared_from_this;

-}
 }

 #endif
--- a/src/beast/beast/threads/ServiceQueue.h
+++ b/src/beast/beast/threads/ServiceQueue.h
@@ -22,7 +22,6 @@

 #include "../chrono/CPUMeter.h"
 #include "../intrusive/List.h"
-#include "../intrusive/LockFreeStack.h"
 #include "SharedData.h"
 #include "ThreadLocalValue.h"
 #include "WaitableEvent.h"
@@ -371,7 +370,7 @@ protected:

    //--------------------------------------------------------------------------

-    class Waiter : public LockFreeStack <Waiter>::Node
+    class Waiter : public List <Waiter>::Node
    {
    public:
        Waiter()
@@ -390,8 +389,8 @@ protected:
    {
        // handlers
        List <Item> handlers;
-        LockFreeStack <Waiter> waiting;
-        LockFreeStack <Waiter> unused;
+        List <Waiter> waiting;
+        List <Waiter> unused;
    };

    typedef SharedData <State> SharedState;
@@ -440,9 +439,8 @@ public:
        typename Allocator::template rebind <Waiter>::other a (m_alloc);
        SharedState::Access state (m_state);
        while (expectedConcurrency--)
-        {
-            state->unused.push_front (new (a.allocate (1)) Waiter);
-        }
+            state->unused.push_front (
+                *new (a.allocate (1)) Waiter);
    }

    ~ServiceQueueType()
@@ -456,11 +454,10 @@ public:
        bassert (state->waiting.empty());

        typename Allocator::template rebind <Waiter>::other a (m_alloc);
-        for(;;)
+        while (! state->unused.empty ())
        {
-            Waiter* const waiter (state->unused.pop_front());
-            if (waiter == nullptr)
-                break;
+            Waiter* const waiter (&state->unused.front ());
+            state->unused.pop_front ();
            a.destroy (waiter);
            a.deallocate (waiter, 1);
        }
--- a/src/beast/beast/threads/impl/ServiceQueue.cpp
+++ b/src/beast/beast/threads/impl/ServiceQueue.cpp
@@ -119,12 +119,11 @@ void ServiceQueueBase::stop ()
 {
    SharedState::Access state (m_state);
    m_stopped.set (1);
-    for(;;)
+    while (! state->waiting.empty ())
    {
-        Waiter* waiting (state->waiting.pop_front());
-        if (waiting == nullptr)
-            break;
-        waiting->signal();
+        Waiter& waiting (state->waiting.front());
+        state->waiting.pop_front ();
+        waiting.signal ();
    }
 }

@@ -144,14 +143,24 @@ void ServiceQueueBase::wait ()

    {
        SharedState::Access state (m_state);
+
        if (stopped ())
            return;
+
        if (! state->handlers.empty())
            return;
-        waiter = state->unused.pop_front();
-        if (! waiter)
+
+        if (state->unused.empty ())
+        {
            waiter = new_waiter();
-        state->waiting.push_front (waiter);
+        }
+        else
+        {
+            waiter = &state->unused.front ();
+            state->unused.pop_front ();
+        }
+
+        state->waiting.push_front (*waiter);
    }

    waiter->wait();
@@ -160,19 +169,22 @@ void ServiceQueueBase::wait ()

    {
        SharedState::Access state (m_state);
-        state->unused.push_front (waiter);
+        state->unused.push_front (*waiter);
    }
 }

 void ServiceQueueBase::enqueue (Item* item)
 {
-    Waiter* waiter;
+    Waiter* waiter (nullptr);

    {
        SharedState::Access state (m_state);
        state->handlers.push_back (*item);
-        // Signal a Waiter if one exists
-        waiter = state->waiting.pop_front();
+        if (! state->waiting.empty ())
+        {
+            waiter = &state->waiting.front ();
+            state->waiting.pop_front ();
+        }
    }

    if (waiter != nullptr)
--- a/src/beast/beast/threads/impl/Thread.cpp
+++ b/src/beast/beast/threads/impl/Thread.cpp
@@ -439,9 +439,16 @@ void Thread::yield()
 #if BEAST_BSD
 // ???
 #elif BEAST_MAC || BEAST_IOS
-// Compiles fine without prctl.h
+#include <Foundation/NSThread.h>
+#include <Foundation/NSString.h>
+#import <objc/message.h>
+namespace beast{
+#include "../../../modules/beast_core/native/osx_ObjCHelpers.h"
+}
+
 #else
 # include <sys/prctl.h>
+
 #endif

 namespace beast {
--- a/src/beast/beast/threads/semaphore.h
+++ b/src/beast/beast/threads/semaphore.h
@@ -0,0 +1,86 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_THREADS_SEMAPHORE_H_INCLUDED
+#define BEAST_THREADS_SEMAPHORE_H_INCLUDED
+
+#include <condition_variable>
+#include <mutex>
+
+namespace beast {
+
+template <class Mutex, class CondVar>
+class basic_semaphore
+{
+private:
+    typedef std::unique_lock <Mutex> scoped_lock;
+
+    Mutex m_mutex;
+    CondVar m_cond;
+    std::size_t m_count;
+
+public:
+    typedef std::size_t size_type;
+
+    /** Create the semaphore, with an optional initial count.
+        If unspecified, the initial count is zero.
+    */
+    explicit basic_semaphore (size_type count = 0)
+        : m_count (count)
+    {
+    }
+
+    /** Increment the count and unblock one waiting thread. */
+    void notify ()
+    {
+        scoped_lock lock (m_mutex);
+        ++m_count;
+        m_cond.notify_one ();
+    }
+
+    // Deprecated, for backward compatibility
+    void signal () { notify (); }
+
+    /** Block until notify is called. */
+    void wait ()
+    {
+        scoped_lock lock (m_mutex);
+        while (m_count == 0)
+            m_cond.wait (lock);
+        --m_count;
+    }
+
+    /** Perform a non-blocking wait.
+        @return `true` If the wait would be satisfied.
+    */
+    bool try_wait ()
+    {
+        scoped_lock lock (m_mutex);
+        if (m_count == 0)
+            return false;
+        --m_count;
+        return true;
+    }
+};
+
+typedef basic_semaphore <std::mutex, std::condition_variable> semaphore;
+}
+
+#endif
+
--- a/src/beast/beast/utility/Journal.h
+++ b/src/beast/beast/utility/Journal.h
@@ -29,55 +29,66 @@ namespace beast {
 /** A generic endpoint for log messages. */
 class Journal
 {
-public:
-    class Sink;
-
-private:
-    Sink* m_sink;
-
 public:
    /** Severity level of the message. */
    enum Severity
    {
-        kLowestSeverity = 0,
-        kTrace = kLowestSeverity,
+        kAll = 0,
+
+        kTrace = kAll,
        kDebug,
        kInfo,
        kWarning,
        kError,
        kFatal,

-        kDisabled
+        kDisabled,
+        kNone = kDisabled
    };

+    class Sink;
+
+private:
+    Journal& operator= (Journal const& other); // disallowed
+
+    Sink* m_sink;
+    Severity m_level;
+
+public:
    //--------------------------------------------------------------------------

    /** Abstraction for the underlying message destination. */
    class Sink
    {
    public:
-        virtual ~Sink () { }
+        Sink ();
+
+        virtual ~Sink () = 0;

        /** Returns `true` if text at the passed severity produces output. */
-        virtual bool active (Severity severity) const = 0;
+        virtual bool active (Severity level) const;

        /** Returns `true` if a message is also written to the Output Window (MSVC). */
-        virtual bool console () const = 0;
+        virtual bool console () const;

        /** Set whether messages are also written to the Output Window (MSVC). */
-        virtual void console (bool output) = 0;
+        virtual void console (bool output);

        /** Returns the minimum severity level this sink will report. */
-        virtual Severity severity() const = 0;
+        virtual Severity severity() const;

        /** Set the minimum severity this sink will report. */
-        virtual void severity (Severity level) = 0;
+        virtual void severity (Severity level);

        /** Write text to the sink at the specified severity.
            The caller is responsible for checking the minimum severity level
            before using this function.
        */
        virtual void write (Severity level, std::string const& text) = 0;
+
+    private:
+        Severity m_level;
+        bool m_console;
    };

    /** Returns a Sink which does nothing. */
@@ -97,23 +108,32 @@ public:
        template <typename T>
        ScopedStream (Stream const& stream, T const& t)
            : m_sink (stream.sink())
-            , m_severity (stream.severity())
+            , m_level (stream.severity())
+            , m_active (stream.active ())
        {
-            m_ostream << t;
+            if (active ())
+                m_ostream << t;
        }

-        ScopedStream (Stream const& stream, std::ostream& manip (std::ostream&));
+        ScopedStream (Stream const& stream,
+            std::ostream& manip (std::ostream&));

        ~ScopedStream ();

+        bool active () const
+            { return m_active; }
+
        std::ostringstream& ostream () const;

-        std::ostream& operator<< (std::ostream& manip (std::ostream&)) const;
+        std::ostream& operator<< (
+            std::ostream& manip (std::ostream&)) const;

        template <typename T>
        std::ostream& operator<< (T const& t) const
        {
-            return m_ostream << t;
+            if (active ())
+                m_ostream << t;
+            return m_ostream;
        }

    private:
@@ -122,7 +142,8 @@ public:
        ScopedStream& operator= (ScopedStream const&); // disallowed

        Sink& m_sink;
-        Severity const m_severity;
+        Severity const m_level;
+        bool const m_active;
        std::ostringstream mutable m_ostream;
        bool m_toOutputWindow;
    };
@@ -132,11 +153,14 @@ public:
    class Stream : public SafeBool <Stream>
    {
    public:
-        /** Construct a stream which produces no logging output. */
+        /** Create a stream which produces no output. */
        Stream ();

-        /** Construct a stream that writes to the Sink at the given Severity. */
-        Stream (Sink& sink, Severity severity);
+        /** Create stream that writes at the given level. */
+        /** @{ */
+        Stream (Sink& sink, Severity level, bool active = true);
+        Stream (Stream const& stream, bool active);
+        /** @} */

        /** Construct or copy another Stream. */
        /** @{ */
@@ -169,24 +193,48 @@ public:

    private:
        Sink* m_sink;
-        Severity m_severity;
+        Severity m_level;
+        bool m_disabled;
    };

    //--------------------------------------------------------------------------

+    /** Create a journal that writes to the null sink. */
    Journal ();
-    explicit Journal (Sink& sink);
+
+    /** Create a journal that writes to the specified sink. */
+    /** @{ */
+    explicit Journal (Sink& sink, Severity level = kAll);
+
+    /** Create a journal from another journal.
+        When specifying a new minimum severity level, the effective minimum
+        level will be the higher of the other journal and the specified value.
+    */
+    /** @{ */
    Journal (Journal const& other);
+    Journal (Journal const& other, Severity level);
+    /** @} */
+
+    /** Destroy the journal. */
    ~Journal ();

    /** Returns the Sink associated with this Journal. */
    Sink& sink() const;

    /** Returns a stream for this sink, with the specified severity. */
-    Stream stream (Severity severity) const;
+    Stream stream (Severity level) const;

-    /** Returns `true` if any message would be logged at this severity level. */
-    bool active (Severity severity) const;
+    /** Returns `true` if any message would be logged at this severity level.
+        For a message to be logged, the severity must be at or above both
+        the journal's severity level and the sink's severity level.
+    */
+    bool active (Severity level) const;
+
+    /** Returns this Journal's minimum severity level.
+        If the underlying sink has a higher threshold, there will still
+        be no output at that level.
+    */
+    Severity severity () const;

    /** Convenience sink streams for each severity level. */
    Stream const trace;
@@ -195,9 +243,6 @@ public:
    Stream const warning;
    Stream const error;
    Stream const fatal;
-
-private:
-    Journal& operator= (Journal const& other); // disallowed
 };

 }
--- a/src/beast/beast/utility/PropertyStream.h
+++ b/src/beast/beast/utility/PropertyStream.h
@@ -62,6 +62,7 @@ protected:
    virtual void add (std::string const& key,  uint32 value);
    virtual void add (std::string const& key,   int64 value);
    virtual void add (std::string const& key,  uint64 value);
+    virtual void add (std::string const& key,  double value);

    virtual void array_begin () = 0;
    virtual void array_begin (std::string const& key) = 0;
--- a/src/beast/beast/utility/hash_pair.h
+++ b/src/beast/beast/utility/hash_pair.h
@@ -0,0 +1,70 @@
+//------------------------------------------------------------------------------
+/*
+    This file is part of Beast: https://github.com/vinniefalco/Beast
+    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose  with  or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
+    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+//==============================================================================
+
+#ifndef BEAST_UTILITY_HASH_PAIR_H_INCLUDED
+#define BEAST_UTILITY_HASH_PAIR_H_INCLUDED
+
+#include <functional>
+#include <utility>
+
+#include <boost/functional/hash.hpp>
+#include <boost/utility/base_from_member.hpp>
+
+namespace std {
+
+/** Specialization of std::hash for any std::pair type. */
+template <class First, class Second>
+struct hash <std::pair <First, Second>>
+    : private boost::base_from_member <std::hash <First>, 0>
+    , private boost::base_from_member <std::hash <Second>, 1>
+{
+private:
+    typedef boost::base_from_member <std::hash <First>, 0> first_hash;
+    typedef boost::base_from_member <std::hash <Second>, 1> second_hash;
+
+public:
+    hash ()
+    {
+    }
+
+    hash (std::hash <First> const& first_hash_,
+          std::hash <Second> const& second_hash_)
+          : first_hash (first_hash_)
+          , second_hash (second_hash_)
+    {
+    }
+
+    std::size_t operator() (std::pair <First, Second> const& value)
+    {
+        std::size_t result (first_hash::member (value.first));
+        boost::hash_combine (result, second_hash::member (value.second));
+        return result;
+    }
+
+    std::size_t operator() (std::pair <First, Second> const& value) const
+    {
+        std::size_t result (first_hash::member (value.first));
+        boost::hash_combine (result, second_hash::member (value.second));
+        return result;
+    }
+};
+
+}
+
+#endif
--- a/src/beast/beast/utility/impl/Journal.cpp
+++ b/src/beast/beast/utility/impl/Journal.cpp
@@ -65,32 +65,83 @@ Journal::Sink& Journal::getNullSink ()

 //------------------------------------------------------------------------------

+Journal::Sink::Sink ()
+    : m_level (kAll)
+    , m_console (false)
+{
+}
+
+Journal::Sink::~Sink ()
+{
+}
+
+bool Journal::Sink::active (Severity level) const
+{
+    return level >= m_level;
+}
+
+bool Journal::Sink::console () const
+{
+    return m_console;
+}
+
+void Journal::Sink::console (bool output)
+{
+    m_console = output;
+}
+
+Journal::Severity Journal::Sink::severity () const
+{
+    return m_level;
+}
+
+void Journal::Sink::severity (Severity level)
+{
+    m_level = level;
+}
+
+//------------------------------------------------------------------------------
+
 Journal::ScopedStream::ScopedStream (Stream const& stream)
-    : m_sink (stream.sink())
-    , m_severity (stream.severity())
+    : m_sink (stream.sink ())
+    , m_level (stream.severity ())
+    , m_active (stream.active ())
 {
    init ();
 }

 Journal::ScopedStream::ScopedStream (ScopedStream const& other)
    : m_sink (other.m_sink)
-    , m_severity (other.m_severity)
+    , m_level (other.m_level)
+    , m_active (other.m_active)
 {
    init ();
 }

-Journal::ScopedStream::ScopedStream (Stream const& stream, std::ostream& manip (std::ostream&))
-    : m_sink (stream.sink())
-    , m_severity (stream.severity())
+Journal::ScopedStream::ScopedStream (
+    Stream const& stream, std::ostream& manip (std::ostream&))
+    : m_sink (stream.sink ())
+    , m_level (stream.severity ())
+    , m_active (stream.active ())
 {
    init ();
-    m_ostream << manip;
+    if (active ())
+        m_ostream << manip;
 }

 Journal::ScopedStream::~ScopedStream ()
 {
-    if (! m_ostream.str().empty() && m_sink.active (m_severity))
-        m_sink.write (m_severity, m_ostream.str());
+    if (active ())
+    {
+        std::string const& s (m_ostream.str());
+        if (! s.empty ())
+        {
+            if (s == "\n")
+                m_sink.write (m_level, "");
+            else
+                m_sink.write (m_level, s);
+        }
+    }
 }

 void Journal::ScopedStream::init ()
@@ -118,20 +169,30 @@ std::ostringstream& Journal::ScopedStream::ostream () const

 Journal::Stream::Stream ()
    : m_sink (&getNullSink ())
-    , m_severity (kDisabled)
+    , m_level (kDisabled)
+    , m_disabled (true)
 {
 }

-Journal::Stream::Stream (Sink& sink, Severity severity)
+Journal::Stream::Stream (Sink& sink, Severity level, bool active)
    : m_sink (&sink)
-    , m_severity (severity)
+    , m_level (level)
+    , m_disabled (! active)
+{
+    bassert (level != kDisabled);
+}
+
+Journal::Stream::Stream (Stream const& stream, bool active)
+    : m_sink (&stream.sink ())
+    , m_level (stream.severity ())
+    , m_disabled (! active)
 {
-    bassert (severity != kDisabled);
 }

 Journal::Stream::Stream (Stream const& other)
    : m_sink (other.m_sink)
-    , m_severity (other.m_severity)
+    , m_level (other.m_level)
+    , m_disabled (other.m_disabled)
 {
 }

@@ -142,12 +203,12 @@ Journal::Sink& Journal::Stream::sink () const

 Journal::Severity Journal::Stream::severity () const
 {
-    return m_severity;
+    return m_level;
 }

 bool Journal::Stream::active () const
 {
-    return m_sink->active (m_severity);
+    return ! m_disabled && m_sink->active (m_level);
 }

 bool Journal::Stream::asBoolean () const
@@ -158,11 +219,12 @@ bool Journal::Stream::asBoolean () const
 Journal::Stream& Journal::Stream::operator= (Stream const& other)
 {
    m_sink = other.m_sink;
-    m_severity = other.m_severity;
+    m_level = other.m_level;
    return *this;
 }

-Journal::ScopedStream Journal::Stream::operator<< (std::ostream& manip (std::ostream&)) const
+Journal::ScopedStream Journal::Stream::operator<< (
+    std::ostream& manip (std::ostream&)) const
 {
    return ScopedStream (*this, manip);
 }
@@ -171,6 +233,7 @@ Journal::ScopedStream Journal::Stream::operator<< (std::ostream& manip (std::ost

 Journal::Journal ()
    : m_sink  (&getNullSink())
+    , m_level (kDisabled)
    , trace   (stream (kTrace))
    , debug   (stream (kDebug))
    , info    (stream (kInfo))
@@ -180,8 +243,9 @@ Journal::Journal ()
 {
 }

-Journal::Journal (Sink& sink)
+Journal::Journal (Sink& sink, Severity level)
    : m_sink  (&sink)
+    , m_level (level)
    , trace   (stream (kTrace))
    , debug   (stream (kDebug))
    , info    (stream (kInfo))
@@ -193,6 +257,19 @@ Journal::Journal (Sink& sink)

 Journal::Journal (Journal const& other)
    : m_sink  (other.m_sink)
+    , m_level (other.m_level)
+    , trace   (stream (kTrace))
+    , debug   (stream (kDebug))
+    , info    (stream (kInfo))
+    , warning (stream (kWarning))
+    , error   (stream (kError))
+    , fatal   (stream (kFatal))
+{
+}
+
+Journal::Journal (Journal const& other, Severity level)
+    : m_sink  (other.m_sink)
+    , m_level (std::max (other.m_level, level))
    , trace   (stream (kTrace))
    , debug   (stream (kDebug))
    , info    (stream (kInfo))
@@ -211,15 +288,23 @@ Journal::Sink& Journal::sink() const
    return *m_sink;
 }

-Journal::Stream Journal::stream (Severity severity) const
+Journal::Stream Journal::stream (Severity level) const
 {
-    return Stream (*m_sink, severity);
+    return Stream (*m_sink, level, level >= m_level);
 }

-bool Journal::active (Severity severity) const
+bool Journal::active (Severity level) const
 {
-    bassert (severity != kDisabled);
-    return m_sink->active (severity);
+    if (level == kDisabled)
+        return false;
+    if (level < m_level)
+        return false;
+    return m_sink->active (level);
+}
+
+Journal::Severity Journal::severity () const
+{
+    return m_level;
 }

 }
--- a/src/beast/beast/utility/impl/PropertyStream.cpp
+++ b/src/beast/beast/utility/impl/PropertyStream.cpp
@@ -390,6 +390,11 @@ void PropertyStream::add (std::string const& key, int64 value)
    }
 }

+void PropertyStream::add (std::string const& key, double value)
+{
+    lexical_add (key, value);
+}
+
 void PropertyStream::add (std::string const& key, uint64 value)
 {
    if (value <= std::numeric_limits <uint32>::max() &&
--- a/src/beast/modules/beast_asio/async/AbstractHandler.h
+++ b/src/beast/modules/beast_asio/async/AbstractHandler.h
@@ -130,7 +130,7 @@ private:

 /** A reference counted, abstract completion handler. */
 template <typename Signature, class Allocator = std::allocator <char> >
-class AbstractHandler;
+struct AbstractHandler;

 //------------------------------------------------------------------------------

--- a/src/beast/modules/beast_asio/async/AsyncObject.h
+++ b/src/beast/modules/beast_asio/async/AsyncObject.h
@@ -64,6 +64,17 @@ public:
        Derived* m_owner;
    };

+    void addReference ()
+    {
+        ++m_pending;
+    }
+
+    void removeReference ()
+    {
+        if (--m_pending)
+            (static_cast <Derived *> (this))->asyncHandlersComplete ();
+    }
+
 private:
    // The number of handlers pending.
    Atomic <int> m_pending;
--- a/src/beast/modules/beast_asio/async/SharedHandler.h
+++ b/src/beast/modules/beast_asio/async/SharedHandler.h
@@ -62,14 +62,7 @@ public:
    virtual void operator() (error_code const&, std::size_t);

    template <typename Function>
-    void invoke (BOOST_ASIO_MOVE_ARG(Function) f)
-    {
-        // The allocator will hold a reference to the SharedHandler
-        // so that we can safely destroy the function object.
-        invoked_type invoked (f,
-            SharedHandlerAllocator <char> (this));
-        invoke (invoked);
-    }
+    void invoke (BEAST_MOVE_ARG(Function) f);

    virtual void  invoke (invoked_type& invoked) = 0;
    virtual void* allocate (std::size_t size) = 0;
--- a/src/beast/modules/beast_asio/async/SharedHandlerAllocator.h
+++ b/src/beast/modules/beast_asio/async/SharedHandlerAllocator.h
@@ -24,7 +24,7 @@

    This class is compatible with std::allocator and can be used in any
    boost interface which takes a template parameter of type Allocator.
-    This includes boost::function and especially boost::asio::streambuf
+    This includes std::function and especially boost::asio::streambuf
    and relatives. This is vastly more efficient in a variety of situations
    especially during an upcall and when using stackful coroutines.

@@ -111,17 +111,13 @@ private:
 };

 //------------------------------------------------------------------------------
-
-#if 0
 template <typename Function>
-void SharedHandler::invoke (BOOST_ASIO_MOVE_ARG(Function) f)
+void SharedHandler::invoke (BEAST_MOVE_ARG(Function) f)
 {
    // The allocator will hold a reference to the SharedHandler
    // so that we can safely destroy the function object.
-    invoked_type invoked (BOOST_ASIO_MOVE_CAST(Function)(f),
-        SharedHandlerAllocator <char> (this));
+    invoked_type invoked (f,SharedHandlerAllocator <char> (this));
    invoke (invoked);
 }
-#endif

 #endif
--- a/src/beast/modules/beast_asio/sockets/SocketBase.h
+++ b/src/beast/modules/beast_asio/sockets/SocketBase.h
@@ -25,7 +25,7 @@
 */
 struct SocketBase
 {
-protected:
+public:
    typedef boost::system::error_code error_code;

    /** The error returned when a pure virtual is called.
--- a/src/beast/modules/beast_core/beast_core.cpp
+++ b/src/beast/modules/beast_core/beast_core.cpp
@@ -129,7 +129,6 @@
 namespace beast
 {

-#include "containers/AbstractFifo.cpp"
 #include "containers/DynamicObject.cpp"
 #include "containers/NamedValueSet.cpp"
 #include "containers/PropertySet.cpp"
@@ -155,7 +154,6 @@ namespace beast
 #include "logging/Logger.cpp"

 #include "maths/BigInteger.cpp"
-#include "maths/Expression.cpp"
 #include "maths/Random.cpp"

 #include "memory/MemoryBlock.cpp"
@@ -188,7 +186,6 @@ namespace beast

 #include "thread/impl/TrackedMutex.cpp"
 #include "thread/DeadlineTimer.cpp"
-#include "thread/Semaphore.cpp"
 #include "thread/Workers.cpp"

 #include "threads/ChildProcess.cpp"
--- a/src/beast/modules/beast_core/beast_core.h
+++ b/src/beast/modules/beast_core/beast_core.h
@@ -61,6 +61,7 @@
 #include "../../beast/Threads.h"
 #include "../../beast/Utility.h"
 #include "../../beast/Chrono.h"
+#include "../../beast/STL.h"

 #include "system/StandardIncludes.h"

@@ -76,10 +77,6 @@ class FileOutputStream;

 #include "diagnostic/Throw.h"
 #include "system/Functional.h"
-#include "memory/AtomicCounter.h"
-#include "memory/AtomicFlag.h"
-#include "memory/AtomicPointer.h"
-#include "memory/AtomicState.h"
 #include "threads/SpinDelay.h"

 #include "time/AtExitHook.h"
@@ -154,7 +151,6 @@ class FileOutputStream;
 #include "logging/Logger.h"
 #include "diagnostic/FPUFlags.h"
 #include "memory/SharedFunction.h"
-#include "containers/AbstractFifo.h"
 #include "text/Identifier.h"
 #include "containers/Variant.h"
 #include "containers/LinkedListPointer.h"
@@ -162,13 +158,10 @@ class FileOutputStream;
 #include "containers/DynamicObject.h"
 #include "maths/BigInteger.h"
 #include "maths/Random.h"
-#include "containers/LockFreeQueue.h"
 #include "containers/OwnedArray.h"
 #include "text/StringPairArray.h"
 #include "containers/PropertySet.h"
-#include "containers/SharedObjectArray.h"
 #include "containers/ScopedValueSetter.h"
-#include "containers/SortedSet.h"
 #include "maths/Range.h"
 #include "containers/SparseSet.h"
 #include "files/DirectoryIterator.h"
@@ -185,12 +178,8 @@ class FileOutputStream;
 #include "json/JSON.h"
 #include "logging/FileLogger.h"
 #include "logging/Logger.h"
-#include "maths/Expression.h"
-#include "maths/Interval.h"
 #include "memory/OptionalScopedPointer.h"
 #include "memory/SharedSingleton.h"
-#include "memory/WeakReference.h"
-#include "memory/RecycledObjectPool.h"
 #include "misc/Main.h"
 #include "misc/Uuid.h"
 #include "misc/WindowsRegistry.h"
@@ -227,7 +216,6 @@ class FileOutputStream;

 #include "thread/DeadlineTimer.h"

-#include "thread/Semaphore.h"
 #include "thread/Workers.h"

 }
--- a/src/beast/modules/beast_core/containers/AbstractFifo.cpp
+++ b/src/beast/modules/beast_core/containers/AbstractFifo.cpp
@@ -1,228 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-AbstractFifo::AbstractFifo (const int capacity) noexcept
-    : bufferSize (capacity)
-{
-    bassert (bufferSize > 0);
-}
-
-AbstractFifo::~AbstractFifo() {}
-
-int AbstractFifo::getTotalSize() const noexcept           { return bufferSize; }
-int AbstractFifo::getFreeSpace() const noexcept           { return bufferSize - getNumReady(); }
-
-int AbstractFifo::getNumReady() const noexcept
-{
-    const int vs = validStart.get();
-    const int ve = validEnd.get();
-    return ve >= vs ? (ve - vs) : (bufferSize - (vs - ve));
-}
-
-void AbstractFifo::reset() noexcept
-{
-    validEnd = 0;
-    validStart = 0;
-}
-
-void AbstractFifo::setTotalSize (int newSize) noexcept
-{
-    bassert (newSize > 0);
-    reset();
-    bufferSize = newSize;
-}
-
-//==============================================================================
-void AbstractFifo::prepareToWrite (int numToWrite, int& startIndex1, int& blockSize1, int& startIndex2, int& blockSize2) const noexcept
-{
-    const int vs = validStart.get();
-    const int ve = validEnd.value;
-
-    const int freeSpace = ve >= vs ? (bufferSize - (ve - vs)) : (vs - ve);
-    numToWrite = bmin (numToWrite, freeSpace - 1);
-
-    if (numToWrite <= 0)
-    {
-        startIndex1 = 0;
-        startIndex2 = 0;
-        blockSize1 = 0;
-        blockSize2 = 0;
-    }
-    else
-    {
-        startIndex1 = ve;
-        startIndex2 = 0;
-        blockSize1 = bmin (bufferSize - ve, numToWrite);
-        numToWrite -= blockSize1;
-        blockSize2 = numToWrite <= 0 ? 0 : bmin (numToWrite, vs);
-    }
-}
-
-void AbstractFifo::finishedWrite (int numWritten) noexcept
-{
-    bassert (numWritten >= 0 && numWritten < bufferSize);
-    int newEnd = validEnd.value + numWritten;
-    if (newEnd >= bufferSize)
-        newEnd -= bufferSize;
-
-    validEnd = newEnd;
-}
-
-void AbstractFifo::prepareToRead (int numWanted, int& startIndex1, int& blockSize1, int& startIndex2, int& blockSize2) const noexcept
-{
-    const int vs = validStart.value;
-    const int ve = validEnd.get();
-
-    const int numReady = ve >= vs ? (ve - vs) : (bufferSize - (vs - ve));
-    numWanted = bmin (numWanted, numReady);
-
-    if (numWanted <= 0)
-    {
-        startIndex1 = 0;
-        startIndex2 = 0;
-        blockSize1 = 0;
-        blockSize2 = 0;
-    }
-    else
-    {
-        startIndex1 = vs;
-        startIndex2 = 0;
-        blockSize1 = bmin (bufferSize - vs, numWanted);
-        numWanted -= blockSize1;
-        blockSize2 = numWanted <= 0 ? 0 : bmin (numWanted, ve);
-    }
-}
-
-void AbstractFifo::finishedRead (int numRead) noexcept
-{
-    bassert (numRead >= 0 && numRead <= bufferSize);
-
-    int newStart = validStart.value + numRead;
-    if (newStart >= bufferSize)
-        newStart -= bufferSize;
-
-    validStart = newStart;
-}
-
-//==============================================================================
-
-class AbstractFifoTests  : public UnitTest
-{
-public:
-    AbstractFifoTests() : UnitTest ("Abstract Fifo", "beast")
-    {
-    }
-
-    class WriteThread  : public Thread
-    {
-    public:
-        WriteThread (AbstractFifo& fifo_, int* buffer_)
-            : Thread ("fifo writer"), fifo (fifo_), buffer (buffer_)
-        {
-            startThread();
-        }
-
-        ~WriteThread()
-        {
-            stopThread (5000);
-        }
-
-        void run()
-        {
-            int n = 0;
-            Random r;
-
-            while (! threadShouldExit())
-            {
-                int num = r.nextInt (2000) + 1;
-
-                int start1, size1, start2, size2;
-                fifo.prepareToWrite (num, start1, size1, start2, size2);
-
-                bassert (size1 >= 0 && size2 >= 0);
-                bassert (size1 == 0 || (start1 >= 0 && start1 < fifo.getTotalSize()));
-                bassert (size2 == 0 || (start2 >= 0 && start2 < fifo.getTotalSize()));
-
-                for (int i = 0; i < size1; ++i)
-                    buffer [start1 + i] = n++;
-
-                for (int i = 0; i < size2; ++i)
-                    buffer [start2 + i] = n++;
-
-                fifo.finishedWrite (size1 + size2);
-            }
-        }
-
-    private:
-        AbstractFifo& fifo;
-        int* buffer;
-    };
-
-    void runTest()
-    {
-        beginTestCase ("AbstractFifo");
-
-        int buffer [5000];
-        AbstractFifo fifo (numElementsInArray (buffer));
-
-        WriteThread writer (fifo, buffer);
-
-        int n = 0;
-        Random r;
-
-        bool failed = false;
-
-        for (int count = 100000; --count >= 0;)
-        {
-            int num = r.nextInt (6000) + 1;
-
-            int start1, size1, start2, size2;
-            fifo.prepareToRead (num, start1, size1, start2, size2);
-
-            if (! (size1 >= 0 && size2 >= 0)
-                    && (size1 == 0 || (start1 >= 0 && start1 < fifo.getTotalSize()))
-                    && (size2 == 0 || (start2 >= 0 && start2 < fifo.getTotalSize())))
-            {
-                expect (false, "prepareToRead returned negative values");
-                break;
-            }
-
-            for (int i = 0; i < size1; ++i)
-                failed = (buffer [start1 + i] != n++) || failed;
-
-            for (int i = 0; i < size2; ++i)
-                failed = (buffer [start2 + i] != n++) || failed;
-
-            if (failed)
-            {
-                break;
-            }
-
-            fifo.finishedRead (size1 + size2);
-        }
-
-        expect (! failed, "read values were incorrect");
-    }
-};
-
-static AbstractFifoTests abstractFifoTests;
--- a/src/beast/modules/beast_core/containers/AbstractFifo.h
+++ b/src/beast/modules/beast_core/containers/AbstractFifo.h
@@ -1,212 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_ABSTRACTFIFO_H_INCLUDED
-#define BEAST_ABSTRACTFIFO_H_INCLUDED
-
-//==============================================================================
-/**
-    Encapsulates the logic required to implement a lock-free FIFO.
-
-    This class handles the logic needed when building a single-reader,
-    single-writer FIFO.
-
-    It doesn't actually hold any data itself, but your FIFO class can use one of
-    these to manage its position and status when reading or writing to it.
-
-    To use it, you can call prepareToWrite() to determine the position within
-    your own buffer that an incoming block of data should be stored, and
-    prepareToRead() to find out when the next outgoing block should be read from.
-
-    e.g.
-    @code
-    class MyFifo
-    {
-    public:
-        MyFifo()  : abstractFifo (1024)
-        {
-        }
-
-        void addToFifo (const int* someData, int numItems)
-        {
-            int start1, size1, start2, size2;
-            abstractFifo.prepareToWrite (numItems, start1, size1, start2, size2);
-
-            if (size1 > 0)
-                copySomeData (myBuffer + start1, someData, size1);
-
-            if (size2 > 0)
-                copySomeData (myBuffer + start2, someData + size1, size2);
-
-            abstractFifo.finishedWrite (size1 + size2);
-        }
-
-        void readFromFifo (int* someData, int numItems)
-        {
-            int start1, size1, start2, size2;
-            abstractFifo.prepareToRead (numSamples, start1, size1, start2, size2);
-
-            if (size1 > 0)
-                copySomeData (someData, myBuffer + start1, size1);
-
-            if (size2 > 0)
-                copySomeData (someData + size1, myBuffer + start2, size2);
-
-            abstractFifo.finishedRead (size1 + size2);
-        }
-
-    private:
-        AbstractFifo abstractFifo;
-        int myBuffer [1024];
-    };
-    @endcode
-*/
-class BEAST_API AbstractFifo : LeakChecked <AbstractFifo>, public Uncopyable
-{
-public:
-    //==============================================================================
-    /** Creates a FIFO to manage a buffer with the specified capacity. */
-    AbstractFifo (int capacity) noexcept;
-
-    /** Destructor */
-    ~AbstractFifo();
-
-    //==============================================================================
-    /** Returns the total size of the buffer being managed. */
-    int getTotalSize() const noexcept;
-
-    /** Returns the number of items that can currently be added to the buffer without it overflowing. */
-    int getFreeSpace() const noexcept;
-
-    /** Returns the number of items that can currently be read from the buffer. */
-    int getNumReady() const noexcept;
-
-    /** Clears the buffer positions, so that it appears empty. */
-    void reset() noexcept;
-
-    /** Changes the buffer's total size.
-        Note that this isn't thread-safe, so don't call it if there's any danger that it
-        might overlap with a call to any other method in this class!
-    */
-    void setTotalSize (int newSize) noexcept;
-
-    //==============================================================================
-    /** Returns the location within the buffer at which an incoming block of data should be written.
-
-        Because the section of data that you want to add to the buffer may overlap the end
-        and wrap around to the start, two blocks within your buffer are returned, and you
-        should copy your data into the first one, with any remaining data spilling over into
-        the second.
-
-        If the number of items you ask for is too large to fit within the buffer's free space, then
-        blockSize1 + blockSize2 may add up to a lower value than numToWrite. If this happens, you
-        may decide to keep waiting and re-trying the method until there's enough space available.
-
-        After calling this method, if you choose to write your data into the blocks returned, you
-        must call finishedWrite() to tell the FIFO how much data you actually added.
-
-        e.g.
-        @code
-        void addToFifo (const int* someData, int numItems)
-        {
-            int start1, size1, start2, size2;
-            prepareToWrite (numItems, start1, size1, start2, size2);
-
-            if (size1 > 0)
-                copySomeData (myBuffer + start1, someData, size1);
-
-            if (size2 > 0)
-                copySomeData (myBuffer + start2, someData + size1, size2);
-
-            finishedWrite (size1 + size2);
-        }
-        @endcode
-
-        @param numToWrite       indicates how many items you'd like to add to the buffer
-        @param startIndex1      on exit, this will contain the start index in your buffer at which your data should be written
-        @param blockSize1       on exit, this indicates how many items can be written to the block starting at startIndex1
-        @param startIndex2      on exit, this will contain the start index in your buffer at which any data that didn't fit into
-                                the first block should be written
-        @param blockSize2       on exit, this indicates how many items can be written to the block starting at startIndex2
-        @see finishedWrite
-    */
-    void prepareToWrite (int numToWrite, int& startIndex1, int& blockSize1, int& startIndex2, int& blockSize2) const noexcept;
-
-    /** Called after writing from the FIFO, to indicate that this many items have been added.
-        @see prepareToWrite
-    */
-    void finishedWrite (int numWritten) noexcept;
-
-    /** Returns the location within the buffer from which the next block of data should be read.
-
-        Because the section of data that you want to read from the buffer may overlap the end
-        and wrap around to the start, two blocks within your buffer are returned, and you
-        should read from both of them.
-
-        If the number of items you ask for is greater than the amount of data available, then
-        blockSize1 + blockSize2 may add up to a lower value than numWanted. If this happens, you
-        may decide to keep waiting and re-trying the method until there's enough data available.
-
-        After calling this method, if you choose to read the data, you must call finishedRead() to
-        tell the FIFO how much data you have consumed.
-
-        e.g.
-        @code
-        void readFromFifo (int* someData, int numItems)
-        {
-            int start1, size1, start2, size2;
-            prepareToRead (numSamples, start1, size1, start2, size2);
-
-            if (size1 > 0)
-                copySomeData (someData, myBuffer + start1, size1);
-
-            if (size2 > 0)
-                copySomeData (someData + size1, myBuffer + start2, size2);
-
-            finishedRead (size1 + size2);
-        }
-        @endcode
-
-        @param numWanted        indicates how many items you'd like to add to the buffer
-        @param startIndex1      on exit, this will contain the start index in your buffer at which your data should be written
-        @param blockSize1       on exit, this indicates how many items can be written to the block starting at startIndex1
-        @param startIndex2      on exit, this will contain the start index in your buffer at which any data that didn't fit into
-                                the first block should be written
-        @param blockSize2       on exit, this indicates how many items can be written to the block starting at startIndex2
-        @see finishedRead
-    */
-    void prepareToRead (int numWanted, int& startIndex1, int& blockSize1, int& startIndex2, int& blockSize2) const noexcept;
-
-    /** Called after reading from the FIFO, to indicate that this many items have now been consumed.
-        @see prepareToRead
-    */
-    void finishedRead (int numRead) noexcept;
-
-private:
-    //==============================================================================
-    int bufferSize;
-    Atomic <int> validStart, validEnd;
-};
-
-#endif
-
--- a/src/beast/modules/beast_core/containers/SharedObjectArray.h
+++ b/src/beast/modules/beast_core/containers/SharedObjectArray.h
@@ -1,856 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_SHAREDOBJECTARRAY_H_INCLUDED
-#define BEAST_SHAREDOBJECTARRAY_H_INCLUDED
-
-//==============================================================================
-/**
-    Holds a list of objects derived from SharedObject.
-
-    A SharedObjectArray holds objects derived from SharedObject,
-    and takes care of incrementing and decrementing their ref counts when they
-    are added and removed from the array.
-
-    To make all the array's methods thread-safe, pass in "CriticalSection" as the templated
-    TypeOfCriticalSectionToUse parameter, instead of the default DummyCriticalSection.
-
-    @see Array, OwnedArray, StringArray
-*/
-template <class ObjectClass, class TypeOfCriticalSectionToUse = DummyCriticalSection>
-class SharedObjectArray
-{
-public:
-    typedef SharedPtr<ObjectClass> ObjectClassPtr;
-
-    //==============================================================================
-    /** Creates an empty array.
-        @see SharedObject, Array, OwnedArray
-    */
-    SharedObjectArray() noexcept
-        : numUsed (0)
-    {
-    }
-
-    /** Creates a copy of another array */
-    SharedObjectArray (const SharedObjectArray& other) noexcept
-    {
-        const ScopedLockType lock (other.getLock());
-        numUsed = other.size();
-        data.setAllocatedSize (numUsed);
-        memcpy (data.elements, other.getRawDataPointer(), numUsed * sizeof (ObjectClass*));
-
-        for (int i = numUsed; --i >= 0;)
-            if (ObjectClass* o = data.elements[i])
-                o->incReferenceCount();
-    }
-
-    /** Creates a copy of another array */
-    template <class OtherObjectClass, class OtherCriticalSection>
-    SharedObjectArray (const SharedObjectArray<OtherObjectClass, OtherCriticalSection>& other) noexcept
-    {
-        const typename SharedObjectArray<OtherObjectClass, OtherCriticalSection>::ScopedLockType lock (other.getLock());
-        numUsed = other.size();
-        data.setAllocatedSize (numUsed);
-        memcpy (data.elements, other.getRawDataPointer(), numUsed * sizeof (ObjectClass*));
-
-        for (int i = numUsed; --i >= 0;)
-            if (ObjectClass* o = data.elements[i])
-                o->incReferenceCount();
-    }
-
-    /** Copies another array into this one.
-        Any existing objects in this array will first be released.
-    */
-    SharedObjectArray& operator= (const SharedObjectArray& other) noexcept
-    {
-        SharedObjectArray otherCopy (other);
-        swapWith (otherCopy);
-        return *this;
-    }
-
-    /** Copies another array into this one.
-        Any existing objects in this array will first be released.
-    */
-    template <class OtherObjectClass>
-    SharedObjectArray<ObjectClass, TypeOfCriticalSectionToUse>& operator= (const SharedObjectArray<OtherObjectClass, TypeOfCriticalSectionToUse>& other) noexcept
-    {
-        SharedObjectArray<ObjectClass, TypeOfCriticalSectionToUse> otherCopy (other);
-        swapWith (otherCopy);
-        return *this;
-    }
-
-    /** Destructor.
-        Any objects in the array will be released, and may be deleted if not referenced from elsewhere.
-    */
-    ~SharedObjectArray()
-    {
-        clear();
-    }
-
-    //==============================================================================
-    /** Removes all objects from the array.
-
-        Any objects in the array that are not referenced from elsewhere will be deleted.
-    */
-    void clear()
-    {
-        const ScopedLockType lock (getLock());
-
-        while (numUsed > 0)
-            if (ObjectClass* o = data.elements [--numUsed])
-                o->decReferenceCount();
-
-        bassert (numUsed == 0);
-        data.setAllocatedSize (0);
-    }
-
-    /** Returns the current number of objects in the array. */
-    inline int size() const noexcept
-    {
-        return numUsed;
-    }
-
-    /** Returns a pointer to the object at this index in the array.
-
-        If the index is out-of-range, this will return a null pointer, (and
-        it could be null anyway, because it's ok for the array to hold null
-        pointers as well as objects).
-
-        @see getUnchecked
-    */
-    inline ObjectClassPtr operator[] (const int index) const noexcept
-    {
-        return getObjectPointer (index);
-    }
-
-    /** Returns a pointer to the object at this index in the array, without checking
-        whether the index is in-range.
-
-        This is a faster and less safe version of operator[] which doesn't check the index passed in, so
-        it can be used when you're sure the index is always going to be legal.
-    */
-    inline ObjectClassPtr getUnchecked (const int index) const noexcept
-    {
-        return getObjectPointerUnchecked (index);
-    }
-
-    /** Returns a raw pointer to the object at this index in the array.
-
-        If the index is out-of-range, this will return a null pointer, (and
-        it could be null anyway, because it's ok for the array to hold null
-        pointers as well as objects).
-
-        @see getUnchecked
-    */
-    inline ObjectClass* getObjectPointer (const int index) const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        return isPositiveAndBelow (index, numUsed) ? data.elements [index]
-                                                   : nullptr;
-    }
-
-    /** Returns a raw pointer to the object at this index in the array, without checking
-        whether the index is in-range.
-    */
-    inline ObjectClass* getObjectPointerUnchecked (const int index) const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        bassert (isPositiveAndBelow (index, numUsed));
-        return data.elements [index];
-    }
-
-    /** Returns a pointer to the first object in the array.
-
-        This will return a null pointer if the array's empty.
-        @see getLast
-    */
-    inline ObjectClassPtr getFirst() const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        return numUsed > 0 ? data.elements [0]
-                           : static_cast <ObjectClass*> (nullptr);
-    }
-
-    /** Returns a pointer to the last object in the array.
-
-        This will return a null pointer if the array's empty.
-        @see getFirst
-    */
-    inline ObjectClassPtr getLast() const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        return numUsed > 0 ? data.elements [numUsed - 1]
-                           : static_cast <ObjectClass*> (nullptr);
-    }
-
-    /** Returns a pointer to the actual array data.
-        This pointer will only be valid until the next time a non-const method
-        is called on the array.
-    */
-    inline ObjectClass** getRawDataPointer() const noexcept
-    {
-        return data.elements;
-    }
-
-    //==============================================================================
-    /** Returns a pointer to the first element in the array.
-        This method is provided for compatibility with standard C++ iteration mechanisms.
-    */
-    inline ObjectClass** begin() const noexcept
-    {
-        return data.elements;
-    }
-
-    /** Returns a pointer to the element which follows the last element in the array.
-        This method is provided for compatibility with standard C++ iteration mechanisms.
-    */
-    inline ObjectClass** end() const noexcept
-    {
-        return data.elements + numUsed;
-    }
-
-    //==============================================================================
-    /** Finds the index of the first occurrence of an object in the array.
-
-        @param objectToLookFor    the object to look for
-        @returns                  the index at which the object was found, or -1 if it's not found
-    */
-    int indexOf (const ObjectClass* const objectToLookFor) const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        ObjectClass** e = data.elements.getData();
-        ObjectClass** const endPointer = e + numUsed;
-
-        while (e != endPointer)
-        {
-            if (objectToLookFor == *e)
-                return static_cast <int> (e - data.elements.getData());
-
-            ++e;
-        }
-
-        return -1;
-    }
-
-    /** Returns true if the array contains a specified object.
-
-        @param objectToLookFor      the object to look for
-        @returns                    true if the object is in the array
-    */
-    bool contains (const ObjectClass* const objectToLookFor) const noexcept
-    {
-        const ScopedLockType lock (getLock());
-        ObjectClass** e = data.elements.getData();
-        ObjectClass** const endPointer = e + numUsed;
-
-        while (e != endPointer)
-        {
-            if (objectToLookFor == *e)
-                return true;
-
-            ++e;
-        }
-
-        return false;
-    }
-
-    /** Appends a new object to the end of the array.
-
-        This will increase the new object's reference count.
-
-        @param newObject       the new object to add to the array
-        @see set, insert, addIfNotAlreadyThere, addSorted, addArray
-    */
-    ObjectClass* add (ObjectClass* const newObject) noexcept
-    {
-        const ScopedLockType lock (getLock());
-        data.ensureAllocatedSize (numUsed + 1);
-        bassert (data.elements != nullptr);
-        data.elements [numUsed++] = newObject;
-
-        if (newObject != nullptr)
-            newObject->incReferenceCount();
-
-        return newObject;
-    }
-
-    /** Inserts a new object into the array at the given index.
-
-        If the index is less than 0 or greater than the size of the array, the
-        element will be added to the end of the array.
-        Otherwise, it will be inserted into the array, moving all the later elements
-        along to make room.
-
-        This will increase the new object's reference count.
-
-        @param indexToInsertAt      the index at which the new element should be inserted
-        @param newObject            the new object to add to the array
-        @see add, addSorted, addIfNotAlreadyThere, set
-    */
-    ObjectClass* insert (int indexToInsertAt,
-                         ObjectClass* const newObject) noexcept
-    {
-        if (indexToInsertAt >= 0)
-        {
-            const ScopedLockType lock (getLock());
-
-            if (indexToInsertAt > numUsed)
-                indexToInsertAt = numUsed;
-
-            data.ensureAllocatedSize (numUsed + 1);
-            bassert (data.elements != nullptr);
-
-            ObjectClass** const e = data.elements + indexToInsertAt;
-            const int numToMove = numUsed - indexToInsertAt;
-
-            if (numToMove > 0)
-                memmove (e + 1, e, sizeof (ObjectClass*) * (size_t) numToMove);
-
-            *e = newObject;
-
-            if (newObject != nullptr)
-                newObject->incReferenceCount();
-
-            ++numUsed;
-
-            return newObject;
-        }
-        else
-        {
-            return add (newObject);
-        }
-    }
-
-    /** Appends a new object at the end of the array as long as the array doesn't
-        already contain it.
-
-        If the array already contains a matching object, nothing will be done.
-
-        @param newObject   the new object to add to the array
-    */
-    void addIfNotAlreadyThere (ObjectClass* const newObject) noexcept
-    {
-        const ScopedLockType lock (getLock());
-        if (! contains (newObject))
-            add (newObject);
-    }
-
-    /** Replaces an object in the array with a different one.
-
-        If the index is less than zero, this method does nothing.
-        If the index is beyond the end of the array, the new object is added to the end of the array.
-
-        The object being added has its reference count increased, and if it's replacing
-        another object, then that one has its reference count decreased, and may be deleted.
-
-        @param indexToChange        the index whose value you want to change
-        @param newObject            the new value to set for this index.
-        @see add, insert, remove
-    */
-    void set (const int indexToChange,
-              ObjectClass* const newObject)
-    {
-        if (indexToChange >= 0)
-        {
-            const ScopedLockType lock (getLock());
-
-            if (newObject != nullptr)
-                newObject->incReferenceCount();
-
-            if (indexToChange < numUsed)
-            {
-                if (ObjectClass* o = data.elements [indexToChange])
-                    o->decReferenceCount();
-
-                data.elements [indexToChange] = newObject;
-            }
-            else
-            {
-                data.ensureAllocatedSize (numUsed + 1);
-                bassert (data.elements != nullptr);
-                data.elements [numUsed++] = newObject;
-            }
-        }
-    }
-
-    /** Adds elements from another array to the end of this array.
-
-        @param arrayToAddFrom       the array from which to copy the elements
-        @param startIndex           the first element of the other array to start copying from
-        @param numElementsToAdd     how many elements to add from the other array. If this
-                                    value is negative or greater than the number of available elements,
-                                    all available elements will be copied.
-        @see add
-    */
-    void addArray (const SharedObjectArray<ObjectClass, TypeOfCriticalSectionToUse>& arrayToAddFrom,
-                   int startIndex = 0,
-                   int numElementsToAdd = -1) noexcept
-    {
-        const ScopedLockType lock1 (arrayToAddFrom.getLock());
-
-        {
-            const ScopedLockType lock2 (getLock());
-
-            if (startIndex < 0)
-            {
-                bassertfalse;
-                startIndex = 0;
-            }
-
-            if (numElementsToAdd < 0 || startIndex + numElementsToAdd > arrayToAddFrom.size())
-                numElementsToAdd = arrayToAddFrom.size() - startIndex;
-
-            if (numElementsToAdd > 0)
-            {
-                data.ensureAllocatedSize (numUsed + numElementsToAdd);
-
-                while (--numElementsToAdd >= 0)
-                    add (arrayToAddFrom.getUnchecked (startIndex++));
-            }
-        }
-    }
-
-    /** Inserts a new object into the array assuming that the array is sorted.
-
-        This will use a comparator to find the position at which the new object
-        should go. If the array isn't sorted, the behaviour of this
-        method will be unpredictable.
-
-        @param comparator   the comparator object to use to compare the elements - see the
-                            sort() method for details about this object's form
-        @param newObject    the new object to insert to the array
-        @returns the index at which the new object was added
-        @see add, sort
-    */
-    template <class ElementComparator>
-    int addSorted (ElementComparator& comparator, ObjectClass* newObject) noexcept
-    {
-        const ScopedLockType lock (getLock());
-        const int index = findInsertIndexInSortedArray (comparator, data.elements.getData(), newObject, 0, numUsed);
-        insert (index, newObject);
-        return index;
-    }
-
-    /** Inserts or replaces an object in the array, assuming it is sorted.
-
-        This is similar to addSorted, but if a matching element already exists, then it will be
-        replaced by the new one, rather than the new one being added as well.
-    */
-    template <class ElementComparator>
-    void addOrReplaceSorted (ElementComparator& comparator,
-                             ObjectClass* newObject) noexcept
-    {
-        const ScopedLockType lock (getLock());
-        const int index = findInsertIndexInSortedArray (comparator, data.elements.getData(), newObject, 0, numUsed);
-
-        if (index > 0 && comparator.compareElements (newObject, data.elements [index - 1]) == 0)
-            set (index - 1, newObject); // replace an existing object that matches
-        else
-            insert (index, newObject);  // no match, so insert the new one
-    }
-
-    /** Finds the index of an object in the array, assuming that the array is sorted.
-
-        This will use a comparator to do a binary-chop to find the index of the given
-        element, if it exists. If the array isn't sorted, the behaviour of this
-        method will be unpredictable.
-
-        @param comparator           the comparator to use to compare the elements - see the sort()
-                                    method for details about the form this object should take
-        @param objectToLookFor      the object to search for
-        @returns                    the index of the element, or -1 if it's not found
-        @see addSorted, sort
-    */
-    template <class ElementComparator>
-    int indexOfSorted (ElementComparator& comparator,
-                       const ObjectClass* const objectToLookFor) const noexcept
-    {
-        (void) comparator;
-        const ScopedLockType lock (getLock());
-        int s = 0, e = numUsed;
-
-        while (s < e)
-        {
-            if (comparator.compareElements (objectToLookFor, data.elements [s]) == 0)
-                return s;
-
-            const int halfway = (s + e) / 2;
-            if (halfway == s)
-                break;
-
-            if (comparator.compareElements (objectToLookFor, data.elements [halfway]) >= 0)
-                s = halfway;
-            else
-                e = halfway;
-        }
-
-        return -1;
-    }
-
-    //==============================================================================
-    /** Removes an object from the array.
-
-        This will remove the object at a given index and move back all the
-        subsequent objects to close the gap.
-
-        If the index passed in is out-of-range, nothing will happen.
-
-        The object that is removed will have its reference count decreased,
-        and may be deleted if not referenced from elsewhere.
-
-        @param indexToRemove    the index of the element to remove
-        @see removeObject, removeRange
-    */
-    void remove (const int indexToRemove)
-    {
-        const ScopedLockType lock (getLock());
-
-        if (isPositiveAndBelow (indexToRemove, numUsed))
-        {
-            ObjectClass** const e = data.elements + indexToRemove;
-
-            if (ObjectClass* o = *e)
-                o->decReferenceCount();
-
-            --numUsed;
-            const int numberToShift = numUsed - indexToRemove;
-
-            if (numberToShift > 0)
-                memmove (e, e + 1, sizeof (ObjectClass*) * (size_t) numberToShift);
-
-            if ((numUsed << 1) < data.numAllocated)
-                minimiseStorageOverheads();
-        }
-    }
-
-    /** Removes and returns an object from the array.
-
-        This will remove the object at a given index and return it, moving back all
-        the subsequent objects to close the gap. If the index passed in is out-of-range,
-        nothing will happen and a null pointer will be returned.
-
-        @param indexToRemove    the index of the element to remove
-        @see remove, removeObject, removeRange
-    */
-    ObjectClassPtr removeAndReturn (const int indexToRemove)
-    {
-        ObjectClassPtr removedItem;
-        const ScopedLockType lock (getLock());
-
-        if (isPositiveAndBelow (indexToRemove, numUsed))
-        {
-            ObjectClass** const e = data.elements + indexToRemove;
-
-            if (ObjectClass* o = *e)
-            {
-                removedItem = o;
-                o->decReferenceCount();
-            }
-
-            --numUsed;
-            const int numberToShift = numUsed - indexToRemove;
-
-            if (numberToShift > 0)
-                memmove (e, e + 1, sizeof (ObjectClass*) * (size_t) numberToShift);
-
-            if ((numUsed << 1) < data.numAllocated)
-                minimiseStorageOverheads();
-        }
-
-        return removedItem;
-    }
-
-    /** Removes the first occurrence of a specified object from the array.
-
-        If the item isn't found, no action is taken. If it is found, it is
-        removed and has its reference count decreased.
-
-        @param objectToRemove   the object to try to remove
-        @see remove, removeRange
-    */
-    void removeObject (ObjectClass* const objectToRemove)
-    {
-        const ScopedLockType lock (getLock());
-        remove (indexOf (objectToRemove));
-    }
-
-    /** Removes a range of objects from the array.
-
-        This will remove a set of objects, starting from the given index,
-        and move any subsequent elements down to close the gap.
-
-        If the range extends beyond the bounds of the array, it will
-        be safely clipped to the size of the array.
-
-        The objects that are removed will have their reference counts decreased,
-        and may be deleted if not referenced from elsewhere.
-
-        @param startIndex       the index of the first object to remove
-        @param numberToRemove   how many objects should be removed
-        @see remove, removeObject
-    */
-    void removeRange (const int startIndex,
-                      const int numberToRemove)
-    {
-        const ScopedLockType lock (getLock());
-
-        const int start    = blimit (0, numUsed, startIndex);
-        const int endIndex = blimit (0, numUsed, startIndex + numberToRemove);
-
-        if (endIndex > start)
-        {
-            int i;
-            for (i = start; i < endIndex; ++i)
-            {
-                if (ObjectClass* o = data.elements[i])
-                {
-                    o->decReferenceCount();
-                    data.elements[i] = nullptr; // (in case one of the destructors accesses this array and hits a dangling pointer)
-                }
-            }
-
-            const int rangeSize = endIndex - start;
-            ObjectClass** e = data.elements + start;
-            i = numUsed - endIndex;
-            numUsed -= rangeSize;
-
-            while (--i >= 0)
-            {
-                *e = e [rangeSize];
-                ++e;
-            }
-
-            if ((numUsed << 1) < data.numAllocated)
-                minimiseStorageOverheads();
-        }
-    }
-
-    /** Removes the last n objects from the array.
-
-        The objects that are removed will have their reference counts decreased,
-        and may be deleted if not referenced from elsewhere.
-
-        @param howManyToRemove   how many objects to remove from the end of the array
-        @see remove, removeObject, removeRange
-    */
-    void removeLast (int howManyToRemove = 1)
-    {
-        const ScopedLockType lock (getLock());
-
-        if (howManyToRemove > numUsed)
-            howManyToRemove = numUsed;
-
-        while (--howManyToRemove >= 0)
-            remove (numUsed - 1);
-    }
-
-    /** Swaps a pair of objects in the array.
-
-        If either of the indexes passed in is out-of-range, nothing will happen,
-        otherwise the two objects at these positions will be exchanged.
-    */
-    void swap (const int index1,
-               const int index2) noexcept
-    {
-        const ScopedLockType lock (getLock());
-
-        if (isPositiveAndBelow (index1, numUsed)
-             && isPositiveAndBelow (index2, numUsed))
-        {
-            std::swap (data.elements [index1],
-                       data.elements [index2]);
-        }
-    }
-
-    /** Moves one of the objects to a different position.
-
-        This will move the object to a specified index, shuffling along
-        any intervening elements as required.
-
-        So for example, if you have the array { 0, 1, 2, 3, 4, 5 } then calling
-        move (2, 4) would result in { 0, 1, 3, 4, 2, 5 }.
-
-        @param currentIndex     the index of the object to be moved. If this isn't a
-                                valid index, then nothing will be done
-        @param newIndex         the index at which you'd like this object to end up. If this
-                                is less than zero, it will be moved to the end of the array
-    */
-    void move (const int currentIndex,
-               int newIndex) noexcept
-    {
-        if (currentIndex != newIndex)
-        {
-            const ScopedLockType lock (getLock());
-
-            if (isPositiveAndBelow (currentIndex, numUsed))
-            {
-                if (! isPositiveAndBelow (newIndex, numUsed))
-                    newIndex = numUsed - 1;
-
-                ObjectClass* const value = data.elements [currentIndex];
-
-                if (newIndex > currentIndex)
-                {
-                    memmove (data.elements + currentIndex,
-                             data.elements + currentIndex + 1,
-                             sizeof (ObjectClass*) * (size_t) (newIndex - currentIndex));
-                }
-                else
-                {
-                    memmove (data.elements + newIndex + 1,
-                             data.elements + newIndex,
-                             sizeof (ObjectClass*) * (size_t) (currentIndex - newIndex));
-                }
-
-                data.elements [newIndex] = value;
-            }
-        }
-    }
-
-    //==============================================================================
-    /** This swaps the contents of this array with those of another array.
-
-        If you need to exchange two arrays, this is vastly quicker than using copy-by-value
-        because it just swaps their internal pointers.
-    */
-    template <class OtherArrayType>
-    void swapWith (OtherArrayType& otherArray) noexcept
-    {
-        const ScopedLockType lock1 (getLock());
-        const typename OtherArrayType::ScopedLockType lock2 (otherArray.getLock());
-
-        data.swapWith (otherArray.data);
-        std::swap (numUsed, otherArray.numUsed);
-    }
-
-    //==============================================================================
-    /** Compares this array to another one.
-
-        @returns true only if the other array contains the same objects in the same order
-    */
-    bool operator== (const SharedObjectArray& other) const noexcept
-    {
-        const ScopedLockType lock2 (other.getLock());
-        const ScopedLockType lock1 (getLock());
-
-        if (numUsed != other.numUsed)
-            return false;
-
-        for (int i = numUsed; --i >= 0;)
-            if (data.elements [i] != other.data.elements [i])
-                return false;
-
-        return true;
-    }
-
-    /** Compares this array to another one.
-
-        @see operator==
-    */
-    bool operator!= (const SharedObjectArray<ObjectClass, TypeOfCriticalSectionToUse>& other) const noexcept
-    {
-        return ! operator== (other);
-    }
-
-    //==============================================================================
-    /** Sorts the elements in the array.
-
-        This will use a comparator object to sort the elements into order. The object
-        passed must have a method of the form:
-        @code
-        int compareElements (ElementType first, ElementType second);
-        @endcode
-
-        ..and this method must return:
-          - a value of < 0 if the first comes before the second
-          - a value of 0 if the two objects are equivalent
-          - a value of > 0 if the second comes before the first
-
-        To improve performance, the compareElements() method can be declared as static or const.
-
-        @param comparator   the comparator to use for comparing elements.
-        @param retainOrderOfEquivalentItems     if this is true, then items
-                            which the comparator says are equivalent will be
-                            kept in the order in which they currently appear
-                            in the array. This is slower to perform, but may
-                            be important in some cases. If it's false, a faster
-                            algorithm is used, but equivalent elements may be
-                            rearranged.
-
-        @see sortArray
-    */
-    template <class ElementComparator>
-    void sort (ElementComparator& comparator,
-               const bool retainOrderOfEquivalentItems = false) const noexcept
-    {
-        (void) comparator;  // if you pass in an object with a static compareElements() method, this
-                            // avoids getting warning messages about the parameter being unused
-
-        const ScopedLockType lock (getLock());
-        sortArray (comparator, data.elements.getData(), 0, size() - 1, retainOrderOfEquivalentItems);
-    }
-
-    //==============================================================================
-    /** Reduces the amount of storage being used by the array.
-
-        Arrays typically allocate slightly more storage than they need, and after
-        removing elements, they may have quite a lot of unused space allocated.
-        This method will reduce the amount of allocated storage to a minimum.
-    */
-    void minimiseStorageOverheads() noexcept
-    {
-        const ScopedLockType lock (getLock());
-        data.shrinkToNoMoreThan (numUsed);
-    }
-
-    /** Increases the array's internal storage to hold a minimum number of elements.
-
-        Calling this before adding a large known number of elements means that
-        the array won't have to keep dynamically resizing itself as the elements
-        are added, and it'll therefore be more efficient.
-    */
-    void ensureStorageAllocated (const int minNumElements)
-    {
-        const ScopedLockType lock (getLock());
-        data.ensureAllocatedSize (minNumElements);
-    }
-
-    //==============================================================================
-    /** Returns the CriticalSection that locks this array.
-        To lock, you can call getLock().enter() and getLock().exit(), or preferably use
-        an object of ScopedLockType as an RAII lock for it.
-    */
-    inline const TypeOfCriticalSectionToUse& getLock() const noexcept      { return data; }
-
-    /** Returns the type of scoped lock to use for locking this array */
-    typedef typename TypeOfCriticalSectionToUse::ScopedLockType ScopedLockType;
-
-private:
-    //==============================================================================
-    ArrayAllocationBase <ObjectClass*, TypeOfCriticalSectionToUse> data;
-    int numUsed;
-};
-
-
-#endif
--- a/src/beast/modules/beast_core/containers/SortedSet.h
+++ b/src/beast/modules/beast_core/containers/SortedSet.h
@@ -1,492 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_SORTEDSET_H_INCLUDED
-#define BEAST_SORTEDSET_H_INCLUDED
-
-#if BEAST_MSVC
-  #pragma warning (push)
-  #pragma warning (disable: 4512)
-#endif
-
-//==============================================================================
-/**
-    Holds a set of unique primitive objects, such as ints or doubles.
-
-    A set can only hold one item with a given value, so if for example it's a
-    set of integers, attempting to add the same integer twice will do nothing
-    the second time.
-
-    Internally, the list of items is kept sorted (which means that whatever
-    kind of primitive type is used must support the ==, <, >, <= and >= operators
-    to determine the order), and searching the set for known values is very fast
-    because it uses a binary-chop method.
-
-    Note that if you're using a class or struct as the element type, it must be
-    capable of being copied or moved with a straightforward memcpy, rather than
-    needing construction and destruction code.
-
-    To make all the set's methods thread-safe, pass in "CriticalSection" as the templated
-    TypeOfCriticalSectionToUse parameter, instead of the default DummyCriticalSection.
-
-    @see Array, OwnedArray, SharedObjectArray, StringArray, CriticalSection
-*/
-template <class ElementType, class TypeOfCriticalSectionToUse = DummyCriticalSection>
-class SortedSet
-{
-public:
-    //==============================================================================
-    /** Creates an empty set. */
-    SortedSet() noexcept
-    {
-    }
-
-    /** Creates a copy of another set.
-        @param other    the set to copy
-    */
-    SortedSet (const SortedSet& other)
-        : data (other.data)
-    {
-    }
-
-    /** Destructor. */
-    ~SortedSet() noexcept
-    {
-    }
-
-    /** Copies another set over this one.
-        @param other    the set to copy
-    */
-    SortedSet& operator= (const SortedSet& other) noexcept
-    {
-        data = other.data;
-        return *this;
-    }
-
-    //==============================================================================
-    /** Compares this set to another one.
-        Two sets are considered equal if they both contain the same set of elements.
-        @param other    the other set to compare with
-    */
-    bool operator== (const SortedSet<ElementType>& other) const noexcept
-    {
-        return data == other.data;
-    }
-
-    /** Compares this set to another one.
-        Two sets are considered equal if they both contain the same set of elements.
-        @param other    the other set to compare with
-    */
-    bool operator!= (const SortedSet<ElementType>& other) const noexcept
-    {
-        return ! operator== (other);
-    }
-
-    //==============================================================================
-    /** Removes all elements from the set.
-
-        This will remove all the elements, and free any storage that the set is
-        using. To clear it without freeing the storage, use the clearQuick()
-        method instead.
-
-        @see clearQuick
-    */
-    void clear() noexcept
-    {
-        data.clear();
-    }
-
-    /** Removes all elements from the set without freeing the array's allocated storage.
-
-        @see clear
-    */
-    void clearQuick() noexcept
-    {
-        data.clearQuick();
-    }
-
-    //==============================================================================
-    /** Returns the current number of elements in the set.
-    */
-    inline int size() const noexcept
-    {
-        return data.size();
-    }
-
-    /** Returns one of the elements in the set.
-
-        If the index passed in is beyond the range of valid elements, this
-        will return zero.
-
-        If you're certain that the index will always be a valid element, you
-        can call getUnchecked() instead, which is faster.
-
-        @param index    the index of the element being requested (0 is the first element in the set)
-        @see getUnchecked, getFirst, getLast
-    */
-    inline ElementType operator[] (const int index) const noexcept
-    {
-        return data [index];
-    }
-
-    /** Returns one of the elements in the set, without checking the index passed in.
-        Unlike the operator[] method, this will try to return an element without
-        checking that the index is within the bounds of the set, so should only
-        be used when you're confident that it will always be a valid index.
-
-        @param index    the index of the element being requested (0 is the first element in the set)
-        @see operator[], getFirst, getLast
-    */
-    inline ElementType getUnchecked (const int index) const noexcept
-    {
-        return data.getUnchecked (index);
-    }
-
-    /** Returns a direct reference to one of the elements in the set, without checking the index passed in.
-
-        This is like getUnchecked, but returns a direct reference to the element, so that
-        you can alter it directly. Obviously this can be dangerous, so only use it when
-        absolutely necessary.
-
-        @param index    the index of the element being requested (0 is the first element in the array)
-    */
-    inline ElementType& getReference (const int index) const noexcept
-    {
-        return data.getReference (index);
-    }
-
-    /** Returns the first element in the set, or 0 if the set is empty.
-
-        @see operator[], getUnchecked, getLast
-    */
-    inline ElementType getFirst() const noexcept
-    {
-        return data.getFirst();
-    }
-
-    /** Returns the last element in the set, or 0 if the set is empty.
-
-        @see operator[], getUnchecked, getFirst
-    */
-    inline ElementType getLast() const noexcept
-    {
-        return data.getLast();
-    }
-
-    //==============================================================================
-    /** Returns a pointer to the first element in the set.
-        This method is provided for compatibility with standard C++ iteration mechanisms.
-    */
-    inline ElementType* begin() const noexcept
-    {
-        return data.begin();
-    }
-
-    /** Returns a pointer to the element which follows the last element in the set.
-        This method is provided for compatibility with standard C++ iteration mechanisms.
-    */
-    inline ElementType* end() const noexcept
-    {
-        return data.end();
-    }
-
-    //==============================================================================
-    /** Finds the index of the first element which matches the value passed in.
-
-        This will search the set for the given object, and return the index
-        of its first occurrence. If the object isn't found, the method will return -1.
-
-        @param elementToLookFor   the value or object to look for
-        @returns                  the index of the object, or -1 if it's not found
-    */
-    int indexOf (const ElementType& elementToLookFor) const noexcept
-    {
-        const ScopedLockType lock (data.getLock());
-
-        int s = 0;
-        int e = data.size();
-
-        for (;;)
-        {
-            if (s >= e)
-                return -1;
-
-            if (elementToLookFor == data.getReference (s))
-                return s;
-
-            const int halfway = (s + e) / 2;
-
-            if (halfway == s)
-                return -1;
-            else if (elementToLookFor < data.getReference (halfway))
-                e = halfway;
-            else
-                s = halfway;
-        }
-    }
-
-    /** Returns true if the set contains at least one occurrence of an object.
-
-        @param elementToLookFor     the value or object to look for
-        @returns                    true if the item is found
-    */
-    bool contains (const ElementType& elementToLookFor) const noexcept
-    {
-        return indexOf (elementToLookFor) >= 0;
-    }
-
-    //==============================================================================
-    /** Adds a new element to the set, (as long as it's not already in there).
-
-        Note that if a matching element already exists, the new value will be assigned
-        to the existing one using operator=, so that if there are any differences between
-        the objects which were not recognised by the object's operator==, then the
-        set will always contain a copy of the most recently added one.
-
-        @param newElement   the new object to add to the set
-        @returns            true if the value was added, or false if it already existed
-        @see set, insert, addIfNotAlreadyThere, addSorted, addSet, addArray
-    */
-    bool add (const ElementType& newElement) noexcept
-    {
-        const ScopedLockType lock (getLock());
-
-        int s = 0;
-        int e = data.size();
-
-        while (s < e)
-        {
-            ElementType& elem = data.getReference (s);
-            if (newElement == elem)
-            {
-                elem = newElement; // force an update in case operator== permits differences.
-                return false;
-            }
-
-            const int halfway = (s + e) / 2;
-            const bool isBeforeHalfway = (newElement < data.getReference (halfway));
-
-            if (halfway == s)
-            {
-                if (! isBeforeHalfway)
-                    ++s;
-
-                break;
-            }
-            else if (isBeforeHalfway)
-                e = halfway;
-            else
-                s = halfway;
-        }
-
-        data.insert (s, newElement);
-        return true;
-    }
-
-    /** Adds elements from an array to this set.
-
-        @param elementsToAdd        the array of elements to add
-        @param numElementsToAdd     how many elements are in this other array
-        @see add
-    */
-    void addArray (const ElementType* elementsToAdd,
-                   int numElementsToAdd) noexcept
-    {
-        const ScopedLockType lock (getLock());
-
-        while (--numElementsToAdd >= 0)
-            add (*elementsToAdd++);
-    }
-
-    /** Adds elements from another set to this one.
-
-        @param setToAddFrom         the set from which to copy the elements
-        @param startIndex           the first element of the other set to start copying from
-        @param numElementsToAdd     how many elements to add from the other set. If this
-                                    value is negative or greater than the number of available elements,
-                                    all available elements will be copied.
-        @see add
-    */
-    template <class OtherSetType>
-    void addSet (const OtherSetType& setToAddFrom,
-                 int startIndex = 0,
-                 int numElementsToAdd = -1) noexcept
-    {
-        const typename OtherSetType::ScopedLockType lock1 (setToAddFrom.getLock());
-
-        {
-            const ScopedLockType lock2 (getLock());
-            bassert (this != &setToAddFrom);
-
-            if (this != &setToAddFrom)
-            {
-                if (startIndex < 0)
-                {
-                    bassertfalse;
-                    startIndex = 0;
-                }
-
-                if (numElementsToAdd < 0 || startIndex + numElementsToAdd > setToAddFrom.size())
-                    numElementsToAdd = setToAddFrom.size() - startIndex;
-
-                if (numElementsToAdd > 0)
-                    addArray (&setToAddFrom.data.getReference (startIndex), numElementsToAdd);
-            }
-        }
-    }
-
-    //==============================================================================
-    /** Removes an element from the set.
-
-        This will remove the element at a given index.
-        If the index passed in is out-of-range, nothing will happen.
-
-        @param indexToRemove    the index of the element to remove
-        @returns                the element that has been removed
-        @see removeValue, removeRange
-    */
-    ElementType remove (const int indexToRemove) noexcept
-    {
-        return data.remove (indexToRemove);
-    }
-
-    /** Removes an item from the set.
-
-        This will remove the given element from the set, if it's there.
-
-        @param valueToRemove   the object to try to remove
-        @see remove, removeRange
-    */
-    void removeValue (const ElementType valueToRemove) noexcept
-    {
-        const ScopedLockType lock (getLock());
-        data.remove (indexOf (valueToRemove));
-    }
-
-    /** Removes any elements which are also in another set.
-
-        @param otherSet   the other set in which to look for elements to remove
-        @see removeValuesNotIn, remove, removeValue, removeRange
-    */
-    template <class OtherSetType>
-    void removeValuesIn (const OtherSetType& otherSet) noexcept
-    {
-        const typename OtherSetType::ScopedLockType lock1 (otherSet.getLock());
-        const ScopedLockType lock2 (getLock());
-
-        if (this == &otherSet)
-        {
-            clear();
-        }
-        else if (otherSet.size() > 0)
-        {
-            for (int i = data.size(); --i >= 0;)
-                if (otherSet.contains (data.getReference (i)))
-                    remove (i);
-        }
-    }
-
-    /** Removes any elements which are not found in another set.
-
-        Only elements which occur in this other set will be retained.
-
-        @param otherSet    the set in which to look for elements NOT to remove
-        @see removeValuesIn, remove, removeValue, removeRange
-    */
-    template <class OtherSetType>
-    void removeValuesNotIn (const OtherSetType& otherSet) noexcept
-    {
-        const typename OtherSetType::ScopedLockType lock1 (otherSet.getLock());
-        const ScopedLockType lock2 (getLock());
-
-        if (this != &otherSet)
-        {
-            if (otherSet.size() <= 0)
-            {
-                clear();
-            }
-            else
-            {
-                for (int i = data.size(); --i >= 0;)
-                    if (! otherSet.contains (data.getReference (i)))
-                        remove (i);
-            }
-        }
-    }
-
-    /** This swaps the contents of this array with those of another array.
-
-        If you need to exchange two arrays, this is vastly quicker than using copy-by-value
-        because it just swaps their internal pointers.
-    */
-    template <class OtherSortedSetType>
-    void swapWith (OtherSortedSetType& otherSet) noexcept
-    {
-        data.swapWith (otherSet.data);
-    }
-
-    //==============================================================================
-    /** Reduces the amount of storage being used by the set.
-
-        Sets typically allocate slightly more storage than they need, and after
-        removing elements, they may have quite a lot of unused space allocated.
-        This method will reduce the amount of allocated storage to a minimum.
-    */
-    void minimiseStorageOverheads() noexcept
-    {
-        data.minimiseStorageOverheads();
-    }
-
-    /** Increases the set's internal storage to hold a minimum number of elements.
-
-        Calling this before adding a large known number of elements means that
-        the set won't have to keep dynamically resizing itself as the elements
-        are added, and it'll therefore be more efficient.
-    */
-    void ensureStorageAllocated (const int minNumElements)
-    {
-        data.ensureStorageAllocated (minNumElements);
-    }
-
-    //==============================================================================
-    /** Returns the CriticalSection that locks this array.
-        To lock, you can call getLock().enter() and getLock().exit(), or preferably use
-        an object of ScopedLockType as an RAII lock for it.
-    */
-    inline const TypeOfCriticalSectionToUse& getLock() const noexcept      { return data.getLock(); }
-
-    /** Returns the type of scoped lock to use for locking this array */
-    typedef typename TypeOfCriticalSectionToUse::ScopedLockType ScopedLockType;
-
-
-private:
-    //==============================================================================
-    Array <ElementType, TypeOfCriticalSectionToUse> data;
-};
-
-#if BEAST_MSVC
-  #pragma warning (pop)
-#endif
-
-#endif
-
--- a/src/beast/modules/beast_core/diagnostic/UnitTest.cpp
+++ b/src/beast/modules/beast_core/diagnostic/UnitTest.cpp
@@ -56,6 +56,7 @@ String const& UnitTest::getPackageName() const noexcept

 Journal UnitTest::journal () const
 {
+    bassert (m_runner != nullptr);
    return m_runner->journal();
 }

@@ -234,29 +235,6 @@ UnitTests::JournalSink::JournalSink (UnitTests& tests)
 {
 }

-bool UnitTests::JournalSink::active (Journal::Severity) const
-{
-    return true;
-}
-
-bool UnitTests::JournalSink::console() const
-{
-    return false;
-}
-
-void UnitTests::JournalSink::console (bool)
-{
-}
-
-Journal::Severity UnitTests::JournalSink::severity() const
-{
-    return Journal::kLowestSeverity;
-}
-
-void UnitTests::JournalSink::severity (Journal::Severity)
-{
-}
-
 void UnitTests::JournalSink::write (Journal::Severity, std::string const& text)
 {
    m_tests.logMessage (text);
--- a/src/beast/modules/beast_core/diagnostic/UnitTest.h
+++ b/src/beast/modules/beast_core/diagnostic/UnitTest.h
@@ -517,11 +517,6 @@ private:
    {
    public:
        explicit JournalSink (UnitTests& tests);
-        bool active (Journal::Severity severity) const;
-        bool console () const;
-        void console (bool);
-        Journal::Severity severity() const;
-        void severity (Journal::Severity severity);
        void write (Journal::Severity severity, std::string const& text);

    private:
--- a/src/beast/modules/beast_core/maths/Expression.cpp
+++ b/src/beast/modules/beast_core/maths/Expression.cpp
--- a/src/beast/modules/beast_core/maths/Expression.h
+++ b/src/beast/modules/beast_core/maths/Expression.h
@@ -1,264 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Portions of this file are from JUCE.
-    Copyright (c) 2013 - Raw Material Software Ltd.
-    Please visit http://www.juce.com
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_EXPRESSION_H_INCLUDED
-#define BEAST_EXPRESSION_H_INCLUDED
-
-//==============================================================================
-/**
-    A class for dynamically evaluating simple numeric expressions.
-
-    This class can parse a simple C-style string expression involving floating point
-    numbers, named symbols and functions. The basic arithmetic operations of +, -, *, /
-    are supported, as well as parentheses, and any alphanumeric identifiers are
-    assumed to be named symbols which will be resolved when the expression is
-    evaluated.
-
-    Expressions which use identifiers and functions require a subclass of
-    Expression::Scope to be supplied when evaluating them, and this object
-    is expected to be able to resolve the symbol names and perform the functions that
-    are used.
-*/
-class BEAST_API Expression
-{
-public:
-    //==============================================================================
-    /** Creates a simple expression with a value of 0. */
-    Expression();
-
-    /** Destructor. */
-    ~Expression();
-
-    /** Creates a simple expression with a specified constant value. */
-    explicit Expression (double constant);
-
-    /** Creates a copy of an expression. */
-    Expression (const Expression& other);
-
-    /** Copies another expression. */
-    Expression& operator= (const Expression& other);
-
-   #if BEAST_COMPILER_SUPPORTS_MOVE_SEMANTICS
-    Expression (Expression&& other) noexcept;
-    Expression& operator= (Expression&& other) noexcept;
-   #endif
-
-    /** Creates an expression by parsing a string.
-        If there's a syntax error in the string, this will throw a ParseError exception.
-        @throws ParseError
-    */
-    explicit Expression (const String& stringToParse);
-
-    /** Returns a string version of the expression. */
-    String toString() const;
-
-    /** Returns an expression which is an addtion operation of two existing expressions. */
-    Expression operator+ (const Expression& other) const;
-    /** Returns an expression which is a subtraction operation of two existing expressions. */
-    Expression operator- (const Expression& other) const;
-    /** Returns an expression which is a multiplication operation of two existing expressions. */
-    Expression operator* (const Expression& other) const;
-    /** Returns an expression which is a division operation of two existing expressions. */
-    Expression operator/ (const Expression& other) const;
-    /** Returns an expression which performs a negation operation on an existing expression. */
-    Expression operator-() const;
-
-    /** Returns an Expression which is an identifier reference. */
-    static Expression symbol (const String& symbol);
-
-    /** Returns an Expression which is a function call. */
-    static Expression function (const String& functionName, const Array<Expression>& parameters);
-
-    /** Returns an Expression which parses a string from a character pointer, and updates the pointer
-        to indicate where it finished.
-
-        The pointer is incremented so that on return, it indicates the character that follows
-        the end of the expression that was parsed.
-
-        If there's a syntax error in the string, this will throw a ParseError exception.
-        @throws ParseError
-    */
-    static Expression parse (String::CharPointerType& stringToParse);
-
-    //==============================================================================
-    /** When evaluating an Expression object, this class is used to resolve symbols and
-        perform functions that the expression uses.
-    */
-    class BEAST_API Scope
-    {
-    public:
-        Scope();
-        virtual ~Scope();
-
-        /** Returns some kind of globally unique ID that identifies this scope. */
-        virtual String getScopeUID() const;
-
-        /** Returns the value of a symbol.
-            If the symbol is unknown, this can throw an Expression::EvaluationError exception.
-            The member value is set to the part of the symbol that followed the dot, if there is
-            one, e.g. for "foo.bar", symbol = "foo" and member = "bar".
-            @throws Expression::EvaluationError
-        */
-        virtual Expression getSymbolValue (const String& symbol) const;
-
-        /** Executes a named function.
-            If the function name is unknown, this can throw an Expression::EvaluationError exception.
-            @throws Expression::EvaluationError
-        */
-        virtual double evaluateFunction (const String& functionName,
-                                         const double* parameters, int numParameters) const;
-
-        /** Used as a callback by the Scope::visitRelativeScope() method.
-            You should never create an instance of this class yourself, it's used by the
-            expression evaluation code.
-        */
-        class Visitor
-        {
-        public:
-            virtual ~Visitor() {}
-            virtual void visit (const Scope&) = 0;
-        };
-
-        /** Creates a Scope object for a named scope, and then calls a visitor
-            to do some kind of processing with this new scope.
-
-            If the name is valid, this method must create a suitable (temporary) Scope
-            object to represent it, and must call the Visitor::visit() method with this
-            new scope.
-        */
-        virtual void visitRelativeScope (const String& scopeName, Visitor& visitor) const;
-    };
-
-    /** Evaluates this expression, without using a Scope.
-        Without a Scope, no symbols can be used, and only basic functions such as sin, cos, tan,
-        min, max are available.
-        To find out about any errors during evaluation, use the other version of this method which
-        takes a String parameter.
-    */
-    double evaluate() const;
-
-    /** Evaluates this expression, providing a scope that should be able to evaluate any symbols
-        or functions that it uses.
-        To find out about any errors during evaluation, use the other version of this method which
-        takes a String parameter.
-    */
-    double evaluate (const Scope& scope) const;
-
-    /** Evaluates this expression, providing a scope that should be able to evaluate any symbols
-        or functions that it uses.
-    */
-    double evaluate (const Scope& scope, String& evaluationError) const;
-
-    /** Attempts to return an expression which is a copy of this one, but with a constant adjusted
-        to make the expression resolve to a target value.
-
-        E.g. if the expression is "x + 10" and x is 5, then asking for a target value of 8 will return
-        the expression "x + 3". Obviously some expressions can't be reversed in this way, in which
-        case they might just be adjusted by adding a constant to the original expression.
-
-        @throws Expression::EvaluationError
-    */
-    Expression adjustedToGiveNewResult (double targetValue, const Scope& scope) const;
-
-    /** Represents a symbol that is used in an Expression. */
-    struct Symbol
-    {
-        Symbol (const String& scopeUID, const String& symbolName);
-        bool operator== (const Symbol&) const noexcept;
-        bool operator!= (const Symbol&) const noexcept;
-
-        String scopeUID;    /**< The unique ID of the Scope that contains this symbol. */
-        String symbolName;  /**< The name of the symbol. */
-    };
-
-    /** Returns a copy of this expression in which all instances of a given symbol have been renamed. */
-    Expression withRenamedSymbol (const Symbol& oldSymbol, const String& newName, const Scope& scope) const;
-
-    /** Returns true if this expression makes use of the specified symbol.
-        If a suitable scope is supplied, the search will dereference and recursively check
-        all symbols, so that it can be determined whether this expression relies on the given
-        symbol at any level in its evaluation. If the scope parameter is null, this just checks
-        whether the expression contains any direct references to the symbol.
-
-        @throws Expression::EvaluationError
-    */
-    bool referencesSymbol (const Symbol& symbol, const Scope& scope) const;
-
-    /** Returns true if this expression contains any symbols. */
-    bool usesAnySymbols() const;
-
-    /** Returns a list of all symbols that may be needed to resolve this expression in the given scope. */
-    void findReferencedSymbols (Array<Symbol>& results, const Scope& scope) const;
-
-    //==============================================================================
-    /** An exception that can be thrown by Expression::parse(). */
-    class ParseError  : public std::exception
-    {
-    public:
-        ParseError (const String& message);
-
-        String description;
-    };
-
-    //==============================================================================
-    /** Expression type.
-        @see Expression::getType()
-    */
-    enum Type
-    {
-        constantType,
-        functionType,
-        operatorType,
-        symbolType
-    };
-
-    /** Returns the type of this expression. */
-    Type getType() const noexcept;
-
-    /** If this expression is a symbol, function or operator, this returns its identifier. */
-    String getSymbolOrFunction() const;
-
-    /** Returns the number of inputs to this expression.
-        @see getInput
-    */
-    int getNumInputs() const;
-
-    /** Retrieves one of the inputs to this expression.
-        @see getNumInputs
-    */
-    Expression getInput (int index) const;
-
-private:
-    //==============================================================================
-    class Term;
-    struct Helpers;
-    friend class Term;
-    friend struct Helpers;
-    friend class ScopedPointer<Term>;
-    friend class SharedPtr<Term>;
-    SharedPtr<Term> term;
-
-    explicit Expression (Term*);
-};
-
-#endif   // BEAST_EXPRESSION_H_INCLUDED
--- a/src/beast/modules/beast_core/maths/Interval.h
+++ b/src/beast/modules/beast_core/maths/Interval.h
@@ -1,387 +0,0 @@
-//------------------------------------------------------------------------------
-/*
-    This file is part of Beast: https://github.com/vinniefalco/Beast
-    Copyright 2013, Vinnie Falco <vinnie.falco@gmail.com>
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose  with  or without fee is hereby granted, provided that the above
-    copyright notice and this permission notice appear in all copies.
-
-    THE  SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-    WITH  REGARD  TO  THIS  SOFTWARE  INCLUDING  ALL  IMPLIED  WARRANTIES  OF
-    MERCHANTABILITY  AND  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-    ANY  SPECIAL ,  DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-    WHATSOEVER  RESULTING  FROM  LOSS  OF USE, DATA OR PROFITS, WHETHER IN AN
-    ACTION  OF  CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-*/
-//==============================================================================
-
-#ifndef BEAST_INTERVAL_H_INCLUDED
-#define BEAST_INTERVAL_H_INCLUDED
-
-/** A half-open interval.
-
-    This represents the half-open interval [begin, end) over the scalar
-    type of template parameter `Ty`. It may also be considered as the
-    specification of a subset of a 1-dimensional Euclidean space.
-
-    @tparam Ty A scalar numerical type.
-*/
-template <class Ty>
-class Interval
-{
-public:
-    typedef Ty value_type;
-
-    /** The empty interval.
-    */
-    static const Interval none;
-
-    /** Create an uninitialized interval.
-    */
-    Interval ()
-    {
-    }
-
-    /** Create an interval with the specified values.
-    */
-    Interval (Ty begin, Ty end)
-        : m_begin (begin)
-        , m_end (end)
-    {
-    }
-
-    /** Create an interval from another interval.
-    */
-    Interval (Interval const& other)
-        : m_begin (other.m_begin)
-        , m_end (other.m_end)
-    {
-    }
-
-    /** Assign from another interval.
-
-        @param other The interval to assign from.
-
-        @return A reference to this interval.
-    */
-    Interval& operator= (const Interval& other)
-    {
-        m_begin = other.m_begin;
-        m_end = other.m_end;
-        return *this;
-    }
-
-    /** Compare an interval for equality.
-
-        Empty intervals are always equal to other empty intervals.
-
-        @param rhs The other interval to compare.
-
-        @return `true` if this interval is equal to the specified interval.
-    */
-    bool operator== (Interval const& rhs) const
-    {
-        return (empty () && rhs.empty ()) ||
-               (m_begin == rhs.m_begin && m_end == rhs.m_end);
-    }
-
-    /** Compare an interval for inequality.
-
-        @param rhs The other interval to compare.
-
-        @return `true` if this interval is not equal to the specified interval.
-    */
-    bool operator!= (Interval const& rhs) const
-    {
-        return !this->operator== (rhs);
-    }
-
-    /** Get the starting value of the interval.
-
-        @return The starting point of the interval.
-    */
-    Ty begin () const
-    {
-        return m_begin;
-    }
-
-    /** Get the ending value of the interval.
-
-        @return The ending point of the interval.
-    */
-    Ty end () const
-    {
-        return m_end;
-    }
-
-    /** Get the Lebesque measure.
-
-        @return The Lebesque measure.
-    */
-    Ty length () const
-    {
-        return empty () ? Ty () : (end () - begin ());
-    }
-
-    //Ty count () const { return length (); } // sugar
-    //Ty distance () const { return length (); } // sugar
-
-    /** Determine if the interval is empty.
-
-        @return `true` if the interval is empty.
-    */
-    bool empty () const
-    {
-        return m_begin >= m_end;
-    }
-
-    /** Determine if the interval is non-empty.
-
-        @return `true` if the interval is not empty.
-    */
-    bool notEmpty () const
-    {
-        return m_begin < m_end;
-    }
-
-    /** Set the starting point of the interval.
-
-        @param v The starting point.
-    */
-    void setBegin (Ty v)
-    {
-        m_begin = v;
-    }
-
-    /** Set the ending point of the interval.
-
-        @param v The ending point.
-    */
-    void setEnd (Ty v)
-    {
-        m_end = v;
-    }
-
-    /** Set the ending point relative to the starting point.
-
-        @param v The length of the resulting interval.
-    */
-    void setLength (Ty v)
-    {
-        m_end = m_begin + v;
-    }
-
-    /** Determine if a value is contained in the interval.
-
-        @param v The value to check.
-
-        @return `true` if this interval contains `v`.
-    */
-    bool contains (Ty v) const
-    {
-        return notEmpty () && v >= m_begin && v < m_end;
-    }
-
-    /** Determine if this interval intersects another interval.
-
-        @param other The other interval.
-
-        @return `true` if the intervals intersect.
-    */
-    template <class To>
-    bool intersects (Interval <To> const& other) const
-    {
-        return notEmpty () && other.notEmpty () &&
-               end () > other.begin () && begin () < other.end ();
-    }
-
-    /** Determine if this interval adjoins another interval.
-
-        An interval is adjoint to another interval if and only if the union of the
-        intervals is a single non-empty half-open subset.
-
-        @param other The other interval.
-
-        @return `true` if the intervals are adjoint.
-    */
-    template <class To>
-    bool adjoins (Interval <To> const& other) const
-    {
-        return (empty () != other.empty ()) ||
-               (notEmpty () && end () >= other.begin ()
-                && begin () <= other.end ());
-    }
-
-    /** Determine if this interval is disjoint from another interval.
-
-        @param other The other interval.
-
-        @return `true` if the intervals are disjoint.
-    */
-    bool disjoint (Interval const& other) const
-    {
-        return !intersects (other);
-    }
-
-    /** Determine if this interval is a superset of another interval.
-
-        An interval A is a superset of interval B if B is empty or if A fully
-        contains B.
-
-        @param other The other interval.
-
-        @return `true` if this is a superset of `other`.
-    */
-    template <class To>
-    bool superset_of (Interval <To> const& other) const
-    {
-        return other.empty () ||
-               (notEmpty () && begin () <= other.begin ()
-                && end () >= other.end ());
-    }
-
-    /** Determine if this interval is a proper superset of another interval.
-
-        An interval A is a proper superset of interval B if A is a superset of
-        B and A is not equal to B.
-
-        @param other The other interval.
-
-        @return `true` if this interval is a proper superset of `other`.
-    */
-    template <class To>
-    bool proper_superset_of (Interval <To> const& other) const
-    {
-        return this->superset_of (other) && this->operator != (other);
-    }
-
-    /** Determine if this interval is a subset of another interval.
-
-        @param other The other interval.
-
-        @return `true` if this interval is a subset of `other`.
-    */
-    template <class To>
-    bool subset_of (Interval <To> const& other) const
-    {
-        return other.superset_of (*this);
-    }
-
-    /** Determine if this interval is a proper subset of another interval.
-
-        @param other The other interval.
-
-        @return `true` if this interval is a proper subset of `other`.
-    */
-    template <class To>
-    bool proper_subset_of (Interval <To> const& other) const
-    {
-        return other.proper_superset_of (*this);
-    }
-
-    /** Return the intersection of this interval with another interval.
-
-        @param other The other interval.
-
-        @return The intersection of the intervals.
-    */
-    template <class To>
-    Interval intersection (Interval <To> const& other) const
-    {
-        return Interval (std::max (begin (), other.begin ()),
-                         std::min (end (), other.end ()));
-    }
-
-    /** Determine the smallest interval that contains both intervals.
-
-        @param other The other interval.
-
-        @return The simple union of the intervals.
-    */
-    template <class To>
-    Interval simple_union (Interval <To> const& other) const
-    {
-        return Interval (
-                   std::min (other.normalized ().begin (), normalized ().begin ()),
-                   std::max (other.normalized ().end (), normalized ().end ()));
-    }
-
-    /** Calculate the single-interval union.
-
-        The result is empty if the union cannot be represented as a
-        single half-open interval.
-
-        @param other The other interval.
-
-        @return The simple union of the intervals.
-    */
-    template <class To>
-    Interval single_union (Interval <To> const& other) const
-    {
-        if (empty ())
-            return other;
-
-        else if (other.empty ())
-            return *this;
-
-        else if (end () < other.begin () || begin () > other.end ())
-            return none;
-
-        else
-            return Interval (std::min (begin (), other.begin ()),
-                             std::max (end (), other.end ()));
-    }
-
-    /** Determine if the interval is correctly ordered.
-
-        @return `true` if the interval is correctly ordered.
-    */
-    bool normal () const
-    {
-        return end () >= begin ();
-    }
-
-    /** Return a normalized interval.
-
-        @return The normalized interval.
-    */
-    Interval normalized () const
-    {
-        if (normal ())
-            return *this;
-        else
-            return Interval (end (), begin ());
-    }
-
-    /** Clamp a value to the interval.
-
-        @param v The value to clamp.
-
-        @return The clamped result.
-    */
-    template <typename Tv>
-    Ty clamp (Tv v) const
-    {
-        // These conditionals are carefully ordered so
-        // that if m_begin == m_end, value is assigned m_begin.
-        if (v > end ())
-            v = end () - (std::numeric_limits <Tv>::is_integer ? 1 :
-                          std::numeric_limits <Tv>::epsilon ());
-
-        if (v < begin ())
-            v = begin ();
-
-        return v;
-    }
-
-private:
-    Ty m_begin;
-    Ty m_end;
-};
-
-template <typename Ty>
-const Interval<Ty> Interval<Ty>::none = Interval<Ty> (Ty (), Ty ());
-
-#endif
--- a/Show More
+++ b/Show More
Author	SHA1	Message	Date
Vinnie Falco	1017adf743	Set version to 0.20.0	2014-01-08 16:15:12 -08:00
Vinnie Falco	34fb12344c	Fix JobQueue	2014-01-08 14:55:10 -08:00
Vinnie Falco	ce3358bdf8	Improve diagnostics for ResourceManager	2014-01-08 11:18:46 -08:00
Vinnie Falco	1159dadfdb	Fix missing jtACCEPT job limit	2014-01-08 11:18:45 -08:00
Vinnie Falco	62516ef07f	Refactor TaggedCache	2014-01-07 21:14:14 -08:00
Vinnie Falco	eecd305efd	Add std::hash <std::pair> specialization	2014-01-07 21:14:13 -08:00
Vinnie Falco	a83fa6b2b2	Fix warning in chrono_io	2014-01-07 21:14:07 -08:00
Vinnie Falco	b2feafa94c	Use abstract_clock and improved tests, in ResourceManager Conflicts: Builds/VisualStudio2012/RippleD.vcxproj.filters	2014-01-07 17:23:26 -08:00
Vinnie Falco	2d234e500d	Add abstract_clock, manual_clock, chrono_io Conflicts: src/beast/Builds/VisualStudio2012/beast.vcxproj.filters	2014-01-07 17:17:26 -08:00
Vinnie Falco	fee0e7b20e	Fix bind in call to addJob	2014-01-07 17:08:01 -08:00
JoelKatz	a0f6429652	Add LedgerHolder class, use in LedgerMaster	2014-01-07 15:57:51 -08:00
JoelKatz	8f8b2ae4a3	Handle offers in quality directory but not in ledger	2014-01-07 15:57:50 -08:00
JoelKatz	9abdd16721	Release the master lock earlier in a few cases	2014-01-07 15:57:50 -08:00
JoelKatz	1e5963aeeb	Move some operations from the I/O queue to the Job queue	2014-01-07 15:57:50 -08:00
JoelKatz	e25a83bb39	Some tiny bugfixes: * Don't let ledger idle interval get too short * Fix CBigNum::setuint256 * Fix SqliteStatement::isError * Remove dead code, fix incorrect comments * Check for NULL earlier in CKey constructors * Prevent expire times from underflowing in TaggedCache	2014-01-07 15:57:49 -08:00
David Schwartz	e3a67b13ff	Reset liquidity before retrying rippleCalc	2014-01-07 15:57:48 -08:00
JoelKatz	750cbb8399	Improvements because items in SHAMaps are immutable: * SHAMapItem::getData is not needed * SHAMapTreeNode::getItem is not needed * SHAMapTreeNode::getData is not needed * No need to copy them when constructing transactions * No need to copy them when computing map deltas * No need to copy them in deepCompare * No need to copy them in SHAMapTreeNode's copy constructor	2014-01-07 15:57:48 -08:00
JoelKatz	045beb5f36	Concurrent SHAMap code Use shared lock for SHAMap itself and concurrent map for nodes	2014-01-07 15:57:47 -08:00
JoelKatz	cd8234acba	Pathfinding bugfix. Missing lock.	2014-01-07 15:57:46 -08:00
JoelKatz	de85a7c2bd	Pathfinding improvements: * Make each path request track whether it needs updating. * Improve new request handling, reverse order for processing requests. * Break to handle new requests immediately. * Make mPathFindThread an integer rather than a bool. Allow two threads. * For old pathfinding, if the ledger is unspecified, use the PathRequest's RippleLineCache. * Log new pathfinding request latencies. * Suspend processing requests if server is backed up.	2014-01-07 15:57:46 -08:00
Vinnie Falco	087301933a	General refactoring, using C++11 * Remove broken RecycledObjectPool * Fix beast::ServiceQueue using List instead of LockFreeStack * Add class semaphore, fixes broken Semaphore * Move crytpo module files to new beast directory * Use c++11 replacements for boost and beast types: - std::atomic instead of beast::Atomic - std::function instead of boost::function, beast::function - std::unique_ptr instead of beast::ScopedPointer - std::shared_ptr instead of boost::shared_ptr * Remove modules: - beast_db - beast_crypto - beast_extras * Remove unnecessary classes: - AbstractFifo - AddConst - AtomicCounter - AtomicFlag - AtomicPointer - AtomicState - CopyConst - Expression - ForwardList - IfCond - Interval - IntrusiveArray - KeyvaDB - PointerToOther - PointerTraits - RemoveConst - RemoveConstVolatile - RemoveReference - RemoveVolatile - SharedObjectArray - SingleThreadedSharedObject - SophiaDB factory - SortedSet - WeakReference - beast::unique_ptr	2014-01-07 15:57:45 -08:00
JoelKatz	52333b8bd4	Fix a compiler warning in Ledger::visitStateItems	2014-01-07 15:48:50 -08:00
JoelKatz	3768b3c3ca	Fix a pathfinding bug	2014-01-07 15:48:50 -08:00
JoelKatz	09b39e107d	Fix subscribing to "real time" transactions.	2014-01-07 15:48:49 -08:00
Vinnie Falco	4b1155bf32	Improved diagnostic for RocksDB error codes Conflicts: Builds/VisualStudio2012/RippleD.vcxproj.filters	2014-01-07 15:46:38 -08:00
Vinnie Falco	3c7fc31c95	Add ripple_common module Conflicts: Builds/VisualStudio2012/RippleD.vcxproj.filters	2014-01-07 15:15:44 -08:00
Nicholas Dudfield	da3881a486	Make websocket-test the first test, and give custom timeouts of 1000ms	2014-01-05 13:40:47 +07:00
Nicholas Dudfield	ff12d9adaa	Run server-test and websocket-test first. Show stderr upon abnormal rippled exit	2014-01-05 13:09:42 +07:00
Vinnie Falco	528cf56f80	Reduce StatsDCollector log verbosity	2014-01-02 19:32:27 -08:00
Vinnie Falco	0ebe3f1f35	Disable NameResolver temporarily	2014-01-02 16:12:55 -08:00
Vinnie Falco	328680b6cd	Fix Resolver contract check	2014-01-02 16:10:49 -08:00
Vinnie Falco	f9dca105a6	Improved async stop for Resolver Conflicts: src/ripple_app/peers/NameResolver.cpp	2014-01-02 15:38:03 -08:00
Vinnie Falco	3664db61e7	Fix static storage duration issue with some Journal logs	2014-01-02 15:21:33 -08:00
Vinnie Falco	49677aa799	Fix RippleBookType and unit tests	2013-12-29 11:33:50 -08:00
NATTSiM	27b771e2ba	Fix clang compile	2013-12-27 17:46:51 -08:00
Vinnie Falco	6527cdfa97	Add RippleAsset types Conflicts: Builds/VisualStudio2012/RippleD.vcxproj.filters	2013-12-27 17:21:11 -08:00
JoelKatz	b2dbe8ef83	Ledger acquire fixes/cleanups/logging * Inbound ledger and SHAMapAddNode cleanup * Log acquire stats * Fix progress logic * Remove ledgers we no longer need to acquire * Stash stale state data in our fetch pack, it can still be useful * Stash in fetch pack if acquire terminated while job was pending * Account for duplicate/invalid nodes in a few cases previously missed * Dispatch each InboundLedger once (not per data) * Trigger only the "best" peer * Don't call tryAdvance on failed acquires	2013-12-27 16:48:03 -08:00
NATTSiM	9bdb0774ad	Make InboundLedgers, LedgerConsensus abstract	2013-12-27 16:48:03 -08:00
Vinnie Falco	8c2ec2cfbe	Add AbstractObject, cyclic_iterator, Journal improvements	2013-12-27 16:47:43 -08:00
Wolfgang Spraul	00f959ab7e	removed boost_random	2013-12-26 14:31:22 -08:00
Vinnie Falco	f9c4070ad3	Add FetchPack unit test	2013-12-22 12:57:44 -08:00
Vinnie Falco	074325a7ea	Inject SHAMap missing node handler dependency	2013-12-22 12:38:07 -08:00
JoelKatz	2f521a6a91	Build fetch packs correctly.	2013-12-22 12:38:07 -08:00
sublimator	07959b3cc9	Allow to full network limit in Amount::isLegalNet	2013-12-20 15:44:03 -08:00
The Doctor	21faf8eaeb	Improvements to initscript and default configuration. * Added absolute paths to the [node_db] and [debug_logfile] stanzas in the config file. * Changed some tabs into spaces for consistency. * Added directory tree sanity checking to initscript. Signed-off-by: The Doctor <drwho@virtadpt.net>	2013-12-20 15:38:30 -08:00
Nik Bougalis	3e2b5dcc3d	Hostname resolution support for Peers	2013-12-19 14:50:03 -08:00
Nik Bougalis	88a8433d31	Add reference counting to AsyncObject	2013-12-19 14:39:26 -08:00
Vinnie Falco	81d418007a	Add CollectorManager for Beast.Insight support	2013-12-16 18:08:11 -08:00
Vinnie Falco	f88fcf55a3	Add Beast.Insight stats collection module	2013-12-16 12:22:25 -08:00
Vinnie Falco	561c8dea08	Add stl module for c++11 compatibility classes	2013-12-16 11:35:21 -08:00
David Schwartz	de92ac9e0b	Websocket improvements: * Log on_close/on_fail/on_open calls. * Ping out connections. * Improve ping logic. * On websocket ping out, close abnormally. * Avoid deadlock when shutting down websocket endpoint	2013-12-16 09:40:15 -08:00
JoelKatz	deead04a6a	getFetchPack fixes, spread fetch pack requests.	2013-12-15 07:20:24 -08:00
JoelKatz	d4771a9b36	Fix missing call to setPubLedger on gap in published ledger stream.	2013-12-13 11:14:34 -08:00
JoelKatz	27b8415d0c	During old pathfinding, unlock earlier.	2013-12-12 21:17:25 -08:00
David Schwartz	e1e81e5d97	Call pendSaveValidated without holding the ledger master lock	2013-12-12 21:17:20 -08:00
Vinnie Falco	3705680d68	Disable RocksDB for older compilers	2013-12-10 11:23:06 -08:00
Vinnie Falco	a01f546ae3	Use ScopedPointer instead of deprecated auto_ptr	2013-12-10 14:14:15 -05:00
Bryce Lynch	eabc905bac	Add Debian-style initscript * Add validators and validation_quorum from the v0.16 release notes. * We keep having to tell people to do this during integration, let's just make it the default. * Add comment about the log file location that states that it has to be absolute rather than relative after an integration troubleshoot earlier today. Signed-off-by: Bryce Lynch <bryce@ripple.com>	2013-12-09 16:21:22 -08:00
JoelKatz	37588b6808	Avoid an extraneous test.	2013-12-09 00:52:40 -08:00
JoelKatz	071db75f04	Add a 1 MB payload limit to incoming websocket requests	2013-12-09 00:52:40 -08:00
David Schwartz	1e00940a90	Move some ledger cleaner helper functions into the ledger master.	2013-12-08 23:53:57 -08:00
JoelKatz	b984566480	Suppress a warning.	2013-12-08 23:53:47 -08:00
JoelKatz	51aef120a1	Pathfinding performance improvements: * Use a single RippleLineCache, even for 'fast' requests * Use a ledger copy to avoid stalling other code	2013-12-08 23:52:54 -08:00
JoelKatz	636d722e8d	Memory-conserving changes to SHAMapTreeNode and visitLeavesInternal.	2013-12-08 23:52:54 -08:00
Vinnie Falco	e6da61120a	Make AbstractObject unit test manual	2013-12-06 09:57:03 -08:00
JoelKatz	b901e0dcf3	Fix load stats in get_info	2013-12-05 22:04:42 -08:00
Vinnie Falco	177b3c93c4	Move DecayingSample to algorithm	2013-12-05 18:35:37 -08:00
JoelKatz	9996e4a57e	The new recommended fee schedule is: * Transaction fee: 10 drops * Base reserve: 20 XRP * Incremental reserve: 5 XRP	2013-12-04 19:07:58 -08:00
JoelKatz	4751b6a65c	Fix for issue 211, fixes to NetworkOPs getTxsAccountB	2013-12-04 17:09:22 -08:00
David Schwartz	b3c79f5c2f	Change visitLeaves to visit a snapshot so the ledger stays unlocked	2013-12-04 11:10:27 -08:00
David Schwartz	0e53105ab5	Remove dead code and fix a race condition in the node back end. Race was between a store and a fetch, as follows: 1) Fetch: Search for the node, it is not found. 2) Store: Add the node to the database, remove the node from the negative cache. 3) Fetch: Add the node to the negative cache. This would leave a node in the DB, cache, and negative cache.	2013-12-04 11:10:22 -08:00
Vinnie Falco	0f2a657196	Add double conversion for PropertyStream map items	2013-11-30 17:56:25 -08:00
Vinnie Falco	89aa2c7a6a	Refactor some Journal::Sink members	2013-11-30 17:32:50 -08:00
Vinnie Falco	4c843b6c66	IPAddress fixes and algorithm comparison functors	2013-11-30 09:21:46 -08:00
Vinnie Falco	130c7c5c58	Refactor and fix some object arithmetic comparisons	2013-11-30 06:28:29 -08:00
Vinnie Falco	76c364ec2d	Add const now()	2013-11-30 01:42:38 -08:00
Vinnie Falco	a549c94a15	Fix missing assert in UnitTest runner	2013-11-30 01:42:37 -08:00
Vinnie Falco	6de8a6907f	Add AbstractObject	2013-11-30 01:42:37 -08:00
Vinnie Falco	fc31562052	Tidy doc comments	2013-11-29 23:44:36 -08:00
Vinnie Falco	cdaa65c07a	Remove LightningDB database and backend	2013-11-27 15:14:21 -08:00
Vinnie Falco	8a278cf9d6	Remove sophia database and backend	2013-11-27 15:09:26 -08:00