couchbase 3.0.3-universal-darwin-20

data/ext/third_party/json/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-2020 Dr. Colin Hirsch and Daniel Frey
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 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.

data/ext/third_party/json/LICENSE.double-conversion

@@ -0,0 +1,32 @@
+The header include/tao/json/external/double.hpp contains
+modified portions of the double-conversion library from
+  https://www.github.com/google/double-conversion
+which is licensed as follows:
+
+
+Copyright 2006-2011, the V8 project authors. All rights reserved.
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials provided
+      with the distribution.
+    * Neither the name of Google Inc. nor the names of its
+      contributors may be used to endorse or promote products derived
+      from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/ext/third_party/json/LICENSE.itoa

@@ -0,0 +1,19 @@
+Copyright (c) 2017 James Edward Anhalt III - https://github.com/jeaiii/itoa
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 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.

data/ext/third_party/json/LICENSE.ryu

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/ext/third_party/json/include/tao/json.hpp

@@ -0,0 +1,45 @@
+// Copyright (c) 2015-2020 Dr. Colin Hirsch and Daniel Frey
+// Please see LICENSE for license or visit https://github.com/taocpp/json/
+
+#ifndef TAO_JSON_HPP
+#define TAO_JSON_HPP
+
+// Value Class
+#include "json/value.hpp"
+
+// Value Reading
+#include "json/from_file.hpp"
+#include "json/from_input.hpp"
+#include "json/from_stream.hpp"
+#include "json/from_string.hpp"
+#include "json/parts_parser.hpp"
+
+// Value Writing
+#include "json/stream.hpp"  // operator<<
+#include "json/to_stream.hpp"
+#include "json/to_string.hpp"
+
+// Value Support
+#include "json/operators.hpp"
+#include "json/self_contained.hpp"
+
+// Custom Types
+#include "json/binding.hpp"
+#include "json/consume.hpp"
+#include "json/consume_file.hpp"
+#include "json/consume_string.hpp"
+#include "json/produce.hpp"
+
+// Binary Literals
+#include "json/binary.hpp"
+
+// Other Formats
+#include "json/cbor.hpp"
+#include "json/jaxn.hpp"
+#include "json/msgpack.hpp"
+#include "json/ubjson.hpp"
+
+// Events Implementations
+#include "json/events.hpp"
+
+#endif

data/ext/third_party/json/include/tao/json/basic_value.hpp

