couchbase 3.0.0-universal-darwin-19 → 3.0.1-universal-darwin-19

data/ext/third_party/json/include/tao/json/external/pegtl/analysis/insert_rules.hpp

@@ -1,25 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_ANALYSIS_INSERT_RULES_HPP
-#define TAO_JSON_PEGTL_ANALYSIS_INSERT_RULES_HPP
-
-#include "../config.hpp"
-
-#include "grammar_info.hpp"
-#include "rule_info.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-{
-   template< typename... Rules >
-   struct insert_rules
-   {
-      static void insert( grammar_info& g, rule_info& r )
-      {
-         ( r.rules.emplace_back( Rules::analyze_t::template insert< Rules >( g ) ), ... );
-      }
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/analysis/rule_info.hpp

@@ -1,29 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_ANALYSIS_RULE_INFO_HPP
-#define TAO_JSON_PEGTL_ANALYSIS_RULE_INFO_HPP
-
-#include <string>
-#include <vector>
-
-#include "../config.hpp"
-
-#include "rule_type.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-{
-   struct rule_info
-   {
-      explicit rule_info( const rule_type in_type ) noexcept
-         : type( in_type )
-      {
-      }
-
-      rule_type type;
-      std::vector< std::string > rules;
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/analysis/rule_type.hpp

@@ -1,21 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_ANALYSIS_RULE_TYPE_HPP
-#define TAO_JSON_PEGTL_ANALYSIS_RULE_TYPE_HPP
-
-#include "../config.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-{
-   enum class rule_type : char
-   {
-      any,  // Consumption-on-success is always true; assumes bounded repetition of conjunction of sub-rules.
-      opt,  // Consumption-on-success not necessarily true; assumes bounded repetition of conjunction of sub-rules.
-      seq,  // Consumption-on-success depends on consumption of (non-zero bounded repetition of) conjunction of sub-rules.
-      sor   // Consumption-on-success depends on consumption of (non-zero bounded repetition of) disjunction of sub-rules.
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::analysis
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/analyze.hpp

@@ -1,21 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_ANALYZE_HPP
-#define TAO_JSON_PEGTL_ANALYZE_HPP
-
-#include "config.hpp"
-
-#include "analysis/analyze_cycles.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE
-{
-   template< typename Rule >
-   [[nodiscard]] std::size_t analyze( const bool verbose = true )
-   {
-      return analysis::analyze_cycles< Rule >( verbose ).problems();
-   }
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/contrib/counter.hpp

@@ -1,54 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_CONTRIB_COUNTER_HPP
-#define TAO_JSON_PEGTL_CONTRIB_COUNTER_HPP
-
-#include <map>
-#include <string_view>
-
-#include "../config.hpp"
-#include "../normal.hpp"
-
-#include "../internal/demangle.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE
-{
-   struct counter_data
-   {
-      unsigned start = 0;
-      unsigned success = 0;
-      unsigned failure = 0;
-   };
-
-   struct counter_state
-   {
-      std::map< std::string_view, counter_data > counts;
-   };
-
-   template< typename Rule >
-   struct counter
-      : normal< Rule >
-   {
-      template< typename Input >
-      static void start( const Input& /*unused*/, counter_state& ts )
-      {
-         ++ts.counts[ internal::demangle< Rule >() ].start;
-      }
-
-      template< typename Input >
-      static void success( const Input& /*unused*/, counter_state& ts )
-      {
-         ++ts.counts[ internal::demangle< Rule >() ].success;
-      }
-
-      template< typename Input >
-      static void failure( const Input& /*unused*/, counter_state& ts )
-      {
-         ++ts.counts[ internal::demangle< Rule >() ].failure;
-      }
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/contrib/tracer.hpp

@@ -1,158 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_CONTRIB_TRACER_HPP
-#define TAO_JSON_PEGTL_CONTRIB_TRACER_HPP
-
-#include <cassert>
-#include <iomanip>
-#include <iostream>
-#include <utility>
-#include <vector>
-
-#include "../config.hpp"
-#include "../normal.hpp"
-
-#include "../internal/demangle.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE
-{
-   namespace internal
-   {
-      template< typename Input >
-      void print_current( const Input& in )
-      {
-         if( in.empty() ) {
-            std::cerr << "<eof>";
-         }
-         else {
-            const auto c = in.peek_uint8();
-            switch( c ) {
-               case 0:
-                  std::cerr << "<nul> = ";
-                  break;
-               case 9:
-                  std::cerr << "<ht> = ";
-                  break;
-               case 10:
-                  std::cerr << "<lf> = ";
-                  break;
-               case 13:
-                  std::cerr << "<cr> = ";
-                  break;
-               default:
-                  if( isprint( c ) ) {
-                     std::cerr << '\'' << c << "' = ";
-                  }
-            }
-            std::cerr << "(char)" << unsigned( c );
-         }
-      }
-
-   }  // namespace internal
-
-   struct trace_state
-   {
-      unsigned rule = 0;
-      unsigned line = 0;
-      std::vector< unsigned > stack;
-   };
-
-   template< template< typename... > class Base >
-   struct trace
-   {
-      template< typename Rule >
-      struct control
-         : Base< Rule >
-      {
-         template< typename Input, typename... States >
-         static void start( const Input& in, States&&... st )
-         {
-            std::cerr << in.position() << "  start  " << internal::demangle< Rule >() << "; current ";
-            print_current( in );
-            std::cerr << std::endl;
-            Base< Rule >::start( in, st... );
-         }
-
-         template< typename Input, typename... States >
-         static void start( const Input& in, trace_state& ts, States&&... st )
-         {
-            std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ++ts.rule << " ";
-            start( in, st... );
-            ts.stack.push_back( ts.rule );
-         }
-
-         template< typename Input, typename... States >
-         static void success( const Input& in, States&&... st )
-         {
-            std::cerr << in.position() << " success " << internal::demangle< Rule >() << "; next ";
-            print_current( in );
-            std::cerr << std::endl;
-            Base< Rule >::success( in, st... );
-         }
-
-         template< typename Input, typename... States >
-         static void success( const Input& in, trace_state& ts, States&&... st )
-         {
-            assert( !ts.stack.empty() );
-            std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ts.stack.back() << " ";
-            success( in, st... );
-            ts.stack.pop_back();
-         }
-
-         template< typename Input, typename... States >
-         static void failure( const Input& in, States&&... st )
-         {
-            std::cerr << in.position() << " failure " << internal::demangle< Rule >() << std::endl;
-            Base< Rule >::failure( in, st... );
-         }
-
-         template< typename Input, typename... States >
-         static void failure( const Input& in, trace_state& ts, States&&... st )
-         {
-            assert( !ts.stack.empty() );
-            std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ts.stack.back() << " ";
-            failure( in, st... );
-            ts.stack.pop_back();
-         }
-
-         template< template< typename... > class Action, typename Iterator, typename Input, typename... States >
-         static auto apply( const Iterator& begin, const Input& in, States&&... st )
-            -> decltype( Base< Rule >::template apply< Action >( begin, in, st... ) )
-         {
-            std::cerr << in.position() << "  apply  " << internal::demangle< Rule >() << std::endl;
-            return Base< Rule >::template apply< Action >( begin, in, st... );
-         }
-
-         template< template< typename... > class Action, typename Iterator, typename Input, typename... States >
-         static auto apply( const Iterator& begin, const Input& in, trace_state& ts, States&&... st )
-            -> decltype( apply< Action >( begin, in, st... ) )
-         {
-            std::cerr << std::setw( 6 ) << ++ts.line << "        ";
-            return apply< Action >( begin, in, st... );
-         }
-
-         template< template< typename... > class Action, typename Input, typename... States >
-         static auto apply0( const Input& in, States&&... st )
-            -> decltype( Base< Rule >::template apply0< Action >( in, st... ) )
-         {
-            std::cerr << in.position() << "  apply0 " << internal::demangle< Rule >() << std::endl;
-            return Base< Rule >::template apply0< Action >( in, st... );
-         }
-
-         template< template< typename... > class Action, typename Input, typename... States >
-         static auto apply0( const Input& in, trace_state& ts, States&&... st )
-            -> decltype( apply0< Action >( in, st... ) )
-         {
-            std::cerr << std::setw( 6 ) << ++ts.line << "        ";
-            return apply0< Action >( in, st... );
-         }
-      };
-   };
-
-   template< typename Rule >
-   using tracer = trace< normal >::control< Rule >;
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/internal/alnum.hpp

@@ -1,18 +0,0 @@
-// Copyright (c) 2017-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_INTERNAL_ALNUM_HPP
-#define TAO_JSON_PEGTL_INTERNAL_ALNUM_HPP
-
-#include "../config.hpp"
-
-#include "peek_char.hpp"
-#include "ranges.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::internal
-{
-   using alnum = ranges< peek_char, 'a', 'z', 'A', 'Z', '0', '9' >;
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::internal
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/internal/alpha.hpp

@@ -1,18 +0,0 @@
-// Copyright (c) 2017-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_INTERNAL_ALPHA_HPP
-#define TAO_JSON_PEGTL_INTERNAL_ALPHA_HPP
-
-#include "../config.hpp"
-
-#include "peek_char.hpp"
-#include "ranges.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::internal
-{
-   using alpha = ranges< peek_char, 'a', 'z', 'A', 'Z' >;
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::internal
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/internal/dusel_mode.hpp

@@ -1,23 +0,0 @@
-// Copyright (c) 2017-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_INTERNAL_DUSEL_MODE_HPP
-#define TAO_JSON_PEGTL_INTERNAL_DUSEL_MODE_HPP
-
-#include "../config.hpp"
-
-namespace TAO_JSON_PEGTL_NAMESPACE::internal
-{
-   enum class dusel_mode : char
-   {
-      nothing = 0,
-      control = 1,
-      control_and_apply_void = 2,
-      control_and_apply_bool = 3,
-      control_and_apply0_void = 4,
-      control_and_apply0_bool = 5
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::internal
-
-#endif

data/ext/third_party/json/include/tao/json/external/pegtl/internal/duseltronik.hpp

@@ -1,187 +0,0 @@
-// Copyright (c) 2014-2020 Dr. Colin Hirsch and Daniel Frey
-// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
-
-#ifndef TAO_JSON_PEGTL_INTERNAL_DUSELTRONIK_HPP
-#define TAO_JSON_PEGTL_INTERNAL_DUSELTRONIK_HPP
-
-#include "../apply_mode.hpp"
-#include "../config.hpp"
-#include "../rewind_mode.hpp"
-
-#include "dusel_mode.hpp"
-
-#ifdef _MSC_VER
-#pragma warning( push )
-#pragma warning( disable : 4702 )
-#endif
-
-namespace TAO_JSON_PEGTL_NAMESPACE::internal
-{
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control,
-             dusel_mode = dusel_mode::nothing >
-   struct duseltronik;
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::nothing >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static auto match( Input& in, States&&... st )
-         -> decltype( Rule::template match< A, M, Action, Control >( in, st... ) )
-      {
-         return Rule::template match< A, M, Action, Control >( in, st... );
-      }
-
-      template< typename Input, typename... States, int = 1 >
-      [[nodiscard]] static auto match( Input& in, States&&... /*unused*/ )
-         -> decltype( Rule::match( in ) )
-      {
-         return Rule::match( in );
-      }
-   };
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::control >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static bool match( Input& in, States&&... st )
-      {
-         Control< Rule >::start( static_cast< const Input& >( in ), st... );
-
-         if( duseltronik< Rule, A, M, Action, Control, dusel_mode::nothing >::match( in, st... ) ) {
-            Control< Rule >::success( static_cast< const Input& >( in ), st... );
-            return true;
-         }
-         Control< Rule >::failure( static_cast< const Input& >( in ), st... );
-         return false;
-      }
-   };
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::control_and_apply_void >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static bool match( Input& in, States&&... st )
-      {
-         auto m = in.template mark< rewind_mode::required >();
-
-         Control< Rule >::start( static_cast< const Input& >( in ), st... );
-
-         if( duseltronik< Rule, A, rewind_mode::active, Action, Control, dusel_mode::nothing >::match( in, st... ) ) {
-            Control< Rule >::template apply< Action >( m.iterator(), static_cast< const Input& >( in ), st... );
-            Control< Rule >::success( static_cast< const Input& >( in ), st... );
-            return m( true );
-         }
-         Control< Rule >::failure( static_cast< const Input& >( in ), st... );
-         return false;
-      }
-   };
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::control_and_apply_bool >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static bool match( Input& in, States&&... st )
-      {
-         auto m = in.template mark< rewind_mode::required >();
-
-         Control< Rule >::start( static_cast< const Input& >( in ), st... );
-
-         if( duseltronik< Rule, A, rewind_mode::active, Action, Control, dusel_mode::nothing >::match( in, st... ) ) {
-            if( Control< Rule >::template apply< Action >( m.iterator(), static_cast< const Input& >( in ), st... ) ) {
-               Control< Rule >::success( static_cast< const Input& >( in ), st... );
-               return m( true );
-            }
-         }
-         Control< Rule >::failure( static_cast< const Input& >( in ), st... );
-         return false;
-      }
-   };
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::control_and_apply0_void >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static bool match( Input& in, States&&... st )
-      {
-         Control< Rule >::start( static_cast< const Input& >( in ), st... );
-
-         if( duseltronik< Rule, A, M, Action, Control, dusel_mode::nothing >::match( in, st... ) ) {
-            Control< Rule >::template apply0< Action >( static_cast< const Input& >( in ), st... );
-            Control< Rule >::success( static_cast< const Input& >( in ), st... );
-            return true;
-         }
-         Control< Rule >::failure( static_cast< const Input& >( in ), st... );
-         return false;
-      }
-   };
-
-   template< typename Rule,
-             apply_mode A,
-             rewind_mode M,
-             template< typename... >
-             class Action,
-             template< typename... >
-             class Control >
-   struct duseltronik< Rule, A, M, Action, Control, dusel_mode::control_and_apply0_bool >
-   {
-      template< typename Input, typename... States >
-      [[nodiscard]] static bool match( Input& in, States&&... st )
-      {
-         auto m = in.template mark< rewind_mode::required >();
-
-         Control< Rule >::start( static_cast< const Input& >( in ), st... );
-
-         if( duseltronik< Rule, A, rewind_mode::active, Action, Control, dusel_mode::nothing >::match( in, st... ) ) {
-            if( Control< Rule >::template apply0< Action >( static_cast< const Input& >( in ), st... ) ) {
-               Control< Rule >::success( static_cast< const Input& >( in ), st... );
-               return m( true );
-            }
-         }
-         Control< Rule >::failure( static_cast< const Input& >( in ), st... );
-         return false;
-      }
-   };
-
-}  // namespace TAO_JSON_PEGTL_NAMESPACE::internal
-
-#ifdef _MSC_VER
-#pragma warning( pop )
-#endif
-
-#endif