Beginning feature changes for Core 2.0

 * Removed a BUNCH of garbage and unnecessary declarations
 * Removed biicode (RIP)
 * Rewrote meta component (IT MAKES MORE SENSE NOW)
 * Added propagate_const
 * Added memory_resource (well, parts of it)
 * Fixed several build script issues

CMakeLists.txt

@@ -8,6 +8,8 @@ include(CMakePackageConfigHelpers)
 include(CMakeDependentOption)
 include(CTest)
 
+set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
+
 set(INCLUDE_INSTALL_DIR "include" CACHE INTERNAL "Header Files")
 set(CMAKE_INSTALL_DIR "share/cmake/core" CACHE INTERNAL "CMake Files")
 set(DOCS_INSTALL_DIR "share/doc/mnmlstc/core" CACHE INTERNAL "Documentation")
@@ -37,6 +39,7 @@ cmake_dependent_option(BUILD_PACKAGE_MSI "Create an MSI" ON "${MSI_DEP}" OFF)
 cmake_dependent_option(BUILD_PACKAGE_RPM "Create an RPM" ON "${RPM_DEP}" OFF)
 cmake_dependent_option(BUILD_PACKAGE_PKG "Create a PKG" ON "${PKG_DEP}" OFF)
 cmake_dependent_option(BUILD_WITH_LIBCXX "Use libc++" OFF "BUILD_TESTING" OFF)
+cmake_dependent_option(BUILD_WITH_COVERAGE "Use GCov" OFF "BUILD_TESTING" OFF)
 
 if (BIICODE)
   add_biicode_targets()

docs/algorithm.rst

@@ -1,6 +1,8 @@
 Algorithm Component
 ===================
 
+.. index:: algorithm
+
 The algorithm component can be seen as a competitor to the Boost.Range
 algorithm headers. There are a few small differences (namely that this
 component relies on the :doc:`range`), however these differences are discussed
@@ -38,6 +40,8 @@ breaking the current ABI.
 
 .. _core-algorithm-component-non-modifying-sequence-operations:
 
+.. index:: algorithm; non-range
+
 Non-Range Based Operations
 --------------------------
 
@@ -97,6 +101,8 @@ Non-Range Based Operations
    The default :samp:`{Compare}` and :samp:`{Difference}` functions are
    :cxx:`operator <` and :cxx:`operator -` respectively
 
+.. index:: algorithm; non-modifying
+
 Non-Modifying Sequence Operations
 ---------------------------------
 
@@ -190,7 +196,7 @@ Non-Modifying Sequence Operations
       int count = 3;
       auto function = [&] (int v) { count -= v; };
       auto predicate = [&] (int) { return count; };
-      for_each(numbers, function, predicate);
+      for_each_while(numbers, function, predicate);
 
 .. function:: InputIt for_each_until (      \
                 Range&& r,                  \
@@ -366,6 +372,8 @@ Non-Modifying Sequence Operations
 
 .. _core-alglorithm-component-modifying-sequence-operations:
 
+.. index:: algorithm; modifying
+
 Modifying Sequence Operations
 -----------------------------
 
@@ -606,6 +614,8 @@ Modifying Sequence Operations
 
 .. _core-algorithm-component-partitioning-operations:
 
+.. index:: algorithm; partitioning
+
 Partitioning Operations
 -----------------------
 
@@ -659,6 +669,8 @@ Partitioning Operations
 
 .. _core-algorithm-component-sorting-operations:
 
+.. index:: algorithm; sorting
+
 Sorting Operations
 ------------------
 
@@ -741,6 +753,8 @@ Sorting Operations
 
 .. _core-algorithm-component-binary-search-operations:
 
+.. index:: algorithm; binary search
+
 Binary Search Operations
 ------------------------
 
@@ -798,6 +812,8 @@ Binary Search Operations
 
 .. _core-algorithm-component-set-operations:
 
+.. index:: algorithm; set
+
 Set Operations
 --------------
 
@@ -940,6 +956,8 @@ Set Operations
 
 .. _core-algorithm-component-heap-operations:
 
+.. index:: algorithm; heap
+
 Heap Operations
 ---------------
 
@@ -996,6 +1014,8 @@ Heap Operations
 
 .. _core-algorithm-component-min-max-operations:
 
+.. index:: algorithm; min/max
+
 Min/Max Operations
 ------------------
 

docs/any.rst

@@ -17,7 +17,6 @@ This component is unavailable if :c:macro:`CORE_NO_RTTI` is defined.
    single: any; bad_any_cast
    single: exceptions; bad_any_cast
 
-
 .. class:: bad_any_cast
 
    :inherits: std::bad_cast
@@ -42,15 +41,6 @@ This component is unavailable if :c:macro:`CORE_NO_RTTI` is defined.
                  any (any&&) noexcept
                  any () noexcept
 
-      .. versionadded:: 1.2
-
-         The behavior regarding the move constructor has changed to follow
-         the specification. It will now construct a value of the same type
-         as contained in the incoming :any:`any` and use the move constructor
-         of the type. If the incoming :any:`any` is empty, the newly
-         constructed :any:`any` will be as well. Before 1.2, the move
-         constructor would simply result in a state change.
-
       The default set of constructors work as one might imagine. The copy
       constructor is not marked as noexcept as the underlying type *may*
       throw an exception, and due to the type erasure performed, the :any:`any`
@@ -77,10 +67,6 @@ This component is unavailable if :c:macro:`CORE_NO_RTTI` is defined.
       Assigns *value* to :cxx:`*this`. If :cxx:`*this` already manages a
       contained object, it will be destroyed after *value* is assigned.
 
-      .. versionadded:: 1.1
-
-         This function was unfortunately omitted from the 1.0 release.
-
    .. function:: void swap (any&) noexcept
 
       Performs a simple state change with the incoming :any:`any`.

docs/conf.py

@@ -5,8 +5,8 @@
 project = 'MNMLSTC Core'
 copyright = 'MNMLSTC'
 
-version = '1.2'
-release = '1.2'
+version = '2.0'
+release = '2.0'
 
 needs_sphinx = '1.3'