@@ -0,0 +1,942 @@
+// Copyright (c) 2017-2020 Dr. Colin Hirsch and Daniel Frey
+// Please see LICENSE for license or visit https://github.com/taocpp/json/
+
+#ifndef TAO_JSON_BASIC_VALUE_HPP
+#define TAO_JSON_BASIC_VALUE_HPP
+
+#include <cassert>
+#include <cstddef>
+#include <cstdint>
+#include <map>
+#include <memory>
+#include <optional>
+#include <stdexcept>
+#include <string>
+#include <string_view>
+#include <type_traits>
+#include <utility>
+#include <variant>
+#include <vector>
+
+#include "events/virtual_base.hpp"
+
+#include "internal/escape.hpp"
+#include "internal/format.hpp"
+#include "internal/identity.hpp"
+#include "internal/pair.hpp"
+#include "internal/single.hpp"
+#include "internal/type_traits.hpp"
+
+#include "binary.hpp"
+#include "binary_view.hpp"
+#include "forward.hpp"
+#include "message_extension.hpp"
+#include "pointer.hpp"
+#include "type.hpp"
+
+namespace tao::json
+{
+   template< template< typename... > class Traits >
+   class basic_value  // NOLINT(cppcoreguidelines-special-member-functions)
+      : public Traits< void >::template public_base< basic_value< Traits > >
+   {
+   public:
+      using public_base_t = typename Traits< void >::template public_base< basic_value< Traits > >;
+
+      static_assert( std::is_nothrow_destructible_v< public_base_t > );
+
+      using array_t = std::vector< basic_value >;
+      using object_t = std::map< std::string, basic_value, std::less<> >;
+
+   private:
+      using variant_t = std::variant< uninitialized_t,
+                                      null_t,
+                                      bool,
+                                      std::int64_t,
+                                      std::uint64_t,
+                                      double,
+                                      std::string,
+                                      std::string_view,
+                                      tao::binary,
+                                      tao::binary_view,
+                                      array_t,
+                                      object_t,
+                                      const basic_value*,
+                                      internal::opaque_ptr_t >;
+
+      static_assert( std::is_nothrow_destructible_v< variant_t > );
+
+      variant_t m_variant;
+
+   public:
+      basic_value() = default;
+
+      basic_value( const basic_value& r ) = default;
+      basic_value( basic_value&& r ) = default;  // NOLINT(performance-noexcept-move-constructor)
+
+#if( __cplusplus > 201703L )
+
+      template< typename T,
+                typename D = std::decay_t< T >,
+                typename = decltype( Traits< D >::assign( std::declval< basic_value& >(), std::declval< T&& >() ) ) >
+      explicit( !internal::enable_implicit_constructor< Traits, D > ) basic_value( T&& v, public_base_t b = public_base_t() ) noexcept( noexcept( Traits< D >::assign( std::declval< basic_value& >(), std::forward< T >( v ) ) ) && std::is_nothrow_move_assignable_v< public_base_t > )
+         : public_base_t( std::move( b ) )
+      {
+         Traits< D >::assign( *this, std::forward< T >( v ) );
+      }
+
+#else
+
+      template< typename T,
+                typename D = std::decay_t< T >,
+                typename = std::enable_if_t< internal::enable_implicit_constructor< Traits, D > >,
+                typename = decltype( Traits< D >::assign( std::declval< basic_value& >(), std::declval< T&& >() ) ) >
+      basic_value( T&& v, public_base_t b = public_base_t() ) noexcept( noexcept( Traits< D >::assign( std::declval< basic_value& >(), std::forward< T >( v ) ) ) && std::is_nothrow_move_assignable_v< public_base_t > )
+         : public_base_t( std::move( b ) )
+      {
+         Traits< D >::assign( *this, std::forward< T >( v ) );
+      }
+
+      template< typename T,
+                typename D = std::decay_t< T >,
+                typename = std::enable_if_t< !internal::enable_implicit_constructor< Traits, D > >,
+                typename = decltype( Traits< D >::assign( std::declval< basic_value& >(), std::declval< T&& >() ) ),
+                int = 0 >
+      explicit basic_value( T&& v, public_base_t b = public_base_t() ) noexcept( noexcept( Traits< D >::assign( std::declval< basic_value& >(), std::forward< T >( v ) ) ) && std::is_nothrow_move_assignable_v< public_base_t > )
+         : public_base_t( std::move( b ) )
+      {
+         Traits< D >::assign( *this, std::forward< T >( v ) );
+      }
+
+#endif
+
+      basic_value( std::initializer_list< internal::pair< Traits > >&& l, public_base_t b = public_base_t() )
+         : public_base_t( std::move( b ) )
+      {
+         assign( std::move( l ) );
+      }
+
+      basic_value( const std::initializer_list< internal::pair< Traits > >& l, public_base_t b = public_base_t() )
+         : public_base_t( std::move( b ) )
+      {
+         assign( l );
+      }
+
+      basic_value( std::initializer_list< internal::pair< Traits > >& l, public_base_t b = public_base_t() )
+         : basic_value( static_cast< const std::initializer_list< internal::pair< Traits > >& >( l ), std::move( b ) )
+      {}
+
+      ~basic_value() = default;
+
+      [[nodiscard]] static basic_value array( std::initializer_list< internal::single< Traits > >&& l, public_base_t b = public_base_t() )
+      {
+         basic_value v( uninitialized, std::move( b ) );
+         v.append( std::move( l ) );
+         return v;
+      }
+
+      [[nodiscard]] static basic_value array( const std::initializer_list< internal::single< Traits > >& l, public_base_t b = public_base_t() )
+      {
+         basic_value v( uninitialized, std::move( b ) );
+         v.append( l );
+         return v;
+      }
+
+      [[nodiscard]] static basic_value object( std::initializer_list< internal::pair< Traits > >&& l, public_base_t b = public_base_t() )
+      {
+         basic_value v( uninitialized, std::move( b ) );
+         v.insert( std::move( l ) );
+         return v;
+      }
+
+      [[nodiscard]] static basic_value object( const std::initializer_list< internal::pair< Traits > >& l, public_base_t b = public_base_t() )
+      {
+         basic_value v( uninitialized, std::move( b ) );
+         v.insert( l );
+         return v;
+      }
+
+      basic_value& operator=( basic_value v ) noexcept( std::is_nothrow_move_assignable_v< variant_t >&& std::is_nothrow_move_assignable_v< public_base_t > )
+      {
+         m_variant = std::move( v.m_variant );
+         public_base_t::operator=( static_cast< public_base_t&& >( v ) );
+         return *this;
+      }
+
+      [[nodiscard]] public_base_t& public_base() noexcept
+      {
+         return static_cast< public_base_t& >( *this );
+      }
+
+      [[nodiscard]] const public_base_t& public_base() const noexcept
+      {
+         return static_cast< const public_base_t& >( *this );
+      }
+
+      [[nodiscard]] json::type type() const noexcept
+      {
+         return static_cast< json::type >( m_variant.index() );
+      }
+
+      [[nodiscard]] explicit operator bool() const noexcept
+      {
+         return !is_uninitialized();
+      }
+
+      [[nodiscard]] bool is_uninitialized() const noexcept
+      {
+         return std::holds_alternative< uninitialized_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_null() const noexcept
+      {
+         return std::holds_alternative< null_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_boolean() const noexcept
+      {
+         return std::holds_alternative< bool >( m_variant );
+      }
+
+      [[nodiscard]] bool is_signed() const noexcept
+      {
+         return std::holds_alternative< std::int64_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_unsigned() const noexcept
+      {
+         return std::holds_alternative< std::uint64_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_integer() const noexcept
+      {
+         return is_signed() || is_unsigned();
+      }
+
+      [[nodiscard]] bool is_double() const noexcept
+      {
+         return std::holds_alternative< double >( m_variant );
+      }
+
+      [[nodiscard]] bool is_number() const noexcept
+      {
+         return is_integer() || is_double();
+      }
+
+      [[nodiscard]] bool is_string() const noexcept
+      {
+         return std::holds_alternative< std::string >( m_variant );
+      }
+
+      [[nodiscard]] bool is_string_view() const noexcept
+      {
+         return std::holds_alternative< std::string_view >( m_variant );
+      }
+
+      [[nodiscard]] bool is_string_type() const noexcept
+      {
+         return is_string() || is_string_view();
+      }
+
+      [[nodiscard]] bool is_binary() const noexcept
+      {
+         return std::holds_alternative< binary >( m_variant );
+      }
+
+      [[nodiscard]] bool is_binary_view() const noexcept
+      {
+         return std::holds_alternative< tao::binary_view >( m_variant );
+      }
+
+      [[nodiscard]] bool is_binary_type() const noexcept
+      {
+         return is_binary() || is_binary_view();
+      }
+
+      [[nodiscard]] bool is_array() const noexcept
+      {
+         return std::holds_alternative< array_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_object() const noexcept
+      {
+         return std::holds_alternative< object_t >( m_variant );
+      }
+
+      [[nodiscard]] bool is_value_ptr() const noexcept
+      {
+         return std::holds_alternative< const basic_value* >( m_variant );
+      }
+
+      [[nodiscard]] bool is_opaque_ptr() const noexcept
+      {
+         return std::holds_alternative< internal::opaque_ptr_t >( m_variant );
+      }
+
+      [[nodiscard]] bool get_boolean() const
+      {
+         return std::get< bool >( m_variant );
+      }
+
+      [[nodiscard]] std::int64_t get_signed() const
+      {
+         return std::get< std::int64_t >( m_variant );
+      }
+
+      [[nodiscard]] std::uint64_t get_unsigned() const
+      {
+         return std::get< std::uint64_t >( m_variant );
+      }
+
+      [[nodiscard]] double get_double() const
+      {
+         return std::get< double >( m_variant );
+      }
+
+      [[nodiscard]] std::string& get_string()
+      {
+         return std::get< std::string >( m_variant );
+      }
+
+      [[nodiscard]] const std::string& get_string() const
+      {
+         return std::get< std::string >( m_variant );
+      }
+
+      [[nodiscard]] std::string_view get_string_view() const
+      {
+         return std::get< std::string_view >( m_variant );
+      }
+
+      [[nodiscard]] std::string_view get_string_type() const
+      {
+         return is_string() ? get_string() : get_string_view();
+      }
+
+      [[nodiscard]] binary& get_binary()
+      {
+         return std::get< binary >( m_variant );
+      }
+
+      [[nodiscard]] const binary& get_binary() const
+      {
+         return std::get< binary >( m_variant );
+      }
+
+      [[nodiscard]] tao::binary_view get_binary_view() const
+      {
+         return std::get< tao::binary_view >( m_variant );
+      }
+
+      [[nodiscard]] tao::binary_view get_binary_type() const
+      {
+         return is_binary() ? get_binary() : get_binary_view();
+      }
+
+      [[nodiscard]] array_t& get_array()
+      {
+         return std::get< array_t >( m_variant );
+      }
+
+      [[nodiscard]] const array_t& get_array() const
+      {
+         return std::get< array_t >( m_variant );
+      }
+
+      [[nodiscard]] object_t& get_object()
+      {
+         return std::get< object_t >( m_variant );
+      }
+
+      [[nodiscard]] const object_t& get_object() const
+      {
+         return std::get< object_t >( m_variant );
+      }
+
+      [[nodiscard]] const basic_value* get_value_ptr() const
+      {
+         return std::get< const basic_value* >( m_variant );
+      }
+
+      [[nodiscard]] internal::opaque_ptr_t get_opaque_ptr() const
+      {
+         return std::get< internal::opaque_ptr_t >( m_variant );
+      }
+
+   private:
+      void throw_duplicate_key_exception( const std::string_view k ) const
+      {
+         throw std::runtime_error( internal::format( "duplicate JSON object key \"", internal::escape( k ), '"', json::message_extension( *this ) ) );
+      }
+
+      void throw_index_out_of_bound_exception( const std::size_t i ) const
+      {
+         throw std::out_of_range( internal::format( "JSON array index '", i, "' out of bound '", get_array().size(), '\'', json::message_extension( *this ) ) );
+      }
+
+      void throw_key_not_found_exception( const std::string_view k ) const
+      {
+         throw std::out_of_range( internal::format( "JSON object key \"", internal::escape( k ), "\" not found", json::message_extension( *this ) ) );
+      }
+
+   public:
+      void set_uninitialized() noexcept
+      {
+         m_variant = uninitialized;
+      }
+
+      void set_null() noexcept
+      {
+         m_variant = null;
+      }
+
+      void set_boolean( const bool b ) noexcept
+      {
+         m_variant = b;
+      }
+
+      void set_signed( const std::int64_t i ) noexcept
+      {
+         m_variant = i;
+      }
+
+      void set_unsigned( const std::uint64_t u ) noexcept
+      {
+         m_variant = u;
+      }
+
+      void set_double( const double d ) noexcept
+      {
+         m_variant = d;
+      }
+
+      template< typename... Ts >
+      std::string& emplace_string( Ts&&... ts ) noexcept( noexcept( std::string( std::forward< Ts >( ts )... ) ) )
+      {
+         return m_variant.template emplace< std::string >( std::forward< Ts >( ts )... );
+      }
+
+      void set_string( const std::string& s )
+      {
+         m_variant = s;
+      }
+
+      void set_string( std::string&& s ) noexcept
+      {
+         m_variant = std::move( s );
+      }
+
+      void set_string_view( const std::string_view sv ) noexcept
+      {
+         m_variant = sv;
+      }
+
+      template< typename... Ts >
+      binary& emplace_binary( Ts&&... ts ) noexcept( noexcept( binary( std::forward< Ts >( ts )... ) ) )
+      {
+         return m_variant.template emplace< binary >( std::forward< Ts >( ts )... );
+      }
+
+      void set_binary( const binary& x )
+      {
+         m_variant = x;
+      }
+
+      void set_binary( binary&& x ) noexcept
+      {
+         m_variant = std::move( x );
+      }
+
+      void set_binary_view( const tao::binary_view xv ) noexcept
+      {
+         m_variant = xv;
+      }
+
+      template< typename... Ts >
+      array_t& emplace_array( Ts&&... ts ) noexcept( noexcept( array_t( std::forward< Ts >( ts )... ) ) )
+      {
+         return m_variant.template emplace< array_t >( std::forward< Ts >( ts )... );
+      }
+
+      void set_array( const array_t& a )
+      {
+         m_variant = a;
+      }
+
+      void set_array( array_t&& a ) noexcept( std::is_nothrow_move_assignable_v< array_t > )
+      {
+         m_variant = std::move( a );
+      }
+
+      array_t& prepare_array()
+      {
+         return is_uninitialized() ? emplace_array() : get_array();
+      }
+
+      void push_back( const basic_value& v )
+      {
+         prepare_array().push_back( v );
+      }
+
+      void push_back( basic_value&& v )
+      {
+         prepare_array().push_back( std::move( v ) );
+      }
+
+      template< typename... Ts >
+      basic_value& emplace_back( Ts&&... ts )
+      {
+         return prepare_array().emplace_back( std::forward< Ts >( ts )... );
+      }
+
+      template< typename... Ts >
+      object_t& emplace_object( Ts&&... ts ) noexcept( noexcept( object_t( std::forward< Ts >( ts )... ) ) )
+      {
+         return m_variant.template emplace< object_t >( std::forward< Ts >( ts )... );
+      }
+
+      void set_object( const object_t& o )
+      {
+         m_variant = o;
+      }
+
+      void set_object( object_t&& o ) noexcept( std::is_nothrow_move_assignable_v< object_t > )
+      {
+         m_variant = std::move( o );
+      }
+
+      object_t& prepare_object()
+      {
+         return is_uninitialized() ? emplace_object() : get_object();
+      }
+
+      template< typename... Ts >
+      auto try_emplace( Ts&&... ts )
+      {
+         auto r = prepare_object().try_emplace( std::forward< Ts >( ts )... );
+         if( !r.second ) {
+            throw_duplicate_key_exception( r.first->first );
+         }
+         return r;
+      }
+
+      auto insert( typename object_t::value_type&& t )
+      {
+         return prepare_object().emplace( std::move( t ) );
+      }
+
+      auto insert( const typename object_t::value_type& t )
+      {
+         return prepare_object().emplace( t );
+      }
+
+      void set_value_ptr( const basic_value* p ) noexcept
+      {
+         assert( p );
+         m_variant = p;
+      }
+
+      template< typename T >
+      void set_opaque_ptr( const T* data, const producer_t producer ) noexcept
+      {
+         assert( data );
+         assert( producer );
+         m_variant = internal::opaque_ptr_t{ data, producer };
+      }
+
+      template< typename T >
+      void set_opaque_ptr( const T* data ) noexcept
+      {
+         set_opaque_ptr( data, &basic_value::produce_from_opaque_ptr< T > );
+      }
+
+      template< typename T >
+      void assign( T&& v ) noexcept( noexcept( Traits< std::decay_t< T > >::assign( std::declval< basic_value& >(), std::forward< T >( v ) ) ) )
+      {
+         Traits< std::decay_t< T > >::assign( *this, std::forward< T >( v ) );
+      }
+
+      template< typename T >
+      void assign( T&& v, public_base_t b ) noexcept( noexcept( Traits< std::decay_t< T > >::assign( std::declval< basic_value& >(), std::forward< T >( v ) ) ) && std::is_nothrow_move_assignable_v< public_base_t > )
+      {
+         Traits< std::decay_t< T > >::assign( *this, std::forward< T >( v ) );
+         public_base() = std::move( b );
+      }
+
+      void assign( std::initializer_list< internal::pair< Traits > >&& l )
+      {
+         emplace_object();
+         for( auto& e : l ) {
+            try_emplace( std::move( e.key ), std::move( e.value ) );
+         }
+      }
+
+      void assign( const std::initializer_list< internal::pair< Traits > >& l )
+      {
+         emplace_object();
+         for( const auto& e : l ) {
+            try_emplace( e.key, e.value );
+         }
+      }
+
+      void assign( std::initializer_list< internal::pair< Traits > >& l )
+      {
+         assign( static_cast< const std::initializer_list< internal::pair< Traits > >& >( l ) );
+      }
+
+      void append( std::initializer_list< internal::single< Traits > >&& l )
+      {
+         auto& v = prepare_array();
+         v.reserve( v.size() + l.size() );
+         for( auto& e : l ) {
+            v.push_back( std::move( e.value ) );
+         }
+      }
+
+      void append( const std::initializer_list< internal::single< Traits > >& l )
+      {
+         auto& v = prepare_array();
+         v.reserve( v.size() + l.size() );
+         for( const auto& e : l ) {
+            v.push_back( e.value );
+         }
+      }
+
+      void insert( std::initializer_list< internal::pair< Traits > >&& l )
+      {
+         prepare_object();
+         for( auto& e : l ) {
+            try_emplace( std::move( e.key ), std::move( e.value ) );
+         }
+      }
+
+      void insert( const std::initializer_list< internal::pair< Traits > >& l )
+      {
+         prepare_object();
+         for( const auto& e : l ) {
+            try_emplace( e.key, e.value );
+         }
+      }
+
+      [[nodiscard]] const basic_value& skip_value_ptr() const noexcept
+      {
+         const basic_value* p = this;
+         while( p->is_value_ptr() ) {
+            p = p->get_value_ptr();
+            assert( p );
+         }
+         return *p;
+      }
+
+      [[nodiscard]] basic_value* find( const std::size_t index )
+      {
+         auto& a = get_array();
+         return ( index < a.size() ) ? ( a.data() + index ) : nullptr;
+      }
+
+      [[nodiscard]] const basic_value* find( const std::size_t index ) const
+      {
+         const auto& a = get_array();
+         return ( index < a.size() ) ? ( a.data() + index ) : nullptr;
+      }
+
+      template< typename Key >
+      [[nodiscard]] std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer >, basic_value* > find( Key&& key )
+      {
+         auto& o = get_object();
+         const auto it = o.find( std::forward< Key >( key ) );
+         return ( it != o.end() ) ? ( &it->second ) : nullptr;
+      }
+
+      template< typename Key >
+      [[nodiscard]] std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer >, const basic_value* > find( Key&& key ) const
+      {
+         const auto& o = get_object();
+         const auto it = o.find( std::forward< Key >( key ) );
+         return ( it != o.end() ) ? ( &it->second ) : nullptr;
+      }
+
+      [[nodiscard]] basic_value* find( const pointer& k )
+      {
+         return internal::pointer_find( this, k.begin(), k.end() );
+      }
+
+      [[nodiscard]] const basic_value* find( const pointer& k ) const
+      {
+         return internal::pointer_find( this, k.begin(), k.end() );
+      }
+
+      [[nodiscard]] basic_value& at( const std::size_t index )
+      {
+         auto& a = get_array();
+         if( index >= a.size() ) {
+            throw_index_out_of_bound_exception( index );
+         }
+         return a[ index ];
+      }
+
+      [[nodiscard]] const basic_value& at( const std::size_t index ) const
+      {
+         const auto& a = get_array();
+         if( index >= a.size() ) {
+            throw_index_out_of_bound_exception( index );
+         }
+         return a[ index ];
+      }
+
+      template< typename Key >
+      [[nodiscard]] std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer >, basic_value& > at( const Key& key )
+      {
+         auto& o = get_object();
+         const auto it = o.find( key );
+         if( it == o.end() ) {
+            throw_key_not_found_exception( key );
+         }
+         return it->second;
+      }
+
+      template< typename Key >
+      [[nodiscard]] std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer >, const basic_value& > at( const Key& key ) const
+      {
+         const auto& o = get_object();
+         const auto it = o.find( key );
+         if( it == o.end() ) {
+            throw_key_not_found_exception( key );
+         }
+         return it->second;
+      }
+
+      [[nodiscard]] basic_value& at( const pointer& k )
+      {
+         return internal::pointer_at( this, k.begin(), k.end() );
+      }
+
+      [[nodiscard]] const basic_value& at( const pointer& k ) const
+      {
+         return internal::pointer_at( this, k.begin(), k.end() );
+      }
+
+      [[nodiscard]] basic_value& operator[]( const std::size_t index )
+      {
+         return get_array()[ index ];
+      }
+
+      [[nodiscard]] const basic_value& operator[]( const std::size_t index ) const
+      {
+         return get_array()[ index ];
+      }
+
+      template< typename Key >
+      [[nodiscard]] std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer >, basic_value& > operator[]( Key&& key )
+      {
+         return prepare_object()[ std::forward< Key >( key ) ];
+      }
+
+      [[nodiscard]] basic_value& operator[]( const pointer& k )
+      {
+         if( k.empty() ) {
+            return *this;
+         }
+         const auto b = k.begin();
+         const auto e = std::prev( k.end() );
+         basic_value& v = internal::pointer_at( this, b, e );
+         if( v.is_object() ) {
+            return v.get_object()[ e->key() ];
+         }
+         if( v.is_array() ) {
+            if( e->key() == "-" ) {
+               v.emplace_back( null );
+               return v.get_array().back();
+            }
+            return v.at( e->index() );
+         }
+         throw internal::invalid_type( b, std::next( e ) );
+      }
+
+      template< typename T >
+      [[nodiscard]] std::enable_if_t< internal::has_as< Traits< T >, basic_value >, T > as() const
+      {
+         return Traits< T >::as( *this );
+      }
+
+      template< typename T >
+      [[nodiscard]] std::enable_if_t< !internal::has_as< Traits< T >, basic_value > && internal::has_as_type< Traits, T, basic_value >, T > as() const
+      {
+         return Traits< T >::template as_type< Traits, T >( *this );
+      }
+
+      template< typename T >
+      [[nodiscard]] std::enable_if_t< !internal::has_as< Traits< T >, basic_value > && !internal::has_as_type< Traits, T, basic_value > && internal::has_to< Traits< T >, basic_value, T >, T > as() const
+      {
+         T v;  // TODO: Should is_default_constructible< T > be part of the enable_if, static_assert()ed here, or this line allowed to error?
+         Traits< T >::to( *this, v );
+         return v;
+      }
+
+      template< typename T >
+      std::enable_if_t< !internal::has_as< Traits< T >, basic_value > && !internal::has_as_type< Traits, T, basic_value > && !internal::has_to< Traits< T >, basic_value, T > > as() const = delete;
+
+      template< typename T, typename K >
+      [[nodiscard]] T as( const K& key ) const
+      {
+         return this->at( key ).template as< T >();
+      }
+
+      // TODO: Incorporate has_as_type in the following functions (and throughout the library) (if we decide keep it)!
+
+      template< typename T, typename... With >
+      [[nodiscard]] std::enable_if_t< internal::has_as< Traits< T >, basic_value, With... >, T > as_with( With&&... with ) const
+      {
+         return Traits< T >::as( *this, with... );
+      }
+
+      template< typename T, typename... With >
+      [[nodiscard]] std::enable_if_t< !internal::has_as< Traits< T >, basic_value, With... > && internal::has_to< Traits< T >, basic_value, T, With... >, T > as_with( With&&... with ) const
+      {
+         T v;  // TODO: Should is_default_constructible< T > be part of the enable_if, static_assert()ed here, or this line allowed to error?
+         Traits< T >::to( *this, v, with... );
+         return v;
+      }
+
+      template< typename T, typename... With >
+      std::enable_if_t< !internal::has_as< Traits< T >, basic_value, With... > && !internal::has_to< Traits< T >, basic_value, T, With... >, T > as_with( With&&... with ) const = delete;
+
+      template< typename T >
+      std::enable_if_t< internal::has_to< Traits< T >, basic_value, T > > to( T& v ) const
+      {
+         Traits< std::decay_t< T > >::to( *this, v );
+      }
+
+      template< typename T >
+      std::enable_if_t< !internal::has_to< Traits< T >, basic_value, T > && internal::has_as< Traits< T >, basic_value > > to( T& v ) const
+      {
+         v = Traits< std::decay_t< T > >::as( *this );
+      }
+
+      template< typename T >
+      std::enable_if_t< !internal::has_to< Traits< T >, basic_value, T > && !internal::has_as< Traits< T >, basic_value > > to( T& v ) const = delete;
+
+      template< typename T, typename K >
+      void to( T& v, const K& key )
+      {
+         this->at( key ).to( v );
+      }
+
+      template< typename T, typename... With >
+      std::enable_if_t< internal::has_to< Traits< T >, basic_value, T, With... > > to_with( T& v, With&&... with ) const
+      {
+         Traits< std::decay_t< T > >::to( *this, v, with... );
+      }
+
+      template< typename T, typename... With >
+      std::enable_if_t< !internal::has_to< Traits< T >, basic_value, T, With... > && internal::has_as< Traits< T >, basic_value, With... > > to_with( T& v, With&&... with ) const
+      {
+         v = Traits< std::decay_t< T > >::as( *this, with... );
+      }
+
+      template< typename T, typename... With >
+      std::enable_if_t< !internal::has_to< Traits< T >, basic_value, T, With... > && !internal::has_as< Traits< T >, basic_value, With... > > to_with( T& v, With&&... with ) const = delete;
+
+      template< typename T >
+      [[nodiscard]] std::optional< T > optional() const
+      {
+         if( is_null() ) {
+            return std::nullopt;
+         }
+         return as< T >();
+      }
+
+      template< typename T, typename K >
+      [[nodiscard]] std::optional< T > optional( const K& key ) const
+      {
+         if( const auto* p = find( key ) ) {
+            return p->template as< T >();
+         }
+         return std::nullopt;
+      }
+
+      void erase( const std::size_t index )
+      {
+         auto& a = get_array();
+         if( index >= a.size() ) {
+            throw_index_out_of_bound_exception( index );
+         }
+         a.erase( a.begin() + index );
+      }
+
+      template< typename Key >
+      std::enable_if_t< !std::is_convertible_v< Key, std::size_t > && !std::is_convertible_v< Key, pointer > > erase( const Key& key )
+      {
+         if( get_object().erase( key ) == 0 ) {
+            throw_key_not_found_exception( key );
+         }
+      }
+
+      void erase( const pointer& k )
+      {
+         if( !k ) {
+            throw std::runtime_error( internal::format( "invalid root JSON Pointer for erase", json::message_extension( *this ) ) );
+         }
+         const auto b = k.begin();
+         const auto e = std::prev( k.end() );
+         basic_value& v = internal::pointer_at( this, b, e );
+         if( v.is_object() ) {
+            v.erase( e->key() );
+         }
+         else if( v.is_array() ) {
+            v.erase( e->index() );
+         }
+         else {
+            throw internal::invalid_type( b, std::next( e ) );
+         }
+      }
+
+      basic_value& insert( const pointer& k, basic_value in )
+      {
+         if( !k ) {
+            *this = std::move( in );
+            return *this;
+         }
+         const auto b = k.begin();
+         const auto e = std::prev( k.end() );
+         basic_value& v = internal::pointer_at( this, b, e );
+         if( v.is_object() ) {
+            return v.get_object().insert_or_assign( e->key(), std::move( in ) ).first->second;
+         }
+         if( v.is_array() ) {
+            auto& a = v.get_array();
+            if( e->key() == "-" ) {
+               v.emplace_back( std::move( in ) );
+               return a.back();
+            }
+            const auto i = e->index();
+            if( i >= a.size() ) {
+               throw std::out_of_range( internal::format( "invalid JSON Pointer \"", internal::tokens_to_string( b, std::next( e ) ), "\", array index '", i, "' out of bound '", a.size(), '\'', json::message_extension( *this ) ) );
+            }
+            a.insert( a.begin() + i, std::move( in ) );
+            return a.at( i );
+         }
+         throw internal::invalid_type( b, std::next( e ) );
+      }
+
+      variant_t& variant() noexcept
+      {
+         return m_variant;
+      }
+
+      const variant_t& variant() const noexcept
+      {
+         return m_variant;
+      }
+
+   private:
+      template< typename T >
+      static void produce_from_opaque_ptr( events::virtual_base& consumer, const void* raw )
+      {
+         Traits< T >::template produce< Traits >( consumer, *static_cast< const T* >( raw ) );
+      }
+   };
+
+}  // namespace tao::json
+
+#endif