From 77e4a233839acca9dfba39feb5006c21e8068862 Mon Sep 17 00:00:00 2001 From: bunchgrape Date: Fri, 2 May 2025 14:18:01 +0800 Subject: [PATCH] add liberty parser; update db --- cpp_to_py/common/db/Cell.cpp | 1 + cpp_to_py/common/db/Cell.h | 7 + cpp_to_py/common/db/Database.cpp | 48 +- cpp_to_py/common/db/Database.h | 8 + cpp_to_py/common/db/DatabaseClass.h | 8 + cpp_to_py/common/db/Setting.cpp | 6 + cpp_to_py/common/db/Setting.h | 5 + cpp_to_py/common/lib/EnumNameMap.h | 61 + cpp_to_py/common/lib/Helper.h | 86 + cpp_to_py/common/lib/Liberty.cpp | 117 + cpp_to_py/common/lib/Liberty.h | 155 + cpp_to_py/common/lib/LibtertyReader.cpp | 561 + cpp_to_py/common/lib/Lut.cpp | 32 + cpp_to_py/common/lib/Lut.h | 56 + cpp_to_py/common/lib/Timing.cpp | 164 + cpp_to_py/common/lib/Timing.h | 95 + cpp_to_py/common/lib/sdc/json.hpp | 25447 ++++++++++++++++ cpp_to_py/common/lib/sdc/json/ChangeLog | 206 + cpp_to_py/common/lib/sdc/json/c/json.tab.c | 1992 ++ cpp_to_py/common/lib/sdc/json/c/json.y | 557 + cpp_to_py/common/lib/sdc/json/c/json_y.h | 63 + cpp_to_py/common/lib/sdc/json/json.bench | 167 + cpp_to_py/common/lib/sdc/json/json.man | 114 + cpp_to_py/common/lib/sdc/json/json.pcx | 32 + cpp_to_py/common/lib/sdc/json/json.tcl | 285 + cpp_to_py/common/lib/sdc/json/json.test | 94 + cpp_to_py/common/lib/sdc/json/json.testsuite | 102 + cpp_to_py/common/lib/sdc/json/json_tcl.tcl | 291 + cpp_to_py/common/lib/sdc/json/json_write.man | 92 + cpp_to_py/common/lib/sdc/json/json_write.pcx | 42 + cpp_to_py/common/lib/sdc/json/json_write.tcl | 200 + cpp_to_py/common/lib/sdc/json/json_write.test | 218 + cpp_to_py/common/lib/sdc/json/jsonc.tcl | 171 + cpp_to_py/common/lib/sdc/json/pkgIndex.tcl | 7 + .../common/lib/sdc/json/tests/array.result | 1 + .../common/lib/sdc/json/tests/array.sort | 1 + .../common/lib/sdc/json/tests/glossary.result | 1 + .../common/lib/sdc/json/tests/glossary.sort | 1 + .../common/lib/sdc/json/tests/menu.result | 1 + cpp_to_py/common/lib/sdc/json/tests/menu.sort | 1 + .../common/lib/sdc/json/tests/menu2.result | 1 + .../common/lib/sdc/json/tests/menu2.sort | 1 + .../common/lib/sdc/json/tests/support.tcl | 157 + .../common/lib/sdc/json/tests/widget.result | 1 + .../common/lib/sdc/json/tests/widget.sort | 1 + cpp_to_py/common/lib/sdc/mask.h | 32 + cpp_to_py/common/lib/sdc/object.cpp | 29 + cpp_to_py/common/lib/sdc/object.h | 61 + cpp_to_py/common/lib/sdc/sdc.cpp | 319 + cpp_to_py/common/lib/sdc/sdc.h | 148 + cpp_to_py/common/lib/sdc/sdc.tcl | 93 + cpp_to_py/common/lib/sdc/sdc1.1.tcl | 363 + cpp_to_py/common/lib/sdc/sdc1.2.tcl | 386 + cpp_to_py/common/lib/sdc/sdc1.3.tcl | 397 + cpp_to_py/common/lib/sdc/sdc1.4.tcl | 444 + cpp_to_py/common/lib/sdc/sdc1.5.tcl | 553 + cpp_to_py/common/lib/sdc/sdc1.6.tcl | 572 + cpp_to_py/common/lib/sdc/sdc1.7.tcl | 707 + cpp_to_py/common/lib/sdc/sdc1.8.tcl | 715 + cpp_to_py/common/lib/sdc/sdc1.9.tcl | 724 + cpp_to_py/common/lib/sdc/sdc2.0.tcl | 733 + cpp_to_py/common/lib/sdc/sdcparser.tcl | 147 + cpp_to_py/common/lib/sdc/sdcparsercore.tcl | 870 + cpp_to_py/common/lib/sdc/tokenizer.cpp | 99 + cpp_to_py/common/lib/sdc/tokenizer.h | 11 + cpp_to_py/common/lib/spef/parser-spef.hpp | 1316 + cpp_to_py/common/lib/spef/pegtl/LICENSE | 21 + cpp_to_py/common/lib/spef/pegtl/pegtl.hpp | 35 + .../pegtl/pegtl/analysis/analyze_cycles.hpp | 135 + .../lib/spef/pegtl/pegtl/analysis/counted.hpp | 29 + .../lib/spef/pegtl/pegtl/analysis/generic.hpp | 39 + .../pegtl/pegtl/analysis/grammar_info.hpp | 40 + .../pegtl/pegtl/analysis/insert_guard.hpp | 68 + .../pegtl/pegtl/analysis/insert_rules.hpp | 45 + .../spef/pegtl/pegtl/analysis/rule_info.hpp | 37 + .../spef/pegtl/pegtl/analysis/rule_type.hpp | 29 + .../common/lib/spef/pegtl/pegtl/analyze.hpp | 25 + .../lib/spef/pegtl/pegtl/apply_mode.hpp | 23 + .../lib/spef/pegtl/pegtl/argv_input.hpp | 57 + .../common/lib/spef/pegtl/pegtl/ascii.hpp | 68 + .../lib/spef/pegtl/pegtl/buffer_input.hpp | 185 + .../common/lib/spef/pegtl/pegtl/config.hpp | 20 + .../lib/spef/pegtl/pegtl/contrib/abnf.hpp | 43 + .../lib/spef/pegtl/pegtl/contrib/alphabet.hpp | 75 + .../lib/spef/pegtl/pegtl/contrib/changes.hpp | 101 + .../lib/spef/pegtl/pegtl/contrib/counter.hpp | 58 + .../lib/spef/pegtl/pegtl/contrib/http.hpp | 151 + .../spef/pegtl/pegtl/contrib/icu/internal.hpp | 76 + .../spef/pegtl/pegtl/contrib/icu/utf16.hpp | 212 + .../spef/pegtl/pegtl/contrib/icu/utf32.hpp | 212 + .../lib/spef/pegtl/pegtl/contrib/icu/utf8.hpp | 117 + .../lib/spef/pegtl/pegtl/contrib/integer.hpp | 108 + .../lib/spef/pegtl/pegtl/contrib/json.hpp | 98 + .../spef/pegtl/pegtl/contrib/parse_tree.hpp | 373 + .../spef/pegtl/pegtl/contrib/raw_string.hpp | 223 + .../pegtl/pegtl/contrib/rep_one_min_max.hpp | 72 + .../spef/pegtl/pegtl/contrib/to_string.hpp | 42 + .../lib/spef/pegtl/pegtl/contrib/tracer.hpp | 115 + .../lib/spef/pegtl/pegtl/contrib/unescape.hpp | 210 + .../lib/spef/pegtl/pegtl/contrib/uri.hpp | 115 + .../lib/spef/pegtl/pegtl/cstream_input.hpp | 39 + cpp_to_py/common/lib/spef/pegtl/pegtl/eol.hpp | 41 + .../common/lib/spef/pegtl/pegtl/eol_pair.hpp | 22 + .../lib/spef/pegtl/pegtl/file_input.hpp | 50 + .../lib/spef/pegtl/pegtl/input_error.hpp | 51 + .../lib/spef/pegtl/pegtl/internal/action.hpp | 52 + .../pegtl/pegtl/internal/action_input.hpp | 114 + .../lib/spef/pegtl/pegtl/internal/alnum.hpp | 26 + .../lib/spef/pegtl/pegtl/internal/alpha.hpp | 26 + .../lib/spef/pegtl/pegtl/internal/any.hpp | 68 + .../lib/spef/pegtl/pegtl/internal/apply.hpp | 92 + .../lib/spef/pegtl/pegtl/internal/apply0.hpp | 90 + .../pegtl/pegtl/internal/apply0_single.hpp | 42 + .../pegtl/pegtl/internal/apply_single.hpp | 42 + .../lib/spef/pegtl/pegtl/internal/at.hpp | 62 + .../lib/spef/pegtl/pegtl/internal/bof.hpp | 41 + .../lib/spef/pegtl/pegtl/internal/bol.hpp | 41 + .../spef/pegtl/pegtl/internal/bump_help.hpp | 63 + .../spef/pegtl/pegtl/internal/bump_impl.hpp | 53 + .../lib/spef/pegtl/pegtl/internal/bytes.hpp | 46 + .../lib/spef/pegtl/pegtl/internal/control.hpp | 52 + .../spef/pegtl/pegtl/internal/cr_crlf_eol.hpp | 40 + .../lib/spef/pegtl/pegtl/internal/cr_eol.hpp | 40 + .../spef/pegtl/pegtl/internal/crlf_eol.hpp | 40 + .../pegtl/pegtl/internal/cstream_reader.hpp | 50 + .../pegtl/pegtl/internal/cstring_reader.hpp | 49 + .../spef/pegtl/pegtl/internal/demangle.hpp | 42 + .../pegtl/pegtl/internal/demangle_cxxabi.hpp | 41 + .../pegtl/pegtl/internal/demangle_nop.hpp | 28 + .../pegtl/internal/demangle_sanitise.hpp | 48 + .../lib/spef/pegtl/pegtl/internal/disable.hpp | 52 + .../lib/spef/pegtl/pegtl/internal/discard.hpp | 43 + .../spef/pegtl/pegtl/internal/dusel_mode.hpp | 27 + .../spef/pegtl/pegtl/internal/duseltronik.hpp | 174 + .../lib/spef/pegtl/pegtl/internal/enable.hpp | 52 + .../lib/spef/pegtl/pegtl/internal/endian.hpp | 70 + .../spef/pegtl/pegtl/internal/endian_gcc.hpp | 215 + .../spef/pegtl/pegtl/internal/endian_win.hpp | 115 + .../lib/spef/pegtl/pegtl/internal/eof.hpp | 41 + .../lib/spef/pegtl/pegtl/internal/eol.hpp | 41 + .../lib/spef/pegtl/pegtl/internal/eolf.hpp | 42 + .../pegtl/internal/file_mapper_posix.hpp | 95 + .../pegtl/internal/file_mapper_win32.hpp | 212 + .../spef/pegtl/pegtl/internal/file_opener.hpp | 78 + .../spef/pegtl/pegtl/internal/file_reader.hpp | 109 + .../spef/pegtl/pegtl/internal/has_apply.hpp | 33 + .../spef/pegtl/pegtl/internal/has_apply0.hpp | 33 + .../spef/pegtl/pegtl/internal/identifier.hpp | 30 + .../spef/pegtl/pegtl/internal/if_apply.hpp | 110 + .../lib/spef/pegtl/pegtl/internal/if_must.hpp | 57 + .../pegtl/pegtl/internal/if_must_else.hpp | 27 + .../pegtl/pegtl/internal/if_then_else.hpp | 59 + .../spef/pegtl/pegtl/internal/input_pair.hpp | 37 + .../pegtl/pegtl/internal/integer_sequence.hpp | 86 + .../pegtl/pegtl/internal/istream_reader.hpp | 47 + .../lib/spef/pegtl/pegtl/internal/istring.hpp | 107 + .../spef/pegtl/pegtl/internal/iterator.hpp | 60 + .../spef/pegtl/pegtl/internal/lf_crlf_eol.hpp | 45 + .../lib/spef/pegtl/pegtl/internal/lf_eol.hpp | 40 + .../lib/spef/pegtl/pegtl/internal/list.hpp | 27 + .../spef/pegtl/pegtl/internal/list_must.hpp | 28 + .../spef/pegtl/pegtl/internal/list_tail.hpp | 28 + .../pegtl/pegtl/internal/list_tail_pad.hpp | 30 + .../lib/spef/pegtl/pegtl/internal/marker.hpp | 99 + .../lib/spef/pegtl/pegtl/internal/minus.hpp | 69 + .../lib/spef/pegtl/pegtl/internal/must.hpp | 79 + .../lib/spef/pegtl/pegtl/internal/not_at.hpp | 62 + .../lib/spef/pegtl/pegtl/internal/one.hpp | 81 + .../lib/spef/pegtl/pegtl/internal/opt.hpp | 65 + .../lib/spef/pegtl/pegtl/internal/pad.hpp | 27 + .../lib/spef/pegtl/pegtl/internal/pad_opt.hpp | 28 + .../spef/pegtl/pegtl/internal/peek_char.hpp | 37 + .../pegtl/pegtl/internal/peek_mask_uint.hpp | 63 + .../pegtl/pegtl/internal/peek_mask_uint8.hpp | 39 + .../spef/pegtl/pegtl/internal/peek_uint.hpp | 54 + .../spef/pegtl/pegtl/internal/peek_uint8.hpp | 38 + .../spef/pegtl/pegtl/internal/peek_utf16.hpp | 63 + .../spef/pegtl/pegtl/internal/peek_utf32.hpp | 51 + .../spef/pegtl/pegtl/internal/peek_utf8.hpp | 88 + .../pegtl/pegtl/internal/pegtl_string.hpp | 103 + .../lib/spef/pegtl/pegtl/internal/plus.hpp | 61 + .../lib/spef/pegtl/pegtl/internal/raise.hpp | 61 + .../lib/spef/pegtl/pegtl/internal/range.hpp | 60 + .../lib/spef/pegtl/pegtl/internal/ranges.hpp | 102 + .../spef/pegtl/pegtl/internal/read_uint.hpp | 85 + .../lib/spef/pegtl/pegtl/internal/rep.hpp | 75 + .../lib/spef/pegtl/pegtl/internal/rep_min.hpp | 28 + .../spef/pegtl/pegtl/internal/rep_min_max.hpp | 88 + .../lib/spef/pegtl/pegtl/internal/rep_opt.hpp | 54 + .../lib/spef/pegtl/pegtl/internal/require.hpp | 52 + .../pegtl/pegtl/internal/rule_conjunction.hpp | 63 + .../lib/spef/pegtl/pegtl/internal/rules.hpp | 63 + .../lib/spef/pegtl/pegtl/internal/seq.hpp | 80 + .../pegtl/pegtl/internal/skip_control.hpp | 35 + .../lib/spef/pegtl/pegtl/internal/sor.hpp | 74 + .../lib/spef/pegtl/pegtl/internal/star.hpp | 56 + .../spef/pegtl/pegtl/internal/star_must.hpp | 27 + .../lib/spef/pegtl/pegtl/internal/state.hpp | 85 + .../lib/spef/pegtl/pegtl/internal/string.hpp | 68 + .../lib/spef/pegtl/pegtl/internal/three.hpp | 52 + .../lib/spef/pegtl/pegtl/internal/trivial.hpp | 42 + .../pegtl/pegtl/internal/try_catch_type.hpp | 72 + .../lib/spef/pegtl/pegtl/internal/two.hpp | 52 + .../lib/spef/pegtl/pegtl/internal/until.hpp | 91 + .../lib/spef/pegtl/pegtl/istream_input.hpp | 39 + .../lib/spef/pegtl/pegtl/memory_input.hpp | 364 + .../lib/spef/pegtl/pegtl/mmap_input.hpp | 85 + .../common/lib/spef/pegtl/pegtl/normal.hpp | 90 + .../common/lib/spef/pegtl/pegtl/nothing.hpp | 27 + .../common/lib/spef/pegtl/pegtl/parse.hpp | 53 + .../lib/spef/pegtl/pegtl/parse_error.hpp | 45 + .../common/lib/spef/pegtl/pegtl/position.hpp | 54 + .../lib/spef/pegtl/pegtl/read_input.hpp | 80 + .../lib/spef/pegtl/pegtl/rewind_mode.hpp | 24 + .../common/lib/spef/pegtl/pegtl/rules.hpp | 70 + .../lib/spef/pegtl/pegtl/string_input.hpp | 72 + .../lib/spef/pegtl/pegtl/tracking_mode.hpp | 23 + .../common/lib/spef/pegtl/pegtl/uint16.hpp | 66 + .../common/lib/spef/pegtl/pegtl/uint32.hpp | 66 + .../common/lib/spef/pegtl/pegtl/uint64.hpp | 67 + .../common/lib/spef/pegtl/pegtl/uint8.hpp | 44 + .../common/lib/spef/pegtl/pegtl/utf16.hpp | 53 + .../common/lib/spef/pegtl/pegtl/utf32.hpp | 53 + .../common/lib/spef/pegtl/pegtl/utf8.hpp | 36 + .../common/lib/spef/pegtl/pegtl/version.hpp | 19 + cpp_to_py/common/lib/tokenizer.cpp | 163 + cpp_to_py/common/lib/tokenizer.h | 113 + cpp_to_py/common/lib/unit.cpp | 291 + cpp_to_py/common/lib/unit.h | 21 + cpp_to_py/common/lib/units.hpp | 4851 +++ cpp_to_py/io_parser/BindHelper.cpp | 8 +- cpp_to_py/io_parser/PyBindCppMain.cpp | 21 +- cpp_to_py/io_parser/gp/GPDatabase.cpp | 28 +- cpp_to_py/io_parser/gp/GPDatabase.h | 30 +- utils/get_design_params.py | 10 + 235 files changed, 56902 insertions(+), 10 deletions(-) create mode 100644 cpp_to_py/common/lib/EnumNameMap.h create mode 100755 cpp_to_py/common/lib/Helper.h create mode 100644 cpp_to_py/common/lib/Liberty.cpp create mode 100644 cpp_to_py/common/lib/Liberty.h create mode 100644 cpp_to_py/common/lib/LibtertyReader.cpp create mode 100755 cpp_to_py/common/lib/Lut.cpp create mode 100755 cpp_to_py/common/lib/Lut.h create mode 100755 cpp_to_py/common/lib/Timing.cpp create mode 100755 cpp_to_py/common/lib/Timing.h create mode 100755 cpp_to_py/common/lib/sdc/json.hpp create mode 100755 cpp_to_py/common/lib/sdc/json/ChangeLog create mode 100755 cpp_to_py/common/lib/sdc/json/c/json.tab.c create mode 100755 cpp_to_py/common/lib/sdc/json/c/json.y create mode 100755 cpp_to_py/common/lib/sdc/json/c/json_y.h create mode 100755 cpp_to_py/common/lib/sdc/json/json.bench create mode 100755 cpp_to_py/common/lib/sdc/json/json.man create mode 100755 cpp_to_py/common/lib/sdc/json/json.pcx create mode 100755 cpp_to_py/common/lib/sdc/json/json.tcl create mode 100755 cpp_to_py/common/lib/sdc/json/json.test create mode 100755 cpp_to_py/common/lib/sdc/json/json.testsuite create mode 100755 cpp_to_py/common/lib/sdc/json/json_tcl.tcl create mode 100755 cpp_to_py/common/lib/sdc/json/json_write.man create mode 100755 cpp_to_py/common/lib/sdc/json/json_write.pcx create mode 100755 cpp_to_py/common/lib/sdc/json/json_write.tcl create mode 100755 cpp_to_py/common/lib/sdc/json/json_write.test create mode 100755 cpp_to_py/common/lib/sdc/json/jsonc.tcl create mode 100755 cpp_to_py/common/lib/sdc/json/pkgIndex.tcl create mode 100644 cpp_to_py/common/lib/sdc/json/tests/array.result create mode 100644 cpp_to_py/common/lib/sdc/json/tests/array.sort create mode 100644 cpp_to_py/common/lib/sdc/json/tests/glossary.result create mode 100644 cpp_to_py/common/lib/sdc/json/tests/glossary.sort create mode 100644 cpp_to_py/common/lib/sdc/json/tests/menu.result create mode 100644 cpp_to_py/common/lib/sdc/json/tests/menu.sort create mode 100644 cpp_to_py/common/lib/sdc/json/tests/menu2.result create mode 100644 cpp_to_py/common/lib/sdc/json/tests/menu2.sort create mode 100644 cpp_to_py/common/lib/sdc/json/tests/support.tcl create mode 100644 cpp_to_py/common/lib/sdc/json/tests/widget.result create mode 100644 cpp_to_py/common/lib/sdc/json/tests/widget.sort create mode 100755 cpp_to_py/common/lib/sdc/mask.h create mode 100755 cpp_to_py/common/lib/sdc/object.cpp create mode 100755 cpp_to_py/common/lib/sdc/object.h create mode 100644 cpp_to_py/common/lib/sdc/sdc.cpp create mode 100644 cpp_to_py/common/lib/sdc/sdc.h create mode 100755 cpp_to_py/common/lib/sdc/sdc.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.1.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.2.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.3.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.4.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.5.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.6.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.7.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.8.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc1.9.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdc2.0.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdcparser.tcl create mode 100755 cpp_to_py/common/lib/sdc/sdcparsercore.tcl create mode 100755 cpp_to_py/common/lib/sdc/tokenizer.cpp create mode 100755 cpp_to_py/common/lib/sdc/tokenizer.h create mode 100644 cpp_to_py/common/lib/spef/parser-spef.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/LICENSE create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/analyze_cycles.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/counted.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/generic.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/grammar_info.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_guard.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_rules.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_info.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_type.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/analyze.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/apply_mode.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/argv_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/ascii.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/buffer_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/config.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/abnf.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/alphabet.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/changes.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/counter.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/http.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/internal.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf16.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf32.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/integer.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/json.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/parse_tree.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/raw_string.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/rep_one_min_max.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/to_string.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/tracer.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/unescape.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/uri.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/cstream_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/eol_pair.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/file_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/input_error.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alnum.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alpha.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/any.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0_single.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply_single.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/at.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bof.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_help.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_impl.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bytes.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/control.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_crlf_eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/crlf_eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstream_reader.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstring_reader.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_cxxabi.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_nop.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_sanitise.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/disable.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/discard.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/dusel_mode.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/duseltronik.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/enable.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_gcc.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_win.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eof.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eolf.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_posix.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_win32.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_opener.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_reader.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply0.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/identifier.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_apply.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must_else.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_then_else.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/input_pair.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/integer_sequence.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istream_reader.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istring.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/iterator.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_crlf_eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_eol.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_must.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail_pad.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/marker.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/minus.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/must.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/not_at.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/one.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/opt.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad_opt.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_char.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf16.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf32.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pegtl_string.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/plus.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/raise.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/range.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/ranges.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/read_uint.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min_max.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_opt.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/require.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rule_conjunction.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rules.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/seq.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/skip_control.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/sor.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star_must.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/state.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/string.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/three.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/trivial.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/try_catch_type.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/two.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/internal/until.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/istream_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/memory_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/mmap_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/normal.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/nothing.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/parse.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/parse_error.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/position.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/read_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/rewind_mode.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/rules.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/string_input.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/tracking_mode.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/uint16.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/uint32.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/uint64.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/uint8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/utf16.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/utf32.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/utf8.hpp create mode 100644 cpp_to_py/common/lib/spef/pegtl/pegtl/version.hpp create mode 100755 cpp_to_py/common/lib/tokenizer.cpp create mode 100755 cpp_to_py/common/lib/tokenizer.h create mode 100755 cpp_to_py/common/lib/unit.cpp create mode 100755 cpp_to_py/common/lib/unit.h create mode 100755 cpp_to_py/common/lib/units.hpp diff --git a/cpp_to_py/common/db/Cell.cpp b/cpp_to_py/common/db/Cell.cpp index 449603f..fa29f99 100644 --- a/cpp_to_py/common/db/Cell.cpp +++ b/cpp_to_py/common/db/Cell.cpp @@ -3,6 +3,7 @@ #include "DatabaseClass.h" #include "Geometry.h" #include "Pin.h" +#include "common/lib/Liberty.h" using namespace db; diff --git a/cpp_to_py/common/db/Cell.h b/cpp_to_py/common/db/Cell.h index 16443e0..fa2ba97 100644 --- a/cpp_to_py/common/db/Cell.h +++ b/cpp_to_py/common/db/Cell.h @@ -4,6 +4,10 @@ #include #include "Geometry.h" +namespace gt { +class LibertyCell; +} + namespace db { using std::string; @@ -87,6 +91,8 @@ public: bool operator==(const CellType& r) const; bool operator!=(const CellType& r) const { return !(*this == r); } + + gt::LibertyCell* liberty_cell = nullptr; }; class Cell { @@ -116,6 +122,7 @@ public: const std::string& name() const { return _name; } Pin* pin(const std::string& name) const; Pin* pin(unsigned i) const { return _pins[i]; } + std::vector pins() { return _pins; } CellType* ctype() const { return _type; } void ctype(CellType* t); int lx() const; diff --git a/cpp_to_py/common/db/Database.cpp b/cpp_to_py/common/db/Database.cpp index f0f7864..0da009b 100644 --- a/cpp_to_py/common/db/Database.cpp +++ b/cpp_to_py/common/db/Database.cpp @@ -15,6 +15,7 @@ #include "Site.h" #include "SiteMap.h" #include "Via.h" +#include "common/lib/Liberty.h" using namespace db; @@ -63,21 +64,62 @@ void Database::load() { if (setting.LefFile != "") { setting.Format = "lefdef"; readLEF(setting.LefFile); + lef_read = true; } else if ((setting.LefCell != "") && (setting.LefTech != "")) { setting.Format = "lefdef"; readLEF(setting.LefTech); readLEF(setting.LefCell); + lef_read = true; } else if (setting.LefFiles.size() > 0) { setting.Format = "lefdef"; for (auto lef : setting.LefFiles) { readLEF(lef); } + lef_read = true; } + if (setting.CellLib != "") { + auto lib = std::make_shared(); + if (lef_read) { + lib->rawdb = this; + } + lib->read(setting.CellLib); + lib->finish_read(); + cell_libs_[gt::MIN] = lib; + cell_libs_[gt::MAX] = cell_libs_[gt::MIN]; + liberty_read = true; + } else if (setting.CellLib_MIN != "" && setting.CellLib_MAX != "") { + auto lib_min = std::make_shared(); + auto lib_max = std::make_shared(); + if (lef_read) { + lib_min->rawdb = this; + lib_max->rawdb = this; + } + lib_min->read(setting.CellLib_MIN); + lib_max->read(setting.CellLib_MAX); + lib_min->finish_read(); + lib_max->finish_read(); + cell_libs_[gt::MIN] = lib_min; + cell_libs_[gt::MAX] = lib_max; + liberty_read = true; + } else if (setting.LibFiles.size() > 0) { + auto lib = std::make_shared(); + if (lef_read) lib->rawdb = this; + for (auto libfile : setting.LibFiles) { + lib->read(libfile); + } + lib->finish_read(); + cell_libs_[gt::MIN] = lib; + cell_libs_[gt::MAX] = cell_libs_[gt::MIN]; + liberty_read = true; + } + + if (setting.DefFile != "") { setting.Format = "lefdef"; readDEF(setting.DefFile); readDEFPG(setting.DefFile); + def_read = true; } if (setting.Size != "") { @@ -690,9 +732,11 @@ void Database::SetupRowSegments() { } void Database::setup() { - SetupLayers(); + if (def_read) { + SetupLayers(); + SetupFloorplan(); + } SetupCellLibrary(); - SetupFloorplan(); SetupRegions(); if (!setting.liteMode) { SetupSiteMap(); diff --git a/cpp_to_py/common/db/Database.h b/cpp_to_py/common/db/Database.h index ba2bbc6..946e0d7 100644 --- a/cpp_to_py/common/db/Database.h +++ b/cpp_to_py/common/db/Database.h @@ -2,6 +2,8 @@ #include "DatabaseClass.h" #include "Setting.h" +#include "common/lib/Helper.h" + std::string validate_token(std::string& name); namespace db { @@ -39,11 +41,17 @@ public: robin_hood::unordered_map name_iopins; robin_hood::unordered_map name_viatypes; robin_hood::unordered_map name_layers; + + bool lef_read = false; + bool def_read = false; + bool liberty_read = false; bool verilog_read = false; string module_name = ""; VerilogParser* verilog_parser = nullptr; + array, 2> cell_libs_; + vector layers; vector lefsites; vector viatypes; diff --git a/cpp_to_py/common/db/DatabaseClass.h b/cpp_to_py/common/db/DatabaseClass.h index ffa791f..394149e 100644 --- a/cpp_to_py/common/db/DatabaseClass.h +++ b/cpp_to_py/common/db/DatabaseClass.h @@ -4,6 +4,7 @@ #include #include #include +#include #include "common/utils/utils.h" @@ -14,6 +15,7 @@ namespace db { using std::string; using std::vector; +using std::array; class Database; class Rectangle; @@ -44,3 +46,9 @@ class GCellGrid; class BsRouteInfo; class VerilogParser; } // namespace db + +namespace gt { +class CellLib; +class LibertyCell; +class LibertyPort; +} \ No newline at end of file diff --git a/cpp_to_py/common/db/Setting.cpp b/cpp_to_py/common/db/Setting.cpp index e2a6f7c..fdb552f 100644 --- a/cpp_to_py/common/db/Setting.cpp +++ b/cpp_to_py/common/db/Setting.cpp @@ -11,7 +11,13 @@ void Setting::reset() { LefCell = ""; LefTech = ""; LefFiles.clear(); + LibFiles.clear(); Constraints = ""; + + CellLib = ""; + CellLib_MIN = ""; + CellLib_MAX = ""; + Verilog = ""; OutputFile = ""; diff --git a/cpp_to_py/common/db/Setting.h b/cpp_to_py/common/db/Setting.h index 5ff6ebe..44cd534 100644 --- a/cpp_to_py/common/db/Setting.h +++ b/cpp_to_py/common/db/Setting.h @@ -29,10 +29,15 @@ public: std::string LefCell = ""; std::string LefTech = ""; std::vector LefFiles; + std::vector LibFiles; std::string Constraints = ""; std::string Verilog = ""; std::string Size = ""; + + std::string CellLib = ""; + std::string CellLib_MIN = ""; + std::string CellLib_MAX = ""; std::string OutputFile = ""; diff --git a/cpp_to_py/common/lib/EnumNameMap.h b/cpp_to_py/common/lib/EnumNameMap.h new file mode 100644 index 0000000..6ceac8b --- /dev/null +++ b/cpp_to_py/common/lib/EnumNameMap.h @@ -0,0 +1,61 @@ +#pragma once + +#include +#include +#include + +namespace gt { + +using std::initializer_list; +using std::map; +using std::pair; +using std::string; +using std::string_view; + +template +class EnumNameMap { +public: + EnumNameMap(initializer_list> enum_names); + const string find(ENUM key) const; + ENUM find(string name, ENUM unknown_key) const; + void find(string name, ENUM &key, bool &exists) const; + +private: + map enum_map_; + map name_map_; +}; + +template +EnumNameMap::EnumNameMap(initializer_list> enum_names) : enum_map_(enum_names) { + for (const auto &[key, name] : enum_map_) name_map_[name] = key; +} + +template +const string EnumNameMap::find(ENUM key) const { + auto find_iter = enum_map_.find(key); + if (find_iter != enum_map_.end()) + return find_iter->second; + else + return nullptr; +} + +template +void EnumNameMap::find(string name, ENUM &key, bool &exists) const { + auto find_iter = name_map_.find(name); + if (find_iter != name_map_.end()) { + key = find_iter->second; + exists = true; + } else + exists = false; +} + +template +ENUM EnumNameMap::find(string name, ENUM unknown_key) const { + auto find_iter = name_map_.find(name); + if (find_iter != name_map_.end()) + return find_iter->second; + else + return unknown_key; +} + +} // namespace gt diff --git a/cpp_to_py/common/lib/Helper.h b/cpp_to_py/common/lib/Helper.h new file mode 100755 index 0000000..423c0c8 --- /dev/null +++ b/cpp_to_py/common/lib/Helper.h @@ -0,0 +1,86 @@ +#pragma once + +#include +#include +#include + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#if defined(__has_include) && __has_include() +#include +#else +#include +namespace std { +namespace filesystem = experimental::filesystem; +}; +#endif + +#include "common/common.h" +#include "units.hpp" + +namespace gt { + +using namespace std::chrono_literals; +using namespace std::literals::string_literals; + +enum Split { + MIN = 0, + MAX = 1 +}; + +enum Tran { + RISE = 0, + FALL = 1 +}; + +constexpr int MAX_SPLIT = 2; +constexpr int MAX_TRAN = 2; + +constexpr std::initializer_list SPLIT = {MIN, MAX}; +constexpr std::initializer_list TRAN = {RISE, FALL}; +constexpr std::initializer_list> SPLIT_TRAN = {{MIN, RISE}, {MIN, FALL}, {MAX, RISE}, {MAX, FALL}}; + +#define for_each_el(el) for (auto el : SPLIT) +#define for_each_el_rf_if(el, rf, c) \ + for (auto [el, rf] : SPLIT_TRAN) \ + if (c) + +}; // namespace gt diff --git a/cpp_to_py/common/lib/Liberty.cpp b/cpp_to_py/common/lib/Liberty.cpp new file mode 100644 index 0000000..6135beb --- /dev/null +++ b/cpp_to_py/common/lib/Liberty.cpp @@ -0,0 +1,117 @@ + + +#include "Liberty.h" + +namespace gt { + +void CellLib::uncomment(std::vector& buffer) { + auto fsize = buffer.size() > 0 ? buffer.size() - 1 : 0; + + for (size_t i = 0; i < fsize; ++i) { + // Block comment + if (buffer[i] == '/' && buffer[i + 1] == '*') { + buffer[i] = buffer[i + 1] = ' '; + for (i = i + 2; i < fsize; buffer[i++] = ' ') { + if (buffer[i] == '*' && buffer[i + 1] == '/') { + buffer[i] = buffer[i + 1] = ' '; + i = i + 1; + break; + } + } + } + + // Line comment + if (buffer[i] == '/' && buffer[i + 1] == '/') { + buffer[i] = buffer[i + 1] = ' '; + for (i = i + 2; i < fsize; ++i) { + if (buffer[i] == '\n' || buffer[i] == '\r') { + break; + } else + buffer[i] = ' '; + } + } + + // Pond comment + if (buffer[i] == '#') { + buffer[i] = ' '; + for (i = i + 1; i < fsize; ++i) { + if (buffer[i] == '\n' || buffer[i] == '\r') { + break; + } else + buffer[i] = ' '; + } + } + } +} + +void CellLib::tokenize(const std::vector& buf, std::vector& tokens) { + static std::string_view dels = "(),:;/#[]{}*\"\\"; + const char* beg = buf.data(); + const char* end = buf.data() + buf.size(); + + const char* token{nullptr}; + size_t len{0}; + + tokens.clear(); + + for (const char* itr = beg; itr != end && *itr != 0; ++itr) { + if (std::isspace(*itr) || (dels.find(*itr) != std::string_view::npos)) { + if (len > 0) { // Add the current token. + tokens.push_back({token, len}); + token = nullptr; + len = 0; + } + if (*itr == '(' || *itr == ')' || *itr == '{' || *itr == '}') { + tokens.push_back({itr, 1}); + } + } else { + if (len == 0) { + token = itr; + } + ++len; + } + } + + if (len > 0) { + tokens.push_back({token, len}); + } +} + +LibertyCell* CellLib::get_cell(const std::string& name) { + if (auto itr = lib_cells_.find(name); itr == lib_cells_.end()) { + return nullptr; + } else { + return itr->second; + } +} + +int LibertyCell::get_port(const std::string& name) { + if (auto itr = ports_map_.find(name); itr == ports_map_.end()) { + return -1; + } else { + return itr->second; + } +} + +EnumNameMap delay_model_name_map = {{DelayModel::generic_cmos, "generic_cmos"}, + {DelayModel::table_lookup, "table_lookup"}, + {DelayModel::cmos2, "cmos2"}, + {DelayModel::piecewise_cmos, "piecewise_cmos"}, + {DelayModel::dcm, "dcm"}, + {DelayModel::polynomial, "polynomial"}, + {DelayModel::unknown, "unknown"}}; +DelayModel findDelayModel(const std::string model_name) { + return delay_model_name_map.find(model_name, DelayModel::unknown); +} + +EnumNameMap port_direction_name_map = {{CellPortDirection::input, "input"}, + {CellPortDirection::output, "output"}, + {CellPortDirection::inout, "inout"}, + {CellPortDirection::internal, "internal"}, + {CellPortDirection::unknown, "unknown"}}; + +CellPortDirection findPortDirection(const std::string dir_name) { + return port_direction_name_map.find(dir_name, CellPortDirection::unknown); +} + +} // namespace gt \ No newline at end of file diff --git a/cpp_to_py/common/lib/Liberty.h b/cpp_to_py/common/lib/Liberty.h new file mode 100644 index 0000000..1de6381 --- /dev/null +++ b/cpp_to_py/common/lib/Liberty.h @@ -0,0 +1,155 @@ + + +#pragma once +#include +#include +#include +#include +#include + +#include "EnumNameMap.h" +#include "Helper.h" +#include "tokenizer.h" +#include "unit.h" + +using std::optional; +using std::string; +using std::unordered_map; +using std::variant; +using std::vector; + +namespace db { +class Database; +class CellType; +}; // namespace db + +namespace gt { + +class CellLib; +class LibertyCell; +class LibertyPort; +class TimingArc; +struct LutTemplate; +class Lut; + +enum class DelayModel { generic_cmos, table_lookup, cmos2, piecewise_cmos, dcm, polynomial, unknown }; +enum class CellPortDirection { input, output, inout, internal, unknown }; +DelayModel findDelayModel(const std::string model_name); +CellPortDirection findPortDirection(const std::string dir_name); + +class CellLib { +public: + ~CellLib() { logger.info("Destruct celllib"); } + CellLib() = default; + CellLib(db::Database *rawdb_) : rawdb(rawdb_) {} + db::Database *rawdb = nullptr; + db::CellType *cell_type_ = nullptr; + + using token_iterator = std::vector::iterator; + DelayModel delay_model; + string name; + + optional time_unit_; + optional power_unit_; + optional resistance_unit_; + optional capacitance_unit_; + optional current_unit_; + optional voltage_unit_; + + unordered_map> default_values = { + {"default_cell_leakage_power", optional{}}, + {"default_inout_pin_cap", optional{}}, + {"default_input_pin_cap", optional{}}, + {"default_output_pin_cap", optional{}}, + {"default_fanout_load", optional{}}, + {"default_max_fanout", optional{}}, + {"default_max_transition", optional{}}, + {"voltage", optional{}}, + }; + + unordered_map scale_factors = { + {"time", 1.0}, + {"resistance", 1.0}, + {"power", 1.0}, + {"capacitance", 1.0}, + {"current", 1.0}, + {"voltage", 1.0}, + }; + + unordered_map lut_templates_; + unordered_map lib_cells_; + + LutTemplate *get_lut_template(const string &); + LibertyCell *get_cell(const std::string &name); + void read(const string &file); + void finish_read(); + void finish_port_read(LibertyPort *liberty_port); + +public: + LibertyCell *extractLibertyCell(token_iterator &, const token_iterator); + LibertyPort *extractLibertyPort(token_iterator &, const token_iterator, LibertyCell *); + TimingArc *extractTimingArc(token_iterator &, const token_iterator, LibertyPort *); + std::optional extract_operating_conditions(token_iterator &itr, const token_iterator end); + LutTemplate *extract_lut_template(token_iterator &, const token_iterator); + Lut *extract_lut(token_iterator &, const token_iterator); + + void apply_default_values(); + void uncomment(std::vector &); + void tokenize(const std::vector &, std::vector &); +}; + +class LibertyCell { +public: + LibertyCell() = default; + string name; + db:: CellType *cell_type_ = nullptr; + vector ports_; + // map ports_map_; + map ports_map_; + + vector leakage_powers_; + optional leakage_power_; + optional area_; + + bool is_seq_ = false; + int num_bits_ = 0; + +public: + int get_port(const std::string &name); +}; + +class LibertyPort { +public: + LibertyPort() = default; + +public: + string name; + LibertyCell *cell_; + CellPortDirection direction_; + optional port_capacitance_[3]; + + bool is_clock_ = false; + bool is_bundle_ = false; + vector member_ports_; + + vector timing_arcs_; + map timing_arcs_map_; + vector timing_arcs_non_cond_non_bundle_; + + + + + // optional capacitance; + // optional fall_capacitance; + // optional rise_capacitance; + + optional fanout_load; + optional max_fanout; + optional min_fanout; + optional max_capacitance; + optional min_capacitance; + optional max_transition; + optional min_transition; +}; + +}; // namespace gt diff --git a/cpp_to_py/common/lib/LibtertyReader.cpp b/cpp_to_py/common/lib/LibtertyReader.cpp new file mode 100644 index 0000000..8c13cb1 --- /dev/null +++ b/cpp_to_py/common/lib/LibtertyReader.cpp @@ -0,0 +1,561 @@ +#include +#include + +#include "Liberty.h" +#include "Timing.h" +#include "common/db/Cell.h" +#include "common/db/Database.h" +#include "Lut.h" + +using std::ifstream; + +namespace gt { + +LutTemplate* CellLib::get_lut_template(const std::string& name) { + if (auto itr = lut_templates_.find(name); itr == lut_templates_.end()) { + return nullptr; + } else { + return itr->second; + } +} + +std::optional CellLib::extract_operating_conditions(token_iterator& itr, const token_iterator end) { + std::optional voltage; + std::string operating_condition_name; + if (itr = on_next_parentheses(itr, end, [&](auto& name) mutable { operating_condition_name = name; }); itr == end) { + logger.info("can't find lut template name"); + } + // Extract the lut template group + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("can't find lut template group brace '{'"); + } + + int stack = 1; + while (stack && ++itr != end) { + // variable 1 + if (*itr == "voltage") { // Read the variable. + + if (++itr == end) { + logger.info("volate error in operating_conditions template %s", operating_condition_name); + } + + voltage = std::strtof(std::string(*itr).c_str(), nullptr); + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + if (stack != 0 || *itr != "}") { + logger.info("can't find operating_conditions template group brace '}'"); + } + + return voltage; +} + +LutTemplate* CellLib::extract_lut_template(token_iterator& itr, const token_iterator end) { + LutTemplate* lt = new LutTemplate(); + + if (itr = on_next_parentheses(itr, end, [&](auto& name) mutable { lt->name = name; }); itr == end) { + logger.info("can't find lut template name"); + } + + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("can't find lut template group brace '{'"); + } + + int stack = 1; + while (stack && ++itr != end) { + if (*itr == "variable_1") { + if (++itr == end) { + logger.info("variable_1 error in lut template %s", lt->name.c_str()); + } + + if (auto vitr = lut_vars.find(*itr); vitr != lut_vars.end()) { + lt->variable1 = vitr->second; + } else { + logger.warning( + "unexpected lut template variable %.*s", static_cast((*itr).length()), (*itr).data()); + } + } else if (*itr == "variable_2") { + if (++itr == end) { + logger.info("variable_2 error in lut template %s", lt->name.c_str()); + } + if (auto vitr = lut_vars.find(*itr); vitr != lut_vars.end()) { + lt->variable2 = vitr->second; + } else { + logger.warning( + "unexpected lut template variable %.*s", static_cast((*itr).length()), (*itr).data()); + } + } else if (*itr == "index_1") { + itr = on_next_parentheses( + itr, end, [&](auto& str) { lt->indices1.push_back(std::strtof(str.data(), nullptr)); }); + } else if (*itr == "index_2") { + itr = on_next_parentheses( + itr, end, [&](auto& str) { lt->indices2.push_back(std::strtof(str.data(), nullptr)); }); + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + if (stack != 0 || *itr != "}") { + logger.info("can't find lut template brace '}'"); + } + + lut_templates_[lt->name] = lt; + + return lt; +} + +Lut* CellLib::extract_lut(token_iterator& itr, const token_iterator end) { + Lut* lut = new Lut(); + + if (itr = on_next_parentheses(itr, end, [&](auto& name) mutable { lut->name = name; }); itr == end) { + logger.info("can't find lut template name"); + } + + lut->lut_template = get_lut_template(lut->name); + + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("group brace '{' error in lut ", lut->name); + } + + int stack = 1; + size_t size1 = 1; + size_t size2 = 1; + while (stack && ++itr != end) { + if (*itr == "index_1") { + itr = on_next_parentheses( + itr, end, [&](auto& v) mutable { lut->indices1.push_back(std::strtof(v.data(), nullptr)); }); + + if (lut->indices1.size() == 0) { + logger.info("syntax error in %s index_1", lut->name); + } + + size1 = lut->indices1.size(); + } else if (*itr == "index_2") { + itr = on_next_parentheses( + itr, end, [&](auto& v) mutable { lut->indices2.push_back(std::strtof(v.data(), nullptr)); }); + + if (lut->indices2.size() == 0) { + logger.info("syntax error in %s index_2", lut->name); + } + + size2 = lut->indices2.size(); + } else if (*itr == "values") { + if (lut->indices1.empty()) { + if (size1 != 1) { + logger.info("empty indices1 in non-scalar lut %s", lut->name); + } + lut->indices1.resize(size1); + } + + if (lut->indices2.empty()) { + if (size2 != 1) { + logger.info("empty indices2 in non-scalar lut %s", lut->name); + } + lut->indices2.resize(size2); + } + + lut->table.resize(size1 * size2); + + int id{0}; + itr = on_next_parentheses( + itr, end, [&](auto& v) mutable { lut->table[id++] = std::strtof(v.data(), nullptr); }); + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + lut->set_ = true; + + if (stack != 0 || *itr != "}") { + logger.info("can't find group brace '}' in lut "); + } + + return lut; +} + +TimingArc* CellLib::extractTimingArc(token_iterator& itr, const token_iterator end, LibertyPort* cell_port) { + TimingArc* timing_arc = new TimingArc(); + timing_arc->liberty_port_ = cell_port; + cell_port->timing_arcs_.push_back(timing_arc); + + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("can't find group brace '{' in timing"); + } + int stack = 1; + while (stack && ++itr != end) { + if (*itr == "cell_fall") { + timing_arc->cell_delay_[1] = extract_lut(itr, end); + } else if (*itr == "cell_rise") { + timing_arc->cell_delay_[0] = extract_lut(itr, end); + } else if (*itr == "fall_transition") { + timing_arc->transition_[1] = extract_lut(itr, end); + } else if (*itr == "rise_transition") { + timing_arc->transition_[0] = extract_lut(itr, end); + } else if (*itr == "fall_constraint") { + timing_arc->constraint_[1] = extract_lut(itr, end); + } else if (*itr == "rise_constraint") { + timing_arc->constraint_[0] = extract_lut(itr, end); + } else if (*itr == "timing_sense") { + logger.infoif(++itr == end, "can't get the timing_sense in cellpin "); + timing_arc->timing_sense_ = findTimingSense(string(*itr)); + } else if (*itr == "timing_type") { + logger.infoif(++itr == end, "can't get the timing_type in cellpin "); + timing_arc->timing_type_ = findTimingType(string(*itr)); + } else if (*itr == "sdf_cond") { + logger.infoif(++itr == end, "can't get the sdf_cond in cellpin "); + timing_arc->sdf_cond_ = *itr; + timing_arc->is_cond_ = true; + } else if (*itr == "related_pin") { + logger.infoif(++itr == end, "can't get the related port "); + timing_arc->related_port_name_ = *itr; + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + if (stack != 0 || *itr != "}") { + logger.info("can't find group brace '}' in cell timing "); + } + + return timing_arc; +} + +LibertyPort* CellLib::extractLibertyPort(token_iterator& itr, const token_iterator end, LibertyCell* liberty_cell) { + LibertyPort* cell_port = new LibertyPort(); + cell_port->cell_ = liberty_cell; + + on_next_parentheses(itr, end, [&](auto& name) mutable { cell_port->name = name; }); + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("can't find group brace '{' in port"); + } + + int stack = 1; + while (stack && ++itr != end) { + if (*itr == "direction") { + logger.infoif(++itr == end, "can't get direction in cell ", cell_port->name); + cell_port->direction_ = findPortDirection(string(*itr)); + } else if (*itr == "capacitance") { + logger.infoif(++itr == end, "can't get the capacitance in cellpin"); + cell_port->port_capacitance_[2] = std::strtof(itr->data(), nullptr); + } else if (*itr == "fall_capacitance") { + logger.infoif(++itr == end, "can't get fall_capacitance in cellpin"); + cell_port->port_capacitance_[1] = std::strtof(itr->data(), nullptr); + } else if (*itr == "rise_capacitance") { + logger.infoif(++itr == end, "can't get rise_capacitance in cellpin"); + cell_port->port_capacitance_[0] = std::strtof(itr->data(), nullptr); + } else if (*itr == "max_capacitance") { + logger.infoif(++itr == end, "can't get the max_capacitance in cellpin"); + cell_port->max_capacitance = std::strtof(itr->data(), nullptr); + } else if (*itr == "min_capacitance") { + logger.infoif(++itr == end, "can't get the min_capacitance in cellpin"); + cell_port->min_capacitance = std::strtof(itr->data(), nullptr); + } else if (*itr == "max_transition") { + logger.infoif(++itr == end, "can't get the max_transition in cellpin"); + cell_port->max_transition = std::strtof(itr->data(), nullptr); + } else if (*itr == "min_transition") { + logger.infoif(++itr == end, "can't get the min_transition in cellpin"); + cell_port->min_transition = std::strtof(itr->data(), nullptr); + } else if (*itr == "fanout_load") { + logger.infoif(++itr == end, "can't get fanout_load in cellpin"); + cell_port->fanout_load = std::strtof(itr->data(), nullptr); + } else if (*itr == "max_fanout") { + logger.infoif(++itr == end, "can't get max_fanout in cellpin"); + cell_port->max_fanout = std::strtof(itr->data(), nullptr); + } else if (*itr == "min_fanout") { + logger.infoif(++itr == end, "can't get min_fanout in cellpin"); + cell_port->min_fanout = std::strtof(itr->data(), nullptr); + } else if (*itr == "clock") { + logger.infoif(++itr == end, "can't get the clock status in cellpin"); + cell_port->is_clock_ = (*itr == "true") ? true : false; + } else if (*itr == "timing") { + TimingArc* timing_arc_ = extractTimingArc(itr, end, cell_port); + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + if (stack != 0 || *itr != "}") { + logger.info("can't find group brace '}' in cell port"); + } + + return cell_port; +} + +LibertyCell* CellLib::extractLibertyCell(token_iterator& itr, const token_iterator end) { + LibertyCell* liberty_cell = new LibertyCell(); + + on_next_parentheses(itr, end, [&](auto& name) mutable { liberty_cell->name = name; }); + if (itr = std::find(itr, end, "{"); itr == end) { + logger.info("can't find group brace '{' in cell %s", liberty_cell->name); + } + + int stack = 1; + int stage = -1; + while (stack && ++itr != end) { + if (*itr == "cell_leakage_power") { + logger.infoif(++itr == end, "can't get the cell_leakage_power "); + liberty_cell->leakage_power_ = scale_factors["power"] * std::strtof(itr->data(), nullptr); + } + if (*itr == "leakage_power") { + itr = std::find(itr, end, "{"); + int stack_1 = 1; + while (stack_1 && ++itr != end) { + if (*itr == "value") { + logger.infoif(++itr == end, "can't get value in cell %s", liberty_cell->name); + liberty_cell->leakage_powers_.push_back(std::strtof(itr->data(), nullptr)); + } else if (*itr == "}") + stack_1--; + else if (*itr == "{") + stack_1++; + } + } else if (*itr == "area") { + logger.infoif(++itr == end, "can't get area in cell %s", liberty_cell->name); + liberty_cell->area_ = std::strtof(itr->data(), nullptr); + } else if (*itr == "pin") { + logger.infoif(++itr == end, "can't get port in cell %s", liberty_cell->name); + LibertyPort* cell_port_ = extractLibertyPort(itr, end, liberty_cell); + liberty_cell->ports_.push_back(cell_port_); + } else if (*itr == "bundle") { + LibertyPort* cell_port_bundle = new LibertyPort(); + liberty_cell->ports_.push_back(cell_port_bundle); + cell_port_bundle->cell_ = liberty_cell; + cell_port_bundle->is_bundle_ = true; + + on_next_parentheses(itr, end, [&](auto& name) mutable { cell_port_bundle->name = name; }); + itr = std::find(itr, end, "{"); + + int stack_1 = 1; + while (stack_1 && ++itr != end) { + if (*itr == "direction") { + logger.infoif(++itr == end, "can't get direction in cell %s", liberty_cell->name); + cell_port_bundle->direction_ = findPortDirection(string(*itr)); + } else if (*itr == "pin") { + LibertyPort* cell_port_ = extractLibertyPort(itr, end, liberty_cell); + cell_port_bundle->member_ports_.push_back(cell_port_); + } else if (*itr == "}") + stack_1--; + else if (*itr == "{") + stack_1++; + } + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } + + if (stack != 0 || *itr != "}") { + logger.info("can't find group brace '}' in cellpin "); + } + return liberty_cell; +} + +void CellLib::read(const std::string& file) { + // process .gz file with zlib + std::vector buffer; + if (file.substr(file.find_last_of(".") + 1) == "gz") { + logger.info("reading gzip celllib %s ...", file.c_str()); + gzFile fs = gzopen(file.c_str(), "rb"); + if (!fs) { + logger.error("cannot open verilog file: %s", file.c_str()); + } + char buf[1024]; + int len = 0; + while ((len = gzread(fs, buf, 1024)) > 0) { + buffer.insert(buffer.end(), buf, buf + len); + } + gzclose(fs); + buffer.push_back(0); + } else { + ifstream fs(file.c_str(), std::ios::ate); + if (!fs.good()) { + logger.error("cannot open liberty file: %s", file.c_str()); + } + logger.info("reading celllib %s ...", file.c_str()); + + size_t fsize = fs.tellg(); + fs.seekg(0, std::ios::beg); + buffer.resize(fsize + 1); + fs.read(buffer.data(), fsize); + buffer[fsize] = 0; + } + + // get tokens + std::vector tokens; + tokens.reserve(buffer.size() / sizeof(std::string)); + + uncomment(buffer); + tokenize(buffer, tokens); + + // Set up the iterator + auto itr = tokens.begin(); + auto end = tokens.end(); + + // Read the library name. + if (itr = std::find(itr, end, "library"); itr == end) { + logger.error("can't find keyword %s", "library"); + } + + if (itr = on_next_parentheses(itr, end, [&](auto& str) mutable { name = str; }); itr == end) { + logger.info("can't find library name"); + } + + if (itr = std::find(itr, tokens.end(), "{"); itr == tokens.end()) { + logger.info("can't find library group symbol '{'"); + } + + int stack = 1; + + while (stack && ++itr != end) { + if (*itr == "lu_table_template") { + auto lut = extract_lut_template(itr, end); + } else if (*itr == "power_lut_template") { + auto lut = extract_lut_template(itr, end); + } else if (*itr == "delay_model") { + logger.infoif(++itr == end, "syntax error in delay_model"); + delay_model = findDelayModel(string(*itr)); + } else if (*itr == "default_cell_leakage_power" || *itr == "default_inout_pin_cap" || + *itr == "default_input_pin_cap" || *itr == "default_output_pin_cap" || + *itr == "default_fanout_load" || *itr == "default_max_fanout" || *itr == "default_max_transition") { + logger.infoif(++itr == end, "syntax error"); + default_values[std::string(*itr)] = std::strtof(itr->data(), nullptr); + } else if (*itr == "operating_conditions") { + logger.infoif(++itr == end, "syntax error"); + default_values["voltage"] = extract_operating_conditions(itr, end); + } else if (*itr == "time_unit") { + logger.infoif(++itr == end, "syntax error"); + time_unit_ = make_time_unit(*itr); + } else if (*itr == "voltage_unit") { + logger.infoif(++itr == end, "syntax error"); + voltage_unit_ = make_voltage_unit(*itr); + } else if (*itr == "current_unit") { + logger.infoif(++itr == end, "syntax error"); + current_unit_ = make_current_unit(*itr); + } else if (*itr == "pulling_resistance_unit") { + logger.infoif(++itr == end, "syntax error"); + resistance_unit_ = make_resistance_unit(*itr); + } else if (*itr == "capacitive_load_unit") { + string unit; + on_next_parentheses(itr, end, [&](auto& str) mutable { unit += str; }); + capacitance_unit_ = make_capacitance_unit(unit); + } else if (*itr == "leakage_power_unit") { + logger.infoif(++itr == end, "syntax error"); + auto current_power_unit_ = make_power_unit(*itr); + if (!power_unit_) power_unit_ = current_power_unit_; + scale_factors["power"] = *current_power_unit_ / *power_unit_; + } else if (*itr == "cell") { + LibertyCell* libterty_cell = extractLibertyCell(itr, end); + lib_cells_[libterty_cell->name] = libterty_cell; + } else if (*itr == "}") { + stack--; + } else if (*itr == "{") { + stack++; + } else { + // undefined token TODO: + } + } +} + +void CellLib::finish_port_read(LibertyPort* liberty_port) { + for (TimingArc* timing_arc : liberty_port->timing_arcs_) { + if (timing_arc->related_port_name_.empty()) { + logger.warning("timing arc %s.%s.%s has no related pin", + liberty_port->cell_->name.c_str(), + liberty_port->name.c_str(), + timing_arc->timing_type_); + continue; + } + if (auto related_port = liberty_port->cell_->get_port(timing_arc->related_port_name_); + related_port == -1) { + logger.warning("timing arc %s.%s.%s has no related pin", + liberty_port->cell_->name.c_str(), + liberty_port->name.c_str(), + timing_arc->timing_type_); + } else { + timing_arc->from_port_ = liberty_port->cell_->ports_[related_port];; + } + timing_arc->to_port_ = timing_arc->liberty_port_; + } + + for (TimingArc* timing_arc : liberty_port->timing_arcs_) { + timing_arc->encode_str_ = timing_arc->encode_arc(); + if (liberty_port->timing_arcs_map_.find(timing_arc->encode_str_) != liberty_port->timing_arcs_map_.end()) { + TimingArc* old_timing_arc = liberty_port->timing_arcs_map_[timing_arc->encode_str_]; + if (!timing_arc->is_cond_) { + liberty_port->timing_arcs_map_[timing_arc->encode_str_] = timing_arc; + } + } else + liberty_port->timing_arcs_map_[timing_arc->encode_str_] = timing_arc; + } +} + +void CellLib::finish_read() { + for (auto [name, liberty_cell] : lib_cells_) { + db::CellType* lef_cell_type = rawdb->getCellType(name); + if (lef_cell_type == nullptr) { + logger.warning("cell %s not found in lef", name.c_str()); + continue; + } else { + lef_cell_type->liberty_cell = liberty_cell; + liberty_cell->cell_type_ = lef_cell_type; + } + // sort port by name + std::sort(liberty_cell->ports_.begin(), + liberty_cell->ports_.end(), + [](const LibertyPort* a, const LibertyPort* b) { return a->name < b->name; }); + + for (int i = 0; i < liberty_cell->ports_.size(); i++) { + liberty_cell->ports_map_[liberty_cell->ports_[i]->name] = i; + } + + for (auto port : liberty_cell->ports_) { + if (port->is_clock_) liberty_cell->is_seq_ = true; + if (port->is_bundle_) { + for (auto member_port : port->member_ports_) { + finish_port_read(member_port); + } + } else + finish_port_read(port); + } + + for (auto port : liberty_cell->ports_) { + LibertyPort* non_bundle_port; + if (port->is_bundle_) { + non_bundle_port = port->member_ports_[0]; + } else + non_bundle_port = port; + for (auto kvp : non_bundle_port->timing_arcs_map_) { + // string encode_str = kvp.first; + // std::cout << encode_str << std::endl; + TimingArc* timing_arc = kvp.second; + port->timing_arcs_non_cond_non_bundle_.push_back(timing_arc); + } + } + } +} + +}; // namespace gt diff --git a/cpp_to_py/common/lib/Lut.cpp b/cpp_to_py/common/lib/Lut.cpp new file mode 100755 index 0000000..4d83580 --- /dev/null +++ b/cpp_to_py/common/lib/Lut.cpp @@ -0,0 +1,32 @@ +#include "Lut.h" + +namespace gt { + +bool is_time_lut_var(LutVar v) { + switch (v) { + case LutVar::INPUT_NET_TRANSITION: + case LutVar::CONSTRAINED_PIN_TRANSITION: + case LutVar::RELATED_PIN_TRANSITION: + case LutVar::INPUT_TRANSITION_TIME: + return true; + break; + + default: + return false; + break; + } +} + +bool is_capacitance_lut_var(LutVar v) { + switch (v) { + case LutVar::TOTAL_OUTPUT_NET_CAPACITANCE: + return true; + break; + + default: + return false; + break; + } +} + +}; // namespace gt diff --git a/cpp_to_py/common/lib/Lut.h b/cpp_to_py/common/lib/Lut.h new file mode 100755 index 0000000..6f10958 --- /dev/null +++ b/cpp_to_py/common/lib/Lut.h @@ -0,0 +1,56 @@ + +#pragma once +#include "common/common.h" +#include "common/lib/Helper.h" + +namespace gt { + +enum class LutVar { + TOTAL_OUTPUT_NET_CAPACITANCE = 0, + INPUT_NET_TRANSITION = 1, + CONSTRAINED_PIN_TRANSITION = 2, + RELATED_PIN_TRANSITION = 3, + INPUT_TRANSITION_TIME = 4, +}; + +inline const std::unordered_map lut_vars{ + {"total_output_net_capacitance", LutVar::TOTAL_OUTPUT_NET_CAPACITANCE}, + {"input_net_transition", LutVar::INPUT_NET_TRANSITION}, + {"constrained_pin_transition", LutVar::CONSTRAINED_PIN_TRANSITION}, + {"related_pin_transition", LutVar::RELATED_PIN_TRANSITION}, + {"input_transition_timing", LutVar::INPUT_TRANSITION_TIME}, + {"input_transition_time", LutVar::INPUT_TRANSITION_TIME}}; + +bool is_time_lut_var(LutVar); +bool is_capacitance_lut_var(LutVar); + +struct LutTemplate { + LutTemplate() = default; + + std::string name; + + std::optional variable1; + std::optional variable2; + + std::vector indices1; + std::vector indices2; + + int id = -1; +}; + +class Lut { +public: + Lut() = default; + + std::string name; + + std::vector indices1; + std::vector indices2; + std::vector table; + + const LutTemplate* lut_template{nullptr}; + + bool set_ = false; +}; + +}; // namespace gt diff --git a/cpp_to_py/common/lib/Timing.cpp b/cpp_to_py/common/lib/Timing.cpp new file mode 100755 index 0000000..7267a8b --- /dev/null +++ b/cpp_to_py/common/lib/Timing.cpp @@ -0,0 +1,164 @@ +#include "Timing.h" +#include "Lut.h" +#include "Liberty.h" + +namespace gt { + +TimingArc::TimingArc() { + for (int i = 0; i < MAX_TRAN; i++) { + cell_delay_[i] = new Lut(); + transition_[i] = new Lut(); + constraint_[i] = new Lut(); + } +} + +bool TimingArc::is_constraint() const { + switch (timing_type_) { + case TimingType::removal_rising: + case TimingType::removal_falling: + case TimingType::recovery_rising: + case TimingType::recovery_falling: + case TimingType::setup_rising: + case TimingType::setup_falling: + case TimingType::hold_rising: + case TimingType::hold_falling: + case TimingType::non_seq_setup_rising: + case TimingType::non_seq_setup_falling: + case TimingType::non_seq_hold_rising: + case TimingType::non_seq_hold_falling: + return true; + break; + default: + return false; + break; + } +} + +bool TimingArc::is_min_constraint() const { + switch (timing_type_) { + case TimingType::hold_rising: + case TimingType::hold_falling: + case TimingType::non_seq_hold_rising: + case TimingType::non_seq_hold_falling: + case TimingType::removal_rising: + case TimingType::removal_falling: + return true; + break; + + default: + return false; + break; + } +} + +bool TimingArc::is_max_constraint() const { + switch (timing_type_) { + case TimingType::setup_rising: + case TimingType::setup_falling: + case TimingType::non_seq_setup_rising: + case TimingType::non_seq_setup_falling: + case TimingType::recovery_rising: + case TimingType::recovery_falling: + return true; + break; + + default: + return false; + break; + } +} + +bool TimingArc::is_falling_edge_triggered() const { + switch (timing_type_) { + case TimingType::setup_falling: + case TimingType::hold_falling: + case TimingType::removal_falling: + case TimingType::recovery_falling: + case TimingType::falling_edge: + return true; + break; + + default: + return false; + break; + }; +} + +bool TimingArc::is_rising_edge_triggered() const { + switch (timing_type_) { + case TimingType::setup_rising: + case TimingType::hold_rising: + case TimingType::removal_rising: + case TimingType::recovery_rising: + case TimingType::rising_edge: + return true; + break; + + default: + return false; + break; + }; +} + +// encode TimingType TimingSense from_port_name to_port_name to remove duplicate +string TimingArc::encode_arc() { + int max_type_shift = std::ceil(std::log2(static_cast(TimingType::unknown))); + int encode = (static_cast(timing_sense_) << max_type_shift) | static_cast(timing_type_); + string encode_str = std::to_string(encode); + encode_str += "_" + from_port_->name + "_" + to_port_->name; + return encode_str; +} + + +EnumNameMap timing_sense_name_map = {{TimingSense::non_unate, "non_unate"}, + {TimingSense::positive_unate, "positive_unate"}, + {TimingSense::negative_unate, "negative_unate"}, + {TimingSense::unknown, "unknown"}}; + +TimingSense findTimingSense(const std::string sense_name) { + return timing_sense_name_map.find(sense_name, TimingSense::unknown); +} + +EnumNameMap timing_type_name_map = {{TimingType::clear, "clear"}, + {TimingType::combinational, "combinational"}, + {TimingType::combinational_fall, "combinational_fall"}, + {TimingType::combinational_rise, "combinational_rise"}, + {TimingType::falling_edge, "falling_edge"}, + {TimingType::hold_falling, "hold_falling"}, + {TimingType::hold_rising, "hold_rising"}, + {TimingType::min_pulse_width, "min_pulse_width"}, + {TimingType::minimum_period, "minimum_period"}, + {TimingType::nochange_high_high, "nochange_high_high"}, + {TimingType::nochange_high_low, "nochange_high_low"}, + {TimingType::nochange_low_high, "nochange_low_high"}, + {TimingType::nochange_low_low, "nochange_low_low"}, + {TimingType::non_seq_hold_falling, "non_seq_hold_falling"}, + {TimingType::non_seq_hold_rising, "non_seq_hold_rising"}, + {TimingType::non_seq_setup_falling, "non_seq_setup_falling"}, + {TimingType::non_seq_setup_rising, "non_seq_setup_rising"}, + {TimingType::preset, "preset"}, + {TimingType::recovery_falling, "recovery_falling"}, + {TimingType::recovery_rising, "recovery_rising"}, + {TimingType::removal_falling, "removal_falling"}, + {TimingType::removal_rising, "removal_rising"}, + {TimingType::retaining_time, "retaining_time"}, + {TimingType::rising_edge, "rising_edge"}, + {TimingType::setup_falling, "setup_falling"}, + {TimingType::setup_rising, "setup_rising"}, + {TimingType::skew_falling, "skew_falling"}, + {TimingType::skew_rising, "skew_rising"}, + {TimingType::three_state_disable, "three_state_disable"}, + {TimingType::three_state_disable_fall, "three_state_disable_fall"}, + {TimingType::three_state_disable_rise, "three_state_disable_rise"}, + {TimingType::three_state_enable, "three_state_enable"}, + {TimingType::three_state_enable_fall, "three_state_enable_fall"}, + {TimingType::three_state_enable_rise, "three_state_enable_rise"}, + {TimingType::min_clock_tree_path, "min_clock_tree_path"}, + {TimingType::max_clock_tree_path, "max_clock_tree_path"}, + {TimingType::unknown, "unknown"}}; + +TimingType findTimingType(const std::string type_name) { + return timing_type_name_map.find(type_name, TimingType::unknown); +} + +}; // namespace gt diff --git a/cpp_to_py/common/lib/Timing.h b/cpp_to_py/common/lib/Timing.h new file mode 100755 index 0000000..75c408b --- /dev/null +++ b/cpp_to_py/common/lib/Timing.h @@ -0,0 +1,95 @@ +#pragma once +#include + +#include "EnumNameMap.h" +#include "Helper.h" +using std::string; + +namespace gt { + +class LibertyCell; +class LibertyPort; +class TimingArc; +struct LutTemplate; +class Lut; + +enum class TimingSense { non_unate, positive_unate, negative_unate, unknown }; + +enum class TimingType { + clear, + combinational, + combinational_fall, + combinational_rise, + falling_edge, + hold_falling, + hold_rising, + min_pulse_width, + minimum_period, + nochange_high_high, + nochange_high_low, + nochange_low_high, + nochange_low_low, + non_seq_hold_falling, + non_seq_hold_rising, + non_seq_setup_falling, + non_seq_setup_rising, + preset, + recovery_falling, + recovery_rising, + removal_falling, + removal_rising, + retaining_time, + rising_edge, + setup_falling, + setup_rising, + skew_falling, + skew_rising, + three_state_disable, + three_state_disable_fall, + three_state_disable_rise, + three_state_enable, + three_state_enable_fall, + three_state_enable_rise, + min_clock_tree_path, + max_clock_tree_path, + unknown +}; + +TimingSense findTimingSense(const std::string sense_name); +TimingType findTimingType(const std::string type_name); + +class TimingArc { +public: + TimingArc(); + + // TimingArc(TimingArcSet* set, LibertyPort* from, LibertyPort* to, Tran irf, Tran orf); + int id = -1; + string encode_str_; + + LibertyCell* cell_; + LibertyPort* liberty_port_; + + TimingType timing_type_ = TimingType::unknown; + TimingSense timing_sense_ = TimingSense::unknown; + + string related_port_name_; + LibertyPort* from_port_; + LibertyPort* to_port_; + + string sdf_cond_; + bool is_cond_ = false; + // TimingArcSet* timing_arc_set_; + + Lut* cell_delay_[MAX_TRAN]; + Lut* transition_[MAX_TRAN]; + Lut* constraint_[MAX_TRAN]; + + string encode_arc(); + bool is_constraint() const; + bool is_min_constraint() const; + bool is_max_constraint() const; + bool is_rising_edge_triggered() const; + bool is_falling_edge_triggered() const; +}; + +}; // namespace gt diff --git a/cpp_to_py/common/lib/sdc/json.hpp b/cpp_to_py/common/lib/sdc/json.hpp new file mode 100755 index 0000000..a70aaf8 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json.hpp @@ -0,0 +1,25447 @@ +/* + __ _____ _____ _____ + __| | __| | | | JSON for Modern C++ +| | |__ | | | | | | version 3.9.1 +|_____|_____|_____|_|___| https://github.com/nlohmann/json + +Licensed under the MIT License . +SPDX-License-Identifier: MIT +Copyright (c) 2013-2019 Niels Lohmann . + +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. +*/ + +#ifndef INCLUDE_NLOHMANN_JSON_HPP_ +#define INCLUDE_NLOHMANN_JSON_HPP_ + +#define NLOHMANN_JSON_VERSION_MAJOR 3 +#define NLOHMANN_JSON_VERSION_MINOR 9 +#define NLOHMANN_JSON_VERSION_PATCH 1 + +#include // all_of, find, for_each +#include // nullptr_t, ptrdiff_t, size_t +#include // hash, less +#include // initializer_list +#include // istream, ostream +#include // random_access_iterator_tag +#include // unique_ptr +#include // accumulate +#include // string, stoi, to_string +#include // declval, forward, move, pair, swap +#include // vector + +// #include + + +#include + +// #include + + +#include // transform +#include // array +#include // forward_list +#include // inserter, front_inserter, end +#include // map +#include // string +#include // tuple, make_tuple +#include // is_arithmetic, is_same, is_enum, underlying_type, is_convertible +#include // unordered_map +#include // pair, declval +#include // valarray + +// #include + + +#include // exception +#include // runtime_error +#include // to_string + +// #include + + +#include // size_t + +namespace nlohmann +{ +namespace detail +{ +/// struct to capture the start position of the current token +struct position_t +{ + /// the total number of characters read + std::size_t chars_read_total = 0; + /// the number of characters read in the current line + std::size_t chars_read_current_line = 0; + /// the number of lines read + std::size_t lines_read = 0; + + /// conversion to size_t to preserve SAX interface + constexpr operator size_t() const + { + return chars_read_total; + } +}; + +} // namespace detail +} // namespace nlohmann + +// #include + + +#include // pair +// #include +/* Hedley - https://nemequ.github.io/hedley + * Created by Evan Nemerson + * + * To the extent possible under law, the author(s) have dedicated all + * copyright and related and neighboring rights to this software to + * the public domain worldwide. This software is distributed without + * any warranty. + * + * For details, see . + * SPDX-License-Identifier: CC0-1.0 + */ + +#if !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < 13) +#if defined(JSON_HEDLEY_VERSION) + #undef JSON_HEDLEY_VERSION +#endif +#define JSON_HEDLEY_VERSION 13 + +#if defined(JSON_HEDLEY_STRINGIFY_EX) + #undef JSON_HEDLEY_STRINGIFY_EX +#endif +#define JSON_HEDLEY_STRINGIFY_EX(x) #x + +#if defined(JSON_HEDLEY_STRINGIFY) + #undef JSON_HEDLEY_STRINGIFY +#endif +#define JSON_HEDLEY_STRINGIFY(x) JSON_HEDLEY_STRINGIFY_EX(x) + +#if defined(JSON_HEDLEY_CONCAT_EX) + #undef JSON_HEDLEY_CONCAT_EX +#endif +#define JSON_HEDLEY_CONCAT_EX(a,b) a##b + +#if defined(JSON_HEDLEY_CONCAT) + #undef JSON_HEDLEY_CONCAT +#endif +#define JSON_HEDLEY_CONCAT(a,b) JSON_HEDLEY_CONCAT_EX(a,b) + +#if defined(JSON_HEDLEY_CONCAT3_EX) + #undef JSON_HEDLEY_CONCAT3_EX +#endif +#define JSON_HEDLEY_CONCAT3_EX(a,b,c) a##b##c + +#if defined(JSON_HEDLEY_CONCAT3) + #undef JSON_HEDLEY_CONCAT3 +#endif +#define JSON_HEDLEY_CONCAT3(a,b,c) JSON_HEDLEY_CONCAT3_EX(a,b,c) + +#if defined(JSON_HEDLEY_VERSION_ENCODE) + #undef JSON_HEDLEY_VERSION_ENCODE +#endif +#define JSON_HEDLEY_VERSION_ENCODE(major,minor,revision) (((major) * 1000000) + ((minor) * 1000) + (revision)) + +#if defined(JSON_HEDLEY_VERSION_DECODE_MAJOR) + #undef JSON_HEDLEY_VERSION_DECODE_MAJOR +#endif +#define JSON_HEDLEY_VERSION_DECODE_MAJOR(version) ((version) / 1000000) + +#if defined(JSON_HEDLEY_VERSION_DECODE_MINOR) + #undef JSON_HEDLEY_VERSION_DECODE_MINOR +#endif +#define JSON_HEDLEY_VERSION_DECODE_MINOR(version) (((version) % 1000000) / 1000) + +#if defined(JSON_HEDLEY_VERSION_DECODE_REVISION) + #undef JSON_HEDLEY_VERSION_DECODE_REVISION +#endif +#define JSON_HEDLEY_VERSION_DECODE_REVISION(version) ((version) % 1000) + +#if defined(JSON_HEDLEY_GNUC_VERSION) + #undef JSON_HEDLEY_GNUC_VERSION +#endif +#if defined(__GNUC__) && defined(__GNUC_PATCHLEVEL__) + #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__) +#elif defined(__GNUC__) + #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, 0) +#endif + +#if defined(JSON_HEDLEY_GNUC_VERSION_CHECK) + #undef JSON_HEDLEY_GNUC_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_GNUC_VERSION) + #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GNUC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_MSVC_VERSION) + #undef JSON_HEDLEY_MSVC_VERSION +#endif +#if defined(_MSC_FULL_VER) && (_MSC_FULL_VER >= 140000000) + #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 10000000, (_MSC_FULL_VER % 10000000) / 100000, (_MSC_FULL_VER % 100000) / 100) +#elif defined(_MSC_FULL_VER) + #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 1000000, (_MSC_FULL_VER % 1000000) / 10000, (_MSC_FULL_VER % 10000) / 10) +#elif defined(_MSC_VER) + #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_VER / 100, _MSC_VER % 100, 0) +#endif + +#if defined(JSON_HEDLEY_MSVC_VERSION_CHECK) + #undef JSON_HEDLEY_MSVC_VERSION_CHECK +#endif +#if !defined(_MSC_VER) + #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (0) +#elif defined(_MSC_VER) && (_MSC_VER >= 1400) + #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 10000000) + (minor * 100000) + (patch))) +#elif defined(_MSC_VER) && (_MSC_VER >= 1200) + #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 1000000) + (minor * 10000) + (patch))) +#else + #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_VER >= ((major * 100) + (minor))) +#endif + +#if defined(JSON_HEDLEY_INTEL_VERSION) + #undef JSON_HEDLEY_INTEL_VERSION +#endif +#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE) + #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, __INTEL_COMPILER_UPDATE) +#elif defined(__INTEL_COMPILER) + #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, 0) +#endif + +#if defined(JSON_HEDLEY_INTEL_VERSION_CHECK) + #undef JSON_HEDLEY_INTEL_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_INTEL_VERSION) + #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_PGI_VERSION) + #undef JSON_HEDLEY_PGI_VERSION +#endif +#if defined(__PGI) && defined(__PGIC__) && defined(__PGIC_MINOR__) && defined(__PGIC_PATCHLEVEL__) + #define JSON_HEDLEY_PGI_VERSION JSON_HEDLEY_VERSION_ENCODE(__PGIC__, __PGIC_MINOR__, __PGIC_PATCHLEVEL__) +#endif + +#if defined(JSON_HEDLEY_PGI_VERSION_CHECK) + #undef JSON_HEDLEY_PGI_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_PGI_VERSION) + #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PGI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_SUNPRO_VERSION) + #undef JSON_HEDLEY_SUNPRO_VERSION +#endif +#if defined(__SUNPRO_C) && (__SUNPRO_C > 0x1000) + #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_C >> 16) & 0xf) * 10) + ((__SUNPRO_C >> 12) & 0xf), (((__SUNPRO_C >> 8) & 0xf) * 10) + ((__SUNPRO_C >> 4) & 0xf), (__SUNPRO_C & 0xf) * 10) +#elif defined(__SUNPRO_C) + #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_C >> 8) & 0xf, (__SUNPRO_C >> 4) & 0xf, (__SUNPRO_C) & 0xf) +#elif defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x1000) + #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_CC >> 16) & 0xf) * 10) + ((__SUNPRO_CC >> 12) & 0xf), (((__SUNPRO_CC >> 8) & 0xf) * 10) + ((__SUNPRO_CC >> 4) & 0xf), (__SUNPRO_CC & 0xf) * 10) +#elif defined(__SUNPRO_CC) + #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_CC >> 8) & 0xf, (__SUNPRO_CC >> 4) & 0xf, (__SUNPRO_CC) & 0xf) +#endif + +#if defined(JSON_HEDLEY_SUNPRO_VERSION_CHECK) + #undef JSON_HEDLEY_SUNPRO_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_SUNPRO_VERSION) + #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_SUNPRO_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION) + #undef JSON_HEDLEY_EMSCRIPTEN_VERSION +#endif +#if defined(__EMSCRIPTEN__) + #define JSON_HEDLEY_EMSCRIPTEN_VERSION JSON_HEDLEY_VERSION_ENCODE(__EMSCRIPTEN_major__, __EMSCRIPTEN_minor__, __EMSCRIPTEN_tiny__) +#endif + +#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK) + #undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION) + #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_EMSCRIPTEN_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_ARM_VERSION) + #undef JSON_HEDLEY_ARM_VERSION +#endif +#if defined(__CC_ARM) && defined(__ARMCOMPILER_VERSION) + #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCOMPILER_VERSION / 1000000, (__ARMCOMPILER_VERSION % 1000000) / 10000, (__ARMCOMPILER_VERSION % 10000) / 100) +#elif defined(__CC_ARM) && defined(__ARMCC_VERSION) + #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCC_VERSION / 1000000, (__ARMCC_VERSION % 1000000) / 10000, (__ARMCC_VERSION % 10000) / 100) +#endif + +#if defined(JSON_HEDLEY_ARM_VERSION_CHECK) + #undef JSON_HEDLEY_ARM_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_ARM_VERSION) + #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_ARM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_IBM_VERSION) + #undef JSON_HEDLEY_IBM_VERSION +#endif +#if defined(__ibmxl__) + #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ibmxl_version__, __ibmxl_release__, __ibmxl_modification__) +#elif defined(__xlC__) && defined(__xlC_ver__) + #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, (__xlC_ver__ >> 8) & 0xff) +#elif defined(__xlC__) + #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, 0) +#endif + +#if defined(JSON_HEDLEY_IBM_VERSION_CHECK) + #undef JSON_HEDLEY_IBM_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_IBM_VERSION) + #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IBM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_VERSION) + #undef JSON_HEDLEY_TI_VERSION +#endif +#if \ + defined(__TI_COMPILER_VERSION__) && \ + ( \ + defined(__TMS470__) || defined(__TI_ARM__) || \ + defined(__MSP430__) || \ + defined(__TMS320C2000__) \ + ) +#if (__TI_COMPILER_VERSION__ >= 16000000) + #define JSON_HEDLEY_TI_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif +#endif + +#if defined(JSON_HEDLEY_TI_VERSION_CHECK) + #undef JSON_HEDLEY_TI_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_VERSION) + #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_CL2000_VERSION) + #undef JSON_HEDLEY_TI_CL2000_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C2000__) + #define JSON_HEDLEY_TI_CL2000_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_CL2000_VERSION_CHECK) + #undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_CL2000_VERSION) + #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL2000_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_CL430_VERSION) + #undef JSON_HEDLEY_TI_CL430_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__) + #define JSON_HEDLEY_TI_CL430_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_CL430_VERSION_CHECK) + #undef JSON_HEDLEY_TI_CL430_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_CL430_VERSION) + #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL430_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_ARMCL_VERSION) + #undef JSON_HEDLEY_TI_ARMCL_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && (defined(__TMS470__) || defined(__TI_ARM__)) + #define JSON_HEDLEY_TI_ARMCL_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK) + #undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_ARMCL_VERSION) + #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_ARMCL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_CL6X_VERSION) + #undef JSON_HEDLEY_TI_CL6X_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C6X__) + #define JSON_HEDLEY_TI_CL6X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_CL6X_VERSION_CHECK) + #undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_CL6X_VERSION) + #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_CL7X_VERSION) + #undef JSON_HEDLEY_TI_CL7X_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && defined(__C7000__) + #define JSON_HEDLEY_TI_CL7X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_CL7X_VERSION_CHECK) + #undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_CL7X_VERSION) + #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL7X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TI_CLPRU_VERSION) + #undef JSON_HEDLEY_TI_CLPRU_VERSION +#endif +#if defined(__TI_COMPILER_VERSION__) && defined(__PRU__) + #define JSON_HEDLEY_TI_CLPRU_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000)) +#endif + +#if defined(JSON_HEDLEY_TI_CLPRU_VERSION_CHECK) + #undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TI_CLPRU_VERSION) + #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CLPRU_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_CRAY_VERSION) + #undef JSON_HEDLEY_CRAY_VERSION +#endif +#if defined(_CRAYC) + #if defined(_RELEASE_PATCHLEVEL) + #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, _RELEASE_PATCHLEVEL) + #else + #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, 0) + #endif +#endif + +#if defined(JSON_HEDLEY_CRAY_VERSION_CHECK) + #undef JSON_HEDLEY_CRAY_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_CRAY_VERSION) + #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_CRAY_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_IAR_VERSION) + #undef JSON_HEDLEY_IAR_VERSION +#endif +#if defined(__IAR_SYSTEMS_ICC__) + #if __VER__ > 1000 + #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE((__VER__ / 1000000), ((__VER__ / 1000) % 1000), (__VER__ % 1000)) + #else + #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE(VER / 100, __VER__ % 100, 0) + #endif +#endif + +#if defined(JSON_HEDLEY_IAR_VERSION_CHECK) + #undef JSON_HEDLEY_IAR_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_IAR_VERSION) + #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IAR_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_TINYC_VERSION) + #undef JSON_HEDLEY_TINYC_VERSION +#endif +#if defined(__TINYC__) + #define JSON_HEDLEY_TINYC_VERSION JSON_HEDLEY_VERSION_ENCODE(__TINYC__ / 1000, (__TINYC__ / 100) % 10, __TINYC__ % 100) +#endif + +#if defined(JSON_HEDLEY_TINYC_VERSION_CHECK) + #undef JSON_HEDLEY_TINYC_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_TINYC_VERSION) + #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TINYC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_DMC_VERSION) + #undef JSON_HEDLEY_DMC_VERSION +#endif +#if defined(__DMC__) + #define JSON_HEDLEY_DMC_VERSION JSON_HEDLEY_VERSION_ENCODE(__DMC__ >> 8, (__DMC__ >> 4) & 0xf, __DMC__ & 0xf) +#endif + +#if defined(JSON_HEDLEY_DMC_VERSION_CHECK) + #undef JSON_HEDLEY_DMC_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_DMC_VERSION) + #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_DMC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_COMPCERT_VERSION) + #undef JSON_HEDLEY_COMPCERT_VERSION +#endif +#if defined(__COMPCERT_VERSION__) + #define JSON_HEDLEY_COMPCERT_VERSION JSON_HEDLEY_VERSION_ENCODE(__COMPCERT_VERSION__ / 10000, (__COMPCERT_VERSION__ / 100) % 100, __COMPCERT_VERSION__ % 100) +#endif + +#if defined(JSON_HEDLEY_COMPCERT_VERSION_CHECK) + #undef JSON_HEDLEY_COMPCERT_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_COMPCERT_VERSION) + #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_PELLES_VERSION) + #undef JSON_HEDLEY_PELLES_VERSION +#endif +#if defined(__POCC__) + #define JSON_HEDLEY_PELLES_VERSION JSON_HEDLEY_VERSION_ENCODE(__POCC__ / 100, __POCC__ % 100, 0) +#endif + +#if defined(JSON_HEDLEY_PELLES_VERSION_CHECK) + #undef JSON_HEDLEY_PELLES_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_PELLES_VERSION) + #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PELLES_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_GCC_VERSION) + #undef JSON_HEDLEY_GCC_VERSION +#endif +#if \ + defined(JSON_HEDLEY_GNUC_VERSION) && \ + !defined(__clang__) && \ + !defined(JSON_HEDLEY_INTEL_VERSION) && \ + !defined(JSON_HEDLEY_PGI_VERSION) && \ + !defined(JSON_HEDLEY_ARM_VERSION) && \ + !defined(JSON_HEDLEY_TI_VERSION) && \ + !defined(JSON_HEDLEY_TI_ARMCL_VERSION) && \ + !defined(JSON_HEDLEY_TI_CL430_VERSION) && \ + !defined(JSON_HEDLEY_TI_CL2000_VERSION) && \ + !defined(JSON_HEDLEY_TI_CL6X_VERSION) && \ + !defined(JSON_HEDLEY_TI_CL7X_VERSION) && \ + !defined(JSON_HEDLEY_TI_CLPRU_VERSION) && \ + !defined(__COMPCERT__) + #define JSON_HEDLEY_GCC_VERSION JSON_HEDLEY_GNUC_VERSION +#endif + +#if defined(JSON_HEDLEY_GCC_VERSION_CHECK) + #undef JSON_HEDLEY_GCC_VERSION_CHECK +#endif +#if defined(JSON_HEDLEY_GCC_VERSION) + #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GCC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch)) +#else + #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (0) +#endif + +#if defined(JSON_HEDLEY_HAS_ATTRIBUTE) + #undef JSON_HEDLEY_HAS_ATTRIBUTE +#endif +#if defined(__has_attribute) + #define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) __has_attribute(attribute) +#else + #define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_ATTRIBUTE) + #undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE +#endif +#if defined(__has_attribute) + #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) __has_attribute(attribute) +#else + #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_ATTRIBUTE) + #undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE +#endif +#if defined(__has_attribute) + #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) __has_attribute(attribute) +#else + #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE) + #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE +#endif +#if \ + defined(__has_cpp_attribute) && \ + defined(__cplusplus) && \ + (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0)) + #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) __has_cpp_attribute(attribute) +#else + #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) (0) +#endif + +#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS) + #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS +#endif +#if !defined(__cplusplus) || !defined(__has_cpp_attribute) + #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0) +#elif \ + !defined(JSON_HEDLEY_PGI_VERSION) && \ + !defined(JSON_HEDLEY_IAR_VERSION) && \ + (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0)) && \ + (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0)) + #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(ns::attribute) +#else + #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE) + #undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE +#endif +#if defined(__has_cpp_attribute) && defined(__cplusplus) + #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute) +#else + #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE) + #undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE +#endif +#if defined(__has_cpp_attribute) && defined(__cplusplus) + #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute) +#else + #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_BUILTIN) + #undef JSON_HEDLEY_HAS_BUILTIN +#endif +#if defined(__has_builtin) + #define JSON_HEDLEY_HAS_BUILTIN(builtin) __has_builtin(builtin) +#else + #define JSON_HEDLEY_HAS_BUILTIN(builtin) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_BUILTIN) + #undef JSON_HEDLEY_GNUC_HAS_BUILTIN +#endif +#if defined(__has_builtin) + #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin) +#else + #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_BUILTIN) + #undef JSON_HEDLEY_GCC_HAS_BUILTIN +#endif +#if defined(__has_builtin) + #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin) +#else + #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_FEATURE) + #undef JSON_HEDLEY_HAS_FEATURE +#endif +#if defined(__has_feature) + #define JSON_HEDLEY_HAS_FEATURE(feature) __has_feature(feature) +#else + #define JSON_HEDLEY_HAS_FEATURE(feature) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_FEATURE) + #undef JSON_HEDLEY_GNUC_HAS_FEATURE +#endif +#if defined(__has_feature) + #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature) +#else + #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_FEATURE) + #undef JSON_HEDLEY_GCC_HAS_FEATURE +#endif +#if defined(__has_feature) + #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature) +#else + #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_EXTENSION) + #undef JSON_HEDLEY_HAS_EXTENSION +#endif +#if defined(__has_extension) + #define JSON_HEDLEY_HAS_EXTENSION(extension) __has_extension(extension) +#else + #define JSON_HEDLEY_HAS_EXTENSION(extension) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_EXTENSION) + #undef JSON_HEDLEY_GNUC_HAS_EXTENSION +#endif +#if defined(__has_extension) + #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension) +#else + #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_EXTENSION) + #undef JSON_HEDLEY_GCC_HAS_EXTENSION +#endif +#if defined(__has_extension) + #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension) +#else + #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE) + #undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE +#endif +#if defined(__has_declspec_attribute) + #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) __has_declspec_attribute(attribute) +#else + #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE) + #undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE +#endif +#if defined(__has_declspec_attribute) + #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute) +#else + #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE) + #undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE +#endif +#if defined(__has_declspec_attribute) + #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute) +#else + #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_HAS_WARNING) + #undef JSON_HEDLEY_HAS_WARNING +#endif +#if defined(__has_warning) + #define JSON_HEDLEY_HAS_WARNING(warning) __has_warning(warning) +#else + #define JSON_HEDLEY_HAS_WARNING(warning) (0) +#endif + +#if defined(JSON_HEDLEY_GNUC_HAS_WARNING) + #undef JSON_HEDLEY_GNUC_HAS_WARNING +#endif +#if defined(__has_warning) + #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning) +#else + #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_GCC_HAS_WARNING) + #undef JSON_HEDLEY_GCC_HAS_WARNING +#endif +#if defined(__has_warning) + #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning) +#else + #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +/* JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_ is for + HEDLEY INTERNAL USE ONLY. API subject to change without notice. */ +#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_) + #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_ +#endif +#if defined(__cplusplus) +# if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat") +# if JSON_HEDLEY_HAS_WARNING("-Wc++17-extensions") +# define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \ + _Pragma("clang diagnostic ignored \"-Wc++17-extensions\"") \ + xpr \ + JSON_HEDLEY_DIAGNOSTIC_POP +# else +# define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \ + xpr \ + JSON_HEDLEY_DIAGNOSTIC_POP +# endif +# endif +#endif +#if !defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(x) x +#endif + +#if defined(JSON_HEDLEY_CONST_CAST) + #undef JSON_HEDLEY_CONST_CAST +#endif +#if defined(__cplusplus) +# define JSON_HEDLEY_CONST_CAST(T, expr) (const_cast(expr)) +#elif \ + JSON_HEDLEY_HAS_WARNING("-Wcast-qual") || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) +# define JSON_HEDLEY_CONST_CAST(T, expr) (__extension__ ({ \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL \ + ((T) (expr)); \ + JSON_HEDLEY_DIAGNOSTIC_POP \ + })) +#else +# define JSON_HEDLEY_CONST_CAST(T, expr) ((T) (expr)) +#endif + +#if defined(JSON_HEDLEY_REINTERPRET_CAST) + #undef JSON_HEDLEY_REINTERPRET_CAST +#endif +#if defined(__cplusplus) + #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) (reinterpret_cast(expr)) +#else + #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) ((T) (expr)) +#endif + +#if defined(JSON_HEDLEY_STATIC_CAST) + #undef JSON_HEDLEY_STATIC_CAST +#endif +#if defined(__cplusplus) + #define JSON_HEDLEY_STATIC_CAST(T, expr) (static_cast(expr)) +#else + #define JSON_HEDLEY_STATIC_CAST(T, expr) ((T) (expr)) +#endif + +#if defined(JSON_HEDLEY_CPP_CAST) + #undef JSON_HEDLEY_CPP_CAST +#endif +#if defined(__cplusplus) +# if JSON_HEDLEY_HAS_WARNING("-Wold-style-cast") +# define JSON_HEDLEY_CPP_CAST(T, expr) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("clang diagnostic ignored \"-Wold-style-cast\"") \ + ((T) (expr)) \ + JSON_HEDLEY_DIAGNOSTIC_POP +# elif JSON_HEDLEY_IAR_VERSION_CHECK(8,3,0) +# define JSON_HEDLEY_CPP_CAST(T, expr) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("diag_suppress=Pe137") \ + JSON_HEDLEY_DIAGNOSTIC_POP \ +# else +# define JSON_HEDLEY_CPP_CAST(T, expr) ((T) (expr)) +# endif +#else +# define JSON_HEDLEY_CPP_CAST(T, expr) (expr) +#endif + +#if \ + (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \ + defined(__clang__) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,0,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \ + JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0) || \ + JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,17) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(8,0,0) || \ + (JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) && defined(__C99_PRAGMA_OPERATOR)) + #define JSON_HEDLEY_PRAGMA(value) _Pragma(#value) +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) + #define JSON_HEDLEY_PRAGMA(value) __pragma(value) +#else + #define JSON_HEDLEY_PRAGMA(value) +#endif + +#if defined(JSON_HEDLEY_DIAGNOSTIC_PUSH) + #undef JSON_HEDLEY_DIAGNOSTIC_PUSH +#endif +#if defined(JSON_HEDLEY_DIAGNOSTIC_POP) + #undef JSON_HEDLEY_DIAGNOSTIC_POP +#endif +#if defined(__clang__) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("clang diagnostic push") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("clang diagnostic pop") +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)") +#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("GCC diagnostic push") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("GCC diagnostic pop") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH __pragma(warning(push)) + #define JSON_HEDLEY_DIAGNOSTIC_POP __pragma(warning(pop)) +#elif JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("push") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("pop") +#elif \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,4,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("diag_push") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("diag_pop") +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0) + #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)") + #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)") +#else + #define JSON_HEDLEY_DIAGNOSTIC_PUSH + #define JSON_HEDLEY_DIAGNOSTIC_POP +#endif + +#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED) + #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wdeprecated-declarations") + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("clang diagnostic ignored \"-Wdeprecated-declarations\"") +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warning(disable:1478 1786)") +#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1444") +#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED __pragma(warning(disable:4996)) +#elif \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1291,1718") +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && !defined(__cplusplus) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,E_DEPRECATED_ATT,E_DEPRECATED_ATT_MESS)") +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && defined(__cplusplus) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,symdeprecated,symdeprecated2)") +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress=Pe1444,Pe1215") +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warn(disable:2241)") +#else + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED +#endif + +#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS) + #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas") + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("clang diagnostic ignored \"-Wunknown-pragmas\"") +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("warning(disable:161)") +#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 1675") +#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("GCC diagnostic ignored \"-Wunknown-pragmas\"") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS __pragma(warning(disable:4068)) +#elif \ + JSON_HEDLEY_TI_VERSION_CHECK(16,9,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163") +#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163") +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress=Pe161") +#else + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS +#endif + +#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES) + #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wunknown-attributes") + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("clang diagnostic ignored \"-Wunknown-attributes\"") +#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"") +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("warning(disable:1292)") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES __pragma(warning(disable:5030)) +#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097") +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("error_messages(off,attrskipunsup)") +#elif \ + JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1173") +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress=Pe1097") +#else + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES +#endif + +#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL) + #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wcast-qual") + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("clang diagnostic ignored \"-Wcast-qual\"") +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("warning(disable:2203 2331)") +#elif JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("GCC diagnostic ignored \"-Wcast-qual\"") +#else + #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL +#endif + +#if defined(JSON_HEDLEY_DEPRECATED) + #undef JSON_HEDLEY_DEPRECATED +#endif +#if defined(JSON_HEDLEY_DEPRECATED_FOR) + #undef JSON_HEDLEY_DEPRECATED_FOR +#endif +#if JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) + #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated("Since " # since)) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated("Since " #since "; use " #replacement)) +#elif defined(__cplusplus) && (__cplusplus >= 201402L) + #define JSON_HEDLEY_DEPRECATED(since) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since)]]) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since "; use " #replacement)]]) +#elif \ + JSON_HEDLEY_HAS_EXTENSION(attribute_deprecated_with_message) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(18,1,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0) + #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__("Since " #since))) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__("Since " #since "; use " #replacement))) +#elif \ + JSON_HEDLEY_HAS_ATTRIBUTE(deprecated) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__)) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__)) +#elif \ + JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \ + JSON_HEDLEY_PELLES_VERSION_CHECK(6,50,0) + #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated) +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_DEPRECATED(since) _Pragma("deprecated") + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) _Pragma("deprecated") +#else + #define JSON_HEDLEY_DEPRECATED(since) + #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) +#endif + +#if defined(JSON_HEDLEY_UNAVAILABLE) + #undef JSON_HEDLEY_UNAVAILABLE +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(warning) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_UNAVAILABLE(available_since) __attribute__((__warning__("Not available until " #available_since))) +#else + #define JSON_HEDLEY_UNAVAILABLE(available_since) +#endif + +#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT) + #undef JSON_HEDLEY_WARN_UNUSED_RESULT +#endif +#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT_MSG) + #undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG +#endif +#if (JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard) >= 201907L) + #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]]) + #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard(msg)]]) +#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard) + #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]]) + #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]]) +#elif \ + JSON_HEDLEY_HAS_ATTRIBUTE(warn_unused_result) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \ + (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) + #define JSON_HEDLEY_WARN_UNUSED_RESULT __attribute__((__warn_unused_result__)) + #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) __attribute__((__warn_unused_result__)) +#elif defined(_Check_return_) /* SAL */ + #define JSON_HEDLEY_WARN_UNUSED_RESULT _Check_return_ + #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) _Check_return_ +#else + #define JSON_HEDLEY_WARN_UNUSED_RESULT + #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) +#endif + +#if defined(JSON_HEDLEY_SENTINEL) + #undef JSON_HEDLEY_SENTINEL +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(sentinel) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) + #define JSON_HEDLEY_SENTINEL(position) __attribute__((__sentinel__(position))) +#else + #define JSON_HEDLEY_SENTINEL(position) +#endif + +#if defined(JSON_HEDLEY_NO_RETURN) + #undef JSON_HEDLEY_NO_RETURN +#endif +#if JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_NO_RETURN __noreturn +#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__)) +#elif defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L + #define JSON_HEDLEY_NO_RETURN _Noreturn +#elif defined(__cplusplus) && (__cplusplus >= 201103L) + #define JSON_HEDLEY_NO_RETURN JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[noreturn]]) +#elif \ + JSON_HEDLEY_HAS_ATTRIBUTE(noreturn) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,2,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__)) +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) + #define JSON_HEDLEY_NO_RETURN _Pragma("does_not_return") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) + #define JSON_HEDLEY_NO_RETURN __declspec(noreturn) +#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus) + #define JSON_HEDLEY_NO_RETURN _Pragma("FUNC_NEVER_RETURNS;") +#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0) + #define JSON_HEDLEY_NO_RETURN __attribute((noreturn)) +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0) + #define JSON_HEDLEY_NO_RETURN __declspec(noreturn) +#else + #define JSON_HEDLEY_NO_RETURN +#endif + +#if defined(JSON_HEDLEY_NO_ESCAPE) + #undef JSON_HEDLEY_NO_ESCAPE +#endif +#if JSON_HEDLEY_HAS_ATTRIBUTE(noescape) + #define JSON_HEDLEY_NO_ESCAPE __attribute__((__noescape__)) +#else + #define JSON_HEDLEY_NO_ESCAPE +#endif + +#if defined(JSON_HEDLEY_UNREACHABLE) + #undef JSON_HEDLEY_UNREACHABLE +#endif +#if defined(JSON_HEDLEY_UNREACHABLE_RETURN) + #undef JSON_HEDLEY_UNREACHABLE_RETURN +#endif +#if defined(JSON_HEDLEY_ASSUME) + #undef JSON_HEDLEY_ASSUME +#endif +#if \ + JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_ASSUME(expr) __assume(expr) +#elif JSON_HEDLEY_HAS_BUILTIN(__builtin_assume) + #define JSON_HEDLEY_ASSUME(expr) __builtin_assume(expr) +#elif \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0) + #if defined(__cplusplus) + #define JSON_HEDLEY_ASSUME(expr) std::_nassert(expr) + #else + #define JSON_HEDLEY_ASSUME(expr) _nassert(expr) + #endif +#endif +#if \ + (JSON_HEDLEY_HAS_BUILTIN(__builtin_unreachable) && (!defined(JSON_HEDLEY_ARM_VERSION))) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(18,10,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(13,1,5) + #define JSON_HEDLEY_UNREACHABLE() __builtin_unreachable() +#elif defined(JSON_HEDLEY_ASSUME) + #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0) +#endif +#if !defined(JSON_HEDLEY_ASSUME) + #if defined(JSON_HEDLEY_UNREACHABLE) + #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, ((expr) ? 1 : (JSON_HEDLEY_UNREACHABLE(), 1))) + #else + #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, expr) + #endif +#endif +#if defined(JSON_HEDLEY_UNREACHABLE) + #if \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0) + #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (JSON_HEDLEY_STATIC_CAST(void, JSON_HEDLEY_ASSUME(0)), (value)) + #else + #define JSON_HEDLEY_UNREACHABLE_RETURN(value) JSON_HEDLEY_UNREACHABLE() + #endif +#else + #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (value) +#endif +#if !defined(JSON_HEDLEY_UNREACHABLE) + #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0) +#endif + +JSON_HEDLEY_DIAGNOSTIC_PUSH +#if JSON_HEDLEY_HAS_WARNING("-Wpedantic") + #pragma clang diagnostic ignored "-Wpedantic" +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat-pedantic") && defined(__cplusplus) + #pragma clang diagnostic ignored "-Wc++98-compat-pedantic" +#endif +#if JSON_HEDLEY_GCC_HAS_WARNING("-Wvariadic-macros",4,0,0) + #if defined(__clang__) + #pragma clang diagnostic ignored "-Wvariadic-macros" + #elif defined(JSON_HEDLEY_GCC_VERSION) + #pragma GCC diagnostic ignored "-Wvariadic-macros" + #endif +#endif +#if defined(JSON_HEDLEY_NON_NULL) + #undef JSON_HEDLEY_NON_NULL +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(nonnull) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) + #define JSON_HEDLEY_NON_NULL(...) __attribute__((__nonnull__(__VA_ARGS__))) +#else + #define JSON_HEDLEY_NON_NULL(...) +#endif +JSON_HEDLEY_DIAGNOSTIC_POP + +#if defined(JSON_HEDLEY_PRINTF_FORMAT) + #undef JSON_HEDLEY_PRINTF_FORMAT +#endif +#if defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && !defined(__USE_MINGW_ANSI_STDIO) + #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(ms_printf, string_idx, first_to_check))) +#elif defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && defined(__USE_MINGW_ANSI_STDIO) + #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(gnu_printf, string_idx, first_to_check))) +#elif \ + JSON_HEDLEY_HAS_ATTRIBUTE(format) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(__printf__, string_idx, first_to_check))) +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(6,0,0) + #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __declspec(vaformat(printf,string_idx,first_to_check)) +#else + #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) +#endif + +#if defined(JSON_HEDLEY_CONSTEXPR) + #undef JSON_HEDLEY_CONSTEXPR +#endif +#if defined(__cplusplus) + #if __cplusplus >= 201103L + #define JSON_HEDLEY_CONSTEXPR JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(constexpr) + #endif +#endif +#if !defined(JSON_HEDLEY_CONSTEXPR) + #define JSON_HEDLEY_CONSTEXPR +#endif + +#if defined(JSON_HEDLEY_PREDICT) + #undef JSON_HEDLEY_PREDICT +#endif +#if defined(JSON_HEDLEY_LIKELY) + #undef JSON_HEDLEY_LIKELY +#endif +#if defined(JSON_HEDLEY_UNLIKELY) + #undef JSON_HEDLEY_UNLIKELY +#endif +#if defined(JSON_HEDLEY_UNPREDICTABLE) + #undef JSON_HEDLEY_UNPREDICTABLE +#endif +#if JSON_HEDLEY_HAS_BUILTIN(__builtin_unpredictable) + #define JSON_HEDLEY_UNPREDICTABLE(expr) __builtin_unpredictable((expr)) +#endif +#if \ + JSON_HEDLEY_HAS_BUILTIN(__builtin_expect_with_probability) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(9,0,0) +# define JSON_HEDLEY_PREDICT(expr, value, probability) __builtin_expect_with_probability( (expr), (value), (probability)) +# define JSON_HEDLEY_PREDICT_TRUE(expr, probability) __builtin_expect_with_probability(!!(expr), 1 , (probability)) +# define JSON_HEDLEY_PREDICT_FALSE(expr, probability) __builtin_expect_with_probability(!!(expr), 0 , (probability)) +# define JSON_HEDLEY_LIKELY(expr) __builtin_expect (!!(expr), 1 ) +# define JSON_HEDLEY_UNLIKELY(expr) __builtin_expect (!!(expr), 0 ) +#elif \ + JSON_HEDLEY_HAS_BUILTIN(__builtin_expect) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \ + JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,27) || \ + JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) +# define JSON_HEDLEY_PREDICT(expr, expected, probability) \ + (((probability) >= 0.9) ? __builtin_expect((expr), (expected)) : (JSON_HEDLEY_STATIC_CAST(void, expected), (expr))) +# define JSON_HEDLEY_PREDICT_TRUE(expr, probability) \ + (__extension__ ({ \ + double hedley_probability_ = (probability); \ + ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 1) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 0) : !!(expr))); \ + })) +# define JSON_HEDLEY_PREDICT_FALSE(expr, probability) \ + (__extension__ ({ \ + double hedley_probability_ = (probability); \ + ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 0) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 1) : !!(expr))); \ + })) +# define JSON_HEDLEY_LIKELY(expr) __builtin_expect(!!(expr), 1) +# define JSON_HEDLEY_UNLIKELY(expr) __builtin_expect(!!(expr), 0) +#else +# define JSON_HEDLEY_PREDICT(expr, expected, probability) (JSON_HEDLEY_STATIC_CAST(void, expected), (expr)) +# define JSON_HEDLEY_PREDICT_TRUE(expr, probability) (!!(expr)) +# define JSON_HEDLEY_PREDICT_FALSE(expr, probability) (!!(expr)) +# define JSON_HEDLEY_LIKELY(expr) (!!(expr)) +# define JSON_HEDLEY_UNLIKELY(expr) (!!(expr)) +#endif +#if !defined(JSON_HEDLEY_UNPREDICTABLE) + #define JSON_HEDLEY_UNPREDICTABLE(expr) JSON_HEDLEY_PREDICT(expr, 1, 0.5) +#endif + +#if defined(JSON_HEDLEY_MALLOC) + #undef JSON_HEDLEY_MALLOC +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(malloc) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_MALLOC __attribute__((__malloc__)) +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) + #define JSON_HEDLEY_MALLOC _Pragma("returns_new_memory") +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(14, 0, 0) + #define JSON_HEDLEY_MALLOC __declspec(restrict) +#else + #define JSON_HEDLEY_MALLOC +#endif + +#if defined(JSON_HEDLEY_PURE) + #undef JSON_HEDLEY_PURE +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(pure) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(2,96,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) +# define JSON_HEDLEY_PURE __attribute__((__pure__)) +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) +# define JSON_HEDLEY_PURE _Pragma("does_not_write_global_data") +#elif defined(__cplusplus) && \ + ( \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) \ + ) +# define JSON_HEDLEY_PURE _Pragma("FUNC_IS_PURE;") +#else +# define JSON_HEDLEY_PURE +#endif + +#if defined(JSON_HEDLEY_CONST) + #undef JSON_HEDLEY_CONST +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(const) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(2,5,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) + #define JSON_HEDLEY_CONST __attribute__((__const__)) +#elif \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) + #define JSON_HEDLEY_CONST _Pragma("no_side_effect") +#else + #define JSON_HEDLEY_CONST JSON_HEDLEY_PURE +#endif + +#if defined(JSON_HEDLEY_RESTRICT) + #undef JSON_HEDLEY_RESTRICT +#endif +#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && !defined(__cplusplus) + #define JSON_HEDLEY_RESTRICT restrict +#elif \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,4) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus)) || \ + JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \ + defined(__clang__) + #define JSON_HEDLEY_RESTRICT __restrict +#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,3,0) && !defined(__cplusplus) + #define JSON_HEDLEY_RESTRICT _Restrict +#else + #define JSON_HEDLEY_RESTRICT +#endif + +#if defined(JSON_HEDLEY_INLINE) + #undef JSON_HEDLEY_INLINE +#endif +#if \ + (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \ + (defined(__cplusplus) && (__cplusplus >= 199711L)) + #define JSON_HEDLEY_INLINE inline +#elif \ + defined(JSON_HEDLEY_GCC_VERSION) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(6,2,0) + #define JSON_HEDLEY_INLINE __inline__ +#elif \ + JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,1,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_INLINE __inline +#else + #define JSON_HEDLEY_INLINE +#endif + +#if defined(JSON_HEDLEY_ALWAYS_INLINE) + #undef JSON_HEDLEY_ALWAYS_INLINE +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(always_inline) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) +# define JSON_HEDLEY_ALWAYS_INLINE __attribute__((__always_inline__)) JSON_HEDLEY_INLINE +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) +# define JSON_HEDLEY_ALWAYS_INLINE __forceinline +#elif defined(__cplusplus) && \ + ( \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) \ + ) +# define JSON_HEDLEY_ALWAYS_INLINE _Pragma("FUNC_ALWAYS_INLINE;") +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) +# define JSON_HEDLEY_ALWAYS_INLINE _Pragma("inline=forced") +#else +# define JSON_HEDLEY_ALWAYS_INLINE JSON_HEDLEY_INLINE +#endif + +#if defined(JSON_HEDLEY_NEVER_INLINE) + #undef JSON_HEDLEY_NEVER_INLINE +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(noinline) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \ + JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \ + (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \ + (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \ + (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \ + JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \ + JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) + #define JSON_HEDLEY_NEVER_INLINE __attribute__((__noinline__)) +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) + #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline) +#elif JSON_HEDLEY_PGI_VERSION_CHECK(10,2,0) + #define JSON_HEDLEY_NEVER_INLINE _Pragma("noinline") +#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus) + #define JSON_HEDLEY_NEVER_INLINE _Pragma("FUNC_CANNOT_INLINE;") +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) + #define JSON_HEDLEY_NEVER_INLINE _Pragma("inline=never") +#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0) + #define JSON_HEDLEY_NEVER_INLINE __attribute((noinline)) +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0) + #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline) +#else + #define JSON_HEDLEY_NEVER_INLINE +#endif + +#if defined(JSON_HEDLEY_PRIVATE) + #undef JSON_HEDLEY_PRIVATE +#endif +#if defined(JSON_HEDLEY_PUBLIC) + #undef JSON_HEDLEY_PUBLIC +#endif +#if defined(JSON_HEDLEY_IMPORT) + #undef JSON_HEDLEY_IMPORT +#endif +#if defined(_WIN32) || defined(__CYGWIN__) +# define JSON_HEDLEY_PRIVATE +# define JSON_HEDLEY_PUBLIC __declspec(dllexport) +# define JSON_HEDLEY_IMPORT __declspec(dllimport) +#else +# if \ + JSON_HEDLEY_HAS_ATTRIBUTE(visibility) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \ + JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \ + ( \ + defined(__TI_EABI__) && \ + ( \ + (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) \ + ) \ + ) +# define JSON_HEDLEY_PRIVATE __attribute__((__visibility__("hidden"))) +# define JSON_HEDLEY_PUBLIC __attribute__((__visibility__("default"))) +# else +# define JSON_HEDLEY_PRIVATE +# define JSON_HEDLEY_PUBLIC +# endif +# define JSON_HEDLEY_IMPORT extern +#endif + +#if defined(JSON_HEDLEY_NO_THROW) + #undef JSON_HEDLEY_NO_THROW +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(nothrow) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) + #define JSON_HEDLEY_NO_THROW __attribute__((__nothrow__)) +#elif \ + JSON_HEDLEY_MSVC_VERSION_CHECK(13,1,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) + #define JSON_HEDLEY_NO_THROW __declspec(nothrow) +#else + #define JSON_HEDLEY_NO_THROW +#endif + +#if defined(JSON_HEDLEY_FALL_THROUGH) + #undef JSON_HEDLEY_FALL_THROUGH +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(fallthrough) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(7,0,0) + #define JSON_HEDLEY_FALL_THROUGH __attribute__((__fallthrough__)) +#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(clang,fallthrough) + #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[clang::fallthrough]]) +#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(fallthrough) + #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[fallthrough]]) +#elif defined(__fallthrough) /* SAL */ + #define JSON_HEDLEY_FALL_THROUGH __fallthrough +#else + #define JSON_HEDLEY_FALL_THROUGH +#endif + +#if defined(JSON_HEDLEY_RETURNS_NON_NULL) + #undef JSON_HEDLEY_RETURNS_NON_NULL +#endif +#if \ + JSON_HEDLEY_HAS_ATTRIBUTE(returns_nonnull) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) + #define JSON_HEDLEY_RETURNS_NON_NULL __attribute__((__returns_nonnull__)) +#elif defined(_Ret_notnull_) /* SAL */ + #define JSON_HEDLEY_RETURNS_NON_NULL _Ret_notnull_ +#else + #define JSON_HEDLEY_RETURNS_NON_NULL +#endif + +#if defined(JSON_HEDLEY_ARRAY_PARAM) + #undef JSON_HEDLEY_ARRAY_PARAM +#endif +#if \ + defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \ + !defined(__STDC_NO_VLA__) && \ + !defined(__cplusplus) && \ + !defined(JSON_HEDLEY_PGI_VERSION) && \ + !defined(JSON_HEDLEY_TINYC_VERSION) + #define JSON_HEDLEY_ARRAY_PARAM(name) (name) +#else + #define JSON_HEDLEY_ARRAY_PARAM(name) +#endif + +#if defined(JSON_HEDLEY_IS_CONSTANT) + #undef JSON_HEDLEY_IS_CONSTANT +#endif +#if defined(JSON_HEDLEY_REQUIRE_CONSTEXPR) + #undef JSON_HEDLEY_REQUIRE_CONSTEXPR +#endif +/* JSON_HEDLEY_IS_CONSTEXPR_ is for + HEDLEY INTERNAL USE ONLY. API subject to change without notice. */ +#if defined(JSON_HEDLEY_IS_CONSTEXPR_) + #undef JSON_HEDLEY_IS_CONSTEXPR_ +#endif +#if \ + JSON_HEDLEY_HAS_BUILTIN(__builtin_constant_p) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,19) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \ + JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \ + (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) && !defined(__cplusplus)) || \ + JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) + #define JSON_HEDLEY_IS_CONSTANT(expr) __builtin_constant_p(expr) +#endif +#if !defined(__cplusplus) +# if \ + JSON_HEDLEY_HAS_BUILTIN(__builtin_types_compatible_p) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \ + JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) || \ + JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,24) +#if defined(__INTPTR_TYPE__) + #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0)), int*) +#else + #include + #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((intptr_t) ((expr) * 0)) : (int*) 0)), int*) +#endif +# elif \ + ( \ + defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) && \ + !defined(JSON_HEDLEY_SUNPRO_VERSION) && \ + !defined(JSON_HEDLEY_PGI_VERSION) && \ + !defined(JSON_HEDLEY_IAR_VERSION)) || \ + JSON_HEDLEY_HAS_EXTENSION(c_generic_selections) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0) || \ + JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \ + JSON_HEDLEY_ARM_VERSION_CHECK(5,3,0) +#if defined(__INTPTR_TYPE__) + #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0), int*: 1, void*: 0) +#else + #include + #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((intptr_t) * 0) : (int*) 0), int*: 1, void*: 0) +#endif +# elif \ + defined(JSON_HEDLEY_GCC_VERSION) || \ + defined(JSON_HEDLEY_INTEL_VERSION) || \ + defined(JSON_HEDLEY_TINYC_VERSION) || \ + defined(JSON_HEDLEY_TI_ARMCL_VERSION) || \ + JSON_HEDLEY_TI_CL430_VERSION_CHECK(18,12,0) || \ + defined(JSON_HEDLEY_TI_CL2000_VERSION) || \ + defined(JSON_HEDLEY_TI_CL6X_VERSION) || \ + defined(JSON_HEDLEY_TI_CL7X_VERSION) || \ + defined(JSON_HEDLEY_TI_CLPRU_VERSION) || \ + defined(__clang__) +# define JSON_HEDLEY_IS_CONSTEXPR_(expr) ( \ + sizeof(void) != \ + sizeof(*( \ + 1 ? \ + ((void*) ((expr) * 0L) ) : \ +((struct { char v[sizeof(void) * 2]; } *) 1) \ + ) \ + ) \ + ) +# endif +#endif +#if defined(JSON_HEDLEY_IS_CONSTEXPR_) + #if !defined(JSON_HEDLEY_IS_CONSTANT) + #define JSON_HEDLEY_IS_CONSTANT(expr) JSON_HEDLEY_IS_CONSTEXPR_(expr) + #endif + #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (JSON_HEDLEY_IS_CONSTEXPR_(expr) ? (expr) : (-1)) +#else + #if !defined(JSON_HEDLEY_IS_CONSTANT) + #define JSON_HEDLEY_IS_CONSTANT(expr) (0) + #endif + #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (expr) +#endif + +#if defined(JSON_HEDLEY_BEGIN_C_DECLS) + #undef JSON_HEDLEY_BEGIN_C_DECLS +#endif +#if defined(JSON_HEDLEY_END_C_DECLS) + #undef JSON_HEDLEY_END_C_DECLS +#endif +#if defined(JSON_HEDLEY_C_DECL) + #undef JSON_HEDLEY_C_DECL +#endif +#if defined(__cplusplus) + #define JSON_HEDLEY_BEGIN_C_DECLS extern "C" { + #define JSON_HEDLEY_END_C_DECLS } + #define JSON_HEDLEY_C_DECL extern "C" +#else + #define JSON_HEDLEY_BEGIN_C_DECLS + #define JSON_HEDLEY_END_C_DECLS + #define JSON_HEDLEY_C_DECL +#endif + +#if defined(JSON_HEDLEY_STATIC_ASSERT) + #undef JSON_HEDLEY_STATIC_ASSERT +#endif +#if \ + !defined(__cplusplus) && ( \ + (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)) || \ + JSON_HEDLEY_HAS_FEATURE(c_static_assert) || \ + JSON_HEDLEY_GCC_VERSION_CHECK(6,0,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \ + defined(_Static_assert) \ + ) +# define JSON_HEDLEY_STATIC_ASSERT(expr, message) _Static_assert(expr, message) +#elif \ + (defined(__cplusplus) && (__cplusplus >= 201103L)) || \ + JSON_HEDLEY_MSVC_VERSION_CHECK(16,0,0) +# define JSON_HEDLEY_STATIC_ASSERT(expr, message) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(static_assert(expr, message)) +#else +# define JSON_HEDLEY_STATIC_ASSERT(expr, message) +#endif + +#if defined(JSON_HEDLEY_NULL) + #undef JSON_HEDLEY_NULL +#endif +#if defined(__cplusplus) + #if __cplusplus >= 201103L + #define JSON_HEDLEY_NULL JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(nullptr) + #elif defined(NULL) + #define JSON_HEDLEY_NULL NULL + #else + #define JSON_HEDLEY_NULL JSON_HEDLEY_STATIC_CAST(void*, 0) + #endif +#elif defined(NULL) + #define JSON_HEDLEY_NULL NULL +#else + #define JSON_HEDLEY_NULL ((void*) 0) +#endif + +#if defined(JSON_HEDLEY_MESSAGE) + #undef JSON_HEDLEY_MESSAGE +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas") +# define JSON_HEDLEY_MESSAGE(msg) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \ + JSON_HEDLEY_PRAGMA(message msg) \ + JSON_HEDLEY_DIAGNOSTIC_POP +#elif \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,4,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) +# define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message msg) +#elif JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0) +# define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(_CRI message msg) +#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) +# define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg)) +#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,0,0) +# define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg)) +#else +# define JSON_HEDLEY_MESSAGE(msg) +#endif + +#if defined(JSON_HEDLEY_WARNING) + #undef JSON_HEDLEY_WARNING +#endif +#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas") +# define JSON_HEDLEY_WARNING(msg) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \ + JSON_HEDLEY_PRAGMA(clang warning msg) \ + JSON_HEDLEY_DIAGNOSTIC_POP +#elif \ + JSON_HEDLEY_GCC_VERSION_CHECK(4,8,0) || \ + JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \ + JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) +# define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(GCC warning msg) +#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) +# define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(message(msg)) +#else +# define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_MESSAGE(msg) +#endif + +#if defined(JSON_HEDLEY_REQUIRE) + #undef JSON_HEDLEY_REQUIRE +#endif +#if defined(JSON_HEDLEY_REQUIRE_MSG) + #undef JSON_HEDLEY_REQUIRE_MSG +#endif +#if JSON_HEDLEY_HAS_ATTRIBUTE(diagnose_if) +# if JSON_HEDLEY_HAS_WARNING("-Wgcc-compat") +# define JSON_HEDLEY_REQUIRE(expr) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \ + __attribute__((diagnose_if(!(expr), #expr, "error"))) \ + JSON_HEDLEY_DIAGNOSTIC_POP +# define JSON_HEDLEY_REQUIRE_MSG(expr,msg) \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \ + __attribute__((diagnose_if(!(expr), msg, "error"))) \ + JSON_HEDLEY_DIAGNOSTIC_POP +# else +# define JSON_HEDLEY_REQUIRE(expr) __attribute__((diagnose_if(!(expr), #expr, "error"))) +# define JSON_HEDLEY_REQUIRE_MSG(expr,msg) __attribute__((diagnose_if(!(expr), msg, "error"))) +# endif +#else +# define JSON_HEDLEY_REQUIRE(expr) +# define JSON_HEDLEY_REQUIRE_MSG(expr,msg) +#endif + +#if defined(JSON_HEDLEY_FLAGS) + #undef JSON_HEDLEY_FLAGS +#endif +#if JSON_HEDLEY_HAS_ATTRIBUTE(flag_enum) + #define JSON_HEDLEY_FLAGS __attribute__((__flag_enum__)) +#endif + +#if defined(JSON_HEDLEY_FLAGS_CAST) + #undef JSON_HEDLEY_FLAGS_CAST +#endif +#if JSON_HEDLEY_INTEL_VERSION_CHECK(19,0,0) +# define JSON_HEDLEY_FLAGS_CAST(T, expr) (__extension__ ({ \ + JSON_HEDLEY_DIAGNOSTIC_PUSH \ + _Pragma("warning(disable:188)") \ + ((T) (expr)); \ + JSON_HEDLEY_DIAGNOSTIC_POP \ + })) +#else +# define JSON_HEDLEY_FLAGS_CAST(T, expr) JSON_HEDLEY_STATIC_CAST(T, expr) +#endif + +#if defined(JSON_HEDLEY_EMPTY_BASES) + #undef JSON_HEDLEY_EMPTY_BASES +#endif +#if JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,23918) && !JSON_HEDLEY_MSVC_VERSION_CHECK(20,0,0) + #define JSON_HEDLEY_EMPTY_BASES __declspec(empty_bases) +#else + #define JSON_HEDLEY_EMPTY_BASES +#endif + +/* Remaining macros are deprecated. */ + +#if defined(JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK) + #undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK +#endif +#if defined(__clang__) + #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) (0) +#else + #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) +#endif + +#if defined(JSON_HEDLEY_CLANG_HAS_ATTRIBUTE) + #undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE +#endif +#define JSON_HEDLEY_CLANG_HAS_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_ATTRIBUTE(attribute) + +#if defined(JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE) + #undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE +#endif +#define JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) + +#if defined(JSON_HEDLEY_CLANG_HAS_BUILTIN) + #undef JSON_HEDLEY_CLANG_HAS_BUILTIN +#endif +#define JSON_HEDLEY_CLANG_HAS_BUILTIN(builtin) JSON_HEDLEY_HAS_BUILTIN(builtin) + +#if defined(JSON_HEDLEY_CLANG_HAS_FEATURE) + #undef JSON_HEDLEY_CLANG_HAS_FEATURE +#endif +#define JSON_HEDLEY_CLANG_HAS_FEATURE(feature) JSON_HEDLEY_HAS_FEATURE(feature) + +#if defined(JSON_HEDLEY_CLANG_HAS_EXTENSION) + #undef JSON_HEDLEY_CLANG_HAS_EXTENSION +#endif +#define JSON_HEDLEY_CLANG_HAS_EXTENSION(extension) JSON_HEDLEY_HAS_EXTENSION(extension) + +#if defined(JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE) + #undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE +#endif +#define JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) + +#if defined(JSON_HEDLEY_CLANG_HAS_WARNING) + #undef JSON_HEDLEY_CLANG_HAS_WARNING +#endif +#define JSON_HEDLEY_CLANG_HAS_WARNING(warning) JSON_HEDLEY_HAS_WARNING(warning) + +#endif /* !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < X) */ + + +// This file contains all internal macro definitions +// You MUST include macro_unscope.hpp at the end of json.hpp to undef all of them + +// exclude unsupported compilers +#if !defined(JSON_SKIP_UNSUPPORTED_COMPILER_CHECK) + #if defined(__clang__) + #if (__clang_major__ * 10000 + __clang_minor__ * 100 + __clang_patchlevel__) < 30400 + #error "unsupported Clang version - see https://github.com/nlohmann/json#supported-compilers" + #endif + #elif defined(__GNUC__) && !(defined(__ICC) || defined(__INTEL_COMPILER)) + #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) < 40800 + #error "unsupported GCC version - see https://github.com/nlohmann/json#supported-compilers" + #endif + #endif +#endif + +// C++ language standard detection +#if (defined(__cplusplus) && __cplusplus >= 202002L) || (defined(_MSVC_LANG) && _MSVC_LANG >= 202002L) + #define JSON_HAS_CPP_20 + #define JSON_HAS_CPP_17 + #define JSON_HAS_CPP_14 +#elif (defined(__cplusplus) && __cplusplus >= 201703L) || (defined(_HAS_CXX17) && _HAS_CXX17 == 1) // fix for issue #464 + #define JSON_HAS_CPP_17 + #define JSON_HAS_CPP_14 +#elif (defined(__cplusplus) && __cplusplus >= 201402L) || (defined(_HAS_CXX14) && _HAS_CXX14 == 1) + #define JSON_HAS_CPP_14 +#endif + +// disable float-equal warnings on GCC/clang +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #pragma GCC diagnostic push + #pragma GCC diagnostic ignored "-Wfloat-equal" +#endif + +// disable documentation warnings on clang +#if defined(__clang__) + #pragma GCC diagnostic push + #pragma GCC diagnostic ignored "-Wdocumentation" +#endif + +// allow to disable exceptions +#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION) + #define JSON_THROW(exception) throw exception + #define JSON_TRY try + #define JSON_CATCH(exception) catch(exception) + #define JSON_INTERNAL_CATCH(exception) catch(exception) +#else + #include + #define JSON_THROW(exception) std::abort() + #define JSON_TRY if(true) + #define JSON_CATCH(exception) if(false) + #define JSON_INTERNAL_CATCH(exception) if(false) +#endif + +// override exception macros +#if defined(JSON_THROW_USER) + #undef JSON_THROW + #define JSON_THROW JSON_THROW_USER +#endif +#if defined(JSON_TRY_USER) + #undef JSON_TRY + #define JSON_TRY JSON_TRY_USER +#endif +#if defined(JSON_CATCH_USER) + #undef JSON_CATCH + #define JSON_CATCH JSON_CATCH_USER + #undef JSON_INTERNAL_CATCH + #define JSON_INTERNAL_CATCH JSON_CATCH_USER +#endif +#if defined(JSON_INTERNAL_CATCH_USER) + #undef JSON_INTERNAL_CATCH + #define JSON_INTERNAL_CATCH JSON_INTERNAL_CATCH_USER +#endif + +// allow to override assert +#if !defined(JSON_ASSERT) + #include // assert + #define JSON_ASSERT(x) assert(x) +#endif + +/*! +@brief macro to briefly define a mapping between an enum and JSON +@def NLOHMANN_JSON_SERIALIZE_ENUM +@since version 3.4.0 +*/ +#define NLOHMANN_JSON_SERIALIZE_ENUM(ENUM_TYPE, ...) \ + template \ + inline void to_json(BasicJsonType& j, const ENUM_TYPE& e) \ + { \ + static_assert(std::is_enum::value, #ENUM_TYPE " must be an enum!"); \ + static const std::pair m[] = __VA_ARGS__; \ + auto it = std::find_if(std::begin(m), std::end(m), \ + [e](const std::pair& ej_pair) -> bool \ + { \ + return ej_pair.first == e; \ + }); \ + j = ((it != std::end(m)) ? it : std::begin(m))->second; \ + } \ + template \ + inline void from_json(const BasicJsonType& j, ENUM_TYPE& e) \ + { \ + static_assert(std::is_enum::value, #ENUM_TYPE " must be an enum!"); \ + static const std::pair m[] = __VA_ARGS__; \ + auto it = std::find_if(std::begin(m), std::end(m), \ + [&j](const std::pair& ej_pair) -> bool \ + { \ + return ej_pair.second == j; \ + }); \ + e = ((it != std::end(m)) ? it : std::begin(m))->first; \ + } + +// Ugly macros to avoid uglier copy-paste when specializing basic_json. They +// may be removed in the future once the class is split. + +#define NLOHMANN_BASIC_JSON_TPL_DECLARATION \ + template class ObjectType, \ + template class ArrayType, \ + class StringType, class BooleanType, class NumberIntegerType, \ + class NumberUnsignedType, class NumberFloatType, \ + template class AllocatorType, \ + template class JSONSerializer, \ + class BinaryType> + +#define NLOHMANN_BASIC_JSON_TPL \ + basic_json + +// Macros to simplify conversion from/to types + +#define NLOHMANN_JSON_EXPAND( x ) x +#define NLOHMANN_JSON_GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60, _61, _62, _63, _64, NAME,...) NAME +#define NLOHMANN_JSON_PASTE(...) NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_GET_MACRO(__VA_ARGS__, \ + NLOHMANN_JSON_PASTE64, \ + NLOHMANN_JSON_PASTE63, \ + NLOHMANN_JSON_PASTE62, \ + NLOHMANN_JSON_PASTE61, \ + NLOHMANN_JSON_PASTE60, \ + NLOHMANN_JSON_PASTE59, \ + NLOHMANN_JSON_PASTE58, \ + NLOHMANN_JSON_PASTE57, \ + NLOHMANN_JSON_PASTE56, \ + NLOHMANN_JSON_PASTE55, \ + NLOHMANN_JSON_PASTE54, \ + NLOHMANN_JSON_PASTE53, \ + NLOHMANN_JSON_PASTE52, \ + NLOHMANN_JSON_PASTE51, \ + NLOHMANN_JSON_PASTE50, \ + NLOHMANN_JSON_PASTE49, \ + NLOHMANN_JSON_PASTE48, \ + NLOHMANN_JSON_PASTE47, \ + NLOHMANN_JSON_PASTE46, \ + NLOHMANN_JSON_PASTE45, \ + NLOHMANN_JSON_PASTE44, \ + NLOHMANN_JSON_PASTE43, \ + NLOHMANN_JSON_PASTE42, \ + NLOHMANN_JSON_PASTE41, \ + NLOHMANN_JSON_PASTE40, \ + NLOHMANN_JSON_PASTE39, \ + NLOHMANN_JSON_PASTE38, \ + NLOHMANN_JSON_PASTE37, \ + NLOHMANN_JSON_PASTE36, \ + NLOHMANN_JSON_PASTE35, \ + NLOHMANN_JSON_PASTE34, \ + NLOHMANN_JSON_PASTE33, \ + NLOHMANN_JSON_PASTE32, \ + NLOHMANN_JSON_PASTE31, \ + NLOHMANN_JSON_PASTE30, \ + NLOHMANN_JSON_PASTE29, \ + NLOHMANN_JSON_PASTE28, \ + NLOHMANN_JSON_PASTE27, \ + NLOHMANN_JSON_PASTE26, \ + NLOHMANN_JSON_PASTE25, \ + NLOHMANN_JSON_PASTE24, \ + NLOHMANN_JSON_PASTE23, \ + NLOHMANN_JSON_PASTE22, \ + NLOHMANN_JSON_PASTE21, \ + NLOHMANN_JSON_PASTE20, \ + NLOHMANN_JSON_PASTE19, \ + NLOHMANN_JSON_PASTE18, \ + NLOHMANN_JSON_PASTE17, \ + NLOHMANN_JSON_PASTE16, \ + NLOHMANN_JSON_PASTE15, \ + NLOHMANN_JSON_PASTE14, \ + NLOHMANN_JSON_PASTE13, \ + NLOHMANN_JSON_PASTE12, \ + NLOHMANN_JSON_PASTE11, \ + NLOHMANN_JSON_PASTE10, \ + NLOHMANN_JSON_PASTE9, \ + NLOHMANN_JSON_PASTE8, \ + NLOHMANN_JSON_PASTE7, \ + NLOHMANN_JSON_PASTE6, \ + NLOHMANN_JSON_PASTE5, \ + NLOHMANN_JSON_PASTE4, \ + NLOHMANN_JSON_PASTE3, \ + NLOHMANN_JSON_PASTE2, \ + NLOHMANN_JSON_PASTE1)(__VA_ARGS__)) +#define NLOHMANN_JSON_PASTE2(func, v1) func(v1) +#define NLOHMANN_JSON_PASTE3(func, v1, v2) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE2(func, v2) +#define NLOHMANN_JSON_PASTE4(func, v1, v2, v3) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE3(func, v2, v3) +#define NLOHMANN_JSON_PASTE5(func, v1, v2, v3, v4) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE4(func, v2, v3, v4) +#define NLOHMANN_JSON_PASTE6(func, v1, v2, v3, v4, v5) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE5(func, v2, v3, v4, v5) +#define NLOHMANN_JSON_PASTE7(func, v1, v2, v3, v4, v5, v6) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE6(func, v2, v3, v4, v5, v6) +#define NLOHMANN_JSON_PASTE8(func, v1, v2, v3, v4, v5, v6, v7) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE7(func, v2, v3, v4, v5, v6, v7) +#define NLOHMANN_JSON_PASTE9(func, v1, v2, v3, v4, v5, v6, v7, v8) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE8(func, v2, v3, v4, v5, v6, v7, v8) +#define NLOHMANN_JSON_PASTE10(func, v1, v2, v3, v4, v5, v6, v7, v8, v9) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE9(func, v2, v3, v4, v5, v6, v7, v8, v9) +#define NLOHMANN_JSON_PASTE11(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE10(func, v2, v3, v4, v5, v6, v7, v8, v9, v10) +#define NLOHMANN_JSON_PASTE12(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE11(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11) +#define NLOHMANN_JSON_PASTE13(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE12(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12) +#define NLOHMANN_JSON_PASTE14(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE13(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13) +#define NLOHMANN_JSON_PASTE15(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE14(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14) +#define NLOHMANN_JSON_PASTE16(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE15(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15) +#define NLOHMANN_JSON_PASTE17(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE16(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16) +#define NLOHMANN_JSON_PASTE18(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE17(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17) +#define NLOHMANN_JSON_PASTE19(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE18(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18) +#define NLOHMANN_JSON_PASTE20(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE19(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19) +#define NLOHMANN_JSON_PASTE21(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE20(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20) +#define NLOHMANN_JSON_PASTE22(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE21(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21) +#define NLOHMANN_JSON_PASTE23(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE22(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22) +#define NLOHMANN_JSON_PASTE24(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE23(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23) +#define NLOHMANN_JSON_PASTE25(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE24(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24) +#define NLOHMANN_JSON_PASTE26(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE25(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25) +#define NLOHMANN_JSON_PASTE27(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE26(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26) +#define NLOHMANN_JSON_PASTE28(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE27(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27) +#define NLOHMANN_JSON_PASTE29(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE28(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28) +#define NLOHMANN_JSON_PASTE30(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE29(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29) +#define NLOHMANN_JSON_PASTE31(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE30(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30) +#define NLOHMANN_JSON_PASTE32(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE31(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31) +#define NLOHMANN_JSON_PASTE33(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE32(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32) +#define NLOHMANN_JSON_PASTE34(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE33(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33) +#define NLOHMANN_JSON_PASTE35(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE34(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34) +#define NLOHMANN_JSON_PASTE36(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE35(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35) +#define NLOHMANN_JSON_PASTE37(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE36(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36) +#define NLOHMANN_JSON_PASTE38(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE37(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37) +#define NLOHMANN_JSON_PASTE39(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE38(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38) +#define NLOHMANN_JSON_PASTE40(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE39(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39) +#define NLOHMANN_JSON_PASTE41(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE40(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40) +#define NLOHMANN_JSON_PASTE42(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE41(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41) +#define NLOHMANN_JSON_PASTE43(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE42(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42) +#define NLOHMANN_JSON_PASTE44(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE43(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43) +#define NLOHMANN_JSON_PASTE45(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE44(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44) +#define NLOHMANN_JSON_PASTE46(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE45(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45) +#define NLOHMANN_JSON_PASTE47(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE46(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46) +#define NLOHMANN_JSON_PASTE48(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE47(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47) +#define NLOHMANN_JSON_PASTE49(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE48(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48) +#define NLOHMANN_JSON_PASTE50(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE49(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49) +#define NLOHMANN_JSON_PASTE51(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE50(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50) +#define NLOHMANN_JSON_PASTE52(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE51(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51) +#define NLOHMANN_JSON_PASTE53(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE52(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52) +#define NLOHMANN_JSON_PASTE54(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE53(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53) +#define NLOHMANN_JSON_PASTE55(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE54(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54) +#define NLOHMANN_JSON_PASTE56(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE55(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55) +#define NLOHMANN_JSON_PASTE57(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE56(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56) +#define NLOHMANN_JSON_PASTE58(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE57(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57) +#define NLOHMANN_JSON_PASTE59(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE58(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58) +#define NLOHMANN_JSON_PASTE60(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE59(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59) +#define NLOHMANN_JSON_PASTE61(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE60(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60) +#define NLOHMANN_JSON_PASTE62(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE61(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61) +#define NLOHMANN_JSON_PASTE63(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE62(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62) +#define NLOHMANN_JSON_PASTE64(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE63(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63) + +#define NLOHMANN_JSON_TO(v1) nlohmann_json_j[#v1] = nlohmann_json_t.v1; +#define NLOHMANN_JSON_FROM(v1) nlohmann_json_j.at(#v1).get_to(nlohmann_json_t.v1); + +/*! +@brief macro +@def NLOHMANN_DEFINE_TYPE_INTRUSIVE +@since version 3.9.0 +*/ +#define NLOHMANN_DEFINE_TYPE_INTRUSIVE(Type, ...) \ + friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \ + friend void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) } + +/*! +@brief macro +@def NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE +@since version 3.9.0 +*/ +#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Type, ...) \ + inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \ + inline void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) } + +#ifndef JSON_USE_IMPLICIT_CONVERSIONS + #define JSON_USE_IMPLICIT_CONVERSIONS 1 +#endif + +#if JSON_USE_IMPLICIT_CONVERSIONS + #define JSON_EXPLICIT +#else + #define JSON_EXPLICIT explicit +#endif + + +namespace nlohmann +{ +namespace detail +{ +//////////////// +// exceptions // +//////////////// + +/*! +@brief general exception of the @ref basic_json class + +This class is an extension of `std::exception` objects with a member @a id for +exception ids. It is used as the base class for all exceptions thrown by the +@ref basic_json class. This class can hence be used as "wildcard" to catch +exceptions. + +Subclasses: +- @ref parse_error for exceptions indicating a parse error +- @ref invalid_iterator for exceptions indicating errors with iterators +- @ref type_error for exceptions indicating executing a member function with + a wrong type +- @ref out_of_range for exceptions indicating access out of the defined range +- @ref other_error for exceptions indicating other library errors + +@internal +@note To have nothrow-copy-constructible exceptions, we internally use + `std::runtime_error` which can cope with arbitrary-length error messages. + Intermediate strings are built with static functions and then passed to + the actual constructor. +@endinternal + +@liveexample{The following code shows how arbitrary library exceptions can be +caught.,exception} + +@since version 3.0.0 +*/ +class exception : public std::exception +{ + public: + /// returns the explanatory string + JSON_HEDLEY_RETURNS_NON_NULL + const char* what() const noexcept override + { + return m.what(); + } + + /// the id of the exception + const int id; + + protected: + JSON_HEDLEY_NON_NULL(3) + exception(int id_, const char* what_arg) : id(id_), m(what_arg) {} + + static std::string name(const std::string& ename, int id_) + { + return "[json.exception." + ename + "." + std::to_string(id_) + "] "; + } + + private: + /// an exception object as storage for error messages + std::runtime_error m; +}; + +/*! +@brief exception indicating a parse error + +This exception is thrown by the library when a parse error occurs. Parse errors +can occur during the deserialization of JSON text, CBOR, MessagePack, as well +as when using JSON Patch. + +Member @a byte holds the byte index of the last read character in the input +file. + +Exceptions have ids 1xx. + +name / id | example message | description +------------------------------ | --------------- | ------------------------- +json.exception.parse_error.101 | parse error at 2: unexpected end of input; expected string literal | This error indicates a syntax error while deserializing a JSON text. The error message describes that an unexpected token (character) was encountered, and the member @a byte indicates the error position. +json.exception.parse_error.102 | parse error at 14: missing or wrong low surrogate | JSON uses the `\uxxxx` format to describe Unicode characters. Code points above above 0xFFFF are split into two `\uxxxx` entries ("surrogate pairs"). This error indicates that the surrogate pair is incomplete or contains an invalid code point. +json.exception.parse_error.103 | parse error: code points above 0x10FFFF are invalid | Unicode supports code points up to 0x10FFFF. Code points above 0x10FFFF are invalid. +json.exception.parse_error.104 | parse error: JSON patch must be an array of objects | [RFC 6902](https://tools.ietf.org/html/rfc6902) requires a JSON Patch document to be a JSON document that represents an array of objects. +json.exception.parse_error.105 | parse error: operation must have string member 'op' | An operation of a JSON Patch document must contain exactly one "op" member, whose value indicates the operation to perform. Its value must be one of "add", "remove", "replace", "move", "copy", or "test"; other values are errors. +json.exception.parse_error.106 | parse error: array index '01' must not begin with '0' | An array index in a JSON Pointer ([RFC 6901](https://tools.ietf.org/html/rfc6901)) may be `0` or any number without a leading `0`. +json.exception.parse_error.107 | parse error: JSON pointer must be empty or begin with '/' - was: 'foo' | A JSON Pointer must be a Unicode string containing a sequence of zero or more reference tokens, each prefixed by a `/` character. +json.exception.parse_error.108 | parse error: escape character '~' must be followed with '0' or '1' | In a JSON Pointer, only `~0` and `~1` are valid escape sequences. +json.exception.parse_error.109 | parse error: array index 'one' is not a number | A JSON Pointer array index must be a number. +json.exception.parse_error.110 | parse error at 1: cannot read 2 bytes from vector | When parsing CBOR or MessagePack, the byte vector ends before the complete value has been read. +json.exception.parse_error.112 | parse error at 1: error reading CBOR; last byte: 0xF8 | Not all types of CBOR or MessagePack are supported. This exception occurs if an unsupported byte was read. +json.exception.parse_error.113 | parse error at 2: expected a CBOR string; last byte: 0x98 | While parsing a map key, a value that is not a string has been read. +json.exception.parse_error.114 | parse error: Unsupported BSON record type 0x0F | The parsing of the corresponding BSON record type is not implemented (yet). +json.exception.parse_error.115 | parse error at byte 5: syntax error while parsing UBJSON high-precision number: invalid number text: 1A | A UBJSON high-precision number could not be parsed. + +@note For an input with n bytes, 1 is the index of the first character and n+1 + is the index of the terminating null byte or the end of file. This also + holds true when reading a byte vector (CBOR or MessagePack). + +@liveexample{The following code shows how a `parse_error` exception can be +caught.,parse_error} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class parse_error : public exception +{ + public: + /*! + @brief create a parse error exception + @param[in] id_ the id of the exception + @param[in] pos the position where the error occurred (or with + chars_read_total=0 if the position cannot be + determined) + @param[in] what_arg the explanatory string + @return parse_error object + */ + static parse_error create(int id_, const position_t& pos, const std::string& what_arg) + { + std::string w = exception::name("parse_error", id_) + "parse error" + + position_string(pos) + ": " + what_arg; + return parse_error(id_, pos.chars_read_total, w.c_str()); + } + + static parse_error create(int id_, std::size_t byte_, const std::string& what_arg) + { + std::string w = exception::name("parse_error", id_) + "parse error" + + (byte_ != 0 ? (" at byte " + std::to_string(byte_)) : "") + + ": " + what_arg; + return parse_error(id_, byte_, w.c_str()); + } + + /*! + @brief byte index of the parse error + + The byte index of the last read character in the input file. + + @note For an input with n bytes, 1 is the index of the first character and + n+1 is the index of the terminating null byte or the end of file. + This also holds true when reading a byte vector (CBOR or MessagePack). + */ + const std::size_t byte; + + private: + parse_error(int id_, std::size_t byte_, const char* what_arg) + : exception(id_, what_arg), byte(byte_) {} + + static std::string position_string(const position_t& pos) + { + return " at line " + std::to_string(pos.lines_read + 1) + + ", column " + std::to_string(pos.chars_read_current_line); + } +}; + +/*! +@brief exception indicating errors with iterators + +This exception is thrown if iterators passed to a library function do not match +the expected semantics. + +Exceptions have ids 2xx. + +name / id | example message | description +----------------------------------- | --------------- | ------------------------- +json.exception.invalid_iterator.201 | iterators are not compatible | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid. +json.exception.invalid_iterator.202 | iterator does not fit current value | In an erase or insert function, the passed iterator @a pos does not belong to the JSON value for which the function was called. It hence does not define a valid position for the deletion/insertion. +json.exception.invalid_iterator.203 | iterators do not fit current value | Either iterator passed to function @ref erase(IteratorType first, IteratorType last) does not belong to the JSON value from which values shall be erased. It hence does not define a valid range to delete values from. +json.exception.invalid_iterator.204 | iterators out of range | When an iterator range for a primitive type (number, boolean, or string) is passed to a constructor or an erase function, this range has to be exactly (@ref begin(), @ref end()), because this is the only way the single stored value is expressed. All other ranges are invalid. +json.exception.invalid_iterator.205 | iterator out of range | When an iterator for a primitive type (number, boolean, or string) is passed to an erase function, the iterator has to be the @ref begin() iterator, because it is the only way to address the stored value. All other iterators are invalid. +json.exception.invalid_iterator.206 | cannot construct with iterators from null | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) belong to a JSON null value and hence to not define a valid range. +json.exception.invalid_iterator.207 | cannot use key() for non-object iterators | The key() member function can only be used on iterators belonging to a JSON object, because other types do not have a concept of a key. +json.exception.invalid_iterator.208 | cannot use operator[] for object iterators | The operator[] to specify a concrete offset cannot be used on iterators belonging to a JSON object, because JSON objects are unordered. +json.exception.invalid_iterator.209 | cannot use offsets with object iterators | The offset operators (+, -, +=, -=) cannot be used on iterators belonging to a JSON object, because JSON objects are unordered. +json.exception.invalid_iterator.210 | iterators do not fit | The iterator range passed to the insert function are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid. +json.exception.invalid_iterator.211 | passed iterators may not belong to container | The iterator range passed to the insert function must not be a subrange of the container to insert to. +json.exception.invalid_iterator.212 | cannot compare iterators of different containers | When two iterators are compared, they must belong to the same container. +json.exception.invalid_iterator.213 | cannot compare order of object iterators | The order of object iterators cannot be compared, because JSON objects are unordered. +json.exception.invalid_iterator.214 | cannot get value | Cannot get value for iterator: Either the iterator belongs to a null value or it is an iterator to a primitive type (number, boolean, or string), but the iterator is different to @ref begin(). + +@liveexample{The following code shows how an `invalid_iterator` exception can be +caught.,invalid_iterator} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class invalid_iterator : public exception +{ + public: + static invalid_iterator create(int id_, const std::string& what_arg) + { + std::string w = exception::name("invalid_iterator", id_) + what_arg; + return invalid_iterator(id_, w.c_str()); + } + + private: + JSON_HEDLEY_NON_NULL(3) + invalid_iterator(int id_, const char* what_arg) + : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating executing a member function with a wrong type + +This exception is thrown in case of a type error; that is, a library function is +executed on a JSON value whose type does not match the expected semantics. + +Exceptions have ids 3xx. + +name / id | example message | description +----------------------------- | --------------- | ------------------------- +json.exception.type_error.301 | cannot create object from initializer list | To create an object from an initializer list, the initializer list must consist only of a list of pairs whose first element is a string. When this constraint is violated, an array is created instead. +json.exception.type_error.302 | type must be object, but is array | During implicit or explicit value conversion, the JSON type must be compatible to the target type. For instance, a JSON string can only be converted into string types, but not into numbers or boolean types. +json.exception.type_error.303 | incompatible ReferenceType for get_ref, actual type is object | To retrieve a reference to a value stored in a @ref basic_json object with @ref get_ref, the type of the reference must match the value type. For instance, for a JSON array, the @a ReferenceType must be @ref array_t &. +json.exception.type_error.304 | cannot use at() with string | The @ref at() member functions can only be executed for certain JSON types. +json.exception.type_error.305 | cannot use operator[] with string | The @ref operator[] member functions can only be executed for certain JSON types. +json.exception.type_error.306 | cannot use value() with string | The @ref value() member functions can only be executed for certain JSON types. +json.exception.type_error.307 | cannot use erase() with string | The @ref erase() member functions can only be executed for certain JSON types. +json.exception.type_error.308 | cannot use push_back() with string | The @ref push_back() and @ref operator+= member functions can only be executed for certain JSON types. +json.exception.type_error.309 | cannot use insert() with | The @ref insert() member functions can only be executed for certain JSON types. +json.exception.type_error.310 | cannot use swap() with number | The @ref swap() member functions can only be executed for certain JSON types. +json.exception.type_error.311 | cannot use emplace_back() with string | The @ref emplace_back() member function can only be executed for certain JSON types. +json.exception.type_error.312 | cannot use update() with string | The @ref update() member functions can only be executed for certain JSON types. +json.exception.type_error.313 | invalid value to unflatten | The @ref unflatten function converts an object whose keys are JSON Pointers back into an arbitrary nested JSON value. The JSON Pointers must not overlap, because then the resulting value would not be well defined. +json.exception.type_error.314 | only objects can be unflattened | The @ref unflatten function only works for an object whose keys are JSON Pointers. +json.exception.type_error.315 | values in object must be primitive | The @ref unflatten function only works for an object whose keys are JSON Pointers and whose values are primitive. +json.exception.type_error.316 | invalid UTF-8 byte at index 10: 0x7E | The @ref dump function only works with UTF-8 encoded strings; that is, if you assign a `std::string` to a JSON value, make sure it is UTF-8 encoded. | +json.exception.type_error.317 | JSON value cannot be serialized to requested format | The dynamic type of the object cannot be represented in the requested serialization format (e.g. a raw `true` or `null` JSON object cannot be serialized to BSON) | + +@liveexample{The following code shows how a `type_error` exception can be +caught.,type_error} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class type_error : public exception +{ + public: + static type_error create(int id_, const std::string& what_arg) + { + std::string w = exception::name("type_error", id_) + what_arg; + return type_error(id_, w.c_str()); + } + + private: + JSON_HEDLEY_NON_NULL(3) + type_error(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating access out of the defined range + +This exception is thrown in case a library function is called on an input +parameter that exceeds the expected range, for instance in case of array +indices or nonexisting object keys. + +Exceptions have ids 4xx. + +name / id | example message | description +------------------------------- | --------------- | ------------------------- +json.exception.out_of_range.401 | array index 3 is out of range | The provided array index @a i is larger than @a size-1. +json.exception.out_of_range.402 | array index '-' (3) is out of range | The special array index `-` in a JSON Pointer never describes a valid element of the array, but the index past the end. That is, it can only be used to add elements at this position, but not to read it. +json.exception.out_of_range.403 | key 'foo' not found | The provided key was not found in the JSON object. +json.exception.out_of_range.404 | unresolved reference token 'foo' | A reference token in a JSON Pointer could not be resolved. +json.exception.out_of_range.405 | JSON pointer has no parent | The JSON Patch operations 'remove' and 'add' can not be applied to the root element of the JSON value. +json.exception.out_of_range.406 | number overflow parsing '10E1000' | A parsed number could not be stored as without changing it to NaN or INF. +json.exception.out_of_range.407 | number overflow serializing '9223372036854775808' | UBJSON and BSON only support integer numbers up to 9223372036854775807. (until version 3.8.0) | +json.exception.out_of_range.408 | excessive array size: 8658170730974374167 | The size (following `#`) of an UBJSON array or object exceeds the maximal capacity. | +json.exception.out_of_range.409 | BSON key cannot contain code point U+0000 (at byte 2) | Key identifiers to be serialized to BSON cannot contain code point U+0000, since the key is stored as zero-terminated c-string | + +@liveexample{The following code shows how an `out_of_range` exception can be +caught.,out_of_range} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class out_of_range : public exception +{ + public: + static out_of_range create(int id_, const std::string& what_arg) + { + std::string w = exception::name("out_of_range", id_) + what_arg; + return out_of_range(id_, w.c_str()); + } + + private: + JSON_HEDLEY_NON_NULL(3) + out_of_range(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating other library errors + +This exception is thrown in case of errors that cannot be classified with the +other exception types. + +Exceptions have ids 5xx. + +name / id | example message | description +------------------------------ | --------------- | ------------------------- +json.exception.other_error.501 | unsuccessful: {"op":"test","path":"/baz", "value":"bar"} | A JSON Patch operation 'test' failed. The unsuccessful operation is also printed. + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range + +@liveexample{The following code shows how an `other_error` exception can be +caught.,other_error} + +@since version 3.0.0 +*/ +class other_error : public exception +{ + public: + static other_error create(int id_, const std::string& what_arg) + { + std::string w = exception::name("other_error", id_) + what_arg; + return other_error(id_, w.c_str()); + } + + private: + JSON_HEDLEY_NON_NULL(3) + other_error(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + + +#include // size_t +#include // conditional, enable_if, false_type, integral_constant, is_constructible, is_integral, is_same, remove_cv, remove_reference, true_type + +namespace nlohmann +{ +namespace detail +{ +// alias templates to reduce boilerplate +template +using enable_if_t = typename std::enable_if::type; + +template +using uncvref_t = typename std::remove_cv::type>::type; + +// implementation of C++14 index_sequence and affiliates +// source: https://stackoverflow.com/a/32223343 +template +struct index_sequence +{ + using type = index_sequence; + using value_type = std::size_t; + static constexpr std::size_t size() noexcept + { + return sizeof...(Ints); + } +}; + +template +struct merge_and_renumber; + +template +struct merge_and_renumber, index_sequence> + : index_sequence < I1..., (sizeof...(I1) + I2)... > {}; + +template +struct make_index_sequence + : merge_and_renumber < typename make_index_sequence < N / 2 >::type, + typename make_index_sequence < N - N / 2 >::type > {}; + +template<> struct make_index_sequence<0> : index_sequence<> {}; +template<> struct make_index_sequence<1> : index_sequence<0> {}; + +template +using index_sequence_for = make_index_sequence; + +// dispatch utility (taken from ranges-v3) +template struct priority_tag : priority_tag < N - 1 > {}; +template<> struct priority_tag<0> {}; + +// taken from ranges-v3 +template +struct static_const +{ + static constexpr T value{}; +}; + +template +constexpr T static_const::value; +} // namespace detail +} // namespace nlohmann + +// #include + + +#include // numeric_limits +#include // false_type, is_constructible, is_integral, is_same, true_type +#include // declval + +// #include + + +#include // random_access_iterator_tag + +// #include + + +namespace nlohmann +{ +namespace detail +{ +template struct make_void +{ + using type = void; +}; +template using void_t = typename make_void::type; +} // namespace detail +} // namespace nlohmann + +// #include + + +namespace nlohmann +{ +namespace detail +{ +template +struct iterator_types {}; + +template +struct iterator_types < + It, + void_t> +{ + using difference_type = typename It::difference_type; + using value_type = typename It::value_type; + using pointer = typename It::pointer; + using reference = typename It::reference; + using iterator_category = typename It::iterator_category; +}; + +// This is required as some compilers implement std::iterator_traits in a way that +// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341. +template +struct iterator_traits +{ +}; + +template +struct iterator_traits < T, enable_if_t < !std::is_pointer::value >> + : iterator_types +{ +}; + +template +struct iterator_traits::value>> +{ + using iterator_category = std::random_access_iterator_tag; + using value_type = T; + using difference_type = ptrdiff_t; + using pointer = T*; + using reference = T&; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + +// #include + + +#include + +// #include + + +// https://en.cppreference.com/w/cpp/experimental/is_detected +namespace nlohmann +{ +namespace detail +{ +struct nonesuch +{ + nonesuch() = delete; + ~nonesuch() = delete; + nonesuch(nonesuch const&) = delete; + nonesuch(nonesuch const&&) = delete; + void operator=(nonesuch const&) = delete; + void operator=(nonesuch&&) = delete; +}; + +template class Op, + class... Args> +struct detector +{ + using value_t = std::false_type; + using type = Default; +}; + +template class Op, class... Args> +struct detector>, Op, Args...> +{ + using value_t = std::true_type; + using type = Op; +}; + +template class Op, class... Args> +using is_detected = typename detector::value_t; + +template class Op, class... Args> +using detected_t = typename detector::type; + +template class Op, class... Args> +using detected_or = detector; + +template class Op, class... Args> +using detected_or_t = typename detected_or::type; + +template class Op, class... Args> +using is_detected_exact = std::is_same>; + +template class Op, class... Args> +using is_detected_convertible = + std::is_convertible, To>; +} // namespace detail +} // namespace nlohmann + +// #include +#ifndef INCLUDE_NLOHMANN_JSON_FWD_HPP_ +#define INCLUDE_NLOHMANN_JSON_FWD_HPP_ + +#include // int64_t, uint64_t +#include // map +#include // allocator +#include // string +#include // vector + +/*! +@brief namespace for Niels Lohmann +@see https://github.com/nlohmann +@since version 1.0.0 +*/ +namespace nlohmann +{ +/*! +@brief default JSONSerializer template argument + +This serializer ignores the template arguments and uses ADL +([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl)) +for serialization. +*/ +template +struct adl_serializer; + +template class ObjectType = + std::map, + template class ArrayType = std::vector, + class StringType = std::string, class BooleanType = bool, + class NumberIntegerType = std::int64_t, + class NumberUnsignedType = std::uint64_t, + class NumberFloatType = double, + template class AllocatorType = std::allocator, + template class JSONSerializer = + adl_serializer, + class BinaryType = std::vector> +class basic_json; + +/*! +@brief JSON Pointer + +A JSON pointer defines a string syntax for identifying a specific value +within a JSON document. It can be used with functions `at` and +`operator[]`. Furthermore, JSON pointers are the base for JSON patches. + +@sa [RFC 6901](https://tools.ietf.org/html/rfc6901) + +@since version 2.0.0 +*/ +template +class json_pointer; + +/*! +@brief default JSON class + +This type is the default specialization of the @ref basic_json class which +uses the standard template types. + +@since version 1.0.0 +*/ +using json = basic_json<>; + +template +struct ordered_map; + +/*! +@brief ordered JSON class + +This type preserves the insertion order of object keys. + +@since version 3.9.0 +*/ +using ordered_json = basic_json; + +} // namespace nlohmann + +#endif // INCLUDE_NLOHMANN_JSON_FWD_HPP_ + + +namespace nlohmann +{ +/*! +@brief detail namespace with internal helper functions + +This namespace collects functions that should not be exposed, +implementations of some @ref basic_json methods, and meta-programming helpers. + +@since version 2.1.0 +*/ +namespace detail +{ +///////////// +// helpers // +///////////// + +// Note to maintainers: +// +// Every trait in this file expects a non CV-qualified type. +// The only exceptions are in the 'aliases for detected' section +// (i.e. those of the form: decltype(T::member_function(std::declval()))) +// +// In this case, T has to be properly CV-qualified to constraint the function arguments +// (e.g. to_json(BasicJsonType&, const T&)) + +template struct is_basic_json : std::false_type {}; + +NLOHMANN_BASIC_JSON_TPL_DECLARATION +struct is_basic_json : std::true_type {}; + +////////////////////// +// json_ref helpers // +////////////////////// + +template +class json_ref; + +template +struct is_json_ref : std::false_type {}; + +template +struct is_json_ref> : std::true_type {}; + +////////////////////////// +// aliases for detected // +////////////////////////// + +template +using mapped_type_t = typename T::mapped_type; + +template +using key_type_t = typename T::key_type; + +template +using value_type_t = typename T::value_type; + +template +using difference_type_t = typename T::difference_type; + +template +using pointer_t = typename T::pointer; + +template +using reference_t = typename T::reference; + +template +using iterator_category_t = typename T::iterator_category; + +template +using iterator_t = typename T::iterator; + +template +using to_json_function = decltype(T::to_json(std::declval()...)); + +template +using from_json_function = decltype(T::from_json(std::declval()...)); + +template +using get_template_function = decltype(std::declval().template get()); + +// trait checking if JSONSerializer::from_json(json const&, udt&) exists +template +struct has_from_json : std::false_type {}; + +// trait checking if j.get is valid +// use this trait instead of std::is_constructible or std::is_convertible, +// both rely on, or make use of implicit conversions, and thus fail when T +// has several constructors/operator= (see https://github.com/nlohmann/json/issues/958) +template +struct is_getable +{ + static constexpr bool value = is_detected::value; +}; + +template +struct has_from_json < BasicJsonType, T, + enable_if_t < !is_basic_json::value >> +{ + using serializer = typename BasicJsonType::template json_serializer; + + static constexpr bool value = + is_detected_exact::value; +}; + +// This trait checks if JSONSerializer::from_json(json const&) exists +// this overload is used for non-default-constructible user-defined-types +template +struct has_non_default_from_json : std::false_type {}; + +template +struct has_non_default_from_json < BasicJsonType, T, enable_if_t < !is_basic_json::value >> +{ + using serializer = typename BasicJsonType::template json_serializer; + + static constexpr bool value = + is_detected_exact::value; +}; + +// This trait checks if BasicJsonType::json_serializer::to_json exists +// Do not evaluate the trait when T is a basic_json type, to avoid template instantiation infinite recursion. +template +struct has_to_json : std::false_type {}; + +template +struct has_to_json < BasicJsonType, T, enable_if_t < !is_basic_json::value >> +{ + using serializer = typename BasicJsonType::template json_serializer; + + static constexpr bool value = + is_detected_exact::value; +}; + + +/////////////////// +// is_ functions // +/////////////////// + +template +struct is_iterator_traits : std::false_type {}; + +template +struct is_iterator_traits> +{ + private: + using traits = iterator_traits; + + public: + static constexpr auto value = + is_detected::value && + is_detected::value && + is_detected::value && + is_detected::value && + is_detected::value; +}; + +// source: https://stackoverflow.com/a/37193089/4116453 + +template +struct is_complete_type : std::false_type {}; + +template +struct is_complete_type : std::true_type {}; + +template +struct is_compatible_object_type_impl : std::false_type {}; + +template +struct is_compatible_object_type_impl < + BasicJsonType, CompatibleObjectType, + enable_if_t < is_detected::value&& + is_detected::value >> +{ + + using object_t = typename BasicJsonType::object_t; + + // macOS's is_constructible does not play well with nonesuch... + static constexpr bool value = + std::is_constructible::value && + std::is_constructible::value; +}; + +template +struct is_compatible_object_type + : is_compatible_object_type_impl {}; + +template +struct is_constructible_object_type_impl : std::false_type {}; + +template +struct is_constructible_object_type_impl < + BasicJsonType, ConstructibleObjectType, + enable_if_t < is_detected::value&& + is_detected::value >> +{ + using object_t = typename BasicJsonType::object_t; + + static constexpr bool value = + (std::is_default_constructible::value && + (std::is_move_assignable::value || + std::is_copy_assignable::value) && + (std::is_constructible::value && + std::is_same < + typename object_t::mapped_type, + typename ConstructibleObjectType::mapped_type >::value)) || + (has_from_json::value || + has_non_default_from_json < + BasicJsonType, + typename ConstructibleObjectType::mapped_type >::value); +}; + +template +struct is_constructible_object_type + : is_constructible_object_type_impl {}; + +template +struct is_compatible_string_type_impl : std::false_type {}; + +template +struct is_compatible_string_type_impl < + BasicJsonType, CompatibleStringType, + enable_if_t::value >> +{ + static constexpr auto value = + std::is_constructible::value; +}; + +template +struct is_compatible_string_type + : is_compatible_string_type_impl {}; + +template +struct is_constructible_string_type_impl : std::false_type {}; + +template +struct is_constructible_string_type_impl < + BasicJsonType, ConstructibleStringType, + enable_if_t::value >> +{ + static constexpr auto value = + std::is_constructible::value; +}; + +template +struct is_constructible_string_type + : is_constructible_string_type_impl {}; + +template +struct is_compatible_array_type_impl : std::false_type {}; + +template +struct is_compatible_array_type_impl < + BasicJsonType, CompatibleArrayType, + enable_if_t < is_detected::value&& + is_detected::value&& +// This is needed because json_reverse_iterator has a ::iterator type... +// Therefore it is detected as a CompatibleArrayType. +// The real fix would be to have an Iterable concept. + !is_iterator_traits < + iterator_traits>::value >> +{ + static constexpr bool value = + std::is_constructible::value; +}; + +template +struct is_compatible_array_type + : is_compatible_array_type_impl {}; + +template +struct is_constructible_array_type_impl : std::false_type {}; + +template +struct is_constructible_array_type_impl < + BasicJsonType, ConstructibleArrayType, + enable_if_t::value >> + : std::true_type {}; + +template +struct is_constructible_array_type_impl < + BasicJsonType, ConstructibleArrayType, + enable_if_t < !std::is_same::value&& + std::is_default_constructible::value&& +(std::is_move_assignable::value || + std::is_copy_assignable::value)&& +is_detected::value&& +is_detected::value&& +is_complete_type < +detected_t>::value >> +{ + static constexpr bool value = + // This is needed because json_reverse_iterator has a ::iterator type, + // furthermore, std::back_insert_iterator (and other iterators) have a + // base class `iterator`... Therefore it is detected as a + // ConstructibleArrayType. The real fix would be to have an Iterable + // concept. + !is_iterator_traits>::value && + + (std::is_same::value || + has_from_json::value || + has_non_default_from_json < + BasicJsonType, typename ConstructibleArrayType::value_type >::value); +}; + +template +struct is_constructible_array_type + : is_constructible_array_type_impl {}; + +template +struct is_compatible_integer_type_impl : std::false_type {}; + +template +struct is_compatible_integer_type_impl < + RealIntegerType, CompatibleNumberIntegerType, + enable_if_t < std::is_integral::value&& + std::is_integral::value&& + !std::is_same::value >> +{ + // is there an assert somewhere on overflows? + using RealLimits = std::numeric_limits; + using CompatibleLimits = std::numeric_limits; + + static constexpr auto value = + std::is_constructible::value && + CompatibleLimits::is_integer && + RealLimits::is_signed == CompatibleLimits::is_signed; +}; + +template +struct is_compatible_integer_type + : is_compatible_integer_type_impl {}; + +template +struct is_compatible_type_impl: std::false_type {}; + +template +struct is_compatible_type_impl < + BasicJsonType, CompatibleType, + enable_if_t::value >> +{ + static constexpr bool value = + has_to_json::value; +}; + +template +struct is_compatible_type + : is_compatible_type_impl {}; + +// https://en.cppreference.com/w/cpp/types/conjunction +template struct conjunction : std::true_type { }; +template struct conjunction : B1 { }; +template +struct conjunction +: std::conditional, B1>::type {}; + +template +struct is_constructible_tuple : std::false_type {}; + +template +struct is_constructible_tuple> : conjunction...> {}; +} // namespace detail +} // namespace nlohmann + +// #include + + +#include // array +#include // size_t +#include // uint8_t +#include // string + +namespace nlohmann +{ +namespace detail +{ +/////////////////////////// +// JSON type enumeration // +/////////////////////////// + +/*! +@brief the JSON type enumeration + +This enumeration collects the different JSON types. It is internally used to +distinguish the stored values, and the functions @ref basic_json::is_null(), +@ref basic_json::is_object(), @ref basic_json::is_array(), +@ref basic_json::is_string(), @ref basic_json::is_boolean(), +@ref basic_json::is_number() (with @ref basic_json::is_number_integer(), +@ref basic_json::is_number_unsigned(), and @ref basic_json::is_number_float()), +@ref basic_json::is_discarded(), @ref basic_json::is_primitive(), and +@ref basic_json::is_structured() rely on it. + +@note There are three enumeration entries (number_integer, number_unsigned, and +number_float), because the library distinguishes these three types for numbers: +@ref basic_json::number_unsigned_t is used for unsigned integers, +@ref basic_json::number_integer_t is used for signed integers, and +@ref basic_json::number_float_t is used for floating-point numbers or to +approximate integers which do not fit in the limits of their respective type. + +@sa @ref basic_json::basic_json(const value_t value_type) -- create a JSON +value with the default value for a given type + +@since version 1.0.0 +*/ +enum class value_t : std::uint8_t +{ + null, ///< null value + object, ///< object (unordered set of name/value pairs) + array, ///< array (ordered collection of values) + string, ///< string value + boolean, ///< boolean value + number_integer, ///< number value (signed integer) + number_unsigned, ///< number value (unsigned integer) + number_float, ///< number value (floating-point) + binary, ///< binary array (ordered collection of bytes) + discarded ///< discarded by the parser callback function +}; + +/*! +@brief comparison operator for JSON types + +Returns an ordering that is similar to Python: +- order: null < boolean < number < object < array < string < binary +- furthermore, each type is not smaller than itself +- discarded values are not comparable +- binary is represented as a b"" string in python and directly comparable to a + string; however, making a binary array directly comparable with a string would + be surprising behavior in a JSON file. + +@since version 1.0.0 +*/ +inline bool operator<(const value_t lhs, const value_t rhs) noexcept +{ + static constexpr std::array order = {{ + 0 /* null */, 3 /* object */, 4 /* array */, 5 /* string */, + 1 /* boolean */, 2 /* integer */, 2 /* unsigned */, 2 /* float */, + 6 /* binary */ + } + }; + + const auto l_index = static_cast(lhs); + const auto r_index = static_cast(rhs); + return l_index < order.size() && r_index < order.size() && order[l_index] < order[r_index]; +} +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +template +void from_json(const BasicJsonType& j, typename std::nullptr_t& n) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_null())) + { + JSON_THROW(type_error::create(302, "type must be null, but is " + std::string(j.type_name()))); + } + n = nullptr; +} + +// overloads for basic_json template parameters +template < typename BasicJsonType, typename ArithmeticType, + enable_if_t < std::is_arithmetic::value&& + !std::is_same::value, + int > = 0 > +void get_arithmetic_value(const BasicJsonType& j, ArithmeticType& val) +{ + switch (static_cast(j)) + { + case value_t::number_unsigned: + { + val = static_cast(*j.template get_ptr()); + break; + } + case value_t::number_integer: + { + val = static_cast(*j.template get_ptr()); + break; + } + case value_t::number_float: + { + val = static_cast(*j.template get_ptr()); + break; + } + + default: + JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name()))); + } +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::boolean_t& b) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_boolean())) + { + JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(j.type_name()))); + } + b = *j.template get_ptr(); +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::string_t& s) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_string())) + { + JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name()))); + } + s = *j.template get_ptr(); +} + +template < + typename BasicJsonType, typename ConstructibleStringType, + enable_if_t < + is_constructible_string_type::value&& + !std::is_same::value, + int > = 0 > +void from_json(const BasicJsonType& j, ConstructibleStringType& s) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_string())) + { + JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name()))); + } + + s = *j.template get_ptr(); +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::number_float_t& val) +{ + get_arithmetic_value(j, val); +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::number_unsigned_t& val) +{ + get_arithmetic_value(j, val); +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::number_integer_t& val) +{ + get_arithmetic_value(j, val); +} + +template::value, int> = 0> +void from_json(const BasicJsonType& j, EnumType& e) +{ + typename std::underlying_type::type val; + get_arithmetic_value(j, val); + e = static_cast(val); +} + +// forward_list doesn't have an insert method +template::value, int> = 0> +void from_json(const BasicJsonType& j, std::forward_list& l) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + l.clear(); + std::transform(j.rbegin(), j.rend(), + std::front_inserter(l), [](const BasicJsonType & i) + { + return i.template get(); + }); +} + +// valarray doesn't have an insert method +template::value, int> = 0> +void from_json(const BasicJsonType& j, std::valarray& l) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + l.resize(j.size()); + std::transform(j.begin(), j.end(), std::begin(l), + [](const BasicJsonType & elem) + { + return elem.template get(); + }); +} + +template +auto from_json(const BasicJsonType& j, T (&arr)[N]) +-> decltype(j.template get(), void()) +{ + for (std::size_t i = 0; i < N; ++i) + { + arr[i] = j.at(i).template get(); + } +} + +template +void from_json_array_impl(const BasicJsonType& j, typename BasicJsonType::array_t& arr, priority_tag<3> /*unused*/) +{ + arr = *j.template get_ptr(); +} + +template +auto from_json_array_impl(const BasicJsonType& j, std::array& arr, + priority_tag<2> /*unused*/) +-> decltype(j.template get(), void()) +{ + for (std::size_t i = 0; i < N; ++i) + { + arr[i] = j.at(i).template get(); + } +} + +template +auto from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, priority_tag<1> /*unused*/) +-> decltype( + arr.reserve(std::declval()), + j.template get(), + void()) +{ + using std::end; + + ConstructibleArrayType ret; + ret.reserve(j.size()); + std::transform(j.begin(), j.end(), + std::inserter(ret, end(ret)), [](const BasicJsonType & i) + { + // get() returns *this, this won't call a from_json + // method when value_type is BasicJsonType + return i.template get(); + }); + arr = std::move(ret); +} + +template +void from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, + priority_tag<0> /*unused*/) +{ + using std::end; + + ConstructibleArrayType ret; + std::transform( + j.begin(), j.end(), std::inserter(ret, end(ret)), + [](const BasicJsonType & i) + { + // get() returns *this, this won't call a from_json + // method when value_type is BasicJsonType + return i.template get(); + }); + arr = std::move(ret); +} + +template < typename BasicJsonType, typename ConstructibleArrayType, + enable_if_t < + is_constructible_array_type::value&& + !is_constructible_object_type::value&& + !is_constructible_string_type::value&& + !std::is_same::value&& + !is_basic_json::value, + int > = 0 > +auto from_json(const BasicJsonType& j, ConstructibleArrayType& arr) +-> decltype(from_json_array_impl(j, arr, priority_tag<3> {}), +j.template get(), +void()) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + + std::string(j.type_name()))); + } + + from_json_array_impl(j, arr, priority_tag<3> {}); +} + +template +void from_json(const BasicJsonType& j, typename BasicJsonType::binary_t& bin) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_binary())) + { + JSON_THROW(type_error::create(302, "type must be binary, but is " + std::string(j.type_name()))); + } + + bin = *j.template get_ptr(); +} + +template::value, int> = 0> +void from_json(const BasicJsonType& j, ConstructibleObjectType& obj) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_object())) + { + JSON_THROW(type_error::create(302, "type must be object, but is " + std::string(j.type_name()))); + } + + ConstructibleObjectType ret; + auto inner_object = j.template get_ptr(); + using value_type = typename ConstructibleObjectType::value_type; + std::transform( + inner_object->begin(), inner_object->end(), + std::inserter(ret, ret.begin()), + [](typename BasicJsonType::object_t::value_type const & p) + { + return value_type(p.first, p.second.template get()); + }); + obj = std::move(ret); +} + +// overload for arithmetic types, not chosen for basic_json template arguments +// (BooleanType, etc..); note: Is it really necessary to provide explicit +// overloads for boolean_t etc. in case of a custom BooleanType which is not +// an arithmetic type? +template < typename BasicJsonType, typename ArithmeticType, + enable_if_t < + std::is_arithmetic::value&& + !std::is_same::value&& + !std::is_same::value&& + !std::is_same::value&& + !std::is_same::value, + int > = 0 > +void from_json(const BasicJsonType& j, ArithmeticType& val) +{ + switch (static_cast(j)) + { + case value_t::number_unsigned: + { + val = static_cast(*j.template get_ptr()); + break; + } + case value_t::number_integer: + { + val = static_cast(*j.template get_ptr()); + break; + } + case value_t::number_float: + { + val = static_cast(*j.template get_ptr()); + break; + } + case value_t::boolean: + { + val = static_cast(*j.template get_ptr()); + break; + } + + default: + JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name()))); + } +} + +template +void from_json(const BasicJsonType& j, std::pair& p) +{ + p = {j.at(0).template get(), j.at(1).template get()}; +} + +template +void from_json_tuple_impl(const BasicJsonType& j, Tuple& t, index_sequence /*unused*/) +{ + t = std::make_tuple(j.at(Idx).template get::type>()...); +} + +template +void from_json(const BasicJsonType& j, std::tuple& t) +{ + from_json_tuple_impl(j, t, index_sequence_for {}); +} + +template < typename BasicJsonType, typename Key, typename Value, typename Compare, typename Allocator, + typename = enable_if_t < !std::is_constructible < + typename BasicJsonType::string_t, Key >::value >> +void from_json(const BasicJsonType& j, std::map& m) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + m.clear(); + for (const auto& p : j) + { + if (JSON_HEDLEY_UNLIKELY(!p.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name()))); + } + m.emplace(p.at(0).template get(), p.at(1).template get()); + } +} + +template < typename BasicJsonType, typename Key, typename Value, typename Hash, typename KeyEqual, typename Allocator, + typename = enable_if_t < !std::is_constructible < + typename BasicJsonType::string_t, Key >::value >> +void from_json(const BasicJsonType& j, std::unordered_map& m) +{ + if (JSON_HEDLEY_UNLIKELY(!j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + m.clear(); + for (const auto& p : j) + { + if (JSON_HEDLEY_UNLIKELY(!p.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name()))); + } + m.emplace(p.at(0).template get(), p.at(1).template get()); + } +} + +struct from_json_fn +{ + template + auto operator()(const BasicJsonType& j, T& val) const + noexcept(noexcept(from_json(j, val))) + -> decltype(from_json(j, val), void()) + { + return from_json(j, val); + } +}; +} // namespace detail + +/// namespace to hold default `from_json` function +/// to see why this is required: +/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html +namespace +{ +constexpr const auto& from_json = detail::static_const::value; +} // namespace +} // namespace nlohmann + +// #include + + +#include // copy +#include // begin, end +#include // string +#include // tuple, get +#include // is_same, is_constructible, is_floating_point, is_enum, underlying_type +#include // move, forward, declval, pair +#include // valarray +#include // vector + +// #include + + +#include // size_t +#include // input_iterator_tag +#include // string, to_string +#include // tuple_size, get, tuple_element + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +template +void int_to_string( string_type& target, std::size_t value ) +{ + // For ADL + using std::to_string; + target = to_string(value); +} +template class iteration_proxy_value +{ + public: + using difference_type = std::ptrdiff_t; + using value_type = iteration_proxy_value; + using pointer = value_type * ; + using reference = value_type & ; + using iterator_category = std::input_iterator_tag; + using string_type = typename std::remove_cv< typename std::remove_reference().key() ) >::type >::type; + + private: + /// the iterator + IteratorType anchor; + /// an index for arrays (used to create key names) + std::size_t array_index = 0; + /// last stringified array index + mutable std::size_t array_index_last = 0; + /// a string representation of the array index + mutable string_type array_index_str = "0"; + /// an empty string (to return a reference for primitive values) + const string_type empty_str = ""; + + public: + explicit iteration_proxy_value(IteratorType it) noexcept : anchor(it) {} + + /// dereference operator (needed for range-based for) + iteration_proxy_value& operator*() + { + return *this; + } + + /// increment operator (needed for range-based for) + iteration_proxy_value& operator++() + { + ++anchor; + ++array_index; + + return *this; + } + + /// equality operator (needed for InputIterator) + bool operator==(const iteration_proxy_value& o) const + { + return anchor == o.anchor; + } + + /// inequality operator (needed for range-based for) + bool operator!=(const iteration_proxy_value& o) const + { + return anchor != o.anchor; + } + + /// return key of the iterator + const string_type& key() const + { + JSON_ASSERT(anchor.m_object != nullptr); + + switch (anchor.m_object->type()) + { + // use integer array index as key + case value_t::array: + { + if (array_index != array_index_last) + { + int_to_string( array_index_str, array_index ); + array_index_last = array_index; + } + return array_index_str; + } + + // use key from the object + case value_t::object: + return anchor.key(); + + // use an empty key for all primitive types + default: + return empty_str; + } + } + + /// return value of the iterator + typename IteratorType::reference value() const + { + return anchor.value(); + } +}; + +/// proxy class for the items() function +template class iteration_proxy +{ + private: + /// the container to iterate + typename IteratorType::reference container; + + public: + /// construct iteration proxy from a container + explicit iteration_proxy(typename IteratorType::reference cont) noexcept + : container(cont) {} + + /// return iterator begin (needed for range-based for) + iteration_proxy_value begin() noexcept + { + return iteration_proxy_value(container.begin()); + } + + /// return iterator end (needed for range-based for) + iteration_proxy_value end() noexcept + { + return iteration_proxy_value(container.end()); + } +}; +// Structured Bindings Support +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +template = 0> +auto get(const nlohmann::detail::iteration_proxy_value& i) -> decltype(i.key()) +{ + return i.key(); +} +// Structured Bindings Support +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +template = 0> +auto get(const nlohmann::detail::iteration_proxy_value& i) -> decltype(i.value()) +{ + return i.value(); +} +} // namespace detail +} // namespace nlohmann + +// The Addition to the STD Namespace is required to add +// Structured Bindings Support to the iteration_proxy_value class +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +namespace std +{ +#if defined(__clang__) + // Fix: https://github.com/nlohmann/json/issues/1401 + #pragma clang diagnostic push + #pragma clang diagnostic ignored "-Wmismatched-tags" +#endif +template +class tuple_size<::nlohmann::detail::iteration_proxy_value> + : public std::integral_constant {}; + +template +class tuple_element> +{ + public: + using type = decltype( + get(std::declval < + ::nlohmann::detail::iteration_proxy_value> ())); +}; +#if defined(__clang__) + #pragma clang diagnostic pop +#endif +} // namespace std + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +////////////////// +// constructors // +////////////////// + +template struct external_constructor; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, typename BasicJsonType::boolean_t b) noexcept + { + j.m_type = value_t::boolean; + j.m_value = b; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, const typename BasicJsonType::string_t& s) + { + j.m_type = value_t::string; + j.m_value = s; + j.assert_invariant(); + } + + template + static void construct(BasicJsonType& j, typename BasicJsonType::string_t&& s) + { + j.m_type = value_t::string; + j.m_value = std::move(s); + j.assert_invariant(); + } + + template < typename BasicJsonType, typename CompatibleStringType, + enable_if_t < !std::is_same::value, + int > = 0 > + static void construct(BasicJsonType& j, const CompatibleStringType& str) + { + j.m_type = value_t::string; + j.m_value.string = j.template create(str); + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, const typename BasicJsonType::binary_t& b) + { + j.m_type = value_t::binary; + typename BasicJsonType::binary_t value{b}; + j.m_value = value; + j.assert_invariant(); + } + + template + static void construct(BasicJsonType& j, typename BasicJsonType::binary_t&& b) + { + j.m_type = value_t::binary; + typename BasicJsonType::binary_t value{std::move(b)}; + j.m_value = value; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, typename BasicJsonType::number_float_t val) noexcept + { + j.m_type = value_t::number_float; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, typename BasicJsonType::number_unsigned_t val) noexcept + { + j.m_type = value_t::number_unsigned; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, typename BasicJsonType::number_integer_t val) noexcept + { + j.m_type = value_t::number_integer; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, const typename BasicJsonType::array_t& arr) + { + j.m_type = value_t::array; + j.m_value = arr; + j.assert_invariant(); + } + + template + static void construct(BasicJsonType& j, typename BasicJsonType::array_t&& arr) + { + j.m_type = value_t::array; + j.m_value = std::move(arr); + j.assert_invariant(); + } + + template < typename BasicJsonType, typename CompatibleArrayType, + enable_if_t < !std::is_same::value, + int > = 0 > + static void construct(BasicJsonType& j, const CompatibleArrayType& arr) + { + using std::begin; + using std::end; + j.m_type = value_t::array; + j.m_value.array = j.template create(begin(arr), end(arr)); + j.assert_invariant(); + } + + template + static void construct(BasicJsonType& j, const std::vector& arr) + { + j.m_type = value_t::array; + j.m_value = value_t::array; + j.m_value.array->reserve(arr.size()); + for (const bool x : arr) + { + j.m_value.array->push_back(x); + } + j.assert_invariant(); + } + + template::value, int> = 0> + static void construct(BasicJsonType& j, const std::valarray& arr) + { + j.m_type = value_t::array; + j.m_value = value_t::array; + j.m_value.array->resize(arr.size()); + if (arr.size() > 0) + { + std::copy(std::begin(arr), std::end(arr), j.m_value.array->begin()); + } + j.assert_invariant(); + } +}; + +template<> +struct external_constructor +{ + template + static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj) + { + j.m_type = value_t::object; + j.m_value = obj; + j.assert_invariant(); + } + + template + static void construct(BasicJsonType& j, typename BasicJsonType::object_t&& obj) + { + j.m_type = value_t::object; + j.m_value = std::move(obj); + j.assert_invariant(); + } + + template < typename BasicJsonType, typename CompatibleObjectType, + enable_if_t < !std::is_same::value, int > = 0 > + static void construct(BasicJsonType& j, const CompatibleObjectType& obj) + { + using std::begin; + using std::end; + + j.m_type = value_t::object; + j.m_value.object = j.template create(begin(obj), end(obj)); + j.assert_invariant(); + } +}; + +///////////// +// to_json // +///////////// + +template::value, int> = 0> +void to_json(BasicJsonType& j, T b) noexcept +{ + external_constructor::construct(j, b); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, const CompatibleString& s) +{ + external_constructor::construct(j, s); +} + +template +void to_json(BasicJsonType& j, typename BasicJsonType::string_t&& s) +{ + external_constructor::construct(j, std::move(s)); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, FloatType val) noexcept +{ + external_constructor::construct(j, static_cast(val)); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, CompatibleNumberUnsignedType val) noexcept +{ + external_constructor::construct(j, static_cast(val)); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, CompatibleNumberIntegerType val) noexcept +{ + external_constructor::construct(j, static_cast(val)); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, EnumType e) noexcept +{ + using underlying_type = typename std::underlying_type::type; + external_constructor::construct(j, static_cast(e)); +} + +template +void to_json(BasicJsonType& j, const std::vector& e) +{ + external_constructor::construct(j, e); +} + +template < typename BasicJsonType, typename CompatibleArrayType, + enable_if_t < is_compatible_array_type::value&& + !is_compatible_object_type::value&& + !is_compatible_string_type::value&& + !std::is_same::value&& + !is_basic_json::value, + int > = 0 > +void to_json(BasicJsonType& j, const CompatibleArrayType& arr) +{ + external_constructor::construct(j, arr); +} + +template +void to_json(BasicJsonType& j, const typename BasicJsonType::binary_t& bin) +{ + external_constructor::construct(j, bin); +} + +template::value, int> = 0> +void to_json(BasicJsonType& j, const std::valarray& arr) +{ + external_constructor::construct(j, std::move(arr)); +} + +template +void to_json(BasicJsonType& j, typename BasicJsonType::array_t&& arr) +{ + external_constructor::construct(j, std::move(arr)); +} + +template < typename BasicJsonType, typename CompatibleObjectType, + enable_if_t < is_compatible_object_type::value&& !is_basic_json::value, int > = 0 > +void to_json(BasicJsonType& j, const CompatibleObjectType& obj) +{ + external_constructor::construct(j, obj); +} + +template +void to_json(BasicJsonType& j, typename BasicJsonType::object_t&& obj) +{ + external_constructor::construct(j, std::move(obj)); +} + +template < + typename BasicJsonType, typename T, std::size_t N, + enable_if_t < !std::is_constructible::value, + int > = 0 > +void to_json(BasicJsonType& j, const T(&arr)[N]) +{ + external_constructor::construct(j, arr); +} + +template < typename BasicJsonType, typename T1, typename T2, enable_if_t < std::is_constructible::value&& std::is_constructible::value, int > = 0 > +void to_json(BasicJsonType& j, const std::pair& p) +{ + j = { p.first, p.second }; +} + +// for https://github.com/nlohmann/json/pull/1134 +template>::value, int> = 0> +void to_json(BasicJsonType& j, const T& b) +{ + j = { {b.key(), b.value()} }; +} + +template +void to_json_tuple_impl(BasicJsonType& j, const Tuple& t, index_sequence /*unused*/) +{ + j = { std::get(t)... }; +} + +template::value, int > = 0> +void to_json(BasicJsonType& j, const T& t) +{ + to_json_tuple_impl(j, t, make_index_sequence::value> {}); +} + +struct to_json_fn +{ + template + auto operator()(BasicJsonType& j, T&& val) const noexcept(noexcept(to_json(j, std::forward(val)))) + -> decltype(to_json(j, std::forward(val)), void()) + { + return to_json(j, std::forward(val)); + } +}; +} // namespace detail + +/// namespace to hold default `to_json` function +namespace +{ +constexpr const auto& to_json = detail::static_const::value; +} // namespace +} // namespace nlohmann + + +namespace nlohmann +{ + +template +struct adl_serializer +{ + /*! + @brief convert a JSON value to any value type + + This function is usually called by the `get()` function of the + @ref basic_json class (either explicit or via conversion operators). + + @param[in] j JSON value to read from + @param[in,out] val value to write to + */ + template + static auto from_json(BasicJsonType&& j, ValueType& val) noexcept( + noexcept(::nlohmann::from_json(std::forward(j), val))) + -> decltype(::nlohmann::from_json(std::forward(j), val), void()) + { + ::nlohmann::from_json(std::forward(j), val); + } + + /*! + @brief convert any value type to a JSON value + + This function is usually called by the constructors of the @ref basic_json + class. + + @param[in,out] j JSON value to write to + @param[in] val value to read from + */ + template + static auto to_json(BasicJsonType& j, ValueType&& val) noexcept( + noexcept(::nlohmann::to_json(j, std::forward(val)))) + -> decltype(::nlohmann::to_json(j, std::forward(val)), void()) + { + ::nlohmann::to_json(j, std::forward(val)); + } +}; + +} // namespace nlohmann + +// #include + + +#include // uint8_t +#include // tie +#include // move + +namespace nlohmann +{ + +/*! +@brief an internal type for a backed binary type + +This type extends the template parameter @a BinaryType provided to `basic_json` +with a subtype used by BSON and MessagePack. This type exists so that the user +does not have to specify a type themselves with a specific naming scheme in +order to override the binary type. + +@tparam BinaryType container to store bytes (`std::vector` by + default) + +@since version 3.8.0 +*/ +template +class byte_container_with_subtype : public BinaryType +{ + public: + /// the type of the underlying container + using container_type = BinaryType; + + byte_container_with_subtype() noexcept(noexcept(container_type())) + : container_type() + {} + + byte_container_with_subtype(const container_type& b) noexcept(noexcept(container_type(b))) + : container_type(b) + {} + + byte_container_with_subtype(container_type&& b) noexcept(noexcept(container_type(std::move(b)))) + : container_type(std::move(b)) + {} + + byte_container_with_subtype(const container_type& b, std::uint8_t subtype) noexcept(noexcept(container_type(b))) + : container_type(b) + , m_subtype(subtype) + , m_has_subtype(true) + {} + + byte_container_with_subtype(container_type&& b, std::uint8_t subtype) noexcept(noexcept(container_type(std::move(b)))) + : container_type(std::move(b)) + , m_subtype(subtype) + , m_has_subtype(true) + {} + + bool operator==(const byte_container_with_subtype& rhs) const + { + return std::tie(static_cast(*this), m_subtype, m_has_subtype) == + std::tie(static_cast(rhs), rhs.m_subtype, rhs.m_has_subtype); + } + + bool operator!=(const byte_container_with_subtype& rhs) const + { + return !(rhs == *this); + } + + /*! + @brief sets the binary subtype + + Sets the binary subtype of the value, also flags a binary JSON value as + having a subtype, which has implications for serialization. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @sa @ref subtype() -- return the binary subtype + @sa @ref clear_subtype() -- clears the binary subtype + @sa @ref has_subtype() -- returns whether or not the binary value has a + subtype + + @since version 3.8.0 + */ + void set_subtype(std::uint8_t subtype) noexcept + { + m_subtype = subtype; + m_has_subtype = true; + } + + /*! + @brief return the binary subtype + + Returns the numerical subtype of the value if it has a subtype. If it does + not have a subtype, this function will return size_t(-1) as a sentinel + value. + + @return the numerical subtype of the binary value + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @sa @ref set_subtype() -- sets the binary subtype + @sa @ref clear_subtype() -- clears the binary subtype + @sa @ref has_subtype() -- returns whether or not the binary value has a + subtype + + @since version 3.8.0 + */ + constexpr std::uint8_t subtype() const noexcept + { + return m_subtype; + } + + /*! + @brief return whether the value has a subtype + + @return whether the value has a subtype + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @sa @ref subtype() -- return the binary subtype + @sa @ref set_subtype() -- sets the binary subtype + @sa @ref clear_subtype() -- clears the binary subtype + + @since version 3.8.0 + */ + constexpr bool has_subtype() const noexcept + { + return m_has_subtype; + } + + /*! + @brief clears the binary subtype + + Clears the binary subtype and flags the value as not having a subtype, which + has implications for serialization; for instance MessagePack will prefer the + bin family over the ext family. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @sa @ref subtype() -- return the binary subtype + @sa @ref set_subtype() -- sets the binary subtype + @sa @ref has_subtype() -- returns whether or not the binary value has a + subtype + + @since version 3.8.0 + */ + void clear_subtype() noexcept + { + m_subtype = 0; + m_has_subtype = false; + } + + private: + std::uint8_t m_subtype = 0; + bool m_has_subtype = false; +}; + +} // namespace nlohmann + +// #include + +// #include + +// #include + +// #include + + +#include // size_t, uint8_t +#include // hash + +namespace nlohmann +{ +namespace detail +{ + +// boost::hash_combine +inline std::size_t combine(std::size_t seed, std::size_t h) noexcept +{ + seed ^= h + 0x9e3779b9 + (seed << 6U) + (seed >> 2U); + return seed; +} + +/*! +@brief hash a JSON value + +The hash function tries to rely on std::hash where possible. Furthermore, the +type of the JSON value is taken into account to have different hash values for +null, 0, 0U, and false, etc. + +@tparam BasicJsonType basic_json specialization +@param j JSON value to hash +@return hash value of j +*/ +template +std::size_t hash(const BasicJsonType& j) +{ + using string_t = typename BasicJsonType::string_t; + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + + const auto type = static_cast(j.type()); + switch (j.type()) + { + case BasicJsonType::value_t::null: + case BasicJsonType::value_t::discarded: + { + return combine(type, 0); + } + + case BasicJsonType::value_t::object: + { + auto seed = combine(type, j.size()); + for (const auto& element : j.items()) + { + const auto h = std::hash {}(element.key()); + seed = combine(seed, h); + seed = combine(seed, hash(element.value())); + } + return seed; + } + + case BasicJsonType::value_t::array: + { + auto seed = combine(type, j.size()); + for (const auto& element : j) + { + seed = combine(seed, hash(element)); + } + return seed; + } + + case BasicJsonType::value_t::string: + { + const auto h = std::hash {}(j.template get_ref()); + return combine(type, h); + } + + case BasicJsonType::value_t::boolean: + { + const auto h = std::hash {}(j.template get()); + return combine(type, h); + } + + case BasicJsonType::value_t::number_integer: + { + const auto h = std::hash {}(j.template get()); + return combine(type, h); + } + + case nlohmann::detail::value_t::number_unsigned: + { + const auto h = std::hash {}(j.template get()); + return combine(type, h); + } + + case nlohmann::detail::value_t::number_float: + { + const auto h = std::hash {}(j.template get()); + return combine(type, h); + } + + case nlohmann::detail::value_t::binary: + { + auto seed = combine(type, j.get_binary().size()); + const auto h = std::hash {}(j.get_binary().has_subtype()); + seed = combine(seed, h); + seed = combine(seed, j.get_binary().subtype()); + for (const auto byte : j.get_binary()) + { + seed = combine(seed, std::hash {}(byte)); + } + return seed; + } + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } +} + +} // namespace detail +} // namespace nlohmann + +// #include + + +#include // generate_n +#include // array +#include // ldexp +#include // size_t +#include // uint8_t, uint16_t, uint32_t, uint64_t +#include // snprintf +#include // memcpy +#include // back_inserter +#include // numeric_limits +#include // char_traits, string +#include // make_pair, move + +// #include + +// #include + + +#include // array +#include // size_t +#include //FILE * +#include // strlen +#include // istream +#include // begin, end, iterator_traits, random_access_iterator_tag, distance, next +#include // shared_ptr, make_shared, addressof +#include // accumulate +#include // string, char_traits +#include // enable_if, is_base_of, is_pointer, is_integral, remove_pointer +#include // pair, declval + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +/// the supported input formats +enum class input_format_t { json, cbor, msgpack, ubjson, bson }; + +//////////////////// +// input adapters // +//////////////////// + +/*! +Input adapter for stdio file access. This adapter read only 1 byte and do not use any + buffer. This adapter is a very low level adapter. +*/ +class file_input_adapter +{ + public: + using char_type = char; + + JSON_HEDLEY_NON_NULL(2) + explicit file_input_adapter(std::FILE* f) noexcept + : m_file(f) + {} + + // make class move-only + file_input_adapter(const file_input_adapter&) = delete; + file_input_adapter(file_input_adapter&&) = default; + file_input_adapter& operator=(const file_input_adapter&) = delete; + file_input_adapter& operator=(file_input_adapter&&) = delete; + + std::char_traits::int_type get_character() noexcept + { + return std::fgetc(m_file); + } + + private: + /// the file pointer to read from + std::FILE* m_file; +}; + + +/*! +Input adapter for a (caching) istream. Ignores a UFT Byte Order Mark at +beginning of input. Does not support changing the underlying std::streambuf +in mid-input. Maintains underlying std::istream and std::streambuf to support +subsequent use of standard std::istream operations to process any input +characters following those used in parsing the JSON input. Clears the +std::istream flags; any input errors (e.g., EOF) will be detected by the first +subsequent call for input from the std::istream. +*/ +class input_stream_adapter +{ + public: + using char_type = char; + + ~input_stream_adapter() + { + // clear stream flags; we use underlying streambuf I/O, do not + // maintain ifstream flags, except eof + if (is != nullptr) + { + is->clear(is->rdstate() & std::ios::eofbit); + } + } + + explicit input_stream_adapter(std::istream& i) + : is(&i), sb(i.rdbuf()) + {} + + // delete because of pointer members + input_stream_adapter(const input_stream_adapter&) = delete; + input_stream_adapter& operator=(input_stream_adapter&) = delete; + input_stream_adapter& operator=(input_stream_adapter&& rhs) = delete; + + input_stream_adapter(input_stream_adapter&& rhs) noexcept : is(rhs.is), sb(rhs.sb) + { + rhs.is = nullptr; + rhs.sb = nullptr; + } + + // std::istream/std::streambuf use std::char_traits::to_int_type, to + // ensure that std::char_traits::eof() and the character 0xFF do not + // end up as the same value, eg. 0xFFFFFFFF. + std::char_traits::int_type get_character() + { + auto res = sb->sbumpc(); + // set eof manually, as we don't use the istream interface. + if (JSON_HEDLEY_UNLIKELY(res == EOF)) + { + is->clear(is->rdstate() | std::ios::eofbit); + } + return res; + } + + private: + /// the associated input stream + std::istream* is = nullptr; + std::streambuf* sb = nullptr; +}; + +// General-purpose iterator-based adapter. It might not be as fast as +// theoretically possible for some containers, but it is extremely versatile. +template +class iterator_input_adapter +{ + public: + using char_type = typename std::iterator_traits::value_type; + + iterator_input_adapter(IteratorType first, IteratorType last) + : current(std::move(first)), end(std::move(last)) {} + + typename std::char_traits::int_type get_character() + { + if (JSON_HEDLEY_LIKELY(current != end)) + { + auto result = std::char_traits::to_int_type(*current); + std::advance(current, 1); + return result; + } + else + { + return std::char_traits::eof(); + } + } + + private: + IteratorType current; + IteratorType end; + + template + friend struct wide_string_input_helper; + + bool empty() const + { + return current == end; + } + +}; + + +template +struct wide_string_input_helper; + +template +struct wide_string_input_helper +{ + // UTF-32 + static void fill_buffer(BaseInputAdapter& input, + std::array::int_type, 4>& utf8_bytes, + size_t& utf8_bytes_index, + size_t& utf8_bytes_filled) + { + utf8_bytes_index = 0; + + if (JSON_HEDLEY_UNLIKELY(input.empty())) + { + utf8_bytes[0] = std::char_traits::eof(); + utf8_bytes_filled = 1; + } + else + { + // get the current character + const auto wc = input.get_character(); + + // UTF-32 to UTF-8 encoding + if (wc < 0x80) + { + utf8_bytes[0] = static_cast::int_type>(wc); + utf8_bytes_filled = 1; + } + else if (wc <= 0x7FF) + { + utf8_bytes[0] = static_cast::int_type>(0xC0u | ((static_cast(wc) >> 6u) & 0x1Fu)); + utf8_bytes[1] = static_cast::int_type>(0x80u | (static_cast(wc) & 0x3Fu)); + utf8_bytes_filled = 2; + } + else if (wc <= 0xFFFF) + { + utf8_bytes[0] = static_cast::int_type>(0xE0u | ((static_cast(wc) >> 12u) & 0x0Fu)); + utf8_bytes[1] = static_cast::int_type>(0x80u | ((static_cast(wc) >> 6u) & 0x3Fu)); + utf8_bytes[2] = static_cast::int_type>(0x80u | (static_cast(wc) & 0x3Fu)); + utf8_bytes_filled = 3; + } + else if (wc <= 0x10FFFF) + { + utf8_bytes[0] = static_cast::int_type>(0xF0u | ((static_cast(wc) >> 18u) & 0x07u)); + utf8_bytes[1] = static_cast::int_type>(0x80u | ((static_cast(wc) >> 12u) & 0x3Fu)); + utf8_bytes[2] = static_cast::int_type>(0x80u | ((static_cast(wc) >> 6u) & 0x3Fu)); + utf8_bytes[3] = static_cast::int_type>(0x80u | (static_cast(wc) & 0x3Fu)); + utf8_bytes_filled = 4; + } + else + { + // unknown character + utf8_bytes[0] = static_cast::int_type>(wc); + utf8_bytes_filled = 1; + } + } + } +}; + +template +struct wide_string_input_helper +{ + // UTF-16 + static void fill_buffer(BaseInputAdapter& input, + std::array::int_type, 4>& utf8_bytes, + size_t& utf8_bytes_index, + size_t& utf8_bytes_filled) + { + utf8_bytes_index = 0; + + if (JSON_HEDLEY_UNLIKELY(input.empty())) + { + utf8_bytes[0] = std::char_traits::eof(); + utf8_bytes_filled = 1; + } + else + { + // get the current character + const auto wc = input.get_character(); + + // UTF-16 to UTF-8 encoding + if (wc < 0x80) + { + utf8_bytes[0] = static_cast::int_type>(wc); + utf8_bytes_filled = 1; + } + else if (wc <= 0x7FF) + { + utf8_bytes[0] = static_cast::int_type>(0xC0u | ((static_cast(wc) >> 6u))); + utf8_bytes[1] = static_cast::int_type>(0x80u | (static_cast(wc) & 0x3Fu)); + utf8_bytes_filled = 2; + } + else if (0xD800 > wc || wc >= 0xE000) + { + utf8_bytes[0] = static_cast::int_type>(0xE0u | ((static_cast(wc) >> 12u))); + utf8_bytes[1] = static_cast::int_type>(0x80u | ((static_cast(wc) >> 6u) & 0x3Fu)); + utf8_bytes[2] = static_cast::int_type>(0x80u | (static_cast(wc) & 0x3Fu)); + utf8_bytes_filled = 3; + } + else + { + if (JSON_HEDLEY_UNLIKELY(!input.empty())) + { + const auto wc2 = static_cast(input.get_character()); + const auto charcode = 0x10000u + (((static_cast(wc) & 0x3FFu) << 10u) | (wc2 & 0x3FFu)); + utf8_bytes[0] = static_cast::int_type>(0xF0u | (charcode >> 18u)); + utf8_bytes[1] = static_cast::int_type>(0x80u | ((charcode >> 12u) & 0x3Fu)); + utf8_bytes[2] = static_cast::int_type>(0x80u | ((charcode >> 6u) & 0x3Fu)); + utf8_bytes[3] = static_cast::int_type>(0x80u | (charcode & 0x3Fu)); + utf8_bytes_filled = 4; + } + else + { + utf8_bytes[0] = static_cast::int_type>(wc); + utf8_bytes_filled = 1; + } + } + } + } +}; + +// Wraps another input apdater to convert wide character types into individual bytes. +template +class wide_string_input_adapter +{ + public: + using char_type = char; + + wide_string_input_adapter(BaseInputAdapter base) + : base_adapter(base) {} + + typename std::char_traits::int_type get_character() noexcept + { + // check if buffer needs to be filled + if (utf8_bytes_index == utf8_bytes_filled) + { + fill_buffer(); + + JSON_ASSERT(utf8_bytes_filled > 0); + JSON_ASSERT(utf8_bytes_index == 0); + } + + // use buffer + JSON_ASSERT(utf8_bytes_filled > 0); + JSON_ASSERT(utf8_bytes_index < utf8_bytes_filled); + return utf8_bytes[utf8_bytes_index++]; + } + + private: + BaseInputAdapter base_adapter; + + template + void fill_buffer() + { + wide_string_input_helper::fill_buffer(base_adapter, utf8_bytes, utf8_bytes_index, utf8_bytes_filled); + } + + /// a buffer for UTF-8 bytes + std::array::int_type, 4> utf8_bytes = {{0, 0, 0, 0}}; + + /// index to the utf8_codes array for the next valid byte + std::size_t utf8_bytes_index = 0; + /// number of valid bytes in the utf8_codes array + std::size_t utf8_bytes_filled = 0; +}; + + +template +struct iterator_input_adapter_factory +{ + using iterator_type = IteratorType; + using char_type = typename std::iterator_traits::value_type; + using adapter_type = iterator_input_adapter; + + static adapter_type create(IteratorType first, IteratorType last) + { + return adapter_type(std::move(first), std::move(last)); + } +}; + +template +struct is_iterator_of_multibyte +{ + using value_type = typename std::iterator_traits::value_type; + enum + { + value = sizeof(value_type) > 1 + }; +}; + +template +struct iterator_input_adapter_factory::value>> +{ + using iterator_type = IteratorType; + using char_type = typename std::iterator_traits::value_type; + using base_adapter_type = iterator_input_adapter; + using adapter_type = wide_string_input_adapter; + + static adapter_type create(IteratorType first, IteratorType last) + { + return adapter_type(base_adapter_type(std::move(first), std::move(last))); + } +}; + +// General purpose iterator-based input +template +typename iterator_input_adapter_factory::adapter_type input_adapter(IteratorType first, IteratorType last) +{ + using factory_type = iterator_input_adapter_factory; + return factory_type::create(first, last); +} + +// Convenience shorthand from container to iterator +template +auto input_adapter(const ContainerType& container) -> decltype(input_adapter(begin(container), end(container))) +{ + // Enable ADL + using std::begin; + using std::end; + + return input_adapter(begin(container), end(container)); +} + +// Special cases with fast paths +inline file_input_adapter input_adapter(std::FILE* file) +{ + return file_input_adapter(file); +} + +inline input_stream_adapter input_adapter(std::istream& stream) +{ + return input_stream_adapter(stream); +} + +inline input_stream_adapter input_adapter(std::istream&& stream) +{ + return input_stream_adapter(stream); +} + +using contiguous_bytes_input_adapter = decltype(input_adapter(std::declval(), std::declval())); + +// Null-delimited strings, and the like. +template < typename CharT, + typename std::enable_if < + std::is_pointer::value&& + !std::is_array::value&& + std::is_integral::type>::value&& + sizeof(typename std::remove_pointer::type) == 1, + int >::type = 0 > +contiguous_bytes_input_adapter input_adapter(CharT b) +{ + auto length = std::strlen(reinterpret_cast(b)); + const auto* ptr = reinterpret_cast(b); + return input_adapter(ptr, ptr + length); +} + +template +auto input_adapter(T (&array)[N]) -> decltype(input_adapter(array, array + N)) +{ + return input_adapter(array, array + N); +} + +// This class only handles inputs of input_buffer_adapter type. +// It's required so that expressions like {ptr, len} can be implicitely casted +// to the correct adapter. +class span_input_adapter +{ + public: + template < typename CharT, + typename std::enable_if < + std::is_pointer::value&& + std::is_integral::type>::value&& + sizeof(typename std::remove_pointer::type) == 1, + int >::type = 0 > + span_input_adapter(CharT b, std::size_t l) + : ia(reinterpret_cast(b), reinterpret_cast(b) + l) {} + + template::iterator_category, std::random_access_iterator_tag>::value, + int>::type = 0> + span_input_adapter(IteratorType first, IteratorType last) + : ia(input_adapter(first, last)) {} + + contiguous_bytes_input_adapter&& get() + { + return std::move(ia); + } + + private: + contiguous_bytes_input_adapter ia; +}; +} // namespace detail +} // namespace nlohmann + +// #include + + +#include +#include // string +#include // move +#include // vector + +// #include + +// #include + + +namespace nlohmann +{ + +/*! +@brief SAX interface + +This class describes the SAX interface used by @ref nlohmann::json::sax_parse. +Each function is called in different situations while the input is parsed. The +boolean return value informs the parser whether to continue processing the +input. +*/ +template +struct json_sax +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + + /*! + @brief a null value was read + @return whether parsing should proceed + */ + virtual bool null() = 0; + + /*! + @brief a boolean value was read + @param[in] val boolean value + @return whether parsing should proceed + */ + virtual bool boolean(bool val) = 0; + + /*! + @brief an integer number was read + @param[in] val integer value + @return whether parsing should proceed + */ + virtual bool number_integer(number_integer_t val) = 0; + + /*! + @brief an unsigned integer number was read + @param[in] val unsigned integer value + @return whether parsing should proceed + */ + virtual bool number_unsigned(number_unsigned_t val) = 0; + + /*! + @brief an floating-point number was read + @param[in] val floating-point value + @param[in] s raw token value + @return whether parsing should proceed + */ + virtual bool number_float(number_float_t val, const string_t& s) = 0; + + /*! + @brief a string was read + @param[in] val string value + @return whether parsing should proceed + @note It is safe to move the passed string. + */ + virtual bool string(string_t& val) = 0; + + /*! + @brief a binary string was read + @param[in] val binary value + @return whether parsing should proceed + @note It is safe to move the passed binary. + */ + virtual bool binary(binary_t& val) = 0; + + /*! + @brief the beginning of an object was read + @param[in] elements number of object elements or -1 if unknown + @return whether parsing should proceed + @note binary formats may report the number of elements + */ + virtual bool start_object(std::size_t elements) = 0; + + /*! + @brief an object key was read + @param[in] val object key + @return whether parsing should proceed + @note It is safe to move the passed string. + */ + virtual bool key(string_t& val) = 0; + + /*! + @brief the end of an object was read + @return whether parsing should proceed + */ + virtual bool end_object() = 0; + + /*! + @brief the beginning of an array was read + @param[in] elements number of array elements or -1 if unknown + @return whether parsing should proceed + @note binary formats may report the number of elements + */ + virtual bool start_array(std::size_t elements) = 0; + + /*! + @brief the end of an array was read + @return whether parsing should proceed + */ + virtual bool end_array() = 0; + + /*! + @brief a parse error occurred + @param[in] position the position in the input where the error occurs + @param[in] last_token the last read token + @param[in] ex an exception object describing the error + @return whether parsing should proceed (must return false) + */ + virtual bool parse_error(std::size_t position, + const std::string& last_token, + const detail::exception& ex) = 0; + + virtual ~json_sax() = default; +}; + + +namespace detail +{ +/*! +@brief SAX implementation to create a JSON value from SAX events + +This class implements the @ref json_sax interface and processes the SAX events +to create a JSON value which makes it basically a DOM parser. The structure or +hierarchy of the JSON value is managed by the stack `ref_stack` which contains +a pointer to the respective array or object for each recursion depth. + +After successful parsing, the value that is passed by reference to the +constructor contains the parsed value. + +@tparam BasicJsonType the JSON type +*/ +template +class json_sax_dom_parser +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + + /*! + @param[in, out] r reference to a JSON value that is manipulated while + parsing + @param[in] allow_exceptions_ whether parse errors yield exceptions + */ + explicit json_sax_dom_parser(BasicJsonType& r, const bool allow_exceptions_ = true) + : root(r), allow_exceptions(allow_exceptions_) + {} + + // make class move-only + json_sax_dom_parser(const json_sax_dom_parser&) = delete; + json_sax_dom_parser(json_sax_dom_parser&&) = default; + json_sax_dom_parser& operator=(const json_sax_dom_parser&) = delete; + json_sax_dom_parser& operator=(json_sax_dom_parser&&) = default; + ~json_sax_dom_parser() = default; + + bool null() + { + handle_value(nullptr); + return true; + } + + bool boolean(bool val) + { + handle_value(val); + return true; + } + + bool number_integer(number_integer_t val) + { + handle_value(val); + return true; + } + + bool number_unsigned(number_unsigned_t val) + { + handle_value(val); + return true; + } + + bool number_float(number_float_t val, const string_t& /*unused*/) + { + handle_value(val); + return true; + } + + bool string(string_t& val) + { + handle_value(val); + return true; + } + + bool binary(binary_t& val) + { + handle_value(std::move(val)); + return true; + } + + bool start_object(std::size_t len) + { + ref_stack.push_back(handle_value(BasicJsonType::value_t::object)); + + if (JSON_HEDLEY_UNLIKELY(len != std::size_t(-1) && len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, + "excessive object size: " + std::to_string(len))); + } + + return true; + } + + bool key(string_t& val) + { + // add null at given key and store the reference for later + object_element = &(ref_stack.back()->m_value.object->operator[](val)); + return true; + } + + bool end_object() + { + ref_stack.pop_back(); + return true; + } + + bool start_array(std::size_t len) + { + ref_stack.push_back(handle_value(BasicJsonType::value_t::array)); + + if (JSON_HEDLEY_UNLIKELY(len != std::size_t(-1) && len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, + "excessive array size: " + std::to_string(len))); + } + + return true; + } + + bool end_array() + { + ref_stack.pop_back(); + return true; + } + + template + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, + const Exception& ex) + { + errored = true; + static_cast(ex); + if (allow_exceptions) + { + JSON_THROW(ex); + } + return false; + } + + constexpr bool is_errored() const + { + return errored; + } + + private: + /*! + @invariant If the ref stack is empty, then the passed value will be the new + root. + @invariant If the ref stack contains a value, then it is an array or an + object to which we can add elements + */ + template + JSON_HEDLEY_RETURNS_NON_NULL + BasicJsonType* handle_value(Value&& v) + { + if (ref_stack.empty()) + { + root = BasicJsonType(std::forward(v)); + return &root; + } + + JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object()); + + if (ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->emplace_back(std::forward(v)); + return &(ref_stack.back()->m_value.array->back()); + } + + JSON_ASSERT(ref_stack.back()->is_object()); + JSON_ASSERT(object_element); + *object_element = BasicJsonType(std::forward(v)); + return object_element; + } + + /// the parsed JSON value + BasicJsonType& root; + /// stack to model hierarchy of values + std::vector ref_stack {}; + /// helper to hold the reference for the next object element + BasicJsonType* object_element = nullptr; + /// whether a syntax error occurred + bool errored = false; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; +}; + +template +class json_sax_dom_callback_parser +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + using parser_callback_t = typename BasicJsonType::parser_callback_t; + using parse_event_t = typename BasicJsonType::parse_event_t; + + json_sax_dom_callback_parser(BasicJsonType& r, + const parser_callback_t cb, + const bool allow_exceptions_ = true) + : root(r), callback(cb), allow_exceptions(allow_exceptions_) + { + keep_stack.push_back(true); + } + + // make class move-only + json_sax_dom_callback_parser(const json_sax_dom_callback_parser&) = delete; + json_sax_dom_callback_parser(json_sax_dom_callback_parser&&) = default; + json_sax_dom_callback_parser& operator=(const json_sax_dom_callback_parser&) = delete; + json_sax_dom_callback_parser& operator=(json_sax_dom_callback_parser&&) = default; + ~json_sax_dom_callback_parser() = default; + + bool null() + { + handle_value(nullptr); + return true; + } + + bool boolean(bool val) + { + handle_value(val); + return true; + } + + bool number_integer(number_integer_t val) + { + handle_value(val); + return true; + } + + bool number_unsigned(number_unsigned_t val) + { + handle_value(val); + return true; + } + + bool number_float(number_float_t val, const string_t& /*unused*/) + { + handle_value(val); + return true; + } + + bool string(string_t& val) + { + handle_value(val); + return true; + } + + bool binary(binary_t& val) + { + handle_value(std::move(val)); + return true; + } + + bool start_object(std::size_t len) + { + // check callback for object start + const bool keep = callback(static_cast(ref_stack.size()), parse_event_t::object_start, discarded); + keep_stack.push_back(keep); + + auto val = handle_value(BasicJsonType::value_t::object, true); + ref_stack.push_back(val.second); + + // check object limit + if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != std::size_t(-1) && len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, "excessive object size: " + std::to_string(len))); + } + + return true; + } + + bool key(string_t& val) + { + BasicJsonType k = BasicJsonType(val); + + // check callback for key + const bool keep = callback(static_cast(ref_stack.size()), parse_event_t::key, k); + key_keep_stack.push_back(keep); + + // add discarded value at given key and store the reference for later + if (keep && ref_stack.back()) + { + object_element = &(ref_stack.back()->m_value.object->operator[](val) = discarded); + } + + return true; + } + + bool end_object() + { + if (ref_stack.back() && !callback(static_cast(ref_stack.size()) - 1, parse_event_t::object_end, *ref_stack.back())) + { + // discard object + *ref_stack.back() = discarded; + } + + JSON_ASSERT(!ref_stack.empty()); + JSON_ASSERT(!keep_stack.empty()); + ref_stack.pop_back(); + keep_stack.pop_back(); + + if (!ref_stack.empty() && ref_stack.back() && ref_stack.back()->is_structured()) + { + // remove discarded value + for (auto it = ref_stack.back()->begin(); it != ref_stack.back()->end(); ++it) + { + if (it->is_discarded()) + { + ref_stack.back()->erase(it); + break; + } + } + } + + return true; + } + + bool start_array(std::size_t len) + { + const bool keep = callback(static_cast(ref_stack.size()), parse_event_t::array_start, discarded); + keep_stack.push_back(keep); + + auto val = handle_value(BasicJsonType::value_t::array, true); + ref_stack.push_back(val.second); + + // check array limit + if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != std::size_t(-1) && len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, "excessive array size: " + std::to_string(len))); + } + + return true; + } + + bool end_array() + { + bool keep = true; + + if (ref_stack.back()) + { + keep = callback(static_cast(ref_stack.size()) - 1, parse_event_t::array_end, *ref_stack.back()); + if (!keep) + { + // discard array + *ref_stack.back() = discarded; + } + } + + JSON_ASSERT(!ref_stack.empty()); + JSON_ASSERT(!keep_stack.empty()); + ref_stack.pop_back(); + keep_stack.pop_back(); + + // remove discarded value + if (!keep && !ref_stack.empty() && ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->pop_back(); + } + + return true; + } + + template + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, + const Exception& ex) + { + errored = true; + static_cast(ex); + if (allow_exceptions) + { + JSON_THROW(ex); + } + return false; + } + + constexpr bool is_errored() const + { + return errored; + } + + private: + /*! + @param[in] v value to add to the JSON value we build during parsing + @param[in] skip_callback whether we should skip calling the callback + function; this is required after start_array() and + start_object() SAX events, because otherwise we would call the + callback function with an empty array or object, respectively. + + @invariant If the ref stack is empty, then the passed value will be the new + root. + @invariant If the ref stack contains a value, then it is an array or an + object to which we can add elements + + @return pair of boolean (whether value should be kept) and pointer (to the + passed value in the ref_stack hierarchy; nullptr if not kept) + */ + template + std::pair handle_value(Value&& v, const bool skip_callback = false) + { + JSON_ASSERT(!keep_stack.empty()); + + // do not handle this value if we know it would be added to a discarded + // container + if (!keep_stack.back()) + { + return {false, nullptr}; + } + + // create value + auto value = BasicJsonType(std::forward(v)); + + // check callback + const bool keep = skip_callback || callback(static_cast(ref_stack.size()), parse_event_t::value, value); + + // do not handle this value if we just learnt it shall be discarded + if (!keep) + { + return {false, nullptr}; + } + + if (ref_stack.empty()) + { + root = std::move(value); + return {true, &root}; + } + + // skip this value if we already decided to skip the parent + // (https://github.com/nlohmann/json/issues/971#issuecomment-413678360) + if (!ref_stack.back()) + { + return {false, nullptr}; + } + + // we now only expect arrays and objects + JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object()); + + // array + if (ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->push_back(std::move(value)); + return {true, &(ref_stack.back()->m_value.array->back())}; + } + + // object + JSON_ASSERT(ref_stack.back()->is_object()); + // check if we should store an element for the current key + JSON_ASSERT(!key_keep_stack.empty()); + const bool store_element = key_keep_stack.back(); + key_keep_stack.pop_back(); + + if (!store_element) + { + return {false, nullptr}; + } + + JSON_ASSERT(object_element); + *object_element = std::move(value); + return {true, object_element}; + } + + /// the parsed JSON value + BasicJsonType& root; + /// stack to model hierarchy of values + std::vector ref_stack {}; + /// stack to manage which values to keep + std::vector keep_stack {}; + /// stack to manage which object keys to keep + std::vector key_keep_stack {}; + /// helper to hold the reference for the next object element + BasicJsonType* object_element = nullptr; + /// whether a syntax error occurred + bool errored = false; + /// callback function + const parser_callback_t callback = nullptr; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; + /// a discarded value for the callback + BasicJsonType discarded = BasicJsonType::value_t::discarded; +}; + +template +class json_sax_acceptor +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + + bool null() + { + return true; + } + + bool boolean(bool /*unused*/) + { + return true; + } + + bool number_integer(number_integer_t /*unused*/) + { + return true; + } + + bool number_unsigned(number_unsigned_t /*unused*/) + { + return true; + } + + bool number_float(number_float_t /*unused*/, const string_t& /*unused*/) + { + return true; + } + + bool string(string_t& /*unused*/) + { + return true; + } + + bool binary(binary_t& /*unused*/) + { + return true; + } + + bool start_object(std::size_t /*unused*/ = std::size_t(-1)) + { + return true; + } + + bool key(string_t& /*unused*/) + { + return true; + } + + bool end_object() + { + return true; + } + + bool start_array(std::size_t /*unused*/ = std::size_t(-1)) + { + return true; + } + + bool end_array() + { + return true; + } + + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, const detail::exception& /*unused*/) + { + return false; + } +}; +} // namespace detail + +} // namespace nlohmann + +// #include + + +#include // array +#include // localeconv +#include // size_t +#include // snprintf +#include // strtof, strtod, strtold, strtoll, strtoull +#include // initializer_list +#include // char_traits, string +#include // move +#include // vector + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +/////////// +// lexer // +/////////// + +template +class lexer_base +{ + public: + /// token types for the parser + enum class token_type + { + uninitialized, ///< indicating the scanner is uninitialized + literal_true, ///< the `true` literal + literal_false, ///< the `false` literal + literal_null, ///< the `null` literal + value_string, ///< a string -- use get_string() for actual value + value_unsigned, ///< an unsigned integer -- use get_number_unsigned() for actual value + value_integer, ///< a signed integer -- use get_number_integer() for actual value + value_float, ///< an floating point number -- use get_number_float() for actual value + begin_array, ///< the character for array begin `[` + begin_object, ///< the character for object begin `{` + end_array, ///< the character for array end `]` + end_object, ///< the character for object end `}` + name_separator, ///< the name separator `:` + value_separator, ///< the value separator `,` + parse_error, ///< indicating a parse error + end_of_input, ///< indicating the end of the input buffer + literal_or_value ///< a literal or the begin of a value (only for diagnostics) + }; + + /// return name of values of type token_type (only used for errors) + JSON_HEDLEY_RETURNS_NON_NULL + JSON_HEDLEY_CONST + static const char* token_type_name(const token_type t) noexcept + { + switch (t) + { + case token_type::uninitialized: + return ""; + case token_type::literal_true: + return "true literal"; + case token_type::literal_false: + return "false literal"; + case token_type::literal_null: + return "null literal"; + case token_type::value_string: + return "string literal"; + case token_type::value_unsigned: + case token_type::value_integer: + case token_type::value_float: + return "number literal"; + case token_type::begin_array: + return "'['"; + case token_type::begin_object: + return "'{'"; + case token_type::end_array: + return "']'"; + case token_type::end_object: + return "'}'"; + case token_type::name_separator: + return "':'"; + case token_type::value_separator: + return "','"; + case token_type::parse_error: + return ""; + case token_type::end_of_input: + return "end of input"; + case token_type::literal_or_value: + return "'[', '{', or a literal"; + // LCOV_EXCL_START + default: // catch non-enum values + return "unknown token"; + // LCOV_EXCL_STOP + } + } +}; +/*! +@brief lexical analysis + +This class organizes the lexical analysis during JSON deserialization. +*/ +template +class lexer : public lexer_base +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using char_type = typename InputAdapterType::char_type; + using char_int_type = typename std::char_traits::int_type; + + public: + using token_type = typename lexer_base::token_type; + + explicit lexer(InputAdapterType&& adapter, bool ignore_comments_ = false) + : ia(std::move(adapter)) + , ignore_comments(ignore_comments_) + , decimal_point_char(static_cast(get_decimal_point())) + {} + + // delete because of pointer members + lexer(const lexer&) = delete; + lexer(lexer&&) = default; + lexer& operator=(lexer&) = delete; + lexer& operator=(lexer&&) = default; + ~lexer() = default; + + private: + ///////////////////// + // locales + ///////////////////// + + /// return the locale-dependent decimal point + JSON_HEDLEY_PURE + static char get_decimal_point() noexcept + { + const auto* loc = localeconv(); + JSON_ASSERT(loc != nullptr); + return (loc->decimal_point == nullptr) ? '.' : *(loc->decimal_point); + } + + ///////////////////// + // scan functions + ///////////////////// + + /*! + @brief get codepoint from 4 hex characters following `\u` + + For input "\u c1 c2 c3 c4" the codepoint is: + (c1 * 0x1000) + (c2 * 0x0100) + (c3 * 0x0010) + c4 + = (c1 << 12) + (c2 << 8) + (c3 << 4) + (c4 << 0) + + Furthermore, the possible characters '0'..'9', 'A'..'F', and 'a'..'f' + must be converted to the integers 0x0..0x9, 0xA..0xF, 0xA..0xF, resp. The + conversion is done by subtracting the offset (0x30, 0x37, and 0x57) + between the ASCII value of the character and the desired integer value. + + @return codepoint (0x0000..0xFFFF) or -1 in case of an error (e.g. EOF or + non-hex character) + */ + int get_codepoint() + { + // this function only makes sense after reading `\u` + JSON_ASSERT(current == 'u'); + int codepoint = 0; + + const auto factors = { 12u, 8u, 4u, 0u }; + for (const auto factor : factors) + { + get(); + + if (current >= '0' && current <= '9') + { + codepoint += static_cast((static_cast(current) - 0x30u) << factor); + } + else if (current >= 'A' && current <= 'F') + { + codepoint += static_cast((static_cast(current) - 0x37u) << factor); + } + else if (current >= 'a' && current <= 'f') + { + codepoint += static_cast((static_cast(current) - 0x57u) << factor); + } + else + { + return -1; + } + } + + JSON_ASSERT(0x0000 <= codepoint && codepoint <= 0xFFFF); + return codepoint; + } + + /*! + @brief check if the next byte(s) are inside a given range + + Adds the current byte and, for each passed range, reads a new byte and + checks if it is inside the range. If a violation was detected, set up an + error message and return false. Otherwise, return true. + + @param[in] ranges list of integers; interpreted as list of pairs of + inclusive lower and upper bound, respectively + + @pre The passed list @a ranges must have 2, 4, or 6 elements; that is, + 1, 2, or 3 pairs. This precondition is enforced by an assertion. + + @return true if and only if no range violation was detected + */ + bool next_byte_in_range(std::initializer_list ranges) + { + JSON_ASSERT(ranges.size() == 2 || ranges.size() == 4 || ranges.size() == 6); + add(current); + + for (auto range = ranges.begin(); range != ranges.end(); ++range) + { + get(); + if (JSON_HEDLEY_LIKELY(*range <= current && current <= *(++range))) + { + add(current); + } + else + { + error_message = "invalid string: ill-formed UTF-8 byte"; + return false; + } + } + + return true; + } + + /*! + @brief scan a string literal + + This function scans a string according to Sect. 7 of RFC 7159. While + scanning, bytes are escaped and copied into buffer token_buffer. Then the + function returns successfully, token_buffer is *not* null-terminated (as it + may contain \0 bytes), and token_buffer.size() is the number of bytes in the + string. + + @return token_type::value_string if string could be successfully scanned, + token_type::parse_error otherwise + + @note In case of errors, variable error_message contains a textual + description. + */ + token_type scan_string() + { + // reset token_buffer (ignore opening quote) + reset(); + + // we entered the function by reading an open quote + JSON_ASSERT(current == '\"'); + + while (true) + { + // get next character + switch (get()) + { + // end of file while parsing string + case std::char_traits::eof(): + { + error_message = "invalid string: missing closing quote"; + return token_type::parse_error; + } + + // closing quote + case '\"': + { + return token_type::value_string; + } + + // escapes + case '\\': + { + switch (get()) + { + // quotation mark + case '\"': + add('\"'); + break; + // reverse solidus + case '\\': + add('\\'); + break; + // solidus + case '/': + add('/'); + break; + // backspace + case 'b': + add('\b'); + break; + // form feed + case 'f': + add('\f'); + break; + // line feed + case 'n': + add('\n'); + break; + // carriage return + case 'r': + add('\r'); + break; + // tab + case 't': + add('\t'); + break; + + // unicode escapes + case 'u': + { + const int codepoint1 = get_codepoint(); + int codepoint = codepoint1; // start with codepoint1 + + if (JSON_HEDLEY_UNLIKELY(codepoint1 == -1)) + { + error_message = "invalid string: '\\u' must be followed by 4 hex digits"; + return token_type::parse_error; + } + + // check if code point is a high surrogate + if (0xD800 <= codepoint1 && codepoint1 <= 0xDBFF) + { + // expect next \uxxxx entry + if (JSON_HEDLEY_LIKELY(get() == '\\' && get() == 'u')) + { + const int codepoint2 = get_codepoint(); + + if (JSON_HEDLEY_UNLIKELY(codepoint2 == -1)) + { + error_message = "invalid string: '\\u' must be followed by 4 hex digits"; + return token_type::parse_error; + } + + // check if codepoint2 is a low surrogate + if (JSON_HEDLEY_LIKELY(0xDC00 <= codepoint2 && codepoint2 <= 0xDFFF)) + { + // overwrite codepoint + codepoint = static_cast( + // high surrogate occupies the most significant 22 bits + (static_cast(codepoint1) << 10u) + // low surrogate occupies the least significant 15 bits + + static_cast(codepoint2) + // there is still the 0xD800, 0xDC00 and 0x10000 noise + // in the result so we have to subtract with: + // (0xD800 << 10) + DC00 - 0x10000 = 0x35FDC00 + - 0x35FDC00u); + } + else + { + error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF"; + return token_type::parse_error; + } + } + else + { + error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF"; + return token_type::parse_error; + } + } + else + { + if (JSON_HEDLEY_UNLIKELY(0xDC00 <= codepoint1 && codepoint1 <= 0xDFFF)) + { + error_message = "invalid string: surrogate U+DC00..U+DFFF must follow U+D800..U+DBFF"; + return token_type::parse_error; + } + } + + // result of the above calculation yields a proper codepoint + JSON_ASSERT(0x00 <= codepoint && codepoint <= 0x10FFFF); + + // translate codepoint into bytes + if (codepoint < 0x80) + { + // 1-byte characters: 0xxxxxxx (ASCII) + add(static_cast(codepoint)); + } + else if (codepoint <= 0x7FF) + { + // 2-byte characters: 110xxxxx 10xxxxxx + add(static_cast(0xC0u | (static_cast(codepoint) >> 6u))); + add(static_cast(0x80u | (static_cast(codepoint) & 0x3Fu))); + } + else if (codepoint <= 0xFFFF) + { + // 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx + add(static_cast(0xE0u | (static_cast(codepoint) >> 12u))); + add(static_cast(0x80u | ((static_cast(codepoint) >> 6u) & 0x3Fu))); + add(static_cast(0x80u | (static_cast(codepoint) & 0x3Fu))); + } + else + { + // 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx + add(static_cast(0xF0u | (static_cast(codepoint) >> 18u))); + add(static_cast(0x80u | ((static_cast(codepoint) >> 12u) & 0x3Fu))); + add(static_cast(0x80u | ((static_cast(codepoint) >> 6u) & 0x3Fu))); + add(static_cast(0x80u | (static_cast(codepoint) & 0x3Fu))); + } + + break; + } + + // other characters after escape + default: + error_message = "invalid string: forbidden character after backslash"; + return token_type::parse_error; + } + + break; + } + + // invalid control characters + case 0x00: + { + error_message = "invalid string: control character U+0000 (NUL) must be escaped to \\u0000"; + return token_type::parse_error; + } + + case 0x01: + { + error_message = "invalid string: control character U+0001 (SOH) must be escaped to \\u0001"; + return token_type::parse_error; + } + + case 0x02: + { + error_message = "invalid string: control character U+0002 (STX) must be escaped to \\u0002"; + return token_type::parse_error; + } + + case 0x03: + { + error_message = "invalid string: control character U+0003 (ETX) must be escaped to \\u0003"; + return token_type::parse_error; + } + + case 0x04: + { + error_message = "invalid string: control character U+0004 (EOT) must be escaped to \\u0004"; + return token_type::parse_error; + } + + case 0x05: + { + error_message = "invalid string: control character U+0005 (ENQ) must be escaped to \\u0005"; + return token_type::parse_error; + } + + case 0x06: + { + error_message = "invalid string: control character U+0006 (ACK) must be escaped to \\u0006"; + return token_type::parse_error; + } + + case 0x07: + { + error_message = "invalid string: control character U+0007 (BEL) must be escaped to \\u0007"; + return token_type::parse_error; + } + + case 0x08: + { + error_message = "invalid string: control character U+0008 (BS) must be escaped to \\u0008 or \\b"; + return token_type::parse_error; + } + + case 0x09: + { + error_message = "invalid string: control character U+0009 (HT) must be escaped to \\u0009 or \\t"; + return token_type::parse_error; + } + + case 0x0A: + { + error_message = "invalid string: control character U+000A (LF) must be escaped to \\u000A or \\n"; + return token_type::parse_error; + } + + case 0x0B: + { + error_message = "invalid string: control character U+000B (VT) must be escaped to \\u000B"; + return token_type::parse_error; + } + + case 0x0C: + { + error_message = "invalid string: control character U+000C (FF) must be escaped to \\u000C or \\f"; + return token_type::parse_error; + } + + case 0x0D: + { + error_message = "invalid string: control character U+000D (CR) must be escaped to \\u000D or \\r"; + return token_type::parse_error; + } + + case 0x0E: + { + error_message = "invalid string: control character U+000E (SO) must be escaped to \\u000E"; + return token_type::parse_error; + } + + case 0x0F: + { + error_message = "invalid string: control character U+000F (SI) must be escaped to \\u000F"; + return token_type::parse_error; + } + + case 0x10: + { + error_message = "invalid string: control character U+0010 (DLE) must be escaped to \\u0010"; + return token_type::parse_error; + } + + case 0x11: + { + error_message = "invalid string: control character U+0011 (DC1) must be escaped to \\u0011"; + return token_type::parse_error; + } + + case 0x12: + { + error_message = "invalid string: control character U+0012 (DC2) must be escaped to \\u0012"; + return token_type::parse_error; + } + + case 0x13: + { + error_message = "invalid string: control character U+0013 (DC3) must be escaped to \\u0013"; + return token_type::parse_error; + } + + case 0x14: + { + error_message = "invalid string: control character U+0014 (DC4) must be escaped to \\u0014"; + return token_type::parse_error; + } + + case 0x15: + { + error_message = "invalid string: control character U+0015 (NAK) must be escaped to \\u0015"; + return token_type::parse_error; + } + + case 0x16: + { + error_message = "invalid string: control character U+0016 (SYN) must be escaped to \\u0016"; + return token_type::parse_error; + } + + case 0x17: + { + error_message = "invalid string: control character U+0017 (ETB) must be escaped to \\u0017"; + return token_type::parse_error; + } + + case 0x18: + { + error_message = "invalid string: control character U+0018 (CAN) must be escaped to \\u0018"; + return token_type::parse_error; + } + + case 0x19: + { + error_message = "invalid string: control character U+0019 (EM) must be escaped to \\u0019"; + return token_type::parse_error; + } + + case 0x1A: + { + error_message = "invalid string: control character U+001A (SUB) must be escaped to \\u001A"; + return token_type::parse_error; + } + + case 0x1B: + { + error_message = "invalid string: control character U+001B (ESC) must be escaped to \\u001B"; + return token_type::parse_error; + } + + case 0x1C: + { + error_message = "invalid string: control character U+001C (FS) must be escaped to \\u001C"; + return token_type::parse_error; + } + + case 0x1D: + { + error_message = "invalid string: control character U+001D (GS) must be escaped to \\u001D"; + return token_type::parse_error; + } + + case 0x1E: + { + error_message = "invalid string: control character U+001E (RS) must be escaped to \\u001E"; + return token_type::parse_error; + } + + case 0x1F: + { + error_message = "invalid string: control character U+001F (US) must be escaped to \\u001F"; + return token_type::parse_error; + } + + // U+0020..U+007F (except U+0022 (quote) and U+005C (backspace)) + case 0x20: + case 0x21: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + case 0x38: + case 0x39: + case 0x3A: + case 0x3B: + case 0x3C: + case 0x3D: + case 0x3E: + case 0x3F: + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + case 0x58: + case 0x59: + case 0x5A: + case 0x5B: + case 0x5D: + case 0x5E: + case 0x5F: + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: + case 0x79: + case 0x7A: + case 0x7B: + case 0x7C: + case 0x7D: + case 0x7E: + case 0x7F: + { + add(current); + break; + } + + // U+0080..U+07FF: bytes C2..DF 80..BF + case 0xC2: + case 0xC3: + case 0xC4: + case 0xC5: + case 0xC6: + case 0xC7: + case 0xC8: + case 0xC9: + case 0xCA: + case 0xCB: + case 0xCC: + case 0xCD: + case 0xCE: + case 0xCF: + case 0xD0: + case 0xD1: + case 0xD2: + case 0xD3: + case 0xD4: + case 0xD5: + case 0xD6: + case 0xD7: + case 0xD8: + case 0xD9: + case 0xDA: + case 0xDB: + case 0xDC: + case 0xDD: + case 0xDE: + case 0xDF: + { + if (JSON_HEDLEY_UNLIKELY(!next_byte_in_range({0x80, 0xBF}))) + { + return token_type::parse_error; + } + break; + } + + // U+0800..U+0FFF: bytes E0 A0..BF 80..BF + case 0xE0: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0xA0, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+1000..U+CFFF: bytes E1..EC 80..BF 80..BF + // U+E000..U+FFFF: bytes EE..EF 80..BF 80..BF + case 0xE1: + case 0xE2: + case 0xE3: + case 0xE4: + case 0xE5: + case 0xE6: + case 0xE7: + case 0xE8: + case 0xE9: + case 0xEA: + case 0xEB: + case 0xEC: + case 0xEE: + case 0xEF: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+D000..U+D7FF: bytes ED 80..9F 80..BF + case 0xED: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x9F, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF + case 0xF0: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x90, 0xBF, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF + case 0xF1: + case 0xF2: + case 0xF3: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF + case 0xF4: + { + if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x8F, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // remaining bytes (80..C1 and F5..FF) are ill-formed + default: + { + error_message = "invalid string: ill-formed UTF-8 byte"; + return token_type::parse_error; + } + } + } + } + + /*! + * @brief scan a comment + * @return whether comment could be scanned successfully + */ + bool scan_comment() + { + switch (get()) + { + // single-line comments skip input until a newline or EOF is read + case '/': + { + while (true) + { + switch (get()) + { + case '\n': + case '\r': + case std::char_traits::eof(): + case '\0': + return true; + + default: + break; + } + } + } + + // multi-line comments skip input until */ is read + case '*': + { + while (true) + { + switch (get()) + { + case std::char_traits::eof(): + case '\0': + { + error_message = "invalid comment; missing closing '*/'"; + return false; + } + + case '*': + { + switch (get()) + { + case '/': + return true; + + default: + { + unget(); + continue; + } + } + } + + default: + continue; + } + } + } + + // unexpected character after reading '/' + default: + { + error_message = "invalid comment; expecting '/' or '*' after '/'"; + return false; + } + } + } + + JSON_HEDLEY_NON_NULL(2) + static void strtof(float& f, const char* str, char** endptr) noexcept + { + f = std::strtof(str, endptr); + } + + JSON_HEDLEY_NON_NULL(2) + static void strtof(double& f, const char* str, char** endptr) noexcept + { + f = std::strtod(str, endptr); + } + + JSON_HEDLEY_NON_NULL(2) + static void strtof(long double& f, const char* str, char** endptr) noexcept + { + f = std::strtold(str, endptr); + } + + /*! + @brief scan a number literal + + This function scans a string according to Sect. 6 of RFC 7159. + + The function is realized with a deterministic finite state machine derived + from the grammar described in RFC 7159. Starting in state "init", the + input is read and used to determined the next state. Only state "done" + accepts the number. State "error" is a trap state to model errors. In the + table below, "anything" means any character but the ones listed before. + + state | 0 | 1-9 | e E | + | - | . | anything + ---------|----------|----------|----------|---------|---------|----------|----------- + init | zero | any1 | [error] | [error] | minus | [error] | [error] + minus | zero | any1 | [error] | [error] | [error] | [error] | [error] + zero | done | done | exponent | done | done | decimal1 | done + any1 | any1 | any1 | exponent | done | done | decimal1 | done + decimal1 | decimal2 | decimal2 | [error] | [error] | [error] | [error] | [error] + decimal2 | decimal2 | decimal2 | exponent | done | done | done | done + exponent | any2 | any2 | [error] | sign | sign | [error] | [error] + sign | any2 | any2 | [error] | [error] | [error] | [error] | [error] + any2 | any2 | any2 | done | done | done | done | done + + The state machine is realized with one label per state (prefixed with + "scan_number_") and `goto` statements between them. The state machine + contains cycles, but any cycle can be left when EOF is read. Therefore, + the function is guaranteed to terminate. + + During scanning, the read bytes are stored in token_buffer. This string is + then converted to a signed integer, an unsigned integer, or a + floating-point number. + + @return token_type::value_unsigned, token_type::value_integer, or + token_type::value_float if number could be successfully scanned, + token_type::parse_error otherwise + + @note The scanner is independent of the current locale. Internally, the + locale's decimal point is used instead of `.` to work with the + locale-dependent converters. + */ + token_type scan_number() // lgtm [cpp/use-of-goto] + { + // reset token_buffer to store the number's bytes + reset(); + + // the type of the parsed number; initially set to unsigned; will be + // changed if minus sign, decimal point or exponent is read + token_type number_type = token_type::value_unsigned; + + // state (init): we just found out we need to scan a number + switch (current) + { + case '-': + { + add(current); + goto scan_number_minus; + } + + case '0': + { + add(current); + goto scan_number_zero; + } + + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + // all other characters are rejected outside scan_number() + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + +scan_number_minus: + // state: we just parsed a leading minus sign + number_type = token_type::value_integer; + switch (get()) + { + case '0': + { + add(current); + goto scan_number_zero; + } + + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + default: + { + error_message = "invalid number; expected digit after '-'"; + return token_type::parse_error; + } + } + +scan_number_zero: + // state: we just parse a zero (maybe with a leading minus sign) + switch (get()) + { + case '.': + { + add(decimal_point_char); + goto scan_number_decimal1; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_any1: + // state: we just parsed a number 0-9 (maybe with a leading minus sign) + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + case '.': + { + add(decimal_point_char); + goto scan_number_decimal1; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_decimal1: + // state: we just parsed a decimal point + number_type = token_type::value_float; + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_decimal2; + } + + default: + { + error_message = "invalid number; expected digit after '.'"; + return token_type::parse_error; + } + } + +scan_number_decimal2: + // we just parsed at least one number after a decimal point + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_decimal2; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_exponent: + // we just parsed an exponent + number_type = token_type::value_float; + switch (get()) + { + case '+': + case '-': + { + add(current); + goto scan_number_sign; + } + + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + { + error_message = + "invalid number; expected '+', '-', or digit after exponent"; + return token_type::parse_error; + } + } + +scan_number_sign: + // we just parsed an exponent sign + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + { + error_message = "invalid number; expected digit after exponent sign"; + return token_type::parse_error; + } + } + +scan_number_any2: + // we just parsed a number after the exponent or exponent sign + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + goto scan_number_done; + } + +scan_number_done: + // unget the character after the number (we only read it to know that + // we are done scanning a number) + unget(); + + char* endptr = nullptr; + errno = 0; + + // try to parse integers first and fall back to floats + if (number_type == token_type::value_unsigned) + { + const auto x = std::strtoull(token_buffer.data(), &endptr, 10); + + // we checked the number format before + JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size()); + + if (errno == 0) + { + value_unsigned = static_cast(x); + if (value_unsigned == x) + { + return token_type::value_unsigned; + } + } + } + else if (number_type == token_type::value_integer) + { + const auto x = std::strtoll(token_buffer.data(), &endptr, 10); + + // we checked the number format before + JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size()); + + if (errno == 0) + { + value_integer = static_cast(x); + if (value_integer == x) + { + return token_type::value_integer; + } + } + } + + // this code is reached if we parse a floating-point number or if an + // integer conversion above failed + strtof(value_float, token_buffer.data(), &endptr); + + // we checked the number format before + JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size()); + + return token_type::value_float; + } + + /*! + @param[in] literal_text the literal text to expect + @param[in] length the length of the passed literal text + @param[in] return_type the token type to return on success + */ + JSON_HEDLEY_NON_NULL(2) + token_type scan_literal(const char_type* literal_text, const std::size_t length, + token_type return_type) + { + JSON_ASSERT(std::char_traits::to_char_type(current) == literal_text[0]); + for (std::size_t i = 1; i < length; ++i) + { + if (JSON_HEDLEY_UNLIKELY(std::char_traits::to_char_type(get()) != literal_text[i])) + { + error_message = "invalid literal"; + return token_type::parse_error; + } + } + return return_type; + } + + ///////////////////// + // input management + ///////////////////// + + /// reset token_buffer; current character is beginning of token + void reset() noexcept + { + token_buffer.clear(); + token_string.clear(); + token_string.push_back(std::char_traits::to_char_type(current)); + } + + /* + @brief get next character from the input + + This function provides the interface to the used input adapter. It does + not throw in case the input reached EOF, but returns a + `std::char_traits::eof()` in that case. Stores the scanned characters + for use in error messages. + + @return character read from the input + */ + char_int_type get() + { + ++position.chars_read_total; + ++position.chars_read_current_line; + + if (next_unget) + { + // just reset the next_unget variable and work with current + next_unget = false; + } + else + { + current = ia.get_character(); + } + + if (JSON_HEDLEY_LIKELY(current != std::char_traits::eof())) + { + token_string.push_back(std::char_traits::to_char_type(current)); + } + + if (current == '\n') + { + ++position.lines_read; + position.chars_read_current_line = 0; + } + + return current; + } + + /*! + @brief unget current character (read it again on next get) + + We implement unget by setting variable next_unget to true. The input is not + changed - we just simulate ungetting by modifying chars_read_total, + chars_read_current_line, and token_string. The next call to get() will + behave as if the unget character is read again. + */ + void unget() + { + next_unget = true; + + --position.chars_read_total; + + // in case we "unget" a newline, we have to also decrement the lines_read + if (position.chars_read_current_line == 0) + { + if (position.lines_read > 0) + { + --position.lines_read; + } + } + else + { + --position.chars_read_current_line; + } + + if (JSON_HEDLEY_LIKELY(current != std::char_traits::eof())) + { + JSON_ASSERT(!token_string.empty()); + token_string.pop_back(); + } + } + + /// add a character to token_buffer + void add(char_int_type c) + { + token_buffer.push_back(static_cast(c)); + } + + public: + ///////////////////// + // value getters + ///////////////////// + + /// return integer value + constexpr number_integer_t get_number_integer() const noexcept + { + return value_integer; + } + + /// return unsigned integer value + constexpr number_unsigned_t get_number_unsigned() const noexcept + { + return value_unsigned; + } + + /// return floating-point value + constexpr number_float_t get_number_float() const noexcept + { + return value_float; + } + + /// return current string value (implicitly resets the token; useful only once) + string_t& get_string() + { + return token_buffer; + } + + ///////////////////// + // diagnostics + ///////////////////// + + /// return position of last read token + constexpr position_t get_position() const noexcept + { + return position; + } + + /// return the last read token (for errors only). Will never contain EOF + /// (an arbitrary value that is not a valid char value, often -1), because + /// 255 may legitimately occur. May contain NUL, which should be escaped. + std::string get_token_string() const + { + // escape control characters + std::string result; + for (const auto c : token_string) + { + if (static_cast(c) <= '\x1F') + { + // escape control characters + std::array cs{{}}; + (std::snprintf)(cs.data(), cs.size(), "", static_cast(c)); + result += cs.data(); + } + else + { + // add character as is + result.push_back(static_cast(c)); + } + } + + return result; + } + + /// return syntax error message + JSON_HEDLEY_RETURNS_NON_NULL + constexpr const char* get_error_message() const noexcept + { + return error_message; + } + + ///////////////////// + // actual scanner + ///////////////////// + + /*! + @brief skip the UTF-8 byte order mark + @return true iff there is no BOM or the correct BOM has been skipped + */ + bool skip_bom() + { + if (get() == 0xEF) + { + // check if we completely parse the BOM + return get() == 0xBB && get() == 0xBF; + } + + // the first character is not the beginning of the BOM; unget it to + // process is later + unget(); + return true; + } + + void skip_whitespace() + { + do + { + get(); + } + while (current == ' ' || current == '\t' || current == '\n' || current == '\r'); + } + + token_type scan() + { + // initially, skip the BOM + if (position.chars_read_total == 0 && !skip_bom()) + { + error_message = "invalid BOM; must be 0xEF 0xBB 0xBF if given"; + return token_type::parse_error; + } + + // read next character and ignore whitespace + skip_whitespace(); + + // ignore comments + while (ignore_comments && current == '/') + { + if (!scan_comment()) + { + return token_type::parse_error; + } + + // skip following whitespace + skip_whitespace(); + } + + switch (current) + { + // structural characters + case '[': + return token_type::begin_array; + case ']': + return token_type::end_array; + case '{': + return token_type::begin_object; + case '}': + return token_type::end_object; + case ':': + return token_type::name_separator; + case ',': + return token_type::value_separator; + + // literals + case 't': + { + std::array true_literal = {{'t', 'r', 'u', 'e'}}; + return scan_literal(true_literal.data(), true_literal.size(), token_type::literal_true); + } + case 'f': + { + std::array false_literal = {{'f', 'a', 'l', 's', 'e'}}; + return scan_literal(false_literal.data(), false_literal.size(), token_type::literal_false); + } + case 'n': + { + std::array null_literal = {{'n', 'u', 'l', 'l'}}; + return scan_literal(null_literal.data(), null_literal.size(), token_type::literal_null); + } + + // string + case '\"': + return scan_string(); + + // number + case '-': + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + return scan_number(); + + // end of input (the null byte is needed when parsing from + // string literals) + case '\0': + case std::char_traits::eof(): + return token_type::end_of_input; + + // error + default: + error_message = "invalid literal"; + return token_type::parse_error; + } + } + + private: + /// input adapter + InputAdapterType ia; + + /// whether comments should be ignored (true) or signaled as errors (false) + const bool ignore_comments = false; + + /// the current character + char_int_type current = std::char_traits::eof(); + + /// whether the next get() call should just return current + bool next_unget = false; + + /// the start position of the current token + position_t position {}; + + /// raw input token string (for error messages) + std::vector token_string {}; + + /// buffer for variable-length tokens (numbers, strings) + string_t token_buffer {}; + + /// a description of occurred lexer errors + const char* error_message = ""; + + // number values + number_integer_t value_integer = 0; + number_unsigned_t value_unsigned = 0; + number_float_t value_float = 0; + + /// the decimal point + const char_int_type decimal_point_char = '.'; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + + +#include // size_t +#include // declval +#include // string + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +template +using null_function_t = decltype(std::declval().null()); + +template +using boolean_function_t = + decltype(std::declval().boolean(std::declval())); + +template +using number_integer_function_t = + decltype(std::declval().number_integer(std::declval())); + +template +using number_unsigned_function_t = + decltype(std::declval().number_unsigned(std::declval())); + +template +using number_float_function_t = decltype(std::declval().number_float( + std::declval(), std::declval())); + +template +using string_function_t = + decltype(std::declval().string(std::declval())); + +template +using binary_function_t = + decltype(std::declval().binary(std::declval())); + +template +using start_object_function_t = + decltype(std::declval().start_object(std::declval())); + +template +using key_function_t = + decltype(std::declval().key(std::declval())); + +template +using end_object_function_t = decltype(std::declval().end_object()); + +template +using start_array_function_t = + decltype(std::declval().start_array(std::declval())); + +template +using end_array_function_t = decltype(std::declval().end_array()); + +template +using parse_error_function_t = decltype(std::declval().parse_error( + std::declval(), std::declval(), + std::declval())); + +template +struct is_sax +{ + private: + static_assert(is_basic_json::value, + "BasicJsonType must be of type basic_json<...>"); + + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + using exception_t = typename BasicJsonType::exception; + + public: + static constexpr bool value = + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value && + is_detected_exact::value; +}; + +template +struct is_sax_static_asserts +{ + private: + static_assert(is_basic_json::value, + "BasicJsonType must be of type basic_json<...>"); + + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + using exception_t = typename BasicJsonType::exception; + + public: + static_assert(is_detected_exact::value, + "Missing/invalid function: bool null()"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool boolean(bool)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool boolean(bool)"); + static_assert( + is_detected_exact::value, + "Missing/invalid function: bool number_integer(number_integer_t)"); + static_assert( + is_detected_exact::value, + "Missing/invalid function: bool number_unsigned(number_unsigned_t)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool number_float(number_float_t, const string_t&)"); + static_assert( + is_detected_exact::value, + "Missing/invalid function: bool string(string_t&)"); + static_assert( + is_detected_exact::value, + "Missing/invalid function: bool binary(binary_t&)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool start_object(std::size_t)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool key(string_t&)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool end_object()"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool start_array(std::size_t)"); + static_assert(is_detected_exact::value, + "Missing/invalid function: bool end_array()"); + static_assert( + is_detected_exact::value, + "Missing/invalid function: bool parse_error(std::size_t, const " + "std::string&, const exception&)"); +}; +} // namespace detail +} // namespace nlohmann + +// #include + + +namespace nlohmann +{ +namespace detail +{ + +/// how to treat CBOR tags +enum class cbor_tag_handler_t +{ + error, ///< throw a parse_error exception in case of a tag + ignore ///< ignore tags +}; + +/*! +@brief determine system byte order + +@return true if and only if system's byte order is little endian + +@note from https://stackoverflow.com/a/1001328/266378 +*/ +static inline bool little_endianess(int num = 1) noexcept +{ + return *reinterpret_cast(&num) == 1; +} + + +/////////////////// +// binary reader // +/////////////////// + +/*! +@brief deserialization of CBOR, MessagePack, and UBJSON values +*/ +template> +class binary_reader +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + using json_sax_t = SAX; + using char_type = typename InputAdapterType::char_type; + using char_int_type = typename std::char_traits::int_type; + + public: + /*! + @brief create a binary reader + + @param[in] adapter input adapter to read from + */ + explicit binary_reader(InputAdapterType&& adapter) : ia(std::move(adapter)) + { + (void)detail::is_sax_static_asserts {}; + } + + // make class move-only + binary_reader(const binary_reader&) = delete; + binary_reader(binary_reader&&) = default; + binary_reader& operator=(const binary_reader&) = delete; + binary_reader& operator=(binary_reader&&) = default; + ~binary_reader() = default; + + /*! + @param[in] format the binary format to parse + @param[in] sax_ a SAX event processor + @param[in] strict whether to expect the input to be consumed completed + @param[in] tag_handler how to treat CBOR tags + + @return + */ + JSON_HEDLEY_NON_NULL(3) + bool sax_parse(const input_format_t format, + json_sax_t* sax_, + const bool strict = true, + const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error) + { + sax = sax_; + bool result = false; + + switch (format) + { + case input_format_t::bson: + result = parse_bson_internal(); + break; + + case input_format_t::cbor: + result = parse_cbor_internal(true, tag_handler); + break; + + case input_format_t::msgpack: + result = parse_msgpack_internal(); + break; + + case input_format_t::ubjson: + result = parse_ubjson_internal(); + break; + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + + // strict mode: next byte must be EOF + if (result && strict) + { + if (format == input_format_t::ubjson) + { + get_ignore_noop(); + } + else + { + get(); + } + + if (JSON_HEDLEY_UNLIKELY(current != std::char_traits::eof())) + { + return sax->parse_error(chars_read, get_token_string(), + parse_error::create(110, chars_read, exception_message(format, "expected end of input; last byte: 0x" + get_token_string(), "value"))); + } + } + + return result; + } + + private: + ////////// + // BSON // + ////////// + + /*! + @brief Reads in a BSON-object and passes it to the SAX-parser. + @return whether a valid BSON-value was passed to the SAX parser + */ + bool parse_bson_internal() + { + std::int32_t document_size{}; + get_number(input_format_t::bson, document_size); + + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(std::size_t(-1)))) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/false))) + { + return false; + } + + return sax->end_object(); + } + + /*! + @brief Parses a C-style string from the BSON input. + @param[in, out] result A reference to the string variable where the read + string is to be stored. + @return `true` if the \x00-byte indicating the end of the string was + encountered before the EOF; false` indicates an unexpected EOF. + */ + bool get_bson_cstr(string_t& result) + { + auto out = std::back_inserter(result); + while (true) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "cstring"))) + { + return false; + } + if (current == 0x00) + { + return true; + } + *out++ = static_cast(current); + } + } + + /*! + @brief Parses a zero-terminated string of length @a len from the BSON + input. + @param[in] len The length (including the zero-byte at the end) of the + string to be read. + @param[in, out] result A reference to the string variable where the read + string is to be stored. + @tparam NumberType The type of the length @a len + @pre len >= 1 + @return `true` if the string was successfully parsed + */ + template + bool get_bson_string(const NumberType len, string_t& result) + { + if (JSON_HEDLEY_UNLIKELY(len < 1)) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::bson, "string length must be at least 1, is " + std::to_string(len), "string"))); + } + + return get_string(input_format_t::bson, len - static_cast(1), result) && get() != std::char_traits::eof(); + } + + /*! + @brief Parses a byte array input of length @a len from the BSON input. + @param[in] len The length of the byte array to be read. + @param[in, out] result A reference to the binary variable where the read + array is to be stored. + @tparam NumberType The type of the length @a len + @pre len >= 0 + @return `true` if the byte array was successfully parsed + */ + template + bool get_bson_binary(const NumberType len, binary_t& result) + { + if (JSON_HEDLEY_UNLIKELY(len < 0)) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::bson, "byte array length cannot be negative, is " + std::to_string(len), "binary"))); + } + + // All BSON binary values have a subtype + std::uint8_t subtype{}; + get_number(input_format_t::bson, subtype); + result.set_subtype(subtype); + + return get_binary(input_format_t::bson, len, result); + } + + /*! + @brief Read a BSON document element of the given @a element_type. + @param[in] element_type The BSON element type, c.f. http://bsonspec.org/spec.html + @param[in] element_type_parse_position The position in the input stream, + where the `element_type` was read. + @warning Not all BSON element types are supported yet. An unsupported + @a element_type will give rise to a parse_error.114: + Unsupported BSON record type 0x... + @return whether a valid BSON-object/array was passed to the SAX parser + */ + bool parse_bson_element_internal(const char_int_type element_type, + const std::size_t element_type_parse_position) + { + switch (element_type) + { + case 0x01: // double + { + double number{}; + return get_number(input_format_t::bson, number) && sax->number_float(static_cast(number), ""); + } + + case 0x02: // string + { + std::int32_t len{}; + string_t value; + return get_number(input_format_t::bson, len) && get_bson_string(len, value) && sax->string(value); + } + + case 0x03: // object + { + return parse_bson_internal(); + } + + case 0x04: // array + { + return parse_bson_array(); + } + + case 0x05: // binary + { + std::int32_t len{}; + binary_t value; + return get_number(input_format_t::bson, len) && get_bson_binary(len, value) && sax->binary(value); + } + + case 0x08: // boolean + { + return sax->boolean(get() != 0); + } + + case 0x0A: // null + { + return sax->null(); + } + + case 0x10: // int32 + { + std::int32_t value{}; + return get_number(input_format_t::bson, value) && sax->number_integer(value); + } + + case 0x12: // int64 + { + std::int64_t value{}; + return get_number(input_format_t::bson, value) && sax->number_integer(value); + } + + default: // anything else not supported (yet) + { + std::array cr{{}}; + (std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast(element_type)); + return sax->parse_error(element_type_parse_position, std::string(cr.data()), parse_error::create(114, element_type_parse_position, "Unsupported BSON record type 0x" + std::string(cr.data()))); + } + } + } + + /*! + @brief Read a BSON element list (as specified in the BSON-spec) + + The same binary layout is used for objects and arrays, hence it must be + indicated with the argument @a is_array which one is expected + (true --> array, false --> object). + + @param[in] is_array Determines if the element list being read is to be + treated as an object (@a is_array == false), or as an + array (@a is_array == true). + @return whether a valid BSON-object/array was passed to the SAX parser + */ + bool parse_bson_element_list(const bool is_array) + { + string_t key; + + while (auto element_type = get()) + { + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "element list"))) + { + return false; + } + + const std::size_t element_type_parse_position = chars_read; + if (JSON_HEDLEY_UNLIKELY(!get_bson_cstr(key))) + { + return false; + } + + if (!is_array && !sax->key(key)) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_internal(element_type, element_type_parse_position))) + { + return false; + } + + // get_bson_cstr only appends + key.clear(); + } + + return true; + } + + /*! + @brief Reads an array from the BSON input and passes it to the SAX-parser. + @return whether a valid BSON-array was passed to the SAX parser + */ + bool parse_bson_array() + { + std::int32_t document_size{}; + get_number(input_format_t::bson, document_size); + + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(std::size_t(-1)))) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/true))) + { + return false; + } + + return sax->end_array(); + } + + ////////// + // CBOR // + ////////// + + /*! + @param[in] get_char whether a new character should be retrieved from the + input (true) or whether the last read character should + be considered instead (false) + @param[in] tag_handler how CBOR tags should be treated + + @return whether a valid CBOR value was passed to the SAX parser + */ + bool parse_cbor_internal(const bool get_char, + const cbor_tag_handler_t tag_handler) + { + switch (get_char ? get() : current) + { + // EOF + case std::char_traits::eof(): + return unexpect_eof(input_format_t::cbor, "value"); + + // Integer 0x00..0x17 (0..23) + case 0x00: + case 0x01: + case 0x02: + case 0x03: + case 0x04: + case 0x05: + case 0x06: + case 0x07: + case 0x08: + case 0x09: + case 0x0A: + case 0x0B: + case 0x0C: + case 0x0D: + case 0x0E: + case 0x0F: + case 0x10: + case 0x11: + case 0x12: + case 0x13: + case 0x14: + case 0x15: + case 0x16: + case 0x17: + return sax->number_unsigned(static_cast(current)); + + case 0x18: // Unsigned integer (one-byte uint8_t follows) + { + std::uint8_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_unsigned(number); + } + + case 0x19: // Unsigned integer (two-byte uint16_t follows) + { + std::uint16_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_unsigned(number); + } + + case 0x1A: // Unsigned integer (four-byte uint32_t follows) + { + std::uint32_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_unsigned(number); + } + + case 0x1B: // Unsigned integer (eight-byte uint64_t follows) + { + std::uint64_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_unsigned(number); + } + + // Negative integer -1-0x00..-1-0x17 (-1..-24) + case 0x20: + case 0x21: + case 0x22: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + return sax->number_integer(static_cast(0x20 - 1 - current)); + + case 0x38: // Negative integer (one-byte uint8_t follows) + { + std::uint8_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast(-1) - number); + } + + case 0x39: // Negative integer -1-n (two-byte uint16_t follows) + { + std::uint16_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast(-1) - number); + } + + case 0x3A: // Negative integer -1-n (four-byte uint32_t follows) + { + std::uint32_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast(-1) - number); + } + + case 0x3B: // Negative integer -1-n (eight-byte uint64_t follows) + { + std::uint64_t number{}; + return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast(-1) + - static_cast(number)); + } + + // Binary data (0x00..0x17 bytes follow) + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + case 0x58: // Binary data (one-byte uint8_t for n follows) + case 0x59: // Binary data (two-byte uint16_t for n follow) + case 0x5A: // Binary data (four-byte uint32_t for n follow) + case 0x5B: // Binary data (eight-byte uint64_t for n follow) + case 0x5F: // Binary data (indefinite length) + { + binary_t b; + return get_cbor_binary(b) && sax->binary(b); + } + + // UTF-8 string (0x00..0x17 bytes follow) + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: // UTF-8 string (one-byte uint8_t for n follows) + case 0x79: // UTF-8 string (two-byte uint16_t for n follow) + case 0x7A: // UTF-8 string (four-byte uint32_t for n follow) + case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow) + case 0x7F: // UTF-8 string (indefinite length) + { + string_t s; + return get_cbor_string(s) && sax->string(s); + } + + // array (0x00..0x17 data items follow) + case 0x80: + case 0x81: + case 0x82: + case 0x83: + case 0x84: + case 0x85: + case 0x86: + case 0x87: + case 0x88: + case 0x89: + case 0x8A: + case 0x8B: + case 0x8C: + case 0x8D: + case 0x8E: + case 0x8F: + case 0x90: + case 0x91: + case 0x92: + case 0x93: + case 0x94: + case 0x95: + case 0x96: + case 0x97: + return get_cbor_array(static_cast(static_cast(current) & 0x1Fu), tag_handler); + + case 0x98: // array (one-byte uint8_t for n follows) + { + std::uint8_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast(len), tag_handler); + } + + case 0x99: // array (two-byte uint16_t for n follow) + { + std::uint16_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast(len), tag_handler); + } + + case 0x9A: // array (four-byte uint32_t for n follow) + { + std::uint32_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast(len), tag_handler); + } + + case 0x9B: // array (eight-byte uint64_t for n follow) + { + std::uint64_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast(len), tag_handler); + } + + case 0x9F: // array (indefinite length) + return get_cbor_array(std::size_t(-1), tag_handler); + + // map (0x00..0x17 pairs of data items follow) + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + return get_cbor_object(static_cast(static_cast(current) & 0x1Fu), tag_handler); + + case 0xB8: // map (one-byte uint8_t for n follows) + { + std::uint8_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast(len), tag_handler); + } + + case 0xB9: // map (two-byte uint16_t for n follow) + { + std::uint16_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast(len), tag_handler); + } + + case 0xBA: // map (four-byte uint32_t for n follow) + { + std::uint32_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast(len), tag_handler); + } + + case 0xBB: // map (eight-byte uint64_t for n follow) + { + std::uint64_t len{}; + return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast(len), tag_handler); + } + + case 0xBF: // map (indefinite length) + return get_cbor_object(std::size_t(-1), tag_handler); + + case 0xC6: // tagged item + case 0xC7: + case 0xC8: + case 0xC9: + case 0xCA: + case 0xCB: + case 0xCC: + case 0xCD: + case 0xCE: + case 0xCF: + case 0xD0: + case 0xD1: + case 0xD2: + case 0xD3: + case 0xD4: + case 0xD8: // tagged item (1 bytes follow) + case 0xD9: // tagged item (2 bytes follow) + case 0xDA: // tagged item (4 bytes follow) + case 0xDB: // tagged item (8 bytes follow) + { + switch (tag_handler) + { + case cbor_tag_handler_t::error: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::cbor, "invalid byte: 0x" + last_token, "value"))); + } + + case cbor_tag_handler_t::ignore: + { + switch (current) + { + case 0xD8: + { + std::uint8_t len{}; + get_number(input_format_t::cbor, len); + break; + } + case 0xD9: + { + std::uint16_t len{}; + get_number(input_format_t::cbor, len); + break; + } + case 0xDA: + { + std::uint32_t len{}; + get_number(input_format_t::cbor, len); + break; + } + case 0xDB: + { + std::uint64_t len{}; + get_number(input_format_t::cbor, len); + break; + } + default: + break; + } + return parse_cbor_internal(true, tag_handler); + } + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + } + + case 0xF4: // false + return sax->boolean(false); + + case 0xF5: // true + return sax->boolean(true); + + case 0xF6: // null + return sax->null(); + + case 0xF9: // Half-Precision Float (two-byte IEEE 754) + { + const auto byte1_raw = get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number"))) + { + return false; + } + const auto byte2_raw = get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number"))) + { + return false; + } + + const auto byte1 = static_cast(byte1_raw); + const auto byte2 = static_cast(byte2_raw); + + // code from RFC 7049, Appendix D, Figure 3: + // As half-precision floating-point numbers were only added + // to IEEE 754 in 2008, today's programming platforms often + // still only have limited support for them. It is very + // easy to include at least decoding support for them even + // without such support. An example of a small decoder for + // half-precision floating-point numbers in the C language + // is shown in Fig. 3. + const auto half = static_cast((byte1 << 8u) + byte2); + const double val = [&half] + { + const int exp = (half >> 10u) & 0x1Fu; + const unsigned int mant = half & 0x3FFu; + JSON_ASSERT(0 <= exp&& exp <= 32); + JSON_ASSERT(mant <= 1024); + switch (exp) + { + case 0: + return std::ldexp(mant, -24); + case 31: + return (mant == 0) + ? std::numeric_limits::infinity() + : std::numeric_limits::quiet_NaN(); + default: + return std::ldexp(mant + 1024, exp - 25); + } + }(); + return sax->number_float((half & 0x8000u) != 0 + ? static_cast(-val) + : static_cast(val), ""); + } + + case 0xFA: // Single-Precision Float (four-byte IEEE 754) + { + float number{}; + return get_number(input_format_t::cbor, number) && sax->number_float(static_cast(number), ""); + } + + case 0xFB: // Double-Precision Float (eight-byte IEEE 754) + { + double number{}; + return get_number(input_format_t::cbor, number) && sax->number_float(static_cast(number), ""); + } + + default: // anything else (0xFF is handled inside the other types) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::cbor, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @brief reads a CBOR string + + This function first reads starting bytes to determine the expected + string length and then copies this number of bytes into a string. + Additionally, CBOR's strings with indefinite lengths are supported. + + @param[out] result created string + + @return whether string creation completed + */ + bool get_cbor_string(string_t& result) + { + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "string"))) + { + return false; + } + + switch (current) + { + // UTF-8 string (0x00..0x17 bytes follow) + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + { + return get_string(input_format_t::cbor, static_cast(current) & 0x1Fu, result); + } + + case 0x78: // UTF-8 string (one-byte uint8_t for n follows) + { + std::uint8_t len{}; + return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result); + } + + case 0x79: // UTF-8 string (two-byte uint16_t for n follow) + { + std::uint16_t len{}; + return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result); + } + + case 0x7A: // UTF-8 string (four-byte uint32_t for n follow) + { + std::uint32_t len{}; + return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result); + } + + case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow) + { + std::uint64_t len{}; + return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result); + } + + case 0x7F: // UTF-8 string (indefinite length) + { + while (get() != 0xFF) + { + string_t chunk; + if (!get_cbor_string(chunk)) + { + return false; + } + result.append(chunk); + } + return true; + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::cbor, "expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0x" + last_token, "string"))); + } + } + } + + /*! + @brief reads a CBOR byte array + + This function first reads starting bytes to determine the expected + byte array length and then copies this number of bytes into the byte array. + Additionally, CBOR's byte arrays with indefinite lengths are supported. + + @param[out] result created byte array + + @return whether byte array creation completed + */ + bool get_cbor_binary(binary_t& result) + { + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "binary"))) + { + return false; + } + + switch (current) + { + // Binary data (0x00..0x17 bytes follow) + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + { + return get_binary(input_format_t::cbor, static_cast(current) & 0x1Fu, result); + } + + case 0x58: // Binary data (one-byte uint8_t for n follows) + { + std::uint8_t len{}; + return get_number(input_format_t::cbor, len) && + get_binary(input_format_t::cbor, len, result); + } + + case 0x59: // Binary data (two-byte uint16_t for n follow) + { + std::uint16_t len{}; + return get_number(input_format_t::cbor, len) && + get_binary(input_format_t::cbor, len, result); + } + + case 0x5A: // Binary data (four-byte uint32_t for n follow) + { + std::uint32_t len{}; + return get_number(input_format_t::cbor, len) && + get_binary(input_format_t::cbor, len, result); + } + + case 0x5B: // Binary data (eight-byte uint64_t for n follow) + { + std::uint64_t len{}; + return get_number(input_format_t::cbor, len) && + get_binary(input_format_t::cbor, len, result); + } + + case 0x5F: // Binary data (indefinite length) + { + while (get() != 0xFF) + { + binary_t chunk; + if (!get_cbor_binary(chunk)) + { + return false; + } + result.insert(result.end(), chunk.begin(), chunk.end()); + } + return true; + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::cbor, "expected length specification (0x40-0x5B) or indefinite binary array type (0x5F); last byte: 0x" + last_token, "binary"))); + } + } + } + + /*! + @param[in] len the length of the array or std::size_t(-1) for an + array of indefinite size + @param[in] tag_handler how CBOR tags should be treated + @return whether array creation completed + */ + bool get_cbor_array(const std::size_t len, + const cbor_tag_handler_t tag_handler) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len))) + { + return false; + } + + if (len != std::size_t(-1)) + { + for (std::size_t i = 0; i < len; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler))) + { + return false; + } + } + } + else + { + while (get() != 0xFF) + { + if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(false, tag_handler))) + { + return false; + } + } + } + + return sax->end_array(); + } + + /*! + @param[in] len the length of the object or std::size_t(-1) for an + object of indefinite size + @param[in] tag_handler how CBOR tags should be treated + @return whether object creation completed + */ + bool get_cbor_object(const std::size_t len, + const cbor_tag_handler_t tag_handler) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len))) + { + return false; + } + + string_t key; + if (len != std::size_t(-1)) + { + for (std::size_t i = 0; i < len; ++i) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key))) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler))) + { + return false; + } + key.clear(); + } + } + else + { + while (get() != 0xFF) + { + if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key))) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler))) + { + return false; + } + key.clear(); + } + } + + return sax->end_object(); + } + + ///////////// + // MsgPack // + ///////////// + + /*! + @return whether a valid MessagePack value was passed to the SAX parser + */ + bool parse_msgpack_internal() + { + switch (get()) + { + // EOF + case std::char_traits::eof(): + return unexpect_eof(input_format_t::msgpack, "value"); + + // positive fixint + case 0x00: + case 0x01: + case 0x02: + case 0x03: + case 0x04: + case 0x05: + case 0x06: + case 0x07: + case 0x08: + case 0x09: + case 0x0A: + case 0x0B: + case 0x0C: + case 0x0D: + case 0x0E: + case 0x0F: + case 0x10: + case 0x11: + case 0x12: + case 0x13: + case 0x14: + case 0x15: + case 0x16: + case 0x17: + case 0x18: + case 0x19: + case 0x1A: + case 0x1B: + case 0x1C: + case 0x1D: + case 0x1E: + case 0x1F: + case 0x20: + case 0x21: + case 0x22: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + case 0x38: + case 0x39: + case 0x3A: + case 0x3B: + case 0x3C: + case 0x3D: + case 0x3E: + case 0x3F: + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + case 0x58: + case 0x59: + case 0x5A: + case 0x5B: + case 0x5C: + case 0x5D: + case 0x5E: + case 0x5F: + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: + case 0x79: + case 0x7A: + case 0x7B: + case 0x7C: + case 0x7D: + case 0x7E: + case 0x7F: + return sax->number_unsigned(static_cast(current)); + + // fixmap + case 0x80: + case 0x81: + case 0x82: + case 0x83: + case 0x84: + case 0x85: + case 0x86: + case 0x87: + case 0x88: + case 0x89: + case 0x8A: + case 0x8B: + case 0x8C: + case 0x8D: + case 0x8E: + case 0x8F: + return get_msgpack_object(static_cast(static_cast(current) & 0x0Fu)); + + // fixarray + case 0x90: + case 0x91: + case 0x92: + case 0x93: + case 0x94: + case 0x95: + case 0x96: + case 0x97: + case 0x98: + case 0x99: + case 0x9A: + case 0x9B: + case 0x9C: + case 0x9D: + case 0x9E: + case 0x9F: + return get_msgpack_array(static_cast(static_cast(current) & 0x0Fu)); + + // fixstr + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + case 0xB8: + case 0xB9: + case 0xBA: + case 0xBB: + case 0xBC: + case 0xBD: + case 0xBE: + case 0xBF: + case 0xD9: // str 8 + case 0xDA: // str 16 + case 0xDB: // str 32 + { + string_t s; + return get_msgpack_string(s) && sax->string(s); + } + + case 0xC0: // nil + return sax->null(); + + case 0xC2: // false + return sax->boolean(false); + + case 0xC3: // true + return sax->boolean(true); + + case 0xC4: // bin 8 + case 0xC5: // bin 16 + case 0xC6: // bin 32 + case 0xC7: // ext 8 + case 0xC8: // ext 16 + case 0xC9: // ext 32 + case 0xD4: // fixext 1 + case 0xD5: // fixext 2 + case 0xD6: // fixext 4 + case 0xD7: // fixext 8 + case 0xD8: // fixext 16 + { + binary_t b; + return get_msgpack_binary(b) && sax->binary(b); + } + + case 0xCA: // float 32 + { + float number{}; + return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast(number), ""); + } + + case 0xCB: // float 64 + { + double number{}; + return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast(number), ""); + } + + case 0xCC: // uint 8 + { + std::uint8_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number); + } + + case 0xCD: // uint 16 + { + std::uint16_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number); + } + + case 0xCE: // uint 32 + { + std::uint32_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number); + } + + case 0xCF: // uint 64 + { + std::uint64_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number); + } + + case 0xD0: // int 8 + { + std::int8_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_integer(number); + } + + case 0xD1: // int 16 + { + std::int16_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_integer(number); + } + + case 0xD2: // int 32 + { + std::int32_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_integer(number); + } + + case 0xD3: // int 64 + { + std::int64_t number{}; + return get_number(input_format_t::msgpack, number) && sax->number_integer(number); + } + + case 0xDC: // array 16 + { + std::uint16_t len{}; + return get_number(input_format_t::msgpack, len) && get_msgpack_array(static_cast(len)); + } + + case 0xDD: // array 32 + { + std::uint32_t len{}; + return get_number(input_format_t::msgpack, len) && get_msgpack_array(static_cast(len)); + } + + case 0xDE: // map 16 + { + std::uint16_t len{}; + return get_number(input_format_t::msgpack, len) && get_msgpack_object(static_cast(len)); + } + + case 0xDF: // map 32 + { + std::uint32_t len{}; + return get_number(input_format_t::msgpack, len) && get_msgpack_object(static_cast(len)); + } + + // negative fixint + case 0xE0: + case 0xE1: + case 0xE2: + case 0xE3: + case 0xE4: + case 0xE5: + case 0xE6: + case 0xE7: + case 0xE8: + case 0xE9: + case 0xEA: + case 0xEB: + case 0xEC: + case 0xED: + case 0xEE: + case 0xEF: + case 0xF0: + case 0xF1: + case 0xF2: + case 0xF3: + case 0xF4: + case 0xF5: + case 0xF6: + case 0xF7: + case 0xF8: + case 0xF9: + case 0xFA: + case 0xFB: + case 0xFC: + case 0xFD: + case 0xFE: + case 0xFF: + return sax->number_integer(static_cast(current)); + + default: // anything else + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::msgpack, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @brief reads a MessagePack string + + This function first reads starting bytes to determine the expected + string length and then copies this number of bytes into a string. + + @param[out] result created string + + @return whether string creation completed + */ + bool get_msgpack_string(string_t& result) + { + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::msgpack, "string"))) + { + return false; + } + + switch (current) + { + // fixstr + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + case 0xB8: + case 0xB9: + case 0xBA: + case 0xBB: + case 0xBC: + case 0xBD: + case 0xBE: + case 0xBF: + { + return get_string(input_format_t::msgpack, static_cast(current) & 0x1Fu, result); + } + + case 0xD9: // str 8 + { + std::uint8_t len{}; + return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result); + } + + case 0xDA: // str 16 + { + std::uint16_t len{}; + return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result); + } + + case 0xDB: // str 32 + { + std::uint32_t len{}; + return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result); + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::msgpack, "expected length specification (0xA0-0xBF, 0xD9-0xDB); last byte: 0x" + last_token, "string"))); + } + } + } + + /*! + @brief reads a MessagePack byte array + + This function first reads starting bytes to determine the expected + byte array length and then copies this number of bytes into a byte array. + + @param[out] result created byte array + + @return whether byte array creation completed + */ + bool get_msgpack_binary(binary_t& result) + { + // helper function to set the subtype + auto assign_and_return_true = [&result](std::int8_t subtype) + { + result.set_subtype(static_cast(subtype)); + return true; + }; + + switch (current) + { + case 0xC4: // bin 8 + { + std::uint8_t len{}; + return get_number(input_format_t::msgpack, len) && + get_binary(input_format_t::msgpack, len, result); + } + + case 0xC5: // bin 16 + { + std::uint16_t len{}; + return get_number(input_format_t::msgpack, len) && + get_binary(input_format_t::msgpack, len, result); + } + + case 0xC6: // bin 32 + { + std::uint32_t len{}; + return get_number(input_format_t::msgpack, len) && + get_binary(input_format_t::msgpack, len, result); + } + + case 0xC7: // ext 8 + { + std::uint8_t len{}; + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, len) && + get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, len, result) && + assign_and_return_true(subtype); + } + + case 0xC8: // ext 16 + { + std::uint16_t len{}; + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, len) && + get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, len, result) && + assign_and_return_true(subtype); + } + + case 0xC9: // ext 32 + { + std::uint32_t len{}; + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, len) && + get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, len, result) && + assign_and_return_true(subtype); + } + + case 0xD4: // fixext 1 + { + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, 1, result) && + assign_and_return_true(subtype); + } + + case 0xD5: // fixext 2 + { + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, 2, result) && + assign_and_return_true(subtype); + } + + case 0xD6: // fixext 4 + { + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, 4, result) && + assign_and_return_true(subtype); + } + + case 0xD7: // fixext 8 + { + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, 8, result) && + assign_and_return_true(subtype); + } + + case 0xD8: // fixext 16 + { + std::int8_t subtype{}; + return get_number(input_format_t::msgpack, subtype) && + get_binary(input_format_t::msgpack, 16, result) && + assign_and_return_true(subtype); + } + + default: // LCOV_EXCL_LINE + return false; // LCOV_EXCL_LINE + } + } + + /*! + @param[in] len the length of the array + @return whether array creation completed + */ + bool get_msgpack_array(const std::size_t len) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len))) + { + return false; + } + + for (std::size_t i = 0; i < len; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal())) + { + return false; + } + } + + return sax->end_array(); + } + + /*! + @param[in] len the length of the object + @return whether object creation completed + */ + bool get_msgpack_object(const std::size_t len) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len))) + { + return false; + } + + string_t key; + for (std::size_t i = 0; i < len; ++i) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!get_msgpack_string(key) || !sax->key(key))) + { + return false; + } + + if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal())) + { + return false; + } + key.clear(); + } + + return sax->end_object(); + } + + //////////// + // UBJSON // + //////////// + + /*! + @param[in] get_char whether a new character should be retrieved from the + input (true, default) or whether the last read + character should be considered instead + + @return whether a valid UBJSON value was passed to the SAX parser + */ + bool parse_ubjson_internal(const bool get_char = true) + { + return get_ubjson_value(get_char ? get_ignore_noop() : current); + } + + /*! + @brief reads a UBJSON string + + This function is either called after reading the 'S' byte explicitly + indicating a string, or in case of an object key where the 'S' byte can be + left out. + + @param[out] result created string + @param[in] get_char whether a new character should be retrieved from the + input (true, default) or whether the last read + character should be considered instead + + @return whether string creation completed + */ + bool get_ubjson_string(string_t& result, const bool get_char = true) + { + if (get_char) + { + get(); // TODO(niels): may we ignore N here? + } + + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::ubjson, "value"))) + { + return false; + } + + switch (current) + { + case 'U': + { + std::uint8_t len{}; + return get_number(input_format_t::ubjson, len) && get_string(input_format_t::ubjson, len, result); + } + + case 'i': + { + std::int8_t len{}; + return get_number(input_format_t::ubjson, len) && get_string(input_format_t::ubjson, len, result); + } + + case 'I': + { + std::int16_t len{}; + return get_number(input_format_t::ubjson, len) && get_string(input_format_t::ubjson, len, result); + } + + case 'l': + { + std::int32_t len{}; + return get_number(input_format_t::ubjson, len) && get_string(input_format_t::ubjson, len, result); + } + + case 'L': + { + std::int64_t len{}; + return get_number(input_format_t::ubjson, len) && get_string(input_format_t::ubjson, len, result); + } + + default: + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "expected length type specification (U, i, I, l, L); last byte: 0x" + last_token, "string"))); + } + } + + /*! + @param[out] result determined size + @return whether size determination completed + */ + bool get_ubjson_size_value(std::size_t& result) + { + switch (get_ignore_noop()) + { + case 'U': + { + std::uint8_t number{}; + if (JSON_HEDLEY_UNLIKELY(!get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast(number); + return true; + } + + case 'i': + { + std::int8_t number{}; + if (JSON_HEDLEY_UNLIKELY(!get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast(number); + return true; + } + + case 'I': + { + std::int16_t number{}; + if (JSON_HEDLEY_UNLIKELY(!get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast(number); + return true; + } + + case 'l': + { + std::int32_t number{}; + if (JSON_HEDLEY_UNLIKELY(!get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast(number); + return true; + } + + case 'L': + { + std::int64_t number{}; + if (JSON_HEDLEY_UNLIKELY(!get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast(number); + return true; + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "expected length type specification (U, i, I, l, L) after '#'; last byte: 0x" + last_token, "size"))); + } + } + } + + /*! + @brief determine the type and size for a container + + In the optimized UBJSON format, a type and a size can be provided to allow + for a more compact representation. + + @param[out] result pair of the size and the type + + @return whether pair creation completed + */ + bool get_ubjson_size_type(std::pair& result) + { + result.first = string_t::npos; // size + result.second = 0; // type + + get_ignore_noop(); + + if (current == '$') + { + result.second = get(); // must not ignore 'N', because 'N' maybe the type + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::ubjson, "type"))) + { + return false; + } + + get_ignore_noop(); + if (JSON_HEDLEY_UNLIKELY(current != '#')) + { + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::ubjson, "value"))) + { + return false; + } + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::ubjson, "expected '#' after type information; last byte: 0x" + last_token, "size"))); + } + + return get_ubjson_size_value(result.first); + } + + if (current == '#') + { + return get_ubjson_size_value(result.first); + } + + return true; + } + + /*! + @param prefix the previously read or set type prefix + @return whether value creation completed + */ + bool get_ubjson_value(const char_int_type prefix) + { + switch (prefix) + { + case std::char_traits::eof(): // EOF + return unexpect_eof(input_format_t::ubjson, "value"); + + case 'T': // true + return sax->boolean(true); + case 'F': // false + return sax->boolean(false); + + case 'Z': // null + return sax->null(); + + case 'U': + { + std::uint8_t number{}; + return get_number(input_format_t::ubjson, number) && sax->number_unsigned(number); + } + + case 'i': + { + std::int8_t number{}; + return get_number(input_format_t::ubjson, number) && sax->number_integer(number); + } + + case 'I': + { + std::int16_t number{}; + return get_number(input_format_t::ubjson, number) && sax->number_integer(number); + } + + case 'l': + { + std::int32_t number{}; + return get_number(input_format_t::ubjson, number) && sax->number_integer(number); + } + + case 'L': + { + std::int64_t number{}; + return get_number(input_format_t::ubjson, number) && sax->number_integer(number); + } + + case 'd': + { + float number{}; + return get_number(input_format_t::ubjson, number) && sax->number_float(static_cast(number), ""); + } + + case 'D': + { + double number{}; + return get_number(input_format_t::ubjson, number) && sax->number_float(static_cast(number), ""); + } + + case 'H': + { + return get_ubjson_high_precision_number(); + } + + case 'C': // char + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::ubjson, "char"))) + { + return false; + } + if (JSON_HEDLEY_UNLIKELY(current > 127)) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "byte after 'C' must be in range 0x00..0x7F; last byte: 0x" + last_token, "char"))); + } + string_t s(1, static_cast(current)); + return sax->string(s); + } + + case 'S': // string + { + string_t s; + return get_ubjson_string(s) && sax->string(s); + } + + case '[': // array + return get_ubjson_array(); + + case '{': // object + return get_ubjson_object(); + + default: // anything else + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::ubjson, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @return whether array creation completed + */ + bool get_ubjson_array() + { + std::pair size_and_type; + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type))) + { + return false; + } + + if (size_and_type.first != string_t::npos) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(size_and_type.first))) + { + return false; + } + + if (size_and_type.second != 0) + { + if (size_and_type.second != 'N') + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second))) + { + return false; + } + } + } + } + else + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal())) + { + return false; + } + } + } + } + else + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(std::size_t(-1)))) + { + return false; + } + + while (current != ']') + { + if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal(false))) + { + return false; + } + get_ignore_noop(); + } + } + + return sax->end_array(); + } + + /*! + @return whether object creation completed + */ + bool get_ubjson_object() + { + std::pair size_and_type; + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type))) + { + return false; + } + + string_t key; + if (size_and_type.first != string_t::npos) + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(size_and_type.first))) + { + return false; + } + + if (size_and_type.second != 0) + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key))) + { + return false; + } + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second))) + { + return false; + } + key.clear(); + } + } + else + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key))) + { + return false; + } + if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal())) + { + return false; + } + key.clear(); + } + } + } + else + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(std::size_t(-1)))) + { + return false; + } + + while (current != '}') + { + if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key, false) || !sax->key(key))) + { + return false; + } + if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal())) + { + return false; + } + get_ignore_noop(); + key.clear(); + } + } + + return sax->end_object(); + } + + // Note, no reader for UBJSON binary types is implemented because they do + // not exist + + bool get_ubjson_high_precision_number() + { + // get size of following number string + std::size_t size{}; + auto res = get_ubjson_size_value(size); + if (JSON_HEDLEY_UNLIKELY(!res)) + { + return res; + } + + // get number string + std::vector number_vector; + for (std::size_t i = 0; i < size; ++i) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::ubjson, "number"))) + { + return false; + } + number_vector.push_back(static_cast(current)); + } + + // parse number string + auto number_ia = detail::input_adapter(std::forward(number_vector)); + auto number_lexer = detail::lexer(std::move(number_ia), false); + const auto result_number = number_lexer.scan(); + const auto number_string = number_lexer.get_token_string(); + const auto result_remainder = number_lexer.scan(); + + using token_type = typename detail::lexer_base::token_type; + + if (JSON_HEDLEY_UNLIKELY(result_remainder != token_type::end_of_input)) + { + return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read, exception_message(input_format_t::ubjson, "invalid number text: " + number_lexer.get_token_string(), "high-precision number"))); + } + + switch (result_number) + { + case token_type::value_integer: + return sax->number_integer(number_lexer.get_number_integer()); + case token_type::value_unsigned: + return sax->number_unsigned(number_lexer.get_number_unsigned()); + case token_type::value_float: + return sax->number_float(number_lexer.get_number_float(), std::move(number_string)); + default: + return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read, exception_message(input_format_t::ubjson, "invalid number text: " + number_lexer.get_token_string(), "high-precision number"))); + } + } + + /////////////////////// + // Utility functions // + /////////////////////// + + /*! + @brief get next character from the input + + This function provides the interface to the used input adapter. It does + not throw in case the input reached EOF, but returns a -'ve valued + `std::char_traits::eof()` in that case. + + @return character read from the input + */ + char_int_type get() + { + ++chars_read; + return current = ia.get_character(); + } + + /*! + @return character read from the input after ignoring all 'N' entries + */ + char_int_type get_ignore_noop() + { + do + { + get(); + } + while (current == 'N'); + + return current; + } + + /* + @brief read a number from the input + + @tparam NumberType the type of the number + @param[in] format the current format (for diagnostics) + @param[out] result number of type @a NumberType + + @return whether conversion completed + + @note This function needs to respect the system's endianess, because + bytes in CBOR, MessagePack, and UBJSON are stored in network order + (big endian) and therefore need reordering on little endian systems. + */ + template + bool get_number(const input_format_t format, NumberType& result) + { + // step 1: read input into array with system's byte order + std::array vec; + for (std::size_t i = 0; i < sizeof(NumberType); ++i) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "number"))) + { + return false; + } + + // reverse byte order prior to conversion if necessary + if (is_little_endian != InputIsLittleEndian) + { + vec[sizeof(NumberType) - i - 1] = static_cast(current); + } + else + { + vec[i] = static_cast(current); // LCOV_EXCL_LINE + } + } + + // step 2: convert array into number of type T and return + std::memcpy(&result, vec.data(), sizeof(NumberType)); + return true; + } + + /*! + @brief create a string by reading characters from the input + + @tparam NumberType the type of the number + @param[in] format the current format (for diagnostics) + @param[in] len number of characters to read + @param[out] result string created by reading @a len bytes + + @return whether string creation completed + + @note We can not reserve @a len bytes for the result, because @a len + may be too large. Usually, @ref unexpect_eof() detects the end of + the input before we run out of string memory. + */ + template + bool get_string(const input_format_t format, + const NumberType len, + string_t& result) + { + bool success = true; + for (NumberType i = 0; i < len; i++) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "string"))) + { + success = false; + break; + } + result.push_back(static_cast(current)); + }; + return success; + } + + /*! + @brief create a byte array by reading bytes from the input + + @tparam NumberType the type of the number + @param[in] format the current format (for diagnostics) + @param[in] len number of bytes to read + @param[out] result byte array created by reading @a len bytes + + @return whether byte array creation completed + + @note We can not reserve @a len bytes for the result, because @a len + may be too large. Usually, @ref unexpect_eof() detects the end of + the input before we run out of memory. + */ + template + bool get_binary(const input_format_t format, + const NumberType len, + binary_t& result) + { + bool success = true; + for (NumberType i = 0; i < len; i++) + { + get(); + if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "binary"))) + { + success = false; + break; + } + result.push_back(static_cast(current)); + } + return success; + } + + /*! + @param[in] format the current format (for diagnostics) + @param[in] context further context information (for diagnostics) + @return whether the last read character is not EOF + */ + JSON_HEDLEY_NON_NULL(3) + bool unexpect_eof(const input_format_t format, const char* context) const + { + if (JSON_HEDLEY_UNLIKELY(current == std::char_traits::eof())) + { + return sax->parse_error(chars_read, "", + parse_error::create(110, chars_read, exception_message(format, "unexpected end of input", context))); + } + return true; + } + + /*! + @return a string representation of the last read byte + */ + std::string get_token_string() const + { + std::array cr{{}}; + (std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast(current)); + return std::string{cr.data()}; + } + + /*! + @param[in] format the current format + @param[in] detail a detailed error message + @param[in] context further context information + @return a message string to use in the parse_error exceptions + */ + std::string exception_message(const input_format_t format, + const std::string& detail, + const std::string& context) const + { + std::string error_msg = "syntax error while parsing "; + + switch (format) + { + case input_format_t::cbor: + error_msg += "CBOR"; + break; + + case input_format_t::msgpack: + error_msg += "MessagePack"; + break; + + case input_format_t::ubjson: + error_msg += "UBJSON"; + break; + + case input_format_t::bson: + error_msg += "BSON"; + break; + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + + return error_msg + " " + context + ": " + detail; + } + + private: + /// input adapter + InputAdapterType ia; + + /// the current character + char_int_type current = std::char_traits::eof(); + + /// the number of characters read + std::size_t chars_read = 0; + + /// whether we can assume little endianess + const bool is_little_endian = little_endianess(); + + /// the SAX parser + json_sax_t* sax = nullptr; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + +// #include + + +#include // isfinite +#include // uint8_t +#include // function +#include // string +#include // move +#include // vector + +// #include + +// #include + +// #include + +// #include + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +//////////// +// parser // +//////////// + +enum class parse_event_t : uint8_t +{ + /// the parser read `{` and started to process a JSON object + object_start, + /// the parser read `}` and finished processing a JSON object + object_end, + /// the parser read `[` and started to process a JSON array + array_start, + /// the parser read `]` and finished processing a JSON array + array_end, + /// the parser read a key of a value in an object + key, + /// the parser finished reading a JSON value + value +}; + +template +using parser_callback_t = + std::function; + +/*! +@brief syntax analysis + +This class implements a recursive descent parser. +*/ +template +class parser +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using lexer_t = lexer; + using token_type = typename lexer_t::token_type; + + public: + /// a parser reading from an input adapter + explicit parser(InputAdapterType&& adapter, + const parser_callback_t cb = nullptr, + const bool allow_exceptions_ = true, + const bool skip_comments = false) + : callback(cb) + , m_lexer(std::move(adapter), skip_comments) + , allow_exceptions(allow_exceptions_) + { + // read first token + get_token(); + } + + /*! + @brief public parser interface + + @param[in] strict whether to expect the last token to be EOF + @param[in,out] result parsed JSON value + + @throw parse_error.101 in case of an unexpected token + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + */ + void parse(const bool strict, BasicJsonType& result) + { + if (callback) + { + json_sax_dom_callback_parser sdp(result, callback, allow_exceptions); + sax_parse_internal(&sdp); + result.assert_invariant(); + + // in strict mode, input must be completely read + if (strict && (get_token() != token_type::end_of_input)) + { + sdp.parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + // in case of an error, return discarded value + if (sdp.is_errored()) + { + result = value_t::discarded; + return; + } + + // set top-level value to null if it was discarded by the callback + // function + if (result.is_discarded()) + { + result = nullptr; + } + } + else + { + json_sax_dom_parser sdp(result, allow_exceptions); + sax_parse_internal(&sdp); + result.assert_invariant(); + + // in strict mode, input must be completely read + if (strict && (get_token() != token_type::end_of_input)) + { + sdp.parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + // in case of an error, return discarded value + if (sdp.is_errored()) + { + result = value_t::discarded; + return; + } + } + } + + /*! + @brief public accept interface + + @param[in] strict whether to expect the last token to be EOF + @return whether the input is a proper JSON text + */ + bool accept(const bool strict = true) + { + json_sax_acceptor sax_acceptor; + return sax_parse(&sax_acceptor, strict); + } + + template + JSON_HEDLEY_NON_NULL(2) + bool sax_parse(SAX* sax, const bool strict = true) + { + (void)detail::is_sax_static_asserts {}; + const bool result = sax_parse_internal(sax); + + // strict mode: next byte must be EOF + if (result && strict && (get_token() != token_type::end_of_input)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + return result; + } + + private: + template + JSON_HEDLEY_NON_NULL(2) + bool sax_parse_internal(SAX* sax) + { + // stack to remember the hierarchy of structured values we are parsing + // true = array; false = object + std::vector states; + // value to avoid a goto (see comment where set to true) + bool skip_to_state_evaluation = false; + + while (true) + { + if (!skip_to_state_evaluation) + { + // invariant: get_token() was called before each iteration + switch (last_token) + { + case token_type::begin_object: + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_object(std::size_t(-1)))) + { + return false; + } + + // closing } -> we are done + if (get_token() == token_type::end_object) + { + if (JSON_HEDLEY_UNLIKELY(!sax->end_object())) + { + return false; + } + break; + } + + // parse key + if (JSON_HEDLEY_UNLIKELY(last_token != token_type::value_string)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::value_string, "object key"))); + } + if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string()))) + { + return false; + } + + // parse separator (:) + if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::name_separator, "object separator"))); + } + + // remember we are now inside an object + states.push_back(false); + + // parse values + get_token(); + continue; + } + + case token_type::begin_array: + { + if (JSON_HEDLEY_UNLIKELY(!sax->start_array(std::size_t(-1)))) + { + return false; + } + + // closing ] -> we are done + if (get_token() == token_type::end_array) + { + if (JSON_HEDLEY_UNLIKELY(!sax->end_array())) + { + return false; + } + break; + } + + // remember we are now inside an array + states.push_back(true); + + // parse values (no need to call get_token) + continue; + } + + case token_type::value_float: + { + const auto res = m_lexer.get_number_float(); + + if (JSON_HEDLEY_UNLIKELY(!std::isfinite(res))) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + out_of_range::create(406, "number overflow parsing '" + m_lexer.get_token_string() + "'")); + } + + if (JSON_HEDLEY_UNLIKELY(!sax->number_float(res, m_lexer.get_string()))) + { + return false; + } + + break; + } + + case token_type::literal_false: + { + if (JSON_HEDLEY_UNLIKELY(!sax->boolean(false))) + { + return false; + } + break; + } + + case token_type::literal_null: + { + if (JSON_HEDLEY_UNLIKELY(!sax->null())) + { + return false; + } + break; + } + + case token_type::literal_true: + { + if (JSON_HEDLEY_UNLIKELY(!sax->boolean(true))) + { + return false; + } + break; + } + + case token_type::value_integer: + { + if (JSON_HEDLEY_UNLIKELY(!sax->number_integer(m_lexer.get_number_integer()))) + { + return false; + } + break; + } + + case token_type::value_string: + { + if (JSON_HEDLEY_UNLIKELY(!sax->string(m_lexer.get_string()))) + { + return false; + } + break; + } + + case token_type::value_unsigned: + { + if (JSON_HEDLEY_UNLIKELY(!sax->number_unsigned(m_lexer.get_number_unsigned()))) + { + return false; + } + break; + } + + case token_type::parse_error: + { + // using "uninitialized" to avoid "expected" message + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::uninitialized, "value"))); + } + + default: // the last token was unexpected + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::literal_or_value, "value"))); + } + } + } + else + { + skip_to_state_evaluation = false; + } + + // we reached this line after we successfully parsed a value + if (states.empty()) + { + // empty stack: we reached the end of the hierarchy: done + return true; + } + + if (states.back()) // array + { + // comma -> next value + if (get_token() == token_type::value_separator) + { + // parse a new value + get_token(); + continue; + } + + // closing ] + if (JSON_HEDLEY_LIKELY(last_token == token_type::end_array)) + { + if (JSON_HEDLEY_UNLIKELY(!sax->end_array())) + { + return false; + } + + // We are done with this array. Before we can parse a + // new value, we need to evaluate the new state first. + // By setting skip_to_state_evaluation to false, we + // are effectively jumping to the beginning of this if. + JSON_ASSERT(!states.empty()); + states.pop_back(); + skip_to_state_evaluation = true; + continue; + } + + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_array, "array"))); + } + else // object + { + // comma -> next value + if (get_token() == token_type::value_separator) + { + // parse key + if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::value_string)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::value_string, "object key"))); + } + + if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string()))) + { + return false; + } + + // parse separator (:) + if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::name_separator, "object separator"))); + } + + // parse values + get_token(); + continue; + } + + // closing } + if (JSON_HEDLEY_LIKELY(last_token == token_type::end_object)) + { + if (JSON_HEDLEY_UNLIKELY(!sax->end_object())) + { + return false; + } + + // We are done with this object. Before we can parse a + // new value, we need to evaluate the new state first. + // By setting skip_to_state_evaluation to false, we + // are effectively jumping to the beginning of this if. + JSON_ASSERT(!states.empty()); + states.pop_back(); + skip_to_state_evaluation = true; + continue; + } + + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_object, "object"))); + } + } + } + + /// get next token from lexer + token_type get_token() + { + return last_token = m_lexer.scan(); + } + + std::string exception_message(const token_type expected, const std::string& context) + { + std::string error_msg = "syntax error "; + + if (!context.empty()) + { + error_msg += "while parsing " + context + " "; + } + + error_msg += "- "; + + if (last_token == token_type::parse_error) + { + error_msg += std::string(m_lexer.get_error_message()) + "; last read: '" + + m_lexer.get_token_string() + "'"; + } + else + { + error_msg += "unexpected " + std::string(lexer_t::token_type_name(last_token)); + } + + if (expected != token_type::uninitialized) + { + error_msg += "; expected " + std::string(lexer_t::token_type_name(expected)); + } + + return error_msg; + } + + private: + /// callback function + const parser_callback_t callback = nullptr; + /// the type of the last read token + token_type last_token = token_type::uninitialized; + /// the lexer + lexer_t m_lexer; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; +}; +} // namespace detail +} // namespace nlohmann + +// #include + + +// #include + + +#include // ptrdiff_t +#include // numeric_limits + +namespace nlohmann +{ +namespace detail +{ +/* +@brief an iterator for primitive JSON types + +This class models an iterator for primitive JSON types (boolean, number, +string). It's only purpose is to allow the iterator/const_iterator classes +to "iterate" over primitive values. Internally, the iterator is modeled by +a `difference_type` variable. Value begin_value (`0`) models the begin, +end_value (`1`) models past the end. +*/ +class primitive_iterator_t +{ + private: + using difference_type = std::ptrdiff_t; + static constexpr difference_type begin_value = 0; + static constexpr difference_type end_value = begin_value + 1; + + /// iterator as signed integer type + difference_type m_it = (std::numeric_limits::min)(); + + public: + constexpr difference_type get_value() const noexcept + { + return m_it; + } + + /// set iterator to a defined beginning + void set_begin() noexcept + { + m_it = begin_value; + } + + /// set iterator to a defined past the end + void set_end() noexcept + { + m_it = end_value; + } + + /// return whether the iterator can be dereferenced + constexpr bool is_begin() const noexcept + { + return m_it == begin_value; + } + + /// return whether the iterator is at end + constexpr bool is_end() const noexcept + { + return m_it == end_value; + } + + friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it == rhs.m_it; + } + + friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it < rhs.m_it; + } + + primitive_iterator_t operator+(difference_type n) noexcept + { + auto result = *this; + result += n; + return result; + } + + friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it - rhs.m_it; + } + + primitive_iterator_t& operator++() noexcept + { + ++m_it; + return *this; + } + + primitive_iterator_t const operator++(int) noexcept + { + auto result = *this; + ++m_it; + return result; + } + + primitive_iterator_t& operator--() noexcept + { + --m_it; + return *this; + } + + primitive_iterator_t const operator--(int) noexcept + { + auto result = *this; + --m_it; + return result; + } + + primitive_iterator_t& operator+=(difference_type n) noexcept + { + m_it += n; + return *this; + } + + primitive_iterator_t& operator-=(difference_type n) noexcept + { + m_it -= n; + return *this; + } +}; +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +/*! +@brief an iterator value + +@note This structure could easily be a union, but MSVC currently does not allow +unions members with complex constructors, see https://github.com/nlohmann/json/pull/105. +*/ +template struct internal_iterator +{ + /// iterator for JSON objects + typename BasicJsonType::object_t::iterator object_iterator {}; + /// iterator for JSON arrays + typename BasicJsonType::array_t::iterator array_iterator {}; + /// generic iterator for all other types + primitive_iterator_t primitive_iterator {}; +}; +} // namespace detail +} // namespace nlohmann + +// #include + + +#include // iterator, random_access_iterator_tag, bidirectional_iterator_tag, advance, next +#include // conditional, is_const, remove_const + +// #include + +// #include + +// #include + +// #include + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +// forward declare, to be able to friend it later on +template class iteration_proxy; +template class iteration_proxy_value; + +/*! +@brief a template for a bidirectional iterator for the @ref basic_json class +This class implements a both iterators (iterator and const_iterator) for the +@ref basic_json class. +@note An iterator is called *initialized* when a pointer to a JSON value has + been set (e.g., by a constructor or a copy assignment). If the iterator is + default-constructed, it is *uninitialized* and most methods are undefined. + **The library uses assertions to detect calls on uninitialized iterators.** +@requirement The class satisfies the following concept requirements: +- +[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator): + The iterator that can be moved can be moved in both directions (i.e. + incremented and decremented). +@since version 1.0.0, simplified in version 2.0.9, change to bidirectional + iterators in version 3.0.0 (see https://github.com/nlohmann/json/issues/593) +*/ +template +class iter_impl +{ + /// allow basic_json to access private members + friend iter_impl::value, typename std::remove_const::type, const BasicJsonType>::type>; + friend BasicJsonType; + friend iteration_proxy; + friend iteration_proxy_value; + + using object_t = typename BasicJsonType::object_t; + using array_t = typename BasicJsonType::array_t; + // make sure BasicJsonType is basic_json or const basic_json + static_assert(is_basic_json::type>::value, + "iter_impl only accepts (const) basic_json"); + + public: + + /// The std::iterator class template (used as a base class to provide typedefs) is deprecated in C++17. + /// The C++ Standard has never required user-defined iterators to derive from std::iterator. + /// A user-defined iterator should provide publicly accessible typedefs named + /// iterator_category, value_type, difference_type, pointer, and reference. + /// Note that value_type is required to be non-const, even for constant iterators. + using iterator_category = std::bidirectional_iterator_tag; + + /// the type of the values when the iterator is dereferenced + using value_type = typename BasicJsonType::value_type; + /// a type to represent differences between iterators + using difference_type = typename BasicJsonType::difference_type; + /// defines a pointer to the type iterated over (value_type) + using pointer = typename std::conditional::value, + typename BasicJsonType::const_pointer, + typename BasicJsonType::pointer>::type; + /// defines a reference to the type iterated over (value_type) + using reference = + typename std::conditional::value, + typename BasicJsonType::const_reference, + typename BasicJsonType::reference>::type; + + /// default constructor + iter_impl() = default; + + /*! + @brief constructor for a given JSON instance + @param[in] object pointer to a JSON object for this iterator + @pre object != nullptr + @post The iterator is initialized; i.e. `m_object != nullptr`. + */ + explicit iter_impl(pointer object) noexcept : m_object(object) + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = typename object_t::iterator(); + break; + } + + case value_t::array: + { + m_it.array_iterator = typename array_t::iterator(); + break; + } + + default: + { + m_it.primitive_iterator = primitive_iterator_t(); + break; + } + } + } + + /*! + @note The conventional copy constructor and copy assignment are implicitly + defined. Combined with the following converting constructor and + assignment, they support: (1) copy from iterator to iterator, (2) + copy from const iterator to const iterator, and (3) conversion from + iterator to const iterator. However conversion from const iterator + to iterator is not defined. + */ + + /*! + @brief const copy constructor + @param[in] other const iterator to copy from + @note This copy constructor had to be defined explicitly to circumvent a bug + occurring on msvc v19.0 compiler (VS 2015) debug build. For more + information refer to: https://github.com/nlohmann/json/issues/1608 + */ + iter_impl(const iter_impl& other) noexcept + : m_object(other.m_object), m_it(other.m_it) + {} + + /*! + @brief converting assignment + @param[in] other const iterator to copy from + @return const/non-const iterator + @note It is not checked whether @a other is initialized. + */ + iter_impl& operator=(const iter_impl& other) noexcept + { + m_object = other.m_object; + m_it = other.m_it; + return *this; + } + + /*! + @brief converting constructor + @param[in] other non-const iterator to copy from + @note It is not checked whether @a other is initialized. + */ + iter_impl(const iter_impl::type>& other) noexcept + : m_object(other.m_object), m_it(other.m_it) + {} + + /*! + @brief converting assignment + @param[in] other non-const iterator to copy from + @return const/non-const iterator + @note It is not checked whether @a other is initialized. + */ + iter_impl& operator=(const iter_impl::type>& other) noexcept + { + m_object = other.m_object; + m_it = other.m_it; + return *this; + } + + private: + /*! + @brief set the iterator to the first value + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + void set_begin() noexcept + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = m_object->m_value.object->begin(); + break; + } + + case value_t::array: + { + m_it.array_iterator = m_object->m_value.array->begin(); + break; + } + + case value_t::null: + { + // set to end so begin()==end() is true: null is empty + m_it.primitive_iterator.set_end(); + break; + } + + default: + { + m_it.primitive_iterator.set_begin(); + break; + } + } + } + + /*! + @brief set the iterator past the last value + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + void set_end() noexcept + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = m_object->m_value.object->end(); + break; + } + + case value_t::array: + { + m_it.array_iterator = m_object->m_value.array->end(); + break; + } + + default: + { + m_it.primitive_iterator.set_end(); + break; + } + } + } + + public: + /*! + @brief return a reference to the value pointed to by the iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference operator*() const + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + JSON_ASSERT(m_it.object_iterator != m_object->m_value.object->end()); + return m_it.object_iterator->second; + } + + case value_t::array: + { + JSON_ASSERT(m_it.array_iterator != m_object->m_value.array->end()); + return *m_it.array_iterator; + } + + case value_t::null: + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + + default: + { + if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin())) + { + return *m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief dereference the iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + pointer operator->() const + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + JSON_ASSERT(m_it.object_iterator != m_object->m_value.object->end()); + return &(m_it.object_iterator->second); + } + + case value_t::array: + { + JSON_ASSERT(m_it.array_iterator != m_object->m_value.array->end()); + return &*m_it.array_iterator; + } + + default: + { + if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin())) + { + return m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief post-increment (it++) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl const operator++(int) + { + auto result = *this; + ++(*this); + return result; + } + + /*! + @brief pre-increment (++it) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator++() + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + std::advance(m_it.object_iterator, 1); + break; + } + + case value_t::array: + { + std::advance(m_it.array_iterator, 1); + break; + } + + default: + { + ++m_it.primitive_iterator; + break; + } + } + + return *this; + } + + /*! + @brief post-decrement (it--) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl const operator--(int) + { + auto result = *this; + --(*this); + return result; + } + + /*! + @brief pre-decrement (--it) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator--() + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + std::advance(m_it.object_iterator, -1); + break; + } + + case value_t::array: + { + std::advance(m_it.array_iterator, -1); + break; + } + + default: + { + --m_it.primitive_iterator; + break; + } + } + + return *this; + } + + /*! + @brief comparison: equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator==(const iter_impl& other) const + { + // if objects are not the same, the comparison is undefined + if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object)) + { + JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers")); + } + + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + return (m_it.object_iterator == other.m_it.object_iterator); + + case value_t::array: + return (m_it.array_iterator == other.m_it.array_iterator); + + default: + return (m_it.primitive_iterator == other.m_it.primitive_iterator); + } + } + + /*! + @brief comparison: not equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator!=(const iter_impl& other) const + { + return !operator==(other); + } + + /*! + @brief comparison: smaller + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator<(const iter_impl& other) const + { + // if objects are not the same, the comparison is undefined + if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object)) + { + JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers")); + } + + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(213, "cannot compare order of object iterators")); + + case value_t::array: + return (m_it.array_iterator < other.m_it.array_iterator); + + default: + return (m_it.primitive_iterator < other.m_it.primitive_iterator); + } + } + + /*! + @brief comparison: less than or equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator<=(const iter_impl& other) const + { + return !other.operator < (*this); + } + + /*! + @brief comparison: greater than + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator>(const iter_impl& other) const + { + return !operator<=(other); + } + + /*! + @brief comparison: greater than or equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator>=(const iter_impl& other) const + { + return !operator<(other); + } + + /*! + @brief add to iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator+=(difference_type i) + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators")); + + case value_t::array: + { + std::advance(m_it.array_iterator, i); + break; + } + + default: + { + m_it.primitive_iterator += i; + break; + } + } + + return *this; + } + + /*! + @brief subtract from iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator-=(difference_type i) + { + return operator+=(-i); + } + + /*! + @brief add to iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl operator+(difference_type i) const + { + auto result = *this; + result += i; + return result; + } + + /*! + @brief addition of distance and iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + friend iter_impl operator+(difference_type i, const iter_impl& it) + { + auto result = it; + result += i; + return result; + } + + /*! + @brief subtract from iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl operator-(difference_type i) const + { + auto result = *this; + result -= i; + return result; + } + + /*! + @brief return difference + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + difference_type operator-(const iter_impl& other) const + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators")); + + case value_t::array: + return m_it.array_iterator - other.m_it.array_iterator; + + default: + return m_it.primitive_iterator - other.m_it.primitive_iterator; + } + } + + /*! + @brief access to successor + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference operator[](difference_type n) const + { + JSON_ASSERT(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(208, "cannot use operator[] for object iterators")); + + case value_t::array: + return *std::next(m_it.array_iterator, n); + + case value_t::null: + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + + default: + { + if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.get_value() == -n)) + { + return *m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief return the key of an object iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + const typename object_t::key_type& key() const + { + JSON_ASSERT(m_object != nullptr); + + if (JSON_HEDLEY_LIKELY(m_object->is_object())) + { + return m_it.object_iterator->first; + } + + JSON_THROW(invalid_iterator::create(207, "cannot use key() for non-object iterators")); + } + + /*! + @brief return the value of an iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference value() const + { + return operator*(); + } + + private: + /// associated JSON instance + pointer m_object = nullptr; + /// the actual iterator of the associated instance + internal_iterator::type> m_it {}; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + + +#include // ptrdiff_t +#include // reverse_iterator +#include // declval + +namespace nlohmann +{ +namespace detail +{ +////////////////////// +// reverse_iterator // +////////////////////// + +/*! +@brief a template for a reverse iterator class + +@tparam Base the base iterator type to reverse. Valid types are @ref +iterator (to create @ref reverse_iterator) and @ref const_iterator (to +create @ref const_reverse_iterator). + +@requirement The class satisfies the following concept requirements: +- +[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator): + The iterator that can be moved can be moved in both directions (i.e. + incremented and decremented). +- [OutputIterator](https://en.cppreference.com/w/cpp/named_req/OutputIterator): + It is possible to write to the pointed-to element (only if @a Base is + @ref iterator). + +@since version 1.0.0 +*/ +template +class json_reverse_iterator : public std::reverse_iterator +{ + public: + using difference_type = std::ptrdiff_t; + /// shortcut to the reverse iterator adapter + using base_iterator = std::reverse_iterator; + /// the reference type for the pointed-to element + using reference = typename Base::reference; + + /// create reverse iterator from iterator + explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept + : base_iterator(it) {} + + /// create reverse iterator from base class + explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {} + + /// post-increment (it++) + json_reverse_iterator const operator++(int) + { + return static_cast(base_iterator::operator++(1)); + } + + /// pre-increment (++it) + json_reverse_iterator& operator++() + { + return static_cast(base_iterator::operator++()); + } + + /// post-decrement (it--) + json_reverse_iterator const operator--(int) + { + return static_cast(base_iterator::operator--(1)); + } + + /// pre-decrement (--it) + json_reverse_iterator& operator--() + { + return static_cast(base_iterator::operator--()); + } + + /// add to iterator + json_reverse_iterator& operator+=(difference_type i) + { + return static_cast(base_iterator::operator+=(i)); + } + + /// add to iterator + json_reverse_iterator operator+(difference_type i) const + { + return static_cast(base_iterator::operator+(i)); + } + + /// subtract from iterator + json_reverse_iterator operator-(difference_type i) const + { + return static_cast(base_iterator::operator-(i)); + } + + /// return difference + difference_type operator-(const json_reverse_iterator& other) const + { + return base_iterator(*this) - base_iterator(other); + } + + /// access to successor + reference operator[](difference_type n) const + { + return *(this->operator+(n)); + } + + /// return the key of an object iterator + auto key() const -> decltype(std::declval().key()) + { + auto it = --this->base(); + return it.key(); + } + + /// return the value of an iterator + reference value() const + { + auto it = --this->base(); + return it.operator * (); + } +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + + +#include // all_of +#include // isdigit +#include // max +#include // accumulate +#include // string +#include // move +#include // vector + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +template +class json_pointer +{ + // allow basic_json to access private members + NLOHMANN_BASIC_JSON_TPL_DECLARATION + friend class basic_json; + + public: + /*! + @brief create JSON pointer + + Create a JSON pointer according to the syntax described in + [Section 3 of RFC6901](https://tools.ietf.org/html/rfc6901#section-3). + + @param[in] s string representing the JSON pointer; if omitted, the empty + string is assumed which references the whole JSON value + + @throw parse_error.107 if the given JSON pointer @a s is nonempty and does + not begin with a slash (`/`); see example below + + @throw parse_error.108 if a tilde (`~`) in the given JSON pointer @a s is + not followed by `0` (representing `~`) or `1` (representing `/`); see + example below + + @liveexample{The example shows the construction several valid JSON pointers + as well as the exceptional behavior.,json_pointer} + + @since version 2.0.0 + */ + explicit json_pointer(const std::string& s = "") + : reference_tokens(split(s)) + {} + + /*! + @brief return a string representation of the JSON pointer + + @invariant For each JSON pointer `ptr`, it holds: + @code {.cpp} + ptr == json_pointer(ptr.to_string()); + @endcode + + @return a string representation of the JSON pointer + + @liveexample{The example shows the result of `to_string`.,json_pointer__to_string} + + @since version 2.0.0 + */ + std::string to_string() const + { + return std::accumulate(reference_tokens.begin(), reference_tokens.end(), + std::string{}, + [](const std::string & a, const std::string & b) + { + return a + "/" + escape(b); + }); + } + + /// @copydoc to_string() + operator std::string() const + { + return to_string(); + } + + /*! + @brief append another JSON pointer at the end of this JSON pointer + + @param[in] ptr JSON pointer to append + @return JSON pointer with @a ptr appended + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::string) to append a reference token + @sa @ref operator/=(std::size_t) to append an array index + @sa @ref operator/(const json_pointer&, const json_pointer&) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(const json_pointer& ptr) + { + reference_tokens.insert(reference_tokens.end(), + ptr.reference_tokens.begin(), + ptr.reference_tokens.end()); + return *this; + } + + /*! + @brief append an unescaped reference token at the end of this JSON pointer + + @param[in] token reference token to append + @return JSON pointer with @a token appended without escaping @a token + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Amortized constant. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + @sa @ref operator/=(std::size_t) to append an array index + @sa @ref operator/(const json_pointer&, std::size_t) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(std::string token) + { + push_back(std::move(token)); + return *this; + } + + /*! + @brief append an array index at the end of this JSON pointer + + @param[in] array_idx array index to append + @return JSON pointer with @a array_idx appended + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Amortized constant. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + @sa @ref operator/=(std::string) to append a reference token + @sa @ref operator/(const json_pointer&, std::string) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(std::size_t array_idx) + { + return *this /= std::to_string(array_idx); + } + + /*! + @brief create a new JSON pointer by appending the right JSON pointer at the end of the left JSON pointer + + @param[in] lhs JSON pointer + @param[in] rhs JSON pointer + @return a new JSON pointer with @a rhs appended to @a lhs + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a lhs and @a rhs. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& lhs, + const json_pointer& rhs) + { + return json_pointer(lhs) /= rhs; + } + + /*! + @brief create a new JSON pointer by appending the unescaped token at the end of the JSON pointer + + @param[in] ptr JSON pointer + @param[in] token reference token + @return a new JSON pointer with unescaped @a token appended to @a ptr + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::string) to append a reference token + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& ptr, std::string token) + { + return json_pointer(ptr) /= std::move(token); + } + + /*! + @brief create a new JSON pointer by appending the array-index-token at the end of the JSON pointer + + @param[in] ptr JSON pointer + @param[in] array_idx array index + @return a new JSON pointer with @a array_idx appended to @a ptr + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::size_t) to append an array index + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& ptr, std::size_t array_idx) + { + return json_pointer(ptr) /= array_idx; + } + + /*! + @brief returns the parent of this JSON pointer + + @return parent of this JSON pointer; in case this JSON pointer is the root, + the root itself is returned + + @complexity Linear in the length of the JSON pointer. + + @liveexample{The example shows the result of `parent_pointer` for different + JSON Pointers.,json_pointer__parent_pointer} + + @since version 3.6.0 + */ + json_pointer parent_pointer() const + { + if (empty()) + { + return *this; + } + + json_pointer res = *this; + res.pop_back(); + return res; + } + + /*! + @brief remove last reference token + + @pre not `empty()` + + @liveexample{The example shows the usage of `pop_back`.,json_pointer__pop_back} + + @complexity Constant. + + @throw out_of_range.405 if JSON pointer has no parent + + @since version 3.6.0 + */ + void pop_back() + { + if (JSON_HEDLEY_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + reference_tokens.pop_back(); + } + + /*! + @brief return last reference token + + @pre not `empty()` + @return last reference token + + @liveexample{The example shows the usage of `back`.,json_pointer__back} + + @complexity Constant. + + @throw out_of_range.405 if JSON pointer has no parent + + @since version 3.6.0 + */ + const std::string& back() const + { + if (JSON_HEDLEY_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + return reference_tokens.back(); + } + + /*! + @brief append an unescaped token at the end of the reference pointer + + @param[in] token token to add + + @complexity Amortized constant. + + @liveexample{The example shows the result of `push_back` for different + JSON Pointers.,json_pointer__push_back} + + @since version 3.6.0 + */ + void push_back(const std::string& token) + { + reference_tokens.push_back(token); + } + + /// @copydoc push_back(const std::string&) + void push_back(std::string&& token) + { + reference_tokens.push_back(std::move(token)); + } + + /*! + @brief return whether pointer points to the root document + + @return true iff the JSON pointer points to the root document + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example shows the result of `empty` for different JSON + Pointers.,json_pointer__empty} + + @since version 3.6.0 + */ + bool empty() const noexcept + { + return reference_tokens.empty(); + } + + private: + /*! + @param[in] s reference token to be converted into an array index + + @return integer representation of @a s + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index begins not with a digit + @throw out_of_range.404 if string @a s could not be converted to an integer + @throw out_of_range.410 if an array index exceeds size_type + */ + static typename BasicJsonType::size_type array_index(const std::string& s) + { + using size_type = typename BasicJsonType::size_type; + + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && s[0] == '0')) + { + JSON_THROW(detail::parse_error::create(106, 0, + "array index '" + s + + "' must not begin with '0'")); + } + + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && !(s[0] >= '1' && s[0] <= '9'))) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + s + "' is not a number")); + } + + std::size_t processed_chars = 0; + unsigned long long res = 0; + JSON_TRY + { + res = std::stoull(s, &processed_chars); + } + JSON_CATCH(std::out_of_range&) + { + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + s + "'")); + } + + // check if the string was completely read + if (JSON_HEDLEY_UNLIKELY(processed_chars != s.size())) + { + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + s + "'")); + } + + // only triggered on special platforms (like 32bit), see also + // https://github.com/nlohmann/json/pull/2203 + if (res >= static_cast((std::numeric_limits::max)())) + { + JSON_THROW(detail::out_of_range::create(410, "array index " + s + " exceeds size_type")); // LCOV_EXCL_LINE + } + + return static_cast(res); + } + + json_pointer top() const + { + if (JSON_HEDLEY_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + json_pointer result = *this; + result.reference_tokens = {reference_tokens[0]}; + return result; + } + + /*! + @brief create and return a reference to the pointed to value + + @complexity Linear in the number of reference tokens. + + @throw parse_error.109 if array index is not a number + @throw type_error.313 if value cannot be unflattened + */ + BasicJsonType& get_and_create(BasicJsonType& j) const + { + auto result = &j; + + // in case no reference tokens exist, return a reference to the JSON value + // j which will be overwritten by a primitive value + for (const auto& reference_token : reference_tokens) + { + switch (result->type()) + { + case detail::value_t::null: + { + if (reference_token == "0") + { + // start a new array if reference token is 0 + result = &result->operator[](0); + } + else + { + // start a new object otherwise + result = &result->operator[](reference_token); + } + break; + } + + case detail::value_t::object: + { + // create an entry in the object + result = &result->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + // create an entry in the array + result = &result->operator[](array_index(reference_token)); + break; + } + + /* + The following code is only reached if there exists a reference + token _and_ the current value is primitive. In this case, we have + an error situation, because primitive values may only occur as + single value; that is, with an empty list of reference tokens. + */ + default: + JSON_THROW(detail::type_error::create(313, "invalid value to unflatten")); + } + } + + return *result; + } + + /*! + @brief return a reference to the pointed to value + + @note This version does not throw if a value is not present, but tries to + create nested values instead. For instance, calling this function + with pointer `"/this/that"` on a null value is equivalent to calling + `operator[]("this").operator[]("that")` on that value, effectively + changing the null value to an object. + + @param[in] ptr a JSON value + + @return reference to the JSON value pointed to by the JSON pointer + + @complexity Linear in the length of the JSON pointer. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + BasicJsonType& get_unchecked(BasicJsonType* ptr) const + { + for (const auto& reference_token : reference_tokens) + { + // convert null values to arrays or objects before continuing + if (ptr->is_null()) + { + // check if reference token is a number + const bool nums = + std::all_of(reference_token.begin(), reference_token.end(), + [](const unsigned char x) + { + return std::isdigit(x); + }); + + // change value to array for numbers or "-" or to object otherwise + *ptr = (nums || reference_token == "-") + ? detail::value_t::array + : detail::value_t::object; + } + + switch (ptr->type()) + { + case detail::value_t::object: + { + // use unchecked object access + ptr = &ptr->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + if (reference_token == "-") + { + // explicitly treat "-" as index beyond the end + ptr = &ptr->operator[](ptr->m_value.array->size()); + } + else + { + // convert array index to number; unchecked access + ptr = &ptr->operator[](array_index(reference_token)); + } + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + BasicJsonType& get_checked(BasicJsonType* ptr) const + { + for (const auto& reference_token : reference_tokens) + { + switch (ptr->type()) + { + case detail::value_t::object: + { + // note: at performs range check + ptr = &ptr->at(reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_HEDLEY_UNLIKELY(reference_token == "-")) + { + // "-" always fails the range check + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // note: at performs range check + ptr = &ptr->at(array_index(reference_token)); + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @brief return a const reference to the pointed to value + + @param[in] ptr a JSON value + + @return const reference to the JSON value pointed to by the JSON + pointer + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + const BasicJsonType& get_unchecked(const BasicJsonType* ptr) const + { + for (const auto& reference_token : reference_tokens) + { + switch (ptr->type()) + { + case detail::value_t::object: + { + // use unchecked object access + ptr = &ptr->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_HEDLEY_UNLIKELY(reference_token == "-")) + { + // "-" cannot be used for const access + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // use unchecked array access + ptr = &ptr->operator[](array_index(reference_token)); + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + const BasicJsonType& get_checked(const BasicJsonType* ptr) const + { + for (const auto& reference_token : reference_tokens) + { + switch (ptr->type()) + { + case detail::value_t::object: + { + // note: at performs range check + ptr = &ptr->at(reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_HEDLEY_UNLIKELY(reference_token == "-")) + { + // "-" always fails the range check + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // note: at performs range check + ptr = &ptr->at(array_index(reference_token)); + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + */ + bool contains(const BasicJsonType* ptr) const + { + for (const auto& reference_token : reference_tokens) + { + switch (ptr->type()) + { + case detail::value_t::object: + { + if (!ptr->contains(reference_token)) + { + // we did not find the key in the object + return false; + } + + ptr = &ptr->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_HEDLEY_UNLIKELY(reference_token == "-")) + { + // "-" always fails the range check + return false; + } + if (JSON_HEDLEY_UNLIKELY(reference_token.size() == 1 && !("0" <= reference_token && reference_token <= "9"))) + { + // invalid char + return false; + } + if (JSON_HEDLEY_UNLIKELY(reference_token.size() > 1)) + { + if (JSON_HEDLEY_UNLIKELY(!('1' <= reference_token[0] && reference_token[0] <= '9'))) + { + // first char should be between '1' and '9' + return false; + } + for (std::size_t i = 1; i < reference_token.size(); i++) + { + if (JSON_HEDLEY_UNLIKELY(!('0' <= reference_token[i] && reference_token[i] <= '9'))) + { + // other char should be between '0' and '9' + return false; + } + } + } + + const auto idx = array_index(reference_token); + if (idx >= ptr->size()) + { + // index out of range + return false; + } + + ptr = &ptr->operator[](idx); + break; + } + + default: + { + // we do not expect primitive values if there is still a + // reference token to process + return false; + } + } + } + + // no reference token left means we found a primitive value + return true; + } + + /*! + @brief split the string input to reference tokens + + @note This function is only called by the json_pointer constructor. + All exceptions below are documented there. + + @throw parse_error.107 if the pointer is not empty or begins with '/' + @throw parse_error.108 if character '~' is not followed by '0' or '1' + */ + static std::vector split(const std::string& reference_string) + { + std::vector result; + + // special case: empty reference string -> no reference tokens + if (reference_string.empty()) + { + return result; + } + + // check if nonempty reference string begins with slash + if (JSON_HEDLEY_UNLIKELY(reference_string[0] != '/')) + { + JSON_THROW(detail::parse_error::create(107, 1, + "JSON pointer must be empty or begin with '/' - was: '" + + reference_string + "'")); + } + + // extract the reference tokens: + // - slash: position of the last read slash (or end of string) + // - start: position after the previous slash + for ( + // search for the first slash after the first character + std::size_t slash = reference_string.find_first_of('/', 1), + // set the beginning of the first reference token + start = 1; + // we can stop if start == 0 (if slash == std::string::npos) + start != 0; + // set the beginning of the next reference token + // (will eventually be 0 if slash == std::string::npos) + start = (slash == std::string::npos) ? 0 : slash + 1, + // find next slash + slash = reference_string.find_first_of('/', start)) + { + // use the text between the beginning of the reference token + // (start) and the last slash (slash). + auto reference_token = reference_string.substr(start, slash - start); + + // check reference tokens are properly escaped + for (std::size_t pos = reference_token.find_first_of('~'); + pos != std::string::npos; + pos = reference_token.find_first_of('~', pos + 1)) + { + JSON_ASSERT(reference_token[pos] == '~'); + + // ~ must be followed by 0 or 1 + if (JSON_HEDLEY_UNLIKELY(pos == reference_token.size() - 1 || + (reference_token[pos + 1] != '0' && + reference_token[pos + 1] != '1'))) + { + JSON_THROW(detail::parse_error::create(108, 0, "escape character '~' must be followed with '0' or '1'")); + } + } + + // finally, store the reference token + unescape(reference_token); + result.push_back(reference_token); + } + + return result; + } + + /*! + @brief replace all occurrences of a substring by another string + + @param[in,out] s the string to manipulate; changed so that all + occurrences of @a f are replaced with @a t + @param[in] f the substring to replace with @a t + @param[in] t the string to replace @a f + + @pre The search string @a f must not be empty. **This precondition is + enforced with an assertion.** + + @since version 2.0.0 + */ + static void replace_substring(std::string& s, const std::string& f, + const std::string& t) + { + JSON_ASSERT(!f.empty()); + for (auto pos = s.find(f); // find first occurrence of f + pos != std::string::npos; // make sure f was found + s.replace(pos, f.size(), t), // replace with t, and + pos = s.find(f, pos + t.size())) // find next occurrence of f + {} + } + + /// escape "~" to "~0" and "/" to "~1" + static std::string escape(std::string s) + { + replace_substring(s, "~", "~0"); + replace_substring(s, "/", "~1"); + return s; + } + + /// unescape "~1" to tilde and "~0" to slash (order is important!) + static void unescape(std::string& s) + { + replace_substring(s, "~1", "/"); + replace_substring(s, "~0", "~"); + } + + /*! + @param[in] reference_string the reference string to the current value + @param[in] value the value to consider + @param[in,out] result the result object to insert values to + + @note Empty objects or arrays are flattened to `null`. + */ + static void flatten(const std::string& reference_string, + const BasicJsonType& value, + BasicJsonType& result) + { + switch (value.type()) + { + case detail::value_t::array: + { + if (value.m_value.array->empty()) + { + // flatten empty array as null + result[reference_string] = nullptr; + } + else + { + // iterate array and use index as reference string + for (std::size_t i = 0; i < value.m_value.array->size(); ++i) + { + flatten(reference_string + "/" + std::to_string(i), + value.m_value.array->operator[](i), result); + } + } + break; + } + + case detail::value_t::object: + { + if (value.m_value.object->empty()) + { + // flatten empty object as null + result[reference_string] = nullptr; + } + else + { + // iterate object and use keys as reference string + for (const auto& element : *value.m_value.object) + { + flatten(reference_string + "/" + escape(element.first), element.second, result); + } + } + break; + } + + default: + { + // add primitive value with its reference string + result[reference_string] = value; + break; + } + } + } + + /*! + @param[in] value flattened JSON + + @return unflattened JSON + + @throw parse_error.109 if array index is not a number + @throw type_error.314 if value is not an object + @throw type_error.315 if object values are not primitive + @throw type_error.313 if value cannot be unflattened + */ + static BasicJsonType + unflatten(const BasicJsonType& value) + { + if (JSON_HEDLEY_UNLIKELY(!value.is_object())) + { + JSON_THROW(detail::type_error::create(314, "only objects can be unflattened")); + } + + BasicJsonType result; + + // iterate the JSON object values + for (const auto& element : *value.m_value.object) + { + if (JSON_HEDLEY_UNLIKELY(!element.second.is_primitive())) + { + JSON_THROW(detail::type_error::create(315, "values in object must be primitive")); + } + + // assign value to reference pointed to by JSON pointer; Note that if + // the JSON pointer is "" (i.e., points to the whole value), function + // get_and_create returns a reference to result itself. An assignment + // will then create a primitive value. + json_pointer(element.first).get_and_create(result) = element.second; + } + + return result; + } + + /*! + @brief compares two JSON pointers for equality + + @param[in] lhs JSON pointer to compare + @param[in] rhs JSON pointer to compare + @return whether @a lhs is equal to @a rhs + + @complexity Linear in the length of the JSON pointer + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + */ + friend bool operator==(json_pointer const& lhs, + json_pointer const& rhs) noexcept + { + return lhs.reference_tokens == rhs.reference_tokens; + } + + /*! + @brief compares two JSON pointers for inequality + + @param[in] lhs JSON pointer to compare + @param[in] rhs JSON pointer to compare + @return whether @a lhs is not equal @a rhs + + @complexity Linear in the length of the JSON pointer + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + */ + friend bool operator!=(json_pointer const& lhs, + json_pointer const& rhs) noexcept + { + return !(lhs == rhs); + } + + /// the reference tokens + std::vector reference_tokens; +}; +} // namespace nlohmann + +// #include + + +#include +#include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +template +class json_ref +{ + public: + using value_type = BasicJsonType; + + json_ref(value_type&& value) + : owned_value(std::move(value)) + , value_ref(&owned_value) + , is_rvalue(true) + {} + + json_ref(const value_type& value) + : value_ref(const_cast(&value)) + , is_rvalue(false) + {} + + json_ref(std::initializer_list init) + : owned_value(init) + , value_ref(&owned_value) + , is_rvalue(true) + {} + + template < + class... Args, + enable_if_t::value, int> = 0 > + json_ref(Args && ... args) + : owned_value(std::forward(args)...) + , value_ref(&owned_value) + , is_rvalue(true) + {} + + // class should be movable only + json_ref(json_ref&&) = default; + json_ref(const json_ref&) = delete; + json_ref& operator=(const json_ref&) = delete; + json_ref& operator=(json_ref&&) = delete; + ~json_ref() = default; + + value_type moved_or_copied() const + { + if (is_rvalue) + { + return std::move(*value_ref); + } + return *value_ref; + } + + value_type const& operator*() const + { + return *static_cast(value_ref); + } + + value_type const* operator->() const + { + return static_cast(value_ref); + } + + private: + mutable value_type owned_value = nullptr; + value_type* value_ref = nullptr; + const bool is_rvalue = true; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + +// #include + +// #include + + +#include // reverse +#include // array +#include // uint8_t, uint16_t, uint32_t, uint64_t +#include // memcpy +#include // numeric_limits +#include // string +#include // isnan, isinf + +// #include + +// #include + +// #include + + +#include // copy +#include // size_t +#include // streamsize +#include // back_inserter +#include // shared_ptr, make_shared +#include // basic_ostream +#include // basic_string +#include // vector +// #include + + +namespace nlohmann +{ +namespace detail +{ +/// abstract output adapter interface +template struct output_adapter_protocol +{ + virtual void write_character(CharType c) = 0; + virtual void write_characters(const CharType* s, std::size_t length) = 0; + virtual ~output_adapter_protocol() = default; +}; + +/// a type to simplify interfaces +template +using output_adapter_t = std::shared_ptr>; + +/// output adapter for byte vectors +template +class output_vector_adapter : public output_adapter_protocol +{ + public: + explicit output_vector_adapter(std::vector& vec) noexcept + : v(vec) + {} + + void write_character(CharType c) override + { + v.push_back(c); + } + + JSON_HEDLEY_NON_NULL(2) + void write_characters(const CharType* s, std::size_t length) override + { + std::copy(s, s + length, std::back_inserter(v)); + } + + private: + std::vector& v; +}; + +/// output adapter for output streams +template +class output_stream_adapter : public output_adapter_protocol +{ + public: + explicit output_stream_adapter(std::basic_ostream& s) noexcept + : stream(s) + {} + + void write_character(CharType c) override + { + stream.put(c); + } + + JSON_HEDLEY_NON_NULL(2) + void write_characters(const CharType* s, std::size_t length) override + { + stream.write(s, static_cast(length)); + } + + private: + std::basic_ostream& stream; +}; + +/// output adapter for basic_string +template> +class output_string_adapter : public output_adapter_protocol +{ + public: + explicit output_string_adapter(StringType& s) noexcept + : str(s) + {} + + void write_character(CharType c) override + { + str.push_back(c); + } + + JSON_HEDLEY_NON_NULL(2) + void write_characters(const CharType* s, std::size_t length) override + { + str.append(s, length); + } + + private: + StringType& str; +}; + +template> +class output_adapter +{ + public: + output_adapter(std::vector& vec) + : oa(std::make_shared>(vec)) {} + + output_adapter(std::basic_ostream& s) + : oa(std::make_shared>(s)) {} + + output_adapter(StringType& s) + : oa(std::make_shared>(s)) {} + + operator output_adapter_t() + { + return oa; + } + + private: + output_adapter_t oa = nullptr; +}; +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +/////////////////// +// binary writer // +/////////////////// + +/*! +@brief serialization to CBOR and MessagePack values +*/ +template +class binary_writer +{ + using string_t = typename BasicJsonType::string_t; + using binary_t = typename BasicJsonType::binary_t; + using number_float_t = typename BasicJsonType::number_float_t; + + public: + /*! + @brief create a binary writer + + @param[in] adapter output adapter to write to + */ + explicit binary_writer(output_adapter_t adapter) : oa(adapter) + { + JSON_ASSERT(oa); + } + + /*! + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + void write_bson(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::object: + { + write_bson_object(*j.m_value.object); + break; + } + + default: + { + JSON_THROW(type_error::create(317, "to serialize to BSON, top-level type must be object, but is " + std::string(j.type_name()))); + } + } + } + + /*! + @param[in] j JSON value to serialize + */ + void write_cbor(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::null: + { + oa->write_character(to_char_type(0xF6)); + break; + } + + case value_t::boolean: + { + oa->write_character(j.m_value.boolean + ? to_char_type(0xF5) + : to_char_type(0xF4)); + break; + } + + case value_t::number_integer: + { + if (j.m_value.number_integer >= 0) + { + // CBOR does not differentiate between positive signed + // integers and unsigned integers. Therefore, we used the + // code from the value_t::number_unsigned case here. + if (j.m_value.number_integer <= 0x17) + { + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x18)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x19)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x1A)); + write_number(static_cast(j.m_value.number_integer)); + } + else + { + oa->write_character(to_char_type(0x1B)); + write_number(static_cast(j.m_value.number_integer)); + } + } + else + { + // The conversions below encode the sign in the first + // byte, and the value is converted to a positive number. + const auto positive_number = -1 - j.m_value.number_integer; + if (j.m_value.number_integer >= -24) + { + write_number(static_cast(0x20 + positive_number)); + } + else if (positive_number <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x38)); + write_number(static_cast(positive_number)); + } + else if (positive_number <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x39)); + write_number(static_cast(positive_number)); + } + else if (positive_number <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x3A)); + write_number(static_cast(positive_number)); + } + else + { + oa->write_character(to_char_type(0x3B)); + write_number(static_cast(positive_number)); + } + } + break; + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned <= 0x17) + { + write_number(static_cast(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x18)); + write_number(static_cast(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x19)); + write_number(static_cast(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x1A)); + write_number(static_cast(j.m_value.number_unsigned)); + } + else + { + oa->write_character(to_char_type(0x1B)); + write_number(static_cast(j.m_value.number_unsigned)); + } + break; + } + + case value_t::number_float: + { + if (std::isnan(j.m_value.number_float)) + { + // NaN is 0xf97e00 in CBOR + oa->write_character(to_char_type(0xF9)); + oa->write_character(to_char_type(0x7E)); + oa->write_character(to_char_type(0x00)); + } + else if (std::isinf(j.m_value.number_float)) + { + // Infinity is 0xf97c00, -Infinity is 0xf9fc00 + oa->write_character(to_char_type(0xf9)); + oa->write_character(j.m_value.number_float > 0 ? to_char_type(0x7C) : to_char_type(0xFC)); + oa->write_character(to_char_type(0x00)); + } + else + { + write_compact_float(j.m_value.number_float, detail::input_format_t::cbor); + } + break; + } + + case value_t::string: + { + // step 1: write control byte and the string length + const auto N = j.m_value.string->size(); + if (N <= 0x17) + { + write_number(static_cast(0x60 + N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x78)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x79)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x7A)); + write_number(static_cast(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x7B)); + write_number(static_cast(N)); + } + // LCOV_EXCL_STOP + + // step 2: write the string + oa->write_characters( + reinterpret_cast(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + // step 1: write control byte and the array size + const auto N = j.m_value.array->size(); + if (N <= 0x17) + { + write_number(static_cast(0x80 + N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x98)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x99)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x9A)); + write_number(static_cast(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x9B)); + write_number(static_cast(N)); + } + // LCOV_EXCL_STOP + + // step 2: write each element + for (const auto& el : *j.m_value.array) + { + write_cbor(el); + } + break; + } + + case value_t::binary: + { + if (j.m_value.binary->has_subtype()) + { + write_number(static_cast(0xd8)); + write_number(j.m_value.binary->subtype()); + } + + // step 1: write control byte and the binary array size + const auto N = j.m_value.binary->size(); + if (N <= 0x17) + { + write_number(static_cast(0x40 + N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x58)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x59)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x5A)); + write_number(static_cast(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0x5B)); + write_number(static_cast(N)); + } + // LCOV_EXCL_STOP + + // step 2: write each element + oa->write_characters( + reinterpret_cast(j.m_value.binary->data()), + N); + + break; + } + + case value_t::object: + { + // step 1: write control byte and the object size + const auto N = j.m_value.object->size(); + if (N <= 0x17) + { + write_number(static_cast(0xA0 + N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0xB8)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0xB9)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0xBA)); + write_number(static_cast(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits::max)()) + { + oa->write_character(to_char_type(0xBB)); + write_number(static_cast(N)); + } + // LCOV_EXCL_STOP + + // step 2: write each element + for (const auto& el : *j.m_value.object) + { + write_cbor(el.first); + write_cbor(el.second); + } + break; + } + + default: + break; + } + } + + /*! + @param[in] j JSON value to serialize + */ + void write_msgpack(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::null: // nil + { + oa->write_character(to_char_type(0xC0)); + break; + } + + case value_t::boolean: // true and false + { + oa->write_character(j.m_value.boolean + ? to_char_type(0xC3) + : to_char_type(0xC2)); + break; + } + + case value_t::number_integer: + { + if (j.m_value.number_integer >= 0) + { + // MessagePack does not differentiate between positive + // signed integers and unsigned integers. Therefore, we used + // the code from the value_t::number_unsigned case here. + if (j.m_value.number_unsigned < 128) + { + // positive fixnum + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 8 + oa->write_character(to_char_type(0xCC)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 16 + oa->write_character(to_char_type(0xCD)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 32 + oa->write_character(to_char_type(0xCE)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 64 + oa->write_character(to_char_type(0xCF)); + write_number(static_cast(j.m_value.number_integer)); + } + } + else + { + if (j.m_value.number_integer >= -32) + { + // negative fixnum + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits::min)() && + j.m_value.number_integer <= (std::numeric_limits::max)()) + { + // int 8 + oa->write_character(to_char_type(0xD0)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits::min)() && + j.m_value.number_integer <= (std::numeric_limits::max)()) + { + // int 16 + oa->write_character(to_char_type(0xD1)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits::min)() && + j.m_value.number_integer <= (std::numeric_limits::max)()) + { + // int 32 + oa->write_character(to_char_type(0xD2)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits::min)() && + j.m_value.number_integer <= (std::numeric_limits::max)()) + { + // int 64 + oa->write_character(to_char_type(0xD3)); + write_number(static_cast(j.m_value.number_integer)); + } + } + break; + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned < 128) + { + // positive fixnum + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 8 + oa->write_character(to_char_type(0xCC)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 16 + oa->write_character(to_char_type(0xCD)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 32 + oa->write_character(to_char_type(0xCE)); + write_number(static_cast(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits::max)()) + { + // uint 64 + oa->write_character(to_char_type(0xCF)); + write_number(static_cast(j.m_value.number_integer)); + } + break; + } + + case value_t::number_float: + { + write_compact_float(j.m_value.number_float, detail::input_format_t::msgpack); + break; + } + + case value_t::string: + { + // step 1: write control byte and the string length + const auto N = j.m_value.string->size(); + if (N <= 31) + { + // fixstr + write_number(static_cast(0xA0 | N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // str 8 + oa->write_character(to_char_type(0xD9)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // str 16 + oa->write_character(to_char_type(0xDA)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // str 32 + oa->write_character(to_char_type(0xDB)); + write_number(static_cast(N)); + } + + // step 2: write the string + oa->write_characters( + reinterpret_cast(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + // step 1: write control byte and the array size + const auto N = j.m_value.array->size(); + if (N <= 15) + { + // fixarray + write_number(static_cast(0x90 | N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // array 16 + oa->write_character(to_char_type(0xDC)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // array 32 + oa->write_character(to_char_type(0xDD)); + write_number(static_cast(N)); + } + + // step 2: write each element + for (const auto& el : *j.m_value.array) + { + write_msgpack(el); + } + break; + } + + case value_t::binary: + { + // step 0: determine if the binary type has a set subtype to + // determine whether or not to use the ext or fixext types + const bool use_ext = j.m_value.binary->has_subtype(); + + // step 1: write control byte and the byte string length + const auto N = j.m_value.binary->size(); + if (N <= (std::numeric_limits::max)()) + { + std::uint8_t output_type{}; + bool fixed = true; + if (use_ext) + { + switch (N) + { + case 1: + output_type = 0xD4; // fixext 1 + break; + case 2: + output_type = 0xD5; // fixext 2 + break; + case 4: + output_type = 0xD6; // fixext 4 + break; + case 8: + output_type = 0xD7; // fixext 8 + break; + case 16: + output_type = 0xD8; // fixext 16 + break; + default: + output_type = 0xC7; // ext 8 + fixed = false; + break; + } + + } + else + { + output_type = 0xC4; // bin 8 + fixed = false; + } + + oa->write_character(to_char_type(output_type)); + if (!fixed) + { + write_number(static_cast(N)); + } + } + else if (N <= (std::numeric_limits::max)()) + { + std::uint8_t output_type = use_ext + ? 0xC8 // ext 16 + : 0xC5; // bin 16 + + oa->write_character(to_char_type(output_type)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + std::uint8_t output_type = use_ext + ? 0xC9 // ext 32 + : 0xC6; // bin 32 + + oa->write_character(to_char_type(output_type)); + write_number(static_cast(N)); + } + + // step 1.5: if this is an ext type, write the subtype + if (use_ext) + { + write_number(static_cast(j.m_value.binary->subtype())); + } + + // step 2: write the byte string + oa->write_characters( + reinterpret_cast(j.m_value.binary->data()), + N); + + break; + } + + case value_t::object: + { + // step 1: write control byte and the object size + const auto N = j.m_value.object->size(); + if (N <= 15) + { + // fixmap + write_number(static_cast(0x80 | (N & 0xF))); + } + else if (N <= (std::numeric_limits::max)()) + { + // map 16 + oa->write_character(to_char_type(0xDE)); + write_number(static_cast(N)); + } + else if (N <= (std::numeric_limits::max)()) + { + // map 32 + oa->write_character(to_char_type(0xDF)); + write_number(static_cast(N)); + } + + // step 2: write each element + for (const auto& el : *j.m_value.object) + { + write_msgpack(el.first); + write_msgpack(el.second); + } + break; + } + + default: + break; + } + } + + /*! + @param[in] j JSON value to serialize + @param[in] use_count whether to use '#' prefixes (optimized format) + @param[in] use_type whether to use '$' prefixes (optimized format) + @param[in] add_prefix whether prefixes need to be used for this value + */ + void write_ubjson(const BasicJsonType& j, const bool use_count, + const bool use_type, const bool add_prefix = true) + { + switch (j.type()) + { + case value_t::null: + { + if (add_prefix) + { + oa->write_character(to_char_type('Z')); + } + break; + } + + case value_t::boolean: + { + if (add_prefix) + { + oa->write_character(j.m_value.boolean + ? to_char_type('T') + : to_char_type('F')); + } + break; + } + + case value_t::number_integer: + { + write_number_with_ubjson_prefix(j.m_value.number_integer, add_prefix); + break; + } + + case value_t::number_unsigned: + { + write_number_with_ubjson_prefix(j.m_value.number_unsigned, add_prefix); + break; + } + + case value_t::number_float: + { + write_number_with_ubjson_prefix(j.m_value.number_float, add_prefix); + break; + } + + case value_t::string: + { + if (add_prefix) + { + oa->write_character(to_char_type('S')); + } + write_number_with_ubjson_prefix(j.m_value.string->size(), true); + oa->write_characters( + reinterpret_cast(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + if (add_prefix) + { + oa->write_character(to_char_type('[')); + } + + bool prefix_required = true; + if (use_type && !j.m_value.array->empty()) + { + JSON_ASSERT(use_count); + const CharType first_prefix = ubjson_prefix(j.front()); + const bool same_prefix = std::all_of(j.begin() + 1, j.end(), + [this, first_prefix](const BasicJsonType & v) + { + return ubjson_prefix(v) == first_prefix; + }); + + if (same_prefix) + { + prefix_required = false; + oa->write_character(to_char_type('$')); + oa->write_character(first_prefix); + } + } + + if (use_count) + { + oa->write_character(to_char_type('#')); + write_number_with_ubjson_prefix(j.m_value.array->size(), true); + } + + for (const auto& el : *j.m_value.array) + { + write_ubjson(el, use_count, use_type, prefix_required); + } + + if (!use_count) + { + oa->write_character(to_char_type(']')); + } + + break; + } + + case value_t::binary: + { + if (add_prefix) + { + oa->write_character(to_char_type('[')); + } + + if (use_type && !j.m_value.binary->empty()) + { + JSON_ASSERT(use_count); + oa->write_character(to_char_type('$')); + oa->write_character('U'); + } + + if (use_count) + { + oa->write_character(to_char_type('#')); + write_number_with_ubjson_prefix(j.m_value.binary->size(), true); + } + + if (use_type) + { + oa->write_characters( + reinterpret_cast(j.m_value.binary->data()), + j.m_value.binary->size()); + } + else + { + for (size_t i = 0; i < j.m_value.binary->size(); ++i) + { + oa->write_character(to_char_type('U')); + oa->write_character(j.m_value.binary->data()[i]); + } + } + + if (!use_count) + { + oa->write_character(to_char_type(']')); + } + + break; + } + + case value_t::object: + { + if (add_prefix) + { + oa->write_character(to_char_type('{')); + } + + bool prefix_required = true; + if (use_type && !j.m_value.object->empty()) + { + JSON_ASSERT(use_count); + const CharType first_prefix = ubjson_prefix(j.front()); + const bool same_prefix = std::all_of(j.begin(), j.end(), + [this, first_prefix](const BasicJsonType & v) + { + return ubjson_prefix(v) == first_prefix; + }); + + if (same_prefix) + { + prefix_required = false; + oa->write_character(to_char_type('$')); + oa->write_character(first_prefix); + } + } + + if (use_count) + { + oa->write_character(to_char_type('#')); + write_number_with_ubjson_prefix(j.m_value.object->size(), true); + } + + for (const auto& el : *j.m_value.object) + { + write_number_with_ubjson_prefix(el.first.size(), true); + oa->write_characters( + reinterpret_cast(el.first.c_str()), + el.first.size()); + write_ubjson(el.second, use_count, use_type, prefix_required); + } + + if (!use_count) + { + oa->write_character(to_char_type('}')); + } + + break; + } + + default: + break; + } + } + + private: + ////////// + // BSON // + ////////// + + /*! + @return The size of a BSON document entry header, including the id marker + and the entry name size (and its null-terminator). + */ + static std::size_t calc_bson_entry_header_size(const string_t& name) + { + const auto it = name.find(static_cast(0)); + if (JSON_HEDLEY_UNLIKELY(it != BasicJsonType::string_t::npos)) + { + JSON_THROW(out_of_range::create(409, + "BSON key cannot contain code point U+0000 (at byte " + std::to_string(it) + ")")); + } + + return /*id*/ 1ul + name.size() + /*zero-terminator*/1u; + } + + /*! + @brief Writes the given @a element_type and @a name to the output adapter + */ + void write_bson_entry_header(const string_t& name, + const std::uint8_t element_type) + { + oa->write_character(to_char_type(element_type)); // boolean + oa->write_characters( + reinterpret_cast(name.c_str()), + name.size() + 1u); + } + + /*! + @brief Writes a BSON element with key @a name and boolean value @a value + */ + void write_bson_boolean(const string_t& name, + const bool value) + { + write_bson_entry_header(name, 0x08); + oa->write_character(value ? to_char_type(0x01) : to_char_type(0x00)); + } + + /*! + @brief Writes a BSON element with key @a name and double value @a value + */ + void write_bson_double(const string_t& name, + const double value) + { + write_bson_entry_header(name, 0x01); + write_number(value); + } + + /*! + @return The size of the BSON-encoded string in @a value + */ + static std::size_t calc_bson_string_size(const string_t& value) + { + return sizeof(std::int32_t) + value.size() + 1ul; + } + + /*! + @brief Writes a BSON element with key @a name and string value @a value + */ + void write_bson_string(const string_t& name, + const string_t& value) + { + write_bson_entry_header(name, 0x02); + + write_number(static_cast(value.size() + 1ul)); + oa->write_characters( + reinterpret_cast(value.c_str()), + value.size() + 1); + } + + /*! + @brief Writes a BSON element with key @a name and null value + */ + void write_bson_null(const string_t& name) + { + write_bson_entry_header(name, 0x0A); + } + + /*! + @return The size of the BSON-encoded integer @a value + */ + static std::size_t calc_bson_integer_size(const std::int64_t value) + { + return (std::numeric_limits::min)() <= value && value <= (std::numeric_limits::max)() + ? sizeof(std::int32_t) + : sizeof(std::int64_t); + } + + /*! + @brief Writes a BSON element with key @a name and integer @a value + */ + void write_bson_integer(const string_t& name, + const std::int64_t value) + { + if ((std::numeric_limits::min)() <= value && value <= (std::numeric_limits::max)()) + { + write_bson_entry_header(name, 0x10); // int32 + write_number(static_cast(value)); + } + else + { + write_bson_entry_header(name, 0x12); // int64 + write_number(static_cast(value)); + } + } + + /*! + @return The size of the BSON-encoded unsigned integer in @a j + */ + static constexpr std::size_t calc_bson_unsigned_size(const std::uint64_t value) noexcept + { + return (value <= static_cast((std::numeric_limits::max)())) + ? sizeof(std::int32_t) + : sizeof(std::int64_t); + } + + /*! + @brief Writes a BSON element with key @a name and unsigned @a value + */ + void write_bson_unsigned(const string_t& name, + const std::uint64_t value) + { + if (value <= static_cast((std::numeric_limits::max)())) + { + write_bson_entry_header(name, 0x10 /* int32 */); + write_number(static_cast(value)); + } + else if (value <= static_cast((std::numeric_limits::max)())) + { + write_bson_entry_header(name, 0x12 /* int64 */); + write_number(static_cast(value)); + } + else + { + JSON_THROW(out_of_range::create(407, "integer number " + std::to_string(value) + " cannot be represented by BSON as it does not fit int64")); + } + } + + /*! + @brief Writes a BSON element with key @a name and object @a value + */ + void write_bson_object_entry(const string_t& name, + const typename BasicJsonType::object_t& value) + { + write_bson_entry_header(name, 0x03); // object + write_bson_object(value); + } + + /*! + @return The size of the BSON-encoded array @a value + */ + static std::size_t calc_bson_array_size(const typename BasicJsonType::array_t& value) + { + std::size_t array_index = 0ul; + + const std::size_t embedded_document_size = std::accumulate(std::begin(value), std::end(value), std::size_t(0), [&array_index](std::size_t result, const typename BasicJsonType::array_t::value_type & el) + { + return result + calc_bson_element_size(std::to_string(array_index++), el); + }); + + return sizeof(std::int32_t) + embedded_document_size + 1ul; + } + + /*! + @return The size of the BSON-encoded binary array @a value + */ + static std::size_t calc_bson_binary_size(const typename BasicJsonType::binary_t& value) + { + return sizeof(std::int32_t) + value.size() + 1ul; + } + + /*! + @brief Writes a BSON element with key @a name and array @a value + */ + void write_bson_array(const string_t& name, + const typename BasicJsonType::array_t& value) + { + write_bson_entry_header(name, 0x04); // array + write_number(static_cast(calc_bson_array_size(value))); + + std::size_t array_index = 0ul; + + for (const auto& el : value) + { + write_bson_element(std::to_string(array_index++), el); + } + + oa->write_character(to_char_type(0x00)); + } + + /*! + @brief Writes a BSON element with key @a name and binary value @a value + */ + void write_bson_binary(const string_t& name, + const binary_t& value) + { + write_bson_entry_header(name, 0x05); + + write_number(static_cast(value.size())); + write_number(value.has_subtype() ? value.subtype() : std::uint8_t(0x00)); + + oa->write_characters(reinterpret_cast(value.data()), value.size()); + } + + /*! + @brief Calculates the size necessary to serialize the JSON value @a j with its @a name + @return The calculated size for the BSON document entry for @a j with the given @a name. + */ + static std::size_t calc_bson_element_size(const string_t& name, + const BasicJsonType& j) + { + const auto header_size = calc_bson_entry_header_size(name); + switch (j.type()) + { + case value_t::object: + return header_size + calc_bson_object_size(*j.m_value.object); + + case value_t::array: + return header_size + calc_bson_array_size(*j.m_value.array); + + case value_t::binary: + return header_size + calc_bson_binary_size(*j.m_value.binary); + + case value_t::boolean: + return header_size + 1ul; + + case value_t::number_float: + return header_size + 8ul; + + case value_t::number_integer: + return header_size + calc_bson_integer_size(j.m_value.number_integer); + + case value_t::number_unsigned: + return header_size + calc_bson_unsigned_size(j.m_value.number_unsigned); + + case value_t::string: + return header_size + calc_bson_string_size(*j.m_value.string); + + case value_t::null: + return header_size + 0ul; + + // LCOV_EXCL_START + default: + JSON_ASSERT(false); + return 0ul; + // LCOV_EXCL_STOP + } + } + + /*! + @brief Serializes the JSON value @a j to BSON and associates it with the + key @a name. + @param name The name to associate with the JSON entity @a j within the + current BSON document + @return The size of the BSON entry + */ + void write_bson_element(const string_t& name, + const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::object: + return write_bson_object_entry(name, *j.m_value.object); + + case value_t::array: + return write_bson_array(name, *j.m_value.array); + + case value_t::binary: + return write_bson_binary(name, *j.m_value.binary); + + case value_t::boolean: + return write_bson_boolean(name, j.m_value.boolean); + + case value_t::number_float: + return write_bson_double(name, j.m_value.number_float); + + case value_t::number_integer: + return write_bson_integer(name, j.m_value.number_integer); + + case value_t::number_unsigned: + return write_bson_unsigned(name, j.m_value.number_unsigned); + + case value_t::string: + return write_bson_string(name, *j.m_value.string); + + case value_t::null: + return write_bson_null(name); + + // LCOV_EXCL_START + default: + JSON_ASSERT(false); + return; + // LCOV_EXCL_STOP + } + } + + /*! + @brief Calculates the size of the BSON serialization of the given + JSON-object @a j. + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + static std::size_t calc_bson_object_size(const typename BasicJsonType::object_t& value) + { + std::size_t document_size = std::accumulate(value.begin(), value.end(), std::size_t(0), + [](size_t result, const typename BasicJsonType::object_t::value_type & el) + { + return result += calc_bson_element_size(el.first, el.second); + }); + + return sizeof(std::int32_t) + document_size + 1ul; + } + + /*! + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + void write_bson_object(const typename BasicJsonType::object_t& value) + { + write_number(static_cast(calc_bson_object_size(value))); + + for (const auto& el : value) + { + write_bson_element(el.first, el.second); + } + + oa->write_character(to_char_type(0x00)); + } + + ////////// + // CBOR // + ////////// + + static constexpr CharType get_cbor_float_prefix(float /*unused*/) + { + return to_char_type(0xFA); // Single-Precision Float + } + + static constexpr CharType get_cbor_float_prefix(double /*unused*/) + { + return to_char_type(0xFB); // Double-Precision Float + } + + ///////////// + // MsgPack // + ///////////// + + static constexpr CharType get_msgpack_float_prefix(float /*unused*/) + { + return to_char_type(0xCA); // float 32 + } + + static constexpr CharType get_msgpack_float_prefix(double /*unused*/) + { + return to_char_type(0xCB); // float 64 + } + + //////////// + // UBJSON // + //////////// + + // UBJSON: write number (floating point) + template::value, int>::type = 0> + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if (add_prefix) + { + oa->write_character(get_ubjson_float_prefix(n)); + } + write_number(n); + } + + // UBJSON: write number (unsigned integer) + template::value, int>::type = 0> + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if (n <= static_cast((std::numeric_limits::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('i')); // int8 + } + write_number(static_cast(n)); + } + else if (n <= (std::numeric_limits::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('U')); // uint8 + } + write_number(static_cast(n)); + } + else if (n <= static_cast((std::numeric_limits::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('I')); // int16 + } + write_number(static_cast(n)); + } + else if (n <= static_cast((std::numeric_limits::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('l')); // int32 + } + write_number(static_cast(n)); + } + else if (n <= static_cast((std::numeric_limits::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('L')); // int64 + } + write_number(static_cast(n)); + } + else + { + if (add_prefix) + { + oa->write_character(to_char_type('H')); // high-precision number + } + + const auto number = BasicJsonType(n).dump(); + write_number_with_ubjson_prefix(number.size(), true); + for (std::size_t i = 0; i < number.size(); ++i) + { + oa->write_character(to_char_type(static_cast(number[i]))); + } + } + } + + // UBJSON: write number (signed integer) + template < typename NumberType, typename std::enable_if < + std::is_signed::value&& + !std::is_floating_point::value, int >::type = 0 > + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if ((std::numeric_limits::min)() <= n && n <= (std::numeric_limits::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('i')); // int8 + } + write_number(static_cast(n)); + } + else if (static_cast((std::numeric_limits::min)()) <= n && n <= static_cast((std::numeric_limits::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('U')); // uint8 + } + write_number(static_cast(n)); + } + else if ((std::numeric_limits::min)() <= n && n <= (std::numeric_limits::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('I')); // int16 + } + write_number(static_cast(n)); + } + else if ((std::numeric_limits::min)() <= n && n <= (std::numeric_limits::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('l')); // int32 + } + write_number(static_cast(n)); + } + else if ((std::numeric_limits::min)() <= n && n <= (std::numeric_limits::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('L')); // int64 + } + write_number(static_cast(n)); + } + // LCOV_EXCL_START + else + { + if (add_prefix) + { + oa->write_character(to_char_type('H')); // high-precision number + } + + const auto number = BasicJsonType(n).dump(); + write_number_with_ubjson_prefix(number.size(), true); + for (std::size_t i = 0; i < number.size(); ++i) + { + oa->write_character(to_char_type(static_cast(number[i]))); + } + } + // LCOV_EXCL_STOP + } + + /*! + @brief determine the type prefix of container values + */ + CharType ubjson_prefix(const BasicJsonType& j) const noexcept + { + switch (j.type()) + { + case value_t::null: + return 'Z'; + + case value_t::boolean: + return j.m_value.boolean ? 'T' : 'F'; + + case value_t::number_integer: + { + if ((std::numeric_limits::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits::max)()) + { + return 'i'; + } + if ((std::numeric_limits::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits::max)()) + { + return 'U'; + } + if ((std::numeric_limits::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits::max)()) + { + return 'I'; + } + if ((std::numeric_limits::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits::max)()) + { + return 'l'; + } + if ((std::numeric_limits::min)() <= j.m_value.number_integer && j.m_value.number_integer <= (std::numeric_limits::max)()) + { + return 'L'; + } + // anything else is treated as high-precision number + return 'H'; // LCOV_EXCL_LINE + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned <= static_cast((std::numeric_limits::max)())) + { + return 'i'; + } + if (j.m_value.number_unsigned <= static_cast((std::numeric_limits::max)())) + { + return 'U'; + } + if (j.m_value.number_unsigned <= static_cast((std::numeric_limits::max)())) + { + return 'I'; + } + if (j.m_value.number_unsigned <= static_cast((std::numeric_limits::max)())) + { + return 'l'; + } + if (j.m_value.number_unsigned <= static_cast((std::numeric_limits::max)())) + { + return 'L'; + } + // anything else is treated as high-precision number + return 'H'; // LCOV_EXCL_LINE + } + + case value_t::number_float: + return get_ubjson_float_prefix(j.m_value.number_float); + + case value_t::string: + return 'S'; + + case value_t::array: // fallthrough + case value_t::binary: + return '['; + + case value_t::object: + return '{'; + + default: // discarded values + return 'N'; + } + } + + static constexpr CharType get_ubjson_float_prefix(float /*unused*/) + { + return 'd'; // float 32 + } + + static constexpr CharType get_ubjson_float_prefix(double /*unused*/) + { + return 'D'; // float 64 + } + + /////////////////////// + // Utility functions // + /////////////////////// + + /* + @brief write a number to output input + @param[in] n number of type @a NumberType + @tparam NumberType the type of the number + @tparam OutputIsLittleEndian Set to true if output data is + required to be little endian + + @note This function needs to respect the system's endianess, because bytes + in CBOR, MessagePack, and UBJSON are stored in network order (big + endian) and therefore need reordering on little endian systems. + */ + template + void write_number(const NumberType n) + { + // step 1: write number to array of length NumberType + std::array vec; + std::memcpy(vec.data(), &n, sizeof(NumberType)); + + // step 2: write array to output (with possible reordering) + if (is_little_endian != OutputIsLittleEndian) + { + // reverse byte order prior to conversion if necessary + std::reverse(vec.begin(), vec.end()); + } + + oa->write_characters(vec.data(), sizeof(NumberType)); + } + + void write_compact_float(const number_float_t n, detail::input_format_t format) + { + if (static_cast(n) >= static_cast(std::numeric_limits::lowest()) && + static_cast(n) <= static_cast((std::numeric_limits::max)()) && + static_cast(static_cast(n)) == static_cast(n)) + { + oa->write_character(format == detail::input_format_t::cbor + ? get_cbor_float_prefix(static_cast(n)) + : get_msgpack_float_prefix(static_cast(n))); + write_number(static_cast(n)); + } + else + { + oa->write_character(format == detail::input_format_t::cbor + ? get_cbor_float_prefix(n) + : get_msgpack_float_prefix(n)); + write_number(n); + } + } + + public: + // The following to_char_type functions are implement the conversion + // between uint8_t and CharType. In case CharType is not unsigned, + // such a conversion is required to allow values greater than 128. + // See for a discussion. + template < typename C = CharType, + enable_if_t < std::is_signed::value && std::is_signed::value > * = nullptr > + static constexpr CharType to_char_type(std::uint8_t x) noexcept + { + return *reinterpret_cast(&x); + } + + template < typename C = CharType, + enable_if_t < std::is_signed::value && std::is_unsigned::value > * = nullptr > + static CharType to_char_type(std::uint8_t x) noexcept + { + static_assert(sizeof(std::uint8_t) == sizeof(CharType), "size of CharType must be equal to std::uint8_t"); + static_assert(std::is_trivial::value, "CharType must be trivial"); + CharType result; + std::memcpy(&result, &x, sizeof(x)); + return result; + } + + template::value>* = nullptr> + static constexpr CharType to_char_type(std::uint8_t x) noexcept + { + return x; + } + + template < typename InputCharType, typename C = CharType, + enable_if_t < + std::is_signed::value && + std::is_signed::value && + std::is_same::type>::value + > * = nullptr > + static constexpr CharType to_char_type(InputCharType x) noexcept + { + return x; + } + + private: + /// whether we can assume little endianess + const bool is_little_endian = little_endianess(); + + /// the output + output_adapter_t oa = nullptr; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + + +#include // reverse, remove, fill, find, none_of +#include // array +#include // localeconv, lconv +#include // labs, isfinite, isnan, signbit +#include // size_t, ptrdiff_t +#include // uint8_t +#include // snprintf +#include // numeric_limits +#include // string, char_traits +#include // is_same +#include // move + +// #include + + +#include // array +#include // signbit, isfinite +#include // intN_t, uintN_t +#include // memcpy, memmove +#include // numeric_limits +#include // conditional + +// #include + + +namespace nlohmann +{ +namespace detail +{ + +/*! +@brief implements the Grisu2 algorithm for binary to decimal floating-point +conversion. + +This implementation is a slightly modified version of the reference +implementation which may be obtained from +http://florian.loitsch.com/publications (bench.tar.gz). + +The code is distributed under the MIT license, Copyright (c) 2009 Florian Loitsch. + +For a detailed description of the algorithm see: + +[1] Loitsch, "Printing Floating-Point Numbers Quickly and Accurately with + Integers", Proceedings of the ACM SIGPLAN 2010 Conference on Programming + Language Design and Implementation, PLDI 2010 +[2] Burger, Dybvig, "Printing Floating-Point Numbers Quickly and Accurately", + Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language + Design and Implementation, PLDI 1996 +*/ +namespace dtoa_impl +{ + +template +Target reinterpret_bits(const Source source) +{ + static_assert(sizeof(Target) == sizeof(Source), "size mismatch"); + + Target target; + std::memcpy(&target, &source, sizeof(Source)); + return target; +} + +struct diyfp // f * 2^e +{ + static constexpr int kPrecision = 64; // = q + + std::uint64_t f = 0; + int e = 0; + + constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {} + + /*! + @brief returns x - y + @pre x.e == y.e and x.f >= y.f + */ + static diyfp sub(const diyfp& x, const diyfp& y) noexcept + { + JSON_ASSERT(x.e == y.e); + JSON_ASSERT(x.f >= y.f); + + return {x.f - y.f, x.e}; + } + + /*! + @brief returns x * y + @note The result is rounded. (Only the upper q bits are returned.) + */ + static diyfp mul(const diyfp& x, const diyfp& y) noexcept + { + static_assert(kPrecision == 64, "internal error"); + + // Computes: + // f = round((x.f * y.f) / 2^q) + // e = x.e + y.e + q + + // Emulate the 64-bit * 64-bit multiplication: + // + // p = u * v + // = (u_lo + 2^32 u_hi) (v_lo + 2^32 v_hi) + // = (u_lo v_lo ) + 2^32 ((u_lo v_hi ) + (u_hi v_lo )) + 2^64 (u_hi v_hi ) + // = (p0 ) + 2^32 ((p1 ) + (p2 )) + 2^64 (p3 ) + // = (p0_lo + 2^32 p0_hi) + 2^32 ((p1_lo + 2^32 p1_hi) + (p2_lo + 2^32 p2_hi)) + 2^64 (p3 ) + // = (p0_lo ) + 2^32 (p0_hi + p1_lo + p2_lo ) + 2^64 (p1_hi + p2_hi + p3) + // = (p0_lo ) + 2^32 (Q ) + 2^64 (H ) + // = (p0_lo ) + 2^32 (Q_lo + 2^32 Q_hi ) + 2^64 (H ) + // + // (Since Q might be larger than 2^32 - 1) + // + // = (p0_lo + 2^32 Q_lo) + 2^64 (Q_hi + H) + // + // (Q_hi + H does not overflow a 64-bit int) + // + // = p_lo + 2^64 p_hi + + const std::uint64_t u_lo = x.f & 0xFFFFFFFFu; + const std::uint64_t u_hi = x.f >> 32u; + const std::uint64_t v_lo = y.f & 0xFFFFFFFFu; + const std::uint64_t v_hi = y.f >> 32u; + + const std::uint64_t p0 = u_lo * v_lo; + const std::uint64_t p1 = u_lo * v_hi; + const std::uint64_t p2 = u_hi * v_lo; + const std::uint64_t p3 = u_hi * v_hi; + + const std::uint64_t p0_hi = p0 >> 32u; + const std::uint64_t p1_lo = p1 & 0xFFFFFFFFu; + const std::uint64_t p1_hi = p1 >> 32u; + const std::uint64_t p2_lo = p2 & 0xFFFFFFFFu; + const std::uint64_t p2_hi = p2 >> 32u; + + std::uint64_t Q = p0_hi + p1_lo + p2_lo; + + // The full product might now be computed as + // + // p_hi = p3 + p2_hi + p1_hi + (Q >> 32) + // p_lo = p0_lo + (Q << 32) + // + // But in this particular case here, the full p_lo is not required. + // Effectively we only need to add the highest bit in p_lo to p_hi (and + // Q_hi + 1 does not overflow). + + Q += std::uint64_t{1} << (64u - 32u - 1u); // round, ties up + + const std::uint64_t h = p3 + p2_hi + p1_hi + (Q >> 32u); + + return {h, x.e + y.e + 64}; + } + + /*! + @brief normalize x such that the significand is >= 2^(q-1) + @pre x.f != 0 + */ + static diyfp normalize(diyfp x) noexcept + { + JSON_ASSERT(x.f != 0); + + while ((x.f >> 63u) == 0) + { + x.f <<= 1u; + x.e--; + } + + return x; + } + + /*! + @brief normalize x such that the result has the exponent E + @pre e >= x.e and the upper e - x.e bits of x.f must be zero. + */ + static diyfp normalize_to(const diyfp& x, const int target_exponent) noexcept + { + const int delta = x.e - target_exponent; + + JSON_ASSERT(delta >= 0); + JSON_ASSERT(((x.f << delta) >> delta) == x.f); + + return {x.f << delta, target_exponent}; + } +}; + +struct boundaries +{ + diyfp w; + diyfp minus; + diyfp plus; +}; + +/*! +Compute the (normalized) diyfp representing the input number 'value' and its +boundaries. + +@pre value must be finite and positive +*/ +template +boundaries compute_boundaries(FloatType value) +{ + JSON_ASSERT(std::isfinite(value)); + JSON_ASSERT(value > 0); + + // Convert the IEEE representation into a diyfp. + // + // If v is denormal: + // value = 0.F * 2^(1 - bias) = ( F) * 2^(1 - bias - (p-1)) + // If v is normalized: + // value = 1.F * 2^(E - bias) = (2^(p-1) + F) * 2^(E - bias - (p-1)) + + static_assert(std::numeric_limits::is_iec559, + "internal error: dtoa_short requires an IEEE-754 floating-point implementation"); + + constexpr int kPrecision = std::numeric_limits::digits; // = p (includes the hidden bit) + constexpr int kBias = std::numeric_limits::max_exponent - 1 + (kPrecision - 1); + constexpr int kMinExp = 1 - kBias; + constexpr std::uint64_t kHiddenBit = std::uint64_t{1} << (kPrecision - 1); // = 2^(p-1) + + using bits_type = typename std::conditional::type; + + const std::uint64_t bits = reinterpret_bits(value); + const std::uint64_t E = bits >> (kPrecision - 1); + const std::uint64_t F = bits & (kHiddenBit - 1); + + const bool is_denormal = E == 0; + const diyfp v = is_denormal + ? diyfp(F, kMinExp) + : diyfp(F + kHiddenBit, static_cast(E) - kBias); + + // Compute the boundaries m- and m+ of the floating-point value + // v = f * 2^e. + // + // Determine v- and v+, the floating-point predecessor and successor if v, + // respectively. + // + // v- = v - 2^e if f != 2^(p-1) or e == e_min (A) + // = v - 2^(e-1) if f == 2^(p-1) and e > e_min (B) + // + // v+ = v + 2^e + // + // Let m- = (v- + v) / 2 and m+ = (v + v+) / 2. All real numbers _strictly_ + // between m- and m+ round to v, regardless of how the input rounding + // algorithm breaks ties. + // + // ---+-------------+-------------+-------------+-------------+--- (A) + // v- m- v m+ v+ + // + // -----------------+------+------+-------------+-------------+--- (B) + // v- m- v m+ v+ + + const bool lower_boundary_is_closer = F == 0 && E > 1; + const diyfp m_plus = diyfp(2 * v.f + 1, v.e - 1); + const diyfp m_minus = lower_boundary_is_closer + ? diyfp(4 * v.f - 1, v.e - 2) // (B) + : diyfp(2 * v.f - 1, v.e - 1); // (A) + + // Determine the normalized w+ = m+. + const diyfp w_plus = diyfp::normalize(m_plus); + + // Determine w- = m- such that e_(w-) = e_(w+). + const diyfp w_minus = diyfp::normalize_to(m_minus, w_plus.e); + + return {diyfp::normalize(v), w_minus, w_plus}; +} + +// Given normalized diyfp w, Grisu needs to find a (normalized) cached +// power-of-ten c, such that the exponent of the product c * w = f * 2^e lies +// within a certain range [alpha, gamma] (Definition 3.2 from [1]) +// +// alpha <= e = e_c + e_w + q <= gamma +// +// or +// +// f_c * f_w * 2^alpha <= f_c 2^(e_c) * f_w 2^(e_w) * 2^q +// <= f_c * f_w * 2^gamma +// +// Since c and w are normalized, i.e. 2^(q-1) <= f < 2^q, this implies +// +// 2^(q-1) * 2^(q-1) * 2^alpha <= c * w * 2^q < 2^q * 2^q * 2^gamma +// +// or +// +// 2^(q - 2 + alpha) <= c * w < 2^(q + gamma) +// +// The choice of (alpha,gamma) determines the size of the table and the form of +// the digit generation procedure. Using (alpha,gamma)=(-60,-32) works out well +// in practice: +// +// The idea is to cut the number c * w = f * 2^e into two parts, which can be +// processed independently: An integral part p1, and a fractional part p2: +// +// f * 2^e = ( (f div 2^-e) * 2^-e + (f mod 2^-e) ) * 2^e +// = (f div 2^-e) + (f mod 2^-e) * 2^e +// = p1 + p2 * 2^e +// +// The conversion of p1 into decimal form requires a series of divisions and +// modulos by (a power of) 10. These operations are faster for 32-bit than for +// 64-bit integers, so p1 should ideally fit into a 32-bit integer. This can be +// achieved by choosing +// +// -e >= 32 or e <= -32 := gamma +// +// In order to convert the fractional part +// +// p2 * 2^e = p2 / 2^-e = d[-1] / 10^1 + d[-2] / 10^2 + ... +// +// into decimal form, the fraction is repeatedly multiplied by 10 and the digits +// d[-i] are extracted in order: +// +// (10 * p2) div 2^-e = d[-1] +// (10 * p2) mod 2^-e = d[-2] / 10^1 + ... +// +// The multiplication by 10 must not overflow. It is sufficient to choose +// +// 10 * p2 < 16 * p2 = 2^4 * p2 <= 2^64. +// +// Since p2 = f mod 2^-e < 2^-e, +// +// -e <= 60 or e >= -60 := alpha + +constexpr int kAlpha = -60; +constexpr int kGamma = -32; + +struct cached_power // c = f * 2^e ~= 10^k +{ + std::uint64_t f; + int e; + int k; +}; + +/*! +For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached +power-of-ten c = f_c * 2^e_c, such that the exponent of the product w * c +satisfies (Definition 3.2 from [1]) + + alpha <= e_c + e + q <= gamma. +*/ +inline cached_power get_cached_power_for_binary_exponent(int e) +{ + // Now + // + // alpha <= e_c + e + q <= gamma (1) + // ==> f_c * 2^alpha <= c * 2^e * 2^q + // + // and since the c's are normalized, 2^(q-1) <= f_c, + // + // ==> 2^(q - 1 + alpha) <= c * 2^(e + q) + // ==> 2^(alpha - e - 1) <= c + // + // If c were an exact power of ten, i.e. c = 10^k, one may determine k as + // + // k = ceil( log_10( 2^(alpha - e - 1) ) ) + // = ceil( (alpha - e - 1) * log_10(2) ) + // + // From the paper: + // "In theory the result of the procedure could be wrong since c is rounded, + // and the computation itself is approximated [...]. In practice, however, + // this simple function is sufficient." + // + // For IEEE double precision floating-point numbers converted into + // normalized diyfp's w = f * 2^e, with q = 64, + // + // e >= -1022 (min IEEE exponent) + // -52 (p - 1) + // -52 (p - 1, possibly normalize denormal IEEE numbers) + // -11 (normalize the diyfp) + // = -1137 + // + // and + // + // e <= +1023 (max IEEE exponent) + // -52 (p - 1) + // -11 (normalize the diyfp) + // = 960 + // + // This binary exponent range [-1137,960] results in a decimal exponent + // range [-307,324]. One does not need to store a cached power for each + // k in this range. For each such k it suffices to find a cached power + // such that the exponent of the product lies in [alpha,gamma]. + // This implies that the difference of the decimal exponents of adjacent + // table entries must be less than or equal to + // + // floor( (gamma - alpha) * log_10(2) ) = 8. + // + // (A smaller distance gamma-alpha would require a larger table.) + + // NB: + // Actually this function returns c, such that -60 <= e_c + e + 64 <= -34. + + constexpr int kCachedPowersMinDecExp = -300; + constexpr int kCachedPowersDecStep = 8; + + static constexpr std::array kCachedPowers = + { + { + { 0xAB70FE17C79AC6CA, -1060, -300 }, + { 0xFF77B1FCBEBCDC4F, -1034, -292 }, + { 0xBE5691EF416BD60C, -1007, -284 }, + { 0x8DD01FAD907FFC3C, -980, -276 }, + { 0xD3515C2831559A83, -954, -268 }, + { 0x9D71AC8FADA6C9B5, -927, -260 }, + { 0xEA9C227723EE8BCB, -901, -252 }, + { 0xAECC49914078536D, -874, -244 }, + { 0x823C12795DB6CE57, -847, -236 }, + { 0xC21094364DFB5637, -821, -228 }, + { 0x9096EA6F3848984F, -794, -220 }, + { 0xD77485CB25823AC7, -768, -212 }, + { 0xA086CFCD97BF97F4, -741, -204 }, + { 0xEF340A98172AACE5, -715, -196 }, + { 0xB23867FB2A35B28E, -688, -188 }, + { 0x84C8D4DFD2C63F3B, -661, -180 }, + { 0xC5DD44271AD3CDBA, -635, -172 }, + { 0x936B9FCEBB25C996, -608, -164 }, + { 0xDBAC6C247D62A584, -582, -156 }, + { 0xA3AB66580D5FDAF6, -555, -148 }, + { 0xF3E2F893DEC3F126, -529, -140 }, + { 0xB5B5ADA8AAFF80B8, -502, -132 }, + { 0x87625F056C7C4A8B, -475, -124 }, + { 0xC9BCFF6034C13053, -449, -116 }, + { 0x964E858C91BA2655, -422, -108 }, + { 0xDFF9772470297EBD, -396, -100 }, + { 0xA6DFBD9FB8E5B88F, -369, -92 }, + { 0xF8A95FCF88747D94, -343, -84 }, + { 0xB94470938FA89BCF, -316, -76 }, + { 0x8A08F0F8BF0F156B, -289, -68 }, + { 0xCDB02555653131B6, -263, -60 }, + { 0x993FE2C6D07B7FAC, -236, -52 }, + { 0xE45C10C42A2B3B06, -210, -44 }, + { 0xAA242499697392D3, -183, -36 }, + { 0xFD87B5F28300CA0E, -157, -28 }, + { 0xBCE5086492111AEB, -130, -20 }, + { 0x8CBCCC096F5088CC, -103, -12 }, + { 0xD1B71758E219652C, -77, -4 }, + { 0x9C40000000000000, -50, 4 }, + { 0xE8D4A51000000000, -24, 12 }, + { 0xAD78EBC5AC620000, 3, 20 }, + { 0x813F3978F8940984, 30, 28 }, + { 0xC097CE7BC90715B3, 56, 36 }, + { 0x8F7E32CE7BEA5C70, 83, 44 }, + { 0xD5D238A4ABE98068, 109, 52 }, + { 0x9F4F2726179A2245, 136, 60 }, + { 0xED63A231D4C4FB27, 162, 68 }, + { 0xB0DE65388CC8ADA8, 189, 76 }, + { 0x83C7088E1AAB65DB, 216, 84 }, + { 0xC45D1DF942711D9A, 242, 92 }, + { 0x924D692CA61BE758, 269, 100 }, + { 0xDA01EE641A708DEA, 295, 108 }, + { 0xA26DA3999AEF774A, 322, 116 }, + { 0xF209787BB47D6B85, 348, 124 }, + { 0xB454E4A179DD1877, 375, 132 }, + { 0x865B86925B9BC5C2, 402, 140 }, + { 0xC83553C5C8965D3D, 428, 148 }, + { 0x952AB45CFA97A0B3, 455, 156 }, + { 0xDE469FBD99A05FE3, 481, 164 }, + { 0xA59BC234DB398C25, 508, 172 }, + { 0xF6C69A72A3989F5C, 534, 180 }, + { 0xB7DCBF5354E9BECE, 561, 188 }, + { 0x88FCF317F22241E2, 588, 196 }, + { 0xCC20CE9BD35C78A5, 614, 204 }, + { 0x98165AF37B2153DF, 641, 212 }, + { 0xE2A0B5DC971F303A, 667, 220 }, + { 0xA8D9D1535CE3B396, 694, 228 }, + { 0xFB9B7CD9A4A7443C, 720, 236 }, + { 0xBB764C4CA7A44410, 747, 244 }, + { 0x8BAB8EEFB6409C1A, 774, 252 }, + { 0xD01FEF10A657842C, 800, 260 }, + { 0x9B10A4E5E9913129, 827, 268 }, + { 0xE7109BFBA19C0C9D, 853, 276 }, + { 0xAC2820D9623BF429, 880, 284 }, + { 0x80444B5E7AA7CF85, 907, 292 }, + { 0xBF21E44003ACDD2D, 933, 300 }, + { 0x8E679C2F5E44FF8F, 960, 308 }, + { 0xD433179D9C8CB841, 986, 316 }, + { 0x9E19DB92B4E31BA9, 1013, 324 }, + } + }; + + // This computation gives exactly the same results for k as + // k = ceil((kAlpha - e - 1) * 0.30102999566398114) + // for |e| <= 1500, but doesn't require floating-point operations. + // NB: log_10(2) ~= 78913 / 2^18 + JSON_ASSERT(e >= -1500); + JSON_ASSERT(e <= 1500); + const int f = kAlpha - e - 1; + const int k = (f * 78913) / (1 << 18) + static_cast(f > 0); + + const int index = (-kCachedPowersMinDecExp + k + (kCachedPowersDecStep - 1)) / kCachedPowersDecStep; + JSON_ASSERT(index >= 0); + JSON_ASSERT(static_cast(index) < kCachedPowers.size()); + + const cached_power cached = kCachedPowers[static_cast(index)]; + JSON_ASSERT(kAlpha <= cached.e + e + 64); + JSON_ASSERT(kGamma >= cached.e + e + 64); + + return cached; +} + +/*! +For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k. +For n == 0, returns 1 and sets pow10 := 1. +*/ +inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10) +{ + // LCOV_EXCL_START + if (n >= 1000000000) + { + pow10 = 1000000000; + return 10; + } + // LCOV_EXCL_STOP + else if (n >= 100000000) + { + pow10 = 100000000; + return 9; + } + else if (n >= 10000000) + { + pow10 = 10000000; + return 8; + } + else if (n >= 1000000) + { + pow10 = 1000000; + return 7; + } + else if (n >= 100000) + { + pow10 = 100000; + return 6; + } + else if (n >= 10000) + { + pow10 = 10000; + return 5; + } + else if (n >= 1000) + { + pow10 = 1000; + return 4; + } + else if (n >= 100) + { + pow10 = 100; + return 3; + } + else if (n >= 10) + { + pow10 = 10; + return 2; + } + else + { + pow10 = 1; + return 1; + } +} + +inline void grisu2_round(char* buf, int len, std::uint64_t dist, std::uint64_t delta, + std::uint64_t rest, std::uint64_t ten_k) +{ + JSON_ASSERT(len >= 1); + JSON_ASSERT(dist <= delta); + JSON_ASSERT(rest <= delta); + JSON_ASSERT(ten_k > 0); + + // <--------------------------- delta ----> + // <---- dist ---------> + // --------------[------------------+-------------------]-------------- + // M- w M+ + // + // ten_k + // <------> + // <---- rest ----> + // --------------[------------------+----+--------------]-------------- + // w V + // = buf * 10^k + // + // ten_k represents a unit-in-the-last-place in the decimal representation + // stored in buf. + // Decrement buf by ten_k while this takes buf closer to w. + + // The tests are written in this order to avoid overflow in unsigned + // integer arithmetic. + + while (rest < dist + && delta - rest >= ten_k + && (rest + ten_k < dist || dist - rest > rest + ten_k - dist)) + { + JSON_ASSERT(buf[len - 1] != '0'); + buf[len - 1]--; + rest += ten_k; + } +} + +/*! +Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+. +M- and M+ must be normalized and share the same exponent -60 <= e <= -32. +*/ +inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent, + diyfp M_minus, diyfp w, diyfp M_plus) +{ + static_assert(kAlpha >= -60, "internal error"); + static_assert(kGamma <= -32, "internal error"); + + // Generates the digits (and the exponent) of a decimal floating-point + // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's + // w, M- and M+ share the same exponent e, which satisfies alpha <= e <= gamma. + // + // <--------------------------- delta ----> + // <---- dist ---------> + // --------------[------------------+-------------------]-------------- + // M- w M+ + // + // Grisu2 generates the digits of M+ from left to right and stops as soon as + // V is in [M-,M+]. + + JSON_ASSERT(M_plus.e >= kAlpha); + JSON_ASSERT(M_plus.e <= kGamma); + + std::uint64_t delta = diyfp::sub(M_plus, M_minus).f; // (significand of (M+ - M-), implicit exponent is e) + std::uint64_t dist = diyfp::sub(M_plus, w ).f; // (significand of (M+ - w ), implicit exponent is e) + + // Split M+ = f * 2^e into two parts p1 and p2 (note: e < 0): + // + // M+ = f * 2^e + // = ((f div 2^-e) * 2^-e + (f mod 2^-e)) * 2^e + // = ((p1 ) * 2^-e + (p2 )) * 2^e + // = p1 + p2 * 2^e + + const diyfp one(std::uint64_t{1} << -M_plus.e, M_plus.e); + + auto p1 = static_cast(M_plus.f >> -one.e); // p1 = f div 2^-e (Since -e >= 32, p1 fits into a 32-bit int.) + std::uint64_t p2 = M_plus.f & (one.f - 1); // p2 = f mod 2^-e + + // 1) + // + // Generate the digits of the integral part p1 = d[n-1]...d[1]d[0] + + JSON_ASSERT(p1 > 0); + + std::uint32_t pow10; + const int k = find_largest_pow10(p1, pow10); + + // 10^(k-1) <= p1 < 10^k, pow10 = 10^(k-1) + // + // p1 = (p1 div 10^(k-1)) * 10^(k-1) + (p1 mod 10^(k-1)) + // = (d[k-1] ) * 10^(k-1) + (p1 mod 10^(k-1)) + // + // M+ = p1 + p2 * 2^e + // = d[k-1] * 10^(k-1) + (p1 mod 10^(k-1)) + p2 * 2^e + // = d[k-1] * 10^(k-1) + ((p1 mod 10^(k-1)) * 2^-e + p2) * 2^e + // = d[k-1] * 10^(k-1) + ( rest) * 2^e + // + // Now generate the digits d[n] of p1 from left to right (n = k-1,...,0) + // + // p1 = d[k-1]...d[n] * 10^n + d[n-1]...d[0] + // + // but stop as soon as + // + // rest * 2^e = (d[n-1]...d[0] * 2^-e + p2) * 2^e <= delta * 2^e + + int n = k; + while (n > 0) + { + // Invariants: + // M+ = buffer * 10^n + (p1 + p2 * 2^e) (buffer = 0 for n = k) + // pow10 = 10^(n-1) <= p1 < 10^n + // + const std::uint32_t d = p1 / pow10; // d = p1 div 10^(n-1) + const std::uint32_t r = p1 % pow10; // r = p1 mod 10^(n-1) + // + // M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e + // = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e) + // + JSON_ASSERT(d <= 9); + buffer[length++] = static_cast('0' + d); // buffer := buffer * 10 + d + // + // M+ = buffer * 10^(n-1) + (r + p2 * 2^e) + // + p1 = r; + n--; + // + // M+ = buffer * 10^n + (p1 + p2 * 2^e) + // pow10 = 10^n + // + + // Now check if enough digits have been generated. + // Compute + // + // p1 + p2 * 2^e = (p1 * 2^-e + p2) * 2^e = rest * 2^e + // + // Note: + // Since rest and delta share the same exponent e, it suffices to + // compare the significands. + const std::uint64_t rest = (std::uint64_t{p1} << -one.e) + p2; + if (rest <= delta) + { + // V = buffer * 10^n, with M- <= V <= M+. + + decimal_exponent += n; + + // We may now just stop. But instead look if the buffer could be + // decremented to bring V closer to w. + // + // pow10 = 10^n is now 1 ulp in the decimal representation V. + // The rounding procedure works with diyfp's with an implicit + // exponent of e. + // + // 10^n = (10^n * 2^-e) * 2^e = ulp * 2^e + // + const std::uint64_t ten_n = std::uint64_t{pow10} << -one.e; + grisu2_round(buffer, length, dist, delta, rest, ten_n); + + return; + } + + pow10 /= 10; + // + // pow10 = 10^(n-1) <= p1 < 10^n + // Invariants restored. + } + + // 2) + // + // The digits of the integral part have been generated: + // + // M+ = d[k-1]...d[1]d[0] + p2 * 2^e + // = buffer + p2 * 2^e + // + // Now generate the digits of the fractional part p2 * 2^e. + // + // Note: + // No decimal point is generated: the exponent is adjusted instead. + // + // p2 actually represents the fraction + // + // p2 * 2^e + // = p2 / 2^-e + // = d[-1] / 10^1 + d[-2] / 10^2 + ... + // + // Now generate the digits d[-m] of p1 from left to right (m = 1,2,...) + // + // p2 * 2^e = d[-1]d[-2]...d[-m] * 10^-m + // + 10^-m * (d[-m-1] / 10^1 + d[-m-2] / 10^2 + ...) + // + // using + // + // 10^m * p2 = ((10^m * p2) div 2^-e) * 2^-e + ((10^m * p2) mod 2^-e) + // = ( d) * 2^-e + ( r) + // + // or + // 10^m * p2 * 2^e = d + r * 2^e + // + // i.e. + // + // M+ = buffer + p2 * 2^e + // = buffer + 10^-m * (d + r * 2^e) + // = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e + // + // and stop as soon as 10^-m * r * 2^e <= delta * 2^e + + JSON_ASSERT(p2 > delta); + + int m = 0; + for (;;) + { + // Invariant: + // M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e + // = buffer * 10^-m + 10^-m * (p2 ) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * (10 * p2) ) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e + // + JSON_ASSERT(p2 <= (std::numeric_limits::max)() / 10); + p2 *= 10; + const std::uint64_t d = p2 >> -one.e; // d = (10 * p2) div 2^-e + const std::uint64_t r = p2 & (one.f - 1); // r = (10 * p2) mod 2^-e + // + // M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e)) + // = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e + // + JSON_ASSERT(d <= 9); + buffer[length++] = static_cast('0' + d); // buffer := buffer * 10 + d + // + // M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e + // + p2 = r; + m++; + // + // M+ = buffer * 10^-m + 10^-m * p2 * 2^e + // Invariant restored. + + // Check if enough digits have been generated. + // + // 10^-m * p2 * 2^e <= delta * 2^e + // p2 * 2^e <= 10^m * delta * 2^e + // p2 <= 10^m * delta + delta *= 10; + dist *= 10; + if (p2 <= delta) + { + break; + } + } + + // V = buffer * 10^-m, with M- <= V <= M+. + + decimal_exponent -= m; + + // 1 ulp in the decimal representation is now 10^-m. + // Since delta and dist are now scaled by 10^m, we need to do the + // same with ulp in order to keep the units in sync. + // + // 10^m * 10^-m = 1 = 2^-e * 2^e = ten_m * 2^e + // + const std::uint64_t ten_m = one.f; + grisu2_round(buffer, length, dist, delta, p2, ten_m); + + // By construction this algorithm generates the shortest possible decimal + // number (Loitsch, Theorem 6.2) which rounds back to w. + // For an input number of precision p, at least + // + // N = 1 + ceil(p * log_10(2)) + // + // decimal digits are sufficient to identify all binary floating-point + // numbers (Matula, "In-and-Out conversions"). + // This implies that the algorithm does not produce more than N decimal + // digits. + // + // N = 17 for p = 53 (IEEE double precision) + // N = 9 for p = 24 (IEEE single precision) +} + +/*! +v = buf * 10^decimal_exponent +len is the length of the buffer (number of decimal digits) +The buffer must be large enough, i.e. >= max_digits10. +*/ +JSON_HEDLEY_NON_NULL(1) +inline void grisu2(char* buf, int& len, int& decimal_exponent, + diyfp m_minus, diyfp v, diyfp m_plus) +{ + JSON_ASSERT(m_plus.e == m_minus.e); + JSON_ASSERT(m_plus.e == v.e); + + // --------(-----------------------+-----------------------)-------- (A) + // m- v m+ + // + // --------------------(-----------+-----------------------)-------- (B) + // m- v m+ + // + // First scale v (and m- and m+) such that the exponent is in the range + // [alpha, gamma]. + + const cached_power cached = get_cached_power_for_binary_exponent(m_plus.e); + + const diyfp c_minus_k(cached.f, cached.e); // = c ~= 10^-k + + // The exponent of the products is = v.e + c_minus_k.e + q and is in the range [alpha,gamma] + const diyfp w = diyfp::mul(v, c_minus_k); + const diyfp w_minus = diyfp::mul(m_minus, c_minus_k); + const diyfp w_plus = diyfp::mul(m_plus, c_minus_k); + + // ----(---+---)---------------(---+---)---------------(---+---)---- + // w- w w+ + // = c*m- = c*v = c*m+ + // + // diyfp::mul rounds its result and c_minus_k is approximated too. w, w- and + // w+ are now off by a small amount. + // In fact: + // + // w - v * 10^k < 1 ulp + // + // To account for this inaccuracy, add resp. subtract 1 ulp. + // + // --------+---[---------------(---+---)---------------]---+-------- + // w- M- w M+ w+ + // + // Now any number in [M-, M+] (bounds included) will round to w when input, + // regardless of how the input rounding algorithm breaks ties. + // + // And digit_gen generates the shortest possible such number in [M-, M+]. + // Note that this does not mean that Grisu2 always generates the shortest + // possible number in the interval (m-, m+). + const diyfp M_minus(w_minus.f + 1, w_minus.e); + const diyfp M_plus (w_plus.f - 1, w_plus.e ); + + decimal_exponent = -cached.k; // = -(-k) = k + + grisu2_digit_gen(buf, len, decimal_exponent, M_minus, w, M_plus); +} + +/*! +v = buf * 10^decimal_exponent +len is the length of the buffer (number of decimal digits) +The buffer must be large enough, i.e. >= max_digits10. +*/ +template +JSON_HEDLEY_NON_NULL(1) +void grisu2(char* buf, int& len, int& decimal_exponent, FloatType value) +{ + static_assert(diyfp::kPrecision >= std::numeric_limits::digits + 3, + "internal error: not enough precision"); + + JSON_ASSERT(std::isfinite(value)); + JSON_ASSERT(value > 0); + + // If the neighbors (and boundaries) of 'value' are always computed for double-precision + // numbers, all float's can be recovered using strtod (and strtof). However, the resulting + // decimal representations are not exactly "short". + // + // The documentation for 'std::to_chars' (https://en.cppreference.com/w/cpp/utility/to_chars) + // says "value is converted to a string as if by std::sprintf in the default ("C") locale" + // and since sprintf promotes float's to double's, I think this is exactly what 'std::to_chars' + // does. + // On the other hand, the documentation for 'std::to_chars' requires that "parsing the + // representation using the corresponding std::from_chars function recovers value exactly". That + // indicates that single precision floating-point numbers should be recovered using + // 'std::strtof'. + // + // NB: If the neighbors are computed for single-precision numbers, there is a single float + // (7.0385307e-26f) which can't be recovered using strtod. The resulting double precision + // value is off by 1 ulp. +#if 0 + const boundaries w = compute_boundaries(static_cast(value)); +#else + const boundaries w = compute_boundaries(value); +#endif + + grisu2(buf, len, decimal_exponent, w.minus, w.w, w.plus); +} + +/*! +@brief appends a decimal representation of e to buf +@return a pointer to the element following the exponent. +@pre -1000 < e < 1000 +*/ +JSON_HEDLEY_NON_NULL(1) +JSON_HEDLEY_RETURNS_NON_NULL +inline char* append_exponent(char* buf, int e) +{ + JSON_ASSERT(e > -1000); + JSON_ASSERT(e < 1000); + + if (e < 0) + { + e = -e; + *buf++ = '-'; + } + else + { + *buf++ = '+'; + } + + auto k = static_cast(e); + if (k < 10) + { + // Always print at least two digits in the exponent. + // This is for compatibility with printf("%g"). + *buf++ = '0'; + *buf++ = static_cast('0' + k); + } + else if (k < 100) + { + *buf++ = static_cast('0' + k / 10); + k %= 10; + *buf++ = static_cast('0' + k); + } + else + { + *buf++ = static_cast('0' + k / 100); + k %= 100; + *buf++ = static_cast('0' + k / 10); + k %= 10; + *buf++ = static_cast('0' + k); + } + + return buf; +} + +/*! +@brief prettify v = buf * 10^decimal_exponent + +If v is in the range [10^min_exp, 10^max_exp) it will be printed in fixed-point +notation. Otherwise it will be printed in exponential notation. + +@pre min_exp < 0 +@pre max_exp > 0 +*/ +JSON_HEDLEY_NON_NULL(1) +JSON_HEDLEY_RETURNS_NON_NULL +inline char* format_buffer(char* buf, int len, int decimal_exponent, + int min_exp, int max_exp) +{ + JSON_ASSERT(min_exp < 0); + JSON_ASSERT(max_exp > 0); + + const int k = len; + const int n = len + decimal_exponent; + + // v = buf * 10^(n-k) + // k is the length of the buffer (number of decimal digits) + // n is the position of the decimal point relative to the start of the buffer. + + if (k <= n && n <= max_exp) + { + // digits[000] + // len <= max_exp + 2 + + std::memset(buf + k, '0', static_cast(n) - static_cast(k)); + // Make it look like a floating-point number (#362, #378) + buf[n + 0] = '.'; + buf[n + 1] = '0'; + return buf + (static_cast(n) + 2); + } + + if (0 < n && n <= max_exp) + { + // dig.its + // len <= max_digits10 + 1 + + JSON_ASSERT(k > n); + + std::memmove(buf + (static_cast(n) + 1), buf + n, static_cast(k) - static_cast(n)); + buf[n] = '.'; + return buf + (static_cast(k) + 1U); + } + + if (min_exp < n && n <= 0) + { + // 0.[000]digits + // len <= 2 + (-min_exp - 1) + max_digits10 + + std::memmove(buf + (2 + static_cast(-n)), buf, static_cast(k)); + buf[0] = '0'; + buf[1] = '.'; + std::memset(buf + 2, '0', static_cast(-n)); + return buf + (2U + static_cast(-n) + static_cast(k)); + } + + if (k == 1) + { + // dE+123 + // len <= 1 + 5 + + buf += 1; + } + else + { + // d.igitsE+123 + // len <= max_digits10 + 1 + 5 + + std::memmove(buf + 2, buf + 1, static_cast(k) - 1); + buf[1] = '.'; + buf += 1 + static_cast(k); + } + + *buf++ = 'e'; + return append_exponent(buf, n - 1); +} + +} // namespace dtoa_impl + +/*! +@brief generates a decimal representation of the floating-point number value in [first, last). + +The format of the resulting decimal representation is similar to printf's %g +format. Returns an iterator pointing past-the-end of the decimal representation. + +@note The input number must be finite, i.e. NaN's and Inf's are not supported. +@note The buffer must be large enough. +@note The result is NOT null-terminated. +*/ +template +JSON_HEDLEY_NON_NULL(1, 2) +JSON_HEDLEY_RETURNS_NON_NULL +char* to_chars(char* first, const char* last, FloatType value) +{ + static_cast(last); // maybe unused - fix warning + JSON_ASSERT(std::isfinite(value)); + + // Use signbit(value) instead of (value < 0) since signbit works for -0. + if (std::signbit(value)) + { + value = -value; + *first++ = '-'; + } + + if (value == 0) // +-0 + { + *first++ = '0'; + // Make it look like a floating-point number (#362, #378) + *first++ = '.'; + *first++ = '0'; + return first; + } + + JSON_ASSERT(last - first >= std::numeric_limits::max_digits10); + + // Compute v = buffer * 10^decimal_exponent. + // The decimal digits are stored in the buffer, which needs to be interpreted + // as an unsigned decimal integer. + // len is the length of the buffer, i.e. the number of decimal digits. + int len = 0; + int decimal_exponent = 0; + dtoa_impl::grisu2(first, len, decimal_exponent, value); + + JSON_ASSERT(len <= std::numeric_limits::max_digits10); + + // Format the buffer like printf("%.*g", prec, value) + constexpr int kMinExp = -4; + // Use digits10 here to increase compatibility with version 2. + constexpr int kMaxExp = std::numeric_limits::digits10; + + JSON_ASSERT(last - first >= kMaxExp + 2); + JSON_ASSERT(last - first >= 2 + (-kMinExp - 1) + std::numeric_limits::max_digits10); + JSON_ASSERT(last - first >= std::numeric_limits::max_digits10 + 6); + + return dtoa_impl::format_buffer(first, len, decimal_exponent, kMinExp, kMaxExp); +} + +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + +// #include + +// #include + +// #include + +// #include + + +namespace nlohmann +{ +namespace detail +{ +/////////////////// +// serialization // +/////////////////// + +/// how to treat decoding errors +enum class error_handler_t +{ + strict, ///< throw a type_error exception in case of invalid UTF-8 + replace, ///< replace invalid UTF-8 sequences with U+FFFD + ignore ///< ignore invalid UTF-8 sequences +}; + +template +class serializer +{ + using string_t = typename BasicJsonType::string_t; + using number_float_t = typename BasicJsonType::number_float_t; + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using binary_char_t = typename BasicJsonType::binary_t::value_type; + static constexpr std::uint8_t UTF8_ACCEPT = 0; + static constexpr std::uint8_t UTF8_REJECT = 1; + + public: + /*! + @param[in] s output stream to serialize to + @param[in] ichar indentation character to use + @param[in] error_handler_ how to react on decoding errors + */ + serializer(output_adapter_t s, const char ichar, + error_handler_t error_handler_ = error_handler_t::strict) + : o(std::move(s)) + , loc(std::localeconv()) + , thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits::to_char_type(* (loc->thousands_sep))) + , decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits::to_char_type(* (loc->decimal_point))) + , indent_char(ichar) + , indent_string(512, indent_char) + , error_handler(error_handler_) + {} + + // delete because of pointer members + serializer(const serializer&) = delete; + serializer& operator=(const serializer&) = delete; + serializer(serializer&&) = delete; + serializer& operator=(serializer&&) = delete; + ~serializer() = default; + + /*! + @brief internal implementation of the serialization function + + This function is called by the public member function dump and organizes + the serialization internally. The indentation level is propagated as + additional parameter. In case of arrays and objects, the function is + called recursively. + + - strings and object keys are escaped using `escape_string()` + - integer numbers are converted implicitly via `operator<<` + - floating-point numbers are converted to a string using `"%g"` format + - binary values are serialized as objects containing the subtype and the + byte array + + @param[in] val value to serialize + @param[in] pretty_print whether the output shall be pretty-printed + @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters + in the output are escaped with `\uXXXX` sequences, and the result consists + of ASCII characters only. + @param[in] indent_step the indent level + @param[in] current_indent the current indent level (only used internally) + */ + void dump(const BasicJsonType& val, + const bool pretty_print, + const bool ensure_ascii, + const unsigned int indent_step, + const unsigned int current_indent = 0) + { + switch (val.m_type) + { + case value_t::object: + { + if (val.m_value.object->empty()) + { + o->write_characters("{}", 2); + return; + } + + if (pretty_print) + { + o->write_characters("{\n", 2); + + // variable to hold indentation for recursive calls + const auto new_indent = current_indent + indent_step; + if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent)) + { + indent_string.resize(indent_string.size() * 2, ' '); + } + + // first n-1 elements + auto i = val.m_value.object->cbegin(); + for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i) + { + o->write_characters(indent_string.c_str(), new_indent); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\": ", 3); + dump(i->second, true, ensure_ascii, indent_step, new_indent); + o->write_characters(",\n", 2); + } + + // last element + JSON_ASSERT(i != val.m_value.object->cend()); + JSON_ASSERT(std::next(i) == val.m_value.object->cend()); + o->write_characters(indent_string.c_str(), new_indent); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\": ", 3); + dump(i->second, true, ensure_ascii, indent_step, new_indent); + + o->write_character('\n'); + o->write_characters(indent_string.c_str(), current_indent); + o->write_character('}'); + } + else + { + o->write_character('{'); + + // first n-1 elements + auto i = val.m_value.object->cbegin(); + for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i) + { + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\":", 2); + dump(i->second, false, ensure_ascii, indent_step, current_indent); + o->write_character(','); + } + + // last element + JSON_ASSERT(i != val.m_value.object->cend()); + JSON_ASSERT(std::next(i) == val.m_value.object->cend()); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\":", 2); + dump(i->second, false, ensure_ascii, indent_step, current_indent); + + o->write_character('}'); + } + + return; + } + + case value_t::array: + { + if (val.m_value.array->empty()) + { + o->write_characters("[]", 2); + return; + } + + if (pretty_print) + { + o->write_characters("[\n", 2); + + // variable to hold indentation for recursive calls + const auto new_indent = current_indent + indent_step; + if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent)) + { + indent_string.resize(indent_string.size() * 2, ' '); + } + + // first n-1 elements + for (auto i = val.m_value.array->cbegin(); + i != val.m_value.array->cend() - 1; ++i) + { + o->write_characters(indent_string.c_str(), new_indent); + dump(*i, true, ensure_ascii, indent_step, new_indent); + o->write_characters(",\n", 2); + } + + // last element + JSON_ASSERT(!val.m_value.array->empty()); + o->write_characters(indent_string.c_str(), new_indent); + dump(val.m_value.array->back(), true, ensure_ascii, indent_step, new_indent); + + o->write_character('\n'); + o->write_characters(indent_string.c_str(), current_indent); + o->write_character(']'); + } + else + { + o->write_character('['); + + // first n-1 elements + for (auto i = val.m_value.array->cbegin(); + i != val.m_value.array->cend() - 1; ++i) + { + dump(*i, false, ensure_ascii, indent_step, current_indent); + o->write_character(','); + } + + // last element + JSON_ASSERT(!val.m_value.array->empty()); + dump(val.m_value.array->back(), false, ensure_ascii, indent_step, current_indent); + + o->write_character(']'); + } + + return; + } + + case value_t::string: + { + o->write_character('\"'); + dump_escaped(*val.m_value.string, ensure_ascii); + o->write_character('\"'); + return; + } + + case value_t::binary: + { + if (pretty_print) + { + o->write_characters("{\n", 2); + + // variable to hold indentation for recursive calls + const auto new_indent = current_indent + indent_step; + if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent)) + { + indent_string.resize(indent_string.size() * 2, ' '); + } + + o->write_characters(indent_string.c_str(), new_indent); + + o->write_characters("\"bytes\": [", 10); + + if (!val.m_value.binary->empty()) + { + for (auto i = val.m_value.binary->cbegin(); + i != val.m_value.binary->cend() - 1; ++i) + { + dump_integer(*i); + o->write_characters(", ", 2); + } + dump_integer(val.m_value.binary->back()); + } + + o->write_characters("],\n", 3); + o->write_characters(indent_string.c_str(), new_indent); + + o->write_characters("\"subtype\": ", 11); + if (val.m_value.binary->has_subtype()) + { + dump_integer(val.m_value.binary->subtype()); + } + else + { + o->write_characters("null", 4); + } + o->write_character('\n'); + o->write_characters(indent_string.c_str(), current_indent); + o->write_character('}'); + } + else + { + o->write_characters("{\"bytes\":[", 10); + + if (!val.m_value.binary->empty()) + { + for (auto i = val.m_value.binary->cbegin(); + i != val.m_value.binary->cend() - 1; ++i) + { + dump_integer(*i); + o->write_character(','); + } + dump_integer(val.m_value.binary->back()); + } + + o->write_characters("],\"subtype\":", 12); + if (val.m_value.binary->has_subtype()) + { + dump_integer(val.m_value.binary->subtype()); + o->write_character('}'); + } + else + { + o->write_characters("null}", 5); + } + } + return; + } + + case value_t::boolean: + { + if (val.m_value.boolean) + { + o->write_characters("true", 4); + } + else + { + o->write_characters("false", 5); + } + return; + } + + case value_t::number_integer: + { + dump_integer(val.m_value.number_integer); + return; + } + + case value_t::number_unsigned: + { + dump_integer(val.m_value.number_unsigned); + return; + } + + case value_t::number_float: + { + dump_float(val.m_value.number_float); + return; + } + + case value_t::discarded: + { + o->write_characters("", 11); + return; + } + + case value_t::null: + { + o->write_characters("null", 4); + return; + } + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + } + + private: + /*! + @brief dump escaped string + + Escape a string by replacing certain special characters by a sequence of an + escape character (backslash) and another character and other control + characters by a sequence of "\u" followed by a four-digit hex + representation. The escaped string is written to output stream @a o. + + @param[in] s the string to escape + @param[in] ensure_ascii whether to escape non-ASCII characters with + \uXXXX sequences + + @complexity Linear in the length of string @a s. + */ + void dump_escaped(const string_t& s, const bool ensure_ascii) + { + std::uint32_t codepoint; + std::uint8_t state = UTF8_ACCEPT; + std::size_t bytes = 0; // number of bytes written to string_buffer + + // number of bytes written at the point of the last valid byte + std::size_t bytes_after_last_accept = 0; + std::size_t undumped_chars = 0; + + for (std::size_t i = 0; i < s.size(); ++i) + { + const auto byte = static_cast(s[i]); + + switch (decode(state, codepoint, byte)) + { + case UTF8_ACCEPT: // decode found a new code point + { + switch (codepoint) + { + case 0x08: // backspace + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'b'; + break; + } + + case 0x09: // horizontal tab + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 't'; + break; + } + + case 0x0A: // newline + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'n'; + break; + } + + case 0x0C: // formfeed + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'f'; + break; + } + + case 0x0D: // carriage return + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'r'; + break; + } + + case 0x22: // quotation mark + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = '\"'; + break; + } + + case 0x5C: // reverse solidus + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = '\\'; + break; + } + + default: + { + // escape control characters (0x00..0x1F) or, if + // ensure_ascii parameter is used, non-ASCII characters + if ((codepoint <= 0x1F) || (ensure_ascii && (codepoint >= 0x7F))) + { + if (codepoint <= 0xFFFF) + { + (std::snprintf)(string_buffer.data() + bytes, 7, "\\u%04x", + static_cast(codepoint)); + bytes += 6; + } + else + { + (std::snprintf)(string_buffer.data() + bytes, 13, "\\u%04x\\u%04x", + static_cast(0xD7C0u + (codepoint >> 10u)), + static_cast(0xDC00u + (codepoint & 0x3FFu))); + bytes += 12; + } + } + else + { + // copy byte to buffer (all previous bytes + // been copied have in default case above) + string_buffer[bytes++] = s[i]; + } + break; + } + } + + // write buffer and reset index; there must be 13 bytes + // left, as this is the maximal number of bytes to be + // written ("\uxxxx\uxxxx\0") for one code point + if (string_buffer.size() - bytes < 13) + { + o->write_characters(string_buffer.data(), bytes); + bytes = 0; + } + + // remember the byte position of this accept + bytes_after_last_accept = bytes; + undumped_chars = 0; + break; + } + + case UTF8_REJECT: // decode found invalid UTF-8 byte + { + switch (error_handler) + { + case error_handler_t::strict: + { + std::string sn(3, '\0'); + (std::snprintf)(&sn[0], sn.size(), "%.2X", byte); + JSON_THROW(type_error::create(316, "invalid UTF-8 byte at index " + std::to_string(i) + ": 0x" + sn)); + } + + case error_handler_t::ignore: + case error_handler_t::replace: + { + // in case we saw this character the first time, we + // would like to read it again, because the byte + // may be OK for itself, but just not OK for the + // previous sequence + if (undumped_chars > 0) + { + --i; + } + + // reset length buffer to the last accepted index; + // thus removing/ignoring the invalid characters + bytes = bytes_after_last_accept; + + if (error_handler == error_handler_t::replace) + { + // add a replacement character + if (ensure_ascii) + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'u'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'd'; + } + else + { + string_buffer[bytes++] = detail::binary_writer::to_char_type('\xEF'); + string_buffer[bytes++] = detail::binary_writer::to_char_type('\xBF'); + string_buffer[bytes++] = detail::binary_writer::to_char_type('\xBD'); + } + + // write buffer and reset index; there must be 13 bytes + // left, as this is the maximal number of bytes to be + // written ("\uxxxx\uxxxx\0") for one code point + if (string_buffer.size() - bytes < 13) + { + o->write_characters(string_buffer.data(), bytes); + bytes = 0; + } + + bytes_after_last_accept = bytes; + } + + undumped_chars = 0; + + // continue processing the string + state = UTF8_ACCEPT; + break; + } + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + break; + } + + default: // decode found yet incomplete multi-byte code point + { + if (!ensure_ascii) + { + // code point will not be escaped - copy byte to buffer + string_buffer[bytes++] = s[i]; + } + ++undumped_chars; + break; + } + } + } + + // we finished processing the string + if (JSON_HEDLEY_LIKELY(state == UTF8_ACCEPT)) + { + // write buffer + if (bytes > 0) + { + o->write_characters(string_buffer.data(), bytes); + } + } + else + { + // we finish reading, but do not accept: string was incomplete + switch (error_handler) + { + case error_handler_t::strict: + { + std::string sn(3, '\0'); + (std::snprintf)(&sn[0], sn.size(), "%.2X", static_cast(s.back())); + JSON_THROW(type_error::create(316, "incomplete UTF-8 string; last byte: 0x" + sn)); + } + + case error_handler_t::ignore: + { + // write all accepted bytes + o->write_characters(string_buffer.data(), bytes_after_last_accept); + break; + } + + case error_handler_t::replace: + { + // write all accepted bytes + o->write_characters(string_buffer.data(), bytes_after_last_accept); + // add a replacement character + if (ensure_ascii) + { + o->write_characters("\\ufffd", 6); + } + else + { + o->write_characters("\xEF\xBF\xBD", 3); + } + break; + } + + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + } + } + + /*! + @brief count digits + + Count the number of decimal (base 10) digits for an input unsigned integer. + + @param[in] x unsigned integer number to count its digits + @return number of decimal digits + */ + inline unsigned int count_digits(number_unsigned_t x) noexcept + { + unsigned int n_digits = 1; + for (;;) + { + if (x < 10) + { + return n_digits; + } + if (x < 100) + { + return n_digits + 1; + } + if (x < 1000) + { + return n_digits + 2; + } + if (x < 10000) + { + return n_digits + 3; + } + x = x / 10000u; + n_digits += 4; + } + } + + /*! + @brief dump an integer + + Dump a given integer to output stream @a o. Works internally with + @a number_buffer. + + @param[in] x integer number (signed or unsigned) to dump + @tparam NumberType either @a number_integer_t or @a number_unsigned_t + */ + template < typename NumberType, detail::enable_if_t < + std::is_same::value || + std::is_same::value || + std::is_same::value, + int > = 0 > + void dump_integer(NumberType x) + { + static constexpr std::array, 100> digits_to_99 + { + { + {{'0', '0'}}, {{'0', '1'}}, {{'0', '2'}}, {{'0', '3'}}, {{'0', '4'}}, {{'0', '5'}}, {{'0', '6'}}, {{'0', '7'}}, {{'0', '8'}}, {{'0', '9'}}, + {{'1', '0'}}, {{'1', '1'}}, {{'1', '2'}}, {{'1', '3'}}, {{'1', '4'}}, {{'1', '5'}}, {{'1', '6'}}, {{'1', '7'}}, {{'1', '8'}}, {{'1', '9'}}, + {{'2', '0'}}, {{'2', '1'}}, {{'2', '2'}}, {{'2', '3'}}, {{'2', '4'}}, {{'2', '5'}}, {{'2', '6'}}, {{'2', '7'}}, {{'2', '8'}}, {{'2', '9'}}, + {{'3', '0'}}, {{'3', '1'}}, {{'3', '2'}}, {{'3', '3'}}, {{'3', '4'}}, {{'3', '5'}}, {{'3', '6'}}, {{'3', '7'}}, {{'3', '8'}}, {{'3', '9'}}, + {{'4', '0'}}, {{'4', '1'}}, {{'4', '2'}}, {{'4', '3'}}, {{'4', '4'}}, {{'4', '5'}}, {{'4', '6'}}, {{'4', '7'}}, {{'4', '8'}}, {{'4', '9'}}, + {{'5', '0'}}, {{'5', '1'}}, {{'5', '2'}}, {{'5', '3'}}, {{'5', '4'}}, {{'5', '5'}}, {{'5', '6'}}, {{'5', '7'}}, {{'5', '8'}}, {{'5', '9'}}, + {{'6', '0'}}, {{'6', '1'}}, {{'6', '2'}}, {{'6', '3'}}, {{'6', '4'}}, {{'6', '5'}}, {{'6', '6'}}, {{'6', '7'}}, {{'6', '8'}}, {{'6', '9'}}, + {{'7', '0'}}, {{'7', '1'}}, {{'7', '2'}}, {{'7', '3'}}, {{'7', '4'}}, {{'7', '5'}}, {{'7', '6'}}, {{'7', '7'}}, {{'7', '8'}}, {{'7', '9'}}, + {{'8', '0'}}, {{'8', '1'}}, {{'8', '2'}}, {{'8', '3'}}, {{'8', '4'}}, {{'8', '5'}}, {{'8', '6'}}, {{'8', '7'}}, {{'8', '8'}}, {{'8', '9'}}, + {{'9', '0'}}, {{'9', '1'}}, {{'9', '2'}}, {{'9', '3'}}, {{'9', '4'}}, {{'9', '5'}}, {{'9', '6'}}, {{'9', '7'}}, {{'9', '8'}}, {{'9', '9'}}, + } + }; + + // special case for "0" + if (x == 0) + { + o->write_character('0'); + return; + } + + // use a pointer to fill the buffer + auto buffer_ptr = number_buffer.begin(); + + const bool is_negative = std::is_same::value && !(x >= 0); // see issue #755 + number_unsigned_t abs_value; + + unsigned int n_chars; + + if (is_negative) + { + *buffer_ptr = '-'; + abs_value = remove_sign(static_cast(x)); + + // account one more byte for the minus sign + n_chars = 1 + count_digits(abs_value); + } + else + { + abs_value = static_cast(x); + n_chars = count_digits(abs_value); + } + + // spare 1 byte for '\0' + JSON_ASSERT(n_chars < number_buffer.size() - 1); + + // jump to the end to generate the string from backward + // so we later avoid reversing the result + buffer_ptr += n_chars; + + // Fast int2ascii implementation inspired by "Fastware" talk by Andrei Alexandrescu + // See: https://www.youtube.com/watch?v=o4-CwDo2zpg + while (abs_value >= 100) + { + const auto digits_index = static_cast((abs_value % 100)); + abs_value /= 100; + *(--buffer_ptr) = digits_to_99[digits_index][1]; + *(--buffer_ptr) = digits_to_99[digits_index][0]; + } + + if (abs_value >= 10) + { + const auto digits_index = static_cast(abs_value); + *(--buffer_ptr) = digits_to_99[digits_index][1]; + *(--buffer_ptr) = digits_to_99[digits_index][0]; + } + else + { + *(--buffer_ptr) = static_cast('0' + abs_value); + } + + o->write_characters(number_buffer.data(), n_chars); + } + + /*! + @brief dump a floating-point number + + Dump a given floating-point number to output stream @a o. Works internally + with @a number_buffer. + + @param[in] x floating-point number to dump + */ + void dump_float(number_float_t x) + { + // NaN / inf + if (!std::isfinite(x)) + { + o->write_characters("null", 4); + return; + } + + // If number_float_t is an IEEE-754 single or double precision number, + // use the Grisu2 algorithm to produce short numbers which are + // guaranteed to round-trip, using strtof and strtod, resp. + // + // NB: The test below works if == . + static constexpr bool is_ieee_single_or_double + = (std::numeric_limits::is_iec559 && std::numeric_limits::digits == 24 && std::numeric_limits::max_exponent == 128) || + (std::numeric_limits::is_iec559 && std::numeric_limits::digits == 53 && std::numeric_limits::max_exponent == 1024); + + dump_float(x, std::integral_constant()); + } + + void dump_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/) + { + char* begin = number_buffer.data(); + char* end = ::nlohmann::detail::to_chars(begin, begin + number_buffer.size(), x); + + o->write_characters(begin, static_cast(end - begin)); + } + + void dump_float(number_float_t x, std::false_type /*is_ieee_single_or_double*/) + { + // get number of digits for a float -> text -> float round-trip + static constexpr auto d = std::numeric_limits::max_digits10; + + // the actual conversion + std::ptrdiff_t len = (std::snprintf)(number_buffer.data(), number_buffer.size(), "%.*g", d, x); + + // negative value indicates an error + JSON_ASSERT(len > 0); + // check if buffer was large enough + JSON_ASSERT(static_cast(len) < number_buffer.size()); + + // erase thousands separator + if (thousands_sep != '\0') + { + const auto end = std::remove(number_buffer.begin(), + number_buffer.begin() + len, thousands_sep); + std::fill(end, number_buffer.end(), '\0'); + JSON_ASSERT((end - number_buffer.begin()) <= len); + len = (end - number_buffer.begin()); + } + + // convert decimal point to '.' + if (decimal_point != '\0' && decimal_point != '.') + { + const auto dec_pos = std::find(number_buffer.begin(), number_buffer.end(), decimal_point); + if (dec_pos != number_buffer.end()) + { + *dec_pos = '.'; + } + } + + o->write_characters(number_buffer.data(), static_cast(len)); + + // determine if need to append ".0" + const bool value_is_int_like = + std::none_of(number_buffer.begin(), number_buffer.begin() + len + 1, + [](char c) + { + return c == '.' || c == 'e'; + }); + + if (value_is_int_like) + { + o->write_characters(".0", 2); + } + } + + /*! + @brief check whether a string is UTF-8 encoded + + The function checks each byte of a string whether it is UTF-8 encoded. The + result of the check is stored in the @a state parameter. The function must + be called initially with state 0 (accept). State 1 means the string must + be rejected, because the current byte is not allowed. If the string is + completely processed, but the state is non-zero, the string ended + prematurely; that is, the last byte indicated more bytes should have + followed. + + @param[in,out] state the state of the decoding + @param[in,out] codep codepoint (valid only if resulting state is UTF8_ACCEPT) + @param[in] byte next byte to decode + @return new state + + @note The function has been edited: a std::array is used. + + @copyright Copyright (c) 2008-2009 Bjoern Hoehrmann + @sa http://bjoern.hoehrmann.de/utf-8/decoder/dfa/ + */ + static std::uint8_t decode(std::uint8_t& state, std::uint32_t& codep, const std::uint8_t byte) noexcept + { + static const std::array utf8d = + { + { + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 00..1F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20..3F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 40..5F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 60..7F + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, // 80..9F + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, // A0..BF + 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // C0..DF + 0xA, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x4, 0x3, 0x3, // E0..EF + 0xB, 0x6, 0x6, 0x6, 0x5, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, // F0..FF + 0x0, 0x1, 0x2, 0x3, 0x5, 0x8, 0x7, 0x1, 0x1, 0x1, 0x4, 0x6, 0x1, 0x1, 0x1, 0x1, // s0..s0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, // s1..s2 + 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, // s3..s4 + 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, // s5..s6 + 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // s7..s8 + } + }; + + const std::uint8_t type = utf8d[byte]; + + codep = (state != UTF8_ACCEPT) + ? (byte & 0x3fu) | (codep << 6u) + : (0xFFu >> type) & (byte); + + std::size_t index = 256u + static_cast(state) * 16u + static_cast(type); + JSON_ASSERT(index < 400); + state = utf8d[index]; + return state; + } + + /* + * Overload to make the compiler happy while it is instantiating + * dump_integer for number_unsigned_t. + * Must never be called. + */ + number_unsigned_t remove_sign(number_unsigned_t x) + { + JSON_ASSERT(false); // LCOV_EXCL_LINE + return x; // LCOV_EXCL_LINE + } + + /* + * Helper function for dump_integer + * + * This function takes a negative signed integer and returns its absolute + * value as unsigned integer. The plus/minus shuffling is necessary as we can + * not directly remove the sign of an arbitrary signed integer as the + * absolute values of INT_MIN and INT_MAX are usually not the same. See + * #1708 for details. + */ + inline number_unsigned_t remove_sign(number_integer_t x) noexcept + { + JSON_ASSERT(x < 0 && x < (std::numeric_limits::max)()); + return static_cast(-(x + 1)) + 1; + } + + private: + /// the output of the serializer + output_adapter_t o = nullptr; + + /// a (hopefully) large enough character buffer + std::array number_buffer{{}}; + + /// the locale + const std::lconv* loc = nullptr; + /// the locale's thousand separator character + const char thousands_sep = '\0'; + /// the locale's decimal point character + const char decimal_point = '\0'; + + /// string buffer + std::array string_buffer{{}}; + + /// the indentation character + const char indent_char; + /// the indentation string + string_t indent_string; + + /// error_handler how to react on decoding errors + const error_handler_t error_handler; +}; +} // namespace detail +} // namespace nlohmann + +// #include + +// #include + +// #include + + +#include // less +#include // allocator +#include // pair +#include // vector + +namespace nlohmann +{ + +/// ordered_map: a minimal map-like container that preserves insertion order +/// for use within nlohmann::basic_json +template , + class Allocator = std::allocator>> + struct ordered_map : std::vector, Allocator> +{ + using key_type = Key; + using mapped_type = T; + using Container = std::vector, Allocator>; + using typename Container::iterator; + using typename Container::const_iterator; + using typename Container::size_type; + using typename Container::value_type; + + // Explicit constructors instead of `using Container::Container` + // otherwise older compilers choke on it (GCC <= 5.5, xcode <= 9.4) + ordered_map(const Allocator& alloc = Allocator()) : Container{alloc} {} + template + ordered_map(It first, It last, const Allocator& alloc = Allocator()) + : Container{first, last, alloc} {} + ordered_map(std::initializer_list init, const Allocator& alloc = Allocator() ) + : Container{init, alloc} {} + + std::pair emplace(const key_type& key, T&& t) + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return {it, false}; + } + } + Container::emplace_back(key, t); + return {--this->end(), true}; + } + + T& operator[](const Key& key) + { + return emplace(key, T{}).first->second; + } + + const T& operator[](const Key& key) const + { + return at(key); + } + + T& at(const Key& key) + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return it->second; + } + } + + throw std::out_of_range("key not found"); + } + + const T& at(const Key& key) const + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return it->second; + } + } + + throw std::out_of_range("key not found"); + } + + size_type erase(const Key& key) + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + // Since we cannot move const Keys, re-construct them in place + for (auto next = it; ++next != this->end(); ++it) + { + it->~value_type(); // Destroy but keep allocation + new (&*it) value_type{std::move(*next)}; + } + Container::pop_back(); + return 1; + } + } + return 0; + } + + iterator erase(iterator pos) + { + auto it = pos; + + // Since we cannot move const Keys, re-construct them in place + for (auto next = it; ++next != this->end(); ++it) + { + it->~value_type(); // Destroy but keep allocation + new (&*it) value_type{std::move(*next)}; + } + Container::pop_back(); + return pos; + } + + size_type count(const Key& key) const + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return 1; + } + } + return 0; + } + + iterator find(const Key& key) + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return it; + } + } + return Container::end(); + } + + const_iterator find(const Key& key) const + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == key) + { + return it; + } + } + return Container::end(); + } + + std::pair insert( value_type&& value ) + { + return emplace(value.first, std::move(value.second)); + } + + std::pair insert( const value_type& value ) + { + for (auto it = this->begin(); it != this->end(); ++it) + { + if (it->first == value.first) + { + return {it, false}; + } + } + Container::push_back(value); + return {--this->end(), true}; + } +}; + +} // namespace nlohmann + + +/*! +@brief namespace for Niels Lohmann +@see https://github.com/nlohmann +@since version 1.0.0 +*/ +namespace nlohmann +{ + +/*! +@brief a class to store JSON values + +@tparam ObjectType type for JSON objects (`std::map` by default; will be used +in @ref object_t) +@tparam ArrayType type for JSON arrays (`std::vector` by default; will be used +in @ref array_t) +@tparam StringType type for JSON strings and object keys (`std::string` by +default; will be used in @ref string_t) +@tparam BooleanType type for JSON booleans (`bool` by default; will be used +in @ref boolean_t) +@tparam NumberIntegerType type for JSON integer numbers (`int64_t` by +default; will be used in @ref number_integer_t) +@tparam NumberUnsignedType type for JSON unsigned integer numbers (@c +`uint64_t` by default; will be used in @ref number_unsigned_t) +@tparam NumberFloatType type for JSON floating-point numbers (`double` by +default; will be used in @ref number_float_t) +@tparam BinaryType type for packed binary data for compatibility with binary +serialization formats (`std::vector` by default; will be used in +@ref binary_t) +@tparam AllocatorType type of the allocator to use (`std::allocator` by +default) +@tparam JSONSerializer the serializer to resolve internal calls to `to_json()` +and `from_json()` (@ref adl_serializer by default) + +@requirement The class satisfies the following concept requirements: +- Basic + - [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible): + JSON values can be default constructed. The result will be a JSON null + value. + - [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible): + A JSON value can be constructed from an rvalue argument. + - [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible): + A JSON value can be copy-constructed from an lvalue expression. + - [MoveAssignable](https://en.cppreference.com/w/cpp/named_req/MoveAssignable): + A JSON value van be assigned from an rvalue argument. + - [CopyAssignable](https://en.cppreference.com/w/cpp/named_req/CopyAssignable): + A JSON value can be copy-assigned from an lvalue expression. + - [Destructible](https://en.cppreference.com/w/cpp/named_req/Destructible): + JSON values can be destructed. +- Layout + - [StandardLayoutType](https://en.cppreference.com/w/cpp/named_req/StandardLayoutType): + JSON values have + [standard layout](https://en.cppreference.com/w/cpp/language/data_members#Standard_layout): + All non-static data members are private and standard layout types, the + class has no virtual functions or (virtual) base classes. +- Library-wide + - [EqualityComparable](https://en.cppreference.com/w/cpp/named_req/EqualityComparable): + JSON values can be compared with `==`, see @ref + operator==(const_reference,const_reference). + - [LessThanComparable](https://en.cppreference.com/w/cpp/named_req/LessThanComparable): + JSON values can be compared with `<`, see @ref + operator<(const_reference,const_reference). + - [Swappable](https://en.cppreference.com/w/cpp/named_req/Swappable): + Any JSON lvalue or rvalue of can be swapped with any lvalue or rvalue of + other compatible types, using unqualified function call @ref swap(). + - [NullablePointer](https://en.cppreference.com/w/cpp/named_req/NullablePointer): + JSON values can be compared against `std::nullptr_t` objects which are used + to model the `null` value. +- Container + - [Container](https://en.cppreference.com/w/cpp/named_req/Container): + JSON values can be used like STL containers and provide iterator access. + - [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer); + JSON values can be used like STL containers and provide reverse iterator + access. + +@invariant The member variables @a m_value and @a m_type have the following +relationship: +- If `m_type == value_t::object`, then `m_value.object != nullptr`. +- If `m_type == value_t::array`, then `m_value.array != nullptr`. +- If `m_type == value_t::string`, then `m_value.string != nullptr`. +The invariants are checked by member function assert_invariant(). + +@internal +@note ObjectType trick from https://stackoverflow.com/a/9860911 +@endinternal + +@see [RFC 7159: The JavaScript Object Notation (JSON) Data Interchange +Format](http://rfc7159.net/rfc7159) + +@since version 1.0.0 + +@nosubgrouping +*/ +NLOHMANN_BASIC_JSON_TPL_DECLARATION +class basic_json +{ + private: + template friend struct detail::external_constructor; + friend ::nlohmann::json_pointer; + + template + friend class ::nlohmann::detail::parser; + friend ::nlohmann::detail::serializer; + template + friend class ::nlohmann::detail::iter_impl; + template + friend class ::nlohmann::detail::binary_writer; + template + friend class ::nlohmann::detail::binary_reader; + template + friend class ::nlohmann::detail::json_sax_dom_parser; + template + friend class ::nlohmann::detail::json_sax_dom_callback_parser; + + /// workaround type for MSVC + using basic_json_t = NLOHMANN_BASIC_JSON_TPL; + + // convenience aliases for types residing in namespace detail; + using lexer = ::nlohmann::detail::lexer_base; + + template + static ::nlohmann::detail::parser parser( + InputAdapterType adapter, + detail::parser_callback_tcb = nullptr, + const bool allow_exceptions = true, + const bool ignore_comments = false + ) + { + return ::nlohmann::detail::parser(std::move(adapter), + std::move(cb), allow_exceptions, ignore_comments); + } + + using primitive_iterator_t = ::nlohmann::detail::primitive_iterator_t; + template + using internal_iterator = ::nlohmann::detail::internal_iterator; + template + using iter_impl = ::nlohmann::detail::iter_impl; + template + using iteration_proxy = ::nlohmann::detail::iteration_proxy; + template using json_reverse_iterator = ::nlohmann::detail::json_reverse_iterator; + + template + using output_adapter_t = ::nlohmann::detail::output_adapter_t; + + template + using binary_reader = ::nlohmann::detail::binary_reader; + template using binary_writer = ::nlohmann::detail::binary_writer; + + using serializer = ::nlohmann::detail::serializer; + + public: + using value_t = detail::value_t; + /// JSON Pointer, see @ref nlohmann::json_pointer + using json_pointer = ::nlohmann::json_pointer; + template + using json_serializer = JSONSerializer; + /// how to treat decoding errors + using error_handler_t = detail::error_handler_t; + /// how to treat CBOR tags + using cbor_tag_handler_t = detail::cbor_tag_handler_t; + /// helper type for initializer lists of basic_json values + using initializer_list_t = std::initializer_list>; + + using input_format_t = detail::input_format_t; + /// SAX interface type, see @ref nlohmann::json_sax + using json_sax_t = json_sax; + + //////////////// + // exceptions // + //////////////// + + /// @name exceptions + /// Classes to implement user-defined exceptions. + /// @{ + + /// @copydoc detail::exception + using exception = detail::exception; + /// @copydoc detail::parse_error + using parse_error = detail::parse_error; + /// @copydoc detail::invalid_iterator + using invalid_iterator = detail::invalid_iterator; + /// @copydoc detail::type_error + using type_error = detail::type_error; + /// @copydoc detail::out_of_range + using out_of_range = detail::out_of_range; + /// @copydoc detail::other_error + using other_error = detail::other_error; + + /// @} + + + ///////////////////// + // container types // + ///////////////////// + + /// @name container types + /// The canonic container types to use @ref basic_json like any other STL + /// container. + /// @{ + + /// the type of elements in a basic_json container + using value_type = basic_json; + + /// the type of an element reference + using reference = value_type&; + /// the type of an element const reference + using const_reference = const value_type&; + + /// a type to represent differences between iterators + using difference_type = std::ptrdiff_t; + /// a type to represent container sizes + using size_type = std::size_t; + + /// the allocator type + using allocator_type = AllocatorType; + + /// the type of an element pointer + using pointer = typename std::allocator_traits::pointer; + /// the type of an element const pointer + using const_pointer = typename std::allocator_traits::const_pointer; + + /// an iterator for a basic_json container + using iterator = iter_impl; + /// a const iterator for a basic_json container + using const_iterator = iter_impl; + /// a reverse iterator for a basic_json container + using reverse_iterator = json_reverse_iterator; + /// a const reverse iterator for a basic_json container + using const_reverse_iterator = json_reverse_iterator; + + /// @} + + + /*! + @brief returns the allocator associated with the container + */ + static allocator_type get_allocator() + { + return allocator_type(); + } + + /*! + @brief returns version information on the library + + This function returns a JSON object with information about the library, + including the version number and information on the platform and compiler. + + @return JSON object holding version information + key | description + ----------- | --------------- + `compiler` | Information on the used compiler. It is an object with the following keys: `c++` (the used C++ standard), `family` (the compiler family; possible values are `clang`, `icc`, `gcc`, `ilecpp`, `msvc`, `pgcpp`, `sunpro`, and `unknown`), and `version` (the compiler version). + `copyright` | The copyright line for the library as string. + `name` | The name of the library as string. + `platform` | The used platform as string. Possible values are `win32`, `linux`, `apple`, `unix`, and `unknown`. + `url` | The URL of the project as string. + `version` | The version of the library. It is an object with the following keys: `major`, `minor`, and `patch` as defined by [Semantic Versioning](http://semver.org), and `string` (the version string). + + @liveexample{The following code shows an example output of the `meta()` + function.,meta} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @complexity Constant. + + @since 2.1.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json meta() + { + basic_json result; + + result["copyright"] = "(C) 2013-2020 Niels Lohmann"; + result["name"] = "JSON for Modern C++"; + result["url"] = "https://github.com/nlohmann/json"; + result["version"]["string"] = + std::to_string(NLOHMANN_JSON_VERSION_MAJOR) + "." + + std::to_string(NLOHMANN_JSON_VERSION_MINOR) + "." + + std::to_string(NLOHMANN_JSON_VERSION_PATCH); + result["version"]["major"] = NLOHMANN_JSON_VERSION_MAJOR; + result["version"]["minor"] = NLOHMANN_JSON_VERSION_MINOR; + result["version"]["patch"] = NLOHMANN_JSON_VERSION_PATCH; + +#ifdef _WIN32 + result["platform"] = "win32"; +#elif defined __linux__ + result["platform"] = "linux"; +#elif defined __APPLE__ + result["platform"] = "apple"; +#elif defined __unix__ + result["platform"] = "unix"; +#else + result["platform"] = "unknown"; +#endif + +#if defined(__ICC) || defined(__INTEL_COMPILER) + result["compiler"] = {{"family", "icc"}, {"version", __INTEL_COMPILER}}; +#elif defined(__clang__) + result["compiler"] = {{"family", "clang"}, {"version", __clang_version__}}; +#elif defined(__GNUC__) || defined(__GNUG__) + result["compiler"] = {{"family", "gcc"}, {"version", std::to_string(__GNUC__) + "." + std::to_string(__GNUC_MINOR__) + "." + std::to_string(__GNUC_PATCHLEVEL__)}}; +#elif defined(__HP_cc) || defined(__HP_aCC) + result["compiler"] = "hp" +#elif defined(__IBMCPP__) + result["compiler"] = {{"family", "ilecpp"}, {"version", __IBMCPP__}}; +#elif defined(_MSC_VER) + result["compiler"] = {{"family", "msvc"}, {"version", _MSC_VER}}; +#elif defined(__PGI) + result["compiler"] = {{"family", "pgcpp"}, {"version", __PGI}}; +#elif defined(__SUNPRO_CC) + result["compiler"] = {{"family", "sunpro"}, {"version", __SUNPRO_CC}}; +#else + result["compiler"] = {{"family", "unknown"}, {"version", "unknown"}}; +#endif + +#ifdef __cplusplus + result["compiler"]["c++"] = std::to_string(__cplusplus); +#else + result["compiler"]["c++"] = "unknown"; +#endif + return result; + } + + + /////////////////////////// + // JSON value data types // + /////////////////////////// + + /// @name JSON value data types + /// The data types to store a JSON value. These types are derived from + /// the template arguments passed to class @ref basic_json. + /// @{ + +#if defined(JSON_HAS_CPP_14) + // Use transparent comparator if possible, combined with perfect forwarding + // on find() and count() calls prevents unnecessary string construction. + using object_comparator_t = std::less<>; +#else + using object_comparator_t = std::less; +#endif + + /*! + @brief a type for an object + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON objects as follows: + > An object is an unordered collection of zero or more name/value pairs, + > where a name is a string and a value is a string, number, boolean, null, + > object, or array. + + To store objects in C++, a type is defined by the template parameters + described below. + + @tparam ObjectType the container to store objects (e.g., `std::map` or + `std::unordered_map`) + @tparam StringType the type of the keys or names (e.g., `std::string`). + The comparison function `std::less` is used to order elements + inside the container. + @tparam AllocatorType the allocator to use for objects (e.g., + `std::allocator`) + + #### Default type + + With the default values for @a ObjectType (`std::map`), @a StringType + (`std::string`), and @a AllocatorType (`std::allocator`), the default + value for @a object_t is: + + @code {.cpp} + std::map< + std::string, // key_type + basic_json, // value_type + std::less, // key_compare + std::allocator> // allocator_type + > + @endcode + + #### Behavior + + The choice of @a object_t influences the behavior of the JSON class. With + the default type, objects have the following behavior: + + - When all names are unique, objects will be interoperable in the sense + that all software implementations receiving that object will agree on + the name-value mappings. + - When the names within an object are not unique, it is unspecified which + one of the values for a given key will be chosen. For instance, + `{"key": 2, "key": 1}` could be equal to either `{"key": 1}` or + `{"key": 2}`. + - Internally, name/value pairs are stored in lexicographical order of the + names. Objects will also be serialized (see @ref dump) in this order. + For instance, `{"b": 1, "a": 2}` and `{"a": 2, "b": 1}` will be stored + and serialized as `{"a": 2, "b": 1}`. + - When comparing objects, the order of the name/value pairs is irrelevant. + This makes objects interoperable in the sense that they will not be + affected by these differences. For instance, `{"b": 1, "a": 2}` and + `{"a": 2, "b": 1}` will be treated as equal. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the maximum depth of nesting. + + In this class, the object's limit of nesting is not explicitly constrained. + However, a maximum depth of nesting may be introduced by the compiler or + runtime environment. A theoretical limit can be queried by calling the + @ref max_size function of a JSON object. + + #### Storage + + Objects are stored as pointers in a @ref basic_json type. That is, for any + access to object values, a pointer of type `object_t*` must be + dereferenced. + + @sa @ref array_t -- type for an array value + + @since version 1.0.0 + + @note The order name/value pairs are added to the object is *not* + preserved by the library. Therefore, iterating an object may return + name/value pairs in a different order than they were originally stored. In + fact, keys will be traversed in alphabetical order as `std::map` with + `std::less` is used by default. Please note this behavior conforms to [RFC + 7159](http://rfc7159.net/rfc7159), because any order implements the + specified "unordered" nature of JSON objects. + */ + using object_t = ObjectType>>; + + /*! + @brief a type for an array + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON arrays as follows: + > An array is an ordered sequence of zero or more values. + + To store objects in C++, a type is defined by the template parameters + explained below. + + @tparam ArrayType container type to store arrays (e.g., `std::vector` or + `std::list`) + @tparam AllocatorType allocator to use for arrays (e.g., `std::allocator`) + + #### Default type + + With the default values for @a ArrayType (`std::vector`) and @a + AllocatorType (`std::allocator`), the default value for @a array_t is: + + @code {.cpp} + std::vector< + basic_json, // value_type + std::allocator // allocator_type + > + @endcode + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the maximum depth of nesting. + + In this class, the array's limit of nesting is not explicitly constrained. + However, a maximum depth of nesting may be introduced by the compiler or + runtime environment. A theoretical limit can be queried by calling the + @ref max_size function of a JSON array. + + #### Storage + + Arrays are stored as pointers in a @ref basic_json type. That is, for any + access to array values, a pointer of type `array_t*` must be dereferenced. + + @sa @ref object_t -- type for an object value + + @since version 1.0.0 + */ + using array_t = ArrayType>; + + /*! + @brief a type for a string + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON strings as follows: + > A string is a sequence of zero or more Unicode characters. + + To store objects in C++, a type is defined by the template parameter + described below. Unicode values are split by the JSON class into + byte-sized characters during deserialization. + + @tparam StringType the container to store strings (e.g., `std::string`). + Note this container is used for keys/names in objects, see @ref object_t. + + #### Default type + + With the default values for @a StringType (`std::string`), the default + value for @a string_t is: + + @code {.cpp} + std::string + @endcode + + #### Encoding + + Strings are stored in UTF-8 encoding. Therefore, functions like + `std::string::size()` or `std::string::length()` return the number of + bytes in the string rather than the number of characters or glyphs. + + #### String comparison + + [RFC 7159](http://rfc7159.net/rfc7159) states: + > Software implementations are typically required to test names of object + > members for equality. Implementations that transform the textual + > representation into sequences of Unicode code units and then perform the + > comparison numerically, code unit by code unit, are interoperable in the + > sense that implementations will agree in all cases on equality or + > inequality of two strings. For example, implementations that compare + > strings with escaped characters unconverted may incorrectly find that + > `"a\\b"` and `"a\u005Cb"` are not equal. + + This implementation is interoperable as it does compare strings code unit + by code unit. + + #### Storage + + String values are stored as pointers in a @ref basic_json type. That is, + for any access to string values, a pointer of type `string_t*` must be + dereferenced. + + @since version 1.0.0 + */ + using string_t = StringType; + + /*! + @brief a type for a boolean + + [RFC 7159](http://rfc7159.net/rfc7159) implicitly describes a boolean as a + type which differentiates the two literals `true` and `false`. + + To store objects in C++, a type is defined by the template parameter @a + BooleanType which chooses the type to use. + + #### Default type + + With the default values for @a BooleanType (`bool`), the default value for + @a boolean_t is: + + @code {.cpp} + bool + @endcode + + #### Storage + + Boolean values are stored directly inside a @ref basic_json type. + + @since version 1.0.0 + */ + using boolean_t = BooleanType; + + /*! + @brief a type for a number (integer) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store integer numbers in C++, a type is defined by the template + parameter @a NumberIntegerType which chooses the type to use. + + #### Default type + + With the default values for @a NumberIntegerType (`int64_t`), the default + value for @a number_integer_t is: + + @code {.cpp} + int64_t + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in integer literals lead to an interpretation as octal + number. Internally, the value will be stored as decimal number. For + instance, the C++ integer literal `010` will be serialized to `8`. + During deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the range and precision of numbers. + + When the default type is used, the maximal integer number that can be + stored is `9223372036854775807` (INT64_MAX) and the minimal integer number + that can be stored is `-9223372036854775808` (INT64_MIN). Integer numbers + that are out of range will yield over/underflow when used in a + constructor. During deserialization, too large or small integer numbers + will be automatically be stored as @ref number_unsigned_t or @ref + number_float_t. + + [RFC 7159](http://rfc7159.net/rfc7159) further states: + > Note that when such software is used, numbers that are integers and are + > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense + > that implementations will agree exactly on their numeric values. + + As this range is a subrange of the exactly supported range [INT64_MIN, + INT64_MAX], this class's integer type is interoperable. + + #### Storage + + Integer number values are stored directly inside a @ref basic_json type. + + @sa @ref number_float_t -- type for number values (floating-point) + + @sa @ref number_unsigned_t -- type for number values (unsigned integer) + + @since version 1.0.0 + */ + using number_integer_t = NumberIntegerType; + + /*! + @brief a type for a number (unsigned) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store unsigned integer numbers in C++, a type is defined by the + template parameter @a NumberUnsignedType which chooses the type to use. + + #### Default type + + With the default values for @a NumberUnsignedType (`uint64_t`), the + default value for @a number_unsigned_t is: + + @code {.cpp} + uint64_t + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in integer literals lead to an interpretation as octal + number. Internally, the value will be stored as decimal number. For + instance, the C++ integer literal `010` will be serialized to `8`. + During deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the range and precision of numbers. + + When the default type is used, the maximal integer number that can be + stored is `18446744073709551615` (UINT64_MAX) and the minimal integer + number that can be stored is `0`. Integer numbers that are out of range + will yield over/underflow when used in a constructor. During + deserialization, too large or small integer numbers will be automatically + be stored as @ref number_integer_t or @ref number_float_t. + + [RFC 7159](http://rfc7159.net/rfc7159) further states: + > Note that when such software is used, numbers that are integers and are + > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense + > that implementations will agree exactly on their numeric values. + + As this range is a subrange (when considered in conjunction with the + number_integer_t type) of the exactly supported range [0, UINT64_MAX], + this class's integer type is interoperable. + + #### Storage + + Integer number values are stored directly inside a @ref basic_json type. + + @sa @ref number_float_t -- type for number values (floating-point) + @sa @ref number_integer_t -- type for number values (integer) + + @since version 2.0.0 + */ + using number_unsigned_t = NumberUnsignedType; + + /*! + @brief a type for a number (floating-point) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store floating-point numbers in C++, a type is defined by the template + parameter @a NumberFloatType which chooses the type to use. + + #### Default type + + With the default values for @a NumberFloatType (`double`), the default + value for @a number_float_t is: + + @code {.cpp} + double + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in floating-point literals will be ignored. Internally, + the value will be stored as decimal number. For instance, the C++ + floating-point literal `01.2` will be serialized to `1.2`. During + deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) states: + > This specification allows implementations to set limits on the range and + > precision of numbers accepted. Since software that implements IEEE + > 754-2008 binary64 (double precision) numbers is generally available and + > widely used, good interoperability can be achieved by implementations + > that expect no more precision or range than these provide, in the sense + > that implementations will approximate JSON numbers within the expected + > precision. + + This implementation does exactly follow this approach, as it uses double + precision floating-point numbers. Note values smaller than + `-1.79769313486232e+308` and values greater than `1.79769313486232e+308` + will be stored as NaN internally and be serialized to `null`. + + #### Storage + + Floating-point number values are stored directly inside a @ref basic_json + type. + + @sa @ref number_integer_t -- type for number values (integer) + + @sa @ref number_unsigned_t -- type for number values (unsigned integer) + + @since version 1.0.0 + */ + using number_float_t = NumberFloatType; + + /*! + @brief a type for a packed binary type + + This type is a type designed to carry binary data that appears in various + serialized formats, such as CBOR's Major Type 2, MessagePack's bin, and + BSON's generic binary subtype. This type is NOT a part of standard JSON and + exists solely for compatibility with these binary types. As such, it is + simply defined as an ordered sequence of zero or more byte values. + + Additionally, as an implementation detail, the subtype of the binary data is + carried around as a `std::uint8_t`, which is compatible with both of the + binary data formats that use binary subtyping, (though the specific + numbering is incompatible with each other, and it is up to the user to + translate between them). + + [CBOR's RFC 7049](https://tools.ietf.org/html/rfc7049) describes this type + as: + > Major type 2: a byte string. The string's length in bytes is represented + > following the rules for positive integers (major type 0). + + [MessagePack's documentation on the bin type + family](https://github.com/msgpack/msgpack/blob/master/spec.md#bin-format-family) + describes this type as: + > Bin format family stores an byte array in 2, 3, or 5 bytes of extra bytes + > in addition to the size of the byte array. + + [BSON's specifications](http://bsonspec.org/spec.html) describe several + binary types; however, this type is intended to represent the generic binary + type which has the description: + > Generic binary subtype - This is the most commonly used binary subtype and + > should be the 'default' for drivers and tools. + + None of these impose any limitations on the internal representation other + than the basic unit of storage be some type of array whose parts are + decomposable into bytes. + + The default representation of this binary format is a + `std::vector`, which is a very common way to represent a byte + array in modern C++. + + #### Default type + + The default values for @a BinaryType is `std::vector` + + #### Storage + + Binary Arrays are stored as pointers in a @ref basic_json type. That is, + for any access to array values, a pointer of the type `binary_t*` must be + dereferenced. + + #### Notes on subtypes + + - CBOR + - Binary values are represented as byte strings. No subtypes are + supported and will be ignored when CBOR is written. + - MessagePack + - If a subtype is given and the binary array contains exactly 1, 2, 4, 8, + or 16 elements, the fixext family (fixext1, fixext2, fixext4, fixext8) + is used. For other sizes, the ext family (ext8, ext16, ext32) is used. + The subtype is then added as singed 8-bit integer. + - If no subtype is given, the bin family (bin8, bin16, bin32) is used. + - BSON + - If a subtype is given, it is used and added as unsigned 8-bit integer. + - If no subtype is given, the generic binary subtype 0x00 is used. + + @sa @ref binary -- create a binary array + + @since version 3.8.0 + */ + using binary_t = nlohmann::byte_container_with_subtype; + /// @} + + private: + + /// helper for exception-safe object creation + template + JSON_HEDLEY_RETURNS_NON_NULL + static T* create(Args&& ... args) + { + AllocatorType alloc; + using AllocatorTraits = std::allocator_traits>; + + auto deleter = [&](T * object) + { + AllocatorTraits::deallocate(alloc, object, 1); + }; + std::unique_ptr object(AllocatorTraits::allocate(alloc, 1), deleter); + AllocatorTraits::construct(alloc, object.get(), std::forward(args)...); + JSON_ASSERT(object != nullptr); + return object.release(); + } + + //////////////////////// + // JSON value storage // + //////////////////////// + + /*! + @brief a JSON value + + The actual storage for a JSON value of the @ref basic_json class. This + union combines the different storage types for the JSON value types + defined in @ref value_t. + + JSON type | value_t type | used type + --------- | --------------- | ------------------------ + object | object | pointer to @ref object_t + array | array | pointer to @ref array_t + string | string | pointer to @ref string_t + boolean | boolean | @ref boolean_t + number | number_integer | @ref number_integer_t + number | number_unsigned | @ref number_unsigned_t + number | number_float | @ref number_float_t + binary | binary | pointer to @ref binary_t + null | null | *no value is stored* + + @note Variable-length types (objects, arrays, and strings) are stored as + pointers. The size of the union should not exceed 64 bits if the default + value types are used. + + @since version 1.0.0 + */ + union json_value + { + /// object (stored with pointer to save storage) + object_t* object; + /// array (stored with pointer to save storage) + array_t* array; + /// string (stored with pointer to save storage) + string_t* string; + /// binary (stored with pointer to save storage) + binary_t* binary; + /// boolean + boolean_t boolean; + /// number (integer) + number_integer_t number_integer; + /// number (unsigned integer) + number_unsigned_t number_unsigned; + /// number (floating-point) + number_float_t number_float; + + /// default constructor (for null values) + json_value() = default; + /// constructor for booleans + json_value(boolean_t v) noexcept : boolean(v) {} + /// constructor for numbers (integer) + json_value(number_integer_t v) noexcept : number_integer(v) {} + /// constructor for numbers (unsigned) + json_value(number_unsigned_t v) noexcept : number_unsigned(v) {} + /// constructor for numbers (floating-point) + json_value(number_float_t v) noexcept : number_float(v) {} + /// constructor for empty values of a given type + json_value(value_t t) + { + switch (t) + { + case value_t::object: + { + object = create(); + break; + } + + case value_t::array: + { + array = create(); + break; + } + + case value_t::string: + { + string = create(""); + break; + } + + case value_t::binary: + { + binary = create(); + break; + } + + case value_t::boolean: + { + boolean = boolean_t(false); + break; + } + + case value_t::number_integer: + { + number_integer = number_integer_t(0); + break; + } + + case value_t::number_unsigned: + { + number_unsigned = number_unsigned_t(0); + break; + } + + case value_t::number_float: + { + number_float = number_float_t(0.0); + break; + } + + case value_t::null: + { + object = nullptr; // silence warning, see #821 + break; + } + + default: + { + object = nullptr; // silence warning, see #821 + if (JSON_HEDLEY_UNLIKELY(t == value_t::null)) + { + JSON_THROW(other_error::create(500, "961c151d2e87f2686a955a9be24d316f1362bf21 3.9.1")); // LCOV_EXCL_LINE + } + break; + } + } + } + + /// constructor for strings + json_value(const string_t& value) + { + string = create(value); + } + + /// constructor for rvalue strings + json_value(string_t&& value) + { + string = create(std::move(value)); + } + + /// constructor for objects + json_value(const object_t& value) + { + object = create(value); + } + + /// constructor for rvalue objects + json_value(object_t&& value) + { + object = create(std::move(value)); + } + + /// constructor for arrays + json_value(const array_t& value) + { + array = create(value); + } + + /// constructor for rvalue arrays + json_value(array_t&& value) + { + array = create(std::move(value)); + } + + /// constructor for binary arrays + json_value(const typename binary_t::container_type& value) + { + binary = create(value); + } + + /// constructor for rvalue binary arrays + json_value(typename binary_t::container_type&& value) + { + binary = create(std::move(value)); + } + + /// constructor for binary arrays (internal type) + json_value(const binary_t& value) + { + binary = create(value); + } + + /// constructor for rvalue binary arrays (internal type) + json_value(binary_t&& value) + { + binary = create(std::move(value)); + } + + void destroy(value_t t) noexcept + { + // flatten the current json_value to a heap-allocated stack + std::vector stack; + + // move the top-level items to stack + if (t == value_t::array) + { + stack.reserve(array->size()); + std::move(array->begin(), array->end(), std::back_inserter(stack)); + } + else if (t == value_t::object) + { + stack.reserve(object->size()); + for (auto&& it : *object) + { + stack.push_back(std::move(it.second)); + } + } + + while (!stack.empty()) + { + // move the last item to local variable to be processed + basic_json current_item(std::move(stack.back())); + stack.pop_back(); + + // if current_item is array/object, move + // its children to the stack to be processed later + if (current_item.is_array()) + { + std::move(current_item.m_value.array->begin(), current_item.m_value.array->end(), + std::back_inserter(stack)); + + current_item.m_value.array->clear(); + } + else if (current_item.is_object()) + { + for (auto&& it : *current_item.m_value.object) + { + stack.push_back(std::move(it.second)); + } + + current_item.m_value.object->clear(); + } + + // it's now safe that current_item get destructed + // since it doesn't have any children + } + + switch (t) + { + case value_t::object: + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, object); + std::allocator_traits::deallocate(alloc, object, 1); + break; + } + + case value_t::array: + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, array); + std::allocator_traits::deallocate(alloc, array, 1); + break; + } + + case value_t::string: + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, string); + std::allocator_traits::deallocate(alloc, string, 1); + break; + } + + case value_t::binary: + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, binary); + std::allocator_traits::deallocate(alloc, binary, 1); + break; + } + + default: + { + break; + } + } + } + }; + + /*! + @brief checks the class invariants + + This function asserts the class invariants. It needs to be called at the + end of every constructor to make sure that created objects respect the + invariant. Furthermore, it has to be called each time the type of a JSON + value is changed, because the invariant expresses a relationship between + @a m_type and @a m_value. + */ + void assert_invariant() const noexcept + { + JSON_ASSERT(m_type != value_t::object || m_value.object != nullptr); + JSON_ASSERT(m_type != value_t::array || m_value.array != nullptr); + JSON_ASSERT(m_type != value_t::string || m_value.string != nullptr); + JSON_ASSERT(m_type != value_t::binary || m_value.binary != nullptr); + } + + public: + ////////////////////////// + // JSON parser callback // + ////////////////////////// + + /*! + @brief parser event types + + The parser callback distinguishes the following events: + - `object_start`: the parser read `{` and started to process a JSON object + - `key`: the parser read a key of a value in an object + - `object_end`: the parser read `}` and finished processing a JSON object + - `array_start`: the parser read `[` and started to process a JSON array + - `array_end`: the parser read `]` and finished processing a JSON array + - `value`: the parser finished reading a JSON value + + @image html callback_events.png "Example when certain parse events are triggered" + + @sa @ref parser_callback_t for more information and examples + */ + using parse_event_t = detail::parse_event_t; + + /*! + @brief per-element parser callback type + + With a parser callback function, the result of parsing a JSON text can be + influenced. When passed to @ref parse, it is called on certain events + (passed as @ref parse_event_t via parameter @a event) with a set recursion + depth @a depth and context JSON value @a parsed. The return value of the + callback function is a boolean indicating whether the element that emitted + the callback shall be kept or not. + + We distinguish six scenarios (determined by the event type) in which the + callback function can be called. The following table describes the values + of the parameters @a depth, @a event, and @a parsed. + + parameter @a event | description | parameter @a depth | parameter @a parsed + ------------------ | ----------- | ------------------ | ------------------- + parse_event_t::object_start | the parser read `{` and started to process a JSON object | depth of the parent of the JSON object | a JSON value with type discarded + parse_event_t::key | the parser read a key of a value in an object | depth of the currently parsed JSON object | a JSON string containing the key + parse_event_t::object_end | the parser read `}` and finished processing a JSON object | depth of the parent of the JSON object | the parsed JSON object + parse_event_t::array_start | the parser read `[` and started to process a JSON array | depth of the parent of the JSON array | a JSON value with type discarded + parse_event_t::array_end | the parser read `]` and finished processing a JSON array | depth of the parent of the JSON array | the parsed JSON array + parse_event_t::value | the parser finished reading a JSON value | depth of the value | the parsed JSON value + + @image html callback_events.png "Example when certain parse events are triggered" + + Discarding a value (i.e., returning `false`) has different effects + depending on the context in which function was called: + + - Discarded values in structured types are skipped. That is, the parser + will behave as if the discarded value was never read. + - In case a value outside a structured type is skipped, it is replaced + with `null`. This case happens if the top-level element is skipped. + + @param[in] depth the depth of the recursion during parsing + + @param[in] event an event of type parse_event_t indicating the context in + the callback function has been called + + @param[in,out] parsed the current intermediate parse result; note that + writing to this value has no effect for parse_event_t::key events + + @return Whether the JSON value which called the function during parsing + should be kept (`true`) or not (`false`). In the latter case, it is either + skipped completely or replaced by an empty discarded object. + + @sa @ref parse for examples + + @since version 1.0.0 + */ + using parser_callback_t = detail::parser_callback_t; + + ////////////////// + // constructors // + ////////////////// + + /// @name constructors and destructors + /// Constructors of class @ref basic_json, copy/move constructor, copy + /// assignment, static functions creating objects, and the destructor. + /// @{ + + /*! + @brief create an empty value with a given type + + Create an empty JSON value with a given type. The value will be default + initialized with an empty value which depends on the type: + + Value type | initial value + ----------- | ------------- + null | `null` + boolean | `false` + string | `""` + number | `0` + object | `{}` + array | `[]` + binary | empty array + + @param[in] v the type of the value to create + + @complexity Constant. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows the constructor for different @ref + value_t values,basic_json__value_t} + + @sa @ref clear() -- restores the postcondition of this constructor + + @since version 1.0.0 + */ + basic_json(const value_t v) + : m_type(v), m_value(v) + { + assert_invariant(); + } + + /*! + @brief create a null object + + Create a `null` JSON value. It either takes a null pointer as parameter + (explicitly creating `null`) or no parameter (implicitly creating `null`). + The passed null pointer itself is not read -- it is only used to choose + the right constructor. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this constructor never throws + exceptions. + + @liveexample{The following code shows the constructor with and without a + null pointer parameter.,basic_json__nullptr_t} + + @since version 1.0.0 + */ + basic_json(std::nullptr_t = nullptr) noexcept + : basic_json(value_t::null) + { + assert_invariant(); + } + + /*! + @brief create a JSON value + + This is a "catch all" constructor for all compatible JSON types; that is, + types for which a `to_json()` method exists. The constructor forwards the + parameter @a val to that method (to `json_serializer::to_json` method + with `U = uncvref_t`, to be exact). + + Template type @a CompatibleType includes, but is not limited to, the + following types: + - **arrays**: @ref array_t and all kinds of compatible containers such as + `std::vector`, `std::deque`, `std::list`, `std::forward_list`, + `std::array`, `std::valarray`, `std::set`, `std::unordered_set`, + `std::multiset`, and `std::unordered_multiset` with a `value_type` from + which a @ref basic_json value can be constructed. + - **objects**: @ref object_t and all kinds of compatible associative + containers such as `std::map`, `std::unordered_map`, `std::multimap`, + and `std::unordered_multimap` with a `key_type` compatible to + @ref string_t and a `value_type` from which a @ref basic_json value can + be constructed. + - **strings**: @ref string_t, string literals, and all compatible string + containers can be used. + - **numbers**: @ref number_integer_t, @ref number_unsigned_t, + @ref number_float_t, and all convertible number types such as `int`, + `size_t`, `int64_t`, `float` or `double` can be used. + - **boolean**: @ref boolean_t / `bool` can be used. + - **binary**: @ref binary_t / `std::vector` may be used, + unfortunately because string literals cannot be distinguished from binary + character arrays by the C++ type system, all types compatible with `const + char*` will be directed to the string constructor instead. This is both + for backwards compatibility, and due to the fact that a binary type is not + a standard JSON type. + + See the examples below. + + @tparam CompatibleType a type such that: + - @a CompatibleType is not derived from `std::istream`, + - @a CompatibleType is not @ref basic_json (to avoid hijacking copy/move + constructors), + - @a CompatibleType is not a different @ref basic_json type (i.e. with different template arguments) + - @a CompatibleType is not a @ref basic_json nested type (e.g., + @ref json_pointer, @ref iterator, etc ...) + - @ref @ref json_serializer has a + `to_json(basic_json_t&, CompatibleType&&)` method + + @tparam U = `uncvref_t` + + @param[in] val the value to be forwarded to the respective constructor + + @complexity Usually linear in the size of the passed @a val, also + depending on the implementation of the called `to_json()` + method. + + @exceptionsafety Depends on the called constructor. For types directly + supported by the library (i.e., all types for which no `to_json()` function + was provided), strong guarantee holds: if an exception is thrown, there are + no changes to any JSON value. + + @liveexample{The following code shows the constructor with several + compatible types.,basic_json__CompatibleType} + + @since version 2.1.0 + */ + template < typename CompatibleType, + typename U = detail::uncvref_t, + detail::enable_if_t < + !detail::is_basic_json::value && detail::is_compatible_type::value, int > = 0 > + basic_json(CompatibleType && val) noexcept(noexcept( + JSONSerializer::to_json(std::declval(), + std::forward(val)))) + { + JSONSerializer::to_json(*this, std::forward(val)); + assert_invariant(); + } + + /*! + @brief create a JSON value from an existing one + + This is a constructor for existing @ref basic_json types. + It does not hijack copy/move constructors, since the parameter has different + template arguments than the current ones. + + The constructor tries to convert the internal @ref m_value of the parameter. + + @tparam BasicJsonType a type such that: + - @a BasicJsonType is a @ref basic_json type. + - @a BasicJsonType has different template arguments than @ref basic_json_t. + + @param[in] val the @ref basic_json value to be converted. + + @complexity Usually linear in the size of the passed @a val, also + depending on the implementation of the called `to_json()` + method. + + @exceptionsafety Depends on the called constructor. For types directly + supported by the library (i.e., all types for which no `to_json()` function + was provided), strong guarantee holds: if an exception is thrown, there are + no changes to any JSON value. + + @since version 3.2.0 + */ + template < typename BasicJsonType, + detail::enable_if_t < + detail::is_basic_json::value&& !std::is_same::value, int > = 0 > + basic_json(const BasicJsonType& val) + { + using other_boolean_t = typename BasicJsonType::boolean_t; + using other_number_float_t = typename BasicJsonType::number_float_t; + using other_number_integer_t = typename BasicJsonType::number_integer_t; + using other_number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using other_string_t = typename BasicJsonType::string_t; + using other_object_t = typename BasicJsonType::object_t; + using other_array_t = typename BasicJsonType::array_t; + using other_binary_t = typename BasicJsonType::binary_t; + + switch (val.type()) + { + case value_t::boolean: + JSONSerializer::to_json(*this, val.template get()); + break; + case value_t::number_float: + JSONSerializer::to_json(*this, val.template get()); + break; + case value_t::number_integer: + JSONSerializer::to_json(*this, val.template get()); + break; + case value_t::number_unsigned: + JSONSerializer::to_json(*this, val.template get()); + break; + case value_t::string: + JSONSerializer::to_json(*this, val.template get_ref()); + break; + case value_t::object: + JSONSerializer::to_json(*this, val.template get_ref()); + break; + case value_t::array: + JSONSerializer::to_json(*this, val.template get_ref()); + break; + case value_t::binary: + JSONSerializer::to_json(*this, val.template get_ref()); + break; + case value_t::null: + *this = nullptr; + break; + case value_t::discarded: + m_type = value_t::discarded; + break; + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + assert_invariant(); + } + + /*! + @brief create a container (array or object) from an initializer list + + Creates a JSON value of type array or object from the passed initializer + list @a init. In case @a type_deduction is `true` (default), the type of + the JSON value to be created is deducted from the initializer list @a init + according to the following rules: + + 1. If the list is empty, an empty JSON object value `{}` is created. + 2. If the list consists of pairs whose first element is a string, a JSON + object value is created where the first elements of the pairs are + treated as keys and the second elements are as values. + 3. In all other cases, an array is created. + + The rules aim to create the best fit between a C++ initializer list and + JSON values. The rationale is as follows: + + 1. The empty initializer list is written as `{}` which is exactly an empty + JSON object. + 2. C++ has no way of describing mapped types other than to list a list of + pairs. As JSON requires that keys must be of type string, rule 2 is the + weakest constraint one can pose on initializer lists to interpret them + as an object. + 3. In all other cases, the initializer list could not be interpreted as + JSON object type, so interpreting it as JSON array type is safe. + + With the rules described above, the following JSON values cannot be + expressed by an initializer list: + + - the empty array (`[]`): use @ref array(initializer_list_t) + with an empty initializer list in this case + - arrays whose elements satisfy rule 2: use @ref + array(initializer_list_t) with the same initializer list + in this case + + @note When used without parentheses around an empty initializer list, @ref + basic_json() is called instead of this function, yielding the JSON null + value. + + @param[in] init initializer list with JSON values + + @param[in] type_deduction internal parameter; when set to `true`, the type + of the JSON value is deducted from the initializer list @a init; when set + to `false`, the type provided via @a manual_type is forced. This mode is + used by the functions @ref array(initializer_list_t) and + @ref object(initializer_list_t). + + @param[in] manual_type internal parameter; when @a type_deduction is set + to `false`, the created JSON value will use the provided type (only @ref + value_t::array and @ref value_t::object are valid); when @a type_deduction + is set to `true`, this parameter has no effect + + @throw type_error.301 if @a type_deduction is `false`, @a manual_type is + `value_t::object`, but @a init contains an element which is not a pair + whose first element is a string. In this case, the constructor could not + create an object. If @a type_deduction would have be `true`, an array + would have been created. See @ref object(initializer_list_t) + for an example. + + @complexity Linear in the size of the initializer list @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The example below shows how JSON values are created from + initializer lists.,basic_json__list_init_t} + + @sa @ref array(initializer_list_t) -- create a JSON array + value from an initializer list + @sa @ref object(initializer_list_t) -- create a JSON object + value from an initializer list + + @since version 1.0.0 + */ + basic_json(initializer_list_t init, + bool type_deduction = true, + value_t manual_type = value_t::array) + { + // check if each element is an array with two elements whose first + // element is a string + bool is_an_object = std::all_of(init.begin(), init.end(), + [](const detail::json_ref& element_ref) + { + return element_ref->is_array() && element_ref->size() == 2 && (*element_ref)[0].is_string(); + }); + + // adjust type if type deduction is not wanted + if (!type_deduction) + { + // if array is wanted, do not create an object though possible + if (manual_type == value_t::array) + { + is_an_object = false; + } + + // if object is wanted but impossible, throw an exception + if (JSON_HEDLEY_UNLIKELY(manual_type == value_t::object && !is_an_object)) + { + JSON_THROW(type_error::create(301, "cannot create object from initializer list")); + } + } + + if (is_an_object) + { + // the initializer list is a list of pairs -> create object + m_type = value_t::object; + m_value = value_t::object; + + std::for_each(init.begin(), init.end(), [this](const detail::json_ref& element_ref) + { + auto element = element_ref.moved_or_copied(); + m_value.object->emplace( + std::move(*((*element.m_value.array)[0].m_value.string)), + std::move((*element.m_value.array)[1])); + }); + } + else + { + // the initializer list describes an array -> create array + m_type = value_t::array; + m_value.array = create(init.begin(), init.end()); + } + + assert_invariant(); + } + + /*! + @brief explicitly create a binary array (without subtype) + + Creates a JSON binary array value from a given binary container. Binary + values are part of various binary formats, such as CBOR, MessagePack, and + BSON. This constructor is used to create a value for serialization to those + formats. + + @note Note, this function exists because of the difficulty in correctly + specifying the correct template overload in the standard value ctor, as both + JSON arrays and JSON binary arrays are backed with some form of a + `std::vector`. Because JSON binary arrays are a non-standard extension it + was decided that it would be best to prevent automatic initialization of a + binary array type, for backwards compatibility and so it does not happen on + accident. + + @param[in] init container containing bytes to use as binary type + + @return JSON binary array value + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @since version 3.8.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json binary(const typename binary_t::container_type& init) + { + auto res = basic_json(); + res.m_type = value_t::binary; + res.m_value = init; + return res; + } + + /*! + @brief explicitly create a binary array (with subtype) + + Creates a JSON binary array value from a given binary container. Binary + values are part of various binary formats, such as CBOR, MessagePack, and + BSON. This constructor is used to create a value for serialization to those + formats. + + @note Note, this function exists because of the difficulty in correctly + specifying the correct template overload in the standard value ctor, as both + JSON arrays and JSON binary arrays are backed with some form of a + `std::vector`. Because JSON binary arrays are a non-standard extension it + was decided that it would be best to prevent automatic initialization of a + binary array type, for backwards compatibility and so it does not happen on + accident. + + @param[in] init container containing bytes to use as binary type + @param[in] subtype subtype to use in MessagePack and BSON + + @return JSON binary array value + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @since version 3.8.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json binary(const typename binary_t::container_type& init, std::uint8_t subtype) + { + auto res = basic_json(); + res.m_type = value_t::binary; + res.m_value = binary_t(init, subtype); + return res; + } + + /// @copydoc binary(const typename binary_t::container_type&) + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json binary(typename binary_t::container_type&& init) + { + auto res = basic_json(); + res.m_type = value_t::binary; + res.m_value = std::move(init); + return res; + } + + /// @copydoc binary(const typename binary_t::container_type&, std::uint8_t) + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json binary(typename binary_t::container_type&& init, std::uint8_t subtype) + { + auto res = basic_json(); + res.m_type = value_t::binary; + res.m_value = binary_t(std::move(init), subtype); + return res; + } + + /*! + @brief explicitly create an array from an initializer list + + Creates a JSON array value from a given initializer list. That is, given a + list of values `a, b, c`, creates the JSON value `[a, b, c]`. If the + initializer list is empty, the empty array `[]` is created. + + @note This function is only needed to express two edge cases that cannot + be realized with the initializer list constructor (@ref + basic_json(initializer_list_t, bool, value_t)). These cases + are: + 1. creating an array whose elements are all pairs whose first element is a + string -- in this case, the initializer list constructor would create an + object, taking the first elements as keys + 2. creating an empty array -- passing the empty initializer list to the + initializer list constructor yields an empty object + + @param[in] init initializer list with JSON values to create an array from + (optional) + + @return JSON array value + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows an example for the `array` + function.,array} + + @sa @ref basic_json(initializer_list_t, bool, value_t) -- + create a JSON value from an initializer list + @sa @ref object(initializer_list_t) -- create a JSON object + value from an initializer list + + @since version 1.0.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json array(initializer_list_t init = {}) + { + return basic_json(init, false, value_t::array); + } + + /*! + @brief explicitly create an object from an initializer list + + Creates a JSON object value from a given initializer list. The initializer + lists elements must be pairs, and their first elements must be strings. If + the initializer list is empty, the empty object `{}` is created. + + @note This function is only added for symmetry reasons. In contrast to the + related function @ref array(initializer_list_t), there are + no cases which can only be expressed by this function. That is, any + initializer list @a init can also be passed to the initializer list + constructor @ref basic_json(initializer_list_t, bool, value_t). + + @param[in] init initializer list to create an object from (optional) + + @return JSON object value + + @throw type_error.301 if @a init is not a list of pairs whose first + elements are strings. In this case, no object can be created. When such a + value is passed to @ref basic_json(initializer_list_t, bool, value_t), + an array would have been created from the passed initializer list @a init. + See example below. + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows an example for the `object` + function.,object} + + @sa @ref basic_json(initializer_list_t, bool, value_t) -- + create a JSON value from an initializer list + @sa @ref array(initializer_list_t) -- create a JSON array + value from an initializer list + + @since version 1.0.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json object(initializer_list_t init = {}) + { + return basic_json(init, false, value_t::object); + } + + /*! + @brief construct an array with count copies of given value + + Constructs a JSON array value by creating @a cnt copies of a passed value. + In case @a cnt is `0`, an empty array is created. + + @param[in] cnt the number of JSON copies of @a val to create + @param[in] val the JSON value to copy + + @post `std::distance(begin(),end()) == cnt` holds. + + @complexity Linear in @a cnt. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows examples for the @ref + basic_json(size_type\, const basic_json&) + constructor.,basic_json__size_type_basic_json} + + @since version 1.0.0 + */ + basic_json(size_type cnt, const basic_json& val) + : m_type(value_t::array) + { + m_value.array = create(cnt, val); + assert_invariant(); + } + + /*! + @brief construct a JSON container given an iterator range + + Constructs the JSON value with the contents of the range `[first, last)`. + The semantics depends on the different types a JSON value can have: + - In case of a null type, invalid_iterator.206 is thrown. + - In case of other primitive types (number, boolean, or string), @a first + must be `begin()` and @a last must be `end()`. In this case, the value is + copied. Otherwise, invalid_iterator.204 is thrown. + - In case of structured types (array, object), the constructor behaves as + similar versions for `std::vector` or `std::map`; that is, a JSON array + or object is constructed from the values in the range. + + @tparam InputIT an input iterator type (@ref iterator or @ref + const_iterator) + + @param[in] first begin of the range to copy from (included) + @param[in] last end of the range to copy from (excluded) + + @pre Iterators @a first and @a last must be initialized. **This + precondition is enforced with an assertion (see warning).** If + assertions are switched off, a violation of this precondition yields + undefined behavior. + + @pre Range `[first, last)` is valid. Usually, this precondition cannot be + checked efficiently. Only certain edge cases are detected; see the + description of the exceptions below. A violation of this precondition + yields undefined behavior. + + @warning A precondition is enforced with a runtime assertion that will + result in calling `std::abort` if this precondition is not met. + Assertions can be disabled by defining `NDEBUG` at compile time. + See https://en.cppreference.com/w/cpp/error/assert for more + information. + + @throw invalid_iterator.201 if iterators @a first and @a last are not + compatible (i.e., do not belong to the same JSON value). In this case, + the range `[first, last)` is undefined. + @throw invalid_iterator.204 if iterators @a first and @a last belong to a + primitive type (number, boolean, or string), but @a first does not point + to the first element any more. In this case, the range `[first, last)` is + undefined. See example code below. + @throw invalid_iterator.206 if iterators @a first and @a last belong to a + null value. In this case, the range `[first, last)` is undefined. + + @complexity Linear in distance between @a first and @a last. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The example below shows several ways to create JSON values by + specifying a subrange with iterators.,basic_json__InputIt_InputIt} + + @since version 1.0.0 + */ + template < class InputIT, typename std::enable_if < + std::is_same::value || + std::is_same::value, int >::type = 0 > + basic_json(InputIT first, InputIT last) + { + JSON_ASSERT(first.m_object != nullptr); + JSON_ASSERT(last.m_object != nullptr); + + // make sure iterator fits the current value + if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(201, "iterators are not compatible")); + } + + // copy type from first iterator + m_type = first.m_object->m_type; + + // check if iterator range is complete for primitive values + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + { + if (JSON_HEDLEY_UNLIKELY(!first.m_it.primitive_iterator.is_begin() + || !last.m_it.primitive_iterator.is_end())) + { + JSON_THROW(invalid_iterator::create(204, "iterators out of range")); + } + break; + } + + default: + break; + } + + switch (m_type) + { + case value_t::number_integer: + { + m_value.number_integer = first.m_object->m_value.number_integer; + break; + } + + case value_t::number_unsigned: + { + m_value.number_unsigned = first.m_object->m_value.number_unsigned; + break; + } + + case value_t::number_float: + { + m_value.number_float = first.m_object->m_value.number_float; + break; + } + + case value_t::boolean: + { + m_value.boolean = first.m_object->m_value.boolean; + break; + } + + case value_t::string: + { + m_value = *first.m_object->m_value.string; + break; + } + + case value_t::object: + { + m_value.object = create(first.m_it.object_iterator, + last.m_it.object_iterator); + break; + } + + case value_t::array: + { + m_value.array = create(first.m_it.array_iterator, + last.m_it.array_iterator); + break; + } + + case value_t::binary: + { + m_value = *first.m_object->m_value.binary; + break; + } + + default: + JSON_THROW(invalid_iterator::create(206, "cannot construct with iterators from " + + std::string(first.m_object->type_name()))); + } + + assert_invariant(); + } + + + /////////////////////////////////////// + // other constructors and destructor // + /////////////////////////////////////// + + template, + std::is_same>::value, int> = 0 > + basic_json(const JsonRef& ref) : basic_json(ref.moved_or_copied()) {} + + /*! + @brief copy constructor + + Creates a copy of a given JSON value. + + @param[in] other the JSON value to copy + + @post `*this == other` + + @complexity Linear in the size of @a other. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + - As postcondition, it holds: `other == basic_json(other)`. + + @liveexample{The following code shows an example for the copy + constructor.,basic_json__basic_json} + + @since version 1.0.0 + */ + basic_json(const basic_json& other) + : m_type(other.m_type) + { + // check of passed value is valid + other.assert_invariant(); + + switch (m_type) + { + case value_t::object: + { + m_value = *other.m_value.object; + break; + } + + case value_t::array: + { + m_value = *other.m_value.array; + break; + } + + case value_t::string: + { + m_value = *other.m_value.string; + break; + } + + case value_t::boolean: + { + m_value = other.m_value.boolean; + break; + } + + case value_t::number_integer: + { + m_value = other.m_value.number_integer; + break; + } + + case value_t::number_unsigned: + { + m_value = other.m_value.number_unsigned; + break; + } + + case value_t::number_float: + { + m_value = other.m_value.number_float; + break; + } + + case value_t::binary: + { + m_value = *other.m_value.binary; + break; + } + + default: + break; + } + + assert_invariant(); + } + + /*! + @brief move constructor + + Move constructor. Constructs a JSON value with the contents of the given + value @a other using move semantics. It "steals" the resources from @a + other and leaves it as JSON null value. + + @param[in,out] other value to move to this object + + @post `*this` has the same value as @a other before the call. + @post @a other is a JSON null value. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this constructor never throws + exceptions. + + @requirement This function helps `basic_json` satisfying the + [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible) + requirements. + + @liveexample{The code below shows the move constructor explicitly called + via std::move.,basic_json__moveconstructor} + + @since version 1.0.0 + */ + basic_json(basic_json&& other) noexcept + : m_type(std::move(other.m_type)), + m_value(std::move(other.m_value)) + { + // check that passed value is valid + other.assert_invariant(); + + // invalidate payload + other.m_type = value_t::null; + other.m_value = {}; + + assert_invariant(); + } + + /*! + @brief copy assignment + + Copy assignment operator. Copies a JSON value via the "copy and swap" + strategy: It is expressed in terms of the copy constructor, destructor, + and the `swap()` member function. + + @param[in] other value to copy from + + @complexity Linear. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + + @liveexample{The code below shows and example for the copy assignment. It + creates a copy of value `a` which is then swapped with `b`. Finally\, the + copy of `a` (which is the null value after the swap) is + destroyed.,basic_json__copyassignment} + + @since version 1.0.0 + */ + basic_json& operator=(basic_json other) noexcept ( + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value&& + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value + ) + { + // check that passed value is valid + other.assert_invariant(); + + using std::swap; + swap(m_type, other.m_type); + swap(m_value, other.m_value); + + assert_invariant(); + return *this; + } + + /*! + @brief destructor + + Destroys the JSON value and frees all allocated memory. + + @complexity Linear. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + - All stored elements are destroyed and all memory is freed. + + @since version 1.0.0 + */ + ~basic_json() noexcept + { + assert_invariant(); + m_value.destroy(m_type); + } + + /// @} + + public: + /////////////////////// + // object inspection // + /////////////////////// + + /// @name object inspection + /// Functions to inspect the type of a JSON value. + /// @{ + + /*! + @brief serialization + + Serialization function for JSON values. The function tries to mimic + Python's `json.dumps()` function, and currently supports its @a indent + and @a ensure_ascii parameters. + + @param[in] indent If indent is nonnegative, then array elements and object + members will be pretty-printed with that indent level. An indent level of + `0` will only insert newlines. `-1` (the default) selects the most compact + representation. + @param[in] indent_char The character to use for indentation if @a indent is + greater than `0`. The default is ` ` (space). + @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters + in the output are escaped with `\uXXXX` sequences, and the result consists + of ASCII characters only. + @param[in] error_handler how to react on decoding errors; there are three + possible values: `strict` (throws and exception in case a decoding error + occurs; default), `replace` (replace invalid UTF-8 sequences with U+FFFD), + and `ignore` (ignore invalid UTF-8 sequences during serialization; all + bytes are copied to the output unchanged). + + @return string containing the serialization of the JSON value + + @throw type_error.316 if a string stored inside the JSON value is not + UTF-8 encoded and @a error_handler is set to strict + + @note Binary values are serialized as object containing two keys: + - "bytes": an array of bytes as integers + - "subtype": the subtype as integer or "null" if the binary has no subtype + + @complexity Linear. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @liveexample{The following example shows the effect of different @a indent\, + @a indent_char\, and @a ensure_ascii parameters to the result of the + serialization.,dump} + + @see https://docs.python.org/2/library/json.html#json.dump + + @since version 1.0.0; indentation character @a indent_char, option + @a ensure_ascii and exceptions added in version 3.0.0; error + handlers added in version 3.4.0; serialization of binary values added + in version 3.8.0. + */ + string_t dump(const int indent = -1, + const char indent_char = ' ', + const bool ensure_ascii = false, + const error_handler_t error_handler = error_handler_t::strict) const + { + string_t result; + serializer s(detail::output_adapter(result), indent_char, error_handler); + + if (indent >= 0) + { + s.dump(*this, true, ensure_ascii, static_cast(indent)); + } + else + { + s.dump(*this, false, ensure_ascii, 0); + } + + return result; + } + + /*! + @brief return the type of the JSON value (explicit) + + Return the type of the JSON value as a value from the @ref value_t + enumeration. + + @return the type of the JSON value + Value type | return value + ------------------------- | ------------------------- + null | value_t::null + boolean | value_t::boolean + string | value_t::string + number (integer) | value_t::number_integer + number (unsigned integer) | value_t::number_unsigned + number (floating-point) | value_t::number_float + object | value_t::object + array | value_t::array + binary | value_t::binary + discarded | value_t::discarded + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `type()` for all JSON + types.,type} + + @sa @ref operator value_t() -- return the type of the JSON value (implicit) + @sa @ref type_name() -- return the type as string + + @since version 1.0.0 + */ + constexpr value_t type() const noexcept + { + return m_type; + } + + /*! + @brief return whether type is primitive + + This function returns true if and only if the JSON type is primitive + (string, number, boolean, or null). + + @return `true` if type is primitive (string, number, boolean, or null), + `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_primitive()` for all JSON + types.,is_primitive} + + @sa @ref is_structured() -- returns whether JSON value is structured + @sa @ref is_null() -- returns whether JSON value is `null` + @sa @ref is_string() -- returns whether JSON value is a string + @sa @ref is_boolean() -- returns whether JSON value is a boolean + @sa @ref is_number() -- returns whether JSON value is a number + @sa @ref is_binary() -- returns whether JSON value is a binary array + + @since version 1.0.0 + */ + constexpr bool is_primitive() const noexcept + { + return is_null() || is_string() || is_boolean() || is_number() || is_binary(); + } + + /*! + @brief return whether type is structured + + This function returns true if and only if the JSON type is structured + (array or object). + + @return `true` if type is structured (array or object), `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_structured()` for all JSON + types.,is_structured} + + @sa @ref is_primitive() -- returns whether value is primitive + @sa @ref is_array() -- returns whether value is an array + @sa @ref is_object() -- returns whether value is an object + + @since version 1.0.0 + */ + constexpr bool is_structured() const noexcept + { + return is_array() || is_object(); + } + + /*! + @brief return whether value is null + + This function returns true if and only if the JSON value is null. + + @return `true` if type is null, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_null()` for all JSON + types.,is_null} + + @since version 1.0.0 + */ + constexpr bool is_null() const noexcept + { + return m_type == value_t::null; + } + + /*! + @brief return whether value is a boolean + + This function returns true if and only if the JSON value is a boolean. + + @return `true` if type is boolean, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_boolean()` for all JSON + types.,is_boolean} + + @since version 1.0.0 + */ + constexpr bool is_boolean() const noexcept + { + return m_type == value_t::boolean; + } + + /*! + @brief return whether value is a number + + This function returns true if and only if the JSON value is a number. This + includes both integer (signed and unsigned) and floating-point values. + + @return `true` if type is number (regardless whether integer, unsigned + integer or floating-type), `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number()` for all JSON + types.,is_number} + + @sa @ref is_number_integer() -- check if value is an integer or unsigned + integer number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 1.0.0 + */ + constexpr bool is_number() const noexcept + { + return is_number_integer() || is_number_float(); + } + + /*! + @brief return whether value is an integer number + + This function returns true if and only if the JSON value is a signed or + unsigned integer number. This excludes floating-point values. + + @return `true` if type is an integer or unsigned integer number, `false` + otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_integer()` for all + JSON types.,is_number_integer} + + @sa @ref is_number() -- check if value is a number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 1.0.0 + */ + constexpr bool is_number_integer() const noexcept + { + return m_type == value_t::number_integer || m_type == value_t::number_unsigned; + } + + /*! + @brief return whether value is an unsigned integer number + + This function returns true if and only if the JSON value is an unsigned + integer number. This excludes floating-point and signed integer values. + + @return `true` if type is an unsigned integer number, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_unsigned()` for all + JSON types.,is_number_unsigned} + + @sa @ref is_number() -- check if value is a number + @sa @ref is_number_integer() -- check if value is an integer or unsigned + integer number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 2.0.0 + */ + constexpr bool is_number_unsigned() const noexcept + { + return m_type == value_t::number_unsigned; + } + + /*! + @brief return whether value is a floating-point number + + This function returns true if and only if the JSON value is a + floating-point number. This excludes signed and unsigned integer values. + + @return `true` if type is a floating-point number, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_float()` for all + JSON types.,is_number_float} + + @sa @ref is_number() -- check if value is number + @sa @ref is_number_integer() -- check if value is an integer number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + + @since version 1.0.0 + */ + constexpr bool is_number_float() const noexcept + { + return m_type == value_t::number_float; + } + + /*! + @brief return whether value is an object + + This function returns true if and only if the JSON value is an object. + + @return `true` if type is object, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_object()` for all JSON + types.,is_object} + + @since version 1.0.0 + */ + constexpr bool is_object() const noexcept + { + return m_type == value_t::object; + } + + /*! + @brief return whether value is an array + + This function returns true if and only if the JSON value is an array. + + @return `true` if type is array, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_array()` for all JSON + types.,is_array} + + @since version 1.0.0 + */ + constexpr bool is_array() const noexcept + { + return m_type == value_t::array; + } + + /*! + @brief return whether value is a string + + This function returns true if and only if the JSON value is a string. + + @return `true` if type is string, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_string()` for all JSON + types.,is_string} + + @since version 1.0.0 + */ + constexpr bool is_string() const noexcept + { + return m_type == value_t::string; + } + + /*! + @brief return whether value is a binary array + + This function returns true if and only if the JSON value is a binary array. + + @return `true` if type is binary array, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_binary()` for all JSON + types.,is_binary} + + @since version 3.8.0 + */ + constexpr bool is_binary() const noexcept + { + return m_type == value_t::binary; + } + + /*! + @brief return whether value is discarded + + This function returns true if and only if the JSON value was discarded + during parsing with a callback function (see @ref parser_callback_t). + + @note This function will always be `false` for JSON values after parsing. + That is, discarded values can only occur during parsing, but will be + removed when inside a structured value or replaced by null in other cases. + + @return `true` if type is discarded, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_discarded()` for all JSON + types.,is_discarded} + + @since version 1.0.0 + */ + constexpr bool is_discarded() const noexcept + { + return m_type == value_t::discarded; + } + + /*! + @brief return the type of the JSON value (implicit) + + Implicitly return the type of the JSON value as a value from the @ref + value_t enumeration. + + @return the type of the JSON value + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies the @ref value_t operator for + all JSON types.,operator__value_t} + + @sa @ref type() -- return the type of the JSON value (explicit) + @sa @ref type_name() -- return the type as string + + @since version 1.0.0 + */ + constexpr operator value_t() const noexcept + { + return m_type; + } + + /// @} + + private: + ////////////////// + // value access // + ////////////////// + + /// get a boolean (explicit) + boolean_t get_impl(boolean_t* /*unused*/) const + { + if (JSON_HEDLEY_LIKELY(is_boolean())) + { + return m_value.boolean; + } + + JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(type_name()))); + } + + /// get a pointer to the value (object) + object_t* get_impl_ptr(object_t* /*unused*/) noexcept + { + return is_object() ? m_value.object : nullptr; + } + + /// get a pointer to the value (object) + constexpr const object_t* get_impl_ptr(const object_t* /*unused*/) const noexcept + { + return is_object() ? m_value.object : nullptr; + } + + /// get a pointer to the value (array) + array_t* get_impl_ptr(array_t* /*unused*/) noexcept + { + return is_array() ? m_value.array : nullptr; + } + + /// get a pointer to the value (array) + constexpr const array_t* get_impl_ptr(const array_t* /*unused*/) const noexcept + { + return is_array() ? m_value.array : nullptr; + } + + /// get a pointer to the value (string) + string_t* get_impl_ptr(string_t* /*unused*/) noexcept + { + return is_string() ? m_value.string : nullptr; + } + + /// get a pointer to the value (string) + constexpr const string_t* get_impl_ptr(const string_t* /*unused*/) const noexcept + { + return is_string() ? m_value.string : nullptr; + } + + /// get a pointer to the value (boolean) + boolean_t* get_impl_ptr(boolean_t* /*unused*/) noexcept + { + return is_boolean() ? &m_value.boolean : nullptr; + } + + /// get a pointer to the value (boolean) + constexpr const boolean_t* get_impl_ptr(const boolean_t* /*unused*/) const noexcept + { + return is_boolean() ? &m_value.boolean : nullptr; + } + + /// get a pointer to the value (integer number) + number_integer_t* get_impl_ptr(number_integer_t* /*unused*/) noexcept + { + return is_number_integer() ? &m_value.number_integer : nullptr; + } + + /// get a pointer to the value (integer number) + constexpr const number_integer_t* get_impl_ptr(const number_integer_t* /*unused*/) const noexcept + { + return is_number_integer() ? &m_value.number_integer : nullptr; + } + + /// get a pointer to the value (unsigned number) + number_unsigned_t* get_impl_ptr(number_unsigned_t* /*unused*/) noexcept + { + return is_number_unsigned() ? &m_value.number_unsigned : nullptr; + } + + /// get a pointer to the value (unsigned number) + constexpr const number_unsigned_t* get_impl_ptr(const number_unsigned_t* /*unused*/) const noexcept + { + return is_number_unsigned() ? &m_value.number_unsigned : nullptr; + } + + /// get a pointer to the value (floating-point number) + number_float_t* get_impl_ptr(number_float_t* /*unused*/) noexcept + { + return is_number_float() ? &m_value.number_float : nullptr; + } + + /// get a pointer to the value (floating-point number) + constexpr const number_float_t* get_impl_ptr(const number_float_t* /*unused*/) const noexcept + { + return is_number_float() ? &m_value.number_float : nullptr; + } + + /// get a pointer to the value (binary) + binary_t* get_impl_ptr(binary_t* /*unused*/) noexcept + { + return is_binary() ? m_value.binary : nullptr; + } + + /// get a pointer to the value (binary) + constexpr const binary_t* get_impl_ptr(const binary_t* /*unused*/) const noexcept + { + return is_binary() ? m_value.binary : nullptr; + } + + /*! + @brief helper function to implement get_ref() + + This function helps to implement get_ref() without code duplication for + const and non-const overloads + + @tparam ThisType will be deduced as `basic_json` or `const basic_json` + + @throw type_error.303 if ReferenceType does not match underlying value + type of the current JSON + */ + template + static ReferenceType get_ref_impl(ThisType& obj) + { + // delegate the call to get_ptr<>() + auto ptr = obj.template get_ptr::type>(); + + if (JSON_HEDLEY_LIKELY(ptr != nullptr)) + { + return *ptr; + } + + JSON_THROW(type_error::create(303, "incompatible ReferenceType for get_ref, actual type is " + std::string(obj.type_name()))); + } + + public: + /// @name value access + /// Direct access to the stored value of a JSON value. + /// @{ + + /*! + @brief get special-case overload + + This overloads avoids a lot of template boilerplate, it can be seen as the + identity method + + @tparam BasicJsonType == @ref basic_json + + @return a copy of *this + + @complexity Constant. + + @since version 2.1.0 + */ + template::type, basic_json_t>::value, + int> = 0> + basic_json get() const + { + return *this; + } + + /*! + @brief get special-case overload + + This overloads converts the current @ref basic_json in a different + @ref basic_json type + + @tparam BasicJsonType == @ref basic_json + + @return a copy of *this, converted into @tparam BasicJsonType + + @complexity Depending on the implementation of the called `from_json()` + method. + + @since version 3.2.0 + */ + template < typename BasicJsonType, detail::enable_if_t < + !std::is_same::value&& + detail::is_basic_json::value, int > = 0 > + BasicJsonType get() const + { + return *this; + } + + /*! + @brief get a value (explicit) + + Explicit type conversion between the JSON value and a compatible value + which is [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible) + and [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible). + The value is converted by calling the @ref json_serializer + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + ValueType ret; + JSONSerializer::from_json(*this, ret); + return ret; + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json, + - @ref json_serializer has a `from_json()` method of the form + `void from_json(const basic_json&, ValueType&)`, and + - @ref json_serializer does not have a `from_json()` method of + the form `ValueType from_json(const basic_json&)` + + @tparam ValueTypeCV the provided value type + @tparam ValueType the returned value type + + @return copy of the JSON value, converted to @a ValueType + + @throw what @ref json_serializer `from_json()` method throws + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map`.,get__ValueType_const} + + @since version 2.1.0 + */ + template < typename ValueTypeCV, typename ValueType = detail::uncvref_t, + detail::enable_if_t < + !detail::is_basic_json::value && + detail::has_from_json::value && + !detail::has_non_default_from_json::value, + int > = 0 > + ValueType get() const noexcept(noexcept( + JSONSerializer::from_json(std::declval(), std::declval()))) + { + // we cannot static_assert on ValueTypeCV being non-const, because + // there is support for get(), which is why we + // still need the uncvref + static_assert(!std::is_reference::value, + "get() cannot be used with reference types, you might want to use get_ref()"); + static_assert(std::is_default_constructible::value, + "types must be DefaultConstructible when used with get()"); + + ValueType ret; + JSONSerializer::from_json(*this, ret); + return ret; + } + + /*! + @brief get a value (explicit); special case + + Explicit type conversion between the JSON value and a compatible value + which is **not** [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible) + and **not** [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible). + The value is converted by calling the @ref json_serializer + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + return JSONSerializer::from_json(*this); + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json and + - @ref json_serializer has a `from_json()` method of the form + `ValueType from_json(const basic_json&)` + + @note If @ref json_serializer has both overloads of + `from_json()`, this one is chosen. + + @tparam ValueTypeCV the provided value type + @tparam ValueType the returned value type + + @return copy of the JSON value, converted to @a ValueType + + @throw what @ref json_serializer `from_json()` method throws + + @since version 2.1.0 + */ + template < typename ValueTypeCV, typename ValueType = detail::uncvref_t, + detail::enable_if_t < !std::is_same::value && + detail::has_non_default_from_json::value, + int > = 0 > + ValueType get() const noexcept(noexcept( + JSONSerializer::from_json(std::declval()))) + { + static_assert(!std::is_reference::value, + "get() cannot be used with reference types, you might want to use get_ref()"); + return JSONSerializer::from_json(*this); + } + + /*! + @brief get a value (explicit) + + Explicit type conversion between the JSON value and a compatible value. + The value is filled into the input parameter by calling the @ref json_serializer + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + ValueType v; + JSONSerializer::from_json(*this, v); + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json, + - @ref json_serializer has a `from_json()` method of the form + `void from_json(const basic_json&, ValueType&)`, and + + @tparam ValueType the input parameter type. + + @return the input parameter, allowing chaining calls. + + @throw what @ref json_serializer `from_json()` method throws + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map`.,get_to} + + @since version 3.3.0 + */ + template < typename ValueType, + detail::enable_if_t < + !detail::is_basic_json::value&& + detail::has_from_json::value, + int > = 0 > + ValueType & get_to(ValueType& v) const noexcept(noexcept( + JSONSerializer::from_json(std::declval(), v))) + { + JSONSerializer::from_json(*this, v); + return v; + } + + // specialization to allow to call get_to with a basic_json value + // see https://github.com/nlohmann/json/issues/2175 + template::value, + int> = 0> + ValueType & get_to(ValueType& v) const + { + v = *this; + return v; + } + + template < + typename T, std::size_t N, + typename Array = T (&)[N], + detail::enable_if_t < + detail::has_from_json::value, int > = 0 > + Array get_to(T (&v)[N]) const + noexcept(noexcept(JSONSerializer::from_json( + std::declval(), v))) + { + JSONSerializer::from_json(*this, v); + return v; + } + + + /*! + @brief get a pointer value (implicit) + + Implicit pointer access to the internally stored JSON value. No copies are + made. + + @warning Writing data to the pointee of the result yields an undefined + state. + + @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref + object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, + @ref number_unsigned_t, or @ref number_float_t. Enforced by a static + assertion. + + @return pointer to the internally stored JSON value if the requested + pointer type @a PointerType fits to the JSON value; `nullptr` otherwise + + @complexity Constant. + + @liveexample{The example below shows how pointers to internal values of a + JSON value can be requested. Note that no type conversions are made and a + `nullptr` is returned if the value and the requested pointer type does not + match.,get_ptr} + + @since version 1.0.0 + */ + template::value, int>::type = 0> + auto get_ptr() noexcept -> decltype(std::declval().get_impl_ptr(std::declval())) + { + // delegate the call to get_impl_ptr<>() + return get_impl_ptr(static_cast(nullptr)); + } + + /*! + @brief get a pointer value (implicit) + @copydoc get_ptr() + */ + template < typename PointerType, typename std::enable_if < + std::is_pointer::value&& + std::is_const::type>::value, int >::type = 0 > + constexpr auto get_ptr() const noexcept -> decltype(std::declval().get_impl_ptr(std::declval())) + { + // delegate the call to get_impl_ptr<>() const + return get_impl_ptr(static_cast(nullptr)); + } + + /*! + @brief get a pointer value (explicit) + + Explicit pointer access to the internally stored JSON value. No copies are + made. + + @warning The pointer becomes invalid if the underlying JSON object + changes. + + @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref + object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, + @ref number_unsigned_t, or @ref number_float_t. + + @return pointer to the internally stored JSON value if the requested + pointer type @a PointerType fits to the JSON value; `nullptr` otherwise + + @complexity Constant. + + @liveexample{The example below shows how pointers to internal values of a + JSON value can be requested. Note that no type conversions are made and a + `nullptr` is returned if the value and the requested pointer type does not + match.,get__PointerType} + + @sa @ref get_ptr() for explicit pointer-member access + + @since version 1.0.0 + */ + template::value, int>::type = 0> + auto get() noexcept -> decltype(std::declval().template get_ptr()) + { + // delegate the call to get_ptr + return get_ptr(); + } + + /*! + @brief get a pointer value (explicit) + @copydoc get() + */ + template::value, int>::type = 0> + constexpr auto get() const noexcept -> decltype(std::declval().template get_ptr()) + { + // delegate the call to get_ptr + return get_ptr(); + } + + /*! + @brief get a reference value (implicit) + + Implicit reference access to the internally stored JSON value. No copies + are made. + + @warning Writing data to the referee of the result yields an undefined + state. + + @tparam ReferenceType reference type; must be a reference to @ref array_t, + @ref object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, or + @ref number_float_t. Enforced by static assertion. + + @return reference to the internally stored JSON value if the requested + reference type @a ReferenceType fits to the JSON value; throws + type_error.303 otherwise + + @throw type_error.303 in case passed type @a ReferenceType is incompatible + with the stored JSON value; see example below + + @complexity Constant. + + @liveexample{The example shows several calls to `get_ref()`.,get_ref} + + @since version 1.1.0 + */ + template::value, int>::type = 0> + ReferenceType get_ref() + { + // delegate call to get_ref_impl + return get_ref_impl(*this); + } + + /*! + @brief get a reference value (implicit) + @copydoc get_ref() + */ + template < typename ReferenceType, typename std::enable_if < + std::is_reference::value&& + std::is_const::type>::value, int >::type = 0 > + ReferenceType get_ref() const + { + // delegate call to get_ref_impl + return get_ref_impl(*this); + } + + /*! + @brief get a value (implicit) + + Implicit type conversion between the JSON value and a compatible value. + The call is realized by calling @ref get() const. + + @tparam ValueType non-pointer type compatible to the JSON value, for + instance `int` for JSON integer numbers, `bool` for JSON booleans, or + `std::vector` types for JSON arrays. The character type of @ref string_t + as well as an initializer list of this type is excluded to avoid + ambiguities as these types implicitly convert to `std::string`. + + @return copy of the JSON value, converted to type @a ValueType + + @throw type_error.302 in case passed type @a ValueType is incompatible + to the JSON value type (e.g., the JSON value is of type boolean, but a + string is requested); see example below + + @complexity Linear in the size of the JSON value. + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map`.,operator__ValueType} + + @since version 1.0.0 + */ + template < typename ValueType, typename std::enable_if < + !std::is_pointer::value&& + !std::is_same>::value&& + !std::is_same::value&& + !detail::is_basic_json::value + && !std::is_same>::value +#if defined(JSON_HAS_CPP_17) && (defined(__GNUC__) || (defined(_MSC_VER) && _MSC_VER >= 1910 && _MSC_VER <= 1914)) + && !std::is_same::value +#endif + && detail::is_detected::value + , int >::type = 0 > + JSON_EXPLICIT operator ValueType() const + { + // delegate the call to get<>() const + return get(); + } + + /*! + @return reference to the binary value + + @throw type_error.302 if the value is not binary + + @sa @ref is_binary() to check if the value is binary + + @since version 3.8.0 + */ + binary_t& get_binary() + { + if (!is_binary()) + { + JSON_THROW(type_error::create(302, "type must be binary, but is " + std::string(type_name()))); + } + + return *get_ptr(); + } + + /// @copydoc get_binary() + const binary_t& get_binary() const + { + if (!is_binary()) + { + JSON_THROW(type_error::create(302, "type must be binary, but is " + std::string(type_name()))); + } + + return *get_ptr(); + } + + /// @} + + + //////////////////// + // element access // + //////////////////// + + /// @name element access + /// Access to the JSON value. + /// @{ + + /*! + @brief access specified array element with bounds checking + + Returns a reference to the element at specified location @a idx, with + bounds checking. + + @param[in] idx index of the element to access + + @return reference to the element at index @a idx + + @throw type_error.304 if the JSON value is not an array; in this case, + calling `at` with an index makes no sense. See example below. + @throw out_of_range.401 if the index @a idx is out of range of the array; + that is, `idx >= size()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 1.0.0 + + @liveexample{The example below shows how array elements can be read and + written using `at()`. It also demonstrates the different exceptions that + can be thrown.,at__size_type} + */ + reference at(size_type idx) + { + // at only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + JSON_TRY + { + return m_value.array->at(idx); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified array element with bounds checking + + Returns a const reference to the element at specified location @a idx, + with bounds checking. + + @param[in] idx index of the element to access + + @return const reference to the element at index @a idx + + @throw type_error.304 if the JSON value is not an array; in this case, + calling `at` with an index makes no sense. See example below. + @throw out_of_range.401 if the index @a idx is out of range of the array; + that is, `idx >= size()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 1.0.0 + + @liveexample{The example below shows how array elements can be read using + `at()`. It also demonstrates the different exceptions that can be thrown., + at__size_type_const} + */ + const_reference at(size_type idx) const + { + // at only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + JSON_TRY + { + return m_value.array->at(idx); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified object element with bounds checking + + Returns a reference to the element at with specified key @a key, with + bounds checking. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.304 if the JSON value is not an object; in this case, + calling `at` with a key makes no sense. See example below. + @throw out_of_range.403 if the key @a key is is not stored in the object; + that is, `find(key) == end()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Logarithmic in the size of the container. + + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + + @liveexample{The example below shows how object elements can be read and + written using `at()`. It also demonstrates the different exceptions that + can be thrown.,at__object_t_key_type} + */ + reference at(const typename object_t::key_type& key) + { + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + JSON_TRY + { + return m_value.object->at(key); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(403, "key '" + key + "' not found")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified object element with bounds checking + + Returns a const reference to the element at with specified key @a key, + with bounds checking. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @throw type_error.304 if the JSON value is not an object; in this case, + calling `at` with a key makes no sense. See example below. + @throw out_of_range.403 if the key @a key is is not stored in the object; + that is, `find(key) == end()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Logarithmic in the size of the container. + + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + + @liveexample{The example below shows how object elements can be read using + `at()`. It also demonstrates the different exceptions that can be thrown., + at__object_t_key_type_const} + */ + const_reference at(const typename object_t::key_type& key) const + { + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + JSON_TRY + { + return m_value.object->at(key); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(403, "key '" + key + "' not found")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified array element + + Returns a reference to the element at specified location @a idx. + + @note If @a idx is beyond the range of the array (i.e., `idx >= size()`), + then the array is silently filled up with `null` values to make `idx` a + valid reference to the last stored element. + + @param[in] idx index of the element to access + + @return reference to the element at index @a idx + + @throw type_error.305 if the JSON value is not an array or null; in that + cases, using the [] operator with an index makes no sense. + + @complexity Constant if @a idx is in the range of the array. Otherwise + linear in `idx - size()`. + + @liveexample{The example below shows how array elements can be read and + written using `[]` operator. Note the addition of `null` + values.,operatorarray__size_type} + + @since version 1.0.0 + */ + reference operator[](size_type idx) + { + // implicitly convert null value to an empty array + if (is_null()) + { + m_type = value_t::array; + m_value.array = create(); + assert_invariant(); + } + + // operator[] only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + // fill up array with null values if given idx is outside range + if (idx >= m_value.array->size()) + { + m_value.array->insert(m_value.array->end(), + idx - m_value.array->size() + 1, + basic_json()); + } + + return m_value.array->operator[](idx); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a numeric argument with " + std::string(type_name()))); + } + + /*! + @brief access specified array element + + Returns a const reference to the element at specified location @a idx. + + @param[in] idx index of the element to access + + @return const reference to the element at index @a idx + + @throw type_error.305 if the JSON value is not an array; in that case, + using the [] operator with an index makes no sense. + + @complexity Constant. + + @liveexample{The example below shows how array elements can be read using + the `[]` operator.,operatorarray__size_type_const} + + @since version 1.0.0 + */ + const_reference operator[](size_type idx) const + { + // const operator[] only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + return m_value.array->operator[](idx); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a numeric argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element + + Returns a reference to the element at with specified key @a key. + + @note If @a key is not found in the object, then it is silently added to + the object and filled with a `null` value to make `key` a valid reference. + In case the value was `null` before, it is converted to an object. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.305 if the JSON value is not an object or null; in that + cases, using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read and + written using the `[]` operator.,operatorarray__key_type} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + */ + reference operator[](const typename object_t::key_type& key) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create(); + assert_invariant(); + } + + // operator[] only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + return m_value.object->operator[](key); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief read-only access specified object element + + Returns a const reference to the element at with specified key @a key. No + bounds checking is performed. + + @warning If the element with key @a key does not exist, the behavior is + undefined. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @pre The element with key @a key must exist. **This precondition is + enforced with an assertion.** + + @throw type_error.305 if the JSON value is not an object; in that case, + using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read using + the `[]` operator.,operatorarray__key_type_const} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + */ + const_reference operator[](const typename object_t::key_type& key) const + { + // const operator[] only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + JSON_ASSERT(m_value.object->find(key) != m_value.object->end()); + return m_value.object->find(key)->second; + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element + + Returns a reference to the element at with specified key @a key. + + @note If @a key is not found in the object, then it is silently added to + the object and filled with a `null` value to make `key` a valid reference. + In case the value was `null` before, it is converted to an object. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.305 if the JSON value is not an object or null; in that + cases, using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read and + written using the `[]` operator.,operatorarray__key_type} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.1.0 + */ + template + JSON_HEDLEY_NON_NULL(2) + reference operator[](T* key) + { + // implicitly convert null to object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + return m_value.object->operator[](key); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief read-only access specified object element + + Returns a const reference to the element at with specified key @a key. No + bounds checking is performed. + + @warning If the element with key @a key does not exist, the behavior is + undefined. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @pre The element with key @a key must exist. **This precondition is + enforced with an assertion.** + + @throw type_error.305 if the JSON value is not an object; in that case, + using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read using + the `[]` operator.,operatorarray__key_type_const} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.1.0 + */ + template + JSON_HEDLEY_NON_NULL(2) + const_reference operator[](T* key) const + { + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + JSON_ASSERT(m_value.object->find(key) != m_value.object->end()); + return m_value.object->find(key)->second; + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element with default value + + Returns either a copy of an object's element at the specified key @a key + or a given default value if no element with key @a key exists. + + The function is basically equivalent to executing + @code {.cpp} + try { + return at(key); + } catch(out_of_range) { + return default_value; + } + @endcode + + @note Unlike @ref at(const typename object_t::key_type&), this function + does not throw if the given key @a key was not found. + + @note Unlike @ref operator[](const typename object_t::key_type& key), this + function does not implicitly add an element to the position defined by @a + key. This function is furthermore also applicable to const objects. + + @param[in] key key of the element to access + @param[in] default_value the value to return if @a key is not found + + @tparam ValueType type compatible to JSON values, for instance `int` for + JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for + JSON arrays. Note the type of the expected value at @a key and the default + value @a default_value must be compatible. + + @return copy of the element at key @a key or @a default_value if @a key + is not found + + @throw type_error.302 if @a default_value does not match the type of the + value at @a key + @throw type_error.306 if the JSON value is not an object; in that case, + using `value()` with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be queried + with a default value.,basic_json__value} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + + @since version 1.0.0 + */ + // using std::is_convertible in a std::enable_if will fail when using explicit conversions + template < class ValueType, typename std::enable_if < + detail::is_getable::value + && !std::is_same::value, int >::type = 0 > + ValueType value(const typename object_t::key_type& key, const ValueType& default_value) const + { + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + // if key is found, return value and given default value otherwise + const auto it = find(key); + if (it != end()) + { + return it->template get(); + } + + return default_value; + } + + JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name()))); + } + + /*! + @brief overload for a default value of type const char* + @copydoc basic_json::value(const typename object_t::key_type&, const ValueType&) const + */ + string_t value(const typename object_t::key_type& key, const char* default_value) const + { + return value(key, string_t(default_value)); + } + + /*! + @brief access specified object element via JSON Pointer with default value + + Returns either a copy of an object's element at the specified key @a key + or a given default value if no element with key @a key exists. + + The function is basically equivalent to executing + @code {.cpp} + try { + return at(ptr); + } catch(out_of_range) { + return default_value; + } + @endcode + + @note Unlike @ref at(const json_pointer&), this function does not throw + if the given key @a key was not found. + + @param[in] ptr a JSON pointer to the element to access + @param[in] default_value the value to return if @a ptr found no value + + @tparam ValueType type compatible to JSON values, for instance `int` for + JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for + JSON arrays. Note the type of the expected value at @a key and the default + value @a default_value must be compatible. + + @return copy of the element at key @a key or @a default_value if @a key + is not found + + @throw type_error.302 if @a default_value does not match the type of the + value at @a ptr + @throw type_error.306 if the JSON value is not an object; in that case, + using `value()` with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be queried + with a default value.,basic_json__value_ptr} + + @sa @ref operator[](const json_pointer&) for unchecked access by reference + + @since version 2.0.2 + */ + template::value, int>::type = 0> + ValueType value(const json_pointer& ptr, const ValueType& default_value) const + { + // at only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + // if pointer resolves a value, return it or use default value + JSON_TRY + { + return ptr.get_checked(this).template get(); + } + JSON_INTERNAL_CATCH (out_of_range&) + { + return default_value; + } + } + + JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name()))); + } + + /*! + @brief overload for a default value of type const char* + @copydoc basic_json::value(const json_pointer&, ValueType) const + */ + JSON_HEDLEY_NON_NULL(3) + string_t value(const json_pointer& ptr, const char* default_value) const + { + return value(ptr, string_t(default_value)); + } + + /*! + @brief access the first element + + Returns a reference to the first element in the container. For a JSON + container `c`, the expression `c.front()` is equivalent to `*c.begin()`. + + @return In case of a structured type (array or object), a reference to the + first element is returned. In case of number, string, boolean, or binary + values, a reference to the value is returned. + + @complexity Constant. + + @pre The JSON value must not be `null` (would throw `std::out_of_range`) + or an empty array or object (undefined behavior, **guarded by + assertions**). + @post The JSON value remains unchanged. + + @throw invalid_iterator.214 when called on `null` value + + @liveexample{The following code shows an example for `front()`.,front} + + @sa @ref back() -- access the last element + + @since version 1.0.0 + */ + reference front() + { + return *begin(); + } + + /*! + @copydoc basic_json::front() + */ + const_reference front() const + { + return *cbegin(); + } + + /*! + @brief access the last element + + Returns a reference to the last element in the container. For a JSON + container `c`, the expression `c.back()` is equivalent to + @code {.cpp} + auto tmp = c.end(); + --tmp; + return *tmp; + @endcode + + @return In case of a structured type (array or object), a reference to the + last element is returned. In case of number, string, boolean, or binary + values, a reference to the value is returned. + + @complexity Constant. + + @pre The JSON value must not be `null` (would throw `std::out_of_range`) + or an empty array or object (undefined behavior, **guarded by + assertions**). + @post The JSON value remains unchanged. + + @throw invalid_iterator.214 when called on a `null` value. See example + below. + + @liveexample{The following code shows an example for `back()`.,back} + + @sa @ref front() -- access the first element + + @since version 1.0.0 + */ + reference back() + { + auto tmp = end(); + --tmp; + return *tmp; + } + + /*! + @copydoc basic_json::back() + */ + const_reference back() const + { + auto tmp = cend(); + --tmp; + return *tmp; + } + + /*! + @brief remove element given an iterator + + Removes the element specified by iterator @a pos. The iterator @a pos must + be valid and dereferenceable. Thus the `end()` iterator (which is valid, + but is not dereferenceable) cannot be used as a value for @a pos. + + If called on a primitive type other than `null`, the resulting JSON value + will be `null`. + + @param[in] pos iterator to the element to remove + @return Iterator following the last removed element. If the iterator @a + pos refers to the last element, the `end()` iterator is returned. + + @tparam IteratorType an @ref iterator or @ref const_iterator + + @post Invalidates iterators and references at or after the point of the + erase, including the `end()` iterator. + + @throw type_error.307 if called on a `null` value; example: `"cannot use + erase() with null"` + @throw invalid_iterator.202 if called on an iterator which does not belong + to the current JSON value; example: `"iterator does not fit current + value"` + @throw invalid_iterator.205 if called on a primitive type with invalid + iterator (i.e., any iterator which is not `begin()`); example: `"iterator + out of range"` + + @complexity The complexity depends on the type: + - objects: amortized constant + - arrays: linear in distance between @a pos and the end of the container + - strings and binary: linear in the length of the member + - other types: constant + + @liveexample{The example shows the result of `erase()` for different JSON + types.,erase__IteratorType} + + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + template < class IteratorType, typename std::enable_if < + std::is_same::value || + std::is_same::value, int >::type + = 0 > + IteratorType erase(IteratorType pos) + { + // make sure iterator fits the current value + if (JSON_HEDLEY_UNLIKELY(this != pos.m_object)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + IteratorType result = end(); + + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + case value_t::binary: + { + if (JSON_HEDLEY_UNLIKELY(!pos.m_it.primitive_iterator.is_begin())) + { + JSON_THROW(invalid_iterator::create(205, "iterator out of range")); + } + + if (is_string()) + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, m_value.string); + std::allocator_traits::deallocate(alloc, m_value.string, 1); + m_value.string = nullptr; + } + else if (is_binary()) + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, m_value.binary); + std::allocator_traits::deallocate(alloc, m_value.binary, 1); + m_value.binary = nullptr; + } + + m_type = value_t::null; + assert_invariant(); + break; + } + + case value_t::object: + { + result.m_it.object_iterator = m_value.object->erase(pos.m_it.object_iterator); + break; + } + + case value_t::array: + { + result.m_it.array_iterator = m_value.array->erase(pos.m_it.array_iterator); + break; + } + + default: + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + return result; + } + + /*! + @brief remove elements given an iterator range + + Removes the element specified by the range `[first; last)`. The iterator + @a first does not need to be dereferenceable if `first == last`: erasing + an empty range is a no-op. + + If called on a primitive type other than `null`, the resulting JSON value + will be `null`. + + @param[in] first iterator to the beginning of the range to remove + @param[in] last iterator past the end of the range to remove + @return Iterator following the last removed element. If the iterator @a + second refers to the last element, the `end()` iterator is returned. + + @tparam IteratorType an @ref iterator or @ref const_iterator + + @post Invalidates iterators and references at or after the point of the + erase, including the `end()` iterator. + + @throw type_error.307 if called on a `null` value; example: `"cannot use + erase() with null"` + @throw invalid_iterator.203 if called on iterators which does not belong + to the current JSON value; example: `"iterators do not fit current value"` + @throw invalid_iterator.204 if called on a primitive type with invalid + iterators (i.e., if `first != begin()` and `last != end()`); example: + `"iterators out of range"` + + @complexity The complexity depends on the type: + - objects: `log(size()) + std::distance(first, last)` + - arrays: linear in the distance between @a first and @a last, plus linear + in the distance between @a last and end of the container + - strings and binary: linear in the length of the member + - other types: constant + + @liveexample{The example shows the result of `erase()` for different JSON + types.,erase__IteratorType_IteratorType} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + template < class IteratorType, typename std::enable_if < + std::is_same::value || + std::is_same::value, int >::type + = 0 > + IteratorType erase(IteratorType first, IteratorType last) + { + // make sure iterator fits the current value + if (JSON_HEDLEY_UNLIKELY(this != first.m_object || this != last.m_object)) + { + JSON_THROW(invalid_iterator::create(203, "iterators do not fit current value")); + } + + IteratorType result = end(); + + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + case value_t::binary: + { + if (JSON_HEDLEY_LIKELY(!first.m_it.primitive_iterator.is_begin() + || !last.m_it.primitive_iterator.is_end())) + { + JSON_THROW(invalid_iterator::create(204, "iterators out of range")); + } + + if (is_string()) + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, m_value.string); + std::allocator_traits::deallocate(alloc, m_value.string, 1); + m_value.string = nullptr; + } + else if (is_binary()) + { + AllocatorType alloc; + std::allocator_traits::destroy(alloc, m_value.binary); + std::allocator_traits::deallocate(alloc, m_value.binary, 1); + m_value.binary = nullptr; + } + + m_type = value_t::null; + assert_invariant(); + break; + } + + case value_t::object: + { + result.m_it.object_iterator = m_value.object->erase(first.m_it.object_iterator, + last.m_it.object_iterator); + break; + } + + case value_t::array: + { + result.m_it.array_iterator = m_value.array->erase(first.m_it.array_iterator, + last.m_it.array_iterator); + break; + } + + default: + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + return result; + } + + /*! + @brief remove element from a JSON object given a key + + Removes elements from a JSON object with the key value @a key. + + @param[in] key value of the elements to remove + + @return Number of elements removed. If @a ObjectType is the default + `std::map` type, the return value will always be `0` (@a key was not + found) or `1` (@a key was found). + + @post References and iterators to the erased elements are invalidated. + Other references and iterators are not affected. + + @throw type_error.307 when called on a type other than JSON object; + example: `"cannot use erase() with null"` + + @complexity `log(size()) + count(key)` + + @liveexample{The example shows the effect of `erase()`.,erase__key_type} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + size_type erase(const typename object_t::key_type& key) + { + // this erase only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + return m_value.object->erase(key); + } + + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + /*! + @brief remove element from a JSON array given an index + + Removes element from a JSON array at the index @a idx. + + @param[in] idx index of the element to remove + + @throw type_error.307 when called on a type other than JSON object; + example: `"cannot use erase() with null"` + @throw out_of_range.401 when `idx >= size()`; example: `"array index 17 + is out of range"` + + @complexity Linear in distance between @a idx and the end of the container. + + @liveexample{The example shows the effect of `erase()`.,erase__size_type} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + + @since version 1.0.0 + */ + void erase(const size_type idx) + { + // this erase only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + if (JSON_HEDLEY_UNLIKELY(idx >= size())) + { + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + + m_value.array->erase(m_value.array->begin() + static_cast(idx)); + } + else + { + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + } + + /// @} + + + //////////// + // lookup // + //////////// + + /// @name lookup + /// @{ + + /*! + @brief find an element in a JSON object + + Finds an element in a JSON object with key equivalent to @a key. If the + element is not found or the JSON value is not an object, end() is + returned. + + @note This method always returns @ref end() when executed on a JSON type + that is not an object. + + @param[in] key key value of the element to search for. + + @return Iterator to an element with key equivalent to @a key. If no such + element is found or the JSON value is not an object, past-the-end (see + @ref end()) iterator is returned. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The example shows how `find()` is used.,find__key_type} + + @sa @ref contains(KeyT&&) const -- checks whether a key exists + + @since version 1.0.0 + */ + template + iterator find(KeyT&& key) + { + auto result = end(); + + if (is_object()) + { + result.m_it.object_iterator = m_value.object->find(std::forward(key)); + } + + return result; + } + + /*! + @brief find an element in a JSON object + @copydoc find(KeyT&&) + */ + template + const_iterator find(KeyT&& key) const + { + auto result = cend(); + + if (is_object()) + { + result.m_it.object_iterator = m_value.object->find(std::forward(key)); + } + + return result; + } + + /*! + @brief returns the number of occurrences of a key in a JSON object + + Returns the number of elements with key @a key. If ObjectType is the + default `std::map` type, the return value will always be `0` (@a key was + not found) or `1` (@a key was found). + + @note This method always returns `0` when executed on a JSON type that is + not an object. + + @param[in] key key value of the element to count + + @return Number of elements with key @a key. If the JSON value is not an + object, the return value will be `0`. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The example shows how `count()` is used.,count} + + @since version 1.0.0 + */ + template + size_type count(KeyT&& key) const + { + // return 0 for all nonobject types + return is_object() ? m_value.object->count(std::forward(key)) : 0; + } + + /*! + @brief check the existence of an element in a JSON object + + Check whether an element exists in a JSON object with key equivalent to + @a key. If the element is not found or the JSON value is not an object, + false is returned. + + @note This method always returns false when executed on a JSON type + that is not an object. + + @param[in] key key value to check its existence. + + @return true if an element with specified @a key exists. If no such + element with such key is found or the JSON value is not an object, + false is returned. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The following code shows an example for `contains()`.,contains} + + @sa @ref find(KeyT&&) -- returns an iterator to an object element + @sa @ref contains(const json_pointer&) const -- checks the existence for a JSON pointer + + @since version 3.6.0 + */ + template < typename KeyT, typename std::enable_if < + !std::is_same::type, json_pointer>::value, int >::type = 0 > + bool contains(KeyT && key) const + { + return is_object() && m_value.object->find(std::forward(key)) != m_value.object->end(); + } + + /*! + @brief check the existence of an element in a JSON object given a JSON pointer + + Check whether the given JSON pointer @a ptr can be resolved in the current + JSON value. + + @note This method can be executed on any JSON value type. + + @param[in] ptr JSON pointer to check its existence. + + @return true if the JSON pointer can be resolved to a stored value, false + otherwise. + + @post If `j.contains(ptr)` returns true, it is safe to call `j[ptr]`. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The following code shows an example for `contains()`.,contains_json_pointer} + + @sa @ref contains(KeyT &&) const -- checks the existence of a key + + @since version 3.7.0 + */ + bool contains(const json_pointer& ptr) const + { + return ptr.contains(this); + } + + /// @} + + + /////////////// + // iterators // + /////////////// + + /// @name iterators + /// @{ + + /*! + @brief returns an iterator to the first element + + Returns an iterator to the first element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return iterator to the first element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + + @liveexample{The following code shows an example for `begin()`.,begin} + + @sa @ref cbegin() -- returns a const iterator to the beginning + @sa @ref end() -- returns an iterator to the end + @sa @ref cend() -- returns a const iterator to the end + + @since version 1.0.0 + */ + iterator begin() noexcept + { + iterator result(this); + result.set_begin(); + return result; + } + + /*! + @copydoc basic_json::cbegin() + */ + const_iterator begin() const noexcept + { + return cbegin(); + } + + /*! + @brief returns a const iterator to the first element + + Returns a const iterator to the first element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return const iterator to the first element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast(*this).begin()`. + + @liveexample{The following code shows an example for `cbegin()`.,cbegin} + + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref end() -- returns an iterator to the end + @sa @ref cend() -- returns a const iterator to the end + + @since version 1.0.0 + */ + const_iterator cbegin() const noexcept + { + const_iterator result(this); + result.set_begin(); + return result; + } + + /*! + @brief returns an iterator to one past the last element + + Returns an iterator to one past the last element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return iterator one past the last element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + + @liveexample{The following code shows an example for `end()`.,end} + + @sa @ref cend() -- returns a const iterator to the end + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref cbegin() -- returns a const iterator to the beginning + + @since version 1.0.0 + */ + iterator end() noexcept + { + iterator result(this); + result.set_end(); + return result; + } + + /*! + @copydoc basic_json::cend() + */ + const_iterator end() const noexcept + { + return cend(); + } + + /*! + @brief returns a const iterator to one past the last element + + Returns a const iterator to one past the last element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return const iterator one past the last element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast(*this).end()`. + + @liveexample{The following code shows an example for `cend()`.,cend} + + @sa @ref end() -- returns an iterator to the end + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref cbegin() -- returns a const iterator to the beginning + + @since version 1.0.0 + */ + const_iterator cend() const noexcept + { + const_iterator result(this); + result.set_end(); + return result; + } + + /*! + @brief returns an iterator to the reverse-beginning + + Returns an iterator to the reverse-beginning; that is, the last element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `reverse_iterator(end())`. + + @liveexample{The following code shows an example for `rbegin()`.,rbegin} + + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref crend() -- returns a const reverse iterator to the end + + @since version 1.0.0 + */ + reverse_iterator rbegin() noexcept + { + return reverse_iterator(end()); + } + + /*! + @copydoc basic_json::crbegin() + */ + const_reverse_iterator rbegin() const noexcept + { + return crbegin(); + } + + /*! + @brief returns an iterator to the reverse-end + + Returns an iterator to the reverse-end; that is, one before the first + element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `reverse_iterator(begin())`. + + @liveexample{The following code shows an example for `rend()`.,rend} + + @sa @ref crend() -- returns a const reverse iterator to the end + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + + @since version 1.0.0 + */ + reverse_iterator rend() noexcept + { + return reverse_iterator(begin()); + } + + /*! + @copydoc basic_json::crend() + */ + const_reverse_iterator rend() const noexcept + { + return crend(); + } + + /*! + @brief returns a const reverse iterator to the last element + + Returns a const iterator to the reverse-beginning; that is, the last + element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast(*this).rbegin()`. + + @liveexample{The following code shows an example for `crbegin()`.,crbegin} + + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref crend() -- returns a const reverse iterator to the end + + @since version 1.0.0 + */ + const_reverse_iterator crbegin() const noexcept + { + return const_reverse_iterator(cend()); + } + + /*! + @brief returns a const reverse iterator to one before the first + + Returns a const reverse iterator to the reverse-end; that is, one before + the first element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast(*this).rend()`. + + @liveexample{The following code shows an example for `crend()`.,crend} + + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + + @since version 1.0.0 + */ + const_reverse_iterator crend() const noexcept + { + return const_reverse_iterator(cbegin()); + } + + public: + /*! + @brief wrapper to access iterator member functions in range-based for + + This function allows to access @ref iterator::key() and @ref + iterator::value() during range-based for loops. In these loops, a + reference to the JSON values is returned, so there is no access to the + underlying iterator. + + For loop without iterator_wrapper: + + @code{cpp} + for (auto it = j_object.begin(); it != j_object.end(); ++it) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + Range-based for loop without iterator proxy: + + @code{cpp} + for (auto it : j_object) + { + // "it" is of type json::reference and has no key() member + std::cout << "value: " << it << '\n'; + } + @endcode + + Range-based for loop with iterator proxy: + + @code{cpp} + for (auto it : json::iterator_wrapper(j_object)) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + @note When iterating over an array, `key()` will return the index of the + element as string (see example). + + @param[in] ref reference to a JSON value + @return iteration proxy object wrapping @a ref with an interface to use in + range-based for loops + + @liveexample{The following code shows how the wrapper is used,iterator_wrapper} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @note The name of this function is not yet final and may change in the + future. + + @deprecated This stream operator is deprecated and will be removed in + future 4.0.0 of the library. Please use @ref items() instead; + that is, replace `json::iterator_wrapper(j)` with `j.items()`. + */ + JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items()) + static iteration_proxy iterator_wrapper(reference ref) noexcept + { + return ref.items(); + } + + /*! + @copydoc iterator_wrapper(reference) + */ + JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items()) + static iteration_proxy iterator_wrapper(const_reference ref) noexcept + { + return ref.items(); + } + + /*! + @brief helper to access iterator member functions in range-based for + + This function allows to access @ref iterator::key() and @ref + iterator::value() during range-based for loops. In these loops, a + reference to the JSON values is returned, so there is no access to the + underlying iterator. + + For loop without `items()` function: + + @code{cpp} + for (auto it = j_object.begin(); it != j_object.end(); ++it) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + Range-based for loop without `items()` function: + + @code{cpp} + for (auto it : j_object) + { + // "it" is of type json::reference and has no key() member + std::cout << "value: " << it << '\n'; + } + @endcode + + Range-based for loop with `items()` function: + + @code{cpp} + for (auto& el : j_object.items()) + { + std::cout << "key: " << el.key() << ", value:" << el.value() << '\n'; + } + @endcode + + The `items()` function also allows to use + [structured bindings](https://en.cppreference.com/w/cpp/language/structured_binding) + (C++17): + + @code{cpp} + for (auto& [key, val] : j_object.items()) + { + std::cout << "key: " << key << ", value:" << val << '\n'; + } + @endcode + + @note When iterating over an array, `key()` will return the index of the + element as string (see example). For primitive types (e.g., numbers), + `key()` returns an empty string. + + @warning Using `items()` on temporary objects is dangerous. Make sure the + object's lifetime exeeds the iteration. See + for more + information. + + @return iteration proxy object wrapping @a ref with an interface to use in + range-based for loops + + @liveexample{The following code shows how the function is used.,items} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 3.1.0, structured bindings support since 3.5.0. + */ + iteration_proxy items() noexcept + { + return iteration_proxy(*this); + } + + /*! + @copydoc items() + */ + iteration_proxy items() const noexcept + { + return iteration_proxy(*this); + } + + /// @} + + + ////////////// + // capacity // + ////////////// + + /// @name capacity + /// @{ + + /*! + @brief checks whether the container is empty. + + Checks if a JSON value has no elements (i.e. whether its @ref size is `0`). + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `true` + boolean | `false` + string | `false` + number | `false` + binary | `false` + object | result of function `object_t::empty()` + array | result of function `array_t::empty()` + + @liveexample{The following code uses `empty()` to check if a JSON + object contains any elements.,empty} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their `empty()` functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @note This function does not return whether a string stored as JSON value + is empty - it returns whether the JSON container itself is empty which is + false in the case of a string. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `begin() == end()`. + + @sa @ref size() -- returns the number of elements + + @since version 1.0.0 + */ + bool empty() const noexcept + { + switch (m_type) + { + case value_t::null: + { + // null values are empty + return true; + } + + case value_t::array: + { + // delegate call to array_t::empty() + return m_value.array->empty(); + } + + case value_t::object: + { + // delegate call to object_t::empty() + return m_value.object->empty(); + } + + default: + { + // all other types are nonempty + return false; + } + } + } + + /*! + @brief returns the number of elements + + Returns the number of elements in a JSON value. + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `0` + boolean | `1` + string | `1` + number | `1` + binary | `1` + object | result of function object_t::size() + array | result of function array_t::size() + + @liveexample{The following code calls `size()` on the different value + types.,size} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their size() functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @note This function does not return the length of a string stored as JSON + value - it returns the number of elements in the JSON value which is 1 in + the case of a string. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `std::distance(begin(), end())`. + + @sa @ref empty() -- checks whether the container is empty + @sa @ref max_size() -- returns the maximal number of elements + + @since version 1.0.0 + */ + size_type size() const noexcept + { + switch (m_type) + { + case value_t::null: + { + // null values are empty + return 0; + } + + case value_t::array: + { + // delegate call to array_t::size() + return m_value.array->size(); + } + + case value_t::object: + { + // delegate call to object_t::size() + return m_value.object->size(); + } + + default: + { + // all other types have size 1 + return 1; + } + } + } + + /*! + @brief returns the maximum possible number of elements + + Returns the maximum number of elements a JSON value is able to hold due to + system or library implementation limitations, i.e. `std::distance(begin(), + end())` for the JSON value. + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `0` (same as `size()`) + boolean | `1` (same as `size()`) + string | `1` (same as `size()`) + number | `1` (same as `size()`) + binary | `1` (same as `size()`) + object | result of function `object_t::max_size()` + array | result of function `array_t::max_size()` + + @liveexample{The following code calls `max_size()` on the different value + types. Note the output is implementation specific.,max_size} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their `max_size()` functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of returning `b.size()` where `b` is the largest + possible JSON value. + + @sa @ref size() -- returns the number of elements + + @since version 1.0.0 + */ + size_type max_size() const noexcept + { + switch (m_type) + { + case value_t::array: + { + // delegate call to array_t::max_size() + return m_value.array->max_size(); + } + + case value_t::object: + { + // delegate call to object_t::max_size() + return m_value.object->max_size(); + } + + default: + { + // all other types have max_size() == size() + return size(); + } + } + } + + /// @} + + + /////////////// + // modifiers // + /////////////// + + /// @name modifiers + /// @{ + + /*! + @brief clears the contents + + Clears the content of a JSON value and resets it to the default value as + if @ref basic_json(value_t) would have been called with the current value + type from @ref type(): + + Value type | initial value + ----------- | ------------- + null | `null` + boolean | `false` + string | `""` + number | `0` + binary | An empty byte vector + object | `{}` + array | `[]` + + @post Has the same effect as calling + @code {.cpp} + *this = basic_json(type()); + @endcode + + @liveexample{The example below shows the effect of `clear()` to different + JSON types.,clear} + + @complexity Linear in the size of the JSON value. + + @iterators All iterators, pointers and references related to this container + are invalidated. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @sa @ref basic_json(value_t) -- constructor that creates an object with the + same value than calling `clear()` + + @since version 1.0.0 + */ + void clear() noexcept + { + switch (m_type) + { + case value_t::number_integer: + { + m_value.number_integer = 0; + break; + } + + case value_t::number_unsigned: + { + m_value.number_unsigned = 0; + break; + } + + case value_t::number_float: + { + m_value.number_float = 0.0; + break; + } + + case value_t::boolean: + { + m_value.boolean = false; + break; + } + + case value_t::string: + { + m_value.string->clear(); + break; + } + + case value_t::binary: + { + m_value.binary->clear(); + break; + } + + case value_t::array: + { + m_value.array->clear(); + break; + } + + case value_t::object: + { + m_value.object->clear(); + break; + } + + default: + break; + } + } + + /*! + @brief add an object to an array + + Appends the given element @a val to the end of the JSON value. If the + function is called on a JSON null value, an empty array is created before + appending @a val. + + @param[in] val the value to add to the JSON array + + @throw type_error.308 when called on a type other than JSON array or + null; example: `"cannot use push_back() with number"` + + @complexity Amortized constant. + + @liveexample{The example shows how `push_back()` and `+=` can be used to + add elements to a JSON array. Note how the `null` value was silently + converted to a JSON array.,push_back} + + @since version 1.0.0 + */ + void push_back(basic_json&& val) + { + // push_back only works for null objects or arrays + if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array (move semantics) + m_value.array->push_back(std::move(val)); + // if val is moved from, basic_json move constructor marks it null so we do not call the destructor + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + reference operator+=(basic_json&& val) + { + push_back(std::move(val)); + return *this; + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + void push_back(const basic_json& val) + { + // push_back only works for null objects or arrays + if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array + m_value.array->push_back(val); + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + reference operator+=(const basic_json& val) + { + push_back(val); + return *this; + } + + /*! + @brief add an object to an object + + Inserts the given element @a val to the JSON object. If the function is + called on a JSON null value, an empty object is created before inserting + @a val. + + @param[in] val the value to add to the JSON object + + @throw type_error.308 when called on a type other than JSON object or + null; example: `"cannot use push_back() with number"` + + @complexity Logarithmic in the size of the container, O(log(`size()`)). + + @liveexample{The example shows how `push_back()` and `+=` can be used to + add elements to a JSON object. Note how the `null` value was silently + converted to a JSON object.,push_back__object_t__value} + + @since version 1.0.0 + */ + void push_back(const typename object_t::value_type& val) + { + // push_back only works for null objects or objects + if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // add element to array + m_value.object->insert(val); + } + + /*! + @brief add an object to an object + @copydoc push_back(const typename object_t::value_type&) + */ + reference operator+=(const typename object_t::value_type& val) + { + push_back(val); + return *this; + } + + /*! + @brief add an object to an object + + This function allows to use `push_back` with an initializer list. In case + + 1. the current value is an object, + 2. the initializer list @a init contains only two elements, and + 3. the first element of @a init is a string, + + @a init is converted into an object element and added using + @ref push_back(const typename object_t::value_type&). Otherwise, @a init + is converted to a JSON value and added using @ref push_back(basic_json&&). + + @param[in] init an initializer list + + @complexity Linear in the size of the initializer list @a init. + + @note This function is required to resolve an ambiguous overload error, + because pairs like `{"key", "value"}` can be both interpreted as + `object_t::value_type` or `std::initializer_list`, see + https://github.com/nlohmann/json/issues/235 for more information. + + @liveexample{The example shows how initializer lists are treated as + objects when possible.,push_back__initializer_list} + */ + void push_back(initializer_list_t init) + { + if (is_object() && init.size() == 2 && (*init.begin())->is_string()) + { + basic_json&& key = init.begin()->moved_or_copied(); + push_back(typename object_t::value_type( + std::move(key.get_ref()), (init.begin() + 1)->moved_or_copied())); + } + else + { + push_back(basic_json(init)); + } + } + + /*! + @brief add an object to an object + @copydoc push_back(initializer_list_t) + */ + reference operator+=(initializer_list_t init) + { + push_back(init); + return *this; + } + + /*! + @brief add an object to an array + + Creates a JSON value from the passed parameters @a args to the end of the + JSON value. If the function is called on a JSON null value, an empty array + is created before appending the value created from @a args. + + @param[in] args arguments to forward to a constructor of @ref basic_json + @tparam Args compatible types to create a @ref basic_json object + + @return reference to the inserted element + + @throw type_error.311 when called on a type other than JSON array or + null; example: `"cannot use emplace_back() with number"` + + @complexity Amortized constant. + + @liveexample{The example shows how `push_back()` can be used to add + elements to a JSON array. Note how the `null` value was silently converted + to a JSON array.,emplace_back} + + @since version 2.0.8, returns reference since 3.7.0 + */ + template + reference emplace_back(Args&& ... args) + { + // emplace_back only works for null objects or arrays + if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array()))) + { + JSON_THROW(type_error::create(311, "cannot use emplace_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array (perfect forwarding) +#ifdef JSON_HAS_CPP_17 + return m_value.array->emplace_back(std::forward(args)...); +#else + m_value.array->emplace_back(std::forward(args)...); + return m_value.array->back(); +#endif + } + + /*! + @brief add an object to an object if key does not exist + + Inserts a new element into a JSON object constructed in-place with the + given @a args if there is no element with the key in the container. If the + function is called on a JSON null value, an empty object is created before + appending the value created from @a args. + + @param[in] args arguments to forward to a constructor of @ref basic_json + @tparam Args compatible types to create a @ref basic_json object + + @return a pair consisting of an iterator to the inserted element, or the + already-existing element if no insertion happened, and a bool + denoting whether the insertion took place. + + @throw type_error.311 when called on a type other than JSON object or + null; example: `"cannot use emplace() with number"` + + @complexity Logarithmic in the size of the container, O(log(`size()`)). + + @liveexample{The example shows how `emplace()` can be used to add elements + to a JSON object. Note how the `null` value was silently converted to a + JSON object. Further note how no value is added if there was already one + value stored with the same key.,emplace} + + @since version 2.0.8 + */ + template + std::pair emplace(Args&& ... args) + { + // emplace only works for null objects or arrays + if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object()))) + { + JSON_THROW(type_error::create(311, "cannot use emplace() with " + std::string(type_name()))); + } + + // transform null object into an object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // add element to array (perfect forwarding) + auto res = m_value.object->emplace(std::forward(args)...); + // create result iterator and set iterator to the result of emplace + auto it = begin(); + it.m_it.object_iterator = res.first; + + // return pair of iterator and boolean + return {it, res.second}; + } + + /// Helper for insertion of an iterator + /// @note: This uses std::distance to support GCC 4.8, + /// see https://github.com/nlohmann/json/pull/1257 + template + iterator insert_iterator(const_iterator pos, Args&& ... args) + { + iterator result(this); + JSON_ASSERT(m_value.array != nullptr); + + auto insert_pos = std::distance(m_value.array->begin(), pos.m_it.array_iterator); + m_value.array->insert(pos.m_it.array_iterator, std::forward(args)...); + result.m_it.array_iterator = m_value.array->begin() + insert_pos; + + // This could have been written as: + // result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, cnt, val); + // but the return value of insert is missing in GCC 4.8, so it is written this way instead. + + return result; + } + + /*! + @brief inserts element + + Inserts element @a val before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] val element to insert + @return iterator pointing to the inserted @a val. + + @throw type_error.309 if called on JSON values other than arrays; + example: `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @complexity Constant plus linear in the distance between @a pos and end of + the container. + + @liveexample{The example shows how `insert()` is used.,insert} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, const basic_json& val) + { + // insert only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + // check if iterator pos fits to this JSON value + if (JSON_HEDLEY_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, val); + } + + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + /*! + @brief inserts element + @copydoc insert(const_iterator, const basic_json&) + */ + iterator insert(const_iterator pos, basic_json&& val) + { + return insert(pos, val); + } + + /*! + @brief inserts elements + + Inserts @a cnt copies of @a val before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] cnt number of copies of @a val to insert + @param[in] val element to insert + @return iterator pointing to the first element inserted, or @a pos if + `cnt==0` + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @complexity Linear in @a cnt plus linear in the distance between @a pos + and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__count} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, size_type cnt, const basic_json& val) + { + // insert only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + // check if iterator pos fits to this JSON value + if (JSON_HEDLEY_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, cnt, val); + } + + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + /*! + @brief inserts elements + + Inserts elements from range `[first, last)` before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + @throw invalid_iterator.211 if @a first or @a last are iterators into + container for which insert is called; example: `"passed iterators may not + belong to container"` + + @return iterator pointing to the first element inserted, or @a pos if + `first==last` + + @complexity Linear in `std::distance(first, last)` plus linear in the + distance between @a pos and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__range} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, const_iterator first, const_iterator last) + { + // insert only works for arrays + if (JSON_HEDLEY_UNLIKELY(!is_array())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if iterator pos fits to this JSON value + if (JSON_HEDLEY_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // check if range iterators belong to the same JSON object + if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + if (JSON_HEDLEY_UNLIKELY(first.m_object == this)) + { + JSON_THROW(invalid_iterator::create(211, "passed iterators may not belong to container")); + } + + // insert to array and return iterator + return insert_iterator(pos, first.m_it.array_iterator, last.m_it.array_iterator); + } + + /*! + @brief inserts elements + + Inserts elements from initializer list @a ilist before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] ilist initializer list to insert the values from + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @return iterator pointing to the first element inserted, or @a pos if + `ilist` is empty + + @complexity Linear in `ilist.size()` plus linear in the distance between + @a pos and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__ilist} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, initializer_list_t ilist) + { + // insert only works for arrays + if (JSON_HEDLEY_UNLIKELY(!is_array())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if iterator pos fits to this JSON value + if (JSON_HEDLEY_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, ilist.begin(), ilist.end()); + } + + /*! + @brief inserts elements + + Inserts elements from range `[first, last)`. + + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.309 if called on JSON values other than objects; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if iterator @a first or @a last does does not + point to an object; example: `"iterators first and last must point to + objects"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + + @complexity Logarithmic: `O(N*log(size() + N))`, where `N` is the number + of elements to insert. + + @liveexample{The example shows how `insert()` is used.,insert__range_object} + + @since version 3.0.0 + */ + void insert(const_iterator first, const_iterator last) + { + // insert only works for objects + if (JSON_HEDLEY_UNLIKELY(!is_object())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if range iterators belong to the same JSON object + if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + // passed iterators must belong to objects + if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object())) + { + JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects")); + } + + m_value.object->insert(first.m_it.object_iterator, last.m_it.object_iterator); + } + + /*! + @brief updates a JSON object from another object, overwriting existing keys + + Inserts all values from JSON object @a j and overwrites existing keys. + + @param[in] j JSON object to read values from + + @throw type_error.312 if called on JSON values other than objects; example: + `"cannot use update() with string"` + + @complexity O(N*log(size() + N)), where N is the number of elements to + insert. + + @liveexample{The example shows how `update()` is used.,update} + + @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update + + @since version 3.0.0 + */ + void update(const_reference j) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create(); + assert_invariant(); + } + + if (JSON_HEDLEY_UNLIKELY(!is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name()))); + } + if (JSON_HEDLEY_UNLIKELY(!j.is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(j.type_name()))); + } + + for (auto it = j.cbegin(); it != j.cend(); ++it) + { + m_value.object->operator[](it.key()) = it.value(); + } + } + + /*! + @brief updates a JSON object from another object, overwriting existing keys + + Inserts all values from from range `[first, last)` and overwrites existing + keys. + + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.312 if called on JSON values other than objects; example: + `"cannot use update() with string"` + @throw invalid_iterator.202 if iterator @a first or @a last does does not + point to an object; example: `"iterators first and last must point to + objects"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + + @complexity O(N*log(size() + N)), where N is the number of elements to + insert. + + @liveexample{The example shows how `update()` is used__range.,update} + + @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update + + @since version 3.0.0 + */ + void update(const_iterator first, const_iterator last) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create(); + assert_invariant(); + } + + if (JSON_HEDLEY_UNLIKELY(!is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name()))); + } + + // check if range iterators belong to the same JSON object + if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + // passed iterators must belong to objects + if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object() + || !last.m_object->is_object())) + { + JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects")); + } + + for (auto it = first; it != last; ++it) + { + m_value.object->operator[](it.key()) = it.value(); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of the JSON value with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other JSON value to exchange the contents with + + @complexity Constant. + + @liveexample{The example below shows how JSON values can be swapped with + `swap()`.,swap__reference} + + @since version 1.0.0 + */ + void swap(reference other) noexcept ( + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value&& + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value + ) + { + std::swap(m_type, other.m_type); + std::swap(m_value, other.m_value); + assert_invariant(); + } + + /*! + @brief exchanges the values + + Exchanges the contents of the JSON value from @a left with those of @a right. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. implemented as a friend function callable via ADL. + + @param[in,out] left JSON value to exchange the contents with + @param[in,out] right JSON value to exchange the contents with + + @complexity Constant. + + @liveexample{The example below shows how JSON values can be swapped with + `swap()`.,swap__reference} + + @since version 1.0.0 + */ + friend void swap(reference left, reference right) noexcept ( + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value&& + std::is_nothrow_move_constructible::value&& + std::is_nothrow_move_assignable::value + ) + { + left.swap(right); + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON array with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other array to exchange the contents with + + @throw type_error.310 when JSON value is not an array; example: `"cannot + use swap() with string"` + + @complexity Constant. + + @liveexample{The example below shows how arrays can be swapped with + `swap()`.,swap__array_t} + + @since version 1.0.0 + */ + void swap(array_t& other) + { + // swap only works for arrays + if (JSON_HEDLEY_LIKELY(is_array())) + { + std::swap(*(m_value.array), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON object with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other object to exchange the contents with + + @throw type_error.310 when JSON value is not an object; example: + `"cannot use swap() with string"` + + @complexity Constant. + + @liveexample{The example below shows how objects can be swapped with + `swap()`.,swap__object_t} + + @since version 1.0.0 + */ + void swap(object_t& other) + { + // swap only works for objects + if (JSON_HEDLEY_LIKELY(is_object())) + { + std::swap(*(m_value.object), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON string with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other string to exchange the contents with + + @throw type_error.310 when JSON value is not a string; example: `"cannot + use swap() with boolean"` + + @complexity Constant. + + @liveexample{The example below shows how strings can be swapped with + `swap()`.,swap__string_t} + + @since version 1.0.0 + */ + void swap(string_t& other) + { + // swap only works for strings + if (JSON_HEDLEY_LIKELY(is_string())) + { + std::swap(*(m_value.string), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON string with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other binary to exchange the contents with + + @throw type_error.310 when JSON value is not a string; example: `"cannot + use swap() with boolean"` + + @complexity Constant. + + @liveexample{The example below shows how strings can be swapped with + `swap()`.,swap__binary_t} + + @since version 3.8.0 + */ + void swap(binary_t& other) + { + // swap only works for strings + if (JSON_HEDLEY_LIKELY(is_binary())) + { + std::swap(*(m_value.binary), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /// @copydoc swap(binary_t) + void swap(typename binary_t::container_type& other) + { + // swap only works for strings + if (JSON_HEDLEY_LIKELY(is_binary())) + { + std::swap(*(m_value.binary), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /// @} + + public: + ////////////////////////////////////////// + // lexicographical comparison operators // + ////////////////////////////////////////// + + /// @name lexicographical comparison operators + /// @{ + + /*! + @brief comparison: equal + + Compares two JSON values for equality according to the following rules: + - Two JSON values are equal if (1) they are from the same type and (2) + their stored values are the same according to their respective + `operator==`. + - Integer and floating-point numbers are automatically converted before + comparison. Note that two NaN values are always treated as unequal. + - Two JSON null values are equal. + + @note Floating-point inside JSON values numbers are compared with + `json::number_float_t::operator==` which is `double::operator==` by + default. To compare floating-point while respecting an epsilon, an alternative + [comparison function](https://github.com/mariokonrad/marnav/blob/master/include/marnav/math/floatingpoint.hpp#L34-#L39) + could be used, for instance + @code {.cpp} + template::value, T>::type> + inline bool is_same(T a, T b, T epsilon = std::numeric_limits::epsilon()) noexcept + { + return std::abs(a - b) <= epsilon; + } + @endcode + Or you can self-defined operator equal function like this: + @code {.cpp} + bool my_equal(const_reference lhs, const_reference rhs) { + const auto lhs_type lhs.type(); + const auto rhs_type rhs.type(); + if (lhs_type == rhs_type) { + switch(lhs_type) + // self_defined case + case value_t::number_float: + return std::abs(lhs - rhs) <= std::numeric_limits::epsilon(); + // other cases remain the same with the original + ... + } + ... + } + @endcode + + @note NaN values never compare equal to themselves or to other NaN values. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether the values @a lhs and @a rhs are equal + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @complexity Linear. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__equal} + + @since version 1.0.0 + */ + friend bool operator==(const_reference lhs, const_reference rhs) noexcept + { + const auto lhs_type = lhs.type(); + const auto rhs_type = rhs.type(); + + if (lhs_type == rhs_type) + { + switch (lhs_type) + { + case value_t::array: + return *lhs.m_value.array == *rhs.m_value.array; + + case value_t::object: + return *lhs.m_value.object == *rhs.m_value.object; + + case value_t::null: + return true; + + case value_t::string: + return *lhs.m_value.string == *rhs.m_value.string; + + case value_t::boolean: + return lhs.m_value.boolean == rhs.m_value.boolean; + + case value_t::number_integer: + return lhs.m_value.number_integer == rhs.m_value.number_integer; + + case value_t::number_unsigned: + return lhs.m_value.number_unsigned == rhs.m_value.number_unsigned; + + case value_t::number_float: + return lhs.m_value.number_float == rhs.m_value.number_float; + + case value_t::binary: + return *lhs.m_value.binary == *rhs.m_value.binary; + + default: + return false; + } + } + else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_float) + { + return static_cast(lhs.m_value.number_integer) == rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float && rhs_type == value_t::number_integer) + { + return lhs.m_value.number_float == static_cast(rhs.m_value.number_integer); + } + else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_float) + { + return static_cast(lhs.m_value.number_unsigned) == rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float && rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_float == static_cast(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_integer) + { + return static_cast(lhs.m_value.number_unsigned) == rhs.m_value.number_integer; + } + else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_integer == static_cast(rhs.m_value.number_unsigned); + } + + return false; + } + + /*! + @brief comparison: equal + @copydoc operator==(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator==(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs == basic_json(rhs); + } + + /*! + @brief comparison: equal + @copydoc operator==(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator==(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) == rhs; + } + + /*! + @brief comparison: not equal + + Compares two JSON values for inequality by calculating `not (lhs == rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether the values @a lhs and @a rhs are not equal + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__notequal} + + @since version 1.0.0 + */ + friend bool operator!=(const_reference lhs, const_reference rhs) noexcept + { + return !(lhs == rhs); + } + + /*! + @brief comparison: not equal + @copydoc operator!=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator!=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs != basic_json(rhs); + } + + /*! + @brief comparison: not equal + @copydoc operator!=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator!=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) != rhs; + } + + /*! + @brief comparison: less than + + Compares whether one JSON value @a lhs is less than another JSON value @a + rhs according to the following rules: + - If @a lhs and @a rhs have the same type, the values are compared using + the default `<` operator. + - Integer and floating-point numbers are automatically converted before + comparison + - In case @a lhs and @a rhs have different types, the values are ignored + and the order of the types is considered, see + @ref operator<(const value_t, const value_t). + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is less than @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__less} + + @since version 1.0.0 + */ + friend bool operator<(const_reference lhs, const_reference rhs) noexcept + { + const auto lhs_type = lhs.type(); + const auto rhs_type = rhs.type(); + + if (lhs_type == rhs_type) + { + switch (lhs_type) + { + case value_t::array: + // note parentheses are necessary, see + // https://github.com/nlohmann/json/issues/1530 + return (*lhs.m_value.array) < (*rhs.m_value.array); + + case value_t::object: + return (*lhs.m_value.object) < (*rhs.m_value.object); + + case value_t::null: + return false; + + case value_t::string: + return (*lhs.m_value.string) < (*rhs.m_value.string); + + case value_t::boolean: + return (lhs.m_value.boolean) < (rhs.m_value.boolean); + + case value_t::number_integer: + return (lhs.m_value.number_integer) < (rhs.m_value.number_integer); + + case value_t::number_unsigned: + return (lhs.m_value.number_unsigned) < (rhs.m_value.number_unsigned); + + case value_t::number_float: + return (lhs.m_value.number_float) < (rhs.m_value.number_float); + + case value_t::binary: + return (*lhs.m_value.binary) < (*rhs.m_value.binary); + + default: + return false; + } + } + else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_float) + { + return static_cast(lhs.m_value.number_integer) < rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float && rhs_type == value_t::number_integer) + { + return lhs.m_value.number_float < static_cast(rhs.m_value.number_integer); + } + else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_float) + { + return static_cast(lhs.m_value.number_unsigned) < rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float && rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_float < static_cast(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_integer < static_cast(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_integer) + { + return static_cast(lhs.m_value.number_unsigned) < rhs.m_value.number_integer; + } + + // We only reach this line if we cannot compare values. In that case, + // we compare types. Note we have to call the operator explicitly, + // because MSVC has problems otherwise. + return operator<(lhs_type, rhs_type); + } + + /*! + @brief comparison: less than + @copydoc operator<(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator<(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs < basic_json(rhs); + } + + /*! + @brief comparison: less than + @copydoc operator<(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator<(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) < rhs; + } + + /*! + @brief comparison: less than or equal + + Compares whether one JSON value @a lhs is less than or equal to another + JSON value by calculating `not (rhs < lhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is less than or equal to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__greater} + + @since version 1.0.0 + */ + friend bool operator<=(const_reference lhs, const_reference rhs) noexcept + { + return !(rhs < lhs); + } + + /*! + @brief comparison: less than or equal + @copydoc operator<=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator<=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs <= basic_json(rhs); + } + + /*! + @brief comparison: less than or equal + @copydoc operator<=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator<=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) <= rhs; + } + + /*! + @brief comparison: greater than + + Compares whether one JSON value @a lhs is greater than another + JSON value by calculating `not (lhs <= rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is greater than to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__lessequal} + + @since version 1.0.0 + */ + friend bool operator>(const_reference lhs, const_reference rhs) noexcept + { + return !(lhs <= rhs); + } + + /*! + @brief comparison: greater than + @copydoc operator>(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator>(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs > basic_json(rhs); + } + + /*! + @brief comparison: greater than + @copydoc operator>(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator>(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) > rhs; + } + + /*! + @brief comparison: greater than or equal + + Compares whether one JSON value @a lhs is greater than or equal to another + JSON value by calculating `not (lhs < rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is greater than or equal to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__greaterequal} + + @since version 1.0.0 + */ + friend bool operator>=(const_reference lhs, const_reference rhs) noexcept + { + return !(lhs < rhs); + } + + /*! + @brief comparison: greater than or equal + @copydoc operator>=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator>=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs >= basic_json(rhs); + } + + /*! + @brief comparison: greater than or equal + @copydoc operator>=(const_reference, const_reference) + */ + template::value, int>::type = 0> + friend bool operator>=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) >= rhs; + } + + /// @} + + /////////////////// + // serialization // + /////////////////// + + /// @name serialization + /// @{ + + /*! + @brief serialize to stream + + Serialize the given JSON value @a j to the output stream @a o. The JSON + value will be serialized using the @ref dump member function. + + - The indentation of the output can be controlled with the member variable + `width` of the output stream @a o. For instance, using the manipulator + `std::setw(4)` on @a o sets the indentation level to `4` and the + serialization result is the same as calling `dump(4)`. + + - The indentation character can be controlled with the member variable + `fill` of the output stream @a o. For instance, the manipulator + `std::setfill('\\t')` sets indentation to use a tab character rather than + the default space character. + + @param[in,out] o stream to serialize to + @param[in] j JSON value to serialize + + @return the stream @a o + + @throw type_error.316 if a string stored inside the JSON value is not + UTF-8 encoded + + @complexity Linear. + + @liveexample{The example below shows the serialization with different + parameters to `width` to adjust the indentation level.,operator_serialize} + + @since version 1.0.0; indentation character added in version 3.0.0 + */ + friend std::ostream& operator<<(std::ostream& o, const basic_json& j) + { + // read width member and use it as indentation parameter if nonzero + const bool pretty_print = o.width() > 0; + const auto indentation = pretty_print ? o.width() : 0; + + // reset width to 0 for subsequent calls to this stream + o.width(0); + + // do the actual serialization + serializer s(detail::output_adapter(o), o.fill()); + s.dump(j, pretty_print, false, static_cast(indentation)); + return o; + } + + /*! + @brief serialize to stream + @deprecated This stream operator is deprecated and will be removed in + future 4.0.0 of the library. Please use + @ref operator<<(std::ostream&, const basic_json&) + instead; that is, replace calls like `j >> o;` with `o << j;`. + @since version 1.0.0; deprecated since version 3.0.0 + */ + JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator<<(std::ostream&, const basic_json&)) + friend std::ostream& operator>>(const basic_json& j, std::ostream& o) + { + return o << j; + } + + /// @} + + + ///////////////////// + // deserialization // + ///////////////////// + + /// @name deserialization + /// @{ + + /*! + @brief deserialize from a compatible input + + @tparam InputType A compatible input, for instance + - an std::istream object + - a FILE pointer + - a C-style array of characters + - a pointer to a null-terminated string of single byte characters + - an object obj for which begin(obj) and end(obj) produces a valid pair of + iterators. + + @param[in] i input to read from + @param[in] cb a parser callback function of type @ref parser_callback_t + which is used to control the deserialization by filtering unwanted values + (optional) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + @param[in] ignore_comments whether comments should be ignored and treated + like whitespace (true) or yield a parse error (true); (optional, false by + default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.101 if a parse error occurs; example: `""unexpected end + of input; expected string literal""` + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. The complexity can be higher if the parser callback function + @a cb or reading from the input @a i has a super-linear complexity. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `parse()` function reading + from an array.,parse__array__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function with + and without callback function.,parse__string__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function with + and without callback function.,parse__istream__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function reading + from a contiguous container.,parse__contiguouscontainer__parser_callback_t} + + @since version 2.0.3 (contiguous containers); version 3.9.0 allowed to + ignore comments. + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json parse(InputType&& i, + const parser_callback_t cb = nullptr, + const bool allow_exceptions = true, + const bool ignore_comments = false) + { + basic_json result; + parser(detail::input_adapter(std::forward(i)), cb, allow_exceptions, ignore_comments).parse(true, result); + return result; + } + + /*! + @brief deserialize from a pair of character iterators + + The value_type of the iterator must be a integral type with size of 1, 2 or + 4 bytes, which will be interpreted respectively as UTF-8, UTF-16 and UTF-32. + + @param[in] first iterator to start of character range + @param[in] last iterator to end of character range + @param[in] cb a parser callback function of type @ref parser_callback_t + which is used to control the deserialization by filtering unwanted values + (optional) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + @param[in] ignore_comments whether comments should be ignored and treated + like whitespace (true) or yield a parse error (true); (optional, false by + default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.101 if a parse error occurs; example: `""unexpected end + of input; expected string literal""` + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json parse(IteratorType first, + IteratorType last, + const parser_callback_t cb = nullptr, + const bool allow_exceptions = true, + const bool ignore_comments = false) + { + basic_json result; + parser(detail::input_adapter(std::move(first), std::move(last)), cb, allow_exceptions, ignore_comments).parse(true, result); + return result; + } + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, parse(ptr, ptr + len)) + static basic_json parse(detail::span_input_adapter&& i, + const parser_callback_t cb = nullptr, + const bool allow_exceptions = true, + const bool ignore_comments = false) + { + basic_json result; + parser(i.get(), cb, allow_exceptions, ignore_comments).parse(true, result); + return result; + } + + /*! + @brief check if the input is valid JSON + + Unlike the @ref parse(InputType&&, const parser_callback_t,const bool) + function, this function neither throws an exception in case of invalid JSON + input (i.e., a parse error) nor creates diagnostic information. + + @tparam InputType A compatible input, for instance + - an std::istream object + - a FILE pointer + - a C-style array of characters + - a pointer to a null-terminated string of single byte characters + - an object obj for which begin(obj) and end(obj) produces a valid pair of + iterators. + + @param[in] i input to read from + @param[in] ignore_comments whether comments should be ignored and treated + like whitespace (true) or yield a parse error (true); (optional, false by + default) + + @return Whether the input read from @a i is valid JSON. + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `accept()` function reading + from a string.,accept__string} + */ + template + static bool accept(InputType&& i, + const bool ignore_comments = false) + { + return parser(detail::input_adapter(std::forward(i)), nullptr, false, ignore_comments).accept(true); + } + + template + static bool accept(IteratorType first, IteratorType last, + const bool ignore_comments = false) + { + return parser(detail::input_adapter(std::move(first), std::move(last)), nullptr, false, ignore_comments).accept(true); + } + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, accept(ptr, ptr + len)) + static bool accept(detail::span_input_adapter&& i, + const bool ignore_comments = false) + { + return parser(i.get(), nullptr, false, ignore_comments).accept(true); + } + + /*! + @brief generate SAX events + + The SAX event lister must follow the interface of @ref json_sax. + + This function reads from a compatible input. Examples are: + - an std::istream object + - a FILE pointer + - a C-style array of characters + - a pointer to a null-terminated string of single byte characters + - an object obj for which begin(obj) and end(obj) produces a valid pair of + iterators. + + @param[in] i input to read from + @param[in,out] sax SAX event listener + @param[in] format the format to parse (JSON, CBOR, MessagePack, or UBJSON) + @param[in] strict whether the input has to be consumed completely + @param[in] ignore_comments whether comments should be ignored and treated + like whitespace (true) or yield a parse error (true); (optional, false by + default); only applies to the JSON file format. + + @return return value of the last processed SAX event + + @throw parse_error.101 if a parse error occurs; example: `""unexpected end + of input; expected string literal""` + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. The complexity can be higher if the SAX consumer @a sax has + a super-linear complexity. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `sax_parse()` function + reading from string and processing the events with a user-defined SAX + event consumer.,sax_parse} + + @since version 3.2.0 + */ + template + JSON_HEDLEY_NON_NULL(2) + static bool sax_parse(InputType&& i, SAX* sax, + input_format_t format = input_format_t::json, + const bool strict = true, + const bool ignore_comments = false) + { + auto ia = detail::input_adapter(std::forward(i)); + return format == input_format_t::json + ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict) + : detail::binary_reader(std::move(ia)).sax_parse(format, sax, strict); + } + + template + JSON_HEDLEY_NON_NULL(3) + static bool sax_parse(IteratorType first, IteratorType last, SAX* sax, + input_format_t format = input_format_t::json, + const bool strict = true, + const bool ignore_comments = false) + { + auto ia = detail::input_adapter(std::move(first), std::move(last)); + return format == input_format_t::json + ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict) + : detail::binary_reader(std::move(ia)).sax_parse(format, sax, strict); + } + + template + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, sax_parse(ptr, ptr + len, ...)) + JSON_HEDLEY_NON_NULL(2) + static bool sax_parse(detail::span_input_adapter&& i, SAX* sax, + input_format_t format = input_format_t::json, + const bool strict = true, + const bool ignore_comments = false) + { + auto ia = i.get(); + return format == input_format_t::json + ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict) + : detail::binary_reader(std::move(ia)).sax_parse(format, sax, strict); + } + + /*! + @brief deserialize from stream + @deprecated This stream operator is deprecated and will be removed in + version 4.0.0 of the library. Please use + @ref operator>>(std::istream&, basic_json&) + instead; that is, replace calls like `j << i;` with `i >> j;`. + @since version 1.0.0; deprecated since version 3.0.0 + */ + JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator>>(std::istream&, basic_json&)) + friend std::istream& operator<<(basic_json& j, std::istream& i) + { + return operator>>(i, j); + } + + /*! + @brief deserialize from stream + + Deserializes an input stream to a JSON value. + + @param[in,out] i input stream to read a serialized JSON value from + @param[in,out] j JSON value to write the deserialized input to + + @throw parse_error.101 in case of an unexpected token + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below shows how a JSON value is constructed by + reading a serialization from a stream.,operator_deserialize} + + @sa parse(std::istream&, const parser_callback_t) for a variant with a + parser callback function to filter values while parsing + + @since version 1.0.0 + */ + friend std::istream& operator>>(std::istream& i, basic_json& j) + { + parser(detail::input_adapter(i)).parse(false, j); + return i; + } + + /// @} + + /////////////////////////// + // convenience functions // + /////////////////////////// + + /*! + @brief return the type as string + + Returns the type name as string to be used in error messages - usually to + indicate that a function was called on a wrong JSON type. + + @return a string representation of a the @a m_type member: + Value type | return value + ----------- | ------------- + null | `"null"` + boolean | `"boolean"` + string | `"string"` + number | `"number"` (for all number types) + object | `"object"` + array | `"array"` + binary | `"binary"` + discarded | `"discarded"` + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @complexity Constant. + + @liveexample{The following code exemplifies `type_name()` for all JSON + types.,type_name} + + @sa @ref type() -- return the type of the JSON value + @sa @ref operator value_t() -- return the type of the JSON value (implicit) + + @since version 1.0.0, public since 2.1.0, `const char*` and `noexcept` + since 3.0.0 + */ + JSON_HEDLEY_RETURNS_NON_NULL + const char* type_name() const noexcept + { + { + switch (m_type) + { + case value_t::null: + return "null"; + case value_t::object: + return "object"; + case value_t::array: + return "array"; + case value_t::string: + return "string"; + case value_t::boolean: + return "boolean"; + case value_t::binary: + return "binary"; + case value_t::discarded: + return "discarded"; + default: + return "number"; + } + } + } + + + private: + ////////////////////// + // member variables // + ////////////////////// + + /// the type of the current element + value_t m_type = value_t::null; + + /// the value of the current element + json_value m_value = {}; + + ////////////////////////////////////////// + // binary serialization/deserialization // + ////////////////////////////////////////// + + /// @name binary serialization/deserialization support + /// @{ + + public: + /*! + @brief create a CBOR serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the CBOR (Concise + Binary Object Representation) serialization format. CBOR is a binary + serialization format which aims to be more compact than JSON itself, yet + more efficient to parse. + + The library uses the following mapping from JSON values types to + CBOR types according to the CBOR specification (RFC 7049): + + JSON value type | value/range | CBOR type | first byte + --------------- | ------------------------------------------ | ---------------------------------- | --------------- + null | `null` | Null | 0xF6 + boolean | `true` | True | 0xF5 + boolean | `false` | False | 0xF4 + number_integer | -9223372036854775808..-2147483649 | Negative integer (8 bytes follow) | 0x3B + number_integer | -2147483648..-32769 | Negative integer (4 bytes follow) | 0x3A + number_integer | -32768..-129 | Negative integer (2 bytes follow) | 0x39 + number_integer | -128..-25 | Negative integer (1 byte follow) | 0x38 + number_integer | -24..-1 | Negative integer | 0x20..0x37 + number_integer | 0..23 | Integer | 0x00..0x17 + number_integer | 24..255 | Unsigned integer (1 byte follow) | 0x18 + number_integer | 256..65535 | Unsigned integer (2 bytes follow) | 0x19 + number_integer | 65536..4294967295 | Unsigned integer (4 bytes follow) | 0x1A + number_integer | 4294967296..18446744073709551615 | Unsigned integer (8 bytes follow) | 0x1B + number_unsigned | 0..23 | Integer | 0x00..0x17 + number_unsigned | 24..255 | Unsigned integer (1 byte follow) | 0x18 + number_unsigned | 256..65535 | Unsigned integer (2 bytes follow) | 0x19 + number_unsigned | 65536..4294967295 | Unsigned integer (4 bytes follow) | 0x1A + number_unsigned | 4294967296..18446744073709551615 | Unsigned integer (8 bytes follow) | 0x1B + number_float | *any value representable by a float* | Single-Precision Float | 0xFA + number_float | *any value NOT representable by a float* | Double-Precision Float | 0xFB + string | *length*: 0..23 | UTF-8 string | 0x60..0x77 + string | *length*: 23..255 | UTF-8 string (1 byte follow) | 0x78 + string | *length*: 256..65535 | UTF-8 string (2 bytes follow) | 0x79 + string | *length*: 65536..4294967295 | UTF-8 string (4 bytes follow) | 0x7A + string | *length*: 4294967296..18446744073709551615 | UTF-8 string (8 bytes follow) | 0x7B + array | *size*: 0..23 | array | 0x80..0x97 + array | *size*: 23..255 | array (1 byte follow) | 0x98 + array | *size*: 256..65535 | array (2 bytes follow) | 0x99 + array | *size*: 65536..4294967295 | array (4 bytes follow) | 0x9A + array | *size*: 4294967296..18446744073709551615 | array (8 bytes follow) | 0x9B + object | *size*: 0..23 | map | 0xA0..0xB7 + object | *size*: 23..255 | map (1 byte follow) | 0xB8 + object | *size*: 256..65535 | map (2 bytes follow) | 0xB9 + object | *size*: 65536..4294967295 | map (4 bytes follow) | 0xBA + object | *size*: 4294967296..18446744073709551615 | map (8 bytes follow) | 0xBB + binary | *size*: 0..23 | byte string | 0x40..0x57 + binary | *size*: 23..255 | byte string (1 byte follow) | 0x58 + binary | *size*: 256..65535 | byte string (2 bytes follow) | 0x59 + binary | *size*: 65536..4294967295 | byte string (4 bytes follow) | 0x5A + binary | *size*: 4294967296..18446744073709551615 | byte string (8 bytes follow) | 0x5B + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a CBOR value. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @note The following CBOR types are not used in the conversion: + - UTF-8 strings terminated by "break" (0x7F) + - arrays terminated by "break" (0x9F) + - maps terminated by "break" (0xBF) + - byte strings terminated by "break" (0x5F) + - date/time (0xC0..0xC1) + - bignum (0xC2..0xC3) + - decimal fraction (0xC4) + - bigfloat (0xC5) + - expected conversions (0xD5..0xD7) + - simple values (0xE0..0xF3, 0xF8) + - undefined (0xF7) + - half-precision floats (0xF9) + - break (0xFF) + + @param[in] j JSON value to serialize + @return CBOR serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in CBOR format.,to_cbor} + + @sa http://cbor.io + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool, const cbor_tag_handler_t) for the + analogous deserialization + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9; compact representation of floating-point numbers + since version 3.8.0 + */ + static std::vector to_cbor(const basic_json& j) + { + std::vector result; + to_cbor(j, result); + return result; + } + + static void to_cbor(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_cbor(j); + } + + static void to_cbor(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_cbor(j); + } + + /*! + @brief create a MessagePack serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the MessagePack + serialization format. MessagePack is a binary serialization format which + aims to be more compact than JSON itself, yet more efficient to parse. + + The library uses the following mapping from JSON values types to + MessagePack types according to the MessagePack specification: + + JSON value type | value/range | MessagePack type | first byte + --------------- | --------------------------------- | ---------------- | ---------- + null | `null` | nil | 0xC0 + boolean | `true` | true | 0xC3 + boolean | `false` | false | 0xC2 + number_integer | -9223372036854775808..-2147483649 | int64 | 0xD3 + number_integer | -2147483648..-32769 | int32 | 0xD2 + number_integer | -32768..-129 | int16 | 0xD1 + number_integer | -128..-33 | int8 | 0xD0 + number_integer | -32..-1 | negative fixint | 0xE0..0xFF + number_integer | 0..127 | positive fixint | 0x00..0x7F + number_integer | 128..255 | uint 8 | 0xCC + number_integer | 256..65535 | uint 16 | 0xCD + number_integer | 65536..4294967295 | uint 32 | 0xCE + number_integer | 4294967296..18446744073709551615 | uint 64 | 0xCF + number_unsigned | 0..127 | positive fixint | 0x00..0x7F + number_unsigned | 128..255 | uint 8 | 0xCC + number_unsigned | 256..65535 | uint 16 | 0xCD + number_unsigned | 65536..4294967295 | uint 32 | 0xCE + number_unsigned | 4294967296..18446744073709551615 | uint 64 | 0xCF + number_float | *any value representable by a float* | float 32 | 0xCA + number_float | *any value NOT representable by a float* | float 64 | 0xCB + string | *length*: 0..31 | fixstr | 0xA0..0xBF + string | *length*: 32..255 | str 8 | 0xD9 + string | *length*: 256..65535 | str 16 | 0xDA + string | *length*: 65536..4294967295 | str 32 | 0xDB + array | *size*: 0..15 | fixarray | 0x90..0x9F + array | *size*: 16..65535 | array 16 | 0xDC + array | *size*: 65536..4294967295 | array 32 | 0xDD + object | *size*: 0..15 | fix map | 0x80..0x8F + object | *size*: 16..65535 | map 16 | 0xDE + object | *size*: 65536..4294967295 | map 32 | 0xDF + binary | *size*: 0..255 | bin 8 | 0xC4 + binary | *size*: 256..65535 | bin 16 | 0xC5 + binary | *size*: 65536..4294967295 | bin 32 | 0xC6 + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a MessagePack value. + + @note The following values can **not** be converted to a MessagePack value: + - strings with more than 4294967295 bytes + - byte strings with more than 4294967295 bytes + - arrays with more than 4294967295 elements + - objects with more than 4294967295 elements + + @note Any MessagePack output created @ref to_msgpack can be successfully + parsed by @ref from_msgpack. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @param[in] j JSON value to serialize + @return MessagePack serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in MessagePack format.,to_msgpack} + + @sa http://msgpack.org + @sa @ref from_msgpack for the analogous deserialization + @sa @ref to_cbor(const basic_json& for the related CBOR format + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9 + */ + static std::vector to_msgpack(const basic_json& j) + { + std::vector result; + to_msgpack(j, result); + return result; + } + + static void to_msgpack(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_msgpack(j); + } + + static void to_msgpack(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_msgpack(j); + } + + /*! + @brief create a UBJSON serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the UBJSON + (Universal Binary JSON) serialization format. UBJSON aims to be more compact + than JSON itself, yet more efficient to parse. + + The library uses the following mapping from JSON values types to + UBJSON types according to the UBJSON specification: + + JSON value type | value/range | UBJSON type | marker + --------------- | --------------------------------- | ----------- | ------ + null | `null` | null | `Z` + boolean | `true` | true | `T` + boolean | `false` | false | `F` + number_integer | -9223372036854775808..-2147483649 | int64 | `L` + number_integer | -2147483648..-32769 | int32 | `l` + number_integer | -32768..-129 | int16 | `I` + number_integer | -128..127 | int8 | `i` + number_integer | 128..255 | uint8 | `U` + number_integer | 256..32767 | int16 | `I` + number_integer | 32768..2147483647 | int32 | `l` + number_integer | 2147483648..9223372036854775807 | int64 | `L` + number_unsigned | 0..127 | int8 | `i` + number_unsigned | 128..255 | uint8 | `U` + number_unsigned | 256..32767 | int16 | `I` + number_unsigned | 32768..2147483647 | int32 | `l` + number_unsigned | 2147483648..9223372036854775807 | int64 | `L` + number_unsigned | 2147483649..18446744073709551615 | high-precision | `H` + number_float | *any value* | float64 | `D` + string | *with shortest length indicator* | string | `S` + array | *see notes on optimized format* | array | `[` + object | *see notes on optimized format* | map | `{` + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a UBJSON value. + + @note The following values can **not** be converted to a UBJSON value: + - strings with more than 9223372036854775807 bytes (theoretical) + + @note The following markers are not used in the conversion: + - `Z`: no-op values are not created. + - `C`: single-byte strings are serialized with `S` markers. + + @note Any UBJSON output created @ref to_ubjson can be successfully parsed + by @ref from_ubjson. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @note The optimized formats for containers are supported: Parameter + @a use_size adds size information to the beginning of a container and + removes the closing marker. Parameter @a use_type further checks + whether all elements of a container have the same type and adds the + type marker to the beginning of the container. The @a use_type + parameter must only be used together with @a use_size = true. Note + that @a use_size = true alone may result in larger representations - + the benefit of this parameter is that the receiving side is + immediately informed on the number of elements of the container. + + @note If the JSON data contains the binary type, the value stored is a list + of integers, as suggested by the UBJSON documentation. In particular, + this means that serialization and the deserialization of a JSON + containing binary values into UBJSON and back will result in a + different JSON object. + + @param[in] j JSON value to serialize + @param[in] use_size whether to add size annotations to container types + @param[in] use_type whether to add type annotations to container types + (must be combined with @a use_size = true) + @return UBJSON serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in UBJSON format.,to_ubjson} + + @sa http://ubjson.org + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + analogous deserialization + @sa @ref to_cbor(const basic_json& for the related CBOR format + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + + @since version 3.1.0 + */ + static std::vector to_ubjson(const basic_json& j, + const bool use_size = false, + const bool use_type = false) + { + std::vector result; + to_ubjson(j, result, use_size, use_type); + return result; + } + + static void to_ubjson(const basic_json& j, detail::output_adapter o, + const bool use_size = false, const bool use_type = false) + { + binary_writer(o).write_ubjson(j, use_size, use_type); + } + + static void to_ubjson(const basic_json& j, detail::output_adapter o, + const bool use_size = false, const bool use_type = false) + { + binary_writer(o).write_ubjson(j, use_size, use_type); + } + + + /*! + @brief Serializes the given JSON object `j` to BSON and returns a vector + containing the corresponding BSON-representation. + + BSON (Binary JSON) is a binary format in which zero or more ordered key/value pairs are + stored as a single entity (a so-called document). + + The library uses the following mapping from JSON values types to BSON types: + + JSON value type | value/range | BSON type | marker + --------------- | --------------------------------- | ----------- | ------ + null | `null` | null | 0x0A + boolean | `true`, `false` | boolean | 0x08 + number_integer | -9223372036854775808..-2147483649 | int64 | 0x12 + number_integer | -2147483648..2147483647 | int32 | 0x10 + number_integer | 2147483648..9223372036854775807 | int64 | 0x12 + number_unsigned | 0..2147483647 | int32 | 0x10 + number_unsigned | 2147483648..9223372036854775807 | int64 | 0x12 + number_unsigned | 9223372036854775808..18446744073709551615| -- | -- + number_float | *any value* | double | 0x01 + string | *any value* | string | 0x02 + array | *any value* | document | 0x04 + object | *any value* | document | 0x03 + binary | *any value* | binary | 0x05 + + @warning The mapping is **incomplete**, since only JSON-objects (and things + contained therein) can be serialized to BSON. + Also, integers larger than 9223372036854775807 cannot be serialized to BSON, + and the keys may not contain U+0000, since they are serialized a + zero-terminated c-strings. + + @throw out_of_range.407 if `j.is_number_unsigned() && j.get() > 9223372036854775807` + @throw out_of_range.409 if a key in `j` contains a NULL (U+0000) + @throw type_error.317 if `!j.is_object()` + + @pre The input `j` is required to be an object: `j.is_object() == true`. + + @note Any BSON output created via @ref to_bson can be successfully parsed + by @ref from_bson. + + @param[in] j JSON value to serialize + @return BSON serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in BSON format.,to_bson} + + @sa http://bsonspec.org/spec.html + @sa @ref from_bson(detail::input_adapter&&, const bool strict) for the + analogous deserialization + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + @sa @ref to_cbor(const basic_json&) for the related CBOR format + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + */ + static std::vector to_bson(const basic_json& j) + { + std::vector result; + to_bson(j, result); + return result; + } + + /*! + @brief Serializes the given JSON object `j` to BSON and forwards the + corresponding BSON-representation to the given output_adapter `o`. + @param j The JSON object to convert to BSON. + @param o The output adapter that receives the binary BSON representation. + @pre The input `j` shall be an object: `j.is_object() == true` + @sa @ref to_bson(const basic_json&) + */ + static void to_bson(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_bson(j); + } + + /*! + @copydoc to_bson(const basic_json&, detail::output_adapter) + */ + static void to_bson(const basic_json& j, detail::output_adapter o) + { + binary_writer(o).write_bson(j); + } + + + /*! + @brief create a JSON value from an input in CBOR format + + Deserializes a given input @a i to a JSON value using the CBOR (Concise + Binary Object Representation) serialization format. + + The library maps CBOR types to JSON value types as follows: + + CBOR type | JSON value type | first byte + ---------------------- | --------------- | ---------- + Integer | number_unsigned | 0x00..0x17 + Unsigned integer | number_unsigned | 0x18 + Unsigned integer | number_unsigned | 0x19 + Unsigned integer | number_unsigned | 0x1A + Unsigned integer | number_unsigned | 0x1B + Negative integer | number_integer | 0x20..0x37 + Negative integer | number_integer | 0x38 + Negative integer | number_integer | 0x39 + Negative integer | number_integer | 0x3A + Negative integer | number_integer | 0x3B + Byte string | binary | 0x40..0x57 + Byte string | binary | 0x58 + Byte string | binary | 0x59 + Byte string | binary | 0x5A + Byte string | binary | 0x5B + UTF-8 string | string | 0x60..0x77 + UTF-8 string | string | 0x78 + UTF-8 string | string | 0x79 + UTF-8 string | string | 0x7A + UTF-8 string | string | 0x7B + UTF-8 string | string | 0x7F + array | array | 0x80..0x97 + array | array | 0x98 + array | array | 0x99 + array | array | 0x9A + array | array | 0x9B + array | array | 0x9F + map | object | 0xA0..0xB7 + map | object | 0xB8 + map | object | 0xB9 + map | object | 0xBA + map | object | 0xBB + map | object | 0xBF + False | `false` | 0xF4 + True | `true` | 0xF5 + Null | `null` | 0xF6 + Half-Precision Float | number_float | 0xF9 + Single-Precision Float | number_float | 0xFA + Double-Precision Float | number_float | 0xFB + + @warning The mapping is **incomplete** in the sense that not all CBOR + types can be converted to a JSON value. The following CBOR types + are not supported and will yield parse errors (parse_error.112): + - date/time (0xC0..0xC1) + - bignum (0xC2..0xC3) + - decimal fraction (0xC4) + - bigfloat (0xC5) + - expected conversions (0xD5..0xD7) + - simple values (0xE0..0xF3, 0xF8) + - undefined (0xF7) + + @warning CBOR allows map keys of any type, whereas JSON only allows + strings as keys in object values. Therefore, CBOR maps with keys + other than UTF-8 strings are rejected (parse_error.113). + + @note Any CBOR output created @ref to_cbor can be successfully parsed by + @ref from_cbor. + + @param[in] i an input in CBOR format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + @param[in] tag_handler how to treat CBOR tags (optional, error by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if unsupported features from CBOR were + used in the given input @a v or if the input is not valid CBOR + @throw parse_error.113 if a string was expected as map key, but not found + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in CBOR + format to a JSON value.,from_cbor} + + @sa http://cbor.io + @sa @ref to_cbor(const basic_json&) for the analogous serialization + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for the + related MessagePack format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9; parameter @a start_index since 2.1.1; changed to + consume input adapters, removed start_index parameter, and added + @a strict parameter since 3.0.0; added @a allow_exceptions parameter + since 3.2.0; added @a tag_handler parameter since 3.9.0. + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_cbor(InputType&& i, + const bool strict = true, + const bool allow_exceptions = true, + const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::forward(i)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_cbor(detail::input_adapter&&, const bool, const bool, const cbor_tag_handler_t) + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_cbor(IteratorType first, IteratorType last, + const bool strict = true, + const bool allow_exceptions = true, + const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::move(first), std::move(last)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); + return res ? result : basic_json(value_t::discarded); + } + + template + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len)) + static basic_json from_cbor(const T* ptr, std::size_t len, + const bool strict = true, + const bool allow_exceptions = true, + const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error) + { + return from_cbor(ptr, ptr + len, strict, allow_exceptions, tag_handler); + } + + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len)) + static basic_json from_cbor(detail::span_input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true, + const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = i.get(); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @brief create a JSON value from an input in MessagePack format + + Deserializes a given input @a i to a JSON value using the MessagePack + serialization format. + + The library maps MessagePack types to JSON value types as follows: + + MessagePack type | JSON value type | first byte + ---------------- | --------------- | ---------- + positive fixint | number_unsigned | 0x00..0x7F + fixmap | object | 0x80..0x8F + fixarray | array | 0x90..0x9F + fixstr | string | 0xA0..0xBF + nil | `null` | 0xC0 + false | `false` | 0xC2 + true | `true` | 0xC3 + float 32 | number_float | 0xCA + float 64 | number_float | 0xCB + uint 8 | number_unsigned | 0xCC + uint 16 | number_unsigned | 0xCD + uint 32 | number_unsigned | 0xCE + uint 64 | number_unsigned | 0xCF + int 8 | number_integer | 0xD0 + int 16 | number_integer | 0xD1 + int 32 | number_integer | 0xD2 + int 64 | number_integer | 0xD3 + str 8 | string | 0xD9 + str 16 | string | 0xDA + str 32 | string | 0xDB + array 16 | array | 0xDC + array 32 | array | 0xDD + map 16 | object | 0xDE + map 32 | object | 0xDF + bin 8 | binary | 0xC4 + bin 16 | binary | 0xC5 + bin 32 | binary | 0xC6 + ext 8 | binary | 0xC7 + ext 16 | binary | 0xC8 + ext 32 | binary | 0xC9 + fixext 1 | binary | 0xD4 + fixext 2 | binary | 0xD5 + fixext 4 | binary | 0xD6 + fixext 8 | binary | 0xD7 + fixext 16 | binary | 0xD8 + negative fixint | number_integer | 0xE0-0xFF + + @note Any MessagePack output created @ref to_msgpack can be successfully + parsed by @ref from_msgpack. + + @param[in] i an input in MessagePack format convertible to an input + adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if unsupported features from MessagePack were + used in the given input @a i or if the input is not valid MessagePack + @throw parse_error.113 if a string was expected as map key, but not found + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + MessagePack format to a JSON value.,from_msgpack} + + @sa http://msgpack.org + @sa @ref to_msgpack(const basic_json&) for the analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool, const cbor_tag_handler_t) for the + related CBOR format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for + the related UBJSON format + @sa @ref from_bson(detail::input_adapter&&, const bool, const bool) for + the related BSON format + + @since version 2.0.9; parameter @a start_index since 2.1.1; changed to + consume input adapters, removed start_index parameter, and added + @a strict parameter since 3.0.0; added @a allow_exceptions parameter + since 3.2.0 + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_msgpack(InputType&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::forward(i)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::msgpack, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_msgpack(detail::input_adapter&&, const bool, const bool) + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_msgpack(IteratorType first, IteratorType last, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::move(first), std::move(last)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::msgpack, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + + template + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len)) + static basic_json from_msgpack(const T* ptr, std::size_t len, + const bool strict = true, + const bool allow_exceptions = true) + { + return from_msgpack(ptr, ptr + len, strict, allow_exceptions); + } + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len)) + static basic_json from_msgpack(detail::span_input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = i.get(); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::msgpack, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + + /*! + @brief create a JSON value from an input in UBJSON format + + Deserializes a given input @a i to a JSON value using the UBJSON (Universal + Binary JSON) serialization format. + + The library maps UBJSON types to JSON value types as follows: + + UBJSON type | JSON value type | marker + ----------- | --------------------------------------- | ------ + no-op | *no value, next value is read* | `N` + null | `null` | `Z` + false | `false` | `F` + true | `true` | `T` + float32 | number_float | `d` + float64 | number_float | `D` + uint8 | number_unsigned | `U` + int8 | number_integer | `i` + int16 | number_integer | `I` + int32 | number_integer | `l` + int64 | number_integer | `L` + high-precision number | number_integer, number_unsigned, or number_float - depends on number string | 'H' + string | string | `S` + char | string | `C` + array | array (optimized values are supported) | `[` + object | object (optimized values are supported) | `{` + + @note The mapping is **complete** in the sense that any UBJSON value can + be converted to a JSON value. + + @param[in] i an input in UBJSON format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if a parse error occurs + @throw parse_error.113 if a string could not be parsed successfully + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + UBJSON format to a JSON value.,from_ubjson} + + @sa http://ubjson.org + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool, const cbor_tag_handler_t) for the + related CBOR format + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for + the related MessagePack format + @sa @ref from_bson(detail::input_adapter&&, const bool, const bool) for + the related BSON format + + @since version 3.1.0; added @a allow_exceptions parameter since 3.2.0 + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_ubjson(InputType&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::forward(i)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::ubjson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_ubjson(detail::input_adapter&&, const bool, const bool) + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_ubjson(IteratorType first, IteratorType last, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::move(first), std::move(last)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::ubjson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + template + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len)) + static basic_json from_ubjson(const T* ptr, std::size_t len, + const bool strict = true, + const bool allow_exceptions = true) + { + return from_ubjson(ptr, ptr + len, strict, allow_exceptions); + } + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len)) + static basic_json from_ubjson(detail::span_input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = i.get(); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::ubjson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + + /*! + @brief Create a JSON value from an input in BSON format + + Deserializes a given input @a i to a JSON value using the BSON (Binary JSON) + serialization format. + + The library maps BSON record types to JSON value types as follows: + + BSON type | BSON marker byte | JSON value type + --------------- | ---------------- | --------------------------- + double | 0x01 | number_float + string | 0x02 | string + document | 0x03 | object + array | 0x04 | array + binary | 0x05 | still unsupported + undefined | 0x06 | still unsupported + ObjectId | 0x07 | still unsupported + boolean | 0x08 | boolean + UTC Date-Time | 0x09 | still unsupported + null | 0x0A | null + Regular Expr. | 0x0B | still unsupported + DB Pointer | 0x0C | still unsupported + JavaScript Code | 0x0D | still unsupported + Symbol | 0x0E | still unsupported + JavaScript Code | 0x0F | still unsupported + int32 | 0x10 | number_integer + Timestamp | 0x11 | still unsupported + 128-bit decimal float | 0x13 | still unsupported + Max Key | 0x7F | still unsupported + Min Key | 0xFF | still unsupported + + @warning The mapping is **incomplete**. The unsupported mappings + are indicated in the table above. + + @param[in] i an input in BSON format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.114 if an unsupported BSON record type is encountered + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + BSON format to a JSON value.,from_bson} + + @sa http://bsonspec.org/spec.html + @sa @ref to_bson(const basic_json&) for the analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool, const cbor_tag_handler_t) for the + related CBOR format + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for + the related MessagePack format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + related UBJSON format + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_bson(InputType&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::forward(i)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::bson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_bson(detail::input_adapter&&, const bool, const bool) + */ + template + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json from_bson(IteratorType first, IteratorType last, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = detail::input_adapter(std::move(first), std::move(last)); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::bson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + template + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len)) + static basic_json from_bson(const T* ptr, std::size_t len, + const bool strict = true, + const bool allow_exceptions = true) + { + return from_bson(ptr, ptr + len, strict, allow_exceptions); + } + + JSON_HEDLEY_WARN_UNUSED_RESULT + JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len)) + static basic_json from_bson(detail::span_input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser sdp(result, allow_exceptions); + auto ia = i.get(); + const bool res = binary_reader(std::move(ia)).sax_parse(input_format_t::bson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + /// @} + + ////////////////////////// + // JSON Pointer support // + ////////////////////////// + + /// @name JSON Pointer functions + /// @{ + + /*! + @brief access specified element via JSON Pointer + + Uses a JSON pointer to retrieve a reference to the respective JSON value. + No bound checking is performed. Similar to @ref operator[](const typename + object_t::key_type&), `null` values are created in arrays and objects if + necessary. + + In particular: + - If the JSON pointer points to an object key that does not exist, it + is created an filled with a `null` value before a reference to it + is returned. + - If the JSON pointer points to an array index that does not exist, it + is created an filled with a `null` value before a reference to it + is returned. All indices between the current maximum and the given + index are also filled with `null`. + - The special value `-` is treated as a synonym for the index past the + end. + + @param[in] ptr a JSON pointer + + @return reference to the element pointed to by @a ptr + + @complexity Constant. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.404 if the JSON pointer can not be resolved + + @liveexample{The behavior is shown in the example.,operatorjson_pointer} + + @since version 2.0.0 + */ + reference operator[](const json_pointer& ptr) + { + return ptr.get_unchecked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Uses a JSON pointer to retrieve a reference to the respective JSON value. + No bound checking is performed. The function does not change the JSON + value; no `null` values are created. In particular, the special value + `-` yields an exception. + + @param[in] ptr JSON pointer to the desired element + + @return const reference to the element pointed to by @a ptr + + @complexity Constant. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + + @liveexample{The behavior is shown in the example.,operatorjson_pointer_const} + + @since version 2.0.0 + */ + const_reference operator[](const json_pointer& ptr) const + { + return ptr.get_unchecked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Returns a reference to the element at with specified JSON pointer @a ptr, + with bounds checking. + + @param[in] ptr JSON pointer to the desired element + + @return reference to the element pointed to by @a ptr + + @throw parse_error.106 if an array index in the passed JSON pointer @a ptr + begins with '0'. See example below. + + @throw parse_error.109 if an array index in the passed JSON pointer @a ptr + is not a number. See example below. + + @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr + is out of range. See example below. + + @throw out_of_range.402 if the array index '-' is used in the passed JSON + pointer @a ptr. As `at` provides checked access (and no elements are + implicitly inserted), the index '-' is always invalid. See example below. + + @throw out_of_range.403 if the JSON pointer describes a key of an object + which cannot be found. See example below. + + @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved. + See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 2.0.0 + + @liveexample{The behavior is shown in the example.,at_json_pointer} + */ + reference at(const json_pointer& ptr) + { + return ptr.get_checked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Returns a const reference to the element at with specified JSON pointer @a + ptr, with bounds checking. + + @param[in] ptr JSON pointer to the desired element + + @return reference to the element pointed to by @a ptr + + @throw parse_error.106 if an array index in the passed JSON pointer @a ptr + begins with '0'. See example below. + + @throw parse_error.109 if an array index in the passed JSON pointer @a ptr + is not a number. See example below. + + @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr + is out of range. See example below. + + @throw out_of_range.402 if the array index '-' is used in the passed JSON + pointer @a ptr. As `at` provides checked access (and no elements are + implicitly inserted), the index '-' is always invalid. See example below. + + @throw out_of_range.403 if the JSON pointer describes a key of an object + which cannot be found. See example below. + + @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved. + See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 2.0.0 + + @liveexample{The behavior is shown in the example.,at_json_pointer_const} + */ + const_reference at(const json_pointer& ptr) const + { + return ptr.get_checked(this); + } + + /*! + @brief return flattened JSON value + + The function creates a JSON object whose keys are JSON pointers (see [RFC + 6901](https://tools.ietf.org/html/rfc6901)) and whose values are all + primitive. The original JSON value can be restored using the @ref + unflatten() function. + + @return an object that maps JSON pointers to primitive values + + @note Empty objects and arrays are flattened to `null` and will not be + reconstructed correctly by the @ref unflatten() function. + + @complexity Linear in the size the JSON value. + + @liveexample{The following code shows how a JSON object is flattened to an + object whose keys consist of JSON pointers.,flatten} + + @sa @ref unflatten() for the reverse function + + @since version 2.0.0 + */ + basic_json flatten() const + { + basic_json result(value_t::object); + json_pointer::flatten("", *this, result); + return result; + } + + /*! + @brief unflatten a previously flattened JSON value + + The function restores the arbitrary nesting of a JSON value that has been + flattened before using the @ref flatten() function. The JSON value must + meet certain constraints: + 1. The value must be an object. + 2. The keys must be JSON pointers (see + [RFC 6901](https://tools.ietf.org/html/rfc6901)) + 3. The mapped values must be primitive JSON types. + + @return the original JSON from a flattened version + + @note Empty objects and arrays are flattened by @ref flatten() to `null` + values and can not unflattened to their original type. Apart from + this example, for a JSON value `j`, the following is always true: + `j == j.flatten().unflatten()`. + + @complexity Linear in the size the JSON value. + + @throw type_error.314 if value is not an object + @throw type_error.315 if object values are not primitive + + @liveexample{The following code shows how a flattened JSON object is + unflattened into the original nested JSON object.,unflatten} + + @sa @ref flatten() for the reverse function + + @since version 2.0.0 + */ + basic_json unflatten() const + { + return json_pointer::unflatten(*this); + } + + /// @} + + ////////////////////////// + // JSON Patch functions // + ////////////////////////// + + /// @name JSON Patch functions + /// @{ + + /*! + @brief applies a JSON patch + + [JSON Patch](http://jsonpatch.com) defines a JSON document structure for + expressing a sequence of operations to apply to a JSON) document. With + this function, a JSON Patch is applied to the current JSON value by + executing all operations from the patch. + + @param[in] json_patch JSON patch document + @return patched document + + @note The application of a patch is atomic: Either all operations succeed + and the patched document is returned or an exception is thrown. In + any case, the original value is not changed: the patch is applied + to a copy of the value. + + @throw parse_error.104 if the JSON patch does not consist of an array of + objects + + @throw parse_error.105 if the JSON patch is malformed (e.g., mandatory + attributes are missing); example: `"operation add must have member path"` + + @throw out_of_range.401 if an array index is out of range. + + @throw out_of_range.403 if a JSON pointer inside the patch could not be + resolved successfully in the current JSON value; example: `"key baz not + found"` + + @throw out_of_range.405 if JSON pointer has no parent ("add", "remove", + "move") + + @throw other_error.501 if "test" operation was unsuccessful + + @complexity Linear in the size of the JSON value and the length of the + JSON patch. As usually only a fraction of the JSON value is affected by + the patch, the complexity can usually be neglected. + + @liveexample{The following code shows how a JSON patch is applied to a + value.,patch} + + @sa @ref diff -- create a JSON patch by comparing two JSON values + + @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902) + @sa [RFC 6901 (JSON Pointer)](https://tools.ietf.org/html/rfc6901) + + @since version 2.0.0 + */ + basic_json patch(const basic_json& json_patch) const + { + // make a working copy to apply the patch to + basic_json result = *this; + + // the valid JSON Patch operations + enum class patch_operations {add, remove, replace, move, copy, test, invalid}; + + const auto get_op = [](const std::string & op) + { + if (op == "add") + { + return patch_operations::add; + } + if (op == "remove") + { + return patch_operations::remove; + } + if (op == "replace") + { + return patch_operations::replace; + } + if (op == "move") + { + return patch_operations::move; + } + if (op == "copy") + { + return patch_operations::copy; + } + if (op == "test") + { + return patch_operations::test; + } + + return patch_operations::invalid; + }; + + // wrapper for "add" operation; add value at ptr + const auto operation_add = [&result](json_pointer & ptr, basic_json val) + { + // adding to the root of the target document means replacing it + if (ptr.empty()) + { + result = val; + return; + } + + // make sure the top element of the pointer exists + json_pointer top_pointer = ptr.top(); + if (top_pointer != ptr) + { + result.at(top_pointer); + } + + // get reference to parent of JSON pointer ptr + const auto last_path = ptr.back(); + ptr.pop_back(); + basic_json& parent = result[ptr]; + + switch (parent.m_type) + { + case value_t::null: + case value_t::object: + { + // use operator[] to add value + parent[last_path] = val; + break; + } + + case value_t::array: + { + if (last_path == "-") + { + // special case: append to back + parent.push_back(val); + } + else + { + const auto idx = json_pointer::array_index(last_path); + if (JSON_HEDLEY_UNLIKELY(idx > parent.size())) + { + // avoid undefined behavior + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + + // default case: insert add offset + parent.insert(parent.begin() + static_cast(idx), val); + } + break; + } + + // if there exists a parent it cannot be primitive + default: // LCOV_EXCL_LINE + JSON_ASSERT(false); // LCOV_EXCL_LINE + } + }; + + // wrapper for "remove" operation; remove value at ptr + const auto operation_remove = [&result](json_pointer & ptr) + { + // get reference to parent of JSON pointer ptr + const auto last_path = ptr.back(); + ptr.pop_back(); + basic_json& parent = result.at(ptr); + + // remove child + if (parent.is_object()) + { + // perform range check + auto it = parent.find(last_path); + if (JSON_HEDLEY_LIKELY(it != parent.end())) + { + parent.erase(it); + } + else + { + JSON_THROW(out_of_range::create(403, "key '" + last_path + "' not found")); + } + } + else if (parent.is_array()) + { + // note erase performs range check + parent.erase(json_pointer::array_index(last_path)); + } + }; + + // type check: top level value must be an array + if (JSON_HEDLEY_UNLIKELY(!json_patch.is_array())) + { + JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects")); + } + + // iterate and apply the operations + for (const auto& val : json_patch) + { + // wrapper to get a value for an operation + const auto get_value = [&val](const std::string & op, + const std::string & member, + bool string_type) -> basic_json & + { + // find value + auto it = val.m_value.object->find(member); + + // context-sensitive error message + const auto error_msg = (op == "op") ? "operation" : "operation '" + op + "'"; + + // check if desired value is present + if (JSON_HEDLEY_UNLIKELY(it == val.m_value.object->end())) + { + JSON_THROW(parse_error::create(105, 0, error_msg + " must have member '" + member + "'")); + } + + // check if result is of type string + if (JSON_HEDLEY_UNLIKELY(string_type && !it->second.is_string())) + { + JSON_THROW(parse_error::create(105, 0, error_msg + " must have string member '" + member + "'")); + } + + // no error: return value + return it->second; + }; + + // type check: every element of the array must be an object + if (JSON_HEDLEY_UNLIKELY(!val.is_object())) + { + JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects")); + } + + // collect mandatory members + const auto op = get_value("op", "op", true).template get(); + const auto path = get_value(op, "path", true).template get(); + json_pointer ptr(path); + + switch (get_op(op)) + { + case patch_operations::add: + { + operation_add(ptr, get_value("add", "value", false)); + break; + } + + case patch_operations::remove: + { + operation_remove(ptr); + break; + } + + case patch_operations::replace: + { + // the "path" location must exist - use at() + result.at(ptr) = get_value("replace", "value", false); + break; + } + + case patch_operations::move: + { + const auto from_path = get_value("move", "from", true).template get(); + json_pointer from_ptr(from_path); + + // the "from" location must exist - use at() + basic_json v = result.at(from_ptr); + + // The move operation is functionally identical to a + // "remove" operation on the "from" location, followed + // immediately by an "add" operation at the target + // location with the value that was just removed. + operation_remove(from_ptr); + operation_add(ptr, v); + break; + } + + case patch_operations::copy: + { + const auto from_path = get_value("copy", "from", true).template get(); + const json_pointer from_ptr(from_path); + + // the "from" location must exist - use at() + basic_json v = result.at(from_ptr); + + // The copy is functionally identical to an "add" + // operation at the target location using the value + // specified in the "from" member. + operation_add(ptr, v); + break; + } + + case patch_operations::test: + { + bool success = false; + JSON_TRY + { + // check if "value" matches the one at "path" + // the "path" location must exist - use at() + success = (result.at(ptr) == get_value("test", "value", false)); + } + JSON_INTERNAL_CATCH (out_of_range&) + { + // ignore out of range errors: success remains false + } + + // throw an exception if test fails + if (JSON_HEDLEY_UNLIKELY(!success)) + { + JSON_THROW(other_error::create(501, "unsuccessful: " + val.dump())); + } + + break; + } + + default: + { + // op must be "add", "remove", "replace", "move", "copy", or + // "test" + JSON_THROW(parse_error::create(105, 0, "operation value '" + op + "' is invalid")); + } + } + } + + return result; + } + + /*! + @brief creates a diff as a JSON patch + + Creates a [JSON Patch](http://jsonpatch.com) so that value @a source can + be changed into the value @a target by calling @ref patch function. + + @invariant For two JSON values @a source and @a target, the following code + yields always `true`: + @code {.cpp} + source.patch(diff(source, target)) == target; + @endcode + + @note Currently, only `remove`, `add`, and `replace` operations are + generated. + + @param[in] source JSON value to compare from + @param[in] target JSON value to compare against + @param[in] path helper value to create JSON pointers + + @return a JSON patch to convert the @a source to @a target + + @complexity Linear in the lengths of @a source and @a target. + + @liveexample{The following code shows how a JSON patch is created as a + diff for two JSON values.,diff} + + @sa @ref patch -- apply a JSON patch + @sa @ref merge_patch -- apply a JSON Merge Patch + + @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902) + + @since version 2.0.0 + */ + JSON_HEDLEY_WARN_UNUSED_RESULT + static basic_json diff(const basic_json& source, const basic_json& target, + const std::string& path = "") + { + // the patch + basic_json result(value_t::array); + + // if the values are the same, return empty patch + if (source == target) + { + return result; + } + + if (source.type() != target.type()) + { + // different types: replace value + result.push_back( + { + {"op", "replace"}, {"path", path}, {"value", target} + }); + return result; + } + + switch (source.type()) + { + case value_t::array: + { + // first pass: traverse common elements + std::size_t i = 0; + while (i < source.size() && i < target.size()) + { + // recursive call to compare array values at index i + auto temp_diff = diff(source[i], target[i], path + "/" + std::to_string(i)); + result.insert(result.end(), temp_diff.begin(), temp_diff.end()); + ++i; + } + + // i now reached the end of at least one array + // in a second pass, traverse the remaining elements + + // remove my remaining elements + const auto end_index = static_cast(result.size()); + while (i < source.size()) + { + // add operations in reverse order to avoid invalid + // indices + result.insert(result.begin() + end_index, object( + { + {"op", "remove"}, + {"path", path + "/" + std::to_string(i)} + })); + ++i; + } + + // add other remaining elements + while (i < target.size()) + { + result.push_back( + { + {"op", "add"}, + {"path", path + "/-"}, + {"value", target[i]} + }); + ++i; + } + + break; + } + + case value_t::object: + { + // first pass: traverse this object's elements + for (auto it = source.cbegin(); it != source.cend(); ++it) + { + // escape the key name to be used in a JSON patch + const auto key = json_pointer::escape(it.key()); + + if (target.find(it.key()) != target.end()) + { + // recursive call to compare object values at key it + auto temp_diff = diff(it.value(), target[it.key()], path + "/" + key); + result.insert(result.end(), temp_diff.begin(), temp_diff.end()); + } + else + { + // found a key that is not in o -> remove it + result.push_back(object( + { + {"op", "remove"}, {"path", path + "/" + key} + })); + } + } + + // second pass: traverse other object's elements + for (auto it = target.cbegin(); it != target.cend(); ++it) + { + if (source.find(it.key()) == source.end()) + { + // found a key that is not in this -> add it + const auto key = json_pointer::escape(it.key()); + result.push_back( + { + {"op", "add"}, {"path", path + "/" + key}, + {"value", it.value()} + }); + } + } + + break; + } + + default: + { + // both primitive type: replace value + result.push_back( + { + {"op", "replace"}, {"path", path}, {"value", target} + }); + break; + } + } + + return result; + } + + /// @} + + //////////////////////////////// + // JSON Merge Patch functions // + //////////////////////////////// + + /// @name JSON Merge Patch functions + /// @{ + + /*! + @brief applies a JSON Merge Patch + + The merge patch format is primarily intended for use with the HTTP PATCH + method as a means of describing a set of modifications to a target + resource's content. This function applies a merge patch to the current + JSON value. + + The function implements the following algorithm from Section 2 of + [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396): + + ``` + define MergePatch(Target, Patch): + if Patch is an Object: + if Target is not an Object: + Target = {} // Ignore the contents and set it to an empty Object + for each Name/Value pair in Patch: + if Value is null: + if Name exists in Target: + remove the Name/Value pair from Target + else: + Target[Name] = MergePatch(Target[Name], Value) + return Target + else: + return Patch + ``` + + Thereby, `Target` is the current object; that is, the patch is applied to + the current value. + + @param[in] apply_patch the patch to apply + + @complexity Linear in the lengths of @a patch. + + @liveexample{The following code shows how a JSON Merge Patch is applied to + a JSON document.,merge_patch} + + @sa @ref patch -- apply a JSON patch + @sa [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396) + + @since version 3.0.0 + */ + void merge_patch(const basic_json& apply_patch) + { + if (apply_patch.is_object()) + { + if (!is_object()) + { + *this = object(); + } + for (auto it = apply_patch.begin(); it != apply_patch.end(); ++it) + { + if (it.value().is_null()) + { + erase(it.key()); + } + else + { + operator[](it.key()).merge_patch(it.value()); + } + } + } + else + { + *this = apply_patch; + } + } + + /// @} +}; + +/*! +@brief user-defined to_string function for JSON values + +This function implements a user-defined to_string for JSON objects. + +@param[in] j a JSON object +@return a std::string object +*/ + +NLOHMANN_BASIC_JSON_TPL_DECLARATION +std::string to_string(const NLOHMANN_BASIC_JSON_TPL& j) +{ + return j.dump(); +} +} // namespace nlohmann + +/////////////////////// +// nonmember support // +/////////////////////// + +// specialization of std::swap, and std::hash +namespace std +{ + +/// hash value for JSON objects +template<> +struct hash +{ + /*! + @brief return a hash value for a JSON object + + @since version 1.0.0 + */ + std::size_t operator()(const nlohmann::json& j) const + { + return nlohmann::detail::hash(j); + } +}; + +/// specialization for std::less +/// @note: do not remove the space after '<', +/// see https://github.com/nlohmann/json/pull/679 +template<> +struct less<::nlohmann::detail::value_t> +{ + /*! + @brief compare two value_t enum values + @since version 3.0.0 + */ + bool operator()(nlohmann::detail::value_t lhs, + nlohmann::detail::value_t rhs) const noexcept + { + return nlohmann::detail::operator<(lhs, rhs); + } +}; + +// C++20 prohibit function specialization in the std namespace. +#ifndef JSON_HAS_CPP_20 + +/*! +@brief exchanges the values of two JSON objects + +@since version 1.0.0 +*/ +template<> +inline void swap(nlohmann::json& j1, nlohmann::json& j2) noexcept( + is_nothrow_move_constructible::value&& + is_nothrow_move_assignable::value + ) +{ + j1.swap(j2); +} + +#endif + +} // namespace std + +/*! +@brief user-defined string literal for JSON values + +This operator implements a user-defined string literal for JSON objects. It +can be used by adding `"_json"` to a string literal and returns a JSON object +if no parse error occurred. + +@param[in] s a string representation of a JSON object +@param[in] n the length of string @a s +@return a JSON object + +@since version 1.0.0 +*/ +JSON_HEDLEY_NON_NULL(1) +inline nlohmann::json operator "" _json(const char* s, std::size_t n) +{ + return nlohmann::json::parse(s, s + n); +} + +/*! +@brief user-defined string literal for JSON pointer + +This operator implements a user-defined string literal for JSON Pointers. It +can be used by adding `"_json_pointer"` to a string literal and returns a JSON pointer +object if no parse error occurred. + +@param[in] s a string representation of a JSON Pointer +@param[in] n the length of string @a s +@return a JSON pointer object + +@since version 2.0.0 +*/ +JSON_HEDLEY_NON_NULL(1) +inline nlohmann::json::json_pointer operator "" _json_pointer(const char* s, std::size_t n) +{ + return nlohmann::json::json_pointer(std::string(s, n)); +} + +// #include + + +// restore GCC/clang diagnostic settings +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #pragma GCC diagnostic pop +#endif +#if defined(__clang__) + #pragma GCC diagnostic pop +#endif + +// clean up +#undef JSON_ASSERT +#undef JSON_INTERNAL_CATCH +#undef JSON_CATCH +#undef JSON_THROW +#undef JSON_TRY +#undef JSON_HAS_CPP_14 +#undef JSON_HAS_CPP_17 +#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION +#undef NLOHMANN_BASIC_JSON_TPL +#undef JSON_EXPLICIT + +// #include +#undef JSON_HEDLEY_ALWAYS_INLINE +#undef JSON_HEDLEY_ARM_VERSION +#undef JSON_HEDLEY_ARM_VERSION_CHECK +#undef JSON_HEDLEY_ARRAY_PARAM +#undef JSON_HEDLEY_ASSUME +#undef JSON_HEDLEY_BEGIN_C_DECLS +#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE +#undef JSON_HEDLEY_CLANG_HAS_BUILTIN +#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE +#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE +#undef JSON_HEDLEY_CLANG_HAS_EXTENSION +#undef JSON_HEDLEY_CLANG_HAS_FEATURE +#undef JSON_HEDLEY_CLANG_HAS_WARNING +#undef JSON_HEDLEY_COMPCERT_VERSION +#undef JSON_HEDLEY_COMPCERT_VERSION_CHECK +#undef JSON_HEDLEY_CONCAT +#undef JSON_HEDLEY_CONCAT3 +#undef JSON_HEDLEY_CONCAT3_EX +#undef JSON_HEDLEY_CONCAT_EX +#undef JSON_HEDLEY_CONST +#undef JSON_HEDLEY_CONSTEXPR +#undef JSON_HEDLEY_CONST_CAST +#undef JSON_HEDLEY_CPP_CAST +#undef JSON_HEDLEY_CRAY_VERSION +#undef JSON_HEDLEY_CRAY_VERSION_CHECK +#undef JSON_HEDLEY_C_DECL +#undef JSON_HEDLEY_DEPRECATED +#undef JSON_HEDLEY_DEPRECATED_FOR +#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL +#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_ +#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED +#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES +#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS +#undef JSON_HEDLEY_DIAGNOSTIC_POP +#undef JSON_HEDLEY_DIAGNOSTIC_PUSH +#undef JSON_HEDLEY_DMC_VERSION +#undef JSON_HEDLEY_DMC_VERSION_CHECK +#undef JSON_HEDLEY_EMPTY_BASES +#undef JSON_HEDLEY_EMSCRIPTEN_VERSION +#undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK +#undef JSON_HEDLEY_END_C_DECLS +#undef JSON_HEDLEY_FLAGS +#undef JSON_HEDLEY_FLAGS_CAST +#undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE +#undef JSON_HEDLEY_GCC_HAS_BUILTIN +#undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE +#undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE +#undef JSON_HEDLEY_GCC_HAS_EXTENSION +#undef JSON_HEDLEY_GCC_HAS_FEATURE +#undef JSON_HEDLEY_GCC_HAS_WARNING +#undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK +#undef JSON_HEDLEY_GCC_VERSION +#undef JSON_HEDLEY_GCC_VERSION_CHECK +#undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE +#undef JSON_HEDLEY_GNUC_HAS_BUILTIN +#undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE +#undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE +#undef JSON_HEDLEY_GNUC_HAS_EXTENSION +#undef JSON_HEDLEY_GNUC_HAS_FEATURE +#undef JSON_HEDLEY_GNUC_HAS_WARNING +#undef JSON_HEDLEY_GNUC_VERSION +#undef JSON_HEDLEY_GNUC_VERSION_CHECK +#undef JSON_HEDLEY_HAS_ATTRIBUTE +#undef JSON_HEDLEY_HAS_BUILTIN +#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE +#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS +#undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE +#undef JSON_HEDLEY_HAS_EXTENSION +#undef JSON_HEDLEY_HAS_FEATURE +#undef JSON_HEDLEY_HAS_WARNING +#undef JSON_HEDLEY_IAR_VERSION +#undef JSON_HEDLEY_IAR_VERSION_CHECK +#undef JSON_HEDLEY_IBM_VERSION +#undef JSON_HEDLEY_IBM_VERSION_CHECK +#undef JSON_HEDLEY_IMPORT +#undef JSON_HEDLEY_INLINE +#undef JSON_HEDLEY_INTEL_VERSION +#undef JSON_HEDLEY_INTEL_VERSION_CHECK +#undef JSON_HEDLEY_IS_CONSTANT +#undef JSON_HEDLEY_IS_CONSTEXPR_ +#undef JSON_HEDLEY_LIKELY +#undef JSON_HEDLEY_MALLOC +#undef JSON_HEDLEY_MESSAGE +#undef JSON_HEDLEY_MSVC_VERSION +#undef JSON_HEDLEY_MSVC_VERSION_CHECK +#undef JSON_HEDLEY_NEVER_INLINE +#undef JSON_HEDLEY_NON_NULL +#undef JSON_HEDLEY_NO_ESCAPE +#undef JSON_HEDLEY_NO_RETURN +#undef JSON_HEDLEY_NO_THROW +#undef JSON_HEDLEY_NULL +#undef JSON_HEDLEY_PELLES_VERSION +#undef JSON_HEDLEY_PELLES_VERSION_CHECK +#undef JSON_HEDLEY_PGI_VERSION +#undef JSON_HEDLEY_PGI_VERSION_CHECK +#undef JSON_HEDLEY_PREDICT +#undef JSON_HEDLEY_PRINTF_FORMAT +#undef JSON_HEDLEY_PRIVATE +#undef JSON_HEDLEY_PUBLIC +#undef JSON_HEDLEY_PURE +#undef JSON_HEDLEY_REINTERPRET_CAST +#undef JSON_HEDLEY_REQUIRE +#undef JSON_HEDLEY_REQUIRE_CONSTEXPR +#undef JSON_HEDLEY_REQUIRE_MSG +#undef JSON_HEDLEY_RESTRICT +#undef JSON_HEDLEY_RETURNS_NON_NULL +#undef JSON_HEDLEY_SENTINEL +#undef JSON_HEDLEY_STATIC_ASSERT +#undef JSON_HEDLEY_STATIC_CAST +#undef JSON_HEDLEY_STRINGIFY +#undef JSON_HEDLEY_STRINGIFY_EX +#undef JSON_HEDLEY_SUNPRO_VERSION +#undef JSON_HEDLEY_SUNPRO_VERSION_CHECK +#undef JSON_HEDLEY_TINYC_VERSION +#undef JSON_HEDLEY_TINYC_VERSION_CHECK +#undef JSON_HEDLEY_TI_ARMCL_VERSION +#undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK +#undef JSON_HEDLEY_TI_CL2000_VERSION +#undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK +#undef JSON_HEDLEY_TI_CL430_VERSION +#undef JSON_HEDLEY_TI_CL430_VERSION_CHECK +#undef JSON_HEDLEY_TI_CL6X_VERSION +#undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK +#undef JSON_HEDLEY_TI_CL7X_VERSION +#undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK +#undef JSON_HEDLEY_TI_CLPRU_VERSION +#undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK +#undef JSON_HEDLEY_TI_VERSION +#undef JSON_HEDLEY_TI_VERSION_CHECK +#undef JSON_HEDLEY_UNAVAILABLE +#undef JSON_HEDLEY_UNLIKELY +#undef JSON_HEDLEY_UNPREDICTABLE +#undef JSON_HEDLEY_UNREACHABLE +#undef JSON_HEDLEY_UNREACHABLE_RETURN +#undef JSON_HEDLEY_VERSION +#undef JSON_HEDLEY_VERSION_DECODE_MAJOR +#undef JSON_HEDLEY_VERSION_DECODE_MINOR +#undef JSON_HEDLEY_VERSION_DECODE_REVISION +#undef JSON_HEDLEY_VERSION_ENCODE +#undef JSON_HEDLEY_WARNING +#undef JSON_HEDLEY_WARN_UNUSED_RESULT +#undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG +#undef JSON_HEDLEY_FALL_THROUGH + + + +#endif // INCLUDE_NLOHMANN_JSON_HPP_ diff --git a/cpp_to_py/common/lib/sdc/json/ChangeLog b/cpp_to_py/common/lib/sdc/json/ChangeLog new file mode 100755 index 0000000..4b4c2e7 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/ChangeLog @@ -0,0 +1,206 @@ +2014-01-07 Andreas Kupries + + * json.tcl: Move many-* wrapper to before its usage. Bumped + version to 1.3.2. v1.3.1 is broken. + + * c/json.tab.c: Worked around issues with the critcl v2 + * c/json.y: application the Tcllib C code is geared towards. + * json.tcl: Bumped json version to 1.3.1, jsonc to 1.1.1, + * jsonc.tcl: and tcllibc to 0.3.13. + * tcllibc.tcl: See ticket [6efa4f571af052]. + +2014-01-06 Andreas Kupries + + See ticket [6efa4f571af052]. + c: Removed json-parser files. + c/json.y: New parser. + c/json.tab.c: Generated parser code. + c/json_y.h: Header to binding. + jsonc.tcl: + json_tcl.tcl: + + Reworked the Json/C code to use a bison-pased parser provided by + Mikhail. No separate data structures to convert, just direct + generation of Tcl structures. Changes compared to the original + submission: + + - Use List, not Dict operations for objects, i.e. be Tcl 8.4 + compatible. + + - Do not generate Int/Double objects, only strings. Conversion to + actual int is lazy, when actually needed. Also ensures that + compile-time Tcl version does not restrict range of integers, + only runtime Tcl version. + + - Allow all values as toplevel json, not just array and object. + + - Currently no shared objects for the fixed values (null, true, + false). + + Note that the RE-based json validation is still faster on even + moderatly sized strings, even when just using a stripped C lexer + not generating token values. + + Bumped jsonc to version 1.1 and tcllibc to version 0.3.12. + +2013-12-11 Andreas Kupries + + * c: [Ticket 6efa4f571a]: Integrated a critcl binding of + * json.bench: the json-c parser. Moved to a standard + * json.man: switchable setup. json2dict and manyy-json2dict + * json.tcl: are now switchable to C. Everything else kept + * json.test: to Tcl. Note especially that Tcl 'validate' + * json.testsuite: (regexp-based) was still faster than json-c. + * json_tcl.tcl: Which has no mode for pure syntax checking, + * jsonc.tcl: thus overhead with construction of irelevant data + * pkgIndex.tcl: structures. Extended testsuite. New benchmark + * test-data: suite. Version bumped to 1.3. + +2013-06-19 Andreas Kupries + + * json.man: New command 'many-json2dict' to parse strings + * json.pcx: containing more than one JSON entity. The existing + * json.tcl: json2dict command will return only the first. Updated + * json.test: documentation. Extended testsuite. Package version + * pkgIndex.tcl: bumped to 1.2 + +2013-02-01 Andreas Kupries + + * + * Released and tagged Tcllib 1.15 ======================== + * + +2013-02-01 Andreas Kupries + + * json_write.tcl: While we can quote / (solidus) via \/ as per the + * json_write.man: JSON syntax there is no reason why we should. + * json_write.test: Bumped version to 1.0.2. + * pkgIndex.tcl: + +2011-12-13 Andreas Kupries + + * + * Released and tagged Tcllib 1.14 ======================== + * + +2011-11-10 Andreas Kupries + + * json.tcl: [Bug 3426178]: Fixed bug in "list2json", + * json.test: reported by . + * json.man: Updated testsuite. Bumped version to 1.1.2. + * pkgIndex.tcl: + +2011-08-24 Andreas Kupries + + * json_write.man: + * json_write.test: + * json_write.tcl: [Bug 3396787]: Fixed missing argument to call of + * pkgIndex.tcl: [info level], breaking the argument checks. Bumped + version to 1.0.1 + +2011-01-24 Andreas Kupries + + * + * Released and tagged Tcllib 1.13 ======================== + * + +2011-01-20 Andreas Kupries + + * json.tcl (json::parseValue): Fixed a missing -- older 8.4 seems + * json.man: to require to handle a dash in $leadingChar. Bumped + * pkgIndex.tcl: version to 1.1.1 + +2009-12-10 Andreas Kupries + + * json.tcl: [Patch 2909962]: Accepted rewrite of the json parser + * json.man: internals by Thomas Maeder + * pkgIndex.tcl: . The new + (regex-based) parser is considerably faster than the previous + implementation. Bumped version to 1.1. + +2009-12-07 Andreas Kupries + + * + * Released and tagged Tcllib 1.12 ======================== + * + +2009-11-24 Andreas Kupries + + * json_write.tcl: New package 'json::write', supporting the + * json_write.test: generation of text in JSON format. + * json_write.man: Package version 1. + * json_write.pcx: + * pkgIndex.tcl: + +2009-11-23 Andreas Kupries + + * json.tcl: Bumped package to version 1.0.1 due to the bugfix made + * pkgIndex.tcl: on 2009-04-18. + +2009-05-26 KATO Kanryu + + * json.test: improved to compare dicts + +2009-04-18 KATO Kanryu + + * json.tcl: fixed to parse last integer + * json.test: improved to compare dicts + +2008-12-12 Andreas Kupries + + * + * Released and tagged Tcllib 1.11.1 ======================== + * + +2008-10-16 Andreas Kupries + + * + * Released and tagged Tcllib 1.11 ======================== + * + +2008-06-14 Andreas Kupries + + * json.pcx: New file. Syntax definitions for the public commands + of the json package. + +2007-12-05 Andreas Kupries + + * json.test: Brought the test results into sync with the ordered + dicts of Tcl 8.5. NOTE: This will cause the combination of Tcl + 8.4 with a backported dict to fail, at least until either the + backported dict does the same ordering, or the tests are split + into variants, one for both of the two cases. This fixes [Tcllib + SF Bug 1844104], reported by Larry Virden + . Thanks. + +2007-09-12 Andreas Kupries + + * + * Released and tagged Tcllib 1.10 ======================== + * + +2007-03-21 Andreas Kupries + + * json.man: Fixed all warnings due to use of now deprecated + commands. Added a section about how to give feedback. + +2006-10-03 Andreas Kupries + + * + * Released and tagged Tcllib 1.9 ======================== + * + +2006-08-25 Jeff Hobbs + + * json.test: empty list test cases + * json.tcl (json::_json2dict): handle empty list case + +2006-08-18 Andreas Kupries + + * json.man: Added some more keywords to the docs. + +2006-08-17 Jeff Hobbs + + * json.tcl, json.man, json.test, pkgIndex.tcl: json package v1.0 + Parses JSON formatted text into Tcl dicts. + See http://www.json.org/ for format details. diff --git a/cpp_to_py/common/lib/sdc/json/c/json.tab.c b/cpp_to_py/common/lib/sdc/json/c/json.tab.c new file mode 100755 index 0000000..e044c52 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/c/json.tab.c @@ -0,0 +1,1992 @@ +/* A Bison parser, made by GNU Bison 3.0.2. */ + +/* Bison implementation for Yacc-like parsers in C + + Copyright (C) 1984, 1989-1990, 2000-2013 Free Software Foundation, Inc. + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/* C LALR(1) parser skeleton written by Richard Stallman, by + simplifying the original so-called "semantic" parser. */ + +/* All symbols defined below should begin with yy or YY, to avoid + infringing on user name space. This should be done even for local + variables, as they might otherwise be expanded by user macros. + There are some unavoidable exceptions within include files to + define necessary library symbols; they are noted "INFRINGES ON + USER NAME SPACE" below. */ + +/* Identify Bison output. */ +#define YYBISON 1 + +/* Bison version. */ +#define YYBISON_VERSION "3.0.2" + +/* Skeleton name. */ +#define YYSKELETON_NAME "yacc.c" + +/* Pure parsers. */ +#define YYPURE 2 + +/* Push parsers. */ +#define YYPUSH 0 + +/* Pull parsers. */ +#define YYPULL 1 + + + + +/* Copy the first part of user declarations. */ +#line 8 "json.y" /* yacc.c:339 */ + +/* * ** *** ***** ******** ************* ********************* */ +#include +#include +#include +#include +#include +#include + +#include + +#define TOKEN(tok) TRACE (("TOKEN %s\n", tok)) +#define TOKEN1(tok) TRACE (("TOKEN %s (%s)\n", tok, Tcl_GetString(context->obj))) +#define REDUCE(rule) TRACE (("REDUCE %s\n", rule)) + +#define TRUE_O (Tcl_NewStringObj("true", 4)) +#define FALSE_O (Tcl_NewStringObj("false", 5)) +#define NULL_O (Tcl_NewStringObj("null", 4)) + +typedef union YYSTYPE YYSTYPE; + +static void jsonerror (struct context *, const char *); +static int jsonlexp (YYSTYPE *lvalp, struct context *context); + +#define yylex jsonlexp +#define yyerror jsonerror + +/* * ** *** ***** ******** ************* ********************* +** User declarations + */ + +#line 98 "json.tab.c" /* yacc.c:339 */ + +# ifndef YY_NULLPTR +# if defined __cplusplus && 201103L <= __cplusplus +# define YY_NULLPTR nullptr +# else +# define YY_NULLPTR 0 +# endif +# endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 0 +#endif + + +/* Debug traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif +#if YYDEBUG +extern int yydebug; +#endif + +/* Token type. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + enum yytokentype + { + STRING = 258, + CONSTANT = 259 + }; +#endif + +/* Value type. */ +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED +typedef union YYSTYPE YYSTYPE; +union YYSTYPE +{ +#line 40 "json.y" /* yacc.c:355 */ + + Tcl_Obj *obj; + struct { + Tcl_Obj *key; + Tcl_Obj *val; + } keyval; + +#line 148 "json.tab.c" /* yacc.c:355 */ +}; +# define YYSTYPE_IS_TRIVIAL 1 +# define YYSTYPE_IS_DECLARED 1 +#endif + + + +int yyparse (struct context* context); + + + +/* Copy the second part of user declarations. */ + +#line 162 "json.tab.c" /* yacc.c:358 */ + +#ifdef short +# undef short +#endif + +#ifdef YYTYPE_UINT8 +typedef YYTYPE_UINT8 yytype_uint8; +#else +typedef unsigned char yytype_uint8; +#endif + +#ifdef YYTYPE_INT8 +typedef YYTYPE_INT8 yytype_int8; +#else +typedef signed char yytype_int8; +#endif + +#ifdef YYTYPE_UINT16 +typedef YYTYPE_UINT16 yytype_uint16; +#else +typedef unsigned short int yytype_uint16; +#endif + +#ifdef YYTYPE_INT16 +typedef YYTYPE_INT16 yytype_int16; +#else +typedef short int yytype_int16; +#endif + +#ifndef YYSIZE_T +# ifdef __SIZE_TYPE__ +# define YYSIZE_T __SIZE_TYPE__ +# elif defined size_t +# define YYSIZE_T size_t +# elif ! defined YYSIZE_T +# include /* INFRINGES ON USER NAME SPACE */ +# define YYSIZE_T size_t +# else +# define YYSIZE_T unsigned int +# endif +#endif + +#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) + +#ifndef YY_ +# if defined YYENABLE_NLS && YYENABLE_NLS +# if ENABLE_NLS +# include /* INFRINGES ON USER NAME SPACE */ +# define YY_(Msgid) dgettext ("bison-runtime", Msgid) +# endif +# endif +# ifndef YY_ +# define YY_(Msgid) Msgid +# endif +#endif + +#ifndef YY_ATTRIBUTE +# if (defined __GNUC__ \ + && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ + || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C +# define YY_ATTRIBUTE(Spec) __attribute__(Spec) +# else +# define YY_ATTRIBUTE(Spec) /* empty */ +# endif +#endif + +#ifndef YY_ATTRIBUTE_PURE +# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) +#endif + +#ifndef YY_ATTRIBUTE_UNUSED +# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) +#endif + +#if !defined _Noreturn \ + && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112) +# if defined _MSC_VER && 1200 <= _MSC_VER +# define _Noreturn __declspec (noreturn) +# else +# define _Noreturn YY_ATTRIBUTE ((__noreturn__)) +# endif +#endif + +/* Suppress unused-variable warnings by "using" E. */ +#if ! defined lint || defined __GNUC__ +# define YYUSE(E) ((void) (E)) +#else +# define YYUSE(E) /* empty */ +#endif + +#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ +/* Suppress an incorrect diagnostic about yylval being uninitialized. */ +# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ + _Pragma ("GCC diagnostic push") \ + _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ + _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") +# define YY_IGNORE_MAYBE_UNINITIALIZED_END \ + _Pragma ("GCC diagnostic pop") +#else +# define YY_INITIAL_VALUE(Value) Value +#endif +#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN +# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN +# define YY_IGNORE_MAYBE_UNINITIALIZED_END +#endif +#ifndef YY_INITIAL_VALUE +# define YY_INITIAL_VALUE(Value) /* Nothing. */ +#endif + + +#if ! defined yyoverflow || YYERROR_VERBOSE + +/* The parser invokes alloca or malloc; define the necessary symbols. */ + +# ifdef YYSTACK_USE_ALLOCA +# if YYSTACK_USE_ALLOCA +# ifdef __GNUC__ +# define YYSTACK_ALLOC __builtin_alloca +# elif defined __BUILTIN_VA_ARG_INCR +# include /* INFRINGES ON USER NAME SPACE */ +# elif defined _AIX +# define YYSTACK_ALLOC __alloca +# elif defined _MSC_VER +# include /* INFRINGES ON USER NAME SPACE */ +# define alloca _alloca +# else +# define YYSTACK_ALLOC alloca +# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS +# include /* INFRINGES ON USER NAME SPACE */ + /* Use EXIT_SUCCESS as a witness for stdlib.h. */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# endif +# endif +# endif + +# ifdef YYSTACK_ALLOC + /* Pacify GCC's 'empty if-body' warning. */ +# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) +# ifndef YYSTACK_ALLOC_MAXIMUM + /* The OS might guarantee only one guard page at the bottom of the stack, + and a page size can be as small as 4096 bytes. So we cannot safely + invoke alloca (N) if N exceeds 4096. Use a slightly smaller number + to allow for a few compiler-allocated temporary stack slots. */ +# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ +# endif +# else +# define YYSTACK_ALLOC YYMALLOC +# define YYSTACK_FREE YYFREE +# ifndef YYSTACK_ALLOC_MAXIMUM +# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM +# endif +# if (defined __cplusplus && ! defined EXIT_SUCCESS \ + && ! ((defined YYMALLOC || defined malloc) \ + && (defined YYFREE || defined free))) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# ifndef YYMALLOC +# define YYMALLOC malloc +# if ! defined malloc && ! defined EXIT_SUCCESS +void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# ifndef YYFREE +# define YYFREE free +# if ! defined free && ! defined EXIT_SUCCESS +void free (void *); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# endif +#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ + + +#if (! defined yyoverflow \ + && (! defined __cplusplus \ + || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) + +/* A type that is properly aligned for any stack member. */ +union yyalloc +{ + yytype_int16 yyss_alloc; + YYSTYPE yyvs_alloc; +}; + +/* The size of the maximum gap between one aligned stack and the next. */ +# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) + +/* The size of an array large to enough to hold all stacks, each with + N elements. */ +# define YYSTACK_BYTES(N) \ + ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ + + YYSTACK_GAP_MAXIMUM) + +# define YYCOPY_NEEDED 1 + +/* Relocate STACK from its old location to the new one. The + local variables YYSIZE and YYSTACKSIZE give the old and new number of + elements in the stack, and YYPTR gives the new location of the + stack. Advance YYPTR to a properly aligned location for the next + stack. */ +# define YYSTACK_RELOCATE(Stack_alloc, Stack) \ + do \ + { \ + YYSIZE_T yynewbytes; \ + YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ + Stack = &yyptr->Stack_alloc; \ + yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ + yyptr += yynewbytes / sizeof (*yyptr); \ + } \ + while (0) + +#endif + +#if defined YYCOPY_NEEDED && YYCOPY_NEEDED +/* Copy COUNT objects from SRC to DST. The source and destination do + not overlap. */ +# ifndef YYCOPY +# if defined __GNUC__ && 1 < __GNUC__ +# define YYCOPY(Dst, Src, Count) \ + __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) +# else +# define YYCOPY(Dst, Src, Count) \ + do \ + { \ + YYSIZE_T yyi; \ + for (yyi = 0; yyi < (Count); yyi++) \ + (Dst)[yyi] = (Src)[yyi]; \ + } \ + while (0) +# endif +# endif +#endif /* !YYCOPY_NEEDED */ + +/* YYFINAL -- State number of the termination state. */ +#define YYFINAL 18 +/* YYLAST -- Last index in YYTABLE. */ +#define YYLAST 23 + +/* YYNTOKENS -- Number of terminals. */ +#define YYNTOKENS 11 +/* YYNNTS -- Number of nonterminals. */ +#define YYNNTS 10 +/* YYNRULES -- Number of rules. */ +#define YYNRULES 17 +/* YYNSTATES -- Number of states. */ +#define YYNSTATES 27 + +/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned + by yylex, with out-of-bounds checking. */ +#define YYUNDEFTOK 2 +#define YYMAXUTOK 259 + +#define YYTRANSLATE(YYX) \ + ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) + +/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM + as returned by yylex, without out-of-bounds checking. */ +static const yytype_uint8 yytranslate[] = +{ + 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 9, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 10, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 7, 2, 8, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 5, 2, 6, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 1, 2, 3, 4 +}; + +#if YYDEBUG + /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ +static const yytype_uint8 yyrline[] = +{ + 0, 65, 65, 76, 79, 83, 89, 93, 99, 103, + 110, 116, 124, 131, 137, 141, 142, 143 +}; +#endif + +#if YYDEBUG || YYERROR_VERBOSE || 0 +/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. + First, the terminals, then, starting at YYNTOKENS, nonterminals. */ +static const char *const yytname[] = +{ + "$end", "error", "$undefined", "STRING", "CONSTANT", "'{'", "'}'", + "'['", "']'", "','", "':'", "$accept", "tree", "json", "object", "list", + "values", "members", "member", "string", "value", YY_NULLPTR +}; +#endif + +# ifdef YYPRINT +/* YYTOKNUM[NUM] -- (External) token number corresponding to the + (internal) symbol number NUM (which must be that of a token). */ +static const yytype_uint16 yytoknum[] = +{ + 0, 256, 257, 258, 259, 123, 125, 91, 93, 44, + 58 +}; +# endif + +#define YYPACT_NINF -6 + +#define yypact_value_is_default(Yystate) \ + (!!((Yystate) == (-6))) + +#define YYTABLE_NINF -1 + +#define yytable_value_is_error(Yytable_value) \ + 0 + + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ +static const yytype_int8 yypact[] = +{ + 5, -6, -6, 8, -1, 15, -6, -6, -6, -6, + -6, -6, 7, -6, -5, -6, 12, -6, -6, -6, + 19, 5, -6, 5, -6, -6, -6 +}; + + /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. + Performed when YYTABLE does not specify something else to do. Zero + means the default is an error. */ +static const yytype_uint8 yydefact[] = +{ + 0, 13, 14, 0, 0, 0, 2, 16, 17, 15, + 3, 5, 0, 10, 0, 7, 0, 8, 1, 4, + 0, 0, 6, 0, 11, 12, 9 +}; + + /* YYPGOTO[NTERM-NUM]. */ +static const yytype_int8 yypgoto[] = +{ + -6, -6, -6, -6, -6, -6, -6, 3, -2, -4 +}; + + /* YYDEFGOTO[NTERM-NUM]. */ +static const yytype_int8 yydefgoto[] = +{ + -1, 5, 6, 7, 8, 16, 12, 13, 9, 10 +}; + + /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If + positive, shift that token. If negative, reduce the rule whose + number is the opposite. If YYTABLE_NINF, syntax error. */ +static const yytype_uint8 yytable[] = +{ + 17, 14, 1, 2, 3, 21, 4, 15, 1, 2, + 3, 1, 4, 19, 11, 18, 20, 25, 14, 26, + 22, 23, 1, 24 +}; + +static const yytype_uint8 yycheck[] = +{ + 4, 3, 3, 4, 5, 10, 7, 8, 3, 4, + 5, 3, 7, 6, 6, 0, 9, 21, 20, 23, + 8, 9, 3, 20 +}; + + /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ +static const yytype_uint8 yystos[] = +{ + 0, 3, 4, 5, 7, 12, 13, 14, 15, 19, + 20, 6, 17, 18, 19, 8, 16, 20, 0, 6, + 9, 10, 8, 9, 18, 20, 20 +}; + + /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ +static const yytype_uint8 yyr1[] = +{ + 0, 11, 12, 13, 14, 14, 15, 15, 16, 16, + 17, 17, 18, 19, 20, 20, 20, 20 +}; + + /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ +static const yytype_uint8 yyr2[] = +{ + 0, 2, 1, 1, 3, 2, 3, 2, 1, 3, + 1, 3, 3, 1, 1, 1, 1, 1 +}; + + +#define yyerrok (yyerrstatus = 0) +#define yyclearin (yychar = YYEMPTY) +#define YYEMPTY (-2) +#define YYEOF 0 + +#define YYACCEPT goto yyacceptlab +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrorlab + + +#define YYRECOVERING() (!!yyerrstatus) + +#define YYBACKUP(Token, Value) \ +do \ + if (yychar == YYEMPTY) \ + { \ + yychar = (Token); \ + yylval = (Value); \ + YYPOPSTACK (yylen); \ + yystate = *yyssp; \ + goto yybackup; \ + } \ + else \ + { \ + yyerror (context, YY_("syntax error: cannot back up")); \ + YYERROR; \ + } \ +while (0) + +/* Error token number */ +#define YYTERROR 1 +#define YYERRCODE 256 + + + +/* Enable debugging if requested. */ +#if YYDEBUG + +# ifndef YYFPRINTF +# include /* INFRINGES ON USER NAME SPACE */ +# define YYFPRINTF fprintf +# endif + +# define YYDPRINTF(Args) \ +do { \ + if (yydebug) \ + YYFPRINTF Args; \ +} while (0) + +/* This macro is provided for backward compatibility. */ +#ifndef YY_LOCATION_PRINT +# define YY_LOCATION_PRINT(File, Loc) ((void) 0) +#endif + + +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ +do { \ + if (yydebug) \ + { \ + YYFPRINTF (stderr, "%s ", Title); \ + yy_symbol_print (stderr, \ + Type, Value, context); \ + YYFPRINTF (stderr, "\n"); \ + } \ +} while (0) + + +/*----------------------------------------. +| Print this symbol's value on YYOUTPUT. | +`----------------------------------------*/ + +static void +yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, struct context* context) +{ + FILE *yyo = yyoutput; + YYUSE (yyo); + YYUSE (context); + if (!yyvaluep) + return; +# ifdef YYPRINT + if (yytype < YYNTOKENS) + YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); +# endif + YYUSE (yytype); +} + + +/*--------------------------------. +| Print this symbol on YYOUTPUT. | +`--------------------------------*/ + +static void +yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, struct context* context) +{ + YYFPRINTF (yyoutput, "%s %s (", + yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); + + yy_symbol_value_print (yyoutput, yytype, yyvaluep, context); + YYFPRINTF (yyoutput, ")"); +} + +/*------------------------------------------------------------------. +| yy_stack_print -- Print the state stack from its BOTTOM up to its | +| TOP (included). | +`------------------------------------------------------------------*/ + +static void +yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) +{ + YYFPRINTF (stderr, "Stack now"); + for (; yybottom <= yytop; yybottom++) + { + int yybot = *yybottom; + YYFPRINTF (stderr, " %d", yybot); + } + YYFPRINTF (stderr, "\n"); +} + +# define YY_STACK_PRINT(Bottom, Top) \ +do { \ + if (yydebug) \ + yy_stack_print ((Bottom), (Top)); \ +} while (0) + + +/*------------------------------------------------. +| Report that the YYRULE is going to be reduced. | +`------------------------------------------------*/ + +static void +yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule, struct context* context) +{ + unsigned long int yylno = yyrline[yyrule]; + int yynrhs = yyr2[yyrule]; + int yyi; + YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", + yyrule - 1, yylno); + /* The symbols being reduced. */ + for (yyi = 0; yyi < yynrhs; yyi++) + { + YYFPRINTF (stderr, " $%d = ", yyi + 1); + yy_symbol_print (stderr, + yystos[yyssp[yyi + 1 - yynrhs]], + &(yyvsp[(yyi + 1) - (yynrhs)]) + , context); + YYFPRINTF (stderr, "\n"); + } +} + +# define YY_REDUCE_PRINT(Rule) \ +do { \ + if (yydebug) \ + yy_reduce_print (yyssp, yyvsp, Rule, context); \ +} while (0) + +/* Nonzero means print parse trace. It is left uninitialized so that + multiple parsers can coexist. */ +int yydebug; +#else /* !YYDEBUG */ +# define YYDPRINTF(Args) +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) +# define YY_STACK_PRINT(Bottom, Top) +# define YY_REDUCE_PRINT(Rule) +#endif /* !YYDEBUG */ + + +/* YYINITDEPTH -- initial size of the parser's stacks. */ +#ifndef YYINITDEPTH +# define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only + if the built-in stack extension method is used). + + Do not make this value too large; the results are undefined if + YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) + evaluated with infinite-precision integer arithmetic. */ + +#ifndef YYMAXDEPTH +# define YYMAXDEPTH 10000 +#endif + + +#if YYERROR_VERBOSE + +# ifndef yystrlen +# if defined __GLIBC__ && defined _STRING_H +# define yystrlen strlen +# else +/* Return the length of YYSTR. */ +static YYSIZE_T +yystrlen (const char *yystr) +{ + YYSIZE_T yylen; + for (yylen = 0; yystr[yylen]; yylen++) + continue; + return yylen; +} +# endif +# endif + +# ifndef yystpcpy +# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE +# define yystpcpy stpcpy +# else +/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in + YYDEST. */ +static char * +yystpcpy (char *yydest, const char *yysrc) +{ + char *yyd = yydest; + const char *yys = yysrc; + + while ((*yyd++ = *yys++) != '\0') + continue; + + return yyd - 1; +} +# endif +# endif + +# ifndef yytnamerr +/* Copy to YYRES the contents of YYSTR after stripping away unnecessary + quotes and backslashes, so that it's suitable for yyerror. The + heuristic is that double-quoting is unnecessary unless the string + contains an apostrophe, a comma, or backslash (other than + backslash-backslash). YYSTR is taken from yytname. If YYRES is + null, do not copy; instead, return the length of what the result + would have been. */ +static YYSIZE_T +yytnamerr (char *yyres, const char *yystr) +{ + if (*yystr == '"') + { + YYSIZE_T yyn = 0; + char const *yyp = yystr; + + for (;;) + switch (*++yyp) + { + case '\'': + case ',': + goto do_not_strip_quotes; + + case '\\': + if (*++yyp != '\\') + goto do_not_strip_quotes; + /* Fall through. */ + default: + if (yyres) + yyres[yyn] = *yyp; + yyn++; + break; + + case '"': + if (yyres) + yyres[yyn] = '\0'; + return yyn; + } + do_not_strip_quotes: ; + } + + if (! yyres) + return yystrlen (yystr); + + return yystpcpy (yyres, yystr) - yyres; +} +# endif + +/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message + about the unexpected token YYTOKEN for the state stack whose top is + YYSSP. + + Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is + not large enough to hold the message. In that case, also set + *YYMSG_ALLOC to the required number of bytes. Return 2 if the + required number of bytes is too large to store. */ +static int +yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, + yytype_int16 *yyssp, int yytoken) +{ + YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); + YYSIZE_T yysize = yysize0; + enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; + /* Internationalized format string. */ + const char *yyformat = YY_NULLPTR; + /* Arguments of yyformat. */ + char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; + /* Number of reported tokens (one for the "unexpected", one per + "expected"). */ + int yycount = 0; + + /* There are many possibilities here to consider: + - If this state is a consistent state with a default action, then + the only way this function was invoked is if the default action + is an error action. In that case, don't check for expected + tokens because there are none. + - The only way there can be no lookahead present (in yychar) is if + this state is a consistent state with a default action. Thus, + detecting the absence of a lookahead is sufficient to determine + that there is no unexpected or expected token to report. In that + case, just report a simple "syntax error". + - Don't assume there isn't a lookahead just because this state is a + consistent state with a default action. There might have been a + previous inconsistent state, consistent state with a non-default + action, or user semantic action that manipulated yychar. + - Of course, the expected token list depends on states to have + correct lookahead information, and it depends on the parser not + to perform extra reductions after fetching a lookahead from the + scanner and before detecting a syntax error. Thus, state merging + (from LALR or IELR) and default reductions corrupt the expected + token list. However, the list is correct for canonical LR with + one exception: it will still contain any token that will not be + accepted due to an error action in a later state. + */ + if (yytoken != YYEMPTY) + { + int yyn = yypact[*yyssp]; + yyarg[yycount++] = yytname[yytoken]; + if (!yypact_value_is_default (yyn)) + { + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. In other words, skip the first -YYN actions for + this state because they are default actions. */ + int yyxbegin = yyn < 0 ? -yyn : 0; + /* Stay within bounds of both yycheck and yytname. */ + int yychecklim = YYLAST - yyn + 1; + int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; + int yyx; + + for (yyx = yyxbegin; yyx < yyxend; ++yyx) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR + && !yytable_value_is_error (yytable[yyx + yyn])) + { + if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) + { + yycount = 1; + yysize = yysize0; + break; + } + yyarg[yycount++] = yytname[yyx]; + { + YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); + if (! (yysize <= yysize1 + && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) + return 2; + yysize = yysize1; + } + } + } + } + + switch (yycount) + { +# define YYCASE_(N, S) \ + case N: \ + yyformat = S; \ + break + YYCASE_(0, YY_("syntax error")); + YYCASE_(1, YY_("syntax error, unexpected %s")); + YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); + YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); + YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); + YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); +# undef YYCASE_ + } + + { + YYSIZE_T yysize1 = yysize + yystrlen (yyformat); + if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) + return 2; + yysize = yysize1; + } + + if (*yymsg_alloc < yysize) + { + *yymsg_alloc = 2 * yysize; + if (! (yysize <= *yymsg_alloc + && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) + *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; + return 1; + } + + /* Avoid sprintf, as that infringes on the user's name space. + Don't have undefined behavior even if the translation + produced a string with the wrong number of "%s"s. */ + { + char *yyp = *yymsg; + int yyi = 0; + while ((*yyp = *yyformat) != '\0') + if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) + { + yyp += yytnamerr (yyp, yyarg[yyi++]); + yyformat += 2; + } + else + { + yyp++; + yyformat++; + } + } + return 0; +} +#endif /* YYERROR_VERBOSE */ + +/*-----------------------------------------------. +| Release the memory associated to this symbol. | +`-----------------------------------------------*/ + +static void +yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, struct context* context) +{ + YYUSE (yyvaluep); + YYUSE (context); + if (!yymsg) + yymsg = "Deleting"; + YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); + + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + YYUSE (yytype); + YY_IGNORE_MAYBE_UNINITIALIZED_END +} + + + + +/*----------. +| yyparse. | +`----------*/ + +int +yyparse (struct context* context) +{ +/* The lookahead symbol. */ +int yychar; + + +/* The semantic value of the lookahead symbol. */ +/* Default value used for initialization, for pacifying older GCCs + or non-GCC compilers. */ +YY_INITIAL_VALUE (static YYSTYPE yyval_default;) +YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default); + + /* Number of syntax errors so far. */ + int yynerrs; + + int yystate; + /* Number of tokens to shift before error messages enabled. */ + int yyerrstatus; + + /* The stacks and their tools: + 'yyss': related to states. + 'yyvs': related to semantic values. + + Refer to the stacks through separate pointers, to allow yyoverflow + to reallocate them elsewhere. */ + + /* The state stack. */ + yytype_int16 yyssa[YYINITDEPTH]; + yytype_int16 *yyss; + yytype_int16 *yyssp; + + /* The semantic value stack. */ + YYSTYPE yyvsa[YYINITDEPTH]; + YYSTYPE *yyvs; + YYSTYPE *yyvsp; + + YYSIZE_T yystacksize; + + int yyn; + int yyresult; + /* Lookahead token as an internal (translated) token number. */ + int yytoken = 0; + /* The variables used to return semantic value and location from the + action routines. */ + YYSTYPE yyval; + +#if YYERROR_VERBOSE + /* Buffer for error messages, and its allocated size. */ + char yymsgbuf[128]; + char *yymsg = yymsgbuf; + YYSIZE_T yymsg_alloc = sizeof yymsgbuf; +#endif + +#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) + + /* The number of symbols on the RHS of the reduced rule. + Keep to zero when no symbol should be popped. */ + int yylen = 0; + + yyssp = yyss = yyssa; + yyvsp = yyvs = yyvsa; + yystacksize = YYINITDEPTH; + + YYDPRINTF ((stderr, "Starting parse\n")); + + yystate = 0; + yyerrstatus = 0; + yynerrs = 0; + yychar = YYEMPTY; /* Cause a token to be read. */ + goto yysetstate; + +/*------------------------------------------------------------. +| yynewstate -- Push a new state, which is found in yystate. | +`------------------------------------------------------------*/ + yynewstate: + /* In all cases, when you get here, the value and location stacks + have just been pushed. So pushing a state here evens the stacks. */ + yyssp++; + + yysetstate: + *yyssp = yystate; + + if (yyss + yystacksize - 1 <= yyssp) + { + /* Get the current used size of the three stacks, in elements. */ + YYSIZE_T yysize = yyssp - yyss + 1; + +#ifdef yyoverflow + { + /* Give user a chance to reallocate the stack. Use copies of + these so that the &'s don't force the real ones into + memory. */ + YYSTYPE *yyvs1 = yyvs; + yytype_int16 *yyss1 = yyss; + + /* Each stack pointer address is followed by the size of the + data in use in that stack, in bytes. This used to be a + conditional around just the two extra args, but that might + be undefined if yyoverflow is a macro. */ + yyoverflow (YY_("memory exhausted"), + &yyss1, yysize * sizeof (*yyssp), + &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); + + yyss = yyss1; + yyvs = yyvs1; + } +#else /* no yyoverflow */ +# ifndef YYSTACK_RELOCATE + goto yyexhaustedlab; +# else + /* Extend the stack our own way. */ + if (YYMAXDEPTH <= yystacksize) + goto yyexhaustedlab; + yystacksize *= 2; + if (YYMAXDEPTH < yystacksize) + yystacksize = YYMAXDEPTH; + + { + yytype_int16 *yyss1 = yyss; + union yyalloc *yyptr = + (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); + if (! yyptr) + goto yyexhaustedlab; + YYSTACK_RELOCATE (yyss_alloc, yyss); + YYSTACK_RELOCATE (yyvs_alloc, yyvs); +# undef YYSTACK_RELOCATE + if (yyss1 != yyssa) + YYSTACK_FREE (yyss1); + } +# endif +#endif /* no yyoverflow */ + + yyssp = yyss + yysize - 1; + yyvsp = yyvs + yysize - 1; + + YYDPRINTF ((stderr, "Stack size increased to %lu\n", + (unsigned long int) yystacksize)); + + if (yyss + yystacksize - 1 <= yyssp) + YYABORT; + } + + YYDPRINTF ((stderr, "Entering state %d\n", yystate)); + + if (yystate == YYFINAL) + YYACCEPT; + + goto yybackup; + +/*-----------. +| yybackup. | +`-----------*/ +yybackup: + + /* Do appropriate processing given the current state. Read a + lookahead token if we need one and don't already have one. */ + + /* First try to decide what to do without reference to lookahead token. */ + yyn = yypact[yystate]; + if (yypact_value_is_default (yyn)) + goto yydefault; + + /* Not known => get a lookahead token if don't already have one. */ + + /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ + if (yychar == YYEMPTY) + { + YYDPRINTF ((stderr, "Reading a token: ")); + yychar = yylex (&yylval, context); + } + + if (yychar <= YYEOF) + { + yychar = yytoken = YYEOF; + YYDPRINTF ((stderr, "Now at end of input.\n")); + } + else + { + yytoken = YYTRANSLATE (yychar); + YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); + } + + /* If the proper action on seeing token YYTOKEN is to reduce or to + detect an error, take that action. */ + yyn += yytoken; + if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) + goto yydefault; + yyn = yytable[yyn]; + if (yyn <= 0) + { + if (yytable_value_is_error (yyn)) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + + /* Count tokens shifted since error; after three, turn off error + status. */ + if (yyerrstatus) + yyerrstatus--; + + /* Shift the lookahead token. */ + YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); + + /* Discard the shifted token. */ + yychar = YYEMPTY; + + yystate = yyn; + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + *++yyvsp = yylval; + YY_IGNORE_MAYBE_UNINITIALIZED_END + + goto yynewstate; + + +/*-----------------------------------------------------------. +| yydefault -- do the default action for the current state. | +`-----------------------------------------------------------*/ +yydefault: + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + goto yyreduce; + + +/*-----------------------------. +| yyreduce -- Do a reduction. | +`-----------------------------*/ +yyreduce: + /* yyn is the number of a rule to reduce with. */ + yylen = yyr2[yyn]; + + /* If YYLEN is nonzero, implement the default value of the action: + '$$ = $1'. + + Otherwise, the following line sets YYVAL to garbage. + This behavior is undocumented and Bison + users should not rely upon it. Assigning to YYVAL + unconditionally makes the parser a bit smaller, and it avoids a + GCC warning that YYVAL may be used uninitialized. */ + yyval = yyvsp[1-yylen]; + + + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + case 2: +#line 66 "json.y" /* yacc.c:1646 */ + { + REDUCE("TREE"); + if (context->I) { + Tcl_SetObjResult(context->I, (yyvsp[0].obj)); + TRACE ((" RESULT (%s)\n", Tcl_GetString((yyvsp[0].obj)))); + } + context->result = TCL_OK; + } +#line 1255 "json.tab.c" /* yacc.c:1646 */ + break; + + case 4: +#line 80 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = (yyvsp[-1].obj); + } +#line 1263 "json.tab.c" /* yacc.c:1646 */ + break; + + case 5: +#line 84 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = Tcl_NewObj(); + } +#line 1271 "json.tab.c" /* yacc.c:1646 */ + break; + + case 6: +#line 90 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = (yyvsp[-1].obj); + } +#line 1279 "json.tab.c" /* yacc.c:1646 */ + break; + + case 7: +#line 94 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = Tcl_NewObj(); + } +#line 1287 "json.tab.c" /* yacc.c:1646 */ + break; + + case 8: +#line 100 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = Tcl_NewListObj(1, &(yyvsp[0].obj)); + } +#line 1295 "json.tab.c" /* yacc.c:1646 */ + break; + + case 9: +#line 104 "json.y" /* yacc.c:1646 */ + { + Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].obj)); + (yyval.obj) = (yyvsp[-2].obj); + } +#line 1304 "json.tab.c" /* yacc.c:1646 */ + break; + + case 10: +#line 111 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = Tcl_NewListObj(0, NULL); + Tcl_ListObjAppendElement(NULL, (yyval.obj), (yyvsp[0].keyval).key); + Tcl_ListObjAppendElement(NULL, (yyval.obj), (yyvsp[0].keyval).val); + } +#line 1314 "json.tab.c" /* yacc.c:1646 */ + break; + + case 11: +#line 117 "json.y" /* yacc.c:1646 */ + { + Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].keyval).key); + Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].keyval).val); + (yyval.obj) = (yyvsp[-2].obj); + } +#line 1324 "json.tab.c" /* yacc.c:1646 */ + break; + + case 12: +#line 125 "json.y" /* yacc.c:1646 */ + { + (yyval.keyval).key = (yyvsp[-2].obj); + (yyval.keyval).val = (yyvsp[0].obj); + } +#line 1333 "json.tab.c" /* yacc.c:1646 */ + break; + + case 13: +#line 132 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = context->obj; + } +#line 1341 "json.tab.c" /* yacc.c:1646 */ + break; + + case 14: +#line 138 "json.y" /* yacc.c:1646 */ + { + (yyval.obj) = context->obj; + } +#line 1349 "json.tab.c" /* yacc.c:1646 */ + break; + + +#line 1353 "json.tab.c" /* yacc.c:1646 */ + default: break; + } + /* User semantic actions sometimes alter yychar, and that requires + that yytoken be updated with the new translation. We take the + approach of translating immediately before every use of yytoken. + One alternative is translating here after every semantic action, + but that translation would be missed if the semantic action invokes + YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or + if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an + incorrect destructor might then be invoked immediately. In the + case of YYERROR or YYBACKUP, subsequent parser actions might lead + to an incorrect destructor call or verbose syntax error message + before the lookahead is translated. */ + YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); + + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + + *++yyvsp = yyval; + + /* Now 'shift' the result of the reduction. Determine what state + that goes to, based on the state we popped back to and the rule + number reduced by. */ + + yyn = yyr1[yyn]; + + yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; + if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) + yystate = yytable[yystate]; + else + yystate = yydefgoto[yyn - YYNTOKENS]; + + goto yynewstate; + + +/*--------------------------------------. +| yyerrlab -- here on detecting error. | +`--------------------------------------*/ +yyerrlab: + /* Make sure we have latest lookahead translation. See comments at + user semantic actions for why this is necessary. */ + yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); + + /* If not already recovering from an error, report this error. */ + if (!yyerrstatus) + { + ++yynerrs; +#if ! YYERROR_VERBOSE + yyerror (context, YY_("syntax error")); +#else +# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ + yyssp, yytoken) + { + char const *yymsgp = YY_("syntax error"); + int yysyntax_error_status; + yysyntax_error_status = YYSYNTAX_ERROR; + if (yysyntax_error_status == 0) + yymsgp = yymsg; + else if (yysyntax_error_status == 1) + { + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); + yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); + if (!yymsg) + { + yymsg = yymsgbuf; + yymsg_alloc = sizeof yymsgbuf; + yysyntax_error_status = 2; + } + else + { + yysyntax_error_status = YYSYNTAX_ERROR; + yymsgp = yymsg; + } + } + yyerror (context, yymsgp); + if (yysyntax_error_status == 2) + goto yyexhaustedlab; + } +# undef YYSYNTAX_ERROR +#endif + } + + + + if (yyerrstatus == 3) + { + /* If just tried and failed to reuse lookahead token after an + error, discard it. */ + + if (yychar <= YYEOF) + { + /* Return failure if at end of input. */ + if (yychar == YYEOF) + YYABORT; + } + else + { + yydestruct ("Error: discarding", + yytoken, &yylval, context); + yychar = YYEMPTY; + } + } + + /* Else will try to reuse lookahead token after shifting the error + token. */ + goto yyerrlab1; + + +/*---------------------------------------------------. +| yyerrorlab -- error raised explicitly by YYERROR. | +`---------------------------------------------------*/ +yyerrorlab: + + /* Pacify compilers like GCC when the user code never invokes + YYERROR and the label yyerrorlab therefore never appears in user + code. */ + if (/*CONSTCOND*/ 0) + goto yyerrorlab; + + /* Do not reclaim the symbols of the rule whose action triggered + this YYERROR. */ + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + yystate = *yyssp; + goto yyerrlab1; + + +/*-------------------------------------------------------------. +| yyerrlab1 -- common code for both syntax error and YYERROR. | +`-------------------------------------------------------------*/ +yyerrlab1: + yyerrstatus = 3; /* Each real token shifted decrements this. */ + + for (;;) + { + yyn = yypact[yystate]; + if (!yypact_value_is_default (yyn)) + { + yyn += YYTERROR; + if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) + { + yyn = yytable[yyn]; + if (0 < yyn) + break; + } + } + + /* Pop the current state because it cannot handle the error token. */ + if (yyssp == yyss) + YYABORT; + + + yydestruct ("Error: popping", + yystos[yystate], yyvsp, context); + YYPOPSTACK (1); + yystate = *yyssp; + YY_STACK_PRINT (yyss, yyssp); + } + + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + *++yyvsp = yylval; + YY_IGNORE_MAYBE_UNINITIALIZED_END + + + /* Shift the error token. */ + YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); + + yystate = yyn; + goto yynewstate; + + +/*-------------------------------------. +| yyacceptlab -- YYACCEPT comes here. | +`-------------------------------------*/ +yyacceptlab: + yyresult = 0; + goto yyreturn; + +/*-----------------------------------. +| yyabortlab -- YYABORT comes here. | +`-----------------------------------*/ +yyabortlab: + yyresult = 1; + goto yyreturn; + +#if !defined yyoverflow || YYERROR_VERBOSE +/*-------------------------------------------------. +| yyexhaustedlab -- memory exhaustion comes here. | +`-------------------------------------------------*/ +yyexhaustedlab: + yyerror (context, YY_("memory exhausted")); + yyresult = 2; + /* Fall through. */ +#endif + +yyreturn: + if (yychar != YYEMPTY) + { + /* Make sure we have latest lookahead translation. See comments at + user semantic actions for why this is necessary. */ + yytoken = YYTRANSLATE (yychar); + yydestruct ("Cleanup: discarding lookahead", + yytoken, &yylval, context); + } + /* Do not reclaim the symbols of the rule whose action triggered + this YYABORT or YYACCEPT. */ + YYPOPSTACK (yylen); + YY_STACK_PRINT (yyss, yyssp); + while (yyssp != yyss) + { + yydestruct ("Cleanup: popping", + yystos[*yyssp], yyvsp, context); + YYPOPSTACK (1); + } +#ifndef yyoverflow + if (yyss != yyssa) + YYSTACK_FREE (yyss); +#endif +#if YYERROR_VERBOSE + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); +#endif + return yyresult; +} +#line 146 "json.y" /* yacc.c:1906 */ + +/* * ** *** ***** ******** ************* ********************* +** User definitions + */ + +void +jsonparse (struct context* context) +{ + yyparse (context); +} + +#define HAVE(n) (context->remaining >= n) + +#define DRAIN(n) context->text += n, context->remaining -= n + +#define STORESTRINGSEGMENT() \ + if (initialized) { \ + if (context->text != bp) { \ + Tcl_AppendToObj(context->obj, \ + bp, context->text - bp); \ + } \ + } else { \ + context->obj = Tcl_NewStringObj( \ + bp, context->text - bp); \ + initialized = 1; \ + } + +void +jsonskip(struct context *context) +{ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } +} + +static int +jsonlexp(YYSTYPE *lvalp, struct context *context) +{ + const char *bp = NULL; + + /* Question: Why not plain numbers 1,2 for the states + * but these specific hex patterns ? + */ + enum { + PLAIN = 0x0000ff00, + INSTR = 0x00ff0000 + } lstate; + double d; + char *end; + const char *p; + int initialized = 0; + + /* + * Do not auto-lex beyond a full json structure. + */ + if (context->result == TCL_OK) { + TOKEN ("<>"); + return 0; + } + + /* + * Quickly skip and ignore whitespace. + */ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } + + /* + * Handle the token following the whitespace. Small state machine to + * handle strings and escapes in them, and bare words (various + * contants, and numbers). + */ + for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { + if (lstate == INSTR) { + if (*context->text == '"') { + /* + * End of quoted string + */ + + STORESTRINGSEGMENT(); + DRAIN(1); + TOKEN1 ("STRING"); + return STRING; + } + + if (*context->text == '\\') { + /* + * Escaped sequence. The 9 sequences specified at json.org + * are: + * \" \\ \/ \b \f \n \r \t \uXXXX + */ + char buf[TCL_UTF_MAX]; + int len, consumed; + + STORESTRINGSEGMENT(); + + /* + * Perform additional checks to restrict the set of accepted + * escape sequence to what is allowed by json.org instead of + * Tcl_UtfBackslash. + */ + + if (!HAVE(1)) { + Tcl_AppendToObj(context->obj, "\\", 1); + yyerror(context,"incomplete escape at < error"); + TOKEN("incomplete escape at <> error"); + return -1; + } + switch (context->text[1]) { + case '"': + case '\\': + case '/': + case 'b': + case 'f': + case 'n': + case 'r': + case 't': + break; + case 'u': + if (!HAVE(5)) { + Tcl_AppendToObj(context->obj, "\\u", 2); + yyerror(context,"incomplete escape at < error"); + TOKEN("incomplete escape at <> error"); + return -1; + } + break; + default: + Tcl_AppendToObj(context->obj, context->text + 1, 1); + yyerror(context,"bad escape"); + TOKEN("bad escape"); + return -1; + } + + /* + * XXX Tcl_UtfBackslash() may be more + * XXX permissive, than JSON standard. + * XXX But that may be a good thing: + * XXX "be generous in what you accept". + */ + len = Tcl_UtfBackslash(context->text, + &consumed, buf); + DRAIN(consumed - 1); + bp = context->text + 1; + Tcl_AppendToObj(context->obj, buf, len); + } + continue; + } + + switch (*context->text) { + case ',': + case '{': + case ':': + case '}': + case '[': + case ']': + DRAIN(1); + TOKEN (context->text[-1]); + return context->text[-1]; + case 't': + if ((context->remaining < 4) || + strncmp("rue", context->text + 1, 3)) + goto bareword; + DRAIN(4); + context->obj = TRUE_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case 'f': + if ((context->remaining < 5) || + strncmp("alse", context->text + 1, 4)) + goto bareword; + DRAIN(5); + context->obj = FALSE_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case 'n': + if ((context->remaining < 4) || + strncmp("ull", context->text + 1, 3)) + goto bareword; + DRAIN(4); + context->obj = NULL_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case '"': + bp = context->text + 1; + lstate = INSTR; + continue; + case '\\': + yyerror(context,"Escape character outside of string"); + TOKEN ("escape error"); + return -1; + } + + /* + * We already considered the null, true, and false + * above, so it can only be a number now. + * + * NOTE: At this point we do not care about double + * versus integer, nor about the possible integer + * range. We generate a plain string Tcl_Obj and leave + * it to the user of the generated structure to + * convert to a number when actually needed. This + * defered conversion also ensures that the Tcl and + * platform we are building against does not matter + * regarding integer range, only the abilities of the + * Tcl at runtime. + */ + + d = strtod(context->text, &end); + if (end == context->text) + goto bareword; /* Nothing parsed */ + + context->obj = Tcl_NewStringObj (context->text, + end - context->text); + + context->remaining -= (end - context->text); + context->text = end; + TOKEN1 ("CONSTANT"); + return CONSTANT; + } + + TOKEN ("<>"); + return 0; + bareword: + yyerror(context,"Bare word encountered"); + TOKEN ("bare word error"); + return -1; +} + +#if 0 +int +jsonlex(struct context *context) +{ + const char *bp = NULL; + + /* Question: Why not plain numbers 1,2 for the states + * but these specific hex patterns ? + */ + enum { + PLAIN = 0x0000ff00, + INSTR = 0x00ff0000 + } lstate; + double d; + char *end; + const char *p; + int initialized = 0; + + while (context->remaining) { + /* Iterate over the whole string and check all tokens. + * Nothing else. + */ + + /* + * Quickly skip and ignore whitespace. + */ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } + + /* + * Handle the token following the whitespace. Small state machine to + * handle strings and escapes in them, and bare words (various + * contants, and numbers). + */ + for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { + if (lstate == INSTR) { + if (*context->text == '"') { + /* + * End of quoted string + */ + DRAIN(1); + goto next_token; + } + + if (*context->text == '\\') { + /* + * Escaped sequence + */ + char buf[TCL_UTF_MAX]; + int len, consumed; + + /* + * XXX Tcl_UtfBackslash() may be more + * XXX permissive, than JSON standard. + * XXX But that may be a good thing: + * XXX "be generous in what you accept". + */ + len = Tcl_UtfBackslash(context->text, &consumed, buf); + DRAIN(consumed - 1); + } + continue; + } + + switch (*context->text) { + case ',': + case '{': + case ':': + case '}': + case '[': + case ']': + DRAIN(1); + goto next_token; + + case 't': + if ((context->remaining < 4) || + strncmp("rue", context->text + 1, 3)) + return -1; /* bare word */ + DRAIN(4); + goto next_token; + case 'f': + if ((context->remaining < 5) || + strncmp("alse", context->text + 1, 4)) + return -1; /* bare word */ + DRAIN(5); + goto next_token; + case 'n': + if ((context->remaining < 4) || + strncmp("ull", context->text + 1, 3)) + return -1; /* bare word */ + DRAIN(4); + goto next_token; + case '"': + bp = context->text + 1; + lstate = INSTR; + continue; + case '\\': + /* Escape outside string, abort. */ + return -1; + } + + /* + * We already considered the null, true, and false + * above, so it can only be a number now. + * + * NOTE: At this point we do not care about double + * versus integer, nor about the possible integer + * range. We generate a plain string Tcl_Obj and leave + * it to the user of the generated structure to + * convert to a number when actually needed. This + * defered conversion also ensures that the Tcl and + * platform we are building against does not matter + * regarding integer range, only the abilities of the + * Tcl at runtime. + */ + + d = strtod(context->text, &end); + if (end == context->text) + return -1; /* bare word */ + + context->remaining -= (end - context->text); + context->text = end; + goto next_token; + } + + return 0; + + next_token: + continue; + } +} +#endif + +static void +jsonerror(struct context *context, const char *message) +{ + char *fullmessage; + char *yytext; + int yyleng; + + if (context->has_error) return; + + if (context->obj) { + yytext = Tcl_GetStringFromObj(context->obj, &yyleng); + fullmessage = Tcl_Alloc(strlen(message) + 63 + yyleng); + + sprintf(fullmessage, "%s %d bytes before end, around ``%.*s''", + message, context->remaining, yyleng, yytext); + } else { + fullmessage = Tcl_Alloc(strlen(message) + 63); + + sprintf(fullmessage, "%s %d bytes before end", + message, context->remaining); + } + + TRACE ((">>> %s\n",fullmessage)); + Tcl_SetResult (context->I, fullmessage, TCL_DYNAMIC); + Tcl_SetErrorCode (context->I, "JSON", "SYNTAX", NULL); + context->has_error = 1; +} diff --git a/cpp_to_py/common/lib/sdc/json/c/json.y b/cpp_to_py/common/lib/sdc/json/c/json.y new file mode 100755 index 0000000..9902bfd --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/c/json.y @@ -0,0 +1,557 @@ +/* + * JSON parser, yacc/bison based. Manual lexer. + * Mikhail. + */ + +%define api.pure full + +%{ +/* * ** *** ***** ******** ************* ********************* */ +#include +#include +#include +#include +#include +#include + +#include + +#define TOKEN(tok) TRACE (("TOKEN %s\n", tok)) +#define TOKEN1(tok) TRACE (("TOKEN %s (%s)\n", tok, Tcl_GetString(context->obj))) +#define REDUCE(rule) TRACE (("REDUCE %s\n", rule)) + +#define TRUE_O (Tcl_NewStringObj("true", 4)) +#define FALSE_O (Tcl_NewStringObj("false", 5)) +#define NULL_O (Tcl_NewStringObj("null", 4)) + +typedef union YYSTYPE YYSTYPE; + +static void jsonerror (struct context *, const char *); +static int jsonlexp (YYSTYPE *lvalp, struct context *context); + +#define yylex jsonlexp +#define yyerror jsonerror + +/* * ** *** ***** ******** ************* ********************* +** User declarations + */ +%} + +%union { + Tcl_Obj *obj; + struct { + Tcl_Obj *key; + Tcl_Obj *val; + } keyval; +}; + +%lex-param {struct context* context} +%parse-param {struct context* context} + +%token STRING CONSTANT + +%type tree +%type json +%type object +%type list +%type values +%type members +%type value +%type string +%type member + +%% + +tree : json + { + REDUCE("TREE"); + if (context->I) { + Tcl_SetObjResult(context->I, $1); + TRACE ((" RESULT (%s)\n", Tcl_GetString($1))); + } + context->result = TCL_OK; + } + ; + +json : value + ; + +object : '{' members '}' + { + $$ = $2; + } + | '{' '}' + { + $$ = Tcl_NewObj(); + } + ; + +list : '[' values ']' + { + $$ = $2; + } + | '[' ']' + { + $$ = Tcl_NewObj(); + } + ; + +values : value + { + $$ = Tcl_NewListObj(1, &$1); + } + | values ',' value + { + Tcl_ListObjAppendElement(NULL, $1, $3); + $$ = $1; + } + ; + +members : member + { + $$ = Tcl_NewListObj(0, NULL); + Tcl_ListObjAppendElement(NULL, $$, $1.key); + Tcl_ListObjAppendElement(NULL, $$, $1.val); + } + | members ',' member + { + Tcl_ListObjAppendElement(NULL, $1, $3.key); + Tcl_ListObjAppendElement(NULL, $1, $3.val); + $$ = $1; + } + ; + +member : string ':' value + { + $$.key = $1; + $$.val = $3; + } + ; + +string : STRING + { + $$ = context->obj; + } + ; + +value : CONSTANT + { + $$ = context->obj; + } + | string + | object + | list + ; + +%% +/* * ** *** ***** ******** ************* ********************* +** User definitions + */ + +void +jsonparse (struct context* context) +{ + yyparse (context); +} + +#define HAVE(n) (context->remaining >= n) + +#define DRAIN(n) context->text += n, context->remaining -= n + +#define STORESTRINGSEGMENT() \ + if (initialized) { \ + if (context->text != bp) { \ + Tcl_AppendToObj(context->obj, \ + bp, context->text - bp); \ + } \ + } else { \ + context->obj = Tcl_NewStringObj( \ + bp, context->text - bp); \ + initialized = 1; \ + } + +void +jsonskip(struct context *context) +{ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } +} + +static int +jsonlexp(YYSTYPE *lvalp, struct context *context) +{ + const char *bp = NULL; + + /* Question: Why not plain numbers 1,2 for the states + * but these specific hex patterns ? + */ + enum { + PLAIN = 0x0000ff00, + INSTR = 0x00ff0000 + } lstate; + double d; + char *end; + const char *p; + int initialized = 0; + + /* + * Do not auto-lex beyond a full json structure. + */ + if (context->result == TCL_OK) { + TOKEN ("<>"); + return 0; + } + + /* + * Quickly skip and ignore whitespace. + */ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } + + /* + * Handle the token following the whitespace. Small state machine to + * handle strings and escapes in them, and bare words (various + * contants, and numbers). + */ + for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { + if (lstate == INSTR) { + if (*context->text == '"') { + /* + * End of quoted string + */ + + STORESTRINGSEGMENT(); + DRAIN(1); + TOKEN1 ("STRING"); + return STRING; + } + + if (*context->text == '\\') { + /* + * Escaped sequence. The 9 sequences specified at json.org + * are: + * \" \\ \/ \b \f \n \r \t \uXXXX + */ + char buf[TCL_UTF_MAX]; + int len, consumed; + + STORESTRINGSEGMENT(); + + /* + * Perform additional checks to restrict the set of accepted + * escape sequence to what is allowed by json.org instead of + * Tcl_UtfBackslash. + */ + + if (!HAVE(1)) { + Tcl_AppendToObj(context->obj, "\\", 1); + yyerror(context,"incomplete escape at < error"); + TOKEN("incomplete escape at <> error"); + return -1; + } + switch (context->text[1]) { + case '"': + case '\\': + case '/': + case 'b': + case 'f': + case 'n': + case 'r': + case 't': + break; + case 'u': + if (!HAVE(5)) { + Tcl_AppendToObj(context->obj, "\\u", 2); + yyerror(context,"incomplete escape at < error"); + TOKEN("incomplete escape at <> error"); + return -1; + } + break; + default: + Tcl_AppendToObj(context->obj, context->text + 1, 1); + yyerror(context,"bad escape"); + TOKEN("bad escape"); + return -1; + } + + /* + * XXX Tcl_UtfBackslash() may be more + * XXX permissive, than JSON standard. + * XXX But that may be a good thing: + * XXX "be generous in what you accept". + */ + len = Tcl_UtfBackslash(context->text, + &consumed, buf); + DRAIN(consumed - 1); + bp = context->text + 1; + Tcl_AppendToObj(context->obj, buf, len); + } + continue; + } + + switch (*context->text) { + case ',': + case '{': + case ':': + case '}': + case '[': + case ']': + DRAIN(1); + TOKEN (context->text[-1]); + return context->text[-1]; + case 't': + if ((context->remaining < 4) || + strncmp("rue", context->text + 1, 3)) + goto bareword; + DRAIN(4); + context->obj = TRUE_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case 'f': + if ((context->remaining < 5) || + strncmp("alse", context->text + 1, 4)) + goto bareword; + DRAIN(5); + context->obj = FALSE_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case 'n': + if ((context->remaining < 4) || + strncmp("ull", context->text + 1, 3)) + goto bareword; + DRAIN(4); + context->obj = NULL_O; + TOKEN1 ("CONSTANT"); + return CONSTANT; + case '"': + bp = context->text + 1; + lstate = INSTR; + continue; + case '\\': + yyerror(context,"Escape character outside of string"); + TOKEN ("escape error"); + return -1; + } + + /* + * We already considered the null, true, and false + * above, so it can only be a number now. + * + * NOTE: At this point we do not care about double + * versus integer, nor about the possible integer + * range. We generate a plain string Tcl_Obj and leave + * it to the user of the generated structure to + * convert to a number when actually needed. This + * defered conversion also ensures that the Tcl and + * platform we are building against does not matter + * regarding integer range, only the abilities of the + * Tcl at runtime. + */ + + d = strtod(context->text, &end); + if (end == context->text) + goto bareword; /* Nothing parsed */ + + context->obj = Tcl_NewStringObj (context->text, + end - context->text); + + context->remaining -= (end - context->text); + context->text = end; + TOKEN1 ("CONSTANT"); + return CONSTANT; + } + + TOKEN ("<>"); + return 0; + bareword: + yyerror(context,"Bare word encountered"); + TOKEN ("bare word error"); + return -1; +} + +#if 0 +int +jsonlex(struct context *context) +{ + const char *bp = NULL; + + /* Question: Why not plain numbers 1,2 for the states + * but these specific hex patterns ? + */ + enum { + PLAIN = 0x0000ff00, + INSTR = 0x00ff0000 + } lstate; + double d; + char *end; + const char *p; + int initialized = 0; + + while (context->remaining) { + /* Iterate over the whole string and check all tokens. + * Nothing else. + */ + + /* + * Quickly skip and ignore whitespace. + */ + while (context->remaining) { + switch (*context->text) { + case '\n': + case ' ': + case '\t': + case '\r': + DRAIN(1); + continue; + } + break; + } + + /* + * Handle the token following the whitespace. Small state machine to + * handle strings and escapes in them, and bare words (various + * contants, and numbers). + */ + for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { + if (lstate == INSTR) { + if (*context->text == '"') { + /* + * End of quoted string + */ + DRAIN(1); + goto next_token; + } + + if (*context->text == '\\') { + /* + * Escaped sequence + */ + char buf[TCL_UTF_MAX]; + int len, consumed; + + /* + * XXX Tcl_UtfBackslash() may be more + * XXX permissive, than JSON standard. + * XXX But that may be a good thing: + * XXX "be generous in what you accept". + */ + len = Tcl_UtfBackslash(context->text, &consumed, buf); + DRAIN(consumed - 1); + } + continue; + } + + switch (*context->text) { + case ',': + case '{': + case ':': + case '}': + case '[': + case ']': + DRAIN(1); + goto next_token; + + case 't': + if ((context->remaining < 4) || + strncmp("rue", context->text + 1, 3)) + return -1; /* bare word */ + DRAIN(4); + goto next_token; + case 'f': + if ((context->remaining < 5) || + strncmp("alse", context->text + 1, 4)) + return -1; /* bare word */ + DRAIN(5); + goto next_token; + case 'n': + if ((context->remaining < 4) || + strncmp("ull", context->text + 1, 3)) + return -1; /* bare word */ + DRAIN(4); + goto next_token; + case '"': + bp = context->text + 1; + lstate = INSTR; + continue; + case '\\': + /* Escape outside string, abort. */ + return -1; + } + + /* + * We already considered the null, true, and false + * above, so it can only be a number now. + * + * NOTE: At this point we do not care about double + * versus integer, nor about the possible integer + * range. We generate a plain string Tcl_Obj and leave + * it to the user of the generated structure to + * convert to a number when actually needed. This + * defered conversion also ensures that the Tcl and + * platform we are building against does not matter + * regarding integer range, only the abilities of the + * Tcl at runtime. + */ + + d = strtod(context->text, &end); + if (end == context->text) + return -1; /* bare word */ + + context->remaining -= (end - context->text); + context->text = end; + goto next_token; + } + + return 0; + + next_token: + continue; + } +} +#endif + +static void +jsonerror(struct context *context, const char *message) +{ + char *fullmessage; + char *yytext; + int yyleng; + + if (context->has_error) return; + + if (context->obj) { + yytext = Tcl_GetStringFromObj(context->obj, &yyleng); + fullmessage = Tcl_Alloc(strlen(message) + 63 + yyleng); + + sprintf(fullmessage, "%s %d bytes before end, around ``%.*s''", + message, context->remaining, yyleng, yytext); + } else { + fullmessage = Tcl_Alloc(strlen(message) + 63); + + sprintf(fullmessage, "%s %d bytes before end", + message, context->remaining); + } + + TRACE ((">>> %s\n",fullmessage)); + Tcl_SetResult (context->I, fullmessage, TCL_DYNAMIC); + Tcl_SetErrorCode (context->I, "JSON", "SYNTAX", NULL); + context->has_error = 1; +} diff --git a/cpp_to_py/common/lib/sdc/json/c/json_y.h b/cpp_to_py/common/lib/sdc/json/c/json_y.h new file mode 100755 index 0000000..a8503ce --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/c/json_y.h @@ -0,0 +1,63 @@ +/* + * Data structures and declarations for yacc/bison based json parser. + * External to .y file for communication and use within the binding layer. + */ + +struct context { + /* + * General state. + */ + + Tcl_Interp *I; /* Tcl interpreter we are in. */ + int result; /* Tcl result of the parse. + ** + * NOTE: A value of TCL_OK (set when + * successfully reducing the main rule) + * causes the lexer to return <> from + * then on, preventing parsing beyond a + * single json structure. + */ + + /* + * Lexer Input. + */ + + const char *text; /* Text to parse */ + int remaining; /* Number of characters left to parse. */ + + /* + * Lexer -> Parser communication. + */ + + Tcl_Obj *obj; /* Tcl value of the last returned token. */ + int has_error; +}; + +/* + * Note: The parser function automatically sets the Tcl_Interp (See + * field "I") result to the parse result, or an error message. + */ + +extern void +jsonparse (struct context *); + +#if 0 +extern int +jsonlex(struct context *); +#endif + +extern void +jsonskip (struct context *); + +/* + * Default: Tracing off. + */ +#ifndef JSON_DEBUG +#define JSON_DEBUG 0 +#endif + +#if JSON_DEBUG +#define TRACE(x) do { printf x ; fflush (stdout); } while (0) +#else +#define TRACE(x) +#endif diff --git a/cpp_to_py/common/lib/sdc/json/json.bench b/cpp_to_py/common/lib/sdc/json/json.bench new file mode 100755 index 0000000..fb08f29 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.bench @@ -0,0 +1,167 @@ +# -*- tcl -*- +# Tcl Benchmark File +# +# This file contains a number of benchmarks for the 'json' parser +# to allow developers to monitor package performance. +# +# (c) 2013 Andreas Kupries + +# We need at least version 8.4 for the package and thus the +# benchmarks. + +if {![package vsatisfies [package present Tcl] 8.4]} { + bench_puts "Need Tcl 8.4+, found Tcl [package present Tcl]" + return +} + +# ### ### ### ######### ######### ######### ########################### +## Setting up the environment ... + +package require Tcl 8.4 + +package forget json + +set self [file join [pwd] [file dirname [info script]]] +set mod [file dirname $self] +set index [file join [file dirname $self] tcllibc pkgIndex.tcl] + +if 1 { + if {[file exists $index]} { + set ::dir [file dirname $index] + uplevel #0 [list source $index] + unset ::dir + package require tcllibc + } +} + +source [file join $self json.tcl] + +# ### ### ### ######### ######### ######### ########################### +## Helpers + +proc cat {f} { + set c [open $f] + set d [read $c] + close $c + return $d +} + +proc iota {n} { + set r {} + while {$n > 0} { + lappend r [json::string2json $n] + incr n -1 + } + return $r +} + +proc iota-dict {n} { + set r {} + while {$n > 0} { + lappend r f$n [json::string2json $n] + incr n -1 + } + return $r +} + +# ### ### ### ######### ######### ######### ########################### +## Get all the possible implementations + +json::SwitchTo {} +foreach e [json::KnownImplementations] { + ::json::LoadAccelerator $e +} + +# ### ### ### ######### ######### ######### ########################### +## Benchmarks. +## Just the parser, on the valid inputs for the testsuite. + +foreach impl [json::Implementations] { + json::SwitchTo $impl + + if {$impl eq "tcl"} { + set series {0 1 10 100 1000} + } else { + set series {0 1 10 100 1000} + } + + bench_puts "=== === === === === ===" + bench_puts "=== === === $impl ===" + bench_puts "=== === === === === ===" + + bench_puts {=== test-data =========} + + foreach f [glob -nocomplain -directory $self/tests *.json] { + set in [cat $f] + + bench -desc "parse [file rootname [file tail $f]] ($impl)" -body { + json::json2dict $in + } + + bench -desc "validate [file rootname [file tail $f]] ($impl)" -body { + json::validate $in + } + } + + foreach f [glob -nocomplain -directory $self/tests *.bench] { + set in [cat $f] + + bench -desc "parse [file rootname [file tail $f]] ($impl)" -body { + json::json2dict $in + } + + bench -desc "validate [file rootname [file tail $f]] ($impl)" -body { + json::validate $in + } + } + + bench_puts {=== synthetic array =========} + + foreach n $series { + set in [json::list2json [iota $n]] + + bench -desc "parse array-$n ($impl)" -body { + json::json2dict $in + } + + bench -desc "validate array-$n ($impl)" -body { + json::validate $in + } + } + + bench_puts {=== synthetic object =========} + + foreach n $series { + set in [json::dict2json [iota-dict $n]] + + bench -desc "parse object-$n ($impl)" -body { + json::json2dict $in + } + + bench -desc "validate object-$n ($impl)" -body { + json::validate $in + } + } + + bench_puts {=== synthetic string =========} + + foreach n $series { + set in [json::string2json [string repeat . $n]] + + bench -desc "parse string-$n ($impl)" -body { + json::json2dict $in + } + + bench -desc "validate string-$n ($impl)" -body { + json::validate $in + } + } +} + +# ### ### ### ######### ######### ######### ########################### +## Complete + +return + +# ### ### ### ######### ######### ######### ########################### +## Notes ... diff --git a/cpp_to_py/common/lib/sdc/json/json.man b/cpp_to_py/common/lib/sdc/json/json.man new file mode 100755 index 0000000..29d5249 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.man @@ -0,0 +1,114 @@ +[comment {-*- tcl -*- doctools manpage}] +[vset VERSION 1.3.4] +[manpage_begin json n [vset VERSION]] +[keywords {data exchange}] +[keywords {exchange format}] +[keywords javascript] +[keywords json] +[copyright {2006 ActiveState Software Inc.}] +[copyright {2009 Thomas Maeder, Glue Software Engineering AG}] +[moddesc {JSON}] +[titledesc {JSON parser}] +[category {CGI programming}] +[require Tcl 8.4] +[require json [opt [vset VERSION]]] +[description] +[para] + +The [package json] package provides a simple Tcl-only library for parsing the +JSON [uri http://www.json.org/] data exchange format as specified in RFC 4627 +[uri http://www.ietf.org/rfc/rfc4627.txt]. + +There is some ambiguity in parsing JSON because JSON has type information that +is not maintained by the Tcl conversion. The [package json] package returns +data as a Tcl [cmd dict]. Either the [package dict] package or Tcl 8.5 is +required for use. + +[section COMMANDS] + +[list_begin definitions] + +[call [cmd ::json::json2dict] [arg txt]] + +Parse JSON formatted text [arg txt] into a Tcl dict and return +the value. + +[para] If [arg txt] contains more than one JSON entity only the +first one is returned. + + +[call [cmd ::json::many-json2dict] [arg txt] [opt [arg max]]] + +Parse JSON formatted text [arg txt] containing multiple JSON entities +into a list of dictionaries and return that list. + +[para] If [arg max] is specified exactly that many entities are extracted +from [arg txt]. By default the command will attempt to extract all, without +limits. A value of "[arg max] == 0" does not make sense and will cause the +command to throw an error. + +[list_end] +[para] + +[section EXAMPLES] +[para] + +An example of a JSON array converted to Tcl. A JSON array is returned as a +single item with multiple elements. + +[para] +[example {[ + { + "precision": "zip", + "Latitude": 37.7668, + "Longitude": -122.3959, + "Address": "", + "City": "SAN FRANCISCO", + "State": "CA", + "Zip": "94107", + "Country": "US" + }, + { + "precision": "zip", + "Latitude": 37.371991, + "Longitude": -122.026020, + "Address": "", + "City": "SUNNYVALE", + "State": "CA", + "Zip": "94085", + "Country": "US" + } +] +=> +{Country US Latitude 37.7668 precision zip State CA City {SAN FRANCISCO} Address {} Zip 94107 Longitude -122.3959} {Country US Latitude 37.371991 precision zip State CA City SUNNYVALE Address {} Zip 94085 Longitude -122.026020} +}] +[para] + +An example of a JSON object converted to Tcl. A JSON object is returned as a +multi-element list (a dict). + +[para] +[example {{ + "Image": { + "Width": 800, + "Height": 600, + "Title": "View from 15th Floor", + "Thumbnail": { + "Url": "http://www.example.com/image/481989943", + "Height": 125, + "Width": "100" + }, + "IDs": [116, 943, 234, 38793] + } +} +=> +Image {IDs {116 943 234 38793} Thumbnail {Width 100 Height 125 Url http://www.example.com/image/481989943} Width 800 Height 600 Title {View from 15th Floor}} +}] + +[section RELATED] + +To write json, instead of parsing it, see package [package json::write]. + +[vset CATEGORY json] +[include ../doctools2base/include/feedback.inc] +[manpage_end] diff --git a/cpp_to_py/common/lib/sdc/json/json.pcx b/cpp_to_py/common/lib/sdc/json/json.pcx new file mode 100755 index 0000000..e44b8b5 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.pcx @@ -0,0 +1,32 @@ +# -*- tcl -*- json.pcx +# Syntax of the commands provided by package json. +# +# For use by TclDevKit's static syntax checker (v4.1+). +# See http://www.activestate.com/solutions/tcl/ +# See http://aspn.activestate.com/ASPN/docs/Tcl_Dev_Kit/4.0/Checker.html#pcx_api +# for the specification of the format of the code in this file. +# + +package require pcx +pcx::register json +pcx::tcldep 1.0 needs tcl 8.4 +pcx::tcldep 1.2 needs tcl 8.4 + +namespace eval ::json {} + +#pcx::message FOO {... text ...} type +#pcx::scan + +pcx::check 1.0 std ::json::json2dict \ + {checkSimpleArgs 1 1 { + checkWord + }} + +pcx::check 1.2 std ::json::many-json2dict \ + {checkSimpleArgs 1 2 { + checkWord checkInt + }} + +# Initialization via pcx::init. +# Use a ::json::init procedure for non-standard initialization. +pcx::complete diff --git a/cpp_to_py/common/lib/sdc/json/json.tcl b/cpp_to_py/common/lib/sdc/json/json.tcl new file mode 100755 index 0000000..773c6a8 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.tcl @@ -0,0 +1,285 @@ +# json.tcl -- +# +# JSON parser for Tcl. Management code, Tcl/C detection and selection. +# +# Copyright (c) 2013 by Andreas Kupries + +# @mdgen EXCLUDE: jsonc.tcl + +package require Tcl 8.4 +namespace eval ::json {} + +# ### ### ### ######### ######### ######### +## Management of json implementations. + +# ::json::LoadAccelerator -- +# +# Loads a named implementation, if possible. +# +# Arguments: +# key Name of the implementation to load. +# +# Results: +# A boolean flag. True if the implementation +# was successfully loaded; and False otherwise. + +proc ::json::LoadAccelerator {key} { + variable accel + set r 0 + switch -exact -- $key { + critcl { + # Critcl implementation of json requires Tcl 8.4. + if {![package vsatisfies [package provide Tcl] 8.4]} {return 0} + if {[catch {package require tcllibc}]} {return 0} + # Check for the jsonc 1.1.1 API we are fixing later. + set r [llength [info commands ::json::many_json2dict_critcl]] + } + tcl { + variable selfdir + source [file join $selfdir json_tcl.tcl] + set r 1 + } + default { + return -code error "invalid accelerator/impl. package $key:\ + must be one of [join [KnownImplementations] {, }]" + } + } + set accel($key) $r + return $r +} + +# ::json::SwitchTo -- +# +# Activates a loaded named implementation. +# +# Arguments: +# key Name of the implementation to activate. +# +# Results: +# None. + +proc ::json::SwitchTo {key} { + variable accel + variable loaded + variable apicmds + + if {[string equal $key $loaded]} { + # No change, nothing to do. + return + } elseif {![string equal $key ""]} { + # Validate the target implementation of the switch. + + if {![info exists accel($key)]} { + return -code error "Unable to activate unknown implementation \"$key\"" + } elseif {![info exists accel($key)] || !$accel($key)} { + return -code error "Unable to activate missing implementation \"$key\"" + } + } + + # Deactivate the previous implementation, if there was any. + + if {![string equal $loaded ""]} { + foreach c $apicmds { + rename ::json::${c} ::json::${c}_$loaded + } + } + + # Activate the new implementation, if there is any. + + if {![string equal $key ""]} { + foreach c $apicmds { + rename ::json::${c}_$key ::json::${c} + } + } + + # Remember the active implementation, for deactivation by future + # switches. + + set loaded $key + return +} + +# ::json::Implementations -- +# +# Determines which implementations are +# present, i.e. loaded. +# +# Arguments: +# None. +# +# Results: +# A list of implementation keys. + +proc ::json::Implementations {} { + variable accel + set res {} + foreach n [array names accel] { + if {!$accel($n)} continue + lappend res $n + } + return $res +} + +# ::json::KnownImplementations -- +# +# Determines which implementations are known +# as possible implementations. +# +# Arguments: +# None. +# +# Results: +# A list of implementation keys. In the order +# of preference, most prefered first. + +proc ::json::KnownImplementations {} { + return {critcl tcl} +} + +proc ::json::Names {} { + return { + critcl {tcllibc based} + tcl {pure Tcl} + } +} + +# ### ### ### ######### ######### ######### +## Initialization: Data structures. + +namespace eval ::json { + variable selfdir [file dirname [info script]] + variable accel + array set accel {tcl 0 critcl 0} + variable loaded {} + + variable apicmds { + json2dict + many-json2dict + } +} + +# ### ### ### ######### ######### ######### +## Wrapper fix for the jsonc package to match APIs. + +proc ::json::many-json2dict_critcl {args} { + eval [linsert $args 0 ::json::many_json2dict_critcl] +} + +# ### ### ### ######### ######### ######### +## Initialization: Choose an implementation, +## most prefered first. Loads only one of the +## possible implementations. And activates it. + +namespace eval ::json { + variable e + foreach e [KnownImplementations] { + if {[LoadAccelerator $e]} { + SwitchTo $e + break + } + } + unset e +} + +# ### ### ### ######### ######### ######### +## Tcl implementation of validation, shared for Tcl and C implementation. +## +## The regexp based validation is consistently faster than json-c. +## Suspected reasons: Tcl REs are mainly in C as well, and json-c has +## overhead in constructing its own data structures. While irrelevant +## to validation json-c still builds them, it has no mode doing pure +## syntax checking. + +namespace eval ::json { + # Regular expression for tokenizing a JSON text (cf. http://json.org/) + + # tokens consisting of a single character + variable singleCharTokens { "{" "}" ":" "\\[" "\\]" "," } + variable singleCharTokenRE "\[[join $singleCharTokens {}]\]" + + # quoted string tokens + variable escapableREs { "[\\\"\\\\/bfnrt]" "u[[:xdigit:]]{4}" "." } + variable escapedCharRE "\\\\(?:[join $escapableREs |])" + variable unescapedCharRE {[^\\\"]} + variable stringRE "\"(?:$escapedCharRE|$unescapedCharRE)*\"" + + # as above, for validation + variable escapableREsv { "[\\\"\\\\/bfnrt]" "u[[:xdigit:]]{4}" } + variable escapedCharREv "\\\\(?:[join $escapableREsv |])" + variable stringREv "\"(?:$escapedCharREv|$unescapedCharRE)*\"" + + # (unquoted) words + variable wordTokens { "true" "false" "null" } + variable wordTokenRE [join $wordTokens "|"] + + # number tokens + # negative lookahead (?!0)[[:digit:]]+ might be more elegant, but + # would slow down tokenizing by a factor of up to 3! + variable positiveRE {[1-9][[:digit:]]*} + variable cardinalRE "-?(?:$positiveRE|0)" + variable fractionRE {[.][[:digit:]]+} + variable exponentialRE {[eE][+-]?[[:digit:]]+} + variable numberREa "${cardinalRE}(?:$fractionRE)?(?:$exponentialRE)?" + variable numberREb "${fractionRE}(?:$exponentialRE)?" + variable numberREc "${cardinalRE}\[.\](?:$exponentialRE)?" + variable numberRE "$numberREa|$numberREb|$numberREc" + variable numberRE "$numberREa|$numberREb|$numberREc" + + # JSON token, and validation + variable tokenRE "$singleCharTokenRE|$stringRE|$wordTokenRE|$numberRE" + variable tokenREv "$singleCharTokenRE|$stringREv|$wordTokenRE|$numberRE" + + # 0..n white space characters + set whiteSpaceRE {[[:space:]]*} + + # Regular expression for validating a JSON text + variable validJsonRE "^(?:${whiteSpaceRE}(?:$tokenREv))*${whiteSpaceRE}$" +} + + +# Validate JSON text +# @param jsonText JSON text +# @return 1 iff $jsonText conforms to the JSON grammar +# (@see http://json.org/) +proc ::json::validate {jsonText} { + variable validJsonRE + + return [regexp -- $validJsonRE $jsonText] +} + +# ### ### ### ######### ######### ######### +## These three procedures shared between Tcl and Critcl implementations. +## See also package "json::write". + +proc ::json::dict2json {dictVal} { + # XXX: Currently this API isn't symmetrical, as to create proper + # XXX: JSON text requires type knowledge of the input data + set json "" + set prefix "" + + foreach {key val} $dictVal { + # key must always be a string, val may be a number, string or + # bare word (true|false|null) + if {0 && ![string is double -strict $val] + && ![regexp {^(?:true|false|null)$} $val]} { + set val "\"$val\"" + } + append json "$prefix\"$key\": $val" \n + set prefix , + } + + return "\{${json}\}" +} + +proc ::json::list2json {listVal} { + return "\[[join $listVal ,]\]" +} + +proc ::json::string2json {str} { + return "\"$str\"" +} + +# ### ### ### ######### ######### ######### +## Ready + +package provide json 1.3.4 diff --git a/cpp_to_py/common/lib/sdc/json/json.test b/cpp_to_py/common/lib/sdc/json/json.test new file mode 100755 index 0000000..56c04d8 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.test @@ -0,0 +1,94 @@ +# json.test - Copyright (C) 2006 ActiveState Software Inc. +# +# Tests for the Tcllib json package +# +# ------------------------------------------------------------------------- +# See the file "license.terms" for information on usage and redistribution +# of this file, and for a DISCLAIMER OF ALL WARRANTIES. +# ------------------------------------------------------------------------- +# RCS: @(#) $Id: json.test,v 1.8 2011/11/10 21:05:58 andreas_kupries Exp $ + +# ------------------------------------------------------------------------- + +source [file join \ + [file dirname [file dirname [file join [pwd] [info script]]]] \ + devtools testutilities.tcl] + +testsNeedTcl [expr {[catch {package require dict}] ? "8.5" : "8.4"}] +testsNeedTcltest 2.0 + +support { + useLocalFile tests/support.tcl +} + +testing { + useAccel [useTcllibC] json/json.tcl json + TestAccelInit json +} + +# ------------------------------------------------------------------------- +# Tests +# ------------------------------------------------------------------------- + +TestAccelDo json impl { + switch -exact -- $impl { + critcl { + set MY myjson + + proc tmWrong {m loarg n {xarg {}}} { + return [tcltest::wrongNumArgs "myjson $m" $loarg $n] + } + + proc tmTooMany {m loarg {xarg {}}} { + return [tcltest::tooManyArgs "myjson $m" $loarg] + } + + proc tmTake {tcl c} { return $c } + } + tcl { + set MY ::myjson + + if {[package vsatisfies [package provide Tcl] 8.5]} { + proc tmWrong {m loarg n {xarg {}}} { + if {$xarg == {}} {set xarg $loarg} + if {$xarg != {}} {set xarg " $xarg"} + incr n + return [tcltest::wrongNumArgs "I $m" "name$xarg" $n] + } + + proc tmTooMany {m loarg {xarg {}}} { + if {$xarg == {}} {set xarg $loarg} + if {$xarg != {}} {set xarg " $xarg"} + return [tcltest::tooManyArgs "I $m" "name$xarg"] + } + } else { + proc tmWrong {m loarg n {xarg {}}} { + if {$xarg == {}} {set xarg $loarg} + if {$xarg != {}} {set xarg " $xarg"} + incr n + return [tcltest::wrongNumArgs "::struct::json::I::$m" "name$xarg" $n] + } + + proc tmTooMany {m loarg {xarg {}}} { + if {$xarg == {}} {set xarg $loarg} + if {$xarg != {}} {set xarg " $xarg"} + return [tcltest::tooManyArgs "::struct::json::I::$m" "name$xarg"] + } + } + + proc tmTake {tcl c} { return $tcl } + } + } + source [localPath json.testsuite] +} + +# ------------------------------------------------------------------------- +catch {unset JSON} +catch {unset TCL} +catch {unset DICTSORT} +testsuiteCleanup + +# Local Variables: +# mode: tcl +# indent-tabs-mode: nil +# End: diff --git a/cpp_to_py/common/lib/sdc/json/json.testsuite b/cpp_to_py/common/lib/sdc/json/json.testsuite new file mode 100755 index 0000000..a793451 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json.testsuite @@ -0,0 +1,102 @@ +# -*- tcl -*- +# ------------------------------------------------------------------------- +# Tests +# ------------------------------------------------------------------------- + +set i 0 +foreach name [lsort -dict [array names JSON]] { + test json-${impl}-1.[incr i] "test JSON $name" -body { + transform [json::json2dict $JSON($name)] $name + } -result [resultfor $name] +} + +set i 0 +foreach name [lsort -dict [array names JSON]] { + test json-${impl}-7.[incr i] "validate JSON $name" -body { + json::validate $JSON($name) + } -result 1 +} + +set i 0 +foreach name [lsort -dict [array names FAIL]] { + test json-${impl}-8.[incr i] "test FAIL $name" -body { + json::json2dict $FAIL($name) + } -returnCodes error -result $ERR(${name}-${impl}) +} + +set i 0 +foreach name [lsort -dict [array names FAIL]] { + test json-${impl}-9.[incr i] "validate FAIL $name" -body { + json::validate $FAIL($name) + } -result 0 +} + +# ------------------------------------------------------------------------- +# More Tests - list2json, string2json +# TODO: dict2json +# ------------------------------------------------------------------------- + +test json-${impl}-2.0 {list2json} -body { + json::list2json {{"a"} {"b"} {"c"}} +} -result {["a","b","c"]} + +test json-${impl}-2.1 {string2json} -body { + json::string2json a +} -result {"a"} + +# ------------------------------------------------------------------------- +# many-json2dict +# ------------------------------------------------------------------------- + +test json-${impl}-3.0 {many-json2dict, wrong args, not enough} -body { + json::many-json2dict +} -returnCodes error -match glob -result {wrong # args: should be "*json::many[-_]json2dict* jsonText ?max?"} + +test json-${impl}-3.1 {many-json2dict, wrong args, too many} -body { + json::many-json2dict J M X +} -returnCodes error -match glob -result {wrong # args: should be "*json::many[-_]json2dict* jsonText ?max?"} + +test json-${impl}-3.2 {many-json2dict, bad limit, zero} -body { + json::many-json2dict {[]} 0 +} -returnCodes error -result {Bad limit 0 of json entities to extract.} + +set i 0 +foreach first [lsort -dict [array names JSON]] { + foreach second [lsort -dict [array names JSON]] { + set input $JSON($first) + append input " " $JSON($second) + + set output {} + lappend output [resultfor $first] + lappend output [resultfor $second] + + test json-${impl}-4.[incr i] "many-json2dict: $first/$second, all" -body { + transform* [json::many-json2dict $input] $first $second + } -result $output + } +} + +set i 0 +foreach first [lsort -dict [array names JSON]] { + foreach second [lsort -dict [array names JSON]] { + set input $JSON($first) + append input " " $JSON($second) + + set output {} + lappend output [resultfor $first] + + test json-${impl}-5.[incr i] "many-json2dict: $first/$second, first only" -body { + transform* [json::many-json2dict $input 1] $first + } -result $output + } +} + +set i 0 +foreach first [lsort -dict [array names JSON]] { + set input $JSON($first) + test json-${impl}-6.[incr i] "many-json2dict, bad limit, 3 over 1" -body { + json::many-json2dict $input 3 + } -returnCodes error -result {Bad limit 3 of json entities to extract, found only 1.} +} + +# ------------------------------------------------------------------------- diff --git a/cpp_to_py/common/lib/sdc/json/json_tcl.tcl b/cpp_to_py/common/lib/sdc/json/json_tcl.tcl new file mode 100755 index 0000000..d1c65cb --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json_tcl.tcl @@ -0,0 +1,291 @@ +# +# JSON parser for Tcl. +# +# See http://www.json.org/ && http://www.ietf.org/rfc/rfc4627.txt +# +# Total rework of the code published with version number 1.0 by +# Thomas Maeder, Glue Software Engineering AG +# +# $Id: json.tcl,v 1.7 2011/11/10 21:05:58 andreas_kupries Exp $ +# + +if {![package vsatisfies [package provide Tcl] 8.5]} { + package require dict +} + +# Parse JSON text into a dict +# @param jsonText JSON text +# @return dict (or list) containing the object represented by $jsonText +proc ::json::json2dict_tcl {jsonText} { + variable tokenRE + + set tokens [regexp -all -inline -- $tokenRE $jsonText] + set nrTokens [llength $tokens] + set tokenCursor 0 + + #puts I:($jsonText) + #puts T:\t[join $tokens \nT:\t] + return [parseValue $tokens $nrTokens tokenCursor] +} + +# Parse multiple JSON entities in a string into a list of dictionaries +# @param jsonText JSON text to parse +# @param max Max number of entities to extract. +# @return list of (dict (or list) containing the objects) represented by $jsonText +proc ::json::many-json2dict_tcl {jsonText {max -1}} { + variable tokenRE + + if {$max == 0} { + return -code error -errorCode {JSON BAD-LIMIT ZERO} \ + "Bad limit 0 of json entities to extract." + } + + set tokens [regexp -all -inline -- $tokenRE $jsonText] + set nrTokens [llength $tokens] + set tokenCursor 0 + + set result {} + set found 0 + set n $max + while {$n != 0} { + if {$tokenCursor >= $nrTokens} break + lappend result [parseValue $tokens $nrTokens tokenCursor] + incr found + if {$n > 0} {incr n -1} + } + + if {$n > 0} { + return -code error -errorCode {JSON BAD-LIMIT TOO LARGE} \ + "Bad limit $max of json entities to extract, found only $found." + } + + return $result +} + +# Throw an exception signaling an unexpected token +proc ::json::unexpected {tokenCursor token expected} { + return -code error -errorcode [list JSON UNEXPECTED $tokenCursor $expected] \ + "unexpected token \"$token\" at position $tokenCursor; expecting $expected" +} + +# Get rid of the quotes surrounding a string token and substitute the +# real characters for escape sequences within it +# @param token +# @return unquoted unescaped value of the string contained in $token +proc ::json::unquoteUnescapeString {tokenCursor token} { + variable stringREv + set unquoted [string range $token 1 end-1] + + if {![regexp $stringREv $token]} { + unexpected $tokenCursor $token STRING + } + + set res [subst -nocommands -novariables $unquoted] + return $res +} + +# Parse an object member +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @param objectDictName name (in caller's context) of dict +# representing the JSON object of which to +# parse the next member +proc ::json::parseObjectMember {tokens nrTokens tokenCursorName objectDictName} { + upvar $tokenCursorName tokenCursor + upvar $objectDictName objectDict + + set token [lindex $tokens $tokenCursor] + set tc $tokenCursor + incr tokenCursor + + set leadingChar [string index $token 0] + if {$leadingChar eq "\""} { + set memberName [unquoteUnescapeString $tc $token] + + if {$tokenCursor == $nrTokens} { + unexpected $tokenCursor "END" "\":\"" + } else { + set token [lindex $tokens $tokenCursor] + incr tokenCursor + + if {$token eq ":"} { + set memberValue [parseValue $tokens $nrTokens tokenCursor] + dict set objectDict $memberName $memberValue + } else { + unexpected $tokenCursor $token "\":\"" + } + } + } else { + unexpected $tokenCursor $token "STRING" + } +} + +# Parse the members of an object +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @param objectDictName name (in caller's context) of dict +# representing the JSON object of which to +# parse the next member +proc ::json::parseObjectMembers {tokens nrTokens tokenCursorName objectDictName} { + upvar $tokenCursorName tokenCursor + upvar $objectDictName objectDict + + while true { + parseObjectMember $tokens $nrTokens tokenCursor objectDict + + set token [lindex $tokens $tokenCursor] + incr tokenCursor + + switch -exact $token { + "," { + # continue + } + "\}" { + break + } + default { + unexpected $tokenCursor $token "\",\"|\"\}\"" + } + } + } +} + +# Parse an object +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @return parsed object (Tcl dict) +proc ::json::parseObject {tokens nrTokens tokenCursorName} { + upvar $tokenCursorName tokenCursor + + if {$tokenCursor == $nrTokens} { + unexpected $tokenCursor "END" "OBJECT" + } else { + set result [dict create] + + set token [lindex $tokens $tokenCursor] + + if {$token eq "\}"} { + # empty object + incr tokenCursor + } else { + parseObjectMembers $tokens $nrTokens tokenCursor result + } + + return $result + } +} + +# Parse the elements of an array +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @param resultName name (in caller's context) of the list +# representing the JSON array +proc ::json::parseArrayElements {tokens nrTokens tokenCursorName resultName} { + upvar $tokenCursorName tokenCursor + upvar $resultName result + + while true { + lappend result [parseValue $tokens $nrTokens tokenCursor] + + if {$tokenCursor == $nrTokens} { + unexpected $tokenCursor "END" "\",\"|\"\]\"" + } else { + set token [lindex $tokens $tokenCursor] + incr tokenCursor + + switch -exact $token { + "," { + # continue + } + "\]" { + break + } + default { + unexpected $tokenCursor $token "\",\"|\"\]\"" + } + } + } + } +} + +# Parse an array +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @return parsed array (Tcl list) +proc ::json::parseArray {tokens nrTokens tokenCursorName} { + upvar $tokenCursorName tokenCursor + + if {$tokenCursor == $nrTokens} { + unexpected $tokenCursor "END" "ARRAY" + } else { + set result {} + + set token [lindex $tokens $tokenCursor] + + set leadingChar [string index $token 0] + if {$leadingChar eq "\]"} { + # empty array + incr tokenCursor + } else { + parseArrayElements $tokens $nrTokens tokenCursor result + } + + return $result + } +} + +# Parse a value +# @param tokens list of tokens +# @param nrTokens length of $tokens +# @param tokenCursorName name (in caller's context) of variable +# holding current position in $tokens +# @return parsed value (dict, list, string, number) +proc ::json::parseValue {tokens nrTokens tokenCursorName} { + upvar $tokenCursorName tokenCursor + + if {$tokenCursor == $nrTokens} { + unexpected $tokenCursor "END" "VALUE" + } else { + set token [lindex $tokens $tokenCursor] + set tc $tokenCursor + incr tokenCursor + + set leadingChar [string index $token 0] + switch -exact -- $leadingChar { + "\{" { + return [parseObject $tokens $nrTokens tokenCursor] + } + "\[" { + return [parseArray $tokens $nrTokens tokenCursor] + } + "\"" { + # quoted string + return [unquoteUnescapeString $tc $token] + } + "t" - + "f" - + "n" { + # bare word: true, false, null (return as is) + return $token + } + default { + # number? + if {[string is double -strict $token]} { + return $token + } else { + unexpected $tokenCursor $token "VALUE" + } + } + } + } +} diff --git a/cpp_to_py/common/lib/sdc/json/json_write.man b/cpp_to_py/common/lib/sdc/json/json_write.man new file mode 100755 index 0000000..c644c82 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json_write.man @@ -0,0 +1,92 @@ +[comment {-*- tcl -*- doctools manpage}] +[vset PACKAGE_VERSION 1.0.3] +[manpage_begin json::write n [vset PACKAGE_VERSION]] +[keywords {data exchange}] +[keywords {exchange format}] +[keywords javascript] +[keywords json] +[copyright {2009-2013 Andreas Kupries }] +[moddesc {JSON}] +[titledesc {JSON generation}] +[category {CGI programming}] +[require Tcl 8.5] +[require json::write [opt [vset PACKAGE_VERSION]]] +[description] +[para] + +The [package json::write] package provides a simple Tcl-only library +for generation of text in the JSON [uri http://www.json.org/] data +exchange format as specified in +RFC 4627 [uri http://www.ietf.org/rfc/rfc4627.txt]. + +[section COMMANDS] + +[list_begin definitions] + +[call [cmd ::json::write] [method indented]] + +This method returns the current state of the indentation setting. + +[call [cmd ::json::write] [method indented] [arg flag]] + +This and the method [method aligned] configure the layout of the JSON +generated by the package. + +[para] + +If this [arg flag] is set (default) the package will break the +generated JSON code across lines and indent it according to its inner +structure, with each key of an object on a separate line. + +[para] + +If this flag is not set, the whole JSON object will be written on a +single line, with minimum spacing between all elements. + +[call [cmd ::json::write] [method aligned]] + +This method returns the current state of the alignment setting. + +[call [cmd ::json::write] [method aligned] [arg flag]] + +This and the method [method indented] configure the layout of the JSON +generated by the package. + +[para] + +If this [arg flag] is set (default) the package ensures that the +values for the keys in an object are vertically aligned with each +other, for a nice table effect. To make this work this also implies +that [var indented] is set as well. + +[para] + +If this flag is not set, the output is formatted as per the value of +[var indented], without trying to align the values for object keys. + +[call [cmd ::json::write] [method string] [arg s]] + +This method takes the string [arg s] and returns it properly quoted +for JSON as its result. + +[call [cmd ::json::write] [method array] [arg arg]...] + +This method takes a series of JSON formatted arguments and returns +them as a properly formatted JSON array as its result. + +[call [cmd ::json::write] [method object] [arg key] [arg value]...] + +This method takes a series of key/value arguments, the values already +formatted for JSON, and returns them as a properly formatted JSON +object as its result, with the keys formatted as JSON strings. + +[list_end] +[para] + +[section RELATED] + +To parse json, instead of writing it, see package [package json]. + +[vset CATEGORY json] +[include ../doctools2base/include/feedback.inc] +[manpage_end] diff --git a/cpp_to_py/common/lib/sdc/json/json_write.pcx b/cpp_to_py/common/lib/sdc/json/json_write.pcx new file mode 100755 index 0000000..7585bb0 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json_write.pcx @@ -0,0 +1,42 @@ +# -*- tcl -*- json_write.pcx +# Syntax of the commands provided by package json::write. +# +# For use by TclDevKit's static syntax checker (v4.1+). +# See http://www.activestate.com/solutions/tcl/ +# See http://aspn.activestate.com/ASPN/docs/Tcl_Dev_Kit/4.0/Checker.html#pcx_api +# for the specification of the format of the code in this file. +# + +package require pcx +pcx::register json::write +pcx::tcldep 1.0 needs tcl 8.5 + +namespace eval ::json::write {} + +#pcx::message FOO {... text ...} type +#pcx::scan + +pcx::check 1.0 std ::json::write {checkSimpleArgs 1 -1 { + {checkOption { + {indented {checkSimpleArgs 0 1 { + checkBoolean + }}} + {aligned {checkSimpleArgs 0 1 { + checkBoolean + }}} + {string {checkSimpleArgs 1 1 { + checkWord + }}} + {array {checkSimpleArgs 0 -1 { + checkWord + }}} + {object {checkSimpleArgsModNk 0 -1 2 0 { + checkWord + checkWord + }}} + } {}} +}} + +# Initialization via pcx::init. +# Use a ::json::write::init procedure for non-standard initialization. +pcx::complete diff --git a/cpp_to_py/common/lib/sdc/json/json_write.tcl b/cpp_to_py/common/lib/sdc/json/json_write.tcl new file mode 100755 index 0000000..c60c12e --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json_write.tcl @@ -0,0 +1,200 @@ +# json_write.tcl -- +# +# Commands for the generation of JSON (Java Script Object Notation). +# +# Copyright (c) 2009-2011 Andreas Kupries +# +# See the file "license.terms" for information on usage and redistribution +# of this file, and for a DISCLAIMER OF ALL WARRANTIES. +# +# RCS: @(#) $Id: json_write.tcl,v 1.2 2011/08/24 20:09:44 andreas_kupries Exp $ + +# ### ### ### ######### ######### ######### +## Requisites + +package require Tcl 8.5 + +namespace eval ::json::write { + namespace export \ + string array object indented aligned + + namespace ensemble create +} + +# ### ### ### ######### ######### ######### +## API. + +proc ::json::write::indented {{bool {}}} { + variable indented + + if {[llength [info level 0]] > 2} { + return -code error {wrong # args: should be "json::write indented ?bool?"} + } elseif {[llength [info level 0]] == 2} { + if {![::string is boolean -strict $bool]} { + return -code error "Expected boolean, got \"$bool\"" + } + set indented $bool + if {!$indented} { + variable aligned 0 + } + } + + return $indented +} + +proc ::json::write::aligned {{bool {}}} { + variable aligned + + if {[llength [info level 0]] > 2} { + return -code error {wrong # args: should be "json::write aligned ?bool?"} + } elseif {[llength [info level 0]] == 2} { + if {![::string is boolean -strict $bool]} { + return -code error "Expected boolean, got \"$bool\"" + } + set aligned $bool + if {$aligned} { + variable indented 1 + } + } + + return $aligned +} + +proc ::json::write::string {s} { + variable quotes + return "\"[::string map $quotes $s]\"" +} + +proc ::json::write::array {args} { + # always compact form. + return "\[[join $args ,]\]" +} + +proc ::json::write::object {args} { + # The dict in args maps string keys to json-formatted data. I.e. + # we have to quote the keys, but not the values, as the latter are + # already in the proper format. + + variable aligned + variable indented + + if {[llength $args] %2 == 1} { + return -code error {wrong # args, expected an even number of arguments} + } + + set dict {} + foreach {k v} $args { + lappend dict [string $k] $v + } + + if {$aligned} { + set max [MaxKeyLength $dict] + } + + if {$indented} { + set content {} + foreach {k v} $dict { + if {$aligned} { + set k [AlignLeft $max $k] + } + if {[::string match *\n* $v]} { + # multi-line value + lappend content " $k : [Indent $v { } 1]" + } else { + # single line value. + lappend content " $k : $v" + } + } + if {[llength $content]} { + return "\{\n[join $content ,\n]\n\}" + } else { + return "\{\}" + } + } else { + # ultra compact form. + set tmp {} + foreach {k v} $dict { + lappend tmp "$k:$v" + } + return "\{[join $tmp ,]\}" + } +} + +# ### ### ### ######### ######### ######### +## Internals. + +proc ::json::write::Indent {text prefix skip} { + set pfx "" + set result {} + foreach line [split $text \n] { + if {!$skip} { set pfx $prefix } else { incr skip -1 } + lappend result ${pfx}$line + } + return [join $result \n] +} + +proc ::json::write::MaxKeyLength {dict} { + # Find the max length of the keys in the dictionary. + + set lengths 0 ; # This will be the max if the dict is empty, and + # prevents the mathfunc from throwing errors for + # that case. + + foreach str [dict keys $dict] { + lappend lengths [::string length $str] + } + + return [tcl::mathfunc::max {*}$lengths] +} + +proc ::json::write::AlignLeft {fieldlen str} { + return [format %-${fieldlen}s $str] + #return $str[::string repeat { } [expr {$fieldlen - [::string length $str]}]] +} + +# ### ### ### ######### ######### ######### + +namespace eval ::json::write { + # Configuration of the layout to write. + + # indented = boolean. objects are indented. + # aligned = boolean. object keys are aligned vertically. + + # aligned => indented. + + # Combinations of the format specific entries + # I A | + # - - + --------------------- + # 0 0 | Ultracompact (no whitespace, single line) + # 1 0 | Indented + # 0 1 | Not possible, per the implications above. + # 1 1 | Indented + vertically aligned keys + # - - + --------------------- + + variable indented 1 + variable aligned 1 + + variable quotes \ + [list "\"" "\\\"" \\ \\\\ \b \\b \f \\f \n \\n \r \\r \t \\t \ + \x00 \\u0000 \x01 \\u0001 \x02 \\u0002 \x03 \\u0003 \ + \x04 \\u0004 \x05 \\u0005 \x06 \\u0006 \x07 \\u0007 \ + \x0b \\u000b \x0e \\u000e \x0f \\u000f \x10 \\u0010 \ + \x11 \\u0011 \x12 \\u0012 \x13 \\u0013 \x14 \\u0014 \ + \x15 \\u0015 \x16 \\u0016 \x17 \\u0017 \x18 \\u0018 \ + \x19 \\u0019 \x1a \\u001a \x1b \\u001b \x1c \\u001c \ + \x1d \\u001d \x1e \\u001e \x1f \\u001f \x7f \\u007f \ + \x80 \\u0080 \x81 \\u0081 \x82 \\u0082 \x83 \\u0083 \ + \x84 \\u0084 \x85 \\u0085 \x86 \\u0086 \x87 \\u0087 \ + \x88 \\u0088 \x89 \\u0089 \x8a \\u008a \x8b \\u008b \ + \x8c \\u008c \x8d \\u008d \x8e \\u008e \x8f \\u008f \ + \x90 \\u0090 \x91 \\u0091 \x92 \\u0092 \x93 \\u0093 \ + \x94 \\u0094 \x95 \\u0095 \x96 \\u0096 \x97 \\u0097 \ + \x98 \\u0098 \x99 \\u0099 \x9a \\u009a \x9b \\u009b \ + \x9c \\u009c \x9d \\u009d \x9e \\u009e \x9f \\u009f ] +} + +# ### ### ### ######### ######### ######### +## Ready + +package provide json::write 1.0.3 +return diff --git a/cpp_to_py/common/lib/sdc/json/json_write.test b/cpp_to_py/common/lib/sdc/json/json_write.test new file mode 100755 index 0000000..78d745a --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/json_write.test @@ -0,0 +1,218 @@ +# json_write.test - Copyright (C) 2009 Andreas Kupries +# +# Tests for the Tcllib json::write package +# +# ------------------------------------------------------------------------- +# See the file "license.terms" for information on usage and redistribution +# of this file, and for a DISCLAIMER OF ALL WARRANTIES. +# ------------------------------------------------------------------------- +# RCS: @(#) $Id: json_write.test,v 1.1 2009/11/25 04:41:01 andreas_kupries Exp $ + +# ------------------------------------------------------------------------- + +source [file join \ + [file dirname [file dirname [file join [pwd] [info script]]]] \ + devtools testutilities.tcl] + +testsNeedTcl 8.5 +testsNeedTcltest 2.0 + +testing { + useLocal json_write.tcl json::write +} + +# ------------------------------------------------------------------------- + +set data {grammar { + rules { + A {is {/ {t +} {t -}} mode value} + D {is {/ {t 0} {t 1} } mode value} + E {is {/ {x {t (} {n E} {t )}} {x {n F} {* {x {n M} {n F}}}}} mode value} + F {is {x {n T} {* {x {n A} {n T}}}} mode value} + M {is {/ {t *} {t /}} mode value} + N {is {x {? {n S}} {+ {n D}}} mode value} + S {is {/ {t +} {t -}} mode value} + T {is {n N} mode value} + } + start {n Expression} +}} + +proc gen {serial} { + array set g $serial + array set g $g(grammar) + unset g(grammar) + + # Assemble the rules ... + set rules {} + foreach {symbol def} $g(rules) { + lassign $def _ is _ mode + lappend rules $symbol \ + [json::write object \ + is [json::write string $is] \ + mode [json::write string $mode]] + } + + # Assemble the final result ... + return [json::write object grammar \ + [json::write object \ + rules [json::write object {*}$rules] \ + start [json::write string $g(start)]]] +} + +# ------------------------------------------------------------------------- +# Tests +# ------------------------------------------------------------------------- + +test json-write-1.0 {default configuration} -body { + list [json::write indented] [json::write aligned] +} -result {1 1} + +test json-write-1.1 {implied configurations} -body { + json::write indented 0 + list [json::write indented] [json::write aligned] +} -result {0 0} + +test json-write-1.2 {implied configurations} -body { + json::write indented 0 + json::write aligned 0 + json::write aligned 1 + list [json::write indented] [json::write aligned] +} -result {1 1} + +# ------------------------------------------------------------------------- + +test json-write-2.0 {argument errors} -body { + json::write indented X Y +} -returnCodes 1 -result {wrong # args: should be "json::write indented ?bool?"} + +test json-write-2.1 {argument errors} -body { + json::write aligned X Y +} -returnCodes 1 -result {wrong # args: should be "json::write aligned ?bool?"} + +test json-write-2.2 {argument errors} -body { + json::write string +} -returnCodes 1 -result {wrong # args: should be "json::write string s"} + +test json-write-2.3 {argument errors} -body { + json::write string A B +} -returnCodes 1 -result {wrong # args: should be "json::write string s"} + +test json-write-2.4 {argument errors} -body { + json::write object A +} -returnCodes 1 -result {wrong # args, expected an even number of arguments} + +# ------------------------------------------------------------------------- + +test json-write-3.0 {indented, aligned} -setup { + json::write indented 1 + json::write aligned 1 +} -body { + gen $data +} -result {{ + "grammar" : { + "rules" : { + "A" : { + "is" : "/ {t +} {t -}", + "mode" : "value" + }, + "D" : { + "is" : "/ {t 0} {t 1} ", + "mode" : "value" + }, + "E" : { + "is" : "/ {x {t (} {n E} {t )}} {x {n F} {* {x {n M} {n F}}}}", + "mode" : "value" + }, + "F" : { + "is" : "x {n T} {* {x {n A} {n T}}}", + "mode" : "value" + }, + "M" : { + "is" : "/ {t *} {t /}", + "mode" : "value" + }, + "N" : { + "is" : "x {? {n S}} {+ {n D}}", + "mode" : "value" + }, + "S" : { + "is" : "/ {t +} {t -}", + "mode" : "value" + }, + "T" : { + "is" : "n N", + "mode" : "value" + } + }, + "start" : "n Expression" + } +}} + +test json-write-3.1 {indented, !aligned} -setup { + json::write indented 1 + json::write aligned 0 +} -body { + gen $data +} -result {{ + "grammar" : { + "rules" : { + "A" : { + "is" : "/ {t +} {t -}", + "mode" : "value" + }, + "D" : { + "is" : "/ {t 0} {t 1} ", + "mode" : "value" + }, + "E" : { + "is" : "/ {x {t (} {n E} {t )}} {x {n F} {* {x {n M} {n F}}}}", + "mode" : "value" + }, + "F" : { + "is" : "x {n T} {* {x {n A} {n T}}}", + "mode" : "value" + }, + "M" : { + "is" : "/ {t *} {t /}", + "mode" : "value" + }, + "N" : { + "is" : "x {? {n S}} {+ {n D}}", + "mode" : "value" + }, + "S" : { + "is" : "/ {t +} {t -}", + "mode" : "value" + }, + "T" : { + "is" : "n N", + "mode" : "value" + } + }, + "start" : "n Expression" + } +}} + +test json-write-3.1 {!indented, !aligned} -setup { + json::write indented 0 + json::write aligned 0 +} -body { + gen $data +} -result {{"grammar":{"rules":{"A":{"is":"/ {t +} {t -}","mode":"value"},"D":{"is":"/ {t 0} {t 1} ","mode":"value"},"E":{"is":"/ {x {t (} {n E} {t )}} {x {n F} {* {x {n M} {n F}}}}","mode":"value"},"F":{"is":"x {n T} {* {x {n A} {n T}}}","mode":"value"},"M":{"is":"/ {t *} {t /}","mode":"value"},"N":{"is":"x {? {n S}} {+ {n D}}","mode":"value"},"S":{"is":"/ {t +} {t -}","mode":"value"},"T":{"is":"n N","mode":"value"}},"start":"n Expression"}}} + + +# ------------------------------------------------------------------------- + +test json-write-4.0 {string quoting} -body { + json::write string "a\"b\\c\bd\fe\nf\rg\th\0i\1j\2k\3l\177m" +} -result "\"a\\\"b\\\\c\\bd\\fe\\nf\\rg\\th\\u0000i\\u0001j\\u0002k\\u0003l\\u007fm\"" + +# ------------------------------------------------------------------------- +unset data +rename gen {} +testsuiteCleanup + +# Local Variables: +# mode: tcl +# indent-tabs-mode: nil +# End: diff --git a/cpp_to_py/common/lib/sdc/json/jsonc.tcl b/cpp_to_py/common/lib/sdc/json/jsonc.tcl new file mode 100755 index 0000000..a82226e --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/jsonc.tcl @@ -0,0 +1,171 @@ +# jsonc.tcl -- +# +# Implementation of a JSON parser in C. +# Binding to a yacc/bison parser by Mikhail. +# +# Copyright (c) 2013,2015 - critcl wrapper - Andreas Kupries +# Copyright (c) 2013 - C binding - mi+tcl.tk-2013@aldan.algebra.com + +package require critcl +# @sak notprovided jsonc +package provide jsonc 1.1.2 +package require Tcl 8.4 + +#critcl::cheaders -g +#critcl::debug memory symbols +critcl::cheaders -Ic c/*.h +critcl::csources c/*.c + +# # ## ### Import base declarations, forwards ### ## # # + +critcl::ccode { + #include +} + +# # ## ### Main Conversion ### ## # # + +namespace eval ::json { + critcl::ccommand json2dict_critcl {dummy I objc objv} { + struct context context = { NULL }; + + if (objc != 2) { + Tcl_WrongNumArgs(I, 1, objv, "json"); + return TCL_ERROR; + } + + context.text = Tcl_GetStringFromObj(objv[1], &context.remaining); + context.I = I; + context.has_error = 0; + context.result = TCL_ERROR; + + jsonparse (&context); + return context.result; + } + + # Issue with critcl 2 used here. Cannot use '-', incomplete distinction of C and Tcl names. + # The json.tcl file making use of this code has a wrapper fixing the issue. + critcl::ccommand many_json2dict_critcl {dummy I objc objv} { + struct context context = { NULL }; + + int max; + int found; + + Tcl_Obj* result = Tcl_NewListObj (0, NULL); + + if ((objc < 2) || (objc > 3)) { + Tcl_WrongNumArgs(I, 1, objv, "jsonText ?max?"); + return TCL_ERROR; + } + + if (objc == 3) { + if (Tcl_GetIntFromObj(I, objv[2], &max) != TCL_OK) { + return TCL_ERROR; + } + if (max <= 0) { + Tcl_AppendResult (I, "Bad limit ", + Tcl_GetString (objv[2]), + " of json entities to extract.", + NULL); + Tcl_SetErrorCode (I, "JSON", "BAD-LIMIT", NULL); + return TCL_ERROR; + } + + } else { + max = -1; + } + + context.text = Tcl_GetStringFromObj(objv[1], &context.remaining); + context.I = I; + context.has_error = 0; + found = 0; + + /* Iterate over the input until + * - we have gotten all requested values. + * - we have run out of input + * - we have run into an error + */ + + while ((max < 0) || max) { + context.result = TCL_ERROR; + jsonparse (&context); + + /* parse error, abort */ + if (context.result != TCL_OK) { + Tcl_DecrRefCount (result); + return TCL_ERROR; + } + + /* Proper value extracted, extend result */ + found ++; + Tcl_ListObjAppendElement(I, result, + Tcl_GetObjResult (I)); + + /* Count down on the number of still missing + * values, if not asking for all (-1) + */ + if (max > 0) max --; + + /* Jump over trailing whitespace for proper end-detection */ + jsonskip (&context); + + /* Abort if we have consumed all input */ + if (!context.remaining) break; + + /* Clear scratch pad before continuing */ + context.obj = NULL; + } + + /* While all parses were ok we reached end of + * input without getting all requested values, + * this is an error + */ + if (max > 0) { + char buf [30]; + sprintf (buf, "%d", found); + Tcl_ResetResult (I); + Tcl_AppendResult (I, "Bad limit ", + Tcl_GetString (objv[2]), + " of json entities to extract, found only ", + buf, + ".", + NULL); + Tcl_SetErrorCode (I, "JSON", "BAD-LIMIT", "TOO", "LARGE", NULL); + Tcl_DecrRefCount (result); + return TCL_ERROR; + } + + /* We are good and done */ + Tcl_SetObjResult(I, result); + return TCL_OK; + } + + if 0 {critcl::ccommand validate_critcl {dummy I objc objv} { + struct context context = { NULL }; + + if (objc != 2) { + Tcl_WrongNumArgs(I, 1, objv, "jsonText"); + return TCL_ERROR; + } + + context.text = Tcl_GetStringFromObj(objv[1], &context.remaining); + context.I = I; + context.result = TCL_ERROR; + + /* Iterate over the input until we have run + * out of text, or encountered an error. We + * use only the lexer here, and told it to not + * create superfluous token values. + */ + + while (context.remaining) { + if (jsonlex (&context) == -1) { + Tcl_SetObjResult(I, Tcl_NewBooleanObj (0)); + return TCL_OK; + } + } + + /* We are good and done */ + Tcl_SetObjResult(I, Tcl_NewBooleanObj (1)); + return TCL_OK; + }} +} diff --git a/cpp_to_py/common/lib/sdc/json/pkgIndex.tcl b/cpp_to_py/common/lib/sdc/json/pkgIndex.tcl new file mode 100755 index 0000000..00e4b21 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/pkgIndex.tcl @@ -0,0 +1,7 @@ +# Tcl package index file, version 1.1 + +if {![package vsatisfies [package provide Tcl] 8.4]} {return} +package ifneeded json 1.3.4 [list source [file join $dir json.tcl]] + +if {![package vsatisfies [package provide Tcl] 8.5]} {return} +package ifneeded json::write 1.0.3 [list source [file join $dir json_write.tcl]] diff --git a/cpp_to_py/common/lib/sdc/json/tests/array.result b/cpp_to_py/common/lib/sdc/json/tests/array.result new file mode 100644 index 0000000..e97b275 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/array.result @@ -0,0 +1 @@ +{precision zip Latitude 37.7668 Longitude -122.3959 Address {} City {SAN FRANCISCO} State CA Zip 94107 Country US} {precision zip Latitude 37.371991 Longitude -122.026020 Address {} City SUNNYVALE State CA Zip 94085 Country US} diff --git a/cpp_to_py/common/lib/sdc/json/tests/array.sort b/cpp_to_py/common/lib/sdc/json/tests/array.sort new file mode 100644 index 0000000..3f440d5 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/array.sort @@ -0,0 +1 @@ +list dict diff --git a/cpp_to_py/common/lib/sdc/json/tests/glossary.result b/cpp_to_py/common/lib/sdc/json/tests/glossary.result new file mode 100644 index 0000000..fdb463f --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/glossary.result @@ -0,0 +1 @@ +glossary {title {example glossary} mixlist {{a "" str} -0.09 null {} {member true}} GlossDiv {title S GlossList {{ID SGML GlossTerm {Standard \" Language} Acronym SGML\\ Abbrev {ISO 8879:1986} GlossDef {A meta-markup language, used ...} GlossSeeAlso {GML XML markup}}}}} diff --git a/cpp_to_py/common/lib/sdc/json/tests/glossary.sort b/cpp_to_py/common/lib/sdc/json/tests/glossary.sort new file mode 100644 index 0000000..742cd19 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/glossary.sort @@ -0,0 +1 @@ +dict * {dict GlossDiv {dict GlossList {list dict}}} \ No newline at end of file diff --git a/cpp_to_py/common/lib/sdc/json/tests/menu.result b/cpp_to_py/common/lib/sdc/json/tests/menu.result new file mode 100644 index 0000000..1855db8 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/menu.result @@ -0,0 +1 @@ +menu {id file value File: unival @@@: popup {menuitem {{value Open onclick OpenDoc()} {value Close onclick CloseDoc()}}}} diff --git a/cpp_to_py/common/lib/sdc/json/tests/menu.sort b/cpp_to_py/common/lib/sdc/json/tests/menu.sort new file mode 100644 index 0000000..d7bcb35 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/menu.sort @@ -0,0 +1 @@ +dict * {dict popup {dict * {list dict}}} \ No newline at end of file diff --git a/cpp_to_py/common/lib/sdc/json/tests/menu2.result b/cpp_to_py/common/lib/sdc/json/tests/menu2.result new file mode 100644 index 0000000..bc7e285 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/menu2.result @@ -0,0 +1 @@ +menu {header Viewer items {{id Open} {id OpenNew label {Open New}} null {id ZoomIn label {Zoom In}} {id ZoomOut label {Zoom Out}} null {id Help} {id About label {About Viewer...}}}} diff --git a/cpp_to_py/common/lib/sdc/json/tests/menu2.sort b/cpp_to_py/common/lib/sdc/json/tests/menu2.sort new file mode 100644 index 0000000..f47f7e9 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/menu2.sort @@ -0,0 +1 @@ +dict * {dict items {list 0 dict 1 dict 3 dict 4 dict 6 dict 7 dict}} diff --git a/cpp_to_py/common/lib/sdc/json/tests/support.tcl b/cpp_to_py/common/lib/sdc/json/tests/support.tcl new file mode 100644 index 0000000..95829a3 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/support.tcl @@ -0,0 +1,157 @@ + +#use fileutil/fileutil.tcl fileutil + +catch {unset JSON} +catch {unset TCL} +catch {unset DICTSORT} + +proc dictsort3 {spec data} { + while [llength $spec] { + set type [lindex $spec 0] + set spec [lrange $spec 1 end] + + switch -- $type { + dict { + lappend spec * string + + set json {} + foreach {key} [lsort [dict keys $data]] { + set val [dict get $data $key] + foreach {keymatch valtype} $spec { + if {[string match $keymatch $key]} { + lappend json $key [dictsort3 $valtype $val] + break + } + } + } + return $json + } + list { + lappend spec * string + set json {} + set idx 0 + foreach {val} $data { + foreach {keymatch valtype} $spec { + if {$idx == $keymatch || $keymatch eq "*"} { + lappend json [dictsort3 $valtype $val] + break + } + } + incr idx + } + return $json + } + string { + return $data + } + default { + error "Invalid type" + } + } + } +} + +foreach f [TestFilesGlob tests/*.json] { + set name [file rootname [file tail $f]] + set JSON($name) [tcltest::viewFile $f] +} + +foreach f [TestFilesGlob tests/*.result] { + set name [file rootname [file tail $f]] + set TCL($name) [tcltest::viewFile $f] +} + +foreach f [TestFilesGlob tests/*.sort] { + set name [file rootname [file tail $f]] + set DICTSORT($name) [tcltest::viewFile $f] +} + +# Postprocessing result of one test case, insert proper expected unicodepoint +set TCL(menu) [string map [list @@@ \u6021] $TCL(menu)] + +set JSON(emptyList) {[]} +set TCL(emptyList) {} + +set JSON(emptyList2) {{"menu": []}} +set TCL(emptyList2) {menu {}} + +set JSON(emptyList3) {["menu", []]} +set TCL(emptyList3) {menu {}} + +set JSON(emptyList4) {[[]]} +set TCL(emptyList4) {{}} + +set JSON(escapes) {"\t\r\n\f\b\/\\\""} +set TCL(escapes) "\t\r\n\f\b/\\\"" + +foreach {label json tcl} { + fp1.1 1.1 1.1 + fp1. 1. 1. + fp.1 .1 .1 + fp0.1 0.1 0.1 + fp1 1 1 +} { + set JSON($label) $json + set TCL($label) $tcl +} + +foreach f [TestFilesGlob tests/*.fail] { + set name [file rootname [file tail $f]] + set FAIL($name) [tcltest::viewFile $f] +} + +foreach f [TestFilesGlob tests/*.err] { + set name [file rootname [file tail $f]] + set ERR($name) [tcltest::viewFile $f] +} + +## Tcl has strict escape checking. +## C uses Tcl_UtfBacklash, and allows lots of irregular escapes. + +set FAIL(escape1) {"\%"} +set ERR(escape1-tcl) {unexpected token ""\%"" at position 0; expecting STRING} +set ERR(escape1-critcl) {bad escape 3 bytes before end, around ``%''} + +set FAIL(escape2) {"\."} +set ERR(escape2-tcl) {unexpected token ""\."" at position 0; expecting STRING} +set ERR(escape2-critcl) {bad escape 3 bytes before end, around ``.''} + +set FAIL(escape3) {["\%"]} +set ERR(escape3-tcl) {unexpected token ""\%"" at position 1; expecting STRING} +set ERR(escape3-critcl) {bad escape 4 bytes before end, around ``%''} + +set FAIL(escape4) {["\."]} +set ERR(escape4-tcl) {unexpected token ""\."" at position 1; expecting STRING} +set ERR(escape4-critcl) {bad escape 4 bytes before end, around ``.''} + +set FAIL(escape5) {{"a":"\%"}} +set ERR(escape5-tcl) {unexpected token ""\%"" at position 3; expecting STRING} +set ERR(escape5-critcl) {bad escape 4 bytes before end, around ``%''} + +set FAIL(escape6) {{"a":"\."}} +set ERR(escape6-tcl) {unexpected token ""\."" at position 3; expecting STRING} +set ERR(escape6-critcl) {bad escape 4 bytes before end, around ``.''} + + + +proc resultfor {name} { + global TCL + transform $TCL($name) $name +} + +proc transform {res name} { + global DICTSORT + if {[info exists DICTSORT($name)]} { + return [dictsort3 $DICTSORT($name) $res] + } else { + return $res + } +} + +proc transform* {res args} { + set t {} + foreach r $res n $args { + lappend t [transform $r $n] + } + return $t +} diff --git a/cpp_to_py/common/lib/sdc/json/tests/widget.result b/cpp_to_py/common/lib/sdc/json/tests/widget.result new file mode 100644 index 0000000..feaa6b2 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/widget.result @@ -0,0 +1 @@ +widget {debug on window {title {Sample Widget} name main_window width 500 height 500} text {data {Click Here} size 36 style bold name null hOffset 250 vOffset 100 alignment center onMouseUp {sun1.opacity = (sun1.opacity / 100) * 90;}}} diff --git a/cpp_to_py/common/lib/sdc/json/tests/widget.sort b/cpp_to_py/common/lib/sdc/json/tests/widget.sort new file mode 100644 index 0000000..4ae41f7 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/json/tests/widget.sort @@ -0,0 +1 @@ +dict * {dict text dict window dict} diff --git a/cpp_to_py/common/lib/sdc/mask.h b/cpp_to_py/common/lib/sdc/mask.h new file mode 100755 index 0000000..e66f4ee --- /dev/null +++ b/cpp_to_py/common/lib/sdc/mask.h @@ -0,0 +1,32 @@ +#pragma once +#include "common/lib/Helper.h" + +namespace gt::sdc { + +struct TimingMask { + inline static constexpr auto min_mask = 0x01; + inline static constexpr auto max_mask = 0x02; + inline static constexpr auto rise_mask = 0x04; + inline static constexpr auto fall_mask = 0x08; + + constexpr TimingMask(std::optional min, + std::optional max, + std::optional rise, + std::optional fall) { + if (min) mask |= min_mask; + if (max) mask |= max_mask; + if (!min && !max) mask |= (min_mask | max_mask); + + if (rise) mask |= rise_mask; + if (fall) mask |= fall_mask; + if (!rise && !fall) mask |= (rise_mask | fall_mask); + } + + int mask{0}; + + constexpr bool operator|(Split el) const { return (el == MIN) ? mask & min_mask : mask & max_mask; } + + constexpr bool operator|(Tran rf) const { return (rf == RISE) ? mask & rise_mask : mask & fall_mask; } +}; + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/object.cpp b/cpp_to_py/common/lib/sdc/object.cpp new file mode 100755 index 0000000..3955b78 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/object.cpp @@ -0,0 +1,29 @@ +#include "object.h" + +namespace gt::sdc { + +Object parse_port(const std::string& line) { + if (line.find("all_inputs") != std::string::npos) { + return AllInputs{}; + } + + if (line.find("all_outputs") != std::string::npos) { + return AllOutputs{}; + } + + const static std::regex ws_re("\\s+|\\n+|\\t+"); + + auto itr = std::sregex_token_iterator(line.begin(), line.end(), ws_re, -1); + auto end = std::sregex_token_iterator(); + // auto num = std::distance(itr, end); + + GetPorts get_ports; + + for (; itr != end; ++itr) { + get_ports.ports.push_back(itr->str()); + } + + return get_ports; +} + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/object.h b/cpp_to_py/common/lib/sdc/object.h new file mode 100755 index 0000000..1d85fe7 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/object.h @@ -0,0 +1,61 @@ +#pragma once + +#include "tokenizer.h" + +namespace gt::sdc { + +struct CurrentDesign {}; + +struct AllClocks {}; + +struct GetClocks { + std::vector clocks; +}; + +struct AllInputs {}; + +struct AllOutputs {}; + +struct GetPorts { + std::vector ports; +}; + +struct GetCells { + std::vector cells; +}; + +struct GetPins { + std::vector pins; +}; + +struct GetNets { + std::vector nets; +}; + +struct GetLibs { + std::vector libs; +}; + +struct GetLibCells {}; + +struct GetLibPins {}; + +struct AllRegisters {}; + +using Object = std::variant; + +Object parse_port(const std::string&); + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/sdc.cpp b/cpp_to_py/common/lib/sdc/sdc.cpp new file mode 100644 index 0000000..28ef129 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc.cpp @@ -0,0 +1,319 @@ +#include "sdc.h" + +namespace gt::sdc { + +std::unique_ptr> c_args(const std::vector& args) { + std::unique_ptr> ptr(new char*[args.size() + 1], [n = args.size()](char** ptr) { + for (size_t i = 0; i <= n; ++i) { + delete[] ptr[i]; + } + delete[] ptr; + }); + + for (size_t i = 0; i < args.size(); ++i) { + ptr.get()[i] = new char[args[i].length() + 1]; + std::strcpy(ptr.get()[i], args[i].c_str()); + } + + ptr.get()[args.size()] = nullptr; + + return ptr; +} + +void SDC::read(const std::filesystem::path& path) { + logger.infoif(!std::filesystem::exists(path), "sdc file %s doesn't exist", path.c_str()); + logger.info("loading sdc %s", path.c_str()); + + auto sdc_path = std::filesystem::absolute(path); + auto sdc_json = sdc_path; + sdc_json.replace_extension(".json"); + + if (auto cpid = ::fork(); cpid == -1) { + logger.error("can't fork sdc reader"); + return; + } + // child + else if (cpid == 0) { +#define TCLSH_PATH "/usr/bin/tclsh" + auto sdc_home = std::filesystem::current_path() / "cpp_to_py" / "common" / "lib" / "sdc"; + if (::chdir(sdc_home.c_str()) == -1) { + logger.error("can't enter into %s", sdc_home.c_str()); + ::exit(EXIT_FAILURE); + } + + std::vector args{TCLSH_PATH, "sdc.tcl", sdc_path.c_str(), sdc_json.c_str()}; + + ::execvp(args[0].c_str(), c_args(args).get()); + logger.error("exec failed: %s", strerror(errno)); + ::exit(EXIT_FAILURE); + logger.warning("sdc reader not implemented yet"); + } + // parent + else { + int s; + + do { + int w = ::waitpid(cpid, &s, WUNTRACED | WCONTINUED); + + logger.errorif(w == -1, "failed to reap sdc reader"); + + if (WIFEXITED(s)) { + logger.errorif(WEXITSTATUS(s) != EXIT_SUCCESS, "sdc reader exited with failure"); + } else if (WIFSIGNALED(s)) { + logger.error("sdc reader killed by signal %s", WTERMSIG(s)); + return; + } else if (WIFSTOPPED(s)) { + logger.info("sdc reader stopped"); + } else if (WIFCONTINUED(s)) { + logger.info("sdc reader continued"); + } + } while (!WIFEXITED(s) && !WIFSIGNALED(s)); + + std::ifstream ifs(sdc_json); + + logger.infoif(!ifs, "failed to open %s", sdc_json); + + Json json; + ifs >> json; + + for (const auto& j : json) { + if (const auto& c = j["command"]; c == "set_input_delay") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "set_driving_cell") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "set_input_transition") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "set_output_delay") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "set_load") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "create_clock") { + commands.emplace_back(std::in_place_type_t{}, j); + } else if (c == "set_units") { + commands.emplace_back(std::in_place_type_t{}, j); + } else { + logger.error("sdc command %s not supported yet", c); + } + } + + try { + std::filesystem::remove(sdc_json); + } catch (const std::exception& e) { + logger.warning("can't remove %s: %s", sdc_json, e.what()); + } + } +} + +// Constructor +SetUnits::SetUnits(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + auto& key = itr.key(); + if (key == "-time") { + time = unquoted(itr.value()); + } else if (key == "-capacitance") { + capacitance = unquoted(itr.value()); + } else if (key == "-voltage") { + voltage = unquoted(itr.value()); + } else if (key == "-current") { + current = unquoted(itr.value()); + } else if (key == "-resistance") { + resistance = unquoted(itr.value()); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetInputDelay::SetInputDelay(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (auto& key = itr.key(); key == "-clock") { + clock = itr.value(); + } else if (key == "-clock_fall") { + clock_fall.emplace(); + } else if (key == "-level_sensitive") { + level_sensitive.emplace(); + } else if (key == "-rise") { + rise.emplace(); + } else if (key == "-fall") { + fall.emplace(); + } else if (key == "-min") { + min.emplace(); + } else if (key == "-max") { + max.emplace(); + } else if (key == "-add_delay") { + add_delay.emplace(); + } else if (key == "-network_latency_included") { + network_latency_included.emplace(); + } else if (key == "-source_latency_included") { + source_latency_included.emplace(); + } else if (key == "delay_value") { + delay_value = std::stof(unquoted(itr.value())); + } else if (key == "port_pin_list") { + port_pin_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetDrivingCell::SetDrivingCell(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (const auto& key = itr.key(); key == "-clock") { + clock = itr.value(); + } else if (key == "-clock_fall") { + clock_fall.emplace(); + } else if (key == "-lib_cell") { + // TODO: do nothing + } else if (key == "-pin") { + // TODO: do nothing + } else if (key == "-min") { + min.emplace(); + } else if (key == "-max") { + max.emplace(); + } else if (key == "-input_transition_fall") { + fall.emplace(); + transitions[1] = std::stof(unquoted(itr.value())); + } else if (key == "-input_transition_rise") { + rise.emplace(); + transitions[0] = std::stof(unquoted(itr.value())); + } else if (key == "port_list") { + port_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetInputTransition::SetInputTransition(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (const auto& key = itr.key(); key == "-clock") { + clock = itr.value(); + } else if (key == "-clock_fall") { + clock_fall.emplace(); + } else if (key == "-rise") { + rise.emplace(); + } else if (key == "-fall") { + fall.emplace(); + } else if (key == "-min") { + min.emplace(); + } else if (key == "-max") { + max.emplace(); + } else if (key == "transition") { + transition = std::stof(unquoted(itr.value())); + } else if (key == "port_list") { + port_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetOutputDelay::SetOutputDelay(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (auto& key = itr.key(); key == "-clock") { + clock = itr.value(); + } else if (key == "-clock_fall") { + clock_fall.emplace(); + } else if (key == "-level_sensitive") { + level_sensitive.emplace(); + } else if (key == "-rise") { + rise.emplace(); + } else if (key == "-fall") { + fall.emplace(); + } else if (key == "-min") { + min.emplace(); + } else if (key == "-max") { + max.emplace(); + } else if (key == "-add_delay") { + add_delay.emplace(); + } else if (key == "-network_latency_included") { + network_latency_included.emplace(); + } else if (key == "-source_latency_included") { + source_latency_included.emplace(); + } else if (key == "delay_value") { + delay_value = std::stof(unquoted(itr.value())); + } else if (key == "port_pin_list") { + port_pin_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetLoad::SetLoad(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (const auto& key = itr.key(); key == "-min") { + min.emplace(); + } else if (key == "-max") { + max.emplace(); + } else if (key == "-subtract_pin_load") { + subtract_pin_load.emplace(); + } else if (key == "-pin_load") { + pin_load.emplace(); + } else if (key == "-wire_load") { + wire_load.emplace(); + } else if (key == "objects") { + objects = parse_port(unquoted(itr.value())); + } else if (key == "value") { + value = std::stof(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +CreateClock::CreateClock(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (auto& key = itr.key(); key == "-period") { + period = std::stof(unquoted(itr.value())); + } else if (key == "-add") { + add.emplace(); + } else if (key == "-comment") { + comment = itr.value(); + } else if (key == "-name") { + name = itr.value(); + } else if (key == "-waveform") { + // TODO + } else if (key == "port_pin_list") { + port_pin_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +// Constructor +SetClockUncertainty::SetClockUncertainty(const Json& json) { + for (auto itr = json.begin(); itr != json.end(); ++itr) { + if (auto& key = itr.key(); key == "uncertainty") { + } else if (key == "object_list") { + object_list = parse_port(unquoted(itr.value())); + } else if (key == "command") { + logger.errorif(itr.value() != command, "wrong command field: %s", itr.value()); + } else { + logger.error("%s: %s not supported", command, std::quoted(key)); + } + } +} + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/sdc.h b/cpp_to_py/common/lib/sdc/sdc.h new file mode 100644 index 0000000..14f85b5 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc.h @@ -0,0 +1,148 @@ + +#pragma once + +#include "common/lib/sdc/json.hpp" +#include "common/lib/tokenizer.h" +#include "mask.h" +#include "object.h" + +namespace gt::sdc { + +using Json = nlohmann::json; + +std::unique_ptr> c_args(const std::vector&); + +// Set a fixed transition on input or inout ports +struct SetUnits { + inline static constexpr auto command = "set_units"; + + std::optional time; + std::optional capacitance; + std::optional resistance; + std::optional current; + std::optional voltage; + + SetUnits() = default; + SetUnits(const Json&); +}; + +struct SetInputDelay { + inline static constexpr auto command = "set_input_delay"; + + std::string clock; + std::optional clock_fall; + std::optional level_sensitive; + std::optional add_delay; + std::optional network_latency_included; + std::optional source_latency_included; + std::optional min; + std::optional max; + std::optional rise; + std::optional fall; + std::optional delay_value; + std::optional port_pin_list; + + SetInputDelay() = default; + SetInputDelay(const Json&); +}; + +struct SetDrivingCell { + inline static constexpr auto command = "set_driving_cell"; + + std::string clock; + std::optional min; + std::optional max; + std::optional rise; + std::optional fall; + std::optional clock_fall; + std::array, 2> transitions; + std::optional port_list; + + SetDrivingCell() = default; + SetDrivingCell(const Json&); +}; + +// Set a fixed transition on input or inout ports +struct SetInputTransition { + inline static constexpr auto command = "set_input_transition"; + + std::string clock; + std::optional min; + std::optional max; + std::optional rise; + std::optional fall; + std::optional clock_fall; + std::optional transition; + std::optional port_list; + + SetInputTransition() = default; + SetInputTransition(const Json&); +}; + +struct SetOutputDelay { + inline static constexpr auto command = "set_output_delay"; + + std::string clock; + std::optional clock_fall; + std::optional level_sensitive; + std::optional rise; + std::optional fall; + std::optional max; + std::optional min; + std::optional add_delay; + std::optional network_latency_included; + std::optional source_latency_included; + std::optional delay_value; + std::optional port_pin_list; + + SetOutputDelay() = default; + SetOutputDelay(const Json&); +}; + +struct SetLoad { + inline static constexpr auto command = "set_load"; + + std::optional min; + std::optional max; + std::optional subtract_pin_load; + std::optional pin_load; + std::optional wire_load; + std::optional value; + std::optional objects; + + SetLoad() = default; + SetLoad(const Json&); +}; + +struct CreateClock { + inline static constexpr auto command = "create_clock"; + + std::optional period; + std::optional add; + std::string name; + std::string comment; + std::optional> waveform; + std::optional port_pin_list; + + CreateClock() = default; + CreateClock(const Json&); +}; + +struct SetClockUncertainty { + inline static constexpr auto command = "set_clock_uncertainty"; + + std::optional uncertainty; + std::optional object_list; + + SetClockUncertainty() = default; + SetClockUncertainty(const Json&); +}; + +using Command = std::variant; + +struct SDC { + std::vector commands; + void read(const std::filesystem::path&); +}; + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/sdc.tcl b/cpp_to_py/common/lib/sdc/sdc.tcl new file mode 100755 index 0000000..285ea16 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc.tcl @@ -0,0 +1,93 @@ +#!/usr/bin/env tclsh + +source [file join [file dirname [info script]] sdcparsercore.tcl] +lappend auto_path [file join json] + +package require json +package require json::write + +# disable json indentation +json::write indented false + +# environment variable +#global env +#puts $env(PATH) + +# Namespace gt ---------------------------------------------------------------- +namespace eval gt { + +# sdcjson +variable sdc_json [list] + +# callback procedure +proc sdc_callback {cmd parsing_result} { + + variable sdc_json + + # put reference to data structure after parsing + upvar $parsing_result res + + # Switch on cmd type + switch -- $cmd { + + create_clock - + set_input_delay - + set_input_transition - + set_output_delay - + set_driving_cell - + set_clock_uncertainty - + set_load - + set_units { + + set cmd_body [list "command" [json::write string $cmd]] + + foreach {key value} [array get res] { + lappend cmd_body $key [json::write string $value] + } + + #puts stdout [json::write object {*}$cmd_body] + + lappend sdc_json [json::write object {*}$cmd_body] + + return "" + } + + get_clocks - + get_ports { + return [join $res(patterns) " "] + } + + all_inputs { + return "all_inputs" + } + + all_clocks { + return "all_clocks" + } + + all_outputs { + return "all_outputs" + } + + default { + puts stderr "$cmd not supported yet" + } + } +} + +} +# end of gt namespace --------------------------------------------------------- + +# main program + +sdc::register_callback gt::sdc_callback +sdc::parse_file [lindex $argv 0] + +set json_output [open [lindex $argv 1] w] + +#puts stdout [json::write array {*}$gt::sdc_json] +puts -nonewline $json_output [json::write array {*}$gt::sdc_json] + +close $json_output + + diff --git a/cpp_to_py/common/lib/sdc/sdc1.1.tcl b/cpp_to_py/common/lib/sdc/sdc1.1.tcl new file mode 100755 index 0000000..576f23b --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.1.tcl @@ -0,0 +1,363 @@ +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2000 (c) Synopsys. +# +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.1 +# +# Project : SDC-parser +# +# Authors : A.Gratchev +# Intrinsix Corp. +# anso@intrinsix.com +# +################################################################################ + + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } + # !(param(-level_sensitive) && param(-edge_triggered)) + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + } {param(-period)} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + } {(param(patterns) && !param(-of_objects)) \ + || (param(-of_objects) && !param(patterns) && !param(-hierarchical))} + + declare get_clocks { + {patterns List } + } {param(patterns)} + + declare get_lib_cells { + {patterns List } + } {param(patterns)} + + declare get_lib_pins { + {patterns List } + } {param(patterns)} + + declare get_libs { + {patterns List } + } {param(patterns)} + + declare get_nets { + {patterns List } + {-hierarchical Flag } + } {param(patterns)} + + declare get_pins { + {patterns List } + {-hierarchical Flag } + } {param(patterns)} + + declare get_ports { + {patterns List } + } {param(patterns)} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(port_pin_list)} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list)} + # && !(param(-rise) && param(-fall)) + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && !(param(object_list) && (param(-from) || param(-to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list)} + # && !(param(-to) ^ param(-from)) + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + } {param(port_list)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(-from) || param(-to) || param(-through)} + # && !(param(-rise) && param(-fall)) ;# && !(param(-setup) && param(-hold)) + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list)} + # && !((param(-clock_fall) || param(-level_sensitive)) && !param(clock_name)) + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value)} + # && !(param(-rise) && param(-fall)) + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value)} + # && !(param(-rise) && param(-fall)) + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list)} + # && !((param(-clock_fall) || param(-level_sensitive)) && !param(clock_name)) + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {-group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.2.tcl b/cpp_to_py/common/lib/sdc/sdc1.2.tcl new file mode 100755 index 0000000..afe7ba6 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.2.tcl @@ -0,0 +1,386 @@ +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2000 (c) Synopsys. +# +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.2 +# +# Project : SDC-parser +# +# Authors : A.Gratchev +# A.Sokhatski +# Intrinsix Corp. +# anso@intrinsix.com +# +################################################################################ + + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns))} +# && !param(-hierarchical))} + + declare get_clocks { + {patterns List } + } {param(patterns)} + + declare get_lib_cells { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pins { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_libs { + {patterns List } + } {param(patterns)} + + declare get_nets { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_ports { + {patterns List } + } {param(patterns)} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && !(param(object_list) && (param(-from) || param(-to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + } {param(port_list)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {-group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.3.tcl b/cpp_to_py/common/lib/sdc/sdc1.3.tcl new file mode 100755 index 0000000..8c227e3 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.3.tcl @@ -0,0 +1,397 @@ +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2001 (c) Synopsys. +# +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.3 +# +# Project : SDC-parser +# +# Authors : Ibna Faruque, A.Gratchev,A.Sokhatski +# Contributors : Specklin Benoit,Matthew Liberty +# Updated : Oct 29, 2001 +# Bug Fixes : set_driving_cell, set_case_analysis, set_clock_uncertainty +################################################################################ + + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {port_pin_list List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns))} +# && !param(-hierarchical))} + + declare get_clocks { + {patterns List } + } {param(patterns)} + + declare get_lib_cells { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pins { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_libs { + {patterns List } + } {param(patterns)} + + declare get_nets { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_ports { + {patterns List } + } {param(patterns)} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ (param(-from) && param(-to))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.4.tcl b/cpp_to_py/common/lib/sdc/sdc1.4.tcl new file mode 100755 index 0000000..1c6e0c6 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.4.tcl @@ -0,0 +1,444 @@ +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2003 (c) Synopsys. +# +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.3 +# +# Project : SDC-parser +# +# Authors : Ibna Faruque, A.Gratchev,A.Sokhatski +# Contributors : Specklin Benoit,Matthew Liberty +# Updated : Jan 7, 2003 +# Bug Fixes : set_driving_cell, set_case_analysis, set_clock_uncertainty +################################################################################ + + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {port_pin_list List } + {-add Flag } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns))} +# && !param(-hierarchical))} + + declare get_clocks { + {patterns List } + } {param(patterns)} + + declare get_lib_cells { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pins { + {patterns List } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_libs { + {patterns List } + } {param(patterns)} + + declare get_nets { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_ports { + {patterns List } + } {param(patterns)} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ (param(-from) && param(-to))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.5.tcl b/cpp_to_py/common/lib/sdc/sdc1.5.tcl new file mode 100755 index 0000000..994dc88 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.5.tcl @@ -0,0 +1,553 @@ +################################################################################ +# +# Copyright 2005 (c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.5 +# +# : Ibna Faruque +# Updated : April 5, 2005 +# Bug Fixes : +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {port_pin_list List } + {-add Flag } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } +#} {param(patterns)} + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + #} {param(patterns)} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.6.tcl b/cpp_to_py/common/lib/sdc/sdc1.6.tcl new file mode 100755 index 0000000..ebb8ab4 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.6.tcl @@ -0,0 +1,572 @@ +################################################################################ +# +# Copyright 2006 (c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.5 +# +# : Ibna Faruque +# Updated : june 12, 2006 +# Bug Fixes : +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare create_clock { + {-period Float {$par>=0}} + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {port_pin_list List } + {-add Flag } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } +#} {param(patterns)} + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + #} {param(patterns)} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1}} + {-rise Flag } + {-fall Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + +declare create_voltage_area { + {-name String {1} } + {-coordinate List } + {-guard_band_x List } + {-guard_band_y List } + {cell_list List {1} } + } {param(-name) && {param(cell_list)}} + +declare set_level_shifter_strategy { + {-rule Enum {all low_to_high high_to_low}} + } {param(-rule)} + +declare set_level_shifter_threshold { + {-voltage Float {1} } + {-percent Float {1} } + } {param(-voltage)} + + + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.7.tcl b/cpp_to_py/common/lib/sdc/sdc1.7.tcl new file mode 100755 index 0000000..37ec2ca --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.7.tcl @@ -0,0 +1,707 @@ +################################################################################ +# +# Copyright 2007 (c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.7 +# +# Update By : Ibna Faruque +# Updated On : March, 2007 +# Bug Fixes : +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + +#added on SDC1.7 +declare all_registers { + {-clock List } + {-rise_clock List } + {-fall_clock List } + {-no_hierarchy Flag } + {-cells Flag } + {-data_pins Flag } + {-clock_pins Flag } + {-slave_clock_pins Flag } + {-async_pins Flag } + {-output_pins Flag } + {-level_sensitive Flag } + {-edge_triggered Flag } + {-master_slave Flag } + } + + declare create_clock { + {-period Float {$par>=0} } + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {-combinational Flag } + {port_pin_list List } + {-add Flag } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + +# added SDC1.7 + declare group_path { + {-name String } + {-default Flag } + {-weight Float {$par>=0.0 && $par <=100.0} } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-rise_through List {dup} } + {-fall_through List {dup} } + } {((param(-name) && !param(-default)) || \ + (param(-default) && !param(-name)) || !param(-name) && \ + (param(-from) ^ param(-rise_from) ^ param(-fall_from)))} + + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + +# sdc1.7 updte + declare set_units { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + +# set_unit synonym for set_units + declare set_unit { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + +# sdc1.7 command + declare set_clock_groups { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# set_clock_group synonym for set_clock_groups + declare set_clock_group { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# sdc1.7 command + declare set_clock_sense { + {-clocks List } + {-positive Flag } + {-negative Flag } + {-stop_propagation Flag } + {-pulse Enum {rise_triggered_high_pulse rise_triggered_low_pulse \ + fall_triggered_high_pulse fall_triggered_low_pulse} } + {pins List } + } {(param(-positive) ^ param(-negative) ^ param(-stop_propagation) ^ param(-pulse)) } + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + +#sdc1.7 + declare set_ideal_latency { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.7 + declare set_ideal_network { + {object_list List } + {-no_propagate Flag } + } {param(object_list)} + +#sdc1.7 + declare set_ideal_transition { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_throough List {dup} } + {-rise_throough List {dup} } + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1} } + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise_through List {dup}} + {-fall_through List {dup}} + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + +declare create_voltage_area { + {-name String {1} } + {-coordinate List } + {-guard_band_x List } + {-guard_band_y List } + {cell_list List {1} } + } {param(-name) && {param(cell_list)}} + +declare set_level_shifter_strategy { + {-rule Enum {all low_to_high high_to_low}} + } {param(-rule)} + +declare set_level_shifter_threshold { + {-voltage Float {1} } + {-percent Float {1} } + } {param(-voltage)} + + + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.8.tcl b/cpp_to_py/common/lib/sdc/sdc1.8.tcl new file mode 100755 index 0000000..6c55e3d --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.8.tcl @@ -0,0 +1,715 @@ +################################################################################ +# +# Copyright 2009 (c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.8 +# +# Update By : Ibna Faruque +# Updated On : July, 2009 +# Bug Fixes : +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + +#added on SDC1.7 +declare all_registers { + {-clock List } + {-rise_clock List } + {-fall_clock List } + {-no_hierarchy Flag } + {-cells Flag } + {-data_pins Flag } + {-clock_pins Flag } + {-slave_clock_pins Flag } + {-async_pins Flag } + {-output_pins Flag } + {-level_sensitive Flag } + {-edge_triggered Flag } + {-master_slave Flag } + } + + declare create_clock { + {-period Float {$par>=0} } + {-name String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {-combinational Flag } + {port_pin_list List } + {-add Flag } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + +# added SDC1.7 + declare group_path { + {-name String } + {-default Flag } + {-weight Float {$par>=0.0 && $par <=100.0} } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-rise_through List {dup} } + {-fall_through List {dup} } + } {((param(-name) && !param(-default)) || \ + (param(-default) && !param(-name)) || !param(-name) && \ + (param(-from) ^ param(-rise_from) ^ param(-fall_from)))} + + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + +# sdc1.7 updte + declare set_units { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + +# set_unit synonym for set_units + declare set_unit { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + +# sdc1.7 command + declare set_clock_groups { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List {dup} } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# set_clock_group synonym for set_clock_groups + declare set_clock_group { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# sdc1.7 command + declare set_clock_sense { + {-clocks List } + {-positive Flag } + {-negative Flag } + {-stop_propagation Flag } + {-pulse Enum {rise_triggered_high_pulse rise_triggered_low_pulse \ + fall_triggered_high_pulse fall_triggered_low_pulse} } + {pins List } + } {(param(-positive) ^ param(-negative) ^ param(-stop_propagation) ^ param(-pulse)) } + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + +#sdc1.7 + declare set_ideal_latency { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.7 + declare set_ideal_network { + {object_list List } + {-no_propagate Flag } + } {param(object_list)} + +#sdc1.7 + declare set_ideal_transition { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.8 + declare set_voltage { + {value Float {1}} + {-object_list List } + {-min Float {$par>=0} } + } {param(value) && param(-object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_throough List {dup} } + {-rise_throough List {dup} } + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1} } + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise_through List {dup}} + {-fall_through List {dup}} + {-through List {dup}} + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-rise Flag } + {-fall Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + +declare create_voltage_area { + {-name String {1} } + {-coordinate List } + {-guard_band_x List } + {-guard_band_y List } + {cell_list List {1} } + } {param(-name) && {param(cell_list)}} + +declare set_level_shifter_strategy { + {-rule Enum {all low_to_high high_to_low}} + } {param(-rule)} + +declare set_level_shifter_threshold { + {-voltage Float {1} } + {-percent Float {1} } + } {param(-voltage)} + + + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc1.9.tcl b/cpp_to_py/common/lib/sdc/sdc1.9.tcl new file mode 100755 index 0000000..f7914f4 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc1.9.tcl @@ -0,0 +1,724 @@ +################################################################################ +# +# Copyright 2011(c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 1.8 +# +# Update By : Ibna Faruque +# Updated On : January, 2011 +# Bug Fixes : +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + +#added on SDC1.7 +declare all_registers { + {-clock List } + {-rise_clock List } + {-fall_clock List } + {-no_hierarchy Flag } + {-cells Flag } + {-data_pins Flag } + {-clock_pins Flag } + {-slave_clock_pins Flag } + {-async_pins Flag } + {-output_pins Flag } + {-level_sensitive Flag } + {-edge_triggered Flag } + {-master_slave Flag } + } +#added -comment for sdc1.9 + declare create_clock { + {-period Float {$par>=0} } + {-name String } + {-comment String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {-combinational Flag } + {port_pin_list List } + {-add Flag } + {-comment String } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + +# added SDC1.7 + declare group_path { + {-name String } + {-default Flag } + {-weight Float {$par>=0.0 && $par <=100.0} } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-rise_through List {dup} } + {-fall_through List {dup} } + {-comment String } + } {((param(-name) && !param(-default)) || \ + (param(-default) && !param(-name)) || !param(-name) && \ + (param(-from) ^ param(-rise_from) ^ param(-fall_from)))} + + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + +# sdc1.7 updte + declare set_units { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + +# set_unit synonym for set_units + declare set_unit { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + +# sdc1.7 command + declare set_clock_groups { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List {dup} } + {-comment String } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# set_clock_group synonym for set_clock_groups + declare set_clock_group { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List } + {-comment String } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# sdc1.7 command + declare set_clock_sense { + {-clocks List } + {-positive Flag } + {-negative Flag } + {-stop_propagation Flag } + {-pulse Enum {rise_triggered_high_pulse rise_triggered_low_pulse \ + fall_triggered_high_pulse fall_triggered_low_pulse} } + {pins List } + } {(param(-positive) ^ param(-negative) ^ param(-stop_propagation) ^ param(-pulse)) } + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + +#sdc1.7 + declare set_ideal_latency { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.7 + declare set_ideal_network { + {object_list List } + {-no_propagate Flag } + } {param(object_list)} + +#sdc1.7 + declare set_ideal_transition { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.8 + declare set_voltage { + {value Float {1}} + {-object_list List } + {-min Float {$par>=0} } + } {param(value) && param(-object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_throough List {dup} } + {-rise_throough List {dup} } + {-comment String } + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1} } + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + {-comment String } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + {-comment String } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise_through List {dup}} + {-fall_through List {dup}} + {-through List {dup}} + {-comment String } + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-rise Flag } + {-fall Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + +declare create_voltage_area { + {-name String {1} } + {-coordinate List } + {-guard_band_x List } + {-guard_band_y List } + {cell_list List {1} } + } {param(-name) && {param(cell_list)}} + +declare set_level_shifter_strategy { + {-rule Enum {all low_to_high high_to_low}} + } {param(-rule)} + +declare set_level_shifter_threshold { + {-voltage Float {1} } + {-percent Float {1} } + } {param(-voltage)} + + + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdc2.0.tcl b/cpp_to_py/common/lib/sdc/sdc2.0.tcl new file mode 100755 index 0000000..dec9cec --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdc2.0.tcl @@ -0,0 +1,733 @@ +################################################################################ +# +# Copyright 2013(c) Synopsys, Inc. +# +################################################################################ +# +# Title : SDC-parser commands declaration for SDC version 2.0 +# +# Update By : Ibna Faruque +# Updated On : July, 2013 +# Bug Fixes : -combinational for create_generated_clock +################################################################################ + + declare all_clocks { + } + + declare all_inputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + + declare all_outputs { + {-level_sensitive Flag } + {-edge_triggered Flag } + {-clock List } + } {!(param(-level_sensitive) && param(-edge_triggered))} + +#added on SDC1.7 +declare all_registers { + {-clock List } + {-rise_clock List } + {-fall_clock List } + {-no_hierarchy Flag } + {-cells Flag } + {-data_pins Flag } + {-clock_pins Flag } + {-slave_clock_pins Flag } + {-async_pins Flag } + {-output_pins Flag } + {-level_sensitive Flag } + {-edge_triggered Flag } + {-master_slave Flag } + } +#added -comment for sdc1.9 + declare create_clock { + {-period Float {$par>=0} } + {-name String } + {-comment String } + {-waveform List {type_Float {length($length>=2 && ($length % 2)==0)} } } + {port_pin_list List } + {-add Flag } + } {param(-period) && (param(-name) || param(port_pin_list))} + + declare create_generated_clock { + {-name String } + {-source List } + {-edges List {type_Float {length($length>=2} } } + {-divide_by Int {1 && $par>=0} } + {-multiply_by Int {1 && $par>=0} } + {-edge_shift List } + {-duty_cycle Float {$par>=0 && $par <=100} } + {-invert Flag } + {-combinational Flag } + {port_pin_list List } + {-add Flag } + {-comment String } + {-master_clock List } +} {param(-source) && param(port_pin_list) && !(param(-multiply_by) && param(-divide_by))} + + declare current_design { + } + + declare current_instance { + {-instance String } + } + +# added SDC1.7 + declare group_path { + {-name String } + {-default Flag } + {-weight Float {$par>=0.0 && $par <=100.0} } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-rise_through List {dup} } + {-fall_through List {dup} } + {-comment String } + } {((param(-name) && !param(-default)) || \ + (param(-default) && !param(-name)) || !param(-name) && \ + (param(-from) ^ param(-rise_from) ^ param(-fall_from)))} + + + declare get_cells { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + # { } + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} +# && !param(-hierarchical))} + +# get_cell synonym for get_cells + declare get_cell { + {-of_objects List } + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_clocks { + {patterns List } + {-regexp Flag } + {-nocase Flag } + } + + declare get_clock { + {patterns List } + {-regexp Flag } + {-nocase Flag } +} + + declare get_lib_cells { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_cell { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_lib_pins { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + declare get_lib_pin { + {patterns List } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } {param(patterns)} + + + declare get_libs { + {-regexp Flag } + {-nocase Flag } + {patterns List } +} + + declare get_nets { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + declare get_net { + {patterns List } + {-of_objects List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} +} {(param(patterns) && !param(-of_objects)) || \ + (param(-of_objects) && !param(patterns)) || !param(patterns)} + + + + declare get_pins { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_pin { + {patterns List } + {-hierarchical Flag } + {-regexp Flag } + {-nocase Flag } + {-hsc Enum {{/} {@} {^} {#} {.} {|}}} + } + + declare get_ports { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + + declare get_port { + {-hierarchical Flag } + {-regexp Flag } + {patterns List } +} +# } {param(patterns)} + +# sdc1.7 updte + declare set_units { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + +# set_unit synonym for set_units + declare set_unit { + {-capacitance String } + {-resistance String } + {-time String } + {-voltage String } + {-current String } + {-power String } +} + + declare set_case_analysis { + {value Enum {0 1 rising falling zero one rise fall}} + {port_pin_list List } + } {param(value) && param(port_pin_list)} + + declare set_clock_gating_check { + {-setup Float {$par>=0}} + {-hold Float {$par>=0}} + {-rise Flag } + {-fall Flag } + {-high Flag } + {-low Flag } + {object_list List } + } {(param(-setup) || param(-hold) || param(-high) || param(-low)) && \ + !(param(-high) && param(-low))} + +# sdc1.7 command + declare set_clock_groups { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List {dup} } + {-comment String } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# set_clock_group synonym for set_clock_groups + declare set_clock_group { + {-name String } + {-physically_exclusive Flag } + {-logically_exclusive Flag } + {-asynchronous Flag } + {-allow_paths Flag } + {-group List } + {-comment String } + } {(param(-physically_exclusive) ^ param(-logically_exclusive) ^ param(-asynchronous)) } + +# sdc1.7 command + declare set_clock_sense { + {-clocks List } + {-positive Flag } + {-negative Flag } + {-stop_propagation Flag } + {-pulse Enum {rise_triggered_high_pulse rise_triggered_low_pulse \ + fall_triggered_high_pulse fall_triggered_low_pulse} } + {pins List } + } {(param(-positive) ^ param(-negative) ^ param(-stop_propagation) ^ param(-pulse)) } + + declare set_clock_latency { + {delay Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-source Flag } + {-early Flag } + {-late Flag } + {-clock List } + } {param(delay) && param(object_list)} + +#sdc1.7 + declare set_ideal_latency { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.7 + declare set_ideal_network { + {object_list List } + {-no_propagate Flag } + } {param(object_list)} + +#sdc1.7 + declare set_ideal_transition { + {value Float {1}} + {object_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(value) && param(object_list)} + +#sdc1.8 + declare set_voltage { + {value Float {1}} + {-object_list List } + {-min Float {$par>=0} } + } {param(value) && param(-object_list)} + + declare set_clock_transition { + {transition Float {1}} + {clock_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(transition) && param(clock_list) && \ + !(param(-rise) && param(-fall))} + + declare set_clock_uncertainty { + {uncertainty Float {1}} + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {object_list List } + } {param(uncertainty) && param(object_list) ^ \ + (((param(-from) ^ param(-rise_from) ^ param(-fall_from))) \ + && (param(-to) ^ param(-rise_to) ^ param(-fall_to)))} + + declare set_disable_timing { + {object_list List } + {-from String } + {-to String } + } {param(object_list) && \ + !(param(-to) ^ param(-from))} + + declare set_drive { + {resistance Float {$par>=0}} + {port_list List } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + } {param(resistance) && param(port_list)} + + declare set_driving_cell { + {-lib_cell String } + {-rise Flag } + {-fall Flag } + {-library String } + {-pin String } + {-from_pin String } + {-multiply_by Float {$par>=0}} + {-dont_scale Flag } + {-no_design_rule Flag } + {-input_transition_rise Float {$par>=0}} + {-input_transition_fall Float {$par>=0}} + {port_list List } + {-min Flag } + {-max Flag } + {-clock List } + {-clock_fall Flag } + } {param(port_list) && param(-lib_cell)} + + declare set_false_path { + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_throough List {dup} } + {-rise_throough List {dup} } + {-comment String } + } {(param(-from) || param(-to) || param(-through)) && \ + !(param(-rise) && param(-fall)) && !(param(-setup) && param(-hold))} + + declare set_fanout_load { + {value Float {$par>=0}} + {port_list List } + } {param(value) && param(port_list)} + + declare set_hierarchy_separator { + {hchar Enum {{/} {@} {^} {#} {.} {|}}} + } {param(hchar)} + + declare set_input_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1} } + {-reference_pin List } + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_input_transition { + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {transition Float {$par>=0}} + {port_list List } + {-clock List } + {-clock_fall Flag } + } {param(transition) && param(port_list)} + + declare set_load { + {-min Flag } + {-max Flag } + {-substract_pin_load Flag } + {-pin_load Flag } + {-wire_load Flag } + {value Float {$par>=0}} + {objects List } + } {param(value) && param(objects)} + + declare set_logic_dc { + {port_list List } + } {param(port_list)} + + declare set_logic_one { + {port_list List } + } {param(port_list)} + + declare set_logic_zero { + {port_list List } + } {param(port_list)} + + declare set_max_area { + {area_value Float {$par>=0}} + } {param(area_value)} + + declare set_max_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_max_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + {-comment String } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_max_fanout { + {fanout_value Float {$par>=0}} + {object_list List } + } {param(fanout_value) && param(object_list)} + + declare set_max_time_borrow { + {delay_value Float {$par>=0}} + {object_list List } + } {param(delay_value) && param(object_list)} + + declare set_max_transition { + {transition_value Float {$par>=0}} + {-clock_path Flag } + {-fall Flag } + {-rise Flag} + {object_list List } + } {param(transition_value) && param(object_list)} + + declare set_min_capacitance { + {capacitance_value Float {$par>=0}} + {object_list List } + } {param(capacitance_value) && param(object_list)} + + declare set_min_delay { + {delay_value Float {1} } + {-rise Flag } + {-fall Flag } + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-through List {dup} } + {-fall_through List {dup} } + {-rise_through List {dup} } + {-comment String } + } {param(delay_value) && \ + !(param(-rise) && param(-fall))} + + declare set_multicycle_path { + {path_multiplier Int {1}} + {-setup Flag } + {-hold Flag } + {-rise Flag } + {-fall Flag } + {-start Flag } + {-end Flag } + {-from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise_from List } + {-fall_from List } + {-rise_through List {dup}} + {-fall_through List {dup}} + {-through List {dup}} + {-comment String } + } {param(path_multiplier)} + + declare set_operating_conditions { + {-analysis_type Enum {single bc_wc on_chip_variation}} + {-library List } + {-max String } + {-min String } + {-max_library List } + {-object_list List } + {-min_library List } + {condition String } + } + + declare set_output_delay { + {-clock List } + {-clock_fall Flag } + {-level_sensitive Flag } + {-rise Flag } + {-fall Flag } + {-min Flag } + {-max Flag } + {-add_delay Flag } + {delay_value Float {1}} + {-reference_pin List } + {port_pin_list List } + {-network_latency_included Flag } + {-source_latency_included Flag } + + } {param(delay_value) && param(port_pin_list) && \ + !((param(-clock_fall) || param(-level_sensitive)) && !param(-clock))} + + declare set_port_fanout_number { + {fanout_number Int {($par>=0) && ($par<=100000)}} + {port_list List } + } {param(fanout_number) && param(port_list)} + + declare set_propagated_clock { + {object_list List } + } {param(object_list)} + + declare set_resistance { + {value Float {$par>=0}} + {net_list List } + {-min Flag } + {-max Flag } + } {param(value) && param(net_list)} + + declare set_wire_load_min_block_size { + {size Float {$par>=0}} + } {param(size)} + + declare set_wire_load_mode { + {mode_name Enum {top enclosed segmented}} + } {param(mode_name)} + + declare set_wire_load_model { + {-name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(-name)} + + declare set_wire_load_selection_group { + {group_name String } + {-library List } + {-min Flag } + {-max Flag } + {object_list List } + } {param(group_name)} + + declare set_data_check { + {-from List } + {-rise_from List } + {-fall_from List } + {-to List } + {-rise_to List } + {-fall_to List } + {-rise Flag } + {-fall Flag } + {-setup Flag } + {-hold Flag } + {-clock List } + {value Float {$par>=0} } + } {(param(-rise_from) || param(-from) || param(-fall_from)) && \ + ((param(-to) || param(-rise_to)) || param(-fall_to)) } + + declare set_timing_derate { + {derate_value Float {$par>=0.1 } } + {object_list List } +# {derate_value Float {$par>=0.1 && $par<=2.0}} + {-min Flag } + {-max Flag } + {-rise Flag } + {-fall Flag } + {-early Flag } + {-late Flag } + {-clock Flag } + {-data Flag } + {-net_delay Flag } + {-cell_delay Flag } + {-cell_check Flag } +} {param(derate_value) && (param(-early) && !param(-late)) || (param(-late) && !param(-early))} + + + + declare set_max_dynamic_power { + {power_value Float {$par>=0} } + {-unit Enum {GW MW KW W mW uW nW pW fW aW} } + } {param(power_value)} + + declare set_max_leakage_power { + {power_value Float {$par>=0}} + {-unit Enum {GW MW KW W mW uW nW pW fW aW}} + } {param(power_value)} + +declare create_voltage_area { + {-name String {1} } + {-coordinate List } + {-guard_band_x List } + {-guard_band_y List } + {cell_list List {1} } + } {param(-name) && {param(cell_list)}} + +declare set_level_shifter_strategy { + {-rule Enum {all low_to_high high_to_low}} + } {param(-rule)} + +declare set_level_shifter_threshold { + {-voltage Float {1} } + {-percent Float {1} } + } {param(-voltage)} + + + + declare set_min_porosity { + {porosity_value Float {$par>=0 && $par <=90}} + {object_list List } + } {param(porosity_value) && param(object_list)} + +# sdc 2.0 new constructs + declare set_min_pulse_width { + {value Float {$par>=0} } + {object_list List } + {-low Flag } + {-high Flag } + } {param(value)} + + +# register_new_type EdgeList { +# if {[sdc::check_type List $value]} { +# if {[expr {[llength $value] % 2}] || [llength $value]==0} { +# return 0 +# } +# +# set startvalue -0.1 +# +# foreach parv $value { +# if {[catch {expr {$parv + 1}}]} { +# return 0 +# } +# if {$parv<=$startvalue} { +# return 0 +# } +# set startvalue $parv +# } +# +# return 1 +# } else { +# return 0 +# } +# } diff --git a/cpp_to_py/common/lib/sdc/sdcparser.tcl b/cpp_to_py/common/lib/sdc/sdcparser.tcl new file mode 100755 index 0000000..ae5e37a --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdcparser.tcl @@ -0,0 +1,147 @@ +#!/bin/sh + +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2011 Synopsys, Inc. +# +# +################################################################################ +# +# Title : SDC-parser command line application +# +################################################################################\ +exec tclsh "$0" "$@" + +source [file join [file dirname [info script]] sdcparsercore.tcl] + +proc usage {} { +global argv0 +return " +Usage: +$argv0 + \[filename \[...\]\] - source file name(s) +-f - read command line arguments from file +-d - set debug level + -d0 - no error messages, quiet mode + -d1 - brief error messages (default) + -d2 - extended error messages +-l - set log file name +-v - set default sdc version +-eda - file name which contains tcl source of eda tool +" +} + +#------------------------------------------------------------------------------- +# Function : process_command_line +# Description : Analize command line +# Paremeters : argv - list of command line parameters +# Return : Result data structure +#------------------------------------------------------------------------------- +proc process_command_line {argv {startdir ""}} { + if {$argv==""} { + puts [usage] + exit + } else { + set argwait "" + set files "" + foreach arg $argv { + switch -- $argwait { + f { + set argwait "" + if {[catch {set fname [::open $arg]}]!=0} { + puts stderr "Can't open file: $arg" + } else { + while {![eof $fname]} { + append data "[gets $fname] " + } + catch {close $fname} + set lparams [split $data] + while {[set pos [lsearch $lparams ""]]!=-1} { + set lparams [lreplace $lparams $pos $pos] + } + set files [concat $files [process_command_line \ + $lparams [file dirname $arg]]] + } + } + + e { + set argwait "" + catch {source $arg} + } + + l { + set argwait "" + sdc::set_log_file $arg + catch {file delete $arg} + } + + v { + set argwait "" + sdc::set_version $arg + } + + default { + switch -glob -- $arg { + -f { + set argwait f + continue + } + + -l { + set argwait l + continue + } + + -d[0-2] { + sdc::set_debug_level [string index $arg 2] + } + + -eda { + set argwait e + continue + } + + -v { + set argwait v + continue + } + + -help { + puts [usage] + continue + } + + default { + lappend files [file join $startdir $arg] + } + } + } + } + } + } + return $files +} + +#------------------------------------------------------------------------------- +# Main section +#------------------------------------------------------------------------------- + +set filelist [process_command_line $argv] + +if {$filelist!=""} { + foreach file $filelist { + sdc::parse_file $file + } + + #if {$sdc::debuglevel>0} { + if {$sdc::errorstotal} { + puts "Found $sdc::errorstotal error(s) total." + } else { + puts "No errors found." + } + #} +} else { + puts "No files found." + puts [usage] +} diff --git a/cpp_to_py/common/lib/sdc/sdcparsercore.tcl b/cpp_to_py/common/lib/sdc/sdcparsercore.tcl new file mode 100755 index 0000000..76172de --- /dev/null +++ b/cpp_to_py/common/lib/sdc/sdcparsercore.tcl @@ -0,0 +1,870 @@ +################################################################################ +# > COPYRIGHT NOTICE < +# +# Copyright 2012 (c) Synopsys. +# +# +################################################################################ +# +# Title : SDC-parser engine +# +# Project : SDC-parser +# +# : A.Gratchev +# Intrinsix Corp. +# : Ibna faruque +# Synopsys, Inc. +################################################################################ +# +# List of procedures +# +# API procedures +# +#------------------------------------------------------------------------------- +# Function : sdc::declare +# Description : Declares SDC file command (each SDC command should be +# : declared for particular SDC version) +#------------------------------------------------------------------------------- +# Function : sdc::parse_file +# Description : Runs sdc-parser for source of SDC file +#------------------------------------------------------------------------------- +# Function : sdc::out_message +# Description : Puts message to the console / log file depending on settings +#------------------------------------------------------------------------------- +# Function : sdc::parse_command +# Description : Runs sdc-parser for one SDC command +#------------------------------------------------------------------------------- +# Function : sdc::register_callback +# Description : Sets a callback +#------------------------------------------------------------------------------- +# Function : sdc::set_log_file +# Description : Sets name of log-file +#------------------------------------------------------------------------------- +# Function : sdc::set_debug_level +# Description : Sets the level of debug messages +#------------------------------------------------------------------------------- +# Function : sdc::set_version +# Description : sets the sdcversion for use +#------------------------------------------------------------------------------- +# +# Internal rountines +# +#------------------------------------------------------------------------------- +# Function : sdc::proceesserror +# Description : Creates an error message from standart Tcl $errorInfo +#------------------------------------------------------------------------------- +# Function : sdc::setversion +# Description : Handler of setting of "sdc_version" variable +#------------------------------------------------------------------------------- +# Function : sdc::puterror +# Description : Puts some misc error messages +################################################################################ +# ---------------------------------------------------------------------- +# Revision History : +# ---------------------------------------------------------------------- +# Date By Changes Description +# ---------------------------------------------------------------------- +# 11/17/00 A.Gratchev Initial coding and debugging +# 02/22/01 A.Sokhatski Simplified code which processes list of +# parameters with defined type (by customer request) + +# 12/27/12 Ibna Faruque Added SDC version 2.0 spec + +namespace eval sdc { + variable validsdcversions [list 2.0 1.9 1.8 1.7 1.6 1.5 1.2 1.1 1.4 1.3] ;# list of valid sdc_versions + variable sdc_version ;# current sdc_version + variable lineno 0 ;# line number in processing file + variable statement "" ;# current read statement + variable procdefs ;# internal array of sdc commands declarations + variable proccond ;# internal array of sdc commands conditions + variable callback "" ;# name of callback procedure + variable logfile "" ;# name of log-file + variable debuglevel 1 ;# debug level (can be 0,1,2) + variable errors 0 ;# number of errors in one command + variable errorstotal 0 ;# total errors which was found + variable filename "" ;# current processing file + +#------------------------------------------------------------------------------- +# Function : sdc::declare +# Description : Declares SDC file command (each SDC command should be +# : declared for particular SDC version) +# Parameters : proc - name of the command (Ex.: create_clock) +# : defargs - list of descriptions of commands parameters +# : cond - describing correct set of SDC-command's +# : arguments +# Return : Nothing +#------------------------------------------------------------------------------- + proc declare {proc defargs {cond 1}} { + variable procdefs + variable proccond + variable sdc_version + + # checking for duplicate of declaration + + if {![info exists procdefs($sdc_version,$proc)]} { + set procdefs($sdc_version,$proc) $defargs + set proccond($sdc_version,$proc) $cond + } else { + puts stderr "FATAL ERROR: Procedure \"$proc\" of version \ + $sdc_version already declared!" + exit -1 + } + + # declarating sdc-command as procedure in slave Tcl-interp + + sdc$sdc_version eval " + __proc $proc {args} { + __return \[parse_command $sdc_version $proc \$args\] + } " + } + + proc register_new_type {type body} { + if {[info commands ::__user_type_handler_$type]==""} { + eval " + proc ::__user_type_handler_$type {value ext_list} \{ + $body + \} + " + } else { + puts stderr "FATAL ERROR: Type \"$type\" already declared!" + exit -1 + } + } + + # create slave Tcl-interp for each sdc version + + foreach v $validsdcversions { + interp create sdc$v + + sdc$v eval { + + # make trace handler on variable sdc_version + # for checking of valid + + trace variable sdc_version w __set_v + + proc __set_v {name args} { + __upvar $name sdcv + setversion $sdcv + } + + # redefine procedure list which converting + # hierarhical list to simple list + + proc list {args} { + set res "" + __foreach a $args { + set res [__concat $res $a] + } + __return $res + } + + proc unknown {cmd_name args} { + puterror INVALID_COMMAND "$cmd_name" + __return "" + } + } + + # disable all tcl commands + + foreach pr [sdc$v eval info commands] { + sdc$v hide $pr + } + + # enable and rename only needed procedures + + sdc$v expose __set_v + sdc$v expose proc __proc + sdc$v expose upvar __upvar + sdc$v expose return __return + sdc$v expose foreach __foreach + sdc$v expose concat __concat + + sdc$v expose list + sdc$v expose set + sdc$v expose expr + sdc$v expose unknown + + sdc$v alias setversion sdc::setversion + sdc$v alias parse_command sdc::parse_command + sdc$v alias puterror sdc::puterror + + set sdc_version $v + + # include source file + # which contains of describing of sdc commands + + if {[catch {source [file join [file dirname [info script]] \ + sdc$v.tcl]}]} { + puts stderr "FATAL ERROR: Can't load file \"sdc$v.tcl\"!" + exit -1 + } + } + set sdc_version [lindex $validsdcversions 0] +} + +#------------------------------------------------------------------------------- +# Function : sdc::parse_file +# Description : Runs sdc-parser for source of SDC file +# Parameters : filename - file name of sdc source (SDC commands) +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::parse_file {file_name} { + variable validsdcversions + variable sdc_version + variable lineno 1 + variable statement "" + + if {[catch {set fname [::open $file_name]}]!=0} { + out_message "Can't open file: $file_name" + } else { + variable filename $file_name + set lines 1 + while {![eof $fname]} { + append statement [gets $fname] + + set stlen [string length $statement] + + # read next line if statement is not complite + + if {[string index $statement [expr {$stlen - 1}]]=="\\" \ + || ![info complete $statement]} { + append statement "\n" + incr lines + if {![eof $fname]} { + continue + } + } + + # run sdc command + + if {[catch {sdc$sdc_version eval $statement}]} { + processerror + } + + set statement "" + incr lineno $lines + set lines 1 + } + catch {close $fname} + } +} + +#------------------------------------------------------------------------------- +# Function : sdc::proceesserror +# Description : Creates an error message from standart Tcl $errorInfo +# Parameters : None +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::processerror {} { + variable lineno + variable logfile + variable debuglevel + variable errors + variable errorstotal + variable filename + global errorCode errorInfo + + incr errors + incr errorstotal + + set err [split $errorInfo "\n"] + set errMsg [lindex $err 0] + set errSt [lindex $err 2] + + set f 0 + foreach errL [lrange $err 3 end] { + if {[string match {*line [0-9]*)} $errL]} { + set f 1 + set errSt [join [lrange $err 2 [expr \ + {[lsearch -exact $err $errL] - 1}]] "\n"] + break + } + } + + if {$f} { + set errLine "" + + for {set i [expr {[string length $errL] - 2}]} \ + {($i>=0) && ([set c [string index $errL $i]]!=" ")} {incr i -1} { + set errLine "$c$errLine" + } + set errLine [expr {$lineno + $errLine - 1}] + } else { + set errLine $lineno + } + + switch -- $debuglevel { + 0 { + set errmsg "" + } + + 2 { + set errmsg "$filename, $errLine: $errMsg\n while executing $errSt\n" + } + + 1 - + default { + set errmsg "$filename, $errLine: $errMsg" + } + } + if {$errmsg!=""} { + out_message $errmsg + } +} + +#------------------------------------------------------------------------------- +# Function : sdc::setversion +# Description : Handler of setting of "sdc_version" variable +# Parameters : sdcv - a new sdc_version value +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::setversion {sdcv} { + variable validsdcversions + variable sdc_version + + if {[lsearch -exact $validsdcversions $sdcv]==-1} { + puterror INCORRECT_SDC_VERSION + } else { + set sdc_version $sdcv + } +} + +#------------------------------------------------------------------------------- +# Function : sdc::puterror +# Description : Puts some misc error messages +# Parameters : msg - text of the message +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::puterror {msg_id args} { + variable statement + global errorInfo + + switch -exact -- $msg_id { + INCORRECT_SDC_VERSION { + set errorInfo "incorrect sdc_version" + } + + INVALID_COMMAND { + set errorInfo "invalid command \"[lindex $args 0]\"" + } + + VALUE_NOT_SPECIFIED { + set errorInfo "value not specified for \"[lindex $args 0]\"" + + } + + INCORRECT_ARGUMENT { + set errorInfo "incorrect argument \"[lindex $args 1]\"\ + for \"[lindex $args 0]\"" + } + + INCORRECT_ARGUMENT_PRE { + set errorInfo "incorrect argument \"[lindex $args 1]\"\ + for \"[lindex $args 0]\"\ + Too many pretendents" + } + + INCORRECT_ARGUMENT_DUP { + set errorInfo "duplicate arguments \"[lindex $args 0]\"\ + for \"[lindex $args 1]\"" + } + INCORRECT_ARGUMENT_MANY { + set errorInfo "incorrect argument \"[lindex $args 1]\"\ + for \"[lindex $args 0]\"\ + (too many arguments?)" + } + + INCORRECT_VALUE_RANGE { + set errorInfo "incorrect value for \"[lindex $args 0]\",\ + must be [lindex $args 1]" + } + + INCORRECT_TYPE { + set errorInfo "incorrect value for \"[lindex $args 0]\"" + } + + INCORRECT_TYPE_FLOAT { + set errorInfo "incorrect value for \"[lindex $args 0]\",\ + must be float type" + } + + INCORRECT_TYPE_INT { + set errorInfo "incorrect value for \"[lindex $args 0]\",\ + must be integer type" + } + + INCORRECT_TYPE_STRING { + set errorInfo "incorrect value for \"[lindex $args 0]\",\ + must be string type" + } + + INCORRECT_TYPE_LIST { + set errorInfo "incorrect value for \"[lindex $args 0]\",\ + must be list type" + } + + INCORRECT_TYPE_LIST_ELEM { + set errorInfo "incorrect type of elements of list for\ + \"[lindex $args 0]\",\ + must be [lindex $args 1] type" + } + + INCORRECT_TYPE_LIST_LENGTH { + set errorInfo "incorrect length of list for \"[lindex $args 0]\"" + } + + INCORRECT_SET { + set errorInfo "incorrect set of required parameters for\ + \"[lindex $args 0]\"" + } + + USER { + set errorInfo "[lindex $args 0]" + } + + default { + set errorInfo "unknown error message $msg_id" + } + } + + append errorInfo "\nwhile executing\n\"$statement\"\n(line 1)" + processerror +} + +#------------------------------------------------------------------------------- +# Function : sdc::out_message +# Description : Puts message to the console / log file depending on settings +# Parameters : msg - text of the message +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::out_message {msg} { + variable logfile + + puts stderr $msg + if {$logfile!=""} { + if {[catch {set flog [::open $logfile a+]}]==0} { + puts $flog $msg + catch {close $flog} + } else { + puts stderr "INTERNAL: Can't write to log-file $logfile" + set logfile "" + } + } +} + +#------------------------------------------------------------------------------- +# Function : sdc::check_type +# Description : Check type of argument +# Parameters : type - type of argument +# : value - value to be cheked +# Return : True or false +#------------------------------------------------------------------------------- +proc sdc::check_type {type value args} { + variable errors + + switch -- $type { + float - + Float { + # for checking that it is Float add 1 and catch exception + if {![catch {expr {$value + 1}}]} { + return 1 + } else { + return 0 + } + } + + int - + Int { + if {![catch {expr {$value + 1}}] \ + && [expr {int($value) == $value}]} { + return 1 + } else { + return 0 + } + } + + string - + String { + return 1 + } + + enum - + Enum { + foreach val [lindex $args 0] { + if {$val==$value} { + return 1 + } + } + return 0 + } + + list - + List { + if {![catch {llength $value}]} { + return 1 + } else { + return 0 + } + } + + unknown - + Unknown { + return 1 + } + + default { + if {[info commands ::__user_type_handler_$type]==""} { + puterror USER "INTERNAL: unknown type of param:\ + \"$type\", ignored" + incr errors -1 + return 1 + } else { + if {![catch {set res [eval {::__user_type_handler_$type $value\ + [lindex $args 0]}]}]} { + if {$res} { + return 1 + } else { + return 0 + } + } else { + puterror USER "INTERNAL: error while executing\ + user's checking procedure for type:\ + \"$type\", ignored" + incr errors -1 + return 0 + } + } + } + } ;#switch +} + +#------------------------------------------------------------------------------- +# Function : sdc::parse_command +# Description : Runs sdc-parser for one SDC command +# Parameters : ver - version number of SDC (Ex.: 1.1) +# : proc - name of the command (Ex.: create_clock) +# : arguments - list of command's arguments +# Return : Callback result or empty +#------------------------------------------------------------------------------- +proc sdc::parse_command {ver proc arguments} { + variable procdefs + variable proccond + variable errors 0 + variable callback + + # local variables for parameters presentation + # + # procpars - matching parameter lists from command declaration + # procpar - matching parameter list + # parexpect - matching parameter list (for -name parameter) or empty + # param_array - internal array for parsed command + # data_structure - result data structure for EDA procedure + + set i 0 + set num [llength $arguments] + set parexpect "" + + while {$i<$num} { + set par [lindex $arguments $i] + + if {[string match {-[a-zA-Z]*} $par]} { + + # if here, par is key param + + incr i + if {$parexpect!=""} { + puterror VALUE_NOT_SPECIFIED "$proc [lindex $parexpect 0]" + } + + # finding descriptions of matching parameters + + set procpars "" + foreach procpar $procdefs($ver,$proc) { + if {[string match "$par*" [lindex $procpar 0]]} { + if {[lindex $procpar 0]==$par} { + set procpars [list $procpar] + break + } else { + lappend procpars $procpar + } + } + } + + # how many matchings found? + + switch -- [llength $procpars] { + 0 { + puterror INCORRECT_ARGUMENT $proc $par + continue + } + + 1 { + set procpar [join $procpars] + if {([lindex $procpar 1]=="List" && + [lsearch -exact [lindex $procpar 2] dup]!=-1) || + ![info exists param_array([lindex $procpar 0],key)]} { + set param_array([lindex $procpar 0],key) 1 + } else { + puterror INCORRECT_ARGUMENT_DUP \ + [lindex $procpar 0] $proc + } + set parexpect $procpar + } + + default { + puterror INCORRECT_ARGUMENT_PRE $proc $par + continue + } + } + + # if argument is "Flag", go to analyze the next argument + + if {[lindex $parexpect 1]=="Flag"} { + set parexpect "" + set param_array([lindex $procpar 0],value) yes + continue + } + if {$i>=$num} { + puterror VALUE_NOT_SPECIFIED "$proc [lindex $parexpect 0]" + break + } + set par [lindex $arguments $i] + } + + if {$parexpect==""} { + + # positional argument, find the first empty + + set f 0 + foreach procpar $procdefs($ver,$proc) { + if {[string index [lindex $procpar 0] 0]!="-"} { + if {![info exists param_array([lindex $procpar 0],value)]} { + set f 1 + set parexpect $procpar + break + } else { + continue + } + } + } + if {!$f} { + puterror INCORRECT_ARGUMENT_MANY $proc $par + } + } else { + set f 1 + } + + # value of argument, check format + + if {$f} { + switch -- [lindex $parexpect 1] { + float - + Float { + # for checking that it is Float add 1 and catch exception + if {[check_type Float $par]} { + if {![catch {set f [expr [lindex $parexpect 2]]}] \ + && $f} { + set param_array([lindex $parexpect 0],value) $par + } else { + regsub -all -- {\$par} [lindex $parexpect 2] {} cond + puterror INCORRECT_VALUE_RANGE "$proc [lindex \ + $parexpect 0]" $cond + catch {unset param_array([lindex $parexpect 0],key)} + } + } else { + puterror INCORRECT_TYPE_FLOAT \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + + int - + Int { + if {[check_type Int $par]} { + if {![catch {set f [expr [lindex $parexpect 2]]}] \ + && $f} { + set param_array([lindex $parexpect 0],value) $par + } else { + regsub -all -- {\$par} [lindex $parexpect 2] {} cond + puterror INCORRECT_VALUE_RANGE "$proc [lindex \ + $parexpect 0]" $cond + catch {unset param_array([lindex $parexpect 0],key)} + } + } else { + puterror INCORRECT_TYPE_INT \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + + string - + String { + if {[check_type String $par]} { + set param_array([lindex $parexpect 0],value) $par + } else { + puterror INCORRECT_TYPE_STRING \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + + enum - + Enum { + if {[check_type Enum $par [lindex $parexpect 2]]} { + set param_array([lindex $parexpect 0],value) $par + } else { + puterror INCORRECT_TYPE \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + + list - + List { + if {[check_type List $par]} { + if {[set type_id [lsearch -glob [set attr [lindex \ + $parexpect 2]] {length(*)}]]!=-1} { + set length [llength $par] + if {[catch {set res [expr "[string range [lindex \ + $attr $type_id] 6 end]"]}] || !$res} { + puterror INCORRECT_TYPE_LIST_LENGTH \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex \ + $parexpect 0],key)} + break + } + } + if {[set type_id [lsearch -glob $attr {type_*}]]!=-1} { + foreach par_elem $par { + if {[check_type [set type_elem [string range \ + [lindex $attr $type_id] 5 end]] $par_elem]} { + catch {lappend param_array([lindex \ + $parexpect 0],value)\ + $par_elem} + } else { + puterror INCORRECT_TYPE_LIST_ELEM \ + "$proc [lindex $parexpect 0]" \ + $type_elem + catch {unset param_array([lindex \ + $parexpect 0],key)} + break + } + } + } else { + if {[catch {set param_array([lindex \ + $parexpect 0],value)\ + [list $param_array([lindex $parexpect 0],value) \ + $par]}]} { + set param_array([lindex $parexpect 0],value) \ + $par + } + } + } else { + puterror INCORRECT_TYPE_LIST \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + + unknown - + Unknown { + set param_array([lindex $parexpect 0],value) $par + } + + default { + if {[check_type [lindex $parexpect 1] $par [lrange $parexpect 2 end]]} { + set param_array([lindex $parexpect 0],value) $par + } else { + puterror INCORRECT_TYPE \ + "$proc [lindex $parexpect 0]" + catch {unset param_array([lindex $parexpect 0],key)} + } + } + } ;#switch + } + set parexpect "" + + incr i + } ;#while + + # check whether set of SDC-command's arguments is correct + + set cond $proccond($ver,$proc) + foreach procpar $procdefs($ver,$proc) { + set par [lindex $procpar 0] + regsub -all -- "param\\\($par\\\)" $cond \ + [info exists param_array($par,value)] cond + } + if {[catch {set ok [expr $cond]}]} { + puterror USER "INTERNAL: error in expression: \"$proccond($ver,$proc)\" \ + ($cond), ignored" + incr errors -1 + } else { + if {!$ok} { + puterror INCORRECT_SET $proc + } + } + + # create result data structure + + set result "" + foreach procpar $procdefs($ver,$proc) { + if {[info exists param_array([lindex $procpar 0],value)]} { + set data_structure([lindex $procpar 0]) \ + $param_array([lindex $procpar 0],value) + } + } + + # call "callback" procedure + + if {$callback!="" && !$errors} { + return [$callback $proc data_structure] + } else { + return "" + } +} + +#------------------------------------------------------------------------------- +# Function : sdc::register_callback +# Description : Sets a callback +# Parameters : proc_name - name of "callback" procedure (if proc_name +# : is empty callback will be disabled) +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::register_callback {proc_name} { + variable callback $proc_name +} + +#------------------------------------------------------------------------------- +# Function : sdc::set_log_file +# Description : Sets name of log-file +# Parameters : filename - name of log-file +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::set_log_file {filename} { + variable logfile $filename +} + +#------------------------------------------------------------------------------- +# Function : sdc::set_debug_level +# Description : Sets the level of debug messages +# Parameters : level - lovel of debug +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::set_debug_level {level} { + variable debuglevel $level +} + +#------------------------------------------------------------------------------- +# Function : sdc::set_version +# Description : sets the sdcversion for use +# Parameters : ver - version number of SDC +# Return : Nothing +#------------------------------------------------------------------------------- +proc sdc::set_version {ver} { + setversion $ver +} + + + diff --git a/cpp_to_py/common/lib/sdc/tokenizer.cpp b/cpp_to_py/common/lib/sdc/tokenizer.cpp new file mode 100755 index 0000000..d7ddced --- /dev/null +++ b/cpp_to_py/common/lib/sdc/tokenizer.cpp @@ -0,0 +1,99 @@ +#include "sdc.h" + +namespace gt::sdc { + +std::vector tokenize(const std::string& line) { + // Parse the token. + std::string token; + std::vector tokens; + + auto add_token = [](auto& tokens, auto& token) { + if (!token.empty()) { + tokens.push_back(std::move(token)); + } + }; + + for (auto itr = line.begin(); itr != line.end(); ++itr) { + if (*itr == '#' || *itr == '\n' || *itr == '\r') { + break; + } + + if (*itr == ' ') { + add_token(tokens, token); + } + // "quotation string" + else if (*itr == '"') { + logger.infoif(!token.empty(), "syntax error in parsing '\"'"); + + if (auto [b, e] = find_quote_pair(itr, line.end()); b != e) { + while (++b != e) { + token.push_back(*b); + } + add_token(tokens, token); + itr = e; + } else { + logger.info("can't find quote pair \" \""); + } + } + // [ ... ] + else if (*itr == '[') { + logger.infoif(!token.empty(), "syntax error in parsing '['"); + + token.push_back('['); + add_token(tokens, token); + + auto [b, e] = find_bracket_pair(itr, line.end()); + + logger.infoif(b == line.end(), "can't find bracket pair [ ]"); + + for (auto i = std::next(b); i != e; ++i) { + if (*i == '{' || *i == '}') continue; + if (*i == ' ') { + add_token(tokens, token); + } else { + token.push_back(*i); + } + } + + add_token(tokens, token); + token.push_back(']'); + add_token(tokens, token); + + itr = e; + } + // { ... } + else if (*itr == '{') { + logger.infoif(!token.empty(), "syntax error in parsing '{'"); + + token.push_back('{'); + add_token(tokens, token); + + auto [b, e] = find_brace_pair(itr, line.end()); + + logger.infoif(b == line.end(), "can't find brace pair { }"); + + for (auto i = std::next(b); i != e; ++i) { + if (*i == '{' || *i == '}') continue; + if (*i == ' ') { + add_token(tokens, token); + } else { + token.push_back(*i); + } + } + + add_token(tokens, token); + token.push_back('}'); + add_token(tokens, token); + + itr = e; + } else { + token.push_back(*itr); + } + } + + add_token(tokens, token); + + return tokens; +} + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/sdc/tokenizer.h b/cpp_to_py/common/lib/sdc/tokenizer.h new file mode 100755 index 0000000..dcde240 --- /dev/null +++ b/cpp_to_py/common/lib/sdc/tokenizer.h @@ -0,0 +1,11 @@ +#pragma once +#include "common/common.h" +#include "common/lib/Helper.h" + +namespace gt::sdc { + +using token_iter_t = std::vector::iterator; + +std::vector tokenize(const std::string&); + +}; // namespace gt::sdc diff --git a/cpp_to_py/common/lib/spef/parser-spef.hpp b/cpp_to_py/common/lib/spef/parser-spef.hpp new file mode 100644 index 0000000..5f7b1f8 --- /dev/null +++ b/cpp_to_py/common/lib/spef/parser-spef.hpp @@ -0,0 +1,1316 @@ +#pragma once + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "pegtl/pegtl.hpp" +#include + +// ------------------------------------------------------------------------------------------------ +// AGAIN!!! DO NOT CHANGE ANYTHING BELOW UNLESS YOU KNOW WHAT YOU ARE DOING!!! +// (development use only) +// +// This file has already been modified due to name conflict when merging with dreamplace. +// The 'using namespace tao::TAO_PEGTL_NAMESPACE' has been removed, and we directly define some +// structs inside the namespace. +// ------------------------------------------------------------------------------------------------ +namespace tao::TAO_PEGTL_NAMESPACE { + struct plus_minus : opt< one< '+', '-' > > {}; + struct dot : one< '.' > {}; + + struct inf : seq< istring< 'i', 'n', 'f' >, + opt< istring< 'i', 'n', 'i', 't', 'y' > > > {}; + + struct nan : seq< istring< 'n', 'a', 'n' >, + opt< one< '(' >, + plus< alnum >, + one< ')' > > > {}; + + template< typename D > + struct number : if_then_else< dot, + plus< D >, + seq< plus< D >, opt< dot, star< D > > > > {}; + + struct e : one< 'e', 'E' > {}; + struct p : one< 'p', 'P' > {}; + struct exponent : seq< plus_minus, plus< digit > > {}; + + struct decimal : seq< number< digit >, opt< e, exponent > > {}; + struct hexadecimal : seq< one< '0' >, one< 'x', 'X' >, number< xdigit >, opt< p, exponent > > {}; + + struct rule : seq< plus_minus, sor< hexadecimal, decimal, inf, nan > > {}; +} + +namespace spef { + +// ------------------------------------------------------------------------------------------------ +// Parser-SPEF stores the data to the folloing data structures. +// ------------------------------------------------------------------------------------------------ + +// Visit https://en.wikipedia.org/wiki/Standard_Parasitic_Exchange_Format +// first to understand what are essential field in a SPEF. + +// ConnectionType: +// EXTERNAL: connection to a external port (*P) +// INTERNAL: connection to a cell instance (*I) +enum class ConnectionType { + INTERNAL, + EXTERNAL +}; + +// ConnectionDirection: +// the direction of pin, either in, out or bidirectional. +enum class ConnectionDirection { + INPUT, + OUTPUT, + INOUT +}; + +// Port: the port in *PORTS section +struct Port { + Port() = default; + Port(const std::string& s): name(s) {} + std::string name; + ConnectionDirection direction; // I, O, B +}; + +// Connection: the *CONN section in *D_NET +struct Connection { + + std::string name; + ConnectionType type; + ConnectionDirection direction; + + std::optional> coordinate; + std::optional load; + std::string driving_cell; + + Connection() = default; + + void scale_capacitance(float); +}; + +// Net: the data in a *D_NET section +// - Capacitor can be ground (one node) or coupled (two nodes) +struct Net { + std::string name; + float lcap; + std::vector connections; + std::vector> caps; + std::vector> ress; + + Net() = default; + Net(const std::string& s, const float f): name{s}, lcap{f} {} + + void scale_capacitance(float); + void scale_resistance(float); +}; + +// Spef: the data in a SPEF. +// There are four parts: header, name map, ports, nets. +struct Spef { + + struct Error { + std::string line; + size_t line_number; + size_t byte_in_line; + }; + + std::string standard; + std::string design_name; + std::string date; + std::string vendor; + std::string program; + std::string version; + std::string design_flow; + std::string divider; + std::string delimiter; + std::string bus_delimiter; + std::string time_unit; + std::string capacitance_unit; + std::string resistance_unit; + std::string inductance_unit; + + std::unordered_map name_map; + std::vector ports; + std::vector nets; + + std::optional error; + + std::string dump() const; + std::string dump_compact() const; + + void dump(std::ostream&) const; + void dump_compact(std::ostream&) const; + void clear(); + void expand_name(); + void expand_name(Net&); + void expand_name(Port&); + void scale_capacitance(float); + void scale_resistance(float); + + bool read(const std::filesystem::path &); + + template + friend struct Action; + + private: + + Net* _current_net {nullptr}; + std::vector _tokens; +}; + +// ------------------------------------------------------------------------------------------------ +// AGAIN!!! DO NOT CHANGE ANYTHING BELOW UNLESS YOU KNOW WHAT YOU ARE DOING!!! +// (development use only) +// ------------------------------------------------------------------------------------------------ + +namespace double_ { +using rule = ::tao::TAO_PEGTL_NAMESPACE::rule; +}; + +// Function: split_on_space +inline void split_on_space(const char* beg, const char* end, std::vector& tokens) { + + // Parse the token. + const char *token {nullptr}; + size_t len {0}; + + tokens.clear(); + + for(const char* itr = beg; itr != end && *itr != 0; ++itr) { + if(std::isspace(*itr)) { + if(len > 0) { // Add the current token. + tokens.push_back({token, len}); + token = nullptr; + len = 0; + } + } else { + if(len == 0) { + token = itr; + } + ++len; + } + } + + if(len > 0) { + tokens.push_back({token, len}); + } +} + +inline std::ostream& operator<<(std::ostream& os, const ConnectionType& c) +{ + switch(c){ + case ConnectionType::INTERNAL: os << "*I"; break; + case ConnectionType::EXTERNAL: os << "*P"; break; + } + return os; +} + +inline std::ostream& operator<<(std::ostream& os, const ConnectionDirection& c) +{ + switch(c){ + case ConnectionDirection::INPUT : os << 'I'; break; + case ConnectionDirection::OUTPUT : os << 'O'; break; + case ConnectionDirection::INOUT : os << 'B'; break; + } + return os; +} + +inline std::ostream& operator<<(std::ostream& os, const Port& p) +{ + os << p.name << ' '; + switch(p.direction){ + case ConnectionDirection::INPUT: os << 'I'; break; + case ConnectionDirection::OUTPUT: os << 'O'; break; + case ConnectionDirection::INOUT: os << 'B'; break; + } + return os; +} + +inline bool operator == (const Connection& lhs, const Connection& rhs) { + + auto is_same_float = [](float a, float b){ + if(::fabs(a-b) > 1e-3){ + return false; + } + return true; + }; + + if(lhs.name != rhs.name or lhs.type != rhs.type or lhs.direction != rhs.direction or + lhs.driving_cell != rhs.driving_cell){ + return false; + } + + if(lhs.load.has_value() and rhs.load.has_value()){ + if(not is_same_float(*lhs.load, *rhs.load)){ + return false; + } + } + else{ + if(lhs.load != rhs.load){ + return false; + } + } + + if(lhs.coordinate.has_value() and rhs.coordinate.has_value()){ + auto& x = std::get<0>(*lhs.coordinate); + auto& y = std::get<1>(*lhs.coordinate); + auto& rx = std::get<0>(*rhs.coordinate); + auto& ry = std::get<1>(*rhs.coordinate); + if(not is_same_float(x, rx) or not is_same_float(y, ry)){ + return false; + } + } + else{ + if(lhs.coordinate != rhs.coordinate){ + return false; + } + } + return true; +} + +inline bool operator != (const Connection& lhs, const Connection& rhs) { + return not (lhs == rhs); +} + +inline std::ostream& operator<<(std::ostream& os, const Connection& c) +{ + os << c.type << ' ' << c.name << ' ' << c.direction; + if(c.coordinate.has_value()){ + os << " *C " << std::get<0>(*c.coordinate) << ' ' << std::get<1>(*c.coordinate); + } + if(c.load.has_value()){ + os << " *L " << *c.load; + } + if(not c.driving_cell.empty()){ + os << " *D " << c.driving_cell; + } + return os; +} + + +inline bool operator == (const Net& lhs, const Net& rhs) { + if(lhs.name != rhs.name or ::fabs(lhs.lcap - rhs.lcap) > 1e-3) + return false; + if(lhs.connections != rhs.connections) + return false; + if(lhs.caps.size() != rhs.caps.size() or lhs.ress.size() != rhs.ress.size()){ + return false; + } + + auto is_same_tuple = + [](const std::tuple& l, + const std::tuple& r){ + const auto& [l1, l2, l3] = l; + const auto& [r1, r2, r3] = r; + if(l1 != r1 or l2 != r2){ + return false; + } + if(::fabs(l3-r3) > 1e-3){ + return false; + } + return true; + }; + + for(size_t i=0; i(n.caps[i]); + if(not std::get<1>(n.caps[i]).empty()){ + os << ' ' << std::get<1>(n.caps[i]); + } + os << ' ' << std::get<2>(n.caps[i]) << '\n'; + } + if(not n.ress.empty()){ + os << "*RES\n"; + } + for(size_t i=0; i(n.ress[i]) << ' ' + << std::get<1>(n.ress[i]) << ' ' << std::get<2>(n.ress[i]) << '\n'; + } + os << "*END\n"; + return os; +} + + +inline void Connection::scale_capacitance(float scale){ + if(load.has_value()){ + load = (*load)*scale; + } +} + + +inline void Net::scale_capacitance(float scale){ + lcap *= scale; + for(auto &c : connections){ + c.scale_capacitance(scale); + } + + for(auto &cap : caps){ + std::get<2>(cap) *= scale; + } +} + +inline void Net::scale_resistance(float scale){ + for(auto &res : ress){ + std::get<2>(res) *= scale; + } +} + +// -------------------------------------------------------- +// Begin Spef definition +// -------------------------------------------------------- + +inline void Spef::scale_capacitance(float scale){ + for(auto &n : nets){ + n.scale_capacitance(scale); + } +} + +inline void Spef::scale_resistance(float scale){ + for(auto &n : nets){ + n.scale_resistance(scale); + } +} + +inline void Spef::clear(){ + + standard.clear(); + design_name.clear(); + date.clear(); + vendor.clear(); + program.clear(); + version.clear(); + design_flow.clear(); + divider.clear(); + delimiter.clear(); + bus_delimiter.clear(); + + time_unit.clear(); + capacitance_unit.clear(); + resistance_unit.clear(); + inductance_unit.clear(); + + name_map.clear(); + ports.clear(); + nets.clear(); + + error.reset(); + + _current_net = nullptr; + _tokens.clear(); +} + +// Procedure: dump +// dump the spef data structrue to a SPEF +inline std::string Spef::dump() const { + std::ostringstream os; + dump(os); + return os.str(); +} + +// Procedure: dump +inline void Spef::dump(std::ostream& os) const { + os + << "*SPEF " << standard << '\n' + << "*DESIGN " << design_name << '\n' + << "*DATE " << date << '\n' + << "*VENDOR " << vendor << '\n' + << "*PROGRAM " << program << '\n' + << "*VERSION " << version << '\n' + << "*DESIGN_FLOW " << design_flow << '\n' + << "*DIVIDER " << divider << '\n' + << "*DELIMITER " << delimiter << '\n' + << "*BUS_DELIMITER " << bus_delimiter << '\n' + << "*T_UNIT " << time_unit << '\n' + << "*C_UNIT " << capacitance_unit << '\n' + << "*R_UNIT " << resistance_unit << '\n' + << "*L_UNIT " << inductance_unit << '\n' + ; + os << '\n'; + + if(not name_map.empty()){ + os << "*NAME_MAP\n"; + } + for(const auto& [k,v]: name_map){ + os << '*' << k << ' ' << v << '\n'; + } + os << '\n'; + if(not ports.empty()){ + os << "*PORTS\n"; + } + for(const auto& p: ports){ + os << p << '\n'; + } + os << '\n'; + for(const auto& net : nets) { + os << net << '\n'; + } +} + +// Function: dump_compact +inline std::string Spef::dump_compact() const { + std::ostringstream os; + dump_compact(os); + return os.str(); +} + +// Procedure: dump_compact +inline void Spef::dump_compact(std::ostream& os) const { + + if(!name_map.empty()){ + dump(os); + return; + } + + os + << "*SPEF " << standard << '\n' + << "*DESIGN " << design_name << '\n' + << "*DATE " << date << '\n' + << "*VENDOR " << vendor << '\n' + << "*PROGRAM " << program << '\n' + << "*VERSION " << version << '\n' + << "*DESIGN_FLOW " << design_flow << '\n' + << "*DIVIDER " << divider << '\n' + << "*DELIMITER " << delimiter << '\n' + << "*BUS_DELIMITER " << bus_delimiter << '\n' + << "*T_UNIT " << time_unit << '\n' + << "*C_UNIT " << capacitance_unit << '\n' + << "*R_UNIT " << resistance_unit << '\n' + << "*L_UNIT " << inductance_unit << '\n' + ; + os << '\n'; + + std::vector port_copy = ports; + std::vector net_copy = nets; + std::unordered_map nm; + auto replace_name = [&](std::string& str){ + if(str.empty()) return; + if(auto pos=str.find(delimiter); pos!=std::string::npos){ + auto prefix = str.substr(0, pos); + nm.try_emplace(prefix, nm.size()+1); + str = '*' + std::to_string(nm.at(prefix)) + str.substr(pos, str.size()-pos); + } + else{ + nm.try_emplace(str, nm.size()+1); + str = '*' + std::to_string(nm.at(str)); + } + }; + + // Construct namp map + for(auto&p : port_copy){ + replace_name(p.name); + } + + for(auto&net : net_copy){ + replace_name(net.name); + + for(auto &c : net.connections){ + replace_name(c.name); + replace_name(c.driving_cell); + } + + for(auto &t: net.caps){ + replace_name(std::get<0>(t)); + replace_name(std::get<1>(t)); + } + + for(auto &r: net.ress){ + replace_name(std::get<0>(r)); + replace_name(std::get<1>(r)); + } + } + + if(not nm.empty()){ + os << "*NAME_MAP\n"; + } + for(const auto& [k,v]: nm){ + os << '*' << v << ' ' << k << '\n'; + } + os << '\n'; + + if(not port_copy.empty()){ + os << "*PORTS\n"; + } + for(const auto& p: port_copy){ + os << p << '\n'; + } + os << '\n'; + for(const auto& net : net_copy) { + os << net << '\n'; + } +} + + +// Operator: << +inline std::ostream& operator << (std::ostream& os, const Spef::Error& err) { + os << "error at line " << err.line_number << ":\n"; + os << " " << err.line << '\n'; + os << std::setw(err.byte_in_line + 3) << '^' << '\n'; + return os; +} + +// ------------------------------------------------------------------------------------------------ +// Begin of PEG rules +// ------------------------------------------------------------------------------------------------ + +namespace pegtl = tao::TAO_PEGTL_NAMESPACE; + +using RuleToken = pegtl::until, pegtl::eof>>>; +using RuleDontCare = pegtl::star; +using RuleSpace = pegtl::plus; + +// The double_::rule does not check successive characters after digits. For example: +// 1.243abc still satisfies the double_::rule. This RuleDouble enforce the successive +// characters should be either a space or * +struct RuleDouble : pegtl::seq>>> +{}; + +template +struct Action: pegtl::nothing +{}; + +struct RuleQuote: pegtl::string<'"'> +{}; + +struct RuleQuotedString: pegtl::if_must> +{}; + +struct RuleHeaderValue: pegtl::plus>> +{}; + +struct Divider: pegtl::any +{}; + +template<> +struct Action +{ + template + static bool apply(const Input& in, Spef& d){ + if(in.size() != 1){ + return false; + } + d.divider = in.string(); + return true; + }; +}; + +struct Delimiter: pegtl::any +{}; + +template<> +struct Action +{ + template + static bool apply(const Input& in, Spef& d){ + if(in.size() != 1){ + return false; + } + d.delimiter = in.string(); + return true; + }; +}; + +struct BusDelimiter: pegtl::must, pegtl::any> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.bus_delimiter = in.string(); + // Remove space in middle + d.bus_delimiter.erase(std::remove_if(d.bus_delimiter.begin(), d.bus_delimiter.end(), + [](auto c){return std::isspace(c);}), d.bus_delimiter.end()); + }; +}; + +// Header Section -------------------------------------------------------------------------------- + + +// Procedure: RemoveHeaderKey removes the the key in header and returns the value +// e.g. *SPEF "IEEE 1994" will return "IEEE 1994" (quoted) +// e.g. *DESIGN "simple" will return "simple" (quoted) +template +inline std::string RemoveHeaderKey(const Input&in, size_t offset){ + auto beg = in.begin() + offset; + while(std::isspace(*beg)){ + ++beg; + ++offset; + } + return in.string().erase(0, offset); +} + +struct RuleStandard: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.standard = RemoveHeaderKey(in, sizeof("*SPEF")); + }; +}; + +struct RuleDesign: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.design_name = RemoveHeaderKey(in, sizeof("*DESIGN")); + }; +}; + +struct RuleDate: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.date = RemoveHeaderKey(in, sizeof("*DATE")); + }; +}; + + +struct RuleVendor: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.vendor = RemoveHeaderKey(in, sizeof("VENDOR")); + }; +}; + + +struct RuleProgram: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.program = RemoveHeaderKey(in, sizeof("*PROGRAM")); + }; +}; + +struct RuleVersion: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.version = RemoveHeaderKey(in, sizeof("*VERSION")); + }; +}; + +struct RuleDesignFlow: pegtl::seq> +{}; + +template<> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + d.design_flow = RemoveHeaderKey(in, sizeof("*DESIGN_FLOW")); + }; +}; + +struct RuleDivider : + pegtl::seq> +{}; + +struct RuleDelimiter : + pegtl::seq> +{}; + +struct RuleBusDelimiter : + pegtl::seq> +{}; + +struct RuleUnit : pegtl::seq, + TAO_PEGTL_STRING("_UNIT"), + pegtl::must +> +{}; + +template <> +struct Action +{ + template + static bool apply(const Input& in, Spef& d){ + switch(in.peek_char(1)){ + case 'T': d.time_unit = RemoveHeaderKey(in, sizeof("*T_UNIT")); break; + case 'C': d.capacitance_unit = RemoveHeaderKey(in, sizeof("*C_UNIT")); break; + case 'R': d.resistance_unit = RemoveHeaderKey(in, sizeof("*R_UNIT")); break; + case 'L': d.inductance_unit = RemoveHeaderKey(in, sizeof("*L_UNIT")); break; + default: break; + } + return true; + } +}; + +// Name Map Section ------------------------------------------------------------------------------- +struct RuleNameMapBeg: pegtl::seq +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){} +}; + +struct RuleNameMap: pegtl::seq< + pegtl::not_at, pegtl::not_at, + TAO_PEGTL_STRING("*"), pegtl::must +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + // Skip the '*' + split_on_space(in.begin(), in.end(), d._tokens); + size_t key = ::strtoul(&d._tokens[0][1], nullptr, 10); + d.name_map.try_emplace(key, std::string{d._tokens[1]}); + } +}; + +// Port Section ---------------------------------------------------------------------------------- + +struct RulePortBeg: pegtl::seq +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){} +}; + +struct RulePort: pegtl::seq< + pegtl::not_at, TAO_PEGTL_STRING("*"), + pegtl::must< + RuleToken, RuleSpace, + pegtl::must>, + pegtl::star + >, + pegtl::seq< + RuleSpace, pegtl::seq + >, + pegtl::seq< + RuleSpace, pegtl::seq + > + >> + > +> +{}; + +template <> +struct Action +{ + template + static bool apply(const Input& in, Spef& d){ + split_on_space(in.begin(), in.end(), d._tokens); + + d.ports.emplace_back(std::string{d._tokens[0]}); + + // Set up port direction + switch(d._tokens[1][0]){ + case 'O': + d.ports.back().direction = ConnectionDirection::OUTPUT; + break; + case 'I': + d.ports.back().direction = ConnectionDirection::INPUT; + break; + case 'B': + d.ports.back().direction = ConnectionDirection::INOUT; + break; + default: + return false; + break; + } + + // TODO: + // right now we ignore the values after port direction (future work) + + //// Set up type + //if(d._tokens.size() > 2){ + // p.type = d._tokens[2][1]; + //} + + //// Insert values + //for(size_t i=3; i>>; + +struct RuleConnBeg: pegtl::seq +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + } +}; + +struct RuleConn: pegtl::seq< + pegtl::sor, + RuleSpace, RuleVar, RuleSpace, pegtl::must>, + + pegtl::star>, + + pegtl::seq>, + + pegtl::seq> + > + > +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + auto &c = d._current_net->connections.emplace_back(); + + split_on_space(in.begin(), in.end(), d._tokens); + + c.type = d._tokens[0][1] == 'P' ? ConnectionType::EXTERNAL : ConnectionType::INTERNAL; + c.name = d._tokens[1]; + switch(d._tokens[2][0]){ + case 'I': + c.direction = ConnectionDirection::INPUT; + break; + case 'O': + c.direction = ConnectionDirection::OUTPUT; + break; + default: + c.direction = ConnectionDirection::INOUT; + break; + } + + for(size_t i=3; i +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){} +}; + + +struct RuleCapGround: pegtl::seq< + pegtl::plus, RuleSpace, RuleVar, RuleSpace, RuleDouble +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + split_on_space(in.begin(), in.end(), d._tokens); + // Ignore the first numbering token + d._current_net->caps.emplace_back( + std::forward_as_tuple(d._tokens[1], "", std::strtof(d._tokens[2].data(), nullptr)) + ); + } +}; + +struct RuleCapCouple: pegtl::seq< + pegtl::plus, RuleSpace, RuleVar, RuleSpace, RuleVar, RuleSpace, RuleDouble +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + split_on_space(in.begin(), in.end(), d._tokens); + d._current_net->caps.emplace_back( + std::forward_as_tuple(d._tokens[1], d._tokens[2], std::strtof(d._tokens[3].data(), nullptr)) + ); + } +}; + +struct RuleResBeg: pegtl::seq +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){} +}; + +struct RuleRes: pegtl::seq< + pegtl::plus, RuleSpace, + RuleVar, RuleSpace, RuleVar, RuleSpace, double_::rule +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + split_on_space(in.begin(), in.end(), d._tokens); + d._current_net->ress.emplace_back( + std::forward_as_tuple(d._tokens[1], d._tokens[2], std::strtof(d._tokens[3].data(), nullptr)) + ); + } +}; + +struct RuleNetBeg: pegtl::seq< + TAO_PEGTL_STRING("*D_NET"), pegtl::must +> +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + split_on_space(in.begin(), in.end(), d._tokens); + d._current_net = &(d.nets.emplace_back()); + d._current_net->name = d._tokens[1]; + d._current_net->lcap = std::strtof(d._tokens[2].data(), nullptr); + } +}; + + +struct RuleNetEnd: pegtl::seq +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){} +}; + +struct RuleInputEnd: pegtl::star +{}; + +template <> +struct Action +{ + template + static void apply(const Input& in, Spef& d){ + if(in.size() != 0){ + throw pegtl::parse_error("Unrecognized token", in); + } + } +}; + + +// Spef Top Rule ---------------------------------------------------------------------------------- + +struct RuleSpef: pegtl::must< + pegtl::star, // strip leading space + pegtl::rep_max<10, + pegtl::sor< + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq, + pegtl::seq> + >, + + pegtl::rep_max<4, pegtl::seq>, + + pegtl::opt>>, + + pegtl::opt>>, + + pegtl::star< + pegtl::if_must< + RuleNetBeg, RuleDontCare, + pegtl::opt, pegtl::star>>, + pegtl::opt, + pegtl::star, RuleSpace>>>, + pegtl::opt, pegtl::star>>, + RuleNetEnd, RuleDontCare + > + >, + pegtl::star, // strip trailing spaces + RuleInputEnd // can't have anything more +> +{}; + + +// Error control ---------------------------------------------------------------------------------- + +template +struct Control : tao::pegtl::normal +{ + static const std::string error_message; + + template + static void raise(const Input& in, States&&...) + { + throw tao::pegtl::parse_error(error_message, in); + } +}; + +template +const std::string Control::error_message = + "Fail to match the Spef rule: " + tao::pegtl::internal::demangle() ; + +// API for parsing -------------------------------------------------------------------------------- + + +// Procedure:: file_to_memory reads the content of a file to a string buffer +inline std::string file_to_memory(const std::filesystem::path &p){ + + if(not std::filesystem::exists(p)){ + return ""; + } + + std::ifstream ifs(p); + + ifs.seekg(0, std::ios::end); + std::string buffer; + buffer.resize(ifs.tellg()); + ifs.seekg(0); + ifs.read(&buffer[0], buffer.size()); + ifs.close(); + return buffer; +} + +// Function: read +inline bool Spef::read(const std::filesystem::path &p){ + + auto buffer {file_to_memory(p)}; + + if(buffer.empty()){ + return false; + } + + // Remove comments + for(size_t i=0; i in(buffer, ""); + + try{ + tao::pegtl::parse(in, *this); + return true; + } + catch(const tao::pegtl::parse_error& e){ + const auto& p = e.positions.front(); + error = Error{in.line_as_string(p), p.line, p.byte_in_line}; + return false; + } +} + + + +// Procedure: replace the keys in str by the values in the mapping +inline void expand_string(std::string& str, + const std::unordered_map& mapping){ + if(str.empty() or mapping.empty()) return ; + size_t beg {str.size()}; + size_t end {0}; + size_t last; + size_t key; + char* endptr {nullptr}; + while(beg > 0){ + last = beg; + -- beg; + if(beg = str.find_last_of('*', beg); beg != std::string::npos){ + end = beg+1; + while(end < last and std::isdigit(str[end])){ + ++ end; + } + endptr = (&str.data()[end]); + key = ::strtoul(&str.data()[beg+1], &(endptr), 10); + if(mapping.find(key) != mapping.end()){ + str.replace(beg, end-beg, mapping.at(key)); + } + } + else{ + break; + } + } +} + +// Procedure: expand all mappings in the SPEF file +inline void Spef::expand_name(){ + + if(name_map.empty()) { + return; + } + + for(auto &p: ports){ + expand_name(p); + } + + for(auto &n: nets){ + expand_name(n); + } + + name_map.clear(); +} + +inline void validate_token_spef(std::string& name) { + // remove '\' + std::string::size_type pos = 0; + while ((pos = name.find('\\', pos)) != std::string::npos) { + name.erase(pos, 1); + } + // remove ' ' + pos = 0; + while ((pos = name.find(' ', pos)) != std::string::npos) { + name.erase(pos, 1); + } +} + +// Procedure: expand the mapping in port name +inline void Spef::expand_name(Port& port){ + expand_string(port.name, name_map); + validate_token_spef(port.name); +} + +// Procedure: expand the mapping in a net, including the net name, pin names in each section +inline void Spef::expand_name(Net& net){ + + expand_string(net.name, name_map); + validate_token_spef(net.name); + for(auto &c : net.connections){ + expand_string(c.name, name_map); + expand_string(c.driving_cell, name_map); + validate_token_spef(c.name); + validate_token_spef(c.driving_cell); + } + + for(auto &t: net.caps){ + expand_string(std::get<0>(t), name_map); + expand_string(std::get<1>(t), name_map); + validate_token_spef(std::get<0>(t)); + validate_token_spef(std::get<1>(t)); + } + + for(auto &r: net.ress){ + expand_string(std::get<0>(r), name_map); + expand_string(std::get<1>(r), name_map); + validate_token_spef(std::get<0>(r)); + validate_token_spef(std::get<1>(r)); + } +} + + +}; // end of namespace spef. ---------------------------------------------------------------------- + diff --git a/cpp_to_py/common/lib/spef/pegtl/LICENSE b/cpp_to_py/common/lib/spef/pegtl/LICENSE new file mode 100644 index 0000000..84bd84a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/LICENSE @@ -0,0 +1,21 @@ +The MIT License (MIT) + +Copyright (c) 2007-2018 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. diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl.hpp new file mode 100644 index 0000000..993dfc1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl.hpp @@ -0,0 +1,35 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_HPP +#define TAO_PEGTL_HPP + +#include "pegtl/config.hpp" +#include "pegtl/version.hpp" + +#include "pegtl/ascii.hpp" +#include "pegtl/parse.hpp" +#include "pegtl/rules.hpp" +#include "pegtl/uint16.hpp" +#include "pegtl/uint32.hpp" +#include "pegtl/uint64.hpp" +#include "pegtl/uint8.hpp" +#include "pegtl/utf16.hpp" +#include "pegtl/utf32.hpp" +#include "pegtl/utf8.hpp" + +#include "pegtl/argv_input.hpp" +#include "pegtl/buffer_input.hpp" +#include "pegtl/cstream_input.hpp" +#include "pegtl/file_input.hpp" +#include "pegtl/istream_input.hpp" +#include "pegtl/memory_input.hpp" +#include "pegtl/read_input.hpp" +#include "pegtl/string_input.hpp" + +// The following are not included by +// default because they include . + +// #include "pegtl/analyze.hpp" + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/analyze_cycles.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/analyze_cycles.hpp new file mode 100644 index 0000000..e25f3bb --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/analyze_cycles.hpp @@ -0,0 +1,135 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_ANALYZE_CYCLES_HPP +#define TAO_PEGTL_ANALYSIS_ANALYZE_CYCLES_HPP + +#include + +#include +#include +#include + +#include +#include + +#include "../config.hpp" + +#include "grammar_info.hpp" +#include "insert_guard.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + class analyze_cycles_impl + { + protected: + explicit analyze_cycles_impl( const bool verbose ) noexcept + : m_verbose( verbose ), + m_problems( 0 ) + { + } + + const bool m_verbose; + unsigned m_problems; + grammar_info m_info; + std::set< std::string > m_stack; + std::map< std::string, bool > m_cache; + std::map< std::string, bool > m_results; + + const std::map< std::string, rule_info >::const_iterator find( const std::string& name ) const noexcept + { + const auto iter = m_info.map.find( name ); + assert( iter != m_info.map.end() ); + return iter; + } + + bool work( const std::map< std::string, rule_info >::const_iterator& start, const bool accum ) + { + const auto j = m_cache.find( start->first ); + + if( j != m_cache.end() ) { + return j->second; + } + if( const auto g = make_insert_guard( m_stack, start->first ) ) { + switch( start->second.type ) { + case rule_type::ANY: { + bool a = false; + for( const auto& r : start->second.rules ) { + a = a || work( find( r ), accum || a ); + } + return m_cache[ start->first ] = true; + } + case rule_type::OPT: { + bool a = false; + for( const auto& r : start->second.rules ) { + a = a || work( find( r ), accum || a ); + } + return m_cache[ start->first ] = false; + } + case rule_type::SEQ: { + bool a = false; + for( const auto& r : start->second.rules ) { + a = a || work( find( r ), accum || a ); + } + return m_cache[ start->first ] = a; + } + case rule_type::SOR: { + bool a = true; + for( const auto& r : start->second.rules ) { + a = a && work( find( r ), accum ); + } + return m_cache[ start->first ] = a; + } + } + throw std::logic_error( "code should be unreachable: invalid rule_type value" ); // NOLINT, LCOV_EXCL_LINE + } + if( !accum ) { + ++m_problems; + if( m_verbose ) { + std::cout << "problem: cycle without progress detected at rule class " << start->first << std::endl; // LCOV_EXCL_LINE + } + } + return m_cache[ start->first ] = accum; + } + }; + + template< typename Grammar > + class analyze_cycles + : private analyze_cycles_impl + { + public: + explicit analyze_cycles( const bool verbose ) + : analyze_cycles_impl( verbose ) + { + Grammar::analyze_t::template insert< Grammar >( m_info ); + } + + std::size_t problems() + { + for( auto i = m_info.map.begin(); i != m_info.map.end(); ++i ) { + m_results[ i->first ] = work( i, false ); + m_cache.clear(); + } + return m_problems; + } + + template< typename Rule > + bool consumes() const noexcept + { + const auto i = m_results.find( internal::demangle< Rule >() ); + assert( i != m_results.end() ); + return i->second; + } + }; + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/counted.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/counted.hpp new file mode 100644 index 0000000..6dff5b9 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/counted.hpp @@ -0,0 +1,29 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_COUNTED_HPP +#define TAO_PEGTL_ANALYSIS_COUNTED_HPP + +#include "../config.hpp" + +#include "generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + template< rule_type Type, unsigned Count, typename... Rules > + struct counted + : generic< ( Count != 0 ) ? Type : rule_type::OPT, Rules... > + { + }; + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/generic.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/generic.hpp new file mode 100644 index 0000000..9c0f4e6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/generic.hpp @@ -0,0 +1,39 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_GENERIC_HPP +#define TAO_PEGTL_ANALYSIS_GENERIC_HPP + +#include "../config.hpp" + +#include "grammar_info.hpp" +#include "insert_rules.hpp" +#include "rule_type.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + template< rule_type Type, typename... Rules > + struct generic + { + template< typename Name > + static std::string insert( grammar_info& g ) + { + const auto r = g.insert< Name >( Type ); + if( r.second ) { + insert_rules< Rules... >::insert( g, r.first->second ); + } + return r.first->first; + } + }; + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/grammar_info.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/grammar_info.hpp new file mode 100644 index 0000000..06d73e8 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/grammar_info.hpp @@ -0,0 +1,40 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_GRAMMAR_INFO_HPP +#define TAO_PEGTL_ANALYSIS_GRAMMAR_INFO_HPP + +#include +#include +#include + +#include "../config.hpp" +#include "../internal/demangle.hpp" + +#include "rule_info.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + struct grammar_info + { + using map_t = std::map< std::string, rule_info >; + map_t map; + + template< typename Name > + std::pair< map_t::iterator, bool > insert( const rule_type type ) + { + return map.insert( map_t::value_type( internal::demangle< Name >(), rule_info( type ) ) ); + } + }; + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_guard.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_guard.hpp new file mode 100644 index 0000000..6cd61c8 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_guard.hpp @@ -0,0 +1,68 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_INSERT_GUARD_HPP +#define TAO_PEGTL_ANALYSIS_INSERT_GUARD_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + template< typename C > + class insert_guard + { + public: + insert_guard( C& container, const typename C::value_type& value ) + : m_i( container.insert( value ) ), + m_c( &container ) + { + } + + insert_guard( const insert_guard& ) = delete; + + insert_guard( insert_guard&& other ) noexcept + : m_i( other.m_i ), + m_c( other.m_c ) + { + other.m_c = nullptr; + } + + ~insert_guard() + { + if( m_c && m_i.second ) { + m_c->erase( m_i.first ); + } + } + + void operator=( const insert_guard& ) = delete; + void operator=( insert_guard&& ) = delete; + + explicit operator bool() const noexcept + { + return m_i.second; + } + + private: + const std::pair< typename C::iterator, bool > m_i; + C* m_c; + }; + + template< typename C > + insert_guard< C > make_insert_guard( C& container, const typename C::value_type& value ) + { + return insert_guard< C >( container, value ); + } + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_rules.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_rules.hpp new file mode 100644 index 0000000..6e172b3 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/insert_rules.hpp @@ -0,0 +1,45 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_INSERT_RULES_HPP +#define TAO_PEGTL_ANALYSIS_INSERT_RULES_HPP + +#include "../config.hpp" + +#include "grammar_info.hpp" +#include "rule_info.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace analysis + { + template< typename... > + struct insert_rules; + + template<> + struct insert_rules<> + { + static void insert( grammar_info& /*unused*/, rule_info& /*unused*/ ) + { + } + }; + + template< typename Rule, typename... Rules > + struct insert_rules< Rule, Rules... > + { + static void insert( grammar_info& g, rule_info& r ) + { + r.rules.push_back( Rule::analyze_t::template insert< Rule >( g ) ); + insert_rules< Rules... >::insert( g, r ); + } + }; + + } // namespace analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_info.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_info.hpp new file mode 100644 index 0000000..30af0ed --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_info.hpp @@ -0,0 +1,37 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_RULE_INFO_HPP +#define TAO_PEGTL_ANALYSIS_RULE_INFO_HPP + +#include +#include + +#include "../config.hpp" + +#include "rule_type.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + 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 analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_type.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_type.hpp new file mode 100644 index 0000000..ebd7f4e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analysis/rule_type.hpp @@ -0,0 +1,29 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYSIS_RULE_TYPE_HPP +#define TAO_PEGTL_ANALYSIS_RULE_TYPE_HPP + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + 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 analysis + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/analyze.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/analyze.hpp new file mode 100644 index 0000000..08e0d7b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/analyze.hpp @@ -0,0 +1,25 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ANALYZE_HPP +#define TAO_PEGTL_ANALYZE_HPP + +#include "config.hpp" + +#include "analysis/analyze_cycles.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Rule > + std::size_t analyze( const bool verbose = true ) + { + return analysis::analyze_cycles< Rule >( verbose ).problems(); + } + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/apply_mode.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/apply_mode.hpp new file mode 100644 index 0000000..c403c1b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/apply_mode.hpp @@ -0,0 +1,23 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_APPLY_MODE_HPP +#define TAO_PEGTL_APPLY_MODE_HPP + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + enum class apply_mode : bool + { + ACTION = true, + NOTHING = false + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/argv_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/argv_input.hpp new file mode 100644 index 0000000..de2343c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/argv_input.hpp @@ -0,0 +1,57 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ARGV_INPUT_HPP +#define TAO_PEGTL_ARGV_INPUT_HPP + +#include +#include +#include +#include + +#include "config.hpp" +#include "eol.hpp" +#include "memory_input.hpp" +#include "tracking_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline std::string make_argv_source( const std::size_t argn ) + { + std::ostringstream os; + os << "argv[" << argn << ']'; + return os.str(); + } + + } // namespace internal + + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf > + struct argv_input + : public memory_input< P, Eol > + { + template< typename T > + argv_input( char** argv, const std::size_t argn, T&& in_source ) + : memory_input< P, Eol >( static_cast< const char* >( argv[ argn ] ), std::forward< T >( in_source ) ) + { + } + + argv_input( char** argv, const std::size_t argn ) + : argv_input( argv, argn, internal::make_argv_source( argn ) ) + { + } + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + argv_input( Ts&&... )->argv_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/ascii.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/ascii.hpp new file mode 100644 index 0000000..d1542e6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/ascii.hpp @@ -0,0 +1,68 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ASCII_HPP +#define TAO_PEGTL_ASCII_HPP + +#include "config.hpp" +#include "eol.hpp" + +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + inline namespace ascii + { + // clang-format off + struct alnum : internal::alnum {}; + struct alpha : internal::alpha {}; + struct any : internal::any< internal::peek_char > {}; + struct blank : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ', '\t' > {}; + struct digit : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, '0', '9' > {}; + struct eolf : internal::eolf {}; + struct identifier_first : internal::identifier_first {}; + struct identifier_other : internal::identifier_other {}; + struct identifier : internal::identifier {}; + template< char... Cs > struct istring : internal::istring< Cs... > {}; + template< char... Cs > struct keyword : internal::seq< internal::string< Cs... >, internal::not_at< internal::identifier_other > > {}; + struct lower : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, 'a', 'z' > {}; + template< char... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_char, Cs... > {}; + template< char Lo, char Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_char, Lo, Hi > {}; + struct nul : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, char( 0 ) > {}; + template< char... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, Cs... > {}; + struct print : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, char( 32 ), char( 126 ) > {}; + template< char Lo, char Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, Lo, Hi > {}; + template< char... Cs > struct ranges : internal::ranges< internal::peek_char, Cs... > {}; + struct seven : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, char( 0 ), char( 127 ) > {}; + struct shebang : internal::if_must< false, internal::string< '#', '!' >, internal::until< internal::eolf > > {}; + struct space : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ', '\n', '\r', '\t', '\v', '\f' > {}; + template< char... Cs > struct string : internal::string< Cs... > {}; + template< char C > struct three : internal::three< C > {}; + template< char C > struct two : internal::two< C > {}; + struct upper : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, 'A', 'Z' > {}; + struct xdigit : internal::ranges< internal::peek_char, '0', '9', 'a', 'f', 'A', 'F' > {}; + // clang-format on + + template<> + struct keyword<> + { + template< typename Input > + static bool match( Input& /*unused*/ ) noexcept + { + static_assert( sizeof( Input ) == 0, "empty keywords not allowed" ); + return false; + } + }; + + } // namespace ascii + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#include "internal/pegtl_string.hpp" + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/buffer_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/buffer_input.hpp new file mode 100644 index 0000000..4557aaf --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/buffer_input.hpp @@ -0,0 +1,185 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_BUFFER_INPUT_HPP +#define TAO_PEGTL_BUFFER_INPUT_HPP + +#include +#include +#include +#include +#include + +#include "config.hpp" +#include "eol.hpp" +#include "memory_input.hpp" +#include "position.hpp" +#include "tracking_mode.hpp" + +#include "internal/action_input.hpp" +#include "internal/bump_impl.hpp" +#include "internal/iterator.hpp" +#include "internal/marker.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Reader, typename Eol = eol::lf_crlf, typename Source = std::string > + class buffer_input + { + public: + static constexpr tracking_mode tracking_mode_v = tracking_mode::IMMEDIATE; + using reader_t = Reader; + + using eol_t = Eol; + using source_t = Source; + + using iterator_t = internal::iterator; + + using action_t = internal::action_input< buffer_input >; + + template< typename T, typename... As > + buffer_input( T&& in_source, const std::size_t maximum, As&&... as ) + : m_reader( std::forward< As >( as )... ), + m_maximum( maximum ), + m_buffer( new char[ maximum ] ), + m_current( m_buffer.get() ), + m_end( m_buffer.get() ), + m_source( std::forward< T >( in_source ) ) + { + } + + buffer_input( const buffer_input& ) = delete; + buffer_input( buffer_input&& ) = delete; + + ~buffer_input() = default; + + void operator=( const buffer_input& ) = delete; + void operator=( buffer_input&& ) = delete; + + bool empty() + { + require( 1 ); + return m_current.data == m_end; + } + + std::size_t size( const std::size_t amount ) + { + require( amount ); + return std::size_t( m_end - m_current.data ); + } + + const char* current() const noexcept + { + return m_current.data; + } + + const char* end( const std::size_t amount ) + { + require( amount ); + return m_end; + } + + std::size_t byte() const noexcept + { + return m_current.byte; + } + + std::size_t line() const noexcept + { + return m_current.line; + } + + std::size_t byte_in_line() const noexcept + { + return m_current.byte_in_line; + } + + const Source& source() const noexcept + { + return m_source; + } + + char peek_char( const std::size_t offset = 0 ) const noexcept + { + return m_current.data[ offset ]; + } + + std::uint8_t peek_byte( const std::size_t offset = 0 ) const noexcept + { + return static_cast< std::uint8_t >( peek_char( offset ) ); + } + + void bump( const std::size_t in_count = 1 ) noexcept + { + internal::bump( m_current, in_count, Eol::ch ); + } + + void bump_in_this_line( const std::size_t in_count = 1 ) noexcept + { + internal::bump_in_this_line( m_current, in_count ); + } + + void bump_to_next_line( const std::size_t in_count = 1 ) noexcept + { + internal::bump_to_next_line( m_current, in_count ); + } + + void discard() noexcept + { + const auto s = m_end - m_current.data; + std::memmove( m_buffer.get(), m_current.data, s ); + m_current.data = m_buffer.get(); + m_end = m_buffer.get() + s; + } + + void require( const std::size_t amount ) + { + if( m_current.data + amount > m_end ) { + if( m_current.data + amount <= m_buffer.get() + m_maximum ) { + if( const auto r = m_reader( m_end, amount - std::size_t( m_end - m_current.data ) ) ) { + m_end += r; + } + else { + m_maximum = 0; + } + } + } + } + + template< rewind_mode M > + internal::marker< iterator_t, M > mark() noexcept + { + return internal::marker< iterator_t, M >( m_current ); + } + + TAO_PEGTL_NAMESPACE::position position( const iterator_t& it ) const + { + return TAO_PEGTL_NAMESPACE::position( it, m_source ); + } + + TAO_PEGTL_NAMESPACE::position position() const + { + return position( m_current ); + } + + const iterator_t& iterator() const noexcept + { + return m_current; + } + + private: + Reader m_reader; + std::size_t m_maximum; + std::unique_ptr< char[] > m_buffer; + iterator_t m_current; + char* m_end; + const Source m_source; + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/config.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/config.hpp new file mode 100644 index 0000000..ed8cbd1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/config.hpp @@ -0,0 +1,20 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONFIG_HPP +#define TAO_PEGTL_CONFIG_HPP + +// Compatibility, remove with 3.0 +#ifdef TAOCPP_PEGTL_NAMESPACE +#define TAO_PEGTL_NAMESPACE TAOCPP_PEGTL_NAMESPACE +#endif + +#ifndef TAO_PEGTL_NAMESPACE +#define TAO_PEGTL_NAMESPACE pegtl +#endif + +// Enable some improvements to the readability of +// demangled type names under some circumstances. +// #define TAO_PEGTL_PRETTY_DEMANGLE + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/abnf.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/abnf.hpp new file mode 100644 index 0000000..e006f06 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/abnf.hpp @@ -0,0 +1,43 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ABNF_HPP +#define TAO_PEGTL_CONTRIB_ABNF_HPP + +#include "../config.hpp" +#include "../internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace abnf + { + // Core ABNF rules according to RFC 5234, Appendix B + + // clang-format off + struct ALPHA : internal::ranges< internal::peek_char, 'a', 'z', 'A', 'Z' > {}; + struct BIT : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, '0', '1' > {}; + struct CHAR : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, char( 1 ), char( 127 ) > {}; + struct CR : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, '\r' > {}; + struct CRLF : internal::string< '\r', '\n' > {}; + struct CTL : internal::ranges< internal::peek_char, char( 0 ), char( 31 ), char( 127 ) > {}; + struct DIGIT : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, '0', '9' > {}; + struct DQUOTE : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, '"' > {}; + struct HEXDIG : internal::ranges< internal::peek_char, '0', '9', 'a', 'f', 'A', 'F' > {}; + struct HTAB : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, '\t' > {}; + struct LF : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, '\n' > {}; + struct LWSP : internal::star< internal::sor< internal::string< '\r', '\n' >, internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ', '\t' > >, internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ', '\t' > > {}; + struct OCTET : internal::any< internal::peek_char > {}; + struct SP : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ' > {}; + struct VCHAR : internal::range< internal::result_on_found::SUCCESS, internal::peek_char, char( 33 ), char( 126 ) > {}; + struct WSP : internal::one< internal::result_on_found::SUCCESS, internal::peek_char, ' ', '\t' > {}; + // clang-format on + + } // namespace abnf + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/alphabet.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/alphabet.hpp new file mode 100644 index 0000000..2e0228b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/alphabet.hpp @@ -0,0 +1,75 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ALPHABET_HPP +#define TAO_PEGTL_CONTRIB_ALPHABET_HPP + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace alphabet + { + static const int a = 'a'; + static const int b = 'b'; + static const int c = 'c'; + static const int d = 'd'; + static const int e = 'e'; + static const int f = 'f'; + static const int g = 'g'; + static const int h = 'h'; + static const int i = 'i'; + static const int j = 'j'; + static const int k = 'k'; + static const int l = 'l'; + static const int m = 'm'; + static const int n = 'n'; + static const int o = 'o'; + static const int p = 'p'; + static const int q = 'q'; + static const int r = 'r'; + static const int s = 's'; + static const int t = 't'; + static const int u = 'u'; + static const int v = 'v'; + static const int w = 'w'; + static const int x = 'x'; + static const int y = 'y'; + static const int z = 'z'; + + static const int A = 'A'; + static const int B = 'B'; + static const int C = 'C'; + static const int D = 'D'; + static const int E = 'E'; + static const int F = 'F'; + static const int G = 'G'; + static const int H = 'H'; + static const int I = 'I'; + static const int J = 'J'; + static const int K = 'K'; + static const int L = 'L'; + static const int M = 'M'; + static const int N = 'N'; + static const int O = 'O'; + static const int P = 'P'; + static const int Q = 'Q'; + static const int R = 'R'; + static const int S = 'S'; + static const int T = 'T'; + static const int U = 'U'; + static const int V = 'V'; + static const int W = 'W'; + static const int X = 'X'; + static const int Y = 'Y'; + static const int Z = 'Z'; + + } // namespace alphabet + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/changes.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/changes.hpp new file mode 100644 index 0000000..04a6fbe --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/changes.hpp @@ -0,0 +1,101 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_CHANGES_HPP +#define TAO_PEGTL_CONTRIB_CHANGES_HPP + +#include "../config.hpp" +#include "../normal.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct dummy_disabled_state + { + template< typename... Ts > + void success( Ts&&... /*unused*/ ) const noexcept + { + } + }; + + template< bool > + struct conditional; + + template<> + struct conditional< true > + { + template< typename R, typename > + using type = R; + }; + + template<> + struct conditional< false > + { + template< typename, typename R > + using type = R; + }; + + template< apply_mode A, typename State > + using state_disable_helper = typename conditional< A == apply_mode::ACTION >::template type< State, dummy_disabled_state >; + + } // namespace internal + + template< typename Rule, typename State, template< typename... > class Base = normal > + struct change_state + : public Base< Rule > + { + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + internal::state_disable_helper< A, State > s; + + if( Base< Rule >::template match< A, M, Action, Control >( in, s ) ) { + s.success( st... ); + return true; + } + return false; + } + }; + + template< typename Rule, template< typename... > class Action, template< typename... > class Base = normal > + struct change_action + : public Base< Rule > + { + template< apply_mode A, + rewind_mode M, + template< typename... > class, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return Base< Rule >::template match< A, M, Action, Control >( in, st... ); + } + }; + + template< template< typename... > class Action, template< typename... > class Base > + struct change_both_helper + { + template< typename T > + using change_action = change_action< T, Action, Base >; + }; + + template< typename Rule, typename State, template< typename... > class Action, template< typename... > class Base = normal > + struct change_state_and_action + : public change_state< Rule, State, change_both_helper< Action, Base >::template change_action > + { + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/counter.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/counter.hpp new file mode 100644 index 0000000..111fd38 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/counter.hpp @@ -0,0 +1,58 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_COUNTER_HPP +#define TAO_PEGTL_CONTRIB_COUNTER_HPP + +#include +#include + +#include "../config.hpp" +#include "../normal.hpp" + +#include "../internal/demangle.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + struct counter_data + { + unsigned start = 0; + unsigned success = 0; + unsigned failure = 0; + }; + + struct counter_state + { + std::map< std::string, 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_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/http.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/http.hpp new file mode 100644 index 0000000..c49cb6f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/http.hpp @@ -0,0 +1,151 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_HTTP_HPP +#define TAO_PEGTL_CONTRIB_HTTP_HPP + +#include "../ascii.hpp" +#include "../config.hpp" +#include "../rules.hpp" +#include "../utf8.hpp" + +#include "abnf.hpp" +#include "uri.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace http + { + // HTTP 1.1 grammar according to RFC 7230. + + // This grammar is a direct PEG translation of the original HTTP grammar. + // It should be considered experimental -- in case of any issues, in particular + // missing rules for attached actions, please contact the developers. + + using OWS = star< abnf::WSP >; // optional whitespace + using RWS = plus< abnf::WSP >; // required whitespace + using BWS = OWS; // "bad" whitespace + + // cppcheck-suppress constStatement + using obs_text = not_range< 0x00, 0x7F >; + using obs_fold = seq< abnf::CRLF, plus< abnf::WSP > >; + + // clang-format off + struct tchar : sor< abnf::ALPHA, abnf::DIGIT, one< '!', '#', '$', '%', '&', '\'', '*', '+', '-', '.', '^', '_', '`', '|', '~' > > {}; + struct token : plus< tchar > {}; + + struct field_name : token {}; + + struct field_vchar : sor< abnf::VCHAR, obs_text > {}; + struct field_content : list< field_vchar, plus< abnf::WSP > > {}; + struct field_value : star< sor< field_content, obs_fold > > {}; + + struct header_field : seq< field_name, one< ':' >, OWS, field_value, OWS > {}; + + struct method : token {}; + + struct absolute_path : plus< one< '/' >, uri::segment > {}; + + struct origin_form : seq< absolute_path, uri::opt_query > {}; + struct absolute_form : uri::absolute_URI {}; + struct authority_form : uri::authority {}; + struct asterisk_form : one< '*' > {}; + + struct request_target : sor< origin_form, absolute_form, authority_form, asterisk_form > {}; + + struct status_code : rep< 3, abnf::DIGIT > {}; + struct reason_phrase : star< sor< abnf::VCHAR, obs_text, abnf::WSP > > {}; + + struct HTTP_version : if_must< string< 'H', 'T', 'T', 'P', '/' >, abnf::DIGIT, one< '.' >, abnf::DIGIT > {}; + + struct request_line : if_must< method, abnf::SP, request_target, abnf::SP, HTTP_version, abnf::CRLF > {}; + struct status_line : if_must< HTTP_version, abnf::SP, status_code, abnf::SP, reason_phrase, abnf::CRLF > {}; + struct start_line : sor< status_line, request_line > {}; + + struct message_body : star< abnf::OCTET > {}; + struct HTTP_message : seq< start_line, star< header_field, abnf::CRLF >, abnf::CRLF, opt< message_body > > {}; + + struct Content_Length : plus< abnf::DIGIT > {}; + + struct uri_host : uri::host {}; + struct port : uri::port {}; + + struct Host : seq< uri_host, opt< one< ':' >, port > > {}; + + // PEG are different from CFGs! (this replaces ctext and qdtext) + using text = sor< abnf::HTAB, range< 0x20, 0x7E >, obs_text >; + + struct quoted_pair : if_must< one< '\\' >, sor< abnf::VCHAR, obs_text, abnf::WSP > > {}; + struct quoted_string : if_must< abnf::DQUOTE, until< abnf::DQUOTE, sor< quoted_pair, text > > > {}; + + struct transfer_parameter : seq< token, BWS, one< '=' >, BWS, sor< token, quoted_string > > {}; + struct transfer_extension : seq< token, star< OWS, one< ';' >, OWS, transfer_parameter > > {}; + struct transfer_coding : sor< istring< 'c', 'h', 'u', 'n', 'k', 'e', 'd' >, + istring< 'c', 'o', 'm', 'p', 'r', 'e', 's', 's' >, + istring< 'd', 'e', 'f', 'l', 'a', 't', 'e' >, + istring< 'g', 'z', 'i', 'p' >, + transfer_extension > {}; + + struct rank : sor< seq< one< '0' >, opt< one< '.' >, rep_opt< 3, abnf::DIGIT > > >, + seq< one< '1' >, opt< one< '.' >, rep_opt< 3, one< '0' > > > > > {}; + + struct t_ranking : seq< OWS, one< ';' >, OWS, one< 'q', 'Q' >, one< '=' >, rank > {}; + struct t_codings : sor< istring< 't', 'r', 'a', 'i', 'l', 'e', 'r', 's' >, seq< transfer_coding, opt< t_ranking > > > {}; + + struct TE : opt< sor< one< ',' >, t_codings >, star< OWS, one< ',' >, opt< OWS, t_codings > > > {}; + + template< typename T > + using make_comma_list = seq< star< one< ',' >, OWS >, T, star< OWS, one< ',' >, opt< OWS, T > > >; + + struct connection_option : token {}; + struct Connection : make_comma_list< connection_option > {}; + + struct Trailer : make_comma_list< field_name > {}; + + struct Transfer_Encoding : make_comma_list< transfer_coding > {}; + + struct protocol_name : token {}; + struct protocol_version : token {}; + struct protocol : seq< protocol_name, opt< one< '/' >, protocol_version > > {}; + struct Upgrade : make_comma_list< protocol > {}; + + struct pseudonym : token {}; + + struct received_protocol : seq< opt< protocol_name, one< '/' > >, protocol_version > {}; + struct received_by : sor< seq< uri_host, opt< one< ':' >, port > >, pseudonym > {}; + + struct comment : if_must< one< '(' >, until< one< ')' >, sor< comment, quoted_pair, text > > > {}; + + struct Via : make_comma_list< seq< received_protocol, RWS, received_by, opt< RWS, comment > > > {}; + + struct http_URI : if_must< istring< 'h', 't', 't', 'p', ':', '/', '/' >, uri::authority, uri::path_abempty, uri::opt_query, uri::opt_fragment > {}; + struct https_URI : if_must< istring< 'h', 't', 't', 'p', 's', ':', '/', '/' >, uri::authority, uri::path_abempty, uri::opt_query, uri::opt_fragment > {}; + + struct partial_URI : seq< uri::relative_part, uri::opt_query > {}; + + struct chunk_size : plus< abnf::HEXDIG > {}; + + struct chunk_ext_name : token {}; + struct chunk_ext_val : sor< quoted_string, token > {}; + struct chunk_ext : star_must< one< ';' >, chunk_ext_name, if_must< one< '=' >, chunk_ext_val > > {}; + + struct chunk_data : until< at< abnf::CRLF >, abnf::OCTET > {}; + + struct chunk : seq< chunk_size, opt< chunk_ext >, abnf::CRLF, chunk_data, abnf::CRLF > {}; + + struct last_chunk : seq< plus< one< '0' > >, opt< chunk_ext >, abnf::CRLF > {}; + + struct trailer_part : star< header_field, abnf::CRLF > {}; + + struct chunked_body : seq< until< last_chunk, chunk >, trailer_part, abnf::CRLF > {}; + // clang-format on + + } // namespace http + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/internal.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/internal.hpp new file mode 100644 index 0000000..e1af0bb --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/internal.hpp @@ -0,0 +1,76 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ICU_INTERNAL_HPP +#define TAO_PEGTL_CONTRIB_ICU_INTERNAL_HPP + +#include + +#include "../../config.hpp" + +#include "../../analysis/generic.hpp" +#include "../../internal/skip_control.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + namespace icu + { + template< typename Peek, UProperty P, bool V = true > + struct binary_property + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( Peek::peek( in ) ) ) + { + if( const auto r = Peek::peek( in ) ) { + if( u_hasBinaryProperty( r.data, P ) == V ) { + in.bump( r.size ); + return true; + } + } + return false; + } + }; + + template< typename Peek, UProperty P, int V > + struct property_value + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( Peek::peek( in ) ) ) + { + if( const auto r = Peek::peek( in ) ) { + if( u_getIntPropertyValue( r.data, P ) == V ) { + in.bump( r.size ); + return true; + } + } + return false; + } + }; + + } // namespace icu + + template< typename Peek, UProperty P, bool V > + struct skip_control< icu::binary_property< Peek, P, V > > : std::true_type + { + }; + + template< typename Peek, UProperty P, int V > + struct skip_control< icu::property_value< Peek, P, V > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf16.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf16.hpp new file mode 100644 index 0000000..2412545 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf16.hpp @@ -0,0 +1,212 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ICU_UTF16_HPP +#define TAO_PEGTL_CONTRIB_ICU_UTF16_HPP + +#include "internal.hpp" + +#include "../../config.hpp" +#include "../../utf16.hpp" + +#include "../../internal/peek_utf16.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf16_be + { + namespace icu + { + template< UProperty P, bool V = true > + struct binary_property + : internal::icu::binary_property< internal::peek_utf16_be, P, V > + { + }; + + template< UProperty P, int V > + struct property_value + : internal::icu::property_value< internal::peek_utf16_be, P, V > + { + }; + + // clang-format off + struct alphabetic : binary_property< UCHAR_ALPHABETIC > {}; + struct ascii_hex_digit : binary_property< UCHAR_ASCII_HEX_DIGIT > {}; + struct bidi_control : binary_property< UCHAR_BIDI_CONTROL > {}; + struct bidi_mirrored : binary_property< UCHAR_BIDI_MIRRORED > {}; + struct case_sensitive : binary_property< UCHAR_CASE_SENSITIVE > {}; + struct dash : binary_property< UCHAR_DASH > {}; + struct default_ignorable_code_point : binary_property< UCHAR_DEFAULT_IGNORABLE_CODE_POINT > {}; + struct deprecated : binary_property< UCHAR_DEPRECATED > {}; + struct diacritic : binary_property< UCHAR_DIACRITIC > {}; + struct extender : binary_property< UCHAR_EXTENDER > {}; + struct full_composition_exclusion : binary_property< UCHAR_FULL_COMPOSITION_EXCLUSION > {}; + struct grapheme_base : binary_property< UCHAR_GRAPHEME_BASE > {}; + struct grapheme_extend : binary_property< UCHAR_GRAPHEME_EXTEND > {}; + struct grapheme_link : binary_property< UCHAR_GRAPHEME_LINK > {}; + struct hex_digit : binary_property< UCHAR_HEX_DIGIT > {}; + struct hyphen : binary_property< UCHAR_HYPHEN > {}; + struct id_continue : binary_property< UCHAR_ID_CONTINUE > {}; + struct id_start : binary_property< UCHAR_ID_START > {}; + struct ideographic : binary_property< UCHAR_IDEOGRAPHIC > {}; + struct ids_binary_operator : binary_property< UCHAR_IDS_BINARY_OPERATOR > {}; + struct ids_trinary_operator : binary_property< UCHAR_IDS_TRINARY_OPERATOR > {}; + struct join_control : binary_property< UCHAR_JOIN_CONTROL > {}; + struct logical_order_exception : binary_property< UCHAR_LOGICAL_ORDER_EXCEPTION > {}; + struct lowercase : binary_property< UCHAR_LOWERCASE > {}; + struct math : binary_property< UCHAR_MATH > {}; + struct nfc_inert : binary_property< UCHAR_NFC_INERT > {}; + struct nfd_inert : binary_property< UCHAR_NFD_INERT > {}; + struct nfkc_inert : binary_property< UCHAR_NFKC_INERT > {}; + struct nfkd_inert : binary_property< UCHAR_NFKD_INERT > {}; + struct noncharacter_code_point : binary_property< UCHAR_NONCHARACTER_CODE_POINT > {}; + struct pattern_syntax : binary_property< UCHAR_PATTERN_SYNTAX > {}; + struct pattern_white_space : binary_property< UCHAR_PATTERN_WHITE_SPACE > {}; + struct posix_alnum : binary_property< UCHAR_POSIX_ALNUM > {}; + struct posix_blank : binary_property< UCHAR_POSIX_BLANK > {}; + struct posix_graph : binary_property< UCHAR_POSIX_GRAPH > {}; + struct posix_print : binary_property< UCHAR_POSIX_PRINT > {}; + struct posix_xdigit : binary_property< UCHAR_POSIX_XDIGIT > {}; + struct quotation_mark : binary_property< UCHAR_QUOTATION_MARK > {}; + struct radical : binary_property< UCHAR_RADICAL > {}; + struct s_term : binary_property< UCHAR_S_TERM > {}; + struct segment_starter : binary_property< UCHAR_SEGMENT_STARTER > {}; + struct soft_dotted : binary_property< UCHAR_SOFT_DOTTED > {}; + struct terminal_punctuation : binary_property< UCHAR_TERMINAL_PUNCTUATION > {}; + struct unified_ideograph : binary_property< UCHAR_UNIFIED_IDEOGRAPH > {}; + struct uppercase : binary_property< UCHAR_UPPERCASE > {}; + struct variation_selector : binary_property< UCHAR_VARIATION_SELECTOR > {}; + struct white_space : binary_property< UCHAR_WHITE_SPACE > {}; + struct xid_continue : binary_property< UCHAR_XID_CONTINUE > {}; + struct xid_start : binary_property< UCHAR_XID_START > {}; + + template< UCharDirection V > struct bidi_class : property_value< UCHAR_BIDI_CLASS, V > {}; + template< UBlockCode V > struct block : property_value< UCHAR_BLOCK, V > {}; + template< UDecompositionType V > struct decomposition_type : property_value< UCHAR_DECOMPOSITION_TYPE, V > {}; + template< UEastAsianWidth V > struct east_asian_width : property_value< UCHAR_EAST_ASIAN_WIDTH, V > {}; + template< UCharCategory V > struct general_category : property_value< UCHAR_GENERAL_CATEGORY, V > {}; + template< UGraphemeClusterBreak V > struct grapheme_cluster_break : property_value< UCHAR_GRAPHEME_CLUSTER_BREAK, V > {}; + template< UHangulSyllableType V > struct hangul_syllable_type : property_value< UCHAR_HANGUL_SYLLABLE_TYPE, V > {}; + template< UJoiningGroup V > struct joining_group : property_value< UCHAR_JOINING_GROUP, V > {}; + template< UJoiningType V > struct joining_type : property_value< UCHAR_JOINING_TYPE, V > {}; + template< ULineBreak V > struct line_break : property_value< UCHAR_LINE_BREAK, V > {}; + // UNormalizationCheckResult requires an additional header : + // template< UNormalizationCheckResult V > struct nfc_quick_check : property_value< UCHAR_NFC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfd_quick_check : property_value< UCHAR_NFD_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkc_quick_check : property_value< UCHAR_NFKC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkd_quick_check : property_value< UCHAR_NFKD_QUICK_CHECK, V > {}; + template< UNumericType V > struct numeric_type : property_value< UCHAR_NUMERIC_TYPE, V > {}; + template< USentenceBreak V > struct sentence_break : property_value< UCHAR_SENTENCE_BREAK, V > {}; + template< UWordBreakValues V > struct word_break : property_value< UCHAR_WORD_BREAK, V > {}; + + template< std::uint8_t V > struct canonical_combining_class : property_value< UCHAR_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct lead_canonical_combining_class : property_value< UCHAR_LEAD_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct trail_canonical_combining_class : property_value< UCHAR_TRAIL_CANONICAL_COMBINING_CLASS, V > {}; + // clang-format on + + } // namespace icu + + } // namespace utf16_be + + namespace utf16_le + { + namespace icu + { + template< UProperty P, bool V = true > + struct binary_property + : internal::icu::binary_property< internal::peek_utf16_le, P, V > + { + }; + + template< UProperty P, int V > + struct property_value + : internal::icu::property_value< internal::peek_utf16_le, P, V > + { + }; + + // clang-format off + struct alphabetic : binary_property< UCHAR_ALPHABETIC > {}; + struct ascii_hex_digit : binary_property< UCHAR_ASCII_HEX_DIGIT > {}; + struct bidi_control : binary_property< UCHAR_BIDI_CONTROL > {}; + struct bidi_mirrored : binary_property< UCHAR_BIDI_MIRRORED > {}; + struct case_sensitive : binary_property< UCHAR_CASE_SENSITIVE > {}; + struct dash : binary_property< UCHAR_DASH > {}; + struct default_ignorable_code_point : binary_property< UCHAR_DEFAULT_IGNORABLE_CODE_POINT > {}; + struct deprecated : binary_property< UCHAR_DEPRECATED > {}; + struct diacritic : binary_property< UCHAR_DIACRITIC > {}; + struct extender : binary_property< UCHAR_EXTENDER > {}; + struct full_composition_exclusion : binary_property< UCHAR_FULL_COMPOSITION_EXCLUSION > {}; + struct grapheme_base : binary_property< UCHAR_GRAPHEME_BASE > {}; + struct grapheme_extend : binary_property< UCHAR_GRAPHEME_EXTEND > {}; + struct grapheme_link : binary_property< UCHAR_GRAPHEME_LINK > {}; + struct hex_digit : binary_property< UCHAR_HEX_DIGIT > {}; + struct hyphen : binary_property< UCHAR_HYPHEN > {}; + struct id_continue : binary_property< UCHAR_ID_CONTINUE > {}; + struct id_start : binary_property< UCHAR_ID_START > {}; + struct ideographic : binary_property< UCHAR_IDEOGRAPHIC > {}; + struct ids_binary_operator : binary_property< UCHAR_IDS_BINARY_OPERATOR > {}; + struct ids_trinary_operator : binary_property< UCHAR_IDS_TRINARY_OPERATOR > {}; + struct join_control : binary_property< UCHAR_JOIN_CONTROL > {}; + struct logical_order_exception : binary_property< UCHAR_LOGICAL_ORDER_EXCEPTION > {}; + struct lowercase : binary_property< UCHAR_LOWERCASE > {}; + struct math : binary_property< UCHAR_MATH > {}; + struct nfc_inert : binary_property< UCHAR_NFC_INERT > {}; + struct nfd_inert : binary_property< UCHAR_NFD_INERT > {}; + struct nfkc_inert : binary_property< UCHAR_NFKC_INERT > {}; + struct nfkd_inert : binary_property< UCHAR_NFKD_INERT > {}; + struct noncharacter_code_point : binary_property< UCHAR_NONCHARACTER_CODE_POINT > {}; + struct pattern_syntax : binary_property< UCHAR_PATTERN_SYNTAX > {}; + struct pattern_white_space : binary_property< UCHAR_PATTERN_WHITE_SPACE > {}; + struct posix_alnum : binary_property< UCHAR_POSIX_ALNUM > {}; + struct posix_blank : binary_property< UCHAR_POSIX_BLANK > {}; + struct posix_graph : binary_property< UCHAR_POSIX_GRAPH > {}; + struct posix_print : binary_property< UCHAR_POSIX_PRINT > {}; + struct posix_xdigit : binary_property< UCHAR_POSIX_XDIGIT > {}; + struct quotation_mark : binary_property< UCHAR_QUOTATION_MARK > {}; + struct radical : binary_property< UCHAR_RADICAL > {}; + struct s_term : binary_property< UCHAR_S_TERM > {}; + struct segment_starter : binary_property< UCHAR_SEGMENT_STARTER > {}; + struct soft_dotted : binary_property< UCHAR_SOFT_DOTTED > {}; + struct terminal_punctuation : binary_property< UCHAR_TERMINAL_PUNCTUATION > {}; + struct unified_ideograph : binary_property< UCHAR_UNIFIED_IDEOGRAPH > {}; + struct uppercase : binary_property< UCHAR_UPPERCASE > {}; + struct variation_selector : binary_property< UCHAR_VARIATION_SELECTOR > {}; + struct white_space : binary_property< UCHAR_WHITE_SPACE > {}; + struct xid_continue : binary_property< UCHAR_XID_CONTINUE > {}; + struct xid_start : binary_property< UCHAR_XID_START > {}; + + template< UCharDirection V > struct bidi_class : property_value< UCHAR_BIDI_CLASS, V > {}; + template< UBlockCode V > struct block : property_value< UCHAR_BLOCK, V > {}; + template< UDecompositionType V > struct decomposition_type : property_value< UCHAR_DECOMPOSITION_TYPE, V > {}; + template< UEastAsianWidth V > struct east_asian_width : property_value< UCHAR_EAST_ASIAN_WIDTH, V > {}; + template< UCharCategory V > struct general_category : property_value< UCHAR_GENERAL_CATEGORY, V > {}; + template< UGraphemeClusterBreak V > struct grapheme_cluster_break : property_value< UCHAR_GRAPHEME_CLUSTER_BREAK, V > {}; + template< UHangulSyllableType V > struct hangul_syllable_type : property_value< UCHAR_HANGUL_SYLLABLE_TYPE, V > {}; + template< UJoiningGroup V > struct joining_group : property_value< UCHAR_JOINING_GROUP, V > {}; + template< UJoiningType V > struct joining_type : property_value< UCHAR_JOINING_TYPE, V > {}; + template< ULineBreak V > struct line_break : property_value< UCHAR_LINE_BREAK, V > {}; + // UNormalizationCheckResult requires an additional header : + // template< UNormalizationCheckResult V > struct nfc_quick_check : property_value< UCHAR_NFC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfd_quick_check : property_value< UCHAR_NFD_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkc_quick_check : property_value< UCHAR_NFKC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkd_quick_check : property_value< UCHAR_NFKD_QUICK_CHECK, V > {}; + template< UNumericType V > struct numeric_type : property_value< UCHAR_NUMERIC_TYPE, V > {}; + template< USentenceBreak V > struct sentence_break : property_value< UCHAR_SENTENCE_BREAK, V > {}; + template< UWordBreakValues V > struct word_break : property_value< UCHAR_WORD_BREAK, V > {}; + + template< std::uint8_t V > struct canonical_combining_class : property_value< UCHAR_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct lead_canonical_combining_class : property_value< UCHAR_LEAD_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct trail_canonical_combining_class : property_value< UCHAR_TRAIL_CANONICAL_COMBINING_CLASS, V > {}; + // clang-format on + + } // namespace icu + + } // namespace utf16_le + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf32.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf32.hpp new file mode 100644 index 0000000..95c1a34 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf32.hpp @@ -0,0 +1,212 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ICU_UTF32_HPP +#define TAO_PEGTL_CONTRIB_ICU_UTF32_HPP + +#include "internal.hpp" + +#include "../../config.hpp" +#include "../../utf32.hpp" + +#include "../../internal/peek_utf32.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf32_be + { + namespace icu + { + template< UProperty P, bool V = true > + struct binary_property + : internal::icu::binary_property< internal::peek_utf32_be, P, V > + { + }; + + template< UProperty P, int V > + struct property_value + : internal::icu::property_value< internal::peek_utf32_be, P, V > + { + }; + + // clang-format off + struct alphabetic : binary_property< UCHAR_ALPHABETIC > {}; + struct ascii_hex_digit : binary_property< UCHAR_ASCII_HEX_DIGIT > {}; + struct bidi_control : binary_property< UCHAR_BIDI_CONTROL > {}; + struct bidi_mirrored : binary_property< UCHAR_BIDI_MIRRORED > {}; + struct case_sensitive : binary_property< UCHAR_CASE_SENSITIVE > {}; + struct dash : binary_property< UCHAR_DASH > {}; + struct default_ignorable_code_point : binary_property< UCHAR_DEFAULT_IGNORABLE_CODE_POINT > {}; + struct deprecated : binary_property< UCHAR_DEPRECATED > {}; + struct diacritic : binary_property< UCHAR_DIACRITIC > {}; + struct extender : binary_property< UCHAR_EXTENDER > {}; + struct full_composition_exclusion : binary_property< UCHAR_FULL_COMPOSITION_EXCLUSION > {}; + struct grapheme_base : binary_property< UCHAR_GRAPHEME_BASE > {}; + struct grapheme_extend : binary_property< UCHAR_GRAPHEME_EXTEND > {}; + struct grapheme_link : binary_property< UCHAR_GRAPHEME_LINK > {}; + struct hex_digit : binary_property< UCHAR_HEX_DIGIT > {}; + struct hyphen : binary_property< UCHAR_HYPHEN > {}; + struct id_continue : binary_property< UCHAR_ID_CONTINUE > {}; + struct id_start : binary_property< UCHAR_ID_START > {}; + struct ideographic : binary_property< UCHAR_IDEOGRAPHIC > {}; + struct ids_binary_operator : binary_property< UCHAR_IDS_BINARY_OPERATOR > {}; + struct ids_trinary_operator : binary_property< UCHAR_IDS_TRINARY_OPERATOR > {}; + struct join_control : binary_property< UCHAR_JOIN_CONTROL > {}; + struct logical_order_exception : binary_property< UCHAR_LOGICAL_ORDER_EXCEPTION > {}; + struct lowercase : binary_property< UCHAR_LOWERCASE > {}; + struct math : binary_property< UCHAR_MATH > {}; + struct nfc_inert : binary_property< UCHAR_NFC_INERT > {}; + struct nfd_inert : binary_property< UCHAR_NFD_INERT > {}; + struct nfkc_inert : binary_property< UCHAR_NFKC_INERT > {}; + struct nfkd_inert : binary_property< UCHAR_NFKD_INERT > {}; + struct noncharacter_code_point : binary_property< UCHAR_NONCHARACTER_CODE_POINT > {}; + struct pattern_syntax : binary_property< UCHAR_PATTERN_SYNTAX > {}; + struct pattern_white_space : binary_property< UCHAR_PATTERN_WHITE_SPACE > {}; + struct posix_alnum : binary_property< UCHAR_POSIX_ALNUM > {}; + struct posix_blank : binary_property< UCHAR_POSIX_BLANK > {}; + struct posix_graph : binary_property< UCHAR_POSIX_GRAPH > {}; + struct posix_print : binary_property< UCHAR_POSIX_PRINT > {}; + struct posix_xdigit : binary_property< UCHAR_POSIX_XDIGIT > {}; + struct quotation_mark : binary_property< UCHAR_QUOTATION_MARK > {}; + struct radical : binary_property< UCHAR_RADICAL > {}; + struct s_term : binary_property< UCHAR_S_TERM > {}; + struct segment_starter : binary_property< UCHAR_SEGMENT_STARTER > {}; + struct soft_dotted : binary_property< UCHAR_SOFT_DOTTED > {}; + struct terminal_punctuation : binary_property< UCHAR_TERMINAL_PUNCTUATION > {}; + struct unified_ideograph : binary_property< UCHAR_UNIFIED_IDEOGRAPH > {}; + struct uppercase : binary_property< UCHAR_UPPERCASE > {}; + struct variation_selector : binary_property< UCHAR_VARIATION_SELECTOR > {}; + struct white_space : binary_property< UCHAR_WHITE_SPACE > {}; + struct xid_continue : binary_property< UCHAR_XID_CONTINUE > {}; + struct xid_start : binary_property< UCHAR_XID_START > {}; + + template< UCharDirection V > struct bidi_class : property_value< UCHAR_BIDI_CLASS, V > {}; + template< UBlockCode V > struct block : property_value< UCHAR_BLOCK, V > {}; + template< UDecompositionType V > struct decomposition_type : property_value< UCHAR_DECOMPOSITION_TYPE, V > {}; + template< UEastAsianWidth V > struct east_asian_width : property_value< UCHAR_EAST_ASIAN_WIDTH, V > {}; + template< UCharCategory V > struct general_category : property_value< UCHAR_GENERAL_CATEGORY, V > {}; + template< UGraphemeClusterBreak V > struct grapheme_cluster_break : property_value< UCHAR_GRAPHEME_CLUSTER_BREAK, V > {}; + template< UHangulSyllableType V > struct hangul_syllable_type : property_value< UCHAR_HANGUL_SYLLABLE_TYPE, V > {}; + template< UJoiningGroup V > struct joining_group : property_value< UCHAR_JOINING_GROUP, V > {}; + template< UJoiningType V > struct joining_type : property_value< UCHAR_JOINING_TYPE, V > {}; + template< ULineBreak V > struct line_break : property_value< UCHAR_LINE_BREAK, V > {}; + // UNormalizationCheckResult requires an additional header : + // template< UNormalizationCheckResult V > struct nfc_quick_check : property_value< UCHAR_NFC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfd_quick_check : property_value< UCHAR_NFD_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkc_quick_check : property_value< UCHAR_NFKC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkd_quick_check : property_value< UCHAR_NFKD_QUICK_CHECK, V > {}; + template< UNumericType V > struct numeric_type : property_value< UCHAR_NUMERIC_TYPE, V > {}; + template< USentenceBreak V > struct sentence_break : property_value< UCHAR_SENTENCE_BREAK, V > {}; + template< UWordBreakValues V > struct word_break : property_value< UCHAR_WORD_BREAK, V > {}; + + template< std::uint8_t V > struct canonical_combining_class : property_value< UCHAR_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct lead_canonical_combining_class : property_value< UCHAR_LEAD_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct trail_canonical_combining_class : property_value< UCHAR_TRAIL_CANONICAL_COMBINING_CLASS, V > {}; + // clang-format on + + } // namespace icu + + } // namespace utf32_be + + namespace utf32_le + { + namespace icu + { + template< UProperty P, bool V = true > + struct binary_property + : internal::icu::binary_property< internal::peek_utf32_le, P, V > + { + }; + + template< UProperty P, int V > + struct property_value + : internal::icu::property_value< internal::peek_utf32_le, P, V > + { + }; + + // clang-format off + struct alphabetic : binary_property< UCHAR_ALPHABETIC > {}; + struct ascii_hex_digit : binary_property< UCHAR_ASCII_HEX_DIGIT > {}; + struct bidi_control : binary_property< UCHAR_BIDI_CONTROL > {}; + struct bidi_mirrored : binary_property< UCHAR_BIDI_MIRRORED > {}; + struct case_sensitive : binary_property< UCHAR_CASE_SENSITIVE > {}; + struct dash : binary_property< UCHAR_DASH > {}; + struct default_ignorable_code_point : binary_property< UCHAR_DEFAULT_IGNORABLE_CODE_POINT > {}; + struct deprecated : binary_property< UCHAR_DEPRECATED > {}; + struct diacritic : binary_property< UCHAR_DIACRITIC > {}; + struct extender : binary_property< UCHAR_EXTENDER > {}; + struct full_composition_exclusion : binary_property< UCHAR_FULL_COMPOSITION_EXCLUSION > {}; + struct grapheme_base : binary_property< UCHAR_GRAPHEME_BASE > {}; + struct grapheme_extend : binary_property< UCHAR_GRAPHEME_EXTEND > {}; + struct grapheme_link : binary_property< UCHAR_GRAPHEME_LINK > {}; + struct hex_digit : binary_property< UCHAR_HEX_DIGIT > {}; + struct hyphen : binary_property< UCHAR_HYPHEN > {}; + struct id_continue : binary_property< UCHAR_ID_CONTINUE > {}; + struct id_start : binary_property< UCHAR_ID_START > {}; + struct ideographic : binary_property< UCHAR_IDEOGRAPHIC > {}; + struct ids_binary_operator : binary_property< UCHAR_IDS_BINARY_OPERATOR > {}; + struct ids_trinary_operator : binary_property< UCHAR_IDS_TRINARY_OPERATOR > {}; + struct join_control : binary_property< UCHAR_JOIN_CONTROL > {}; + struct logical_order_exception : binary_property< UCHAR_LOGICAL_ORDER_EXCEPTION > {}; + struct lowercase : binary_property< UCHAR_LOWERCASE > {}; + struct math : binary_property< UCHAR_MATH > {}; + struct nfc_inert : binary_property< UCHAR_NFC_INERT > {}; + struct nfd_inert : binary_property< UCHAR_NFD_INERT > {}; + struct nfkc_inert : binary_property< UCHAR_NFKC_INERT > {}; + struct nfkd_inert : binary_property< UCHAR_NFKD_INERT > {}; + struct noncharacter_code_point : binary_property< UCHAR_NONCHARACTER_CODE_POINT > {}; + struct pattern_syntax : binary_property< UCHAR_PATTERN_SYNTAX > {}; + struct pattern_white_space : binary_property< UCHAR_PATTERN_WHITE_SPACE > {}; + struct posix_alnum : binary_property< UCHAR_POSIX_ALNUM > {}; + struct posix_blank : binary_property< UCHAR_POSIX_BLANK > {}; + struct posix_graph : binary_property< UCHAR_POSIX_GRAPH > {}; + struct posix_print : binary_property< UCHAR_POSIX_PRINT > {}; + struct posix_xdigit : binary_property< UCHAR_POSIX_XDIGIT > {}; + struct quotation_mark : binary_property< UCHAR_QUOTATION_MARK > {}; + struct radical : binary_property< UCHAR_RADICAL > {}; + struct s_term : binary_property< UCHAR_S_TERM > {}; + struct segment_starter : binary_property< UCHAR_SEGMENT_STARTER > {}; + struct soft_dotted : binary_property< UCHAR_SOFT_DOTTED > {}; + struct terminal_punctuation : binary_property< UCHAR_TERMINAL_PUNCTUATION > {}; + struct unified_ideograph : binary_property< UCHAR_UNIFIED_IDEOGRAPH > {}; + struct uppercase : binary_property< UCHAR_UPPERCASE > {}; + struct variation_selector : binary_property< UCHAR_VARIATION_SELECTOR > {}; + struct white_space : binary_property< UCHAR_WHITE_SPACE > {}; + struct xid_continue : binary_property< UCHAR_XID_CONTINUE > {}; + struct xid_start : binary_property< UCHAR_XID_START > {}; + + template< UCharDirection V > struct bidi_class : property_value< UCHAR_BIDI_CLASS, V > {}; + template< UBlockCode V > struct block : property_value< UCHAR_BLOCK, V > {}; + template< UDecompositionType V > struct decomposition_type : property_value< UCHAR_DECOMPOSITION_TYPE, V > {}; + template< UEastAsianWidth V > struct east_asian_width : property_value< UCHAR_EAST_ASIAN_WIDTH, V > {}; + template< UCharCategory V > struct general_category : property_value< UCHAR_GENERAL_CATEGORY, V > {}; + template< UGraphemeClusterBreak V > struct grapheme_cluster_break : property_value< UCHAR_GRAPHEME_CLUSTER_BREAK, V > {}; + template< UHangulSyllableType V > struct hangul_syllable_type : property_value< UCHAR_HANGUL_SYLLABLE_TYPE, V > {}; + template< UJoiningGroup V > struct joining_group : property_value< UCHAR_JOINING_GROUP, V > {}; + template< UJoiningType V > struct joining_type : property_value< UCHAR_JOINING_TYPE, V > {}; + template< ULineBreak V > struct line_break : property_value< UCHAR_LINE_BREAK, V > {}; + // UNormalizationCheckResult requires an additional header : + // template< UNormalizationCheckResult V > struct nfc_quick_check : property_value< UCHAR_NFC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfd_quick_check : property_value< UCHAR_NFD_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkc_quick_check : property_value< UCHAR_NFKC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkd_quick_check : property_value< UCHAR_NFKD_QUICK_CHECK, V > {}; + template< UNumericType V > struct numeric_type : property_value< UCHAR_NUMERIC_TYPE, V > {}; + template< USentenceBreak V > struct sentence_break : property_value< UCHAR_SENTENCE_BREAK, V > {}; + template< UWordBreakValues V > struct word_break : property_value< UCHAR_WORD_BREAK, V > {}; + + template< std::uint8_t V > struct canonical_combining_class : property_value< UCHAR_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct lead_canonical_combining_class : property_value< UCHAR_LEAD_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct trail_canonical_combining_class : property_value< UCHAR_TRAIL_CANONICAL_COMBINING_CLASS, V > {}; + // clang-format on + + } // namespace icu + + } // namespace utf32_le + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf8.hpp new file mode 100644 index 0000000..a2aba56 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/icu/utf8.hpp @@ -0,0 +1,117 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_ICU_UTF8_HPP +#define TAO_PEGTL_CONTRIB_ICU_UTF8_HPP + +#include "internal.hpp" + +#include "../../config.hpp" +#include "../../utf8.hpp" + +#include "../../internal/peek_utf8.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf8 + { + namespace icu + { + template< UProperty P, bool V = true > + struct binary_property + : internal::icu::binary_property< internal::peek_utf8, P, V > + { + }; + + template< UProperty P, int V > + struct property_value + : internal::icu::property_value< internal::peek_utf8, P, V > + { + }; + + // clang-format off + struct alphabetic : binary_property< UCHAR_ALPHABETIC > {}; + struct ascii_hex_digit : binary_property< UCHAR_ASCII_HEX_DIGIT > {}; + struct bidi_control : binary_property< UCHAR_BIDI_CONTROL > {}; + struct bidi_mirrored : binary_property< UCHAR_BIDI_MIRRORED > {}; + struct case_sensitive : binary_property< UCHAR_CASE_SENSITIVE > {}; + struct dash : binary_property< UCHAR_DASH > {}; + struct default_ignorable_code_point : binary_property< UCHAR_DEFAULT_IGNORABLE_CODE_POINT > {}; + struct deprecated : binary_property< UCHAR_DEPRECATED > {}; + struct diacritic : binary_property< UCHAR_DIACRITIC > {}; + struct extender : binary_property< UCHAR_EXTENDER > {}; + struct full_composition_exclusion : binary_property< UCHAR_FULL_COMPOSITION_EXCLUSION > {}; + struct grapheme_base : binary_property< UCHAR_GRAPHEME_BASE > {}; + struct grapheme_extend : binary_property< UCHAR_GRAPHEME_EXTEND > {}; + struct grapheme_link : binary_property< UCHAR_GRAPHEME_LINK > {}; + struct hex_digit : binary_property< UCHAR_HEX_DIGIT > {}; + struct hyphen : binary_property< UCHAR_HYPHEN > {}; + struct id_continue : binary_property< UCHAR_ID_CONTINUE > {}; + struct id_start : binary_property< UCHAR_ID_START > {}; + struct ideographic : binary_property< UCHAR_IDEOGRAPHIC > {}; + struct ids_binary_operator : binary_property< UCHAR_IDS_BINARY_OPERATOR > {}; + struct ids_trinary_operator : binary_property< UCHAR_IDS_TRINARY_OPERATOR > {}; + struct join_control : binary_property< UCHAR_JOIN_CONTROL > {}; + struct logical_order_exception : binary_property< UCHAR_LOGICAL_ORDER_EXCEPTION > {}; + struct lowercase : binary_property< UCHAR_LOWERCASE > {}; + struct math : binary_property< UCHAR_MATH > {}; + struct nfc_inert : binary_property< UCHAR_NFC_INERT > {}; + struct nfd_inert : binary_property< UCHAR_NFD_INERT > {}; + struct nfkc_inert : binary_property< UCHAR_NFKC_INERT > {}; + struct nfkd_inert : binary_property< UCHAR_NFKD_INERT > {}; + struct noncharacter_code_point : binary_property< UCHAR_NONCHARACTER_CODE_POINT > {}; + struct pattern_syntax : binary_property< UCHAR_PATTERN_SYNTAX > {}; + struct pattern_white_space : binary_property< UCHAR_PATTERN_WHITE_SPACE > {}; + struct posix_alnum : binary_property< UCHAR_POSIX_ALNUM > {}; + struct posix_blank : binary_property< UCHAR_POSIX_BLANK > {}; + struct posix_graph : binary_property< UCHAR_POSIX_GRAPH > {}; + struct posix_print : binary_property< UCHAR_POSIX_PRINT > {}; + struct posix_xdigit : binary_property< UCHAR_POSIX_XDIGIT > {}; + struct quotation_mark : binary_property< UCHAR_QUOTATION_MARK > {}; + struct radical : binary_property< UCHAR_RADICAL > {}; + struct s_term : binary_property< UCHAR_S_TERM > {}; + struct segment_starter : binary_property< UCHAR_SEGMENT_STARTER > {}; + struct soft_dotted : binary_property< UCHAR_SOFT_DOTTED > {}; + struct terminal_punctuation : binary_property< UCHAR_TERMINAL_PUNCTUATION > {}; + struct unified_ideograph : binary_property< UCHAR_UNIFIED_IDEOGRAPH > {}; + struct uppercase : binary_property< UCHAR_UPPERCASE > {}; + struct variation_selector : binary_property< UCHAR_VARIATION_SELECTOR > {}; + struct white_space : binary_property< UCHAR_WHITE_SPACE > {}; + struct xid_continue : binary_property< UCHAR_XID_CONTINUE > {}; + struct xid_start : binary_property< UCHAR_XID_START > {}; + + template< UCharDirection V > struct bidi_class : property_value< UCHAR_BIDI_CLASS, V > {}; + template< UBlockCode V > struct block : property_value< UCHAR_BLOCK, V > {}; + template< UDecompositionType V > struct decomposition_type : property_value< UCHAR_DECOMPOSITION_TYPE, V > {}; + template< UEastAsianWidth V > struct east_asian_width : property_value< UCHAR_EAST_ASIAN_WIDTH, V > {}; + template< UCharCategory V > struct general_category : property_value< UCHAR_GENERAL_CATEGORY, V > {}; + template< UGraphemeClusterBreak V > struct grapheme_cluster_break : property_value< UCHAR_GRAPHEME_CLUSTER_BREAK, V > {}; + template< UHangulSyllableType V > struct hangul_syllable_type : property_value< UCHAR_HANGUL_SYLLABLE_TYPE, V > {}; + template< UJoiningGroup V > struct joining_group : property_value< UCHAR_JOINING_GROUP, V > {}; + template< UJoiningType V > struct joining_type : property_value< UCHAR_JOINING_TYPE, V > {}; + template< ULineBreak V > struct line_break : property_value< UCHAR_LINE_BREAK, V > {}; + // UNormalizationCheckResult requires an additional header : + // template< UNormalizationCheckResult V > struct nfc_quick_check : property_value< UCHAR_NFC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfd_quick_check : property_value< UCHAR_NFD_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkc_quick_check : property_value< UCHAR_NFKC_QUICK_CHECK, V > {}; + // template< UNormalizationCheckResult V > struct nfkd_quick_check : property_value< UCHAR_NFKD_QUICK_CHECK, V > {}; + template< UNumericType V > struct numeric_type : property_value< UCHAR_NUMERIC_TYPE, V > {}; + template< USentenceBreak V > struct sentence_break : property_value< UCHAR_SENTENCE_BREAK, V > {}; + template< UWordBreakValues V > struct word_break : property_value< UCHAR_WORD_BREAK, V > {}; + + template< std::uint8_t V > struct canonical_combining_class : property_value< UCHAR_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct lead_canonical_combining_class : property_value< UCHAR_LEAD_CANONICAL_COMBINING_CLASS, V > {}; + template< std::uint8_t V > struct trail_canonical_combining_class : property_value< UCHAR_TRAIL_CANONICAL_COMBINING_CLASS, V > {}; + // clang-format on + + } // namespace icu + + } // namespace utf8 + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/integer.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/integer.hpp new file mode 100644 index 0000000..d619afd --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/integer.hpp @@ -0,0 +1,108 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_INTEGER_HPP +#define TAO_PEGTL_CONTRIB_INTEGER_HPP + +#include +#include + +#include "../ascii.hpp" +#include "../parse_error.hpp" +#include "../rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace integer + { + namespace internal + { + template< typename I, I Limit, typename Input > + I actual_convert( const Input& in, std::size_t index ) + { + static constexpr I cutoff = Limit / 10; + static constexpr I cutlim = Limit % 10; + + I out = in.peek_char( index ) - '0'; + while( ++index < in.size() ) { + const I c = in.peek_char( index ) - '0'; + if( ( out > cutoff ) || ( ( out == cutoff ) && ( c > cutlim ) ) ) { + throw parse_error( "integer out of range", in ); + } + out *= 10; + out += c; + } + return out; + } + + template< typename I, typename Input > + I convert_positive( const Input& in, std::size_t index ) + { + static constexpr I limit = std::numeric_limits< I >::max(); + return actual_convert< I, limit >( in, index ); + } + + template< typename I, typename Input > + I convert_negative( const Input& in, std::size_t index ) + { + using U = typename std::make_unsigned< I >::type; + static constexpr U limit = static_cast< U >( std::numeric_limits< I >::max() ) + 1; + return static_cast< I >( ~actual_convert< U, limit >( in, index ) ) + 1; + } + + } // namespace internal + + struct unsigned_rule + : plus< digit > + { + }; + + struct unsigned_action + { + // Assumes that 'in' contains a non-empty sequence of ASCII digits. + + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + using T = typename std::decay< decltype( st.converted ) >::type; + static_assert( std::is_integral< T >::value, "need integral type" ); + static_assert( std::is_unsigned< T >::value, "need unsigned type" ); + st.converted = internal::convert_positive< T >( in, 0 ); + } + }; + + struct signed_rule + : seq< opt< one< '+', '-' > >, plus< digit > > + { + }; + + struct signed_action + { + // Assumes that 'in' contains a non-empty sequence of ASCII digits, + // with optional leading sign; with sign, in.size() must be >= 2. + + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + using T = typename std::decay< decltype( st.converted ) >::type; + static_assert( std::is_integral< T >::value, "need integral type" ); + static_assert( std::is_signed< T >::value, "need signed type" ); + const auto c = in.peek_char(); + if( c == '-' ) { + st.converted = internal::convert_negative< T >( in, 1 ); + } + else { + st.converted = internal::convert_positive< T >( in, std::size_t( c == '+' ) ); + } + } + }; + + } // namespace integer + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/json.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/json.hpp new file mode 100644 index 0000000..576532c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/json.hpp @@ -0,0 +1,98 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_JSON_HPP +#define TAO_PEGTL_CONTRIB_JSON_HPP + +#include "../ascii.hpp" +#include "../config.hpp" +#include "../rules.hpp" +#include "../utf8.hpp" + +#include "abnf.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace json + { + // JSON grammar according to RFC 8259 + + // clang-format off + struct ws : one< ' ', '\t', '\n', '\r' > {}; + + template< typename R, typename P = ws > + struct padr : internal::seq< R, internal::star< P > > {}; + + struct begin_array : padr< one< '[' > > {}; + struct begin_object : padr< one< '{' > > {}; + struct end_array : one< ']' > {}; + struct end_object : one< '}' > {}; + struct name_separator : pad< one< ':' >, ws > {}; + struct value_separator : padr< one< ',' > > {}; + + struct false_ : string< 'f', 'a', 'l', 's', 'e' > {}; + struct null : string< 'n', 'u', 'l', 'l' > {}; + struct true_ : string< 't', 'r', 'u', 'e' > {}; + + struct digits : plus< abnf::DIGIT > {}; + struct exp : seq< one< 'e', 'E' >, opt< one< '-', '+'> >, must< digits > > {}; + struct frac : if_must< one< '.' >, digits > {}; + struct int_ : sor< one< '0' >, digits > {}; + struct number : seq< opt< one< '-' > >, int_, opt< frac >, opt< exp > > {}; + + struct xdigit : abnf::HEXDIG {}; + struct unicode : list< seq< one< 'u' >, rep< 4, must< xdigit > > >, one< '\\' > > {}; + struct escaped_char : one< '"', '\\', '/', 'b', 'f', 'n', 'r', 't' > {}; + struct escaped : sor< escaped_char, unicode > {}; + struct unescaped : utf8::range< 0x20, 0x10FFFF > {}; + struct char_ : if_then_else< one< '\\' >, must< escaped >, unescaped > {}; + + struct string_content : until< at< one< '"' > >, must< char_ > > {}; + struct string : seq< one< '"' >, must< string_content >, any > + { + using content = string_content; + }; + + struct key_content : until< at< one< '"' > >, must< char_ > > {}; + struct key : seq< one< '"' >, must< key_content >, any > + { + using content = key_content; + }; + + struct value; + + struct array_element; + struct array_content : opt< list_must< array_element, value_separator > > {}; + struct array : seq< begin_array, array_content, must< end_array > > + { + using begin = begin_array; + using end = end_array; + using element = array_element; + using content = array_content; + }; + + struct member : if_must< key, name_separator, value > {}; + struct object_content : opt< list_must< member, value_separator > > {}; + struct object : seq< begin_object, object_content, must< end_object > > + { + using begin = begin_object; + using end = end_object; + using element = member; + using content = object_content; + }; + + struct value : padr< sor< string, number, object, array, false_, true_, null > > {}; + struct array_element : seq< value > {}; + + struct text : seq< star< ws >, value > {}; + // clang-format on + + } // namespace json + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/parse_tree.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/parse_tree.hpp new file mode 100644 index 0000000..905f7cc --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/parse_tree.hpp @@ -0,0 +1,373 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_PARSE_TREE_HPP +#define TAO_PEGTL_CONTRIB_PARSE_TREE_HPP + +#include +#include +#include +#include +#include +#include + +#include "../config.hpp" +#include "../normal.hpp" +#include "../nothing.hpp" +#include "../parse.hpp" + +#include "../internal/demangle.hpp" +#include "../internal/iterator.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace parse_tree + { + template< typename T > + struct basic_node + { + using node_t = T; + using children_t = std::vector< std::unique_ptr< node_t > >; + children_t children; + + const std::type_info* id = nullptr; + std::string source; + + TAO_PEGTL_NAMESPACE::internal::iterator m_begin; + TAO_PEGTL_NAMESPACE::internal::iterator m_end; + + // each node will be default constructed + basic_node() = default; + + // no copy/move is necessary + // (nodes are always owned/handled by a std::unique_ptr) + basic_node( const basic_node& ) = delete; + basic_node( basic_node&& ) = delete; + + ~basic_node() = default; + + // no assignment either + basic_node& operator=( const basic_node& ) = delete; + basic_node& operator=( basic_node&& ) = delete; + + bool is_root() const noexcept + { + return id == nullptr; + } + + template< typename U > + bool is() const noexcept + { + return id == &typeid( U ); + } + + std::string name() const + { + assert( !is_root() ); + return TAO_PEGTL_NAMESPACE::internal::demangle( id->name() ); + } + + position begin() const + { + return position( m_begin, source ); + } + + position end() const + { + return position( m_end, source ); + } + + bool has_content() const noexcept + { + return m_end.data != nullptr; + } + + std::string content() const + { + assert( has_content() ); + return std::string( m_begin.data, m_end.data ); + } + + template< typename... States > + void remove_content( States&&... /*unused*/ ) noexcept + { + m_end.reset(); + } + + // all non-root nodes are initialized by calling this method + template< typename Rule, typename Input, typename... States > + void start( const Input& in, States&&... /*unused*/ ) + { + id = &typeid( Rule ); + source = in.source(); + m_begin = in.iterator(); + } + + // if parsing of the rule succeeded, this method is called + template< typename Rule, typename Input, typename... States > + void success( const Input& in, States&&... /*unused*/ ) noexcept + { + m_end = in.iterator(); + } + + // if parsing of the rule failed, this method is called + template< typename Rule, typename Input, typename... States > + void failure( const Input& /*unused*/, States&&... /*unused*/ ) noexcept + { + } + + // if parsing succeeded and the (optional) transform call + // did not discard the node, it is appended to its parent. + // note that "child" is the node whose Rule just succeeded + // and "*this" is the parent where the node should be appended. + template< typename... States > + void emplace_back( std::unique_ptr< node_t > child, States&&... /*unused*/ ) + { + assert( child ); + children.emplace_back( std::move( child ) ); + } + }; + + struct node + : basic_node< node > + { + }; + + namespace internal + { + template< typename Node > + struct state + { + std::vector< std::unique_ptr< Node > > stack; + + state() + { + emplace_back(); + } + + void emplace_back() + { + stack.emplace_back( std::unique_ptr< Node >( new Node ) ); // NOLINT: std::make_unique requires C++14 + } + + std::unique_ptr< Node >& back() noexcept + { + return stack.back(); + } + + void pop_back() noexcept + { + return stack.pop_back(); + } + }; + + template< typename Node, typename S, typename = void > + struct transform + { + template< typename... States > + static void call( std::unique_ptr< Node >& /*unused*/, States&&... /*unused*/ ) noexcept + { + } + }; + + template< typename Node, typename S > + struct transform< Node, S, decltype( S::transform( std::declval< std::unique_ptr< Node >& >() ), void() ) > + { + template< typename... States > + static void call( std::unique_ptr< Node >& n, States&&... st ) noexcept( noexcept( S::transform( n ) ) ) + { + S::transform( n, st... ); + } + }; + + template< template< typename > class S, template< typename > class C > + struct make_control + { + template< typename Rule, bool > + struct control; + + template< typename Rule > + using type = control< Rule, S< Rule >::value >; + }; + + template< typename Control, template< typename... > class Action, typename Input, typename... States > + struct return_type_apply0 + { + using type = decltype( Control::template apply0< Action >( std::declval< const Input& >(), std::declval< States&& >()... ) ); + }; + + template< typename Control, template< typename... > class Action, typename Iterator, typename Input, typename... States > + struct return_type_apply + { + using type = decltype( Control::template apply< Action >( std::declval< const Iterator& >(), std::declval< const Input& >(), std::declval< States&& >()... ) ); + }; + + template< template< typename > class S, template< typename > class C > + template< typename Rule > + struct make_control< S, C >::control< Rule, false > + : C< Rule > + { + template< typename Input, typename Node, typename... States > + static void start( const Input& in, state< Node >& state, States&&... st ) + { + C< Rule >::start( in, st... ); + state.emplace_back(); + } + + template< typename Input, typename Node, typename... States > + static void success( const Input& in, state< Node >& state, States&&... st ) + { + C< Rule >::success( in, st... ); + auto n = std::move( state.back() ); + state.pop_back(); + for( auto& c : n->children ) { + state.back()->children.emplace_back( std::move( c ) ); + } + } + + template< typename Input, typename Node, typename... States > + static void failure( const Input& in, state< Node >& state, States&&... st ) noexcept( noexcept( C< Rule >::failure( in, st... ) ) ) + { + C< Rule >::failure( in, st... ); + state.pop_back(); + } + + template< typename Input, typename Node, typename... States > + static void raise( const Input& in, state< Node >& /*unused*/, States&&... st ) + { + C< Rule >::raise( in, st... ); + } + + template< template< typename... > class Action, typename Input, typename Node, typename... States > + static typename return_type_apply0< C< Rule >, Action, Input, States... >::type apply0( const Input& in, state< Node >& /*unused*/, States&&... st ) + { + return C< Rule >::template apply0< Action >( in, st... ); + } + + template< template< typename... > class Action, typename Iterator, typename Input, typename Node, typename... States > + static typename return_type_apply< C< Rule >, Action, Iterator, Input, States... >::type apply( const Iterator& begin, const Input& in, state< Node >& /*unused*/, States&&... st ) + { + return C< Rule >::template apply< Action >( begin, in, st... ); + } + }; + + template< template< typename > class S, template< typename > class C > + template< typename Rule > + struct make_control< S, C >::control< Rule, true > + : C< Rule > + { + template< typename Input, typename Node, typename... States > + static void start( const Input& in, state< Node >& state, States&&... st ) + { + C< Rule >::start( in, st... ); + state.emplace_back(); + state.back()->template start< Rule >( in, st... ); + } + + template< typename Input, typename Node, typename... States > + static void success( const Input& in, state< Node >& state, States&&... st ) + { + C< Rule >::success( in, st... ); + auto n = std::move( state.back() ); + state.pop_back(); + n->template success< Rule >( in, st... ); + transform< Node, S< Rule > >::call( n, st... ); + if( n ) { + state.back()->emplace_back( std::move( n ), st... ); + } + } + + template< typename Input, typename Node, typename... States > + static void failure( const Input& in, state< Node >& state, States&&... st ) noexcept( noexcept( C< Rule >::failure( in, st... ) ) && noexcept( std::declval< node& >().template failure< Rule >( in, st... ) ) ) + { + C< Rule >::failure( in, st... ); + state.back()->template failure< Rule >( in, st... ); + state.pop_back(); + } + + template< typename Input, typename Node, typename... States > + static void raise( const Input& in, state< Node >& /*unused*/, States&&... st ) + { + C< Rule >::raise( in, st... ); + } + + template< template< typename... > class Action, typename Input, typename Node, typename... States > + static typename return_type_apply0< C< Rule >, Action, Input, States... >::type apply0( const Input& in, state< Node >& /*unused*/, States&&... st ) + { + return C< Rule >::template apply0< Action >( in, st... ); + } + + template< template< typename... > class Action, typename Iterator, typename Input, typename Node, typename... States > + static typename return_type_apply< C< Rule >, Action, Iterator, Input, States... >::type apply( const Iterator& begin, const Input& in, state< Node >& /*unused*/, States&&... st ) + { + return C< Rule >::template apply< Action >( begin, in, st... ); + } + }; + + template< typename > + struct store_all : std::true_type + { + }; + + } // namespace internal + + // some nodes don't need to store their content + struct remove_content : std::true_type + { + template< typename Node, typename... States > + static void transform( std::unique_ptr< Node >& n, States&&... st ) noexcept( noexcept( n->Node::remove_content( st... ) ) ) + { + n->remove_content( st... ); + } + }; + + // if a node has only one child, replace the node with its child + struct fold_one : std::true_type + { + template< typename Node, typename... States > + static void transform( std::unique_ptr< Node >& n, States&&... /*unused*/ ) noexcept( noexcept( n->children.size(), n->children.front() ) ) + { + if( n->children.size() == 1 ) { + n = std::move( n->children.front() ); + } + } + }; + + // if a node has no children, discard the node + struct discard_empty : std::true_type + { + template< typename Node, typename... States > + static void transform( std::unique_ptr< Node >& n, States&&... /*unused*/ ) noexcept( noexcept( n->children.empty() ) ) + { + if( n->children.empty() ) { + n.reset(); + } + } + }; + + template< typename Rule, typename Node, template< typename > class S = internal::store_all, template< typename > class C = normal, typename Input, typename... States > + std::unique_ptr< Node > parse( Input&& in, States&&... st ) + { + internal::state< Node > state; + if( !TAO_PEGTL_NAMESPACE::parse< Rule, nothing, internal::make_control< S, C >::template type >( in, state, st... ) ) { + return nullptr; + } + assert( state.stack.size() == 1 ); + return std::move( state.back() ); + } + + template< typename Rule, template< typename > class S = internal::store_all, template< typename > class C = normal, typename Input, typename... States > + std::unique_ptr< node > parse( Input&& in, States&&... st ) + { + return parse< Rule, node, S, C >( in, st... ); + } + + } // namespace parse_tree + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/raw_string.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/raw_string.hpp new file mode 100644 index 0000000..9de8867 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/raw_string.hpp @@ -0,0 +1,223 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_RAW_STRING_HPP +#define TAO_PEGTL_CONTRIB_RAW_STRING_HPP + +#include +#include + +#include "../apply_mode.hpp" +#include "../config.hpp" +#include "../rewind_mode.hpp" + +#include "../internal/bytes.hpp" +#include "../internal/eof.hpp" +#include "../internal/eol.hpp" +#include "../internal/must.hpp" +#include "../internal/not_at.hpp" +#include "../internal/rule_conjunction.hpp" +#include "../internal/seq.hpp" +#include "../internal/skip_control.hpp" +#include "../internal/star.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< char Open, char Marker > + struct raw_string_open + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input > + static bool match( Input& in, std::size_t& marker_size ) noexcept( noexcept( in.size( 0 ) ) ) + { + if( in.empty() || ( in.peek_char( 0 ) != Open ) ) { + return false; + } + for( std::size_t i = 1; i < in.size( i + 1 ); ++i ) { + switch( const auto c = in.peek_char( i ) ) { + case Open: + marker_size = i + 1; + in.bump_in_this_line( marker_size ); + eol::match( in ); + return true; + case Marker: + break; + default: + return false; + } + } + return false; + } + }; + + template< char Open, char Marker > + struct skip_control< raw_string_open< Open, Marker > > : std::true_type + { + }; + + template< char Marker, char Close > + struct at_raw_string_close + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input > + static bool match( Input& in, const std::size_t& marker_size ) noexcept( noexcept( in.size( 0 ) ) ) + { + if( in.size( marker_size ) < marker_size ) { + return false; + } + if( in.peek_char( 0 ) != Close ) { + return false; + } + if( in.peek_char( marker_size - 1 ) != Close ) { + return false; + } + for( std::size_t i = 0; i < ( marker_size - 2 ); ++i ) { + if( in.peek_char( i + 1 ) != Marker ) { + return false; + } + } + return true; + } + }; + + template< char Marker, char Close > + struct skip_control< at_raw_string_close< Marker, Close > > : std::true_type + { + }; + + template< typename Cond, typename... Rules > + struct raw_string_until; + + template< typename Cond > + struct raw_string_until< Cond > + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, star< not_at< Cond >, not_at< eof >, bytes< 1 > >, Cond >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, const std::size_t& marker_size, States&&... /*unused*/ ) + { + auto m = in.template mark< M >(); + + while( !Control< Cond >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, marker_size ) ) { + if( in.empty() ) { + return false; + } + in.bump(); + } + return m( true ); + } + }; + + template< typename Cond, typename... Rules > + struct raw_string_until + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, star< not_at< Cond >, not_at< eof >, Rules... >, Cond >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, const std::size_t& marker_size, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + while( !Control< Cond >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, marker_size ) ) { + if( in.empty() || ( !rule_conjunction< Rules... >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ) ) { + return false; + } + } + return m( true ); + } + }; + + template< typename Cond, typename... Rules > + struct skip_control< raw_string_until< Cond, Rules... > > : std::true_type + { + }; + + } // namespace internal + + // raw_string matches Lua-style long literals. + // + // The following description was taken from the Lua documentation + // (see http://www.lua.org/docs.html): + // + // - An "opening long bracket of level n" is defined as an opening square + // bracket followed by n equal signs followed by another opening square + // bracket. So, an opening long bracket of level 0 is written as `[[`, + // an opening long bracket of level 1 is written as `[=[`, and so on. + // - A "closing long bracket" is defined similarly; for instance, a closing + // long bracket of level 4 is written as `]====]`. + // - A "long literal" starts with an opening long bracket of any level and + // ends at the first closing long bracket of the same level. It can + // contain any text except a closing bracket of the same level. + // - Literals in this bracketed form can run for several lines, do not + // interpret any escape sequences, and ignore long brackets of any other + // level. + // - For convenience, when the opening long bracket is immediately followed + // by a newline, the newline is not included in the string. + // + // Note that unlike Lua's long literal, a raw_string is customizable to use + // other characters than `[`, `=` and `]` for matching. Also note that Lua + // introduced newline-specific replacements in Lua 5.2, which we do not + // support on the grammar level. + + template< char Open, char Marker, char Close, typename... Contents > + struct raw_string + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + // This is used for binding the apply()-method and for error-reporting + // when a raw string is not closed properly or has invalid content. + struct content + : internal::raw_string_until< internal::at_raw_string_close< Marker, Close >, Contents... > + { + }; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + std::size_t marker_size; + if( internal::raw_string_open< Open, Marker >::template match< A, M, Action, Control >( in, marker_size ) ) { + internal::must< content >::template match< A, M, Action, Control >( in, marker_size, st... ); + in.bump_in_this_line( marker_size ); + return true; + } + return false; + } + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/rep_one_min_max.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/rep_one_min_max.hpp new file mode 100644 index 0000000..99014d0 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/rep_one_min_max.hpp @@ -0,0 +1,72 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_REP_ONE_MIN_MAX_HPP +#define TAO_PEGTL_CONTRIB_REP_ONE_MIN_MAX_HPP + +#include + +#include "../config.hpp" + +#include "../analysis/counted.hpp" + +#include "../internal/bump_help.hpp" +#include "../internal/skip_control.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Min, unsigned Max, char C > + struct rep_one_min_max + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, Min >; + + static_assert( Min <= Max, "invalid rep_one_min_max rule (maximum number of repetitions smaller than minimum)" ); + + template< typename Input > + static bool match( Input& in ) + { + const auto size = in.size( Max + 1 ); + if( size < Min ) { + return false; + } + std::size_t i = 0; + while( ( i < size ) && ( in.peek_char( i ) == C ) ) { + ++i; + } + if( ( Min <= i ) && ( i <= Max ) ) { + bump_help< result_on_found::SUCCESS, Input, char, C >( in, i ); + return true; + } + return false; + } + }; + + template< unsigned Min, unsigned Max, char C > + struct skip_control< rep_one_min_max< Min, Max, C > > : std::true_type + { + }; + + } // namespace internal + + inline namespace ascii + { + template< unsigned Min, unsigned Max, char C > + struct rep_one_min_max : internal::rep_one_min_max< Min, Max, C > + { + }; + + struct ellipsis : internal::rep_one_min_max< 3, 3, '.' > + { + }; + + } // namespace ascii + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/to_string.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/to_string.hpp new file mode 100644 index 0000000..ff60aa0 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/to_string.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_TO_STRING_HPP +#define TAO_PEGTL_CONTRIB_TO_STRING_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename > + struct to_string; + + template< template< char... > class X, char... Cs > + struct to_string< X< Cs... > > + { + static std::string get() + { + const char s[] = { Cs..., 0 }; + return std::string( s, sizeof...( Cs ) ); + } + }; + + } // namespace internal + + template< typename T > + std::string to_string() + { + return internal::to_string< T >::get(); + } + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/tracer.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/tracer.hpp new file mode 100644 index 0000000..05216f7 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/tracer.hpp @@ -0,0 +1,115 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_TRACER_HPP +#define TAO_PEGTL_CONTRIB_TRACER_HPP + +#include +#include +#include +#include +#include + +#include "../config.hpp" +#include "../normal.hpp" + +#include "../internal/demangle.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + struct trace_state + { + unsigned rule = 0; + unsigned line = 0; + std::vector< unsigned > stack; + }; + + template< typename Rule > + struct tracer + : normal< Rule > + { + template< typename Input, typename... States > + static void start( const Input& in, States&&... /*unused*/ ) + { + std::cerr << in.position() << " start " << internal::demangle< Rule >() << std::endl; + } + + template< typename Input > + static void start( const Input& in, trace_state& ts ) + { + std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ++ts.rule << " " << in.position() << " start " << internal::demangle< Rule >() << std::endl; + ts.stack.push_back( ts.rule ); + } + + template< typename Input, typename... States > + static void success( const Input& in, States&&... /*unused*/ ) + { + std::cerr << in.position() << " success " << internal::demangle< Rule >() << std::endl; + } + + template< typename Input > + static void success( const Input& in, trace_state& ts ) + { + assert( !ts.stack.empty() ); + std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ts.stack.back() << " " << in.position() << " success " << internal::demangle< Rule >() << std::endl; + ts.stack.pop_back(); + } + + template< typename Input, typename... States > + static void failure( const Input& in, States&&... /*unused*/ ) + { + std::cerr << in.position() << " failure " << internal::demangle< Rule >() << std::endl; + } + + template< typename Input > + static void failure( const Input& in, trace_state& ts ) + { + assert( !ts.stack.empty() ); + std::cerr << std::setw( 6 ) << ++ts.line << " " << std::setw( 6 ) << ts.stack.back() << " " << in.position() << " failure " << internal::demangle< Rule >() << std::endl; + ts.stack.pop_back(); + } + + template< template< typename... > class Action, typename Input, typename... States > + static auto apply0( const Input& /*unused*/, States&&... st ) + -> decltype( Action< Rule >::apply0( st... ) ) + { + std::cerr << "apply0 " << internal::demangle< Action< Rule > >() << std::endl; + return Action< Rule >::apply0( st... ); + } + + template< template< typename... > class Action, typename Input > + static auto apply0( const Input& /*unused*/, trace_state& ts ) + -> decltype( Action< Rule >::apply0( ts ) ) + { + std::cerr << std::setw( 6 ) << ++ts.line << " " << internal::demangle< Action< Rule > >() << "::apply0()" << std::endl; + return Action< Rule >::apply0( ts ); + } + + template< template< typename... > class Action, typename Iterator, typename Input, typename... States > + static auto apply( const Iterator& begin, const Input& in, States&&... st ) + -> decltype( Action< Rule >::apply( std::declval< typename Input::action_t >(), st... ) ) + { + std::cerr << "apply " << internal::demangle< Action< Rule > >() << std::endl; + using action_t = typename Input::action_t; + const action_t action_input( begin, in ); + return Action< Rule >::apply( action_input, st... ); + } + + template< template< typename... > class Action, typename Iterator, typename Input > + static auto apply( const Iterator& begin, const Input& in, trace_state& ts ) + -> decltype( Action< Rule >::apply( std::declval< typename Input::action_t >(), ts ) ) + { + std::cerr << std::setw( 6 ) << ++ts.line << " " << internal::demangle< Action< Rule > >() << "::apply()" << std::endl; + using action_t = typename Input::action_t; + const action_t action_input( begin, in ); + return Action< Rule >::apply( action_input, ts ); + } + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/unescape.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/unescape.hpp new file mode 100644 index 0000000..1c52e39 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/unescape.hpp @@ -0,0 +1,210 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_UNESCAPE_HPP +#define TAO_PEGTL_CONTRIB_UNESCAPE_HPP + +#include +#include + +#include "../ascii.hpp" +#include "../config.hpp" +#include "../parse_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace unescape + { + struct state + { + std::string unescaped; + }; + + // Utility functions for the unescape actions. + + inline bool utf8_append_utf32( std::string& string, const unsigned utf32 ) + { + if( utf32 <= 0x7f ) { + string += char( utf32 & 0xff ); + return true; + } + if( utf32 <= 0x7ff ) { + char tmp[] = { char( ( ( utf32 & 0x7c0 ) >> 6 ) | 0xc0 ), + char( ( ( utf32 & 0x03f ) ) | 0x80 ) }; + string.append( tmp, sizeof( tmp ) ); + return true; + } + if( utf32 <= 0xffff ) { + if( utf32 >= 0xd800 && utf32 <= 0xdfff ) { + // nope, this is a UTF-16 surrogate + return false; + } + char tmp[] = { char( ( ( utf32 & 0xf000 ) >> 12 ) | 0xe0 ), + char( ( ( utf32 & 0x0fc0 ) >> 6 ) | 0x80 ), + char( ( ( utf32 & 0x003f ) ) | 0x80 ) }; + string.append( tmp, sizeof( tmp ) ); + return true; + } + if( utf32 <= 0x10ffff ) { + char tmp[] = { char( ( ( utf32 & 0x1c0000 ) >> 18 ) | 0xf0 ), + char( ( ( utf32 & 0x03f000 ) >> 12 ) | 0x80 ), + char( ( ( utf32 & 0x000fc0 ) >> 6 ) | 0x80 ), + char( ( ( utf32 & 0x00003f ) ) | 0x80 ) }; + string.append( tmp, sizeof( tmp ) ); + return true; + } + return false; + } + + // This function MUST only be called for characters matching tao::TAO_PEGTL_NAMESPACE::ascii::xdigit! + template< typename I > + I unhex_char( const char c ) + { + switch( c ) { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + return I( c - '0' ); + case 'a': + case 'b': + case 'c': + case 'd': + case 'e': + case 'f': + return I( c - 'a' + 10 ); + case 'A': + case 'B': + case 'C': + case 'D': + case 'E': + case 'F': + return I( c - 'A' + 10 ); + } + throw std::runtime_error( "invalid character in unhex" ); // NOLINT, LCOV_EXCL_LINE + } + + template< typename I > + I unhex_string( const char* begin, const char* end ) + { + I r = 0; + while( begin != end ) { + r <<= 4; + r += unhex_char< I >( *begin++ ); + } + return r; + } + + // Actions for common unescape situations. + + struct append_all + { + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + st.unescaped.append( in.begin(), in.size() ); + } + }; + + // This action MUST be called for a character matching T which MUST be tao::TAO_PEGTL_NAMESPACE::one< ... >. + template< typename T, char... Rs > + struct unescape_c + { + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + assert( in.size() == 1 ); + st.unescaped += apply_one( *in.begin(), static_cast< const T* >( nullptr ) ); + } + + template< char... Qs > + static char apply_one( const char c, const one< Qs... >* /*unused*/ ) + { + static_assert( sizeof...( Qs ) == sizeof...( Rs ), "size mismatch between escaped characters and their mappings" ); + return apply_two( c, { Qs... }, { Rs... } ); + } + + static char apply_two( const char c, const std::initializer_list< char >& q, const std::initializer_list< char >& r ) + { + for( std::size_t i = 0; i < q.size(); ++i ) { + if( *( q.begin() + i ) == c ) { + return *( r.begin() + i ); + } + } + throw std::runtime_error( "invalid character in unescape" ); // NOLINT, LCOV_EXCL_LINE + } + }; + + // See src/example/pegtl/unescape.cpp for why the following two actions + // skip the first input character. They also MUST be called + // with non-empty matched inputs! + + struct unescape_u + { + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + assert( !in.empty() ); // First character MUST be present, usually 'u' or 'U'. + if( !utf8_append_utf32( st.unescaped, unhex_string< unsigned >( in.begin() + 1, in.end() ) ) ) { + throw parse_error( "invalid escaped unicode code point", in ); + } + } + }; + + struct unescape_x + { + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + assert( !in.empty() ); // First character MUST be present, usually 'x'. + st.unescaped += unhex_string< char >( in.begin() + 1, in.end() ); + } + }; + + // The unescape_j action is similar to unescape_u, however unlike + // unescape_u it + // (a) assumes exactly 4 hexdigits per escape sequence, + // (b) accepts multiple consecutive escaped 16-bit values. + // When applied to more than one escape sequence, unescape_j + // translates UTF-16 surrogate pairs in the input into a single + // UTF-8 sequence in st.unescaped, as required for JSON by RFC 8259. + + struct unescape_j + { + template< typename Input, typename State > + static void apply( const Input& in, State& st ) + { + assert( ( ( in.size() + 1 ) % 6 ) == 0 ); // Expects multiple "\\u1234", starting with the first "u". + for( const char* b = in.begin() + 1; b < in.end(); b += 6 ) { + const auto c = unhex_string< unsigned >( b, b + 4 ); + if( ( 0xd800 <= c ) && ( c <= 0xdbff ) && ( b + 6 < in.end() ) ) { + const auto d = unhex_string< unsigned >( b + 6, b + 10 ); + if( ( 0xdc00 <= d ) && ( d <= 0xdfff ) ) { + b += 6; + // note: no need to check the result code, as we are always >= 0x10000 and < 0x110000. + utf8_append_utf32( st.unescaped, ( ( ( c & 0x03ff ) << 10 ) | ( d & 0x03ff ) ) + 0x10000 ); + continue; + } + } + if( !utf8_append_utf32( st.unescaped, c ) ) { + throw parse_error( "invalid escaped unicode code point", in ); + } + } + } + }; + + } // namespace unescape + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/uri.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/uri.hpp new file mode 100644 index 0000000..7f51fad --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/contrib/uri.hpp @@ -0,0 +1,115 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CONTRIB_URI_HPP +#define TAO_PEGTL_CONTRIB_URI_HPP + +#include "../ascii.hpp" +#include "../config.hpp" +#include "../rules.hpp" +#include "../utf8.hpp" + +#include "abnf.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace uri + { + // URI grammar according to RFC 3986. + + // This grammar is a direct PEG translation of the original URI grammar. + // It should be considered experimental -- in case of any issues, in particular + // missing rules for attached actions, please contact the developers. + + // Note that this grammar has multiple top-level rules. + + using dot = one< '.' >; + using colon = one< ':' >; + + // clang-format off + struct dec_octet : sor< one< '0' >, + rep_min_max< 1, 2, abnf::DIGIT >, + seq< one< '1' >, abnf::DIGIT, abnf::DIGIT >, + seq< one< '2' >, range< '0', '4' >, abnf::DIGIT >, + seq< string< '2', '5' >, range< '0', '5' > > > {}; + + struct IPv4address : seq< dec_octet, dot, dec_octet, dot, dec_octet, dot, dec_octet > {}; + + struct h16 : rep_min_max< 1, 4, abnf::HEXDIG > {}; + struct ls32 : sor< seq< h16, colon, h16 >, IPv4address > {}; + + struct dcolon : two< ':' > {}; + + struct IPv6address : sor< seq< rep< 6, h16, colon >, ls32 >, + seq< dcolon, rep< 5, h16, colon >, ls32 >, + seq< opt< h16 >, dcolon, rep< 4, h16, colon >, ls32 >, + seq< opt< h16, opt< colon, h16 > >, dcolon, rep< 3, h16, colon >, ls32 >, + seq< opt< h16, rep_opt< 2, colon, h16 > >, dcolon, rep< 2, h16, colon >, ls32 >, + seq< opt< h16, rep_opt< 3, colon, h16 > >, dcolon, h16, colon, ls32 >, + seq< opt< h16, rep_opt< 4, colon, h16 > >, dcolon, ls32 >, + seq< opt< h16, rep_opt< 5, colon, h16 > >, dcolon, h16 >, + seq< opt< h16, rep_opt< 6, colon, h16 > >, dcolon > > {}; + + struct gen_delims : one< ':', '/', '?', '#', '[', ']', '@' > {}; + struct sub_delims : one< '!', '$', '&', '\'', '(', ')', '*', '+', ',', ';', '=' > {}; + + struct unreserved : sor< abnf::ALPHA, abnf::DIGIT, one< '-', '.', '_', '~' > > {}; + struct reserved : sor< gen_delims, sub_delims > {}; + + struct IPvFuture : if_must< one< 'v' >, plus< abnf::HEXDIG >, dot, plus< sor< unreserved, sub_delims, colon > > > {}; + + struct IP_literal : if_must< one< '[' >, sor< IPvFuture, IPv6address >, one< ']' > > {}; + + struct pct_encoded : if_must< one< '%' >, abnf::HEXDIG, abnf::HEXDIG > {}; + struct pchar : sor< unreserved, pct_encoded, sub_delims, one< ':', '@' > > {}; + + struct query : star< sor< pchar, one< '/', '?' > > > {}; + struct fragment : star< sor< pchar, one< '/', '?' > > > {}; + + struct segment : star< pchar > {}; + struct segment_nz : plus< pchar > {}; + struct segment_nz_nc : plus< sor< unreserved, pct_encoded, sub_delims, one< '@' > > > {}; // non-zero-length segment without any colon ":" + + struct path_abempty : star< one< '/' >, segment > {}; + struct path_absolute : seq< one< '/' >, opt< segment_nz, star< one< '/' >, segment > > > {}; + struct path_noscheme : seq< segment_nz_nc, star< one< '/' >, segment > > {}; + struct path_rootless : seq< segment_nz, star< one< '/' >, segment > > {}; + struct path_empty : success {}; + + struct path : sor< path_noscheme, // begins with a non-colon segment + path_rootless, // begins with a segment + path_absolute, // begins with "/" but not "//" + path_abempty > {}; // begins with "/" or is empty + + struct reg_name : star< sor< unreserved, pct_encoded, sub_delims > > {}; + + struct port : star< abnf::DIGIT > {}; + struct host : sor< IP_literal, IPv4address, reg_name > {}; + struct userinfo : star< sor< unreserved, pct_encoded, sub_delims, colon > > {}; + struct opt_userinfo : opt< userinfo, one< '@' > > {}; + struct authority : seq< opt_userinfo, host, opt< colon, port > > {}; + + struct scheme : seq< abnf::ALPHA, star< sor< abnf::ALPHA, abnf::DIGIT, one< '+', '-', '.' > > > > {}; + + using dslash = two< '/' >; + using opt_query = opt_must< one< '?' >, query >; + using opt_fragment = opt_must< one< '#' >, fragment >; + + struct hier_part : sor< if_must< dslash, authority, path_abempty >, path_rootless, path_absolute, path_empty > {}; + struct relative_part : sor< if_must< dslash, authority, path_abempty >, path_noscheme, path_absolute, path_empty > {}; + struct relative_ref : seq< relative_part, opt_query, opt_fragment > {}; + + struct URI : seq< scheme, one< ':' >, hier_part, opt_query, opt_fragment > {}; + struct URI_reference : sor< URI, relative_ref > {}; + struct absolute_URI : seq< scheme, one< ':' >, hier_part, opt_query > {}; + // clang-format on + + } // namespace uri + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/cstream_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/cstream_input.hpp new file mode 100644 index 0000000..88c1a8e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/cstream_input.hpp @@ -0,0 +1,39 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_CSTREAM_INPUT_HPP +#define TAO_PEGTL_CSTREAM_INPUT_HPP + +#include + +#include "buffer_input.hpp" +#include "config.hpp" +#include "eol.hpp" + +#include "internal/cstream_reader.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Eol = eol::lf_crlf > + struct cstream_input + : buffer_input< internal::cstream_reader, Eol > + { + template< typename T > + cstream_input( std::FILE* in_stream, const std::size_t in_maximum, T&& in_source ) + : buffer_input< internal::cstream_reader, Eol >( std::forward< T >( in_source ), in_maximum, in_stream ) + { + } + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + cstream_input( Ts&&... )->cstream_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/eol.hpp new file mode 100644 index 0000000..29a8a89 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/eol.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_EOL_HPP +#define TAO_PEGTL_EOL_HPP + +#include "config.hpp" + +#include "internal/eol.hpp" + +#include "internal/cr_crlf_eol.hpp" +#include "internal/cr_eol.hpp" +#include "internal/crlf_eol.hpp" +#include "internal/lf_crlf_eol.hpp" +#include "internal/lf_eol.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + inline namespace ascii + { + // this is both a rule and a pseudo-namespace for eol::cr, ... + struct eol : internal::eol + { + // clang-format off + struct cr : internal::cr_eol {}; + struct cr_crlf : internal::cr_crlf_eol {}; + struct crlf : internal::crlf_eol {}; + struct lf : internal::lf_eol {}; + struct lf_crlf : internal::lf_crlf_eol {}; + // clang-format on + }; + + } // namespace ascii + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/eol_pair.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/eol_pair.hpp new file mode 100644 index 0000000..384bea1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/eol_pair.hpp @@ -0,0 +1,22 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_EOL_PAIR_HPP +#define TAO_PEGTL_EOL_PAIR_HPP + +#include +#include + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + using eol_pair = std::pair< bool, std::size_t >; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/file_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/file_input.hpp new file mode 100644 index 0000000..1959a09 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/file_input.hpp @@ -0,0 +1,50 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_FILE_INPUT_HPP +#define TAO_PEGTL_FILE_INPUT_HPP + +#include "config.hpp" +#include "eol.hpp" +#include "tracking_mode.hpp" + +#if defined( __unix__ ) || ( defined( __APPLE__ ) && defined( __MACH__ ) ) +#include // Required for _POSIX_MAPPED_FILES +#endif + +#if defined( _POSIX_MAPPED_FILES ) || defined( _WIN32 ) +#include "mmap_input.hpp" +#else +#include "read_input.hpp" +#endif + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { +#if defined( _POSIX_MAPPED_FILES ) || defined( _WIN32 ) + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf > + struct file_input + : mmap_input< P, Eol > + { + using mmap_input< P, Eol >::mmap_input; + }; +#else + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf > + struct file_input + : read_input< P, Eol > + { + using read_input< P, Eol >::read_input; + }; +#endif + +#ifdef __cpp_deduction_guides + template< typename... Ts > + explicit file_input( Ts&&... )->file_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/input_error.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/input_error.hpp new file mode 100644 index 0000000..eb302c9 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/input_error.hpp @@ -0,0 +1,51 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INPUT_ERROR_HPP +#define TAO_PEGTL_INPUT_ERROR_HPP + +#include +#include +#include + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + struct input_error + : std::runtime_error + { + input_error( const std::string& message, const int in_errorno ) + : std::runtime_error( message ), + errorno( in_errorno ) + { + } + + int errorno; + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#define TAO_PEGTL_INTERNAL_UNWRAP( ... ) __VA_ARGS__ + +#define TAO_PEGTL_THROW_INPUT_ERROR( MESSAGE ) \ + do { \ + const int errorno = errno; \ + std::ostringstream oss; \ + oss << "pegtl: " << TAO_PEGTL_INTERNAL_UNWRAP( MESSAGE ) << " errno " << errorno; \ + throw tao::TAO_PEGTL_NAMESPACE::input_error( oss.str(), errorno ); \ + } while( false ) + +#define TAO_PEGTL_THROW_INPUT_WIN32_ERROR( MESSAGE ) \ + do { \ + const int errorno = GetLastError(); \ + std::ostringstream oss; \ + oss << "pegtl: " << TAO_PEGTL_INTERNAL_UNWRAP( MESSAGE ) << " GetLastError() " << errorno; \ + throw tao::TAO_PEGTL_NAMESPACE::input_error( oss.str(), errorno ); \ + } while( false ) + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action.hpp new file mode 100644 index 0000000..b7a4f6a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ACTION_HPP +#define TAO_PEGTL_INTERNAL_ACTION_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< template< typename... > class Action, typename... Rules > + struct action + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return duseltronik< seq< Rules... >, A, M, Action, Control >::match( in, st... ); + } + }; + + template< template< typename... > class Action, typename... Rules > + struct skip_control< action< Action, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action_input.hpp new file mode 100644 index 0000000..ec15ea1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/action_input.hpp @@ -0,0 +1,114 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ACTION_INPUT_HPP +#define TAO_PEGTL_INTERNAL_ACTION_INPUT_HPP + +#include +#include +#include + +#include "iterator.hpp" + +#include "../config.hpp" +#include "../position.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline const char* begin_c_ptr( const char* p ) noexcept + { + return p; + } + + inline const char* begin_c_ptr( const iterator& it ) noexcept + { + return it.data; + } + + template< typename Input > + class action_input + { + public: + using input_t = Input; + using iterator_t = typename Input::iterator_t; + + action_input( const iterator_t& in_begin, const Input& in_input ) noexcept + : m_begin( in_begin ), + m_input( in_input ) + { + } + + action_input( const action_input& ) = delete; + action_input( action_input&& ) = delete; + + ~action_input() = default; + + action_input& operator=( const action_input& ) = delete; + action_input& operator=( action_input&& ) = delete; + + const iterator_t& iterator() const noexcept + { + return m_begin; + } + + const Input& input() const noexcept + { + return m_input; + } + + const char* begin() const noexcept + { + return begin_c_ptr( iterator() ); + } + + const char* end() const noexcept + { + return input().current(); + } + + bool empty() const noexcept + { + return begin() == end(); + } + + std::size_t size() const noexcept + { + return std::size_t( end() - begin() ); + } + + std::string string() const + { + return std::string( begin(), end() ); + } + + char peek_char( const std::size_t offset = 0 ) const noexcept + { + return begin()[ offset ]; + } + + std::uint8_t peek_byte( const std::size_t offset = 0 ) const noexcept + { + return static_cast< std::uint8_t >( peek_char( offset ) ); + } + + TAO_PEGTL_NAMESPACE::position position() const + { + return input().position( iterator() ); // NOTE: Not efficient with LAZY inputs. + } + + protected: + const iterator_t m_begin; + const Input& m_input; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alnum.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alnum.hpp new file mode 100644 index 0000000..f42fa1a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alnum.hpp @@ -0,0 +1,26 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ALNUM_HPP +#define TAO_PEGTL_INTERNAL_ALNUM_HPP + +#include "../config.hpp" + +#include "peek_char.hpp" +#include "ranges.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + using alnum = ranges< peek_char, 'a', 'z', 'A', 'Z', '0', '9' >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alpha.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alpha.hpp new file mode 100644 index 0000000..b55d1ed --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/alpha.hpp @@ -0,0 +1,26 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ALPHA_HPP +#define TAO_PEGTL_INTERNAL_ALPHA_HPP + +#include "../config.hpp" + +#include "peek_char.hpp" +#include "ranges.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + using alpha = ranges< peek_char, 'a', 'z', 'A', 'Z' >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/any.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/any.hpp new file mode 100644 index 0000000..4c962d7 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/any.hpp @@ -0,0 +1,68 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ANY_HPP +#define TAO_PEGTL_INTERNAL_ANY_HPP + +#include "../config.hpp" + +#include "peek_char.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Peek > + struct any; + + template<> + struct any< peek_char > + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.empty() ) ) + { + if( !in.empty() ) { + in.bump(); + return true; + } + return false; + } + }; + + template< typename Peek > + struct any + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.empty() ) ) + { + if( !in.empty() ) { + if( const auto t = Peek::peek( in ) ) { + in.bump( t.size ); + return true; + } + } + return false; + } + }; + + template< typename Peek > + struct skip_control< any< Peek > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply.hpp new file mode 100644 index 0000000..7954f2f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply.hpp @@ -0,0 +1,92 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_APPLY_HPP +#define TAO_PEGTL_INTERNAL_APPLY_HPP + +#include "../config.hpp" + +#include "apply_single.hpp" +#include "skip_control.hpp" + +#include "../analysis/counted.hpp" +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< apply_mode A, typename... Actions > + struct apply_impl; + + template<> + struct apply_impl< apply_mode::ACTION > + { + template< typename Input, typename... States > + static bool match( Input& /*unused*/, States&&... /*unused*/ ) + { + return true; + } + }; + + template< typename... Actions > + struct apply_impl< apply_mode::ACTION, Actions... > + { + template< typename Input, typename... States > + static bool match( Input& in, States&&... st ) + { + using action_t = typename Input::action_t; + const action_t i2( in.iterator(), in ); // No data -- range is from begin to begin. +#ifdef __cpp_fold_expressions + return ( apply_single< Actions >::match( i2, st... ) && ... ); +#else + bool result = true; + using swallow = bool[]; + (void)swallow{ result = result && apply_single< Actions >::match( i2, st... )... }; + return result; +#endif + } + }; + + template< typename... Actions > + struct apply_impl< apply_mode::NOTHING, Actions... > + { + template< typename Input, typename... States > + static bool match( Input& /*unused*/, States&&... /*unused*/ ) + { + return true; + } + }; + + template< typename... Actions > + struct apply + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, 0 >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return apply_impl< A, Actions... >::match( in, st... ); + } + }; + + template< typename... Actions > + struct skip_control< apply< Actions... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0.hpp new file mode 100644 index 0000000..5a13f6d --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0.hpp @@ -0,0 +1,90 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_APPLY0_HPP +#define TAO_PEGTL_INTERNAL_APPLY0_HPP + +#include "../config.hpp" + +#include "apply0_single.hpp" +#include "skip_control.hpp" + +#include "../analysis/counted.hpp" +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< apply_mode A, typename... Actions > + struct apply0_impl; + + template<> + struct apply0_impl< apply_mode::ACTION > + { + template< typename... States > + static bool match( States&&... /*unused*/ ) noexcept + { + return true; + } + }; + + template< typename... Actions > + struct apply0_impl< apply_mode::ACTION, Actions... > + { + template< typename... States > + static bool match( States&&... st ) + { +#ifdef __cpp_fold_expressions + return ( apply0_single< Actions >::match( st... ) && ... ); +#else + bool result = true; + using swallow = bool[]; + (void)swallow{ result = result && apply0_single< Actions >::match( st... )... }; + return result; +#endif + } + }; + + template< typename... Actions > + struct apply0_impl< apply_mode::NOTHING, Actions... > + { + template< typename... States > + static bool match( States&&... /*unused*/ ) noexcept + { + return true; + } + }; + + template< typename... Actions > + struct apply0 + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, 0 >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& /*unused*/, States&&... st ) + { + return apply0_impl< A, Actions... >::match( st... ); + } + }; + + template< typename... Actions > + struct skip_control< apply0< Actions... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0_single.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0_single.hpp new file mode 100644 index 0000000..06bae4f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply0_single.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_APPLY0_SINGLE_HPP +#define TAO_PEGTL_INTERNAL_APPLY0_SINGLE_HPP + +#include "../config.hpp" + +#include + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Action > + struct apply0_single + { + template< typename... States > + static auto match( States&&... st ) + -> typename std::enable_if< std::is_same< decltype( Action::apply0( st... ) ), void >::value, bool >::type + { + Action::apply0( st... ); + return true; + } + + template< typename... States > + static auto match( States&&... st ) + -> typename std::enable_if< std::is_same< decltype( Action::apply0( st... ) ), bool >::value, bool >::type + { + return Action::apply0( st... ); + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply_single.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply_single.hpp new file mode 100644 index 0000000..9907234 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/apply_single.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_APPLY_SINGLE_HPP +#define TAO_PEGTL_INTERNAL_APPLY_SINGLE_HPP + +#include "../config.hpp" + +#include + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Action > + struct apply_single + { + template< typename Input, typename... States > + static auto match( const Input& i2, States&&... st ) + -> typename std::enable_if< std::is_same< decltype( Action::apply( i2, st... ) ), void >::value, bool >::type + { + Action::apply( i2, st... ); + return true; + } + + template< typename Input, typename... States > + static auto match( const Input& i2, States&&... st ) + -> typename std::enable_if< std::is_same< decltype( Action::apply( i2, st... ) ), bool >::value, bool >::type + { + return Action::apply( i2, st... ); + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/at.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/at.hpp new file mode 100644 index 0000000..b4997c9 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/at.hpp @@ -0,0 +1,62 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_AT_HPP +#define TAO_PEGTL_INTERNAL_AT_HPP + +#include "../config.hpp" + +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct at; + + template<> + struct at<> + : trivial< true > + { + }; + + template< typename... Rules > + struct at + { + using analyze_t = analysis::generic< analysis::rule_type::OPT, Rules... >; + + template< apply_mode, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + const auto m = in.template mark< rewind_mode::REQUIRED >(); + return rule_conjunction< Rules... >::template match< apply_mode::NOTHING, rewind_mode::ACTIVE, Action, Control >( in, st... ); + } + }; + + template< typename... Rules > + struct skip_control< at< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bof.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bof.hpp new file mode 100644 index 0000000..b6c9c21 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bof.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_BOF_HPP +#define TAO_PEGTL_INTERNAL_BOF_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct bof + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept + { + return in.byte() == 0; + } + }; + + template<> + struct skip_control< bof > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bol.hpp new file mode 100644 index 0000000..dda3179 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bol.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_BOL_HPP +#define TAO_PEGTL_INTERNAL_BOL_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct bol + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept + { + return in.byte_in_line() == 0; + } + }; + + template<> + struct skip_control< bol > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_help.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_help.hpp new file mode 100644 index 0000000..b09f2ed --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_help.hpp @@ -0,0 +1,63 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_BUMP_HELP_HPP +#define TAO_PEGTL_INTERNAL_BUMP_HELP_HPP + +#include +#include + +#include "../config.hpp" + +#include "result_on_found.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< bool > + struct bump_impl; + + template<> + struct bump_impl< true > + { + template< typename Input > + static void bump( Input& in, const std::size_t count ) noexcept + { + in.bump( count ); + } + }; + + template<> + struct bump_impl< false > + { + template< typename Input > + static void bump( Input& in, const std::size_t count ) noexcept + { + in.bump_in_this_line( count ); + } + }; + + template< bool... > + struct bool_list + { + }; + + template< bool... Bs > + using bool_and = std::is_same< bool_list< Bs..., true >, bool_list< true, Bs... > >; + + template< result_on_found R, typename Input, typename Char, Char... Cs > + void bump_help( Input& in, const std::size_t count ) noexcept + { + bump_impl< bool_and< ( Cs != Input::eol_t::ch )... >::value != bool( R ) >::bump( in, count ); + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_impl.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_impl.hpp new file mode 100644 index 0000000..ffd904d --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bump_impl.hpp @@ -0,0 +1,53 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_BUMP_IMPL_HPP +#define TAO_PEGTL_INTERNAL_BUMP_IMPL_HPP + +#include "../config.hpp" + +#include "iterator.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline void bump( iterator& iter, const std::size_t count, const int ch ) noexcept + { + for( std::size_t i = 0; i < count; ++i ) { + if( iter.data[ i ] == ch ) { + ++iter.line; + iter.byte_in_line = 0; + } + else { + ++iter.byte_in_line; + } + } + iter.byte += count; + iter.data += count; + } + + inline void bump_in_this_line( iterator& iter, const std::size_t count ) noexcept + { + iter.data += count; + iter.byte += count; + iter.byte_in_line += count; + } + + inline void bump_to_next_line( iterator& iter, const std::size_t count ) noexcept + { + ++iter.line; + iter.byte += count; + iter.byte_in_line = 0; + iter.data += count; + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bytes.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bytes.hpp new file mode 100644 index 0000000..789224c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/bytes.hpp @@ -0,0 +1,46 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_BYTES_HPP +#define TAO_PEGTL_INTERNAL_BYTES_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Num > + struct bytes + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, Num >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 0 ) ) ) + { + if( in.size( Num ) >= Num ) { + in.bump( Num ); + return true; + } + return false; + } + }; + + template< unsigned Num > + struct skip_control< bytes< Num > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/control.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/control.hpp new file mode 100644 index 0000000..88cc5a1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/control.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CONTROL_HPP +#define TAO_PEGTL_INTERNAL_CONTROL_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< template< typename... > class Control, typename... Rules > + struct control + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return duseltronik< seq< Rules... >, A, M, Action, Control >::match( in, st... ); + } + }; + + template< template< typename... > class Control, typename... Rules > + struct skip_control< control< Control, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_crlf_eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_crlf_eol.hpp new file mode 100644 index 0000000..8b83e24 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_crlf_eol.hpp @@ -0,0 +1,40 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CR_CRLF_EOL_HPP +#define TAO_PEGTL_INTERNAL_CR_CRLF_EOL_HPP + +#include "../config.hpp" +#include "../eol_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct cr_crlf_eol + { + static constexpr int ch = '\r'; + + template< typename Input > + static eol_pair match( Input& in ) noexcept( noexcept( in.size( 2 ) ) ) + { + eol_pair p = { false, in.size( 2 ) }; + if( p.second ) { + if( in.peek_char() == '\r' ) { + in.bump_to_next_line( 1 + ( ( p.second > 1 ) && ( in.peek_char( 1 ) == '\n' ) ) ); + p.first = true; + } + } + return p; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_eol.hpp new file mode 100644 index 0000000..ad2bb5e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cr_eol.hpp @@ -0,0 +1,40 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CR_EOL_HPP +#define TAO_PEGTL_INTERNAL_CR_EOL_HPP + +#include "../config.hpp" +#include "../eol_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct cr_eol + { + static constexpr int ch = '\r'; + + template< typename Input > + static eol_pair match( Input& in ) noexcept( noexcept( in.size( 1 ) ) ) + { + eol_pair p = { false, in.size( 1 ) }; + if( p.second ) { + if( in.peek_char() == '\r' ) { + in.bump_to_next_line(); + p.first = true; + } + } + return p; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/crlf_eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/crlf_eol.hpp new file mode 100644 index 0000000..308eca9 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/crlf_eol.hpp @@ -0,0 +1,40 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CRLF_EOL_HPP +#define TAO_PEGTL_INTERNAL_CRLF_EOL_HPP + +#include "../config.hpp" +#include "../eol_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct crlf_eol + { + static constexpr int ch = '\n'; + + template< typename Input > + static eol_pair match( Input& in ) noexcept( noexcept( in.size( 2 ) ) ) + { + eol_pair p = { false, in.size( 2 ) }; + if( p.second > 1 ) { + if( ( in.peek_char() == '\r' ) && ( in.peek_char( 1 ) == '\n' ) ) { + in.bump_to_next_line( 2 ); + p.first = true; + } + } + return p; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstream_reader.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstream_reader.hpp new file mode 100644 index 0000000..756bc54 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstream_reader.hpp @@ -0,0 +1,50 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CSTREAM_READER_HPP +#define TAO_PEGTL_INTERNAL_CSTREAM_READER_HPP + +#include +#include +#include + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct cstream_reader + { + explicit cstream_reader( std::FILE* s ) noexcept + : m_cstream( s ) + { + assert( m_cstream != nullptr ); + } + + std::size_t operator()( char* buffer, const std::size_t length ) + { + if( const auto r = std::fread( buffer, 1, length, m_cstream ) ) { + return r; + } + if( std::feof( m_cstream ) != 0 ) { + return 0; + } + // Please contact us if you know how to provoke the following exception. + // The example on cppreference.com doesn't work, at least not on macOS. + TAO_PEGTL_THROW_INPUT_ERROR( "error in fread() from cstream" ); // LCOV_EXCL_LINE + } + + std::FILE* m_cstream; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstring_reader.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstring_reader.hpp new file mode 100644 index 0000000..e745921 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/cstring_reader.hpp @@ -0,0 +1,49 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_CSTRING_READER_HPP +#define TAO_PEGTL_INTERNAL_CSTRING_READER_HPP + +#include +#include + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct cstring_reader + { + explicit cstring_reader( const char* zero_terminated ) noexcept + : m_cstring( zero_terminated ) + { + assert( m_cstring != nullptr ); + } + + std::size_t operator()( char* buffer, const std::size_t length ) noexcept + { + std::size_t i = 0; + char c; + + while( ( i < length ) && ( ( c = m_cstring[ i ] ) != 0 ) ) { + *buffer++ = c; + ++i; + } + m_cstring += i; + return i; + } + + const char* m_cstring; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle.hpp new file mode 100644 index 0000000..9795f71 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DEMANGLE_HPP +#define TAO_PEGTL_INTERNAL_DEMANGLE_HPP + +#include +#include + +#include "../config.hpp" + +#if defined( __GLIBCXX__ ) +#include "demangle_cxxabi.hpp" +#elif defined( __has_include ) +#if __has_include( ) +#include "demangle_cxxabi.hpp" +#else +#include "demangle_nop.hpp" +#endif +#else +#include "demangle_nop.hpp" +#endif + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename T > + std::string demangle() + { + return demangle( typeid( T ).name() ); + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_cxxabi.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_cxxabi.hpp new file mode 100644 index 0000000..e5ecbf9 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_cxxabi.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DEMANGLE_CXXABI_HPP +#define TAO_PEGTL_INTERNAL_DEMANGLE_CXXABI_HPP + +#include +#include +#include +#include + +#include "../config.hpp" + +#include "demangle_sanitise.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline std::string demangle( const char* symbol ) + { + const std::unique_ptr< char, decltype( &std::free ) > demangled( abi::__cxa_demangle( symbol, nullptr, nullptr, nullptr ), &std::free ); + if( !demangled ) { + return symbol; + } + std::string result( demangled.get() ); +#ifdef TAO_PEGTL_PRETTY_DEMANGLE + demangle_sanitise_chars( result ); // LCOV_EXCL_LINE +#endif + return result; + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_nop.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_nop.hpp new file mode 100644 index 0000000..fe72b88 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_nop.hpp @@ -0,0 +1,28 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DEMANGLE_NOP_HPP +#define TAO_PEGTL_INTERNAL_DEMANGLE_NOP_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline std::string demangle( const char* symbol ) + { + return symbol; + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_sanitise.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_sanitise.hpp new file mode 100644 index 0000000..7dfb599 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/demangle_sanitise.hpp @@ -0,0 +1,48 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DEMANGLE_SANITISE_HPP +#define TAO_PEGTL_INTERNAL_DEMANGLE_SANITISE_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline void demangle_sanitise_chars( std::string& s ) + { + std::string::size_type p; + while( ( p = s.find( "(char)" ) ) != std::string::npos ) { + int c = 0; + std::string::size_type q; + for( q = p + 6; ( q < s.size() ) && ( s[ q ] >= '0' ) && ( s[ q ] <= '9' ); ++q ) { + c *= 10; + c += s[ q ] - '0'; + } + if( c == '\'' ) { + s.replace( p, q - p, "'\\''" ); + } + else if( c == '\\' ) { + s.replace( p, q - p, "'\\\\'" ); + } + else if( ( c < 32 ) || ( c > 126 ) ) { + s.replace( p, 6, std::string() ); + } + else { + s.replace( p, q - p, std::string( 1, '\'' ) + char( c ) + '\'' ); + } + } + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/disable.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/disable.hpp new file mode 100644 index 0000000..90ae99b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/disable.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DISABLE_HPP +#define TAO_PEGTL_INTERNAL_DISABLE_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct disable + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return duseltronik< seq< Rules... >, apply_mode::NOTHING, M, Action, Control >::match( in, st... ); + } + }; + + template< typename... Rules > + struct skip_control< disable< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/discard.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/discard.hpp new file mode 100644 index 0000000..89cb2f1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/discard.hpp @@ -0,0 +1,43 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DISCARD_HPP +#define TAO_PEGTL_INTERNAL_DISCARD_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct discard + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept + { + static_assert( noexcept( in.discard() ), "an input's discard()-method must be noexcept" ); + in.discard(); + return true; + } + }; + + template<> + struct skip_control< discard > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/dusel_mode.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/dusel_mode.hpp new file mode 100644 index 0000000..9fc7a58 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/dusel_mode.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DUSEL_MODE_HPP +#define TAO_PEGTL_INTERNAL_DUSEL_MODE_HPP + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + 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_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/duseltronik.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/duseltronik.hpp new file mode 100644 index 0000000..20099a4 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/duseltronik.hpp @@ -0,0 +1,174 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_DUSELTRONIK_HPP +#define TAO_PEGTL_INTERNAL_DUSELTRONIK_HPP + +#include "../apply_mode.hpp" +#include "../config.hpp" +#include "../rewind_mode.hpp" + +#include "dusel_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + 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 > + static auto match( Input& in, States&&... st ) + -> decltype( Rule::template match< A, M, Action, Control >( in, st... ), true ) + { + return Rule::template match< A, M, Action, Control >( in, st... ); + } + + // NOTE: The additional "int = 0" is a work-around for missing expression SFINAE in VS2015. + + template< typename Input, typename... States, int = 0 > + static auto match( Input& in, States&&... /*unused*/ ) + -> decltype( Rule::match( in ), true ) + { + 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 > + 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 > + 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 > + 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 > + 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 > + 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 internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/enable.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/enable.hpp new file mode 100644 index 0000000..da490c6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/enable.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ENABLE_HPP +#define TAO_PEGTL_INTERNAL_ENABLE_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct enable + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return duseltronik< seq< Rules... >, apply_mode::ACTION, M, Action, Control >::match( in, st... ); + } + }; + + template< typename... Rules > + struct skip_control< enable< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian.hpp new file mode 100644 index 0000000..b70775c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian.hpp @@ -0,0 +1,70 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ENDIAN_HPP +#define TAO_PEGTL_INTERNAL_ENDIAN_HPP + +#include +#include + +#include "../config.hpp" + +#if defined( _WIN32 ) && !defined( __MINGW32__ ) +#include "endian_win.hpp" +#else +#include "endian_gcc.hpp" +#endif + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename N > + N h_to_be( const N n ) noexcept + { + return N( to_and_from_be< sizeof( N ) >::convert( n ) ); + } + + template< typename N > + N be_to_h( const N n ) noexcept + { + return h_to_be( n ); + } + + template< typename N > + N be_to_h( const void* p ) noexcept + { + N n; + std::memcpy( &n, p, sizeof( n ) ); + return internal::be_to_h( n ); + } + + template< typename N > + N h_to_le( const N n ) noexcept + { + return N( to_and_from_le< sizeof( N ) >::convert( n ) ); + } + + template< typename N > + N le_to_h( const N n ) noexcept + { + return h_to_le( n ); + } + + template< typename N > + N le_to_h( const void* p ) noexcept + { + N n; + std::memcpy( &n, p, sizeof( n ) ); + return internal::le_to_h( n ); + } + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_gcc.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_gcc.hpp new file mode 100644 index 0000000..a8c514f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_gcc.hpp @@ -0,0 +1,215 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ENDIAN_GCC_HPP +#define TAO_PEGTL_INTERNAL_ENDIAN_GCC_HPP + +#include +#include + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + +#if not defined( __BYTE_ORDER__ ) +#error No byte order defined! +#elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__ + + template< unsigned S > + struct to_and_from_be + { + template< typename T > + static T convert( const T n ) noexcept + { + return n; + } + }; + + template< unsigned S > + struct to_and_from_le; + + template<> + struct to_and_from_le< 1 > + { + static std::uint8_t convert( const std::uint8_t n ) noexcept + { + return n; + } + + static std::int8_t convert( const std::int8_t n ) noexcept + { + return n; + } + }; + + template<> + struct to_and_from_le< 2 > + { + static std::int16_t convert( const std::int16_t n ) noexcept + { + return __builtin_bswap16( n ); + } + + static std::uint16_t convert( const std::uint16_t n ) noexcept + { + return __builtin_bswap16( n ); + } + }; + + template<> + struct to_and_from_le< 4 > + { + static float convert( float n ) noexcept + { + std::uint32_t u; + std::memcpy( &u, &n, 4 ); + u = convert( u ); + std::memcpy( &n, &u, 4 ); + return n; + } + + static std::int32_t convert( const std::int32_t n ) noexcept + { + return __builtin_bswap32( n ); + } + + static std::uint32_t convert( const std::uint32_t n ) noexcept + { + return __builtin_bswap32( n ); + } + }; + + template<> + struct to_and_from_le< 8 > + { + static double convert( double n ) noexcept + { + std::uint64_t u; + std::memcpy( &u, &n, 8 ); + u = convert( u ); + std::memcpy( &n, &u, 8 ); + return n; + } + + static std::int64_t convert( const std::int64_t n ) noexcept + { + return __builtin_bswap64( n ); + } + + static std::uint64_t convert( const std::uint64_t n ) noexcept + { + return __builtin_bswap64( n ); + } + }; + +#define TAO_PEGTL_NATIVE_ORDER be +#define TAO_PEGTL_NATIVE_UTF16 utf16_be +#define TAO_PEGTL_NATIVE_UTF32 utf32_be + +#elif __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ + + template< unsigned S > + struct to_and_from_le + { + template< typename T > + static T convert( const T n ) noexcept + { + return n; + } + }; + + template< unsigned S > + struct to_and_from_be; + + template<> + struct to_and_from_be< 1 > + { + static std::int8_t convert( const std::int8_t n ) noexcept + { + return n; + } + + static std::uint8_t convert( const std::uint8_t n ) noexcept + { + return n; + } + }; + + template<> + struct to_and_from_be< 2 > + { + static std::int16_t convert( const std::int16_t n ) noexcept + { + return __builtin_bswap16( n ); + } + + static std::uint16_t convert( const std::uint16_t n ) noexcept + { + return __builtin_bswap16( n ); + } + }; + + template<> + struct to_and_from_be< 4 > + { + static float convert( float n ) noexcept + { + std::uint32_t u; + std::memcpy( &u, &n, 4 ); + u = convert( u ); + std::memcpy( &n, &u, 4 ); + return n; + } + + static std::int32_t convert( const std::int32_t n ) noexcept + { + return __builtin_bswap32( n ); + } + + static std::uint32_t convert( const std::uint32_t n ) noexcept + { + return __builtin_bswap32( n ); + } + }; + + template<> + struct to_and_from_be< 8 > + { + static double convert( double n ) noexcept + { + std::uint64_t u; + std::memcpy( &u, &n, 8 ); + u = convert( u ); + std::memcpy( &n, &u, 8 ); + return n; + } + + static std::uint64_t convert( const std::uint64_t n ) noexcept + { + return __builtin_bswap64( n ); + } + + static std::int64_t convert( const std::int64_t n ) noexcept + { + return __builtin_bswap64( n ); + } + }; + +#define TAO_PEGTL_NATIVE_ORDER le +#define TAO_PEGTL_NATIVE_UTF16 utf16_le +#define TAO_PEGTL_NATIVE_UTF32 utf32_le + +#else +#error Unknown host byte order! +#endif + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_win.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_win.hpp new file mode 100644 index 0000000..6b89f5f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/endian_win.hpp @@ -0,0 +1,115 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ENDIAN_WIN_HPP +#define TAO_PEGTL_INTERNAL_ENDIAN_WIN_HPP + +#include +#include + +#include + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned S > + struct to_and_from_le + { + template< typename T > + static T convert( const T t ) noexcept + { + return t; + } + }; + + template< unsigned S > + struct to_and_from_be; + + template<> + struct to_and_from_be< 1 > + { + static std::int8_t convert( const std::int8_t n ) noexcept + { + return n; + } + + static std::uint8_t convert( const std::uint8_t n ) noexcept + { + return n; + } + }; + + template<> + struct to_and_from_be< 2 > + { + static std::int16_t convert( const std::int16_t n ) noexcept + { + return std::int16_t( _byteswap_ushort( std::uint16_t( n ) ) ); + } + + static std::uint16_t convert( const std::uint16_t n ) noexcept + { + return _byteswap_ushort( n ); + } + }; + + template<> + struct to_and_from_be< 4 > + { + static float convert( float n ) noexcept + { + std::uint32_t u; + std::memcpy( &u, &n, 4 ); + u = convert( u ); + std::memcpy( &n, &u, 4 ); + return n; + } + + static std::int32_t convert( const std::int32_t n ) noexcept + { + return std::int32_t( _byteswap_ulong( std::uint32_t( n ) ) ); + } + + static std::uint32_t convert( const std::uint32_t n ) noexcept + { + return _byteswap_ulong( n ); + } + }; + + template<> + struct to_and_from_be< 8 > + { + static double convert( double n ) noexcept + { + std::uint64_t u; + std::memcpy( &u, &n, 8 ); + u = convert( u ); + std::memcpy( &n, &u, 8 ); + return n; + } + + static std::int64_t convert( const std::int64_t n ) noexcept + { + return std::int64_t( _byteswap_uint64( std::uint64_t( n ) ) ); + } + + static std::uint64_t convert( const std::uint64_t n ) noexcept + { + return _byteswap_uint64( n ); + } + }; + +#define TAO_PEGTL_NATIVE_ORDER le +#define TAO_PEGTL_NATIVE_UTF16 utf16_le +#define TAO_PEGTL_NATIVE_UTF32 utf32_le + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eof.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eof.hpp new file mode 100644 index 0000000..51ac283 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eof.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_EOF_HPP +#define TAO_PEGTL_INTERNAL_EOF_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct eof + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.empty() ) ) + { + return in.empty(); + } + }; + + template<> + struct skip_control< eof > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eol.hpp new file mode 100644 index 0000000..9aae616 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eol.hpp @@ -0,0 +1,41 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_EOL_HPP +#define TAO_PEGTL_INTERNAL_EOL_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct eol + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( Input::eol_t::match( in ) ) ) + { + return Input::eol_t::match( in ).first; + } + }; + + template<> + struct skip_control< eol > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eolf.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eolf.hpp new file mode 100644 index 0000000..777b814 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/eolf.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_EOLF_HPP +#define TAO_PEGTL_INTERNAL_EOLF_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct eolf + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( Input::eol_t::match( in ) ) ) + { + const auto p = Input::eol_t::match( in ); + return p.first || ( !p.second ); + } + }; + + template<> + struct skip_control< eolf > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_posix.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_posix.hpp new file mode 100644 index 0000000..ef7ad8e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_posix.hpp @@ -0,0 +1,95 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_FILE_MAPPER_POSIX_HPP +#define TAO_PEGTL_INTERNAL_FILE_MAPPER_POSIX_HPP + +#include +#include + +#include "../config.hpp" + +#include "file_opener.hpp" + +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + class file_mapper + { + public: + explicit file_mapper( const char* filename ) + : file_mapper( file_opener( filename ) ) + { + } + + explicit file_mapper( const file_opener& reader ) + : m_size( reader.size() ), + m_data( static_cast< const char* >(::mmap( nullptr, m_size, PROT_READ, MAP_PRIVATE, reader.m_fd, 0 ) ) ) + { + if( ( m_size != 0 ) && ( intptr_t( m_data ) == -1 ) ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to mmap() file " << reader.m_source << " descriptor " << reader.m_fd ); + } + } + + file_mapper( const file_mapper& ) = delete; + file_mapper( file_mapper&& ) = delete; + + ~file_mapper() noexcept + { + // Legacy C interface requires pointer-to-mutable but does not write through the pointer. + ::munmap( const_cast< char* >( m_data ), m_size ); // NOLINT + } + + void operator=( const file_mapper& ) = delete; + void operator=( file_mapper&& ) = delete; + + bool empty() const noexcept + { + return m_size == 0; + } + + std::size_t size() const noexcept + { + return m_size; + } + + using iterator = const char*; + using const_iterator = const char*; + + iterator data() const noexcept + { + return m_data; + } + + iterator begin() const noexcept + { + return m_data; + } + + iterator end() const noexcept + { + return m_data + m_size; + } + + std::string string() const + { + return std::string( m_data, m_size ); + } + + private: + const std::size_t m_size; + const char* const m_data; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_win32.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_win32.hpp new file mode 100644 index 0000000..6e87dd5 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_mapper_win32.hpp @@ -0,0 +1,212 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_FILE_MAPPER_WIN32_HPP +#define TAO_PEGTL_INTERNAL_FILE_MAPPER_WIN32_HPP + +#if !defined( NOMINMAX ) +#define NOMINMAX +#define TAO_PEGTL_NOMINMAX_WAS_DEFINED +#endif + +#if !defined( WIN32_LEAN_AND_MEAN ) +#define WIN32_MEAN_AND_LEAN +#define TAO_PEGTL_WIN32_MEAN_AND_LEAN_WAS_DEFINED +#endif + +#include + +#if defined( TAO_PEGTL_NOMINMAX_WAS_DEFINED ) +#undef NOMINMAX +#undef TAO_PEGTL_NOMINMAX_WAS_DEFINED +#endif + +#if defined( TAO_PEGTL_WIN32_MEAN_AND_LEAN_WAS_DEFINED ) +#undef WIN32_MEAN_AND_LEAN +#undef TAO_PEGTL_WIN32_MEAN_AND_LEAN_WAS_DEFINED +#endif + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct win32_file_opener + { + explicit win32_file_opener( const char* filename ) + : m_source( filename ), + m_handle( open() ) + { + } + + win32_file_opener( const win32_file_opener& ) = delete; + win32_file_opener( win32_file_opener&& ) = delete; + + ~win32_file_opener() noexcept + { + ::CloseHandle( m_handle ); + } + + void operator=( const win32_file_opener& ) = delete; + void operator=( win32_file_opener&& ) = delete; + + std::size_t size() const + { + LARGE_INTEGER size; + if( !::GetFileSizeEx( m_handle, &size ) ) { + TAO_PEGTL_THROW_INPUT_WIN32_ERROR( "unable to GetFileSizeEx() file " << m_source << " handle " << m_handle ); + } + return std::size_t( size.QuadPart ); + } + + const char* const m_source; + const HANDLE m_handle; + + private: + HANDLE open() const + { + SetLastError( 0 ); + const HANDLE handle = ::CreateFileA( m_source, + GENERIC_READ, + FILE_SHARE_READ, + nullptr, + OPEN_EXISTING, + FILE_ATTRIBUTE_NORMAL, + nullptr ); + if( handle != INVALID_HANDLE_VALUE ) { + return handle; + } + TAO_PEGTL_THROW_INPUT_WIN32_ERROR( "unable to CreateFileA() file " << m_source << " for reading" ); + } + }; + + struct win32_file_mapper + { + explicit win32_file_mapper( const char* filename ) + : win32_file_mapper( win32_file_opener( filename ) ) + { + } + + explicit win32_file_mapper( const win32_file_opener& reader ) + : m_size( reader.size() ), + m_handle( open( reader ) ) + { + } + + win32_file_mapper( const win32_file_mapper& ) = delete; + win32_file_mapper( win32_file_mapper&& ) = delete; + + ~win32_file_mapper() noexcept + { + ::CloseHandle( m_handle ); + } + + void operator=( const win32_file_mapper& ) = delete; + void operator=( win32_file_mapper&& ) = delete; + + const size_t m_size; + const HANDLE m_handle; + + private: + HANDLE open( const win32_file_opener& reader ) const + { + const uint64_t file_size = reader.size(); + SetLastError( 0 ); + // Use `CreateFileMappingW` because a) we're not specifying a + // mapping name, so the character type is of no consequence, and + // b) it's defined in `memoryapi.h`, unlike + // `CreateFileMappingA`(?!) + const HANDLE handle = ::CreateFileMappingW( reader.m_handle, + nullptr, + PAGE_READONLY, + DWORD( file_size >> 32 ), + DWORD( file_size & 0xffffffff ), + nullptr ); + if( handle != NULL || file_size == 0 ) { + return handle; + } + TAO_PEGTL_THROW_INPUT_WIN32_ERROR( "unable to CreateFileMappingW() file " << reader.m_source << " for reading" ); + } + }; + + class file_mapper + { + public: + explicit file_mapper( const char* filename ) + : file_mapper( win32_file_mapper( filename ) ) + { + } + + explicit file_mapper( const win32_file_mapper& mapper ) + : m_size( mapper.m_size ), + m_data( static_cast< const char* const >(::MapViewOfFile( mapper.m_handle, + FILE_MAP_READ, + 0, + 0, + 0 ) ) ) + { + if( ( m_size != 0 ) && ( intptr_t( m_data ) == 0 ) ) { + TAO_PEGTL_THROW_INPUT_WIN32_ERROR( "unable to MapViewOfFile() file mapping object with handle " << mapper.m_handle ); + } + } + + file_mapper( const file_mapper& ) = delete; + file_mapper( file_mapper&& ) = delete; + + ~file_mapper() noexcept + { + ::UnmapViewOfFile( LPCVOID( m_data ) ); + } + + void operator=( const file_mapper& ) = delete; + void operator=( file_mapper&& ) = delete; + + bool empty() const noexcept + { + return m_size == 0; + } + + std::size_t size() const noexcept + { + return m_size; + } + + using iterator = const char*; + using const_iterator = const char*; + + iterator data() const noexcept + { + return m_data; + } + + iterator begin() const noexcept + { + return m_data; + } + + iterator end() const noexcept + { + return m_data + m_size; + } + + std::string string() const + { + return std::string( m_data, m_size ); + } + + private: + const std::size_t m_size; + const char* const m_data; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_opener.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_opener.hpp new file mode 100644 index 0000000..478f5fc --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_opener.hpp @@ -0,0 +1,78 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_FILE_OPENER_HPP +#define TAO_PEGTL_INTERNAL_FILE_OPENER_HPP + +#include +#include +#include +#include + +#include + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct file_opener + { + explicit file_opener( const char* filename ) + : m_source( filename ), + m_fd( open() ) + { + } + + file_opener( const file_opener& ) = delete; + file_opener( file_opener&& ) = delete; + + ~file_opener() noexcept + { + ::close( m_fd ); + } + + void operator=( const file_opener& ) = delete; + void operator=( file_opener&& ) = delete; + + std::size_t size() const + { + struct stat st; // NOLINT + errno = 0; + if(::fstat( m_fd, &st ) < 0 ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to fstat() file " << m_source << " descriptor " << m_fd ); + } + return std::size_t( st.st_size ); + } + + const char* const m_source; + const int m_fd; + + private: + int open() const + { + errno = 0; + const int fd = ::open( m_source, // NOLINT + O_RDONLY +#ifdef O_CLOEXEC + | O_CLOEXEC +#endif + ); + if( fd >= 0 ) { + return fd; + } + TAO_PEGTL_THROW_INPUT_ERROR( "unable to open() file " << m_source << " for reading" ); + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_reader.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_reader.hpp new file mode 100644 index 0000000..6d95f8b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/file_reader.hpp @@ -0,0 +1,109 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_FILE_READER_HPP +#define TAO_PEGTL_INTERNAL_FILE_READER_HPP + +#include +#include +#include +#include + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline std::FILE* file_open( const char* filename ) + { + errno = 0; +#if defined( _MSC_VER ) + std::FILE* file; + if(::fopen_s( &file, filename, "rb" ) == 0 ) +#elif defined( __MINGW32__ ) + if( auto* file = std::fopen( filename, "rb" ) ) // NOLINT(cppcoreguidelines-owning-memory) +#else + if( auto* file = std::fopen( filename, "rbe" ) ) // NOLINT(cppcoreguidelines-owning-memory) +#endif + { + return file; + } + TAO_PEGTL_THROW_INPUT_ERROR( "unable to fopen() file " << filename << " for reading" ); + } + + struct file_close + { + void operator()( FILE* f ) const noexcept + { + std::fclose( f ); // NOLINT(cppcoreguidelines-owning-memory) + } + }; + + class file_reader + { + public: + explicit file_reader( const char* filename ) + : m_source( filename ), + m_file( file_open( m_source ) ) + { + } + + file_reader( FILE* file, const char* filename ) noexcept + : m_source( filename ), + m_file( file ) + { + } + + file_reader( const file_reader& ) = delete; + file_reader( file_reader&& ) = delete; + + ~file_reader() = default; + + void operator=( const file_reader& ) = delete; + void operator=( file_reader&& ) = delete; + + std::size_t size() const + { + errno = 0; + if( std::fseek( m_file.get(), 0, SEEK_END ) != 0 ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to fseek() to end of file " << m_source ); // LCOV_EXCL_LINE + } + errno = 0; + const auto s = std::ftell( m_file.get() ); + if( s < 0 ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to ftell() file size of file " << m_source ); // LCOV_EXCL_LINE + } + errno = 0; + if( std::fseek( m_file.get(), 0, SEEK_SET ) != 0 ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to fseek() to beginning of file " << m_source ); // LCOV_EXCL_LINE + } + return std::size_t( s ); + } + + std::string read() const + { + std::string nrv; + nrv.resize( size() ); + errno = 0; + if( !nrv.empty() && ( std::fread( &nrv[ 0 ], nrv.size(), 1, m_file.get() ) != 1 ) ) { + TAO_PEGTL_THROW_INPUT_ERROR( "unable to fread() file " << m_source << " size " << nrv.size() ); // LCOV_EXCL_LINE + } + return nrv; + } + + private: + const char* const m_source; + const std::unique_ptr< std::FILE, file_close > m_file; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply.hpp new file mode 100644 index 0000000..4a4f8db --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply.hpp @@ -0,0 +1,33 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_HAS_APPLY_HPP +#define TAO_PEGTL_INTERNAL_HAS_APPLY_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename, typename, typename... > + struct has_apply : std::false_type + { + }; + + template< typename A, typename... S > + struct has_apply< A, decltype( A::apply( std::declval< S >()... ) ), S... > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply0.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply0.hpp new file mode 100644 index 0000000..6b1e486 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/has_apply0.hpp @@ -0,0 +1,33 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_HAS_APPLY0_HPP +#define TAO_PEGTL_INTERNAL_HAS_APPLY0_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename, typename, typename... > + struct has_apply0 : std::false_type + { + }; + + template< typename A, typename... S > + struct has_apply0< A, decltype( A::apply0( std::declval< S >()... ) ), S... > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/identifier.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/identifier.hpp new file mode 100644 index 0000000..59f6218 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/identifier.hpp @@ -0,0 +1,30 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_IDENTIFIER_HPP +#define TAO_PEGTL_INTERNAL_IDENTIFIER_HPP + +#include "../config.hpp" + +#include "peek_char.hpp" +#include "ranges.hpp" +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + using identifier_first = ranges< peek_char, 'a', 'z', 'A', 'Z', '_' >; + using identifier_other = ranges< peek_char, 'a', 'z', 'A', 'Z', '0', '9', '_' >; + using identifier = seq< identifier_first, star< identifier_other > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_apply.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_apply.hpp new file mode 100644 index 0000000..58d0e97 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_apply.hpp @@ -0,0 +1,110 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_IF_APPLY_HPP +#define TAO_PEGTL_INTERNAL_IF_APPLY_HPP + +#include "../config.hpp" + +#include "apply_single.hpp" +#include "skip_control.hpp" + +#include "../analysis/counted.hpp" +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< apply_mode A, typename Rule, typename... Actions > + struct if_apply_impl; + + template< typename Rule > + struct if_apply_impl< apply_mode::ACTION, Rule > + { + template< rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return Control< Rule >::template match< apply_mode::ACTION, M, Action, Control >( in, st... ); + } + }; + + template< typename Rule, typename... Actions > + struct if_apply_impl< apply_mode::ACTION, Rule, Actions... > + { + template< rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + using action_t = typename Input::action_t; + + auto m = in.template mark< rewind_mode::REQUIRED >(); + + if( Control< Rule >::template match< apply_mode::ACTION, rewind_mode::ACTIVE, Action, Control >( in, st... ) ) { + const action_t i2( m.iterator(), in ); +#ifdef __cpp_fold_expressions + return m( ( apply_single< Actions >::match( i2, st... ) && ... ) ); +#else + bool result = true; + using swallow = bool[]; + (void)swallow{ result = result && apply_single< Actions >::match( i2, st... )... }; + return m( result ); +#endif + } + return false; + } + }; + + template< typename Rule, typename... Actions > + struct if_apply_impl< apply_mode::NOTHING, Rule, Actions... > + { + template< rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return Control< Rule >::template match< apply_mode::NOTHING, M, Action, Control >( in, st... ); + } + }; + + template< typename Rule, typename... Actions > + struct if_apply + { + using analyze_t = typename Rule::analyze_t; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return if_apply_impl< A, Rule, Actions... >::template match< M, Action, Control >( in, st... ); + } + }; + + template< typename Rule, typename... Actions > + struct skip_control< if_apply< Rule, Actions... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must.hpp new file mode 100644 index 0000000..f81fee4 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must.hpp @@ -0,0 +1,57 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_IF_MUST_HPP +#define TAO_PEGTL_INTERNAL_IF_MUST_HPP + +#include "../config.hpp" + +#include "must.hpp" +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< bool Default, typename Cond, typename... Rules > + struct if_must + { + using analyze_t = analysis::counted< analysis::rule_type::SEQ, Default ? 0 : 1, Cond, must< Rules... > >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + if( Control< Cond >::template match< A, M, Action, Control >( in, st... ) ) { + rule_conjunction< must< Rules >... >::template match< A, M, Action, Control >( in, st... ); + return true; + } + return Default; + } + }; + + template< bool Default, typename Cond, typename... Rules > + struct skip_control< if_must< Default, Cond, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must_else.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must_else.hpp new file mode 100644 index 0000000..f049bcb --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_must_else.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_IF_MUST_ELSE_HPP +#define TAO_PEGTL_INTERNAL_IF_MUST_ELSE_HPP + +#include "../config.hpp" + +#include "if_then_else.hpp" +#include "must.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Cond, typename Then, typename Else > + using if_must_else = if_then_else< Cond, must< Then >, must< Else > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_then_else.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_then_else.hpp new file mode 100644 index 0000000..5e851d8 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/if_then_else.hpp @@ -0,0 +1,59 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_IF_THEN_ELSE_HPP +#define TAO_PEGTL_INTERNAL_IF_THEN_ELSE_HPP + +#include "../config.hpp" + +#include "not_at.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "sor.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Cond, typename Then, typename Else > + struct if_then_else + { + using analyze_t = analysis::generic< analysis::rule_type::SOR, seq< Cond, Then >, seq< not_at< Cond >, Else > >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + if( Control< Cond >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, st... ) ) { + return m( Control< Then >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ); + } + return m( Control< Else >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ); + } + }; + + template< typename Cond, typename Then, typename Else > + struct skip_control< if_then_else< Cond, Then, Else > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/input_pair.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/input_pair.hpp new file mode 100644 index 0000000..362b07c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/input_pair.hpp @@ -0,0 +1,37 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_INPUT_PAIR_HPP +#define TAO_PEGTL_INTERNAL_INPUT_PAIR_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Data > + struct input_pair + { + Data data; + std::uint8_t size; + + using data_t = Data; + + explicit operator bool() const noexcept + { + return size > 0; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/integer_sequence.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/integer_sequence.hpp new file mode 100644 index 0000000..29aeff6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/integer_sequence.hpp @@ -0,0 +1,86 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_INTEGER_SEQUENCE_HPP +#define TAO_PEGTL_INTERNAL_INTEGER_SEQUENCE_HPP + +#include +#include +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename T, T... Ns > + struct integer_sequence + { + using value_type = T; + + static constexpr std::size_t size() noexcept + { + return sizeof...( Ns ); + } + }; + + template< std::size_t... Ns > + using index_sequence = integer_sequence< std::size_t, Ns... >; + + template< bool V, bool E > + struct generate_sequence; + + template<> + struct generate_sequence< false, true > + { + template< typename T, T M, T N, std::size_t S, T... Ns > + using f = integer_sequence< T, Ns... >; + }; + + template<> + struct generate_sequence< true, true > + { + template< typename T, T M, T N, std::size_t S, T... Ns > + using f = integer_sequence< T, Ns..., S >; + }; + + template<> + struct generate_sequence< false, false > + { + template< typename T, T M, T N, std::size_t S, T... Ns > + using f = typename generate_sequence< ( N & ( M / 2 ) ) != 0, ( M / 2 ) == 0 >::template f< T, M / 2, N, 2 * S, Ns..., ( Ns + S )... >; + }; + + template<> + struct generate_sequence< true, false > + { + template< typename T, T M, T N, std::size_t S, T... Ns > + using f = typename generate_sequence< ( N & ( M / 2 ) ) != 0, ( M / 2 ) == 0 >::template f< T, M / 2, N, 2 * S + 1, Ns..., ( Ns + S )..., 2 * S >; + }; + + template< typename T, T N > + struct memoize_sequence + { + static_assert( N < T( 1 << 20 ), "N too large" ); + using type = typename generate_sequence< false, false >::template f< T, ( N < T( 1 << 1 ) ) ? T( 1 << 1 ) : ( N < T( 1 << 2 ) ) ? T( 1 << 2 ) : ( N < T( 1 << 3 ) ) ? T( 1 << 3 ) : ( N < T( 1 << 4 ) ) ? T( 1 << 4 ) : ( N < T( 1 << 5 ) ) ? T( 1 << 5 ) : ( N < T( 1 << 6 ) ) ? T( 1 << 6 ) : ( N < T( 1 << 7 ) ) ? T( 1 << 7 ) : ( N < T( 1 << 8 ) ) ? T( 1 << 8 ) : ( N < T( 1 << 9 ) ) ? T( 1 << 9 ) : ( N < T( 1 << 10 ) ) ? T( 1 << 10 ) : ( N < T( 1 << 11 ) ) ? T( 1 << 11 ) : ( N < T( 1 << 12 ) ) ? T( 1 << 12 ) : ( N < T( 1 << 13 ) ) ? T( 1 << 13 ) : ( N < T( 1 << 14 ) ) ? T( 1 << 14 ) : ( N < T( 1 << 15 ) ) ? T( 1 << 15 ) : ( N < T( 1 << 16 ) ) ? T( 1 << 16 ) : ( N < T( 1 << 17 ) ) ? T( 1 << 17 ) : ( N < T( 1 << 18 ) ) ? T( 1 << 18 ) : ( N < T( 1 << 19 ) ) ? T( 1 << 19 ) : T( 1 << 20 ), N, 0 >; + }; + + template< typename T, T N > + using make_integer_sequence = typename memoize_sequence< T, N >::type; + + template< std::size_t N > + using make_index_sequence = make_integer_sequence< std::size_t, N >; + + template< typename... Ts > + using index_sequence_for = make_index_sequence< sizeof...( Ts ) >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istream_reader.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istream_reader.hpp new file mode 100644 index 0000000..592c15e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istream_reader.hpp @@ -0,0 +1,47 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ISTREAM_READER_HPP +#define TAO_PEGTL_INTERNAL_ISTREAM_READER_HPP + +#include + +#include "../config.hpp" +#include "../input_error.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct istream_reader + { + explicit istream_reader( std::istream& s ) noexcept + : m_istream( s ) + { + } + + std::size_t operator()( char* buffer, const std::size_t length ) + { + m_istream.read( buffer, std::streamsize( length ) ); + + if( const auto r = m_istream.gcount() ) { + return std::size_t( r ); + } + if( m_istream.eof() ) { + return 0; + } + TAO_PEGTL_THROW_INPUT_ERROR( "error in istream.read()" ); + } + + std::istream& m_istream; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istring.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istring.hpp new file mode 100644 index 0000000..5c8c4ab --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/istring.hpp @@ -0,0 +1,107 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ISTRING_HPP +#define TAO_PEGTL_INTERNAL_ISTRING_HPP + +#include + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< char C > + using is_alpha = std::integral_constant< bool, ( ( 'a' <= C ) && ( C <= 'z' ) ) || ( ( 'A' <= C ) && ( C <= 'Z' ) ) >; + + template< char C, bool A = is_alpha< C >::value > + struct ichar_equal; + + template< char C > + struct ichar_equal< C, true > + { + static bool match( const char c ) noexcept + { + return ( C | 0x20 ) == ( c | 0x20 ); + } + }; + + template< char C > + struct ichar_equal< C, false > + { + static bool match( const char c ) noexcept + { + return c == C; + } + }; + + template< char... Cs > + struct istring_equal; + + template<> + struct istring_equal<> + { + static bool match( const char* /*unused*/ ) noexcept + { + return true; + } + }; + + template< char C, char... Cs > + struct istring_equal< C, Cs... > + { + static bool match( const char* r ) noexcept + { + return ichar_equal< C >::match( *r ) && istring_equal< Cs... >::match( r + 1 ); + } + }; + + template< char... Cs > + struct istring; + + template<> + struct istring<> + : trivial< true > + { + }; + + template< char... Cs > + struct istring + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, sizeof...( Cs ) >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 0 ) ) ) + { + if( in.size( sizeof...( Cs ) ) >= sizeof...( Cs ) ) { + if( istring_equal< Cs... >::match( in.current() ) ) { + bump_help< result_on_found::SUCCESS, Input, char, Cs... >( in, sizeof...( Cs ) ); + return true; + } + } + return false; + } + }; + + template< char... Cs > + struct skip_control< istring< Cs... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/iterator.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/iterator.hpp new file mode 100644 index 0000000..4bc46f3 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/iterator.hpp @@ -0,0 +1,60 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ITERATOR_HPP +#define TAO_PEGTL_INTERNAL_ITERATOR_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct iterator + { + iterator() noexcept = default; + + explicit iterator( const char* in_data ) noexcept + : data( in_data ) + { + } + + iterator( const char* in_data, const std::size_t in_byte, const std::size_t in_line, const std::size_t in_byte_in_line ) noexcept + : data( in_data ), + byte( in_byte ), + line( in_line ), + byte_in_line( in_byte_in_line ) + { + } + + iterator( const iterator& ) = default; + iterator( iterator&& ) = default; + + ~iterator() = default; + + iterator& operator=( const iterator& ) = default; + iterator& operator=( iterator&& ) = default; + + void reset() noexcept + { + *this = iterator(); + } + + const char* data = nullptr; + + std::size_t byte = 0; + std::size_t line = 1; + std::size_t byte_in_line = 0; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_crlf_eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_crlf_eol.hpp new file mode 100644 index 0000000..27a47c4 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_crlf_eol.hpp @@ -0,0 +1,45 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LF_CRLF_EOL_HPP +#define TAO_PEGTL_INTERNAL_LF_CRLF_EOL_HPP + +#include "../config.hpp" +#include "../eol_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct lf_crlf_eol + { + static constexpr int ch = '\n'; + + template< typename Input > + static eol_pair match( Input& in ) noexcept( noexcept( in.size( 2 ) ) ) + { + eol_pair p = { false, in.size( 2 ) }; + if( p.second ) { + const auto a = in.peek_char(); + if( a == '\n' ) { + in.bump_to_next_line(); + p.first = true; + } + else if( ( a == '\r' ) && ( p.second > 1 ) && ( in.peek_char( 1 ) == '\n' ) ) { + in.bump_to_next_line( 2 ); + p.first = true; + } + } + return p; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_eol.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_eol.hpp new file mode 100644 index 0000000..0104126 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/lf_eol.hpp @@ -0,0 +1,40 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LF_EOL_HPP +#define TAO_PEGTL_INTERNAL_LF_EOL_HPP + +#include "../config.hpp" +#include "../eol_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct lf_eol + { + static constexpr int ch = '\n'; + + template< typename Input > + static eol_pair match( Input& in ) noexcept( noexcept( in.size( 1 ) ) ) + { + eol_pair p = { false, in.size( 1 ) }; + if( p.second ) { + if( in.peek_char() == '\n' ) { + in.bump_to_next_line(); + p.first = true; + } + } + return p; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list.hpp new file mode 100644 index 0000000..7068d9c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LIST_HPP +#define TAO_PEGTL_INTERNAL_LIST_HPP + +#include "../config.hpp" + +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Sep > + using list = seq< Rule, star< Sep, Rule > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_must.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_must.hpp new file mode 100644 index 0000000..c473f2d --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_must.hpp @@ -0,0 +1,28 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LIST_MUST_HPP +#define TAO_PEGTL_INTERNAL_LIST_MUST_HPP + +#include "../config.hpp" + +#include "must.hpp" +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Sep > + using list_must = seq< Rule, star< Sep, must< Rule > > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail.hpp new file mode 100644 index 0000000..e651df8 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail.hpp @@ -0,0 +1,28 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LIST_TAIL_HPP +#define TAO_PEGTL_INTERNAL_LIST_TAIL_HPP + +#include "../config.hpp" + +#include "list.hpp" +#include "opt.hpp" +#include "seq.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Sep > + using list_tail = seq< list< Rule, Sep >, opt< Sep > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail_pad.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail_pad.hpp new file mode 100644 index 0000000..291bcad --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/list_tail_pad.hpp @@ -0,0 +1,30 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_LIST_TAIL_PAD_HPP +#define TAO_PEGTL_INTERNAL_LIST_TAIL_PAD_HPP + +#include "../config.hpp" + +#include "list.hpp" +#include "opt.hpp" +#include "pad.hpp" +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Sep, typename Pad > + using list_tail_pad = seq< list< Rule, pad< Sep, Pad > >, opt< star< Pad >, Sep > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/marker.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/marker.hpp new file mode 100644 index 0000000..c11ad49 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/marker.hpp @@ -0,0 +1,99 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_MARKER_HPP +#define TAO_PEGTL_INTERNAL_MARKER_HPP + +#include "../config.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Iterator, rewind_mode M > + class marker + { + public: + static constexpr rewind_mode next_rewind_mode = M; + + explicit marker( const Iterator& /*unused*/ ) noexcept + { + } + + marker( const marker& ) = delete; + + marker( marker&& /*unused*/ ) noexcept + { + } + + ~marker() = default; + + void operator=( const marker& ) = delete; + void operator=( marker&& ) = delete; + + bool operator()( const bool result ) const noexcept + { + return result; + } + }; + + template< typename Iterator > + class marker< Iterator, rewind_mode::REQUIRED > + { + public: + static constexpr rewind_mode next_rewind_mode = rewind_mode::ACTIVE; + + explicit marker( Iterator& i ) noexcept + : m_saved( i ), + m_input( &i ) + { + } + + marker( const marker& ) = delete; + + marker( marker&& i ) noexcept + : m_saved( i.m_saved ), + m_input( i.m_input ) + { + i.m_input = nullptr; + } + + ~marker() noexcept + { + if( m_input != nullptr ) { + ( *m_input ) = m_saved; + } + } + + void operator=( const marker& ) = delete; + void operator=( marker&& ) = delete; + + bool operator()( const bool result ) noexcept + { + if( result ) { + m_input = nullptr; + return true; + } + return false; + } + + const Iterator& iterator() const noexcept + { + return m_saved; + } + + private: + const Iterator m_saved; + Iterator* m_input; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/minus.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/minus.hpp new file mode 100644 index 0000000..9481c82 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/minus.hpp @@ -0,0 +1,69 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_MINUS_HPP +#define TAO_PEGTL_INTERNAL_MINUS_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../memory_input.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline const char* source_pointer( const char* source ) noexcept + { + return source; + } + + inline const char* source_pointer( const std::string& source ) noexcept + { + return source.c_str(); + } + + template< typename R, typename S > + struct minus + { + using analyze_t = typename R::analyze_t; // NOTE: S is currently ignored for analyze(). + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< rewind_mode::REQUIRED >(); + + if( !Control< R >::template match< A, rewind_mode::ACTIVE, Action, Control >( in, st... ) ) { + return false; + } + memory_input< tracking_mode::LAZY, typename Input::eol_t, const char* > i2( m.iterator(), in.current(), source_pointer( in.source() ) ); + + if( !Control< S >::template match< apply_mode::NOTHING, rewind_mode::ACTIVE, Action, Control >( i2, st... ) ) { + return m( true ); + } + return m( !i2.empty() ); + } + }; + + template< typename R, typename S > + struct skip_control< minus< R, S > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/must.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/must.hpp new file mode 100644 index 0000000..9f37243 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/must.hpp @@ -0,0 +1,79 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_MUST_HPP +#define TAO_PEGTL_INTERNAL_MUST_HPP + +#include "../config.hpp" + +#include "raise.hpp" +#include "rule_conjunction.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + // The general case applies must<> to each of the + // rules in the 'Rules' parameter pack individually. + + template< typename... Rules > + struct must + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return rule_conjunction< must< Rules >... >::template match< A, M, Action, Control >( in, st... ); + } + }; + + // While in theory the implementation for a single rule could + // be simplified to must< Rule > = sor< Rule, raise< Rule > >, this + // would result in some unnecessary run-time overhead. + + template< typename Rule > + struct must< Rule > + { + using analyze_t = typename Rule::analyze_t; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + if( !Control< Rule >::template match< A, rewind_mode::DONTCARE, Action, Control >( in, st... ) ) { + raise< Rule >::template match< A, rewind_mode::DONTCARE, Action, Control >( in, st... ); + } + return true; + } + }; + + template< typename... Rules > + struct skip_control< must< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/not_at.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/not_at.hpp new file mode 100644 index 0000000..d479320 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/not_at.hpp @@ -0,0 +1,62 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_NOT_AT_HPP +#define TAO_PEGTL_INTERNAL_NOT_AT_HPP + +#include "../config.hpp" + +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct not_at; + + template<> + struct not_at<> + : trivial< false > + { + }; + + template< typename... Rules > + struct not_at + { + using analyze_t = analysis::generic< analysis::rule_type::OPT, Rules... >; + + template< apply_mode, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + const auto m = in.template mark< rewind_mode::REQUIRED >(); + return !rule_conjunction< Rules... >::template match< apply_mode::NOTHING, rewind_mode::ACTIVE, Action, Control >( in, st... ); + } + }; + + template< typename... Rules > + struct skip_control< not_at< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/one.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/one.hpp new file mode 100644 index 0000000..8d29d51 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/one.hpp @@ -0,0 +1,81 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_ONE_HPP +#define TAO_PEGTL_INTERNAL_ONE_HPP + +#include +#include + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Char > + bool contains( const Char c, const std::initializer_list< Char >& l ) noexcept + { + return std::find( l.begin(), l.end(), c ) != l.end(); + } + + template< result_on_found R, typename Peek, typename Peek::data_t... Cs > + struct one + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.empty() ) ) + { + if( !in.empty() ) { + if( const auto t = Peek::peek( in ) ) { + if( contains( t.data, { Cs... } ) == bool( R ) ) { + bump_help< R, Input, typename Peek::data_t, Cs... >( in, t.size ); + return true; + } + } + } + return false; + } + }; + + template< result_on_found R, typename Peek, typename Peek::data_t C > + struct one< R, Peek, C > + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.empty() ) ) + { + if( !in.empty() ) { + if( const auto t = Peek::peek( in ) ) { + if( ( t.data == C ) == bool( R ) ) { + bump_help< R, Input, typename Peek::data_t, C >( in, t.size ); + return true; + } + } + } + return false; + } + }; + + template< result_on_found R, typename Peek, typename Peek::data_t... Cs > + struct skip_control< one< R, Peek, Cs... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/opt.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/opt.hpp new file mode 100644 index 0000000..f27046a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/opt.hpp @@ -0,0 +1,65 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_OPT_HPP +#define TAO_PEGTL_INTERNAL_OPT_HPP + +#include + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct opt; + + template<> + struct opt<> + : trivial< true > + { + }; + + template< typename... Rules > + struct opt + { + using analyze_t = analysis::generic< analysis::rule_type::OPT, Rules... >; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + duseltronik< seq< Rules... >, A, rewind_mode::REQUIRED, Action, Control >::match( in, st... ); + return true; + } + }; + + template< typename... Rules > + struct skip_control< opt< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad.hpp new file mode 100644 index 0000000..8aa586d --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PAD_HPP +#define TAO_PEGTL_INTERNAL_PAD_HPP + +#include "../config.hpp" + +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Pad1, typename Pad2 = Pad1 > + using pad = seq< star< Pad1 >, Rule, star< Pad2 > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad_opt.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad_opt.hpp new file mode 100644 index 0000000..bdd0f66 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pad_opt.hpp @@ -0,0 +1,28 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PAD_OPT_HPP +#define TAO_PEGTL_INTERNAL_PAD_OPT_HPP + +#include "../config.hpp" + +#include "opt.hpp" +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename Pad > + using pad_opt = seq< star< Pad >, opt< Rule, star< Pad > > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_char.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_char.hpp new file mode 100644 index 0000000..f7eaf90 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_char.hpp @@ -0,0 +1,37 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_CHAR_HPP +#define TAO_PEGTL_INTERNAL_PEEK_CHAR_HPP + +#include + +#include "../config.hpp" + +#include "input_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct peek_char + { + using data_t = char; + using pair_t = input_pair< char >; + + template< typename Input > + static pair_t peek( Input& in, const std::size_t o = 0 ) noexcept( noexcept( in.Input::peek_char( 0 ) ) ) + { + return { in.peek_char( o ), 1 }; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint.hpp new file mode 100644 index 0000000..b5709d6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint.hpp @@ -0,0 +1,63 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_MASK_UINT_HPP +#define TAO_PEGTL_INTERNAL_PEEK_MASK_UINT_HPP + +#include +#include + +#include "../config.hpp" + +#include "input_pair.hpp" +#include "read_uint.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename R, typename R::type M > + struct peek_mask_uint_impl + { + using data_t = typename R::type; + using pair_t = input_pair< data_t >; + + template< typename Input > + static pair_t peek( Input& in ) noexcept( noexcept( in.size( sizeof( data_t ) ) ) ) + { + const std::size_t s = in.size( sizeof( data_t ) ); + if( s >= sizeof( data_t ) ) { + const data_t data = R::read( in.current() ) & M; + return { data, sizeof( data_t ) }; + } + return { 0, 0 }; + } + }; + + template< std::uint16_t M > + using peek_mask_uint16_be = peek_mask_uint_impl< read_uint16_be, M >; + + template< std::uint16_t M > + using peek_mask_uint16_le = peek_mask_uint_impl< read_uint16_le, M >; + + template< std::uint32_t M > + using peek_mask_uint32_be = peek_mask_uint_impl< read_uint32_be, M >; + + template< std::uint32_t M > + using peek_mask_uint32_le = peek_mask_uint_impl< read_uint32_le, M >; + + template< std::uint64_t M > + using peek_mask_uint64_be = peek_mask_uint_impl< read_uint64_be, M >; + + template< std::uint64_t M > + using peek_mask_uint64_le = peek_mask_uint_impl< read_uint64_le, M >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint8.hpp new file mode 100644 index 0000000..8711918 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_mask_uint8.hpp @@ -0,0 +1,39 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_MASK_UINT8_HPP +#define TAO_PEGTL_INTERNAL_PEEK_MASK_UINT8_HPP + +#include +#include + +#include "../config.hpp" + +#include "input_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< std::uint8_t M > + struct peek_mask_uint8 + { + using data_t = std::uint8_t; + using pair_t = input_pair< std::uint8_t >; + + template< typename Input > + static pair_t peek( Input& in, const std::size_t o = 0 ) noexcept( noexcept( in.peek_byte( 0 ) ) ) + { + return { std::uint8_t( in.peek_byte( o ) & M ), 1 }; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint.hpp new file mode 100644 index 0000000..4a0fd89 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint.hpp @@ -0,0 +1,54 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_UINT_HPP +#define TAO_PEGTL_INTERNAL_PEEK_UINT_HPP + +#include +#include + +#include "../config.hpp" + +#include "input_pair.hpp" +#include "read_uint.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename R > + struct peek_uint_impl + { + using data_t = typename R::type; + using pair_t = input_pair< data_t >; + + template< typename Input > + static pair_t peek( Input& in ) noexcept( noexcept( in.size( sizeof( data_t ) ) ) ) + { + const std::size_t s = in.size( sizeof( data_t ) ); + if( s >= sizeof( data_t ) ) { + const data_t data = R::read( in.current() ); + return { data, sizeof( data_t ) }; + } + return { 0, 0 }; + } + }; + + using peek_uint16_be = peek_uint_impl< read_uint16_be >; + using peek_uint16_le = peek_uint_impl< read_uint16_le >; + + using peek_uint32_be = peek_uint_impl< read_uint32_be >; + using peek_uint32_le = peek_uint_impl< read_uint32_le >; + + using peek_uint64_be = peek_uint_impl< read_uint64_be >; + using peek_uint64_le = peek_uint_impl< read_uint64_le >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint8.hpp new file mode 100644 index 0000000..aebe1b2 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_uint8.hpp @@ -0,0 +1,38 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_UINT8_HPP +#define TAO_PEGTL_INTERNAL_PEEK_UINT8_HPP + +#include +#include + +#include "../config.hpp" + +#include "input_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct peek_uint8 + { + using data_t = std::uint8_t; + using pair_t = input_pair< std::uint8_t >; + + template< typename Input > + static pair_t peek( Input& in, const std::size_t o = 0 ) noexcept( noexcept( in.peek_byte( 0 ) ) ) + { + return { in.peek_byte( o ), 1 }; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf16.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf16.hpp new file mode 100644 index 0000000..8d88e42 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf16.hpp @@ -0,0 +1,63 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_UTF16_HPP +#define TAO_PEGTL_INTERNAL_PEEK_UTF16_HPP + +#include + +#include "../config.hpp" + +#include "input_pair.hpp" +#include "read_uint.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename R > + struct peek_utf16_impl + { + using data_t = char32_t; + using pair_t = input_pair< char32_t >; + + using short_t = std::make_unsigned< char16_t >::type; + + static_assert( sizeof( short_t ) == 2, "expected size 2 for 16bit value" ); + static_assert( sizeof( char16_t ) == 2, "expected size 2 for 16bit value" ); + + template< typename Input > + static pair_t peek( Input& in ) noexcept( noexcept( in.size( 4 ) ) ) + { + const std::size_t s = in.size( 4 ); + if( s < 2 ) { + return { 0, 0 }; + } + const char32_t t = R::read( in.current() ); + if( ( t < 0xd800 ) || ( t > 0xdfff ) ) { + return { t, 2 }; + } + if( ( t >= 0xdc00 ) || ( s < 4 ) ) { + return { 0, 0 }; + } + const char32_t u = R::read( in.current() + 2 ); + if( ( u >= 0xdc00 ) && ( u <= 0xdfff ) ) { + const auto cp = ( ( ( t & 0x03ff ) << 10 ) | ( u & 0x03ff ) ) + 0x10000; + return { cp, 4 }; + } + return { 0, 0 }; + } + }; + + using peek_utf16_be = peek_utf16_impl< read_uint16_be >; + using peek_utf16_le = peek_utf16_impl< read_uint16_le >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf32.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf32.hpp new file mode 100644 index 0000000..7d720b1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf32.hpp @@ -0,0 +1,51 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_UTF32_HPP +#define TAO_PEGTL_INTERNAL_PEEK_UTF32_HPP + +#include + +#include "../config.hpp" + +#include "input_pair.hpp" +#include "read_uint.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename R > + struct peek_utf32_impl + { + using data_t = char32_t; + using pair_t = input_pair< char32_t >; + + static_assert( sizeof( char32_t ) == 4, "expected size 4 for 32bit value" ); + + template< typename Input > + static pair_t peek( Input& in ) noexcept( noexcept( in.size( 4 ) ) ) + { + const std::size_t s = in.size( 4 ); + if( s >= 4 ) { + const char32_t t = R::read( in.current() ); + if( ( 0 <= t ) && ( t <= 0x10ffff ) && !( t >= 0xd800 && t <= 0xdfff ) ) { + return { t, 4 }; + } + } + return { 0, 0 }; + } + }; + + using peek_utf32_be = peek_utf32_impl< read_uint32_be >; + using peek_utf32_le = peek_utf32_impl< read_uint32_le >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf8.hpp new file mode 100644 index 0000000..2b11f75 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/peek_utf8.hpp @@ -0,0 +1,88 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEEK_UTF8_HPP +#define TAO_PEGTL_INTERNAL_PEEK_UTF8_HPP + +#include "../config.hpp" + +#include "input_pair.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct peek_utf8 + { + using data_t = char32_t; + using pair_t = input_pair< char32_t >; + + template< typename Input > + static pair_t peek( Input& in ) noexcept( noexcept( in.size( 4 ) ) ) + { + char32_t c0 = in.peek_byte(); + + if( ( c0 & 0x80 ) == 0 ) { + return { c0, 1 }; + } + if( ( c0 & 0xE0 ) == 0xC0 ) { + if( in.size( 2 ) >= 2 ) { + const char32_t c1 = in.peek_byte( 1 ); + if( ( c1 & 0xC0 ) == 0x80 ) { + c0 &= 0x1F; + c0 <<= 6; + c0 |= ( c1 & 0x3F ); + if( c0 >= 0x80 ) { + return { c0, 2 }; + } + } + } + } + else if( ( c0 & 0xF0 ) == 0xE0 ) { + if( in.size( 3 ) >= 3 ) { + const char32_t c1 = in.peek_byte( 1 ); + const char32_t c2 = in.peek_byte( 2 ); + if( ( ( c1 & 0xC0 ) == 0x80 ) && ( ( c2 & 0xC0 ) == 0x80 ) ) { + c0 &= 0x0F; + c0 <<= 6; + c0 |= ( c1 & 0x3F ); + c0 <<= 6; + c0 |= ( c2 & 0x3F ); + if( c0 >= 0x800 && !( c0 >= 0xD800 && c0 <= 0xDFFF ) ) { + return { c0, 3 }; + } + } + } + } + else if( ( c0 & 0xF8 ) == 0xF0 ) { + if( in.size( 4 ) >= 4 ) { + const char32_t c1 = in.peek_byte( 1 ); + const char32_t c2 = in.peek_byte( 2 ); + const char32_t c3 = in.peek_byte( 3 ); + if( ( ( c1 & 0xC0 ) == 0x80 ) && ( ( c2 & 0xC0 ) == 0x80 ) && ( ( c3 & 0xC0 ) == 0x80 ) ) { + c0 &= 0x07; + c0 <<= 6; + c0 |= ( c1 & 0x3F ); + c0 <<= 6; + c0 |= ( c2 & 0x3F ); + c0 <<= 6; + c0 |= ( c3 & 0x3F ); + if( c0 >= 0x10000 && c0 <= 0x10FFFF ) { + return { c0, 4 }; + } + } + } + } + return { 0, 0 }; + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pegtl_string.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pegtl_string.hpp new file mode 100644 index 0000000..5928d73 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/pegtl_string.hpp @@ -0,0 +1,103 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PEGTL_STRING_HPP +#define TAO_PEGTL_INTERNAL_PEGTL_STRING_HPP + +#include +#include + +#include "../ascii.hpp" +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + // Inspired by https://github.com/irrequietus/typestring + // Rewritten and reduced to what is needed for the PEGTL + // and to work with Visual Studio 2015. + + namespace internal + { + template< typename, typename, typename, typename, typename, typename, typename, typename > + struct string_join; + + template< template< char... > class S, char... C0s, char... C1s, char... C2s, char... C3s, char... C4s, char... C5s, char... C6s, char... C7s > + struct string_join< S< C0s... >, S< C1s... >, S< C2s... >, S< C3s... >, S< C4s... >, S< C5s... >, S< C6s... >, S< C7s... > > + { + using type = S< C0s..., C1s..., C2s..., C3s..., C4s..., C5s..., C6s..., C7s... >; + }; + + template< template< char... > class S, char, bool > + struct string_at + { + using type = S<>; + }; + + template< template< char... > class S, char C > + struct string_at< S, C, true > + { + using type = S< C >; + }; + + template< typename T, std::size_t S > + struct string_max_length + { + static_assert( S <= 512, "String longer than 512 (excluding terminating \\0)!" ); + using type = T; + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#define TAO_PEGTL_INTERNAL_EMPTY() +#define TAO_PEGTL_INTERNAL_DEFER( X ) X TAO_PEGTL_INTERNAL_EMPTY() +#define TAO_PEGTL_INTERNAL_EXPAND( ... ) __VA_ARGS__ + +#define TAO_PEGTL_INTERNAL_STRING_AT( S, x, n ) \ + tao::TAO_PEGTL_NAMESPACE::internal::string_at< S, ( 0##n < sizeof( x ) ) ? ( x )[ 0##n ] : 0, ( 0##n < sizeof( x ) - 1 ) >::type + +#define TAO_PEGTL_INTERNAL_JOIN_8( M, S, x, n ) \ + tao::TAO_PEGTL_NAMESPACE::internal::string_join< TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##0 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##1 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##2 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##3 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##4 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##5 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##6 ), \ + TAO_PEGTL_INTERNAL_DEFER( M )( S, x, n##7 ) >::type + +#define TAO_PEGTL_INTERNAL_STRING_8( S, x, n ) \ + TAO_PEGTL_INTERNAL_JOIN_8( TAO_PEGTL_INTERNAL_STRING_AT, S, x, n ) + +#define TAO_PEGTL_INTERNAL_STRING_64( S, x, n ) \ + TAO_PEGTL_INTERNAL_JOIN_8( TAO_PEGTL_INTERNAL_STRING_8, S, x, n ) + +#define TAO_PEGTL_INTERNAL_STRING_512( S, x, n ) \ + TAO_PEGTL_INTERNAL_JOIN_8( TAO_PEGTL_INTERNAL_STRING_64, S, x, n ) + +#define TAO_PEGTL_INTERNAL_STRING( S, x ) \ + TAO_PEGTL_INTERNAL_EXPAND( \ + TAO_PEGTL_INTERNAL_EXPAND( \ + TAO_PEGTL_INTERNAL_EXPAND( \ + tao::TAO_PEGTL_NAMESPACE::internal::string_max_length< TAO_PEGTL_INTERNAL_STRING_512( S, x, ), sizeof( x ) - 1 >::type ) ) ) + +#define TAO_PEGTL_STRING( x ) \ + TAO_PEGTL_INTERNAL_STRING( tao::TAO_PEGTL_NAMESPACE::ascii::string, x ) + +#define TAO_PEGTL_ISTRING( x ) \ + TAO_PEGTL_INTERNAL_STRING( tao::TAO_PEGTL_NAMESPACE::ascii::istring, x ) + +#define TAO_PEGTL_KEYWORD( x ) \ + TAO_PEGTL_INTERNAL_STRING( tao::TAO_PEGTL_NAMESPACE::ascii::keyword, x ) + +// Compatibility, remove with 3.0 +#define TAOCPP_PEGTL_STRING( x ) TAO_PEGTL_STRING( x ) +#define TAOCPP_PEGTL_ISTRING( x ) TAO_PEGTL_ISTRING( x ) +#define TAOCPP_PEGTL_KEYWORD( x ) TAO_PEGTL_KEYWORD( x ) + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/plus.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/plus.hpp new file mode 100644 index 0000000..5ebd23b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/plus.hpp @@ -0,0 +1,61 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_PLUS_HPP +#define TAO_PEGTL_INTERNAL_PLUS_HPP + +#include + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "opt.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "star.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + // While plus<> could easily be implemented with + // seq< Rule, Rules ..., star< Rule, Rules ... > > we + // provide an explicit implementation to optimise away + // the otherwise created input mark. + + template< typename Rule, typename... Rules > + struct plus + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rule, Rules..., opt< plus > >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return seq< Rule, Rules... >::template match< A, M, Action, Control >( in, st... ) && star< Rule, Rules... >::template match< A, M, Action, Control >( in, st... ); + } + }; + + template< typename Rule, typename... Rules > + struct skip_control< plus< Rule, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/raise.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/raise.hpp new file mode 100644 index 0000000..7a76dd2 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/raise.hpp @@ -0,0 +1,61 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_RAISE_HPP +#define TAO_PEGTL_INTERNAL_RAISE_HPP + +#include +#include +#include + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename T > + struct raise + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + +#ifdef _MSC_VER +#pragma warning( push ) +#pragma warning( disable : 4702 ) +#endif + template< apply_mode, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + Control< T >::raise( static_cast< const Input& >( in ), st... ); + throw std::logic_error( "code should be unreachable: Control< T >::raise() did not throw an exception" ); // NOLINT, LCOV_EXCL_LINE +#ifdef _MSC_VER +#pragma warning( pop ) +#endif + } + }; + + template< typename T > + struct skip_control< raise< T > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/range.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/range.hpp new file mode 100644 index 0000000..3964463 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/range.hpp @@ -0,0 +1,60 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_RANGE_HPP +#define TAO_PEGTL_INTERNAL_RANGE_HPP + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< result_on_found R, typename Peek, typename Peek::data_t Lo, typename Peek::data_t Hi > + struct range + { + static_assert( Lo <= Hi, "invalid range detected" ); + + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< int Eol > + struct can_match_eol + { + static constexpr bool value = ( ( ( Lo <= Eol ) && ( Eol <= Hi ) ) == bool( R ) ); + }; + + template< typename Input > + static bool match( Input& in ) + { + if( !in.empty() ) { + if( const auto t = Peek::peek( in ) ) { + if( ( ( Lo <= t.data ) && ( t.data <= Hi ) ) == bool( R ) ) { + bump_impl< can_match_eol< Input::eol_t::ch >::value >::bump( in, t.size ); + return true; + } + } + } + return false; + } + }; + + template< result_on_found R, typename Peek, typename Peek::data_t Lo, typename Peek::data_t Hi > + struct skip_control< range< R, Peek, Lo, Hi > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/ranges.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/ranges.hpp new file mode 100644 index 0000000..d91f433 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/ranges.hpp @@ -0,0 +1,102 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_RANGES_HPP +#define TAO_PEGTL_INTERNAL_RANGES_HPP + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "range.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< int Eol, typename Char, Char... Cs > + struct ranges_impl; + + template< int Eol, typename Char > + struct ranges_impl< Eol, Char > + { + static constexpr bool can_match_eol = false; + + static bool match( const Char /*unused*/ ) noexcept + { + return false; + } + }; + + template< int Eol, typename Char, Char Eq > + struct ranges_impl< Eol, Char, Eq > + { + static constexpr bool can_match_eol = ( Eq == Eol ); + + static bool match( const Char c ) noexcept + { + return c == Eq; + } + }; + + template< int Eol, typename Char, Char Lo, Char Hi, Char... Cs > + struct ranges_impl< Eol, Char, Lo, Hi, Cs... > + { + static_assert( Lo <= Hi, "invalid range detected" ); + + static constexpr bool can_match_eol = ( ( ( Lo <= Eol ) && ( Eol <= Hi ) ) || ranges_impl< Eol, Char, Cs... >::can_match_eol ); + + static bool match( const Char c ) noexcept + { + return ( ( Lo <= c ) && ( c <= Hi ) ) || ranges_impl< Eol, Char, Cs... >::match( c ); + } + }; + + template< typename Peek, typename Peek::data_t... Cs > + struct ranges + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< int Eol > + struct can_match_eol + { + static constexpr bool value = ranges_impl< Eol, typename Peek::data_t, Cs... >::can_match_eol; + }; + + template< typename Input > + static bool match( Input& in ) + { + if( !in.empty() ) { + if( const auto t = Peek::peek( in ) ) { + if( ranges_impl< Input::eol_t::ch, typename Peek::data_t, Cs... >::match( t.data ) ) { + bump_impl< can_match_eol< Input::eol_t::ch >::value >::bump( in, t.size ); + return true; + } + } + } + return false; + } + }; + + template< typename Peek, typename Peek::data_t Lo, typename Peek::data_t Hi > + struct ranges< Peek, Lo, Hi > + : range< result_on_found::SUCCESS, Peek, Lo, Hi > + { + }; + + template< typename Peek, typename Peek::data_t... Cs > + struct skip_control< ranges< Peek, Cs... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/read_uint.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/read_uint.hpp new file mode 100644 index 0000000..6e9d3ae --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/read_uint.hpp @@ -0,0 +1,85 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_READ_UINT_HPP +#define TAO_PEGTL_INTERNAL_READ_UINT_HPP + +#include + +#include "../config.hpp" + +#include "endian.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct read_uint16_be + { + using type = std::uint16_t; + + static std::uint16_t read( const void* d ) noexcept + { + return be_to_h< std::uint16_t >( d ); + } + }; + + struct read_uint16_le + { + using type = std::uint16_t; + + static std::uint16_t read( const void* d ) noexcept + { + return le_to_h< std::uint16_t >( d ); + } + }; + + struct read_uint32_be + { + using type = std::uint32_t; + + static std::uint32_t read( const void* d ) noexcept + { + return be_to_h< std::uint32_t >( d ); + } + }; + + struct read_uint32_le + { + using type = std::uint32_t; + + static std::uint32_t read( const void* d ) noexcept + { + return le_to_h< std::uint32_t >( d ); + } + }; + + struct read_uint64_be + { + using type = std::uint64_t; + + static std::uint64_t read( const void* d ) noexcept + { + return be_to_h< std::uint64_t >( d ); + } + }; + + struct read_uint64_le + { + using type = std::uint64_t; + + static std::uint64_t read( const void* d ) noexcept + { + return le_to_h< std::uint64_t >( d ); + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep.hpp new file mode 100644 index 0000000..1e7e600 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep.hpp @@ -0,0 +1,75 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_REP_HPP +#define TAO_PEGTL_INTERNAL_REP_HPP + +#include "../config.hpp" + +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Num, typename... Rules > + struct rep; + + template< unsigned Num > + struct rep< Num > + : trivial< true > + { + }; + + template< typename Rule, typename... Rules > + struct rep< 0, Rule, Rules... > + : trivial< true > + { + }; + + template< unsigned Num, typename... Rules > + struct rep + { + using analyze_t = analysis::counted< analysis::rule_type::SEQ, Num, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + for( unsigned i = 0; i != Num; ++i ) { + if( !rule_conjunction< Rules... >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ) { + return false; + } + } + return m( true ); + } + }; + + template< unsigned Num, typename... Rules > + struct skip_control< rep< Num, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min.hpp new file mode 100644 index 0000000..f48b542 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min.hpp @@ -0,0 +1,28 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_REP_MIN_HPP +#define TAO_PEGTL_INTERNAL_REP_MIN_HPP + +#include "../config.hpp" + +#include "rep.hpp" +#include "seq.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Min, typename Rule, typename... Rules > + using rep_min = seq< rep< Min, Rule, Rules... >, star< Rule, Rules... > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min_max.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min_max.hpp new file mode 100644 index 0000000..d50a47f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_min_max.hpp @@ -0,0 +1,88 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_REP_MIN_MAX_HPP +#define TAO_PEGTL_INTERNAL_REP_MIN_MAX_HPP + +#include + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "not_at.hpp" +#include "rule_conjunction.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Min, unsigned Max, typename... Rules > + struct rep_min_max; + + template< unsigned Min, unsigned Max > + struct rep_min_max< Min, Max > + : trivial< false > + { + static_assert( Min <= Max, "invalid rep_min_max rule (maximum number of repetitions smaller than minimum)" ); + }; + + template< typename Rule, typename... Rules > + struct rep_min_max< 0, 0, Rule, Rules... > + : not_at< Rule, Rules... > + { + }; + + template< unsigned Min, unsigned Max, typename... Rules > + struct rep_min_max + { + using analyze_t = analysis::counted< analysis::rule_type::SEQ, Min, Rules... >; + + static_assert( Min <= Max, "invalid rep_min_max rule (maximum number of repetitions smaller than minimum)" ); + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + for( unsigned i = 0; i != Min; ++i ) { + if( !rule_conjunction< Rules... >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ) { + return false; + } + } + for( unsigned i = Min; i != Max; ++i ) { + if( !duseltronik< seq< Rules... >, A, rewind_mode::REQUIRED, Action, Control >::match( in, st... ) ) { + return m( true ); + } + } + return m( duseltronik< not_at< Rules... >, A, m_t::next_rewind_mode, Action, Control >::match( in, st... ) ); // NOTE that not_at<> will always rewind. + } + }; + + template< unsigned Min, unsigned Max, typename... Rules > + struct skip_control< rep_min_max< Min, Max, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_opt.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_opt.hpp new file mode 100644 index 0000000..3553f89 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rep_opt.hpp @@ -0,0 +1,54 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_REP_OPT_HPP +#define TAO_PEGTL_INTERNAL_REP_OPT_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Max, typename... Rules > + struct rep_opt + { + using analyze_t = analysis::generic< analysis::rule_type::OPT, Rules... >; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + for( unsigned i = 0; ( i != Max ) && duseltronik< seq< Rules... >, A, rewind_mode::REQUIRED, Action, Control >::match( in, st... ); ++i ) { + } + return true; + } + }; + + template< unsigned Max, typename... Rules > + struct skip_control< rep_opt< Max, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/require.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/require.hpp new file mode 100644 index 0000000..f03821e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/require.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_REQUIRE_HPP +#define TAO_PEGTL_INTERNAL_REQUIRE_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< unsigned Amount > + struct require; + + template<> + struct require< 0 > + : trivial< true > + { + }; + + template< unsigned Amount > + struct require + { + using analyze_t = analysis::generic< analysis::rule_type::OPT >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 0 ) ) ) + { + return in.size( Amount ) >= Amount; + } + }; + + template< unsigned Amount > + struct skip_control< require< Amount > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rule_conjunction.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rule_conjunction.hpp new file mode 100644 index 0000000..d4dd3d1 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rule_conjunction.hpp @@ -0,0 +1,63 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_RULE_CONJUNCTION_HPP +#define TAO_PEGTL_INTERNAL_RULE_CONJUNCTION_HPP + +#include "../apply_mode.hpp" +#include "../config.hpp" +#include "../rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct rule_conjunction; + + template<> + struct rule_conjunction<> + { + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& /*unused*/, States&&... /*unused*/ ) noexcept + { + return true; + } + }; + + template< typename... Rules > + struct rule_conjunction + { + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { +#ifdef __cpp_fold_expressions + return ( Control< Rules >::template match< A, M, Action, Control >( in, st... ) && ... ); +#else + bool result = true; + using swallow = bool[]; + (void)swallow{ result = result && Control< Rules >::template match< A, M, Action, Control >( in, st... )... }; + return result; +#endif + } + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rules.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rules.hpp new file mode 100644 index 0000000..6f72c0e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/rules.hpp @@ -0,0 +1,63 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_RULES_HPP +#define TAO_PEGTL_INTERNAL_RULES_HPP + +#include "action.hpp" +#include "alnum.hpp" +#include "alpha.hpp" +#include "any.hpp" +#include "apply.hpp" +#include "apply0.hpp" +#include "at.hpp" +#include "bof.hpp" +#include "bol.hpp" +#include "bytes.hpp" +#include "control.hpp" +#include "disable.hpp" +#include "discard.hpp" +#include "enable.hpp" +#include "eof.hpp" +#include "eol.hpp" +#include "eolf.hpp" +#include "identifier.hpp" +#include "if_apply.hpp" +#include "if_must.hpp" +#include "if_must_else.hpp" +#include "if_then_else.hpp" +#include "istring.hpp" +#include "list.hpp" +#include "list_must.hpp" +#include "list_tail.hpp" +#include "list_tail_pad.hpp" +#include "minus.hpp" +#include "must.hpp" +#include "not_at.hpp" +#include "one.hpp" +#include "opt.hpp" +#include "pad.hpp" +#include "pad_opt.hpp" +#include "plus.hpp" +#include "raise.hpp" +#include "range.hpp" +#include "ranges.hpp" +#include "rep.hpp" +#include "rep_min.hpp" +#include "rep_min_max.hpp" +#include "rep_opt.hpp" +#include "require.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "sor.hpp" +#include "star.hpp" +#include "star_must.hpp" +#include "state.hpp" +#include "string.hpp" +#include "three.hpp" +#include "trivial.hpp" +#include "try_catch_type.hpp" +#include "two.hpp" +#include "until.hpp" + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/seq.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/seq.hpp new file mode 100644 index 0000000..4c751c4 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/seq.hpp @@ -0,0 +1,80 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_SEQ_HPP +#define TAO_PEGTL_INTERNAL_SEQ_HPP + +#include "../config.hpp" + +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct seq; + + template<> + struct seq<> + : trivial< true > + { + }; + + template< typename Rule > + struct seq< Rule > + { + using analyze_t = typename Rule::analyze_t; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + return Control< Rule >::template match< A, M, Action, Control >( in, st... ); + } + }; + + template< typename... Rules > + struct seq + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + return m( rule_conjunction< Rules... >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ); + } + }; + + template< typename... Rules > + struct skip_control< seq< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/skip_control.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/skip_control.hpp new file mode 100644 index 0000000..29ce86f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/skip_control.hpp @@ -0,0 +1,35 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_SKIP_CONTROL_HPP +#define TAO_PEGTL_INTERNAL_SKIP_CONTROL_HPP + +#include + +#include "../config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + // This class is a simple tagging mechanism. + // By default, skip_control< Rule >::value + // is 'false'. Each internal (!) rule that should + // be hidden from the control and action class' + // callbacks simply specializes skip_control<> + // to return 'true' for the above expression. + + template< typename Rule > + struct skip_control : std::false_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/sor.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/sor.hpp new file mode 100644 index 0000000..3108a64 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/sor.hpp @@ -0,0 +1,74 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_SOR_HPP +#define TAO_PEGTL_INTERNAL_SOR_HPP + +#include "../config.hpp" + +#include "integer_sequence.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename... Rules > + struct sor; + + template<> + struct sor<> + : trivial< false > + { + }; + + template< typename... Rules > + struct sor + : sor< index_sequence_for< Rules... >, Rules... > + { + }; + + template< std::size_t... Indices, typename... Rules > + struct sor< index_sequence< Indices... >, Rules... > + { + using analyze_t = analysis::generic< analysis::rule_type::SOR, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { +#ifdef __cpp_fold_expressions + return ( Control< Rules >::template match < A, ( Indices == ( sizeof...( Rules ) - 1 ) ) ? M : rewind_mode::REQUIRED, Action, Control > ( in, st... ) || ... ); +#else + bool result = false; + using swallow = bool[]; + (void)swallow{ result = result || Control< Rules >::template match < A, ( Indices == ( sizeof...( Rules ) - 1 ) ) ? M : rewind_mode::REQUIRED, Action, Control > ( in, st... )... }; + return result; +#endif + } + }; + + template< typename... Rules > + struct skip_control< sor< Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star.hpp new file mode 100644 index 0000000..cfa3c8a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star.hpp @@ -0,0 +1,56 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_STAR_HPP +#define TAO_PEGTL_INTERNAL_STAR_HPP + +#include + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Rule, typename... Rules > + struct star + { + using analyze_t = analysis::generic< analysis::rule_type::OPT, Rule, Rules..., star >; + + template< apply_mode A, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + while( seq< Rule, Rules... >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, st... ) ) { + } + return true; + } + }; + + template< typename Rule, typename... Rules > + struct skip_control< star< Rule, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star_must.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star_must.hpp new file mode 100644 index 0000000..41b0657 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/star_must.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_STAR_MUST_HPP +#define TAO_PEGTL_INTERNAL_STAR_MUST_HPP + +#include "../config.hpp" + +#include "if_must.hpp" +#include "star.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Cond, typename... Rules > + using star_must = star< if_must< false, Cond, Rules... > >; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/state.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/state.hpp new file mode 100644 index 0000000..0d8b92a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/state.hpp @@ -0,0 +1,85 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_STATE_HPP +#define TAO_PEGTL_INTERNAL_STATE_HPP + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename State, typename... Rules > + struct state + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static auto success( State& s, const Input& in, States&&... st ) + -> decltype( s.template success< A, M, Action, Control >( in, st... ), void() ) + { + s.template success< A, M, Action, Control >( in, st... ); + } + + // NOTE: The additional "int = 0" is a work-around for missing expression SFINAE in VS2015. + + template< apply_mode, + rewind_mode, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States, + int = 0 > + static auto success( State& s, const Input& in, States&&... st ) + -> decltype( s.success( in, st... ), void() ) + { + s.success( in, st... ); + } + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + State s( static_cast< const Input& >( in ), st... ); + + if( duseltronik< seq< Rules... >, A, M, Action, Control >::match( in, s ) ) { + success< A, M, Action, Control >( s, in, st... ); + return true; + } + return false; + } + }; + + template< typename State, typename... Rules > + struct skip_control< state< State, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/string.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/string.hpp new file mode 100644 index 0000000..49cdf8f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/string.hpp @@ -0,0 +1,68 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_STRING_HPP +#define TAO_PEGTL_INTERNAL_STRING_HPP + +#include +#include + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + inline bool unsafe_equals( const char* s, const std::initializer_list< char >& l ) noexcept + { + return std::memcmp( s, &*l.begin(), l.size() ) == 0; + } + + template< char... Cs > + struct string; + + template<> + struct string<> + : trivial< true > + { + }; + + template< char... Cs > + struct string + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, sizeof...( Cs ) >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 0 ) ) ) + { + if( in.size( sizeof...( Cs ) ) >= sizeof...( Cs ) ) { + if( unsafe_equals( in.current(), { Cs... } ) ) { + bump_help< result_on_found::SUCCESS, Input, char, Cs... >( in, sizeof...( Cs ) ); + return true; + } + } + return false; + } + }; + + template< char... Cs > + struct skip_control< string< Cs... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/three.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/three.hpp new file mode 100644 index 0000000..bd6fe52 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/three.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_THREE_HPP +#define TAO_PEGTL_INTERNAL_THREE_HPP + +#include + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< char C > + struct three + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 3 ) ) ) + { + if( in.size( 3 ) >= 3 ) { + if( ( in.peek_char( 0 ) == C ) && ( in.peek_char( 1 ) == C ) && ( in.peek_char( 2 ) == C ) ) { + bump_help< result_on_found::SUCCESS, Input, char, C >( in, 3 ); + return true; + } + } + return false; + } + }; + + template< char C > + struct skip_control< three< C > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/trivial.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/trivial.hpp new file mode 100644 index 0000000..38479d2 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/trivial.hpp @@ -0,0 +1,42 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_TRIVIAL_HPP +#define TAO_PEGTL_INTERNAL_TRIVIAL_HPP + +#include "../config.hpp" + +#include "skip_control.hpp" + +#include "../analysis/counted.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< bool Result > + struct trivial + { + using analyze_t = analysis::counted< analysis::rule_type::ANY, unsigned( !Result ) >; + + template< typename Input > + static bool match( Input& /*unused*/ ) noexcept + { + return Result; + } + }; + + template< bool Result > + struct skip_control< trivial< Result > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/try_catch_type.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/try_catch_type.hpp new file mode 100644 index 0000000..e70e432 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/try_catch_type.hpp @@ -0,0 +1,72 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_TRY_CATCH_TYPE_HPP +#define TAO_PEGTL_INTERNAL_TRY_CATCH_TYPE_HPP + +#include + +#include "../config.hpp" + +#include "duseltronik.hpp" +#include "seq.hpp" +#include "skip_control.hpp" +#include "trivial.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Exception, typename... Rules > + struct try_catch_type; + + template< typename Exception > + struct try_catch_type< Exception > + : trivial< true > + { + }; + + template< typename Exception, typename... Rules > + struct try_catch_type + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + try { + return m( duseltronik< seq< Rules... >, A, m_t::next_rewind_mode, Action, Control >::match( in, st... ) ); + } + catch( const Exception& ) { + return false; + } + } + }; + + template< typename Exception, typename... Rules > + struct skip_control< try_catch_type< Exception, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/two.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/two.hpp new file mode 100644 index 0000000..69eaf4b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/two.hpp @@ -0,0 +1,52 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_TWO_HPP +#define TAO_PEGTL_INTERNAL_TWO_HPP + +#include + +#include "../config.hpp" + +#include "bump_help.hpp" +#include "result_on_found.hpp" +#include "skip_control.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< char C > + struct two + { + using analyze_t = analysis::generic< analysis::rule_type::ANY >; + + template< typename Input > + static bool match( Input& in ) noexcept( noexcept( in.size( 2 ) ) ) + { + if( in.size( 2 ) >= 2 ) { + if( ( in.peek_char( 0 ) == C ) && ( in.peek_char( 1 ) == C ) ) { + bump_help< result_on_found::SUCCESS, Input, char, C >( in, 2 ); + return true; + } + } + return false; + } + }; + + template< char C > + struct skip_control< two< C > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/until.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/until.hpp new file mode 100644 index 0000000..c6a002e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/internal/until.hpp @@ -0,0 +1,91 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_INTERNAL_UNTIL_HPP +#define TAO_PEGTL_INTERNAL_UNTIL_HPP + +#include "../config.hpp" + +#include "bytes.hpp" +#include "eof.hpp" +#include "not_at.hpp" +#include "rule_conjunction.hpp" +#include "skip_control.hpp" +#include "star.hpp" + +#include "../apply_mode.hpp" +#include "../rewind_mode.hpp" + +#include "../analysis/generic.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< typename Cond, typename... Rules > + struct until; + + template< typename Cond > + struct until< Cond > + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, star< not_at< Cond >, not_at< eof >, bytes< 1 > >, Cond >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + + while( !Control< Cond >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, st... ) ) { + if( in.empty() ) { + return false; + } + in.bump(); + } + return m( true ); + } + }; + + template< typename Cond, typename... Rules > + struct until + { + using analyze_t = analysis::generic< analysis::rule_type::SEQ, star< not_at< Cond >, not_at< eof >, Rules... >, Cond >; + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + auto m = in.template mark< M >(); + using m_t = decltype( m ); + + while( !Control< Cond >::template match< A, rewind_mode::REQUIRED, Action, Control >( in, st... ) ) { + if( !rule_conjunction< Rules... >::template match< A, m_t::next_rewind_mode, Action, Control >( in, st... ) ) { + return false; + } + } + return m( true ); + } + }; + + template< typename Cond, typename... Rules > + struct skip_control< until< Cond, Rules... > > : std::true_type + { + }; + + } // namespace internal + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/istream_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/istream_input.hpp new file mode 100644 index 0000000..f598753 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/istream_input.hpp @@ -0,0 +1,39 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_ISTREAM_INPUT_HPP +#define TAO_PEGTL_ISTREAM_INPUT_HPP + +#include + +#include "buffer_input.hpp" +#include "config.hpp" +#include "eol.hpp" + +#include "internal/istream_reader.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Eol = eol::lf_crlf > + struct istream_input + : buffer_input< internal::istream_reader, Eol > + { + template< typename T > + istream_input( std::istream& in_stream, const std::size_t in_maximum, T&& in_source ) + : buffer_input< internal::istream_reader, Eol >( std::forward< T >( in_source ), in_maximum, in_stream ) + { + } + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + istream_input( Ts&&... )->istream_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/memory_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/memory_input.hpp new file mode 100644 index 0000000..eb03184 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/memory_input.hpp @@ -0,0 +1,364 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_MEMORY_INPUT_HPP +#define TAO_PEGTL_MEMORY_INPUT_HPP + +#include +#include +#include +#include +#include +#include + +#include "config.hpp" +#include "eol.hpp" +#include "normal.hpp" +#include "nothing.hpp" +#include "position.hpp" +#include "tracking_mode.hpp" + +#include "internal/action_input.hpp" +#include "internal/at.hpp" +#include "internal/bump_impl.hpp" +#include "internal/eolf.hpp" +#include "internal/iterator.hpp" +#include "internal/marker.hpp" +#include "internal/until.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + template< tracking_mode, typename Eol, typename Source > + class memory_input_base; + + template< typename Eol, typename Source > + class memory_input_base< tracking_mode::IMMEDIATE, Eol, Source > + { + public: + using iterator_t = internal::iterator; + + template< typename T > + memory_input_base( const iterator_t& in_begin, const char* in_end, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : m_begin( in_begin.data ), + m_current( in_begin ), + m_end( in_end ), + m_source( std::forward< T >( in_source ) ) + { + } + + template< typename T > + memory_input_base( const char* in_begin, const char* in_end, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : m_begin( in_begin ), + m_current( in_begin ), + m_end( in_end ), + m_source( std::forward< T >( in_source ) ) + { + } + + memory_input_base( const memory_input_base& ) = delete; + memory_input_base( memory_input_base&& ) = delete; + + ~memory_input_base() = default; + + memory_input_base operator=( const memory_input_base& ) = delete; + memory_input_base operator=( memory_input_base&& ) = delete; + + const char* current() const noexcept + { + return m_current.data; + } + + const char* begin() const noexcept + { + return m_begin; + } + + const char* end( const std::size_t /*unused*/ = 0 ) const noexcept + { + return m_end; + } + + std::size_t byte() const noexcept + { + return m_current.byte; + } + + std::size_t line() const noexcept + { + return m_current.line; + } + + std::size_t byte_in_line() const noexcept + { + return m_current.byte_in_line; + } + + void bump( const std::size_t in_count = 1 ) noexcept + { + internal::bump( m_current, in_count, Eol::ch ); + } + + void bump_in_this_line( const std::size_t in_count = 1 ) noexcept + { + internal::bump_in_this_line( m_current, in_count ); + } + + void bump_to_next_line( const std::size_t in_count = 1 ) noexcept + { + internal::bump_to_next_line( m_current, in_count ); + } + + TAO_PEGTL_NAMESPACE::position position( const iterator_t& it ) const + { + return TAO_PEGTL_NAMESPACE::position( it, m_source ); + } + + void restart( const std::size_t in_byte = 0, const std::size_t in_line = 1, const std::size_t in_byte_in_line = 0 ) + { + m_current.data = m_begin; + m_current.byte = in_byte; + m_current.line = in_line; + m_current.byte_in_line = in_byte_in_line; + } + + protected: + const char* const m_begin; + iterator_t m_current; + const char* const m_end; + const Source m_source; + }; + + template< typename Eol, typename Source > + class memory_input_base< tracking_mode::LAZY, Eol, Source > + { + public: + using iterator_t = const char*; + + template< typename T > + memory_input_base( const internal::iterator& in_begin, const char* in_end, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : m_begin( in_begin ), + m_current( in_begin.data ), + m_end( in_end ), + m_source( std::forward< T >( in_source ) ) + { + } + + template< typename T > + memory_input_base( const char* in_begin, const char* in_end, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : m_begin( in_begin ), + m_current( in_begin ), + m_end( in_end ), + m_source( std::forward< T >( in_source ) ) + { + } + + memory_input_base( const memory_input_base& ) = delete; + memory_input_base( memory_input_base&& ) = delete; + + ~memory_input_base() = default; + + memory_input_base operator=( const memory_input_base& ) = delete; + memory_input_base operator=( memory_input_base&& ) = delete; + + const char* current() const noexcept + { + return m_current; + } + + const char* begin() const noexcept + { + return m_begin.data; + } + + const char* end( const std::size_t /*unused*/ = 0 ) const noexcept + { + return m_end; + } + + std::size_t byte() const noexcept + { + return std::size_t( current() - m_begin.data ); + } + + void bump( const std::size_t in_count = 1 ) noexcept + { + m_current += in_count; + } + + void bump_in_this_line( const std::size_t in_count = 1 ) noexcept + { + m_current += in_count; + } + + void bump_to_next_line( const std::size_t in_count = 1 ) noexcept + { + m_current += in_count; + } + + TAO_PEGTL_NAMESPACE::position position( const iterator_t it ) const + { + internal::iterator c( m_begin ); + internal::bump( c, std::size_t( it - m_begin.data ), Eol::ch ); + return TAO_PEGTL_NAMESPACE::position( c, m_source ); + } + + void restart() + { + m_current = m_begin.data; + } + + protected: + const internal::iterator m_begin; + iterator_t m_current; + const char* const m_end; + const Source m_source; + }; + + } // namespace internal + + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf, typename Source = std::string > + class memory_input + : public internal::memory_input_base< P, Eol, Source > + { + public: + static constexpr tracking_mode tracking_mode_v = P; + + using eol_t = Eol; + using source_t = Source; + + using typename internal::memory_input_base< P, Eol, Source >::iterator_t; + + using action_t = internal::action_input< memory_input >; + + using internal::memory_input_base< P, Eol, Source >::memory_input_base; + + template< typename T > + memory_input( const char* in_begin, const std::size_t in_size, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : memory_input( in_begin, in_begin + in_size, std::forward< T >( in_source ) ) + { + } + + template< typename T > + memory_input( const std::string& in_string, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : memory_input( in_string.data(), in_string.size(), std::forward< T >( in_source ) ) + { + } + + template< typename T > + memory_input( std::string&&, T&& ) = delete; + + template< typename T > + memory_input( const char* in_begin, T&& in_source ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : memory_input( in_begin, std::strlen( in_begin ), std::forward< T >( in_source ) ) + { + } + + template< typename T > + memory_input( const char* in_begin, const char* in_end, T&& in_source, const std::size_t in_byte, const std::size_t in_line, const std::size_t in_byte_in_line ) noexcept( std::is_nothrow_constructible< Source, T&& >::value ) + : memory_input( { in_begin, in_byte, in_line, in_byte_in_line }, in_end, std::forward< T >( in_source ) ) + { + } + + memory_input( const memory_input& ) = delete; + memory_input( memory_input&& ) = delete; + + ~memory_input() = default; + + memory_input operator=( const memory_input& ) = delete; + memory_input operator=( memory_input&& ) = delete; + + const Source& source() const noexcept + { + return this->m_source; + } + + bool empty() const noexcept + { + return this->current() == this->end(); + } + + std::size_t size( const std::size_t /*unused*/ = 0 ) const noexcept + { + return std::size_t( this->end() - this->current() ); + } + + char peek_char( const std::size_t offset = 0 ) const noexcept + { + return this->current()[ offset ]; + } + + std::uint8_t peek_byte( const std::size_t offset = 0 ) const noexcept + { + return static_cast< std::uint8_t >( peek_char( offset ) ); + } + + iterator_t& iterator() noexcept + { + return this->m_current; + } + + const iterator_t& iterator() const noexcept + { + return this->m_current; + } + + using internal::memory_input_base< P, Eol, Source >::position; + + TAO_PEGTL_NAMESPACE::position position() const + { + return position( iterator() ); + } + + void discard() const noexcept + { + } + + void require( const std::size_t /*unused*/ ) const noexcept + { + } + + template< rewind_mode M > + internal::marker< iterator_t, M > mark() noexcept + { + return internal::marker< iterator_t, M >( iterator() ); + } + + const char* at( const TAO_PEGTL_NAMESPACE::position& p ) const noexcept + { + return this->begin() + p.byte; + } + + const char* begin_of_line( const TAO_PEGTL_NAMESPACE::position& p ) const noexcept + { + return at( p ) - p.byte_in_line; + } + + const char* end_of_line( const TAO_PEGTL_NAMESPACE::position& p ) const noexcept + { + using input_t = memory_input< tracking_mode::LAZY, Eol, const char* >; + input_t in( at( p ), this->end(), "" ); + using grammar = internal::until< internal::at< internal::eolf > >; + normal< grammar >::match< apply_mode::NOTHING, rewind_mode::DONTCARE, nothing, normal >( in ); + return in.current(); + } + + std::string line_as_string( const TAO_PEGTL_NAMESPACE::position& p ) const + { + return std::string( begin_of_line( p ), end_of_line( p ) ); + } + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + memory_input( Ts&&... )->memory_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/mmap_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/mmap_input.hpp new file mode 100644 index 0000000..92c38f6 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/mmap_input.hpp @@ -0,0 +1,85 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_MMAP_INPUT_HPP +#define TAO_PEGTL_MMAP_INPUT_HPP + +#include +#include + +#include "config.hpp" +#include "eol.hpp" +#include "memory_input.hpp" +#include "tracking_mode.hpp" + +#if defined( __unix__ ) || ( defined( __APPLE__ ) && defined( __MACH__ ) ) +#include // Required for _POSIX_MAPPED_FILES +#endif + +#if defined( _POSIX_MAPPED_FILES ) +#include "internal/file_mapper_posix.hpp" +#elif defined( _WIN32 ) +#include "internal/file_mapper_win32.hpp" +#else +#endif + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct mmap_holder + { + const std::string filename; + const file_mapper data; + + template< typename T > + explicit mmap_holder( T&& in_filename ) + : filename( std::forward< T >( in_filename ) ), + data( filename.c_str() ) + { + } + + mmap_holder( const mmap_holder& ) = delete; + mmap_holder( mmap_holder&& ) = delete; + + ~mmap_holder() = default; + + void operator=( const mmap_holder& ) = delete; + void operator=( mmap_holder&& ) = delete; + }; + + } // namespace internal + + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf > + struct mmap_input + : private internal::mmap_holder, + public memory_input< P, Eol, const char* > + { + template< typename T > + explicit mmap_input( T&& in_filename ) + : internal::mmap_holder( std::forward< T >( in_filename ) ), + memory_input< P, Eol, const char* >( data.begin(), data.end(), filename.c_str() ) + { + } + + mmap_input( const mmap_input& ) = delete; + mmap_input( mmap_input&& ) = delete; + + ~mmap_input() = default; + + void operator=( const mmap_input& ) = delete; + void operator=( mmap_input&& ) = delete; + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + explicit mmap_input( Ts&&... )->mmap_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/normal.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/normal.hpp new file mode 100644 index 0000000..8f7949a --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/normal.hpp @@ -0,0 +1,90 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_NORMAL_HPP +#define TAO_PEGTL_NORMAL_HPP + +#include + +#include "apply_mode.hpp" +#include "config.hpp" +#include "nothing.hpp" +#include "parse_error.hpp" +#include "rewind_mode.hpp" + +#include "internal/demangle.hpp" +#include "internal/dusel_mode.hpp" +#include "internal/duseltronik.hpp" +#include "internal/has_apply.hpp" +#include "internal/has_apply0.hpp" +#include "internal/skip_control.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Rule > + struct normal + { + template< typename Input, typename... States > + static void start( const Input& /*unused*/, States&&... /*unused*/ ) noexcept + { + } + + template< typename Input, typename... States > + static void success( const Input& /*unused*/, States&&... /*unused*/ ) noexcept + { + } + + template< typename Input, typename... States > + static void failure( const Input& /*unused*/, States&&... /*unused*/ ) noexcept + { + } + + template< typename Input, typename... States > + static void raise( const Input& in, States&&... /*unused*/ ) + { + throw parse_error( "parse error matching " + internal::demangle< Rule >(), in ); + } + + template< template< typename... > class Action, typename Input, typename... States > + static auto apply0( const Input& /*unused*/, States&&... st ) + -> decltype( Action< Rule >::apply0( st... ) ) + { + return Action< Rule >::apply0( st... ); + } + + template< template< typename... > class Action, typename Iterator, typename Input, typename... States > + static auto apply( const Iterator& begin, const Input& in, States&&... st ) + -> decltype( Action< Rule >::apply( std::declval< typename Input::action_t >(), st... ) ) + { + const typename Input::action_t action_input( begin, in ); + return Action< Rule >::apply( action_input, st... ); + } + + template< apply_mode A, + rewind_mode M, + template< typename... > class Action, + template< typename... > class Control, + typename Input, + typename... States > + static bool match( Input& in, States&&... st ) + { + constexpr char use_control = !internal::skip_control< Rule >::value; + constexpr char use_action = use_control && ( A == apply_mode::ACTION ) && ( !is_nothing< Action, Rule >::value ); + constexpr char use_apply_void = use_action && internal::has_apply< Action< Rule >, void, typename Input::action_t, States... >::value; + constexpr char use_apply_bool = use_action && internal::has_apply< Action< Rule >, bool, typename Input::action_t, States... >::value; + constexpr char use_apply0_void = use_action && internal::has_apply0< Action< Rule >, void, States... >::value; + constexpr char use_apply0_bool = use_action && internal::has_apply0< Action< Rule >, bool, States... >::value; + static_assert( !use_action || use_apply_bool || use_apply_void || use_apply0_bool || use_apply0_void, "actions not disabled but no apply() or apply0() found" ); + static_assert( use_apply_void + use_apply_bool + use_apply0_void + use_apply0_bool < 2, "both apply() and apply0() defined" ); + constexpr auto mode = static_cast< dusel_mode >( use_control + use_apply_void + 2 * use_apply_bool + 3 * use_apply0_void + 4 * use_apply0_bool ); + return internal::duseltronik< Rule, A, M, Action, Control, mode >::match( in, st... ); + } + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/nothing.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/nothing.hpp new file mode 100644 index 0000000..9d2ae16 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/nothing.hpp @@ -0,0 +1,27 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_NOTHING_HPP +#define TAO_PEGTL_NOTHING_HPP + +#include + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Rule > + struct nothing + { + }; + + template< template< typename... > class Action, typename Rule > + using is_nothing = std::is_base_of< nothing< Rule >, Action< Rule > >; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/parse.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/parse.hpp new file mode 100644 index 0000000..4a1fc8d --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/parse.hpp @@ -0,0 +1,53 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_PARSE_HPP +#define TAO_PEGTL_PARSE_HPP + +#include "apply_mode.hpp" +#include "config.hpp" +#include "normal.hpp" +#include "nothing.hpp" +#include "parse_error.hpp" +#include "rewind_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + template< typename Rule, + template< typename... > class Action = nothing, + template< typename... > class Control = normal, + apply_mode A = apply_mode::ACTION, + rewind_mode M = rewind_mode::REQUIRED, + typename Input, + typename... States > + bool parse( Input&& in, States&&... st ) + { + return Control< Rule >::template match< A, M, Action, Control >( in, st... ); + } + + template< typename Rule, + template< typename... > class Action = nothing, + template< typename... > class Control = normal, + apply_mode A = apply_mode::ACTION, + rewind_mode M = rewind_mode::REQUIRED, + typename Outer, + typename Input, + typename... States > + bool parse_nested( const Outer& oi, Input&& in, States&&... st ) + { + try { + return parse< Rule, Action, Control, A, M >( in, st... ); + } + catch( parse_error& e ) { + e.positions.push_back( oi.position() ); + throw; + } + } + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/parse_error.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/parse_error.hpp new file mode 100644 index 0000000..4d62811 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/parse_error.hpp @@ -0,0 +1,45 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_PARSE_ERROR_HPP +#define TAO_PEGTL_PARSE_ERROR_HPP + +#include +#include + +#include "config.hpp" +#include "position.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + struct parse_error + : public std::runtime_error + { + parse_error( const std::string& msg, std::vector< position >&& in_positions ) + : std::runtime_error( msg ), + positions( std::move( in_positions ) ) + { + } + + template< typename Input > + parse_error( const std::string& msg, const Input& in ) + : parse_error( msg, in.position() ) + { + } + + parse_error( const std::string& msg, const position& pos ) + : std::runtime_error( to_string( pos ) + ": " + msg ), + positions( 1, pos ) + { + } + + std::vector< position > positions; + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/position.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/position.hpp new file mode 100644 index 0000000..a7fe2b3 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/position.hpp @@ -0,0 +1,54 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_POSITION_HPP +#define TAO_PEGTL_POSITION_HPP + +#include +#include +#include +#include +#include + +#include "config.hpp" + +#include "internal/iterator.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + struct position + { + template< typename T > + position( const internal::iterator& in_iter, T&& in_source ) + : byte( in_iter.byte ), + line( in_iter.line ), + byte_in_line( in_iter.byte_in_line ), + source( std::forward< T >( in_source ) ) + { + } + + std::size_t byte; + std::size_t line; + std::size_t byte_in_line; + std::string source; + }; + + inline std::ostream& operator<<( std::ostream& o, const position& p ) + { + return o << p.source << ':' << p.line << ':' << p.byte_in_line << '(' << p.byte << ')'; + } + + inline std::string to_string( const position& p ) + { + std::ostringstream o; + o << p; + return o.str(); + } + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/read_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/read_input.hpp new file mode 100644 index 0000000..8d7eb04 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/read_input.hpp @@ -0,0 +1,80 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_READ_INPUT_HPP +#define TAO_PEGTL_READ_INPUT_HPP + +#include + +#include "config.hpp" +#include "eol.hpp" +#include "string_input.hpp" +#include "tracking_mode.hpp" + +#include "internal/file_reader.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct filename_holder + { + const std::string filename; + + template< typename T > + explicit filename_holder( T&& in_filename ) + : filename( std::forward< T >( in_filename ) ) + { + } + + filename_holder( const filename_holder& ) = delete; + filename_holder( filename_holder&& ) = delete; + + ~filename_holder() = default; + + void operator=( const filename_holder& ) = delete; + void operator=( filename_holder&& ) = delete; + }; + + } // namespace internal + + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf > + struct read_input + : private internal::filename_holder, + public string_input< P, Eol, const char* > + { + template< typename T > + explicit read_input( T&& in_filename ) + : internal::filename_holder( std::forward< T >( in_filename ) ), + string_input< P, Eol, const char* >( internal::file_reader( filename.c_str() ).read(), filename.c_str() ) + { + } + + template< typename T > + read_input( FILE* in_file, T&& in_filename ) + : internal::filename_holder( std::forward< T >( in_filename ) ), + string_input< P, Eol, const char* >( internal::file_reader( in_file, filename.c_str() ).read(), filename.c_str() ) + { + } + + read_input( const read_input& ) = delete; + read_input( read_input&& ) = delete; + + ~read_input() = default; + + void operator=( const read_input& ) = delete; + void operator=( read_input&& ) = delete; + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + explicit read_input( Ts&&... )->read_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/rewind_mode.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/rewind_mode.hpp new file mode 100644 index 0000000..c12fddc --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/rewind_mode.hpp @@ -0,0 +1,24 @@ +// Copyright (c) 2016-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_REWIND_MODE_HPP +#define TAO_PEGTL_REWIND_MODE_HPP + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + enum class rewind_mode : char + { + ACTIVE, + REQUIRED, + DONTCARE + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/rules.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/rules.hpp new file mode 100644 index 0000000..53364a4 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/rules.hpp @@ -0,0 +1,70 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_RULES_HPP +#define TAO_PEGTL_RULES_HPP + +#include "config.hpp" +#include "parse_error.hpp" + +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + // clang-format off + template< typename... Actions > struct apply : internal::apply< Actions... > {}; + template< typename... Actions > struct apply0 : internal::apply0< Actions... > {}; + template< template< typename... > class Action, typename... Rules > struct action : internal::action< Action, Rules... > {}; + template< typename... Rules > struct at : internal::at< Rules... > {}; + struct bof : internal::bof {}; + struct bol : internal::bol {}; + template< unsigned Num > struct bytes : internal::bytes< Num > {}; + template< template< typename... > class Control, typename... Rules > struct control : internal::control< Control, Rules... > {}; + template< typename... Rules > struct disable : internal::disable< Rules... > {}; + struct discard : internal::discard {}; + template< typename... Rules > struct enable : internal::enable< Rules... > {}; + struct eof : internal::eof {}; + struct failure : internal::trivial< false > {}; + template< typename Rule, typename... Actions > struct if_apply : internal::if_apply< Rule, Actions... > {}; + template< typename Cond, typename... Thens > struct if_must : internal::if_must< false, Cond, Thens... > {}; + template< typename Cond, typename Then, typename Else > struct if_must_else : internal::if_must_else< Cond, Then, Else > {}; + template< typename Cond, typename Then, typename Else > struct if_then_else : internal::if_then_else< Cond, Then, Else > {}; + template< typename Rule, typename Sep, typename Pad = void > struct list : internal::list< Rule, internal::pad< Sep, Pad > > {}; + template< typename Rule, typename Sep > struct list< Rule, Sep, void > : internal::list< Rule, Sep > {}; + template< typename Rule, typename Sep, typename Pad = void > struct list_must : internal::list_must< Rule, internal::pad< Sep, Pad > > {}; + template< typename Rule, typename Sep > struct list_must< Rule, Sep, void > : internal::list_must< Rule, Sep > {}; + template< typename Rule, typename Sep, typename Pad = void > struct list_tail : internal::list_tail_pad< Rule, Sep, Pad > {}; + template< typename Rule, typename Sep > struct list_tail< Rule, Sep, void > : internal::list_tail< Rule, Sep > {}; + template< typename M, typename S > struct minus : internal::minus< M, S > {}; + template< typename... Rules > struct must : internal::must< Rules... > {}; + template< typename... Rules > struct not_at : internal::not_at< Rules... > {}; + template< typename... Rules > struct opt : internal::opt< Rules... > {}; + template< typename Cond, typename... Rules > struct opt_must : internal::if_must< true, Cond, Rules... > {}; + template< typename Rule, typename Pad1, typename Pad2 = Pad1 > struct pad : internal::pad< Rule, Pad1, Pad2 > {}; + template< typename Rule, typename Pad > struct pad_opt : internal::pad_opt< Rule, Pad > {}; + template< typename Rule, typename... Rules > struct plus : internal::plus< Rule, Rules... > {}; + template< typename Exception > struct raise : internal::raise< Exception > {}; + template< unsigned Num, typename... Rules > struct rep : internal::rep< Num, Rules... > {}; + template< unsigned Max, typename... Rules > struct rep_max : internal::rep_min_max< 0, Max, Rules... > {}; + template< unsigned Min, typename Rule, typename... Rules > struct rep_min : internal::rep_min< Min, Rule, Rules... > {}; + template< unsigned Min, unsigned Max, typename... Rules > struct rep_min_max : internal::rep_min_max< Min, Max, Rules... > {}; + template< unsigned Max, typename... Rules > struct rep_opt : internal::rep_opt< Max, Rules... > {}; + template< unsigned Amount > struct require : internal::require< Amount > {}; + template< typename... Rules > struct seq : internal::seq< Rules... > {}; + template< typename... Rules > struct sor : internal::sor< Rules... > {}; + template< typename Rule, typename... Rules > struct star : internal::star< Rule, Rules... > {}; + template< typename Cond, typename... Rules > struct star_must : internal::star_must< Cond, Rules... > {}; + template< typename State, typename... Rules > struct state : internal::state< State, Rules... > {}; + struct success : internal::trivial< true > {}; + template< typename... Rules > struct try_catch : internal::try_catch_type< parse_error, Rules... > {}; + template< typename Exception, typename... Rules > struct try_catch_type : internal::try_catch_type< Exception, Rules... > {}; + template< typename Cond, typename... Rules > struct until : internal::until< Cond, Rules... > {}; + // clang-format on + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/string_input.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/string_input.hpp new file mode 100644 index 0000000..ebce236 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/string_input.hpp @@ -0,0 +1,72 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_STRING_INPUT_HPP +#define TAO_PEGTL_STRING_INPUT_HPP + +#include +#include + +#include "config.hpp" +#include "eol.hpp" +#include "memory_input.hpp" +#include "tracking_mode.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace internal + { + struct string_holder + { + const std::string data; + + template< typename T > + explicit string_holder( T&& in_data ) + : data( std::forward< T >( in_data ) ) + { + } + + string_holder( const string_holder& ) = delete; + string_holder( string_holder&& ) = delete; + + ~string_holder() = default; + + void operator=( const string_holder& ) = delete; + void operator=( string_holder&& ) = delete; + }; + + } // namespace internal + + template< tracking_mode P = tracking_mode::IMMEDIATE, typename Eol = eol::lf_crlf, typename Source = std::string > + struct string_input + : private internal::string_holder, + public memory_input< P, Eol, Source > + { + template< typename V, typename T, typename... Ts > + explicit string_input( V&& in_data, T&& in_source, Ts&&... ts ) + : internal::string_holder( std::forward< V >( in_data ) ), + memory_input< P, Eol, Source >( data.data(), data.size(), std::forward< T >( in_source ), std::forward< Ts >( ts )... ) + { + } + + string_input( const string_input& ) = delete; + string_input( string_input&& ) = delete; + + ~string_input() = default; + + void operator=( const string_input& ) = delete; + void operator=( string_input&& ) = delete; + }; + +#ifdef __cpp_deduction_guides + template< typename... Ts > + explicit string_input( Ts&&... )->string_input<>; +#endif + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/tracking_mode.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/tracking_mode.hpp new file mode 100644 index 0000000..c470042 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/tracking_mode.hpp @@ -0,0 +1,23 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_TRACKING_MODE_HPP +#define TAO_PEGTL_TRACKING_MODE_HPP + +#include "config.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + enum class tracking_mode : bool + { + IMMEDIATE, + LAZY + }; + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/uint16.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint16.hpp new file mode 100644 index 0000000..d913ed2 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint16.hpp @@ -0,0 +1,66 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UINT16_HPP +#define TAO_PEGTL_UINT16_HPP + +#include "config.hpp" + +#include "internal/peek_mask_uint.hpp" +#include "internal/peek_uint.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace uint16_be + { + // clang-format off + struct any : internal::any< internal::peek_uint16_be > {}; + + template< std::uint16_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint16_be, Cs... > {}; + template< std::uint16_t Lo, std::uint16_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint16_be, Lo, Hi > {}; + template< std::uint16_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint16_be, Cs... > {}; + template< std::uint16_t Lo, std::uint16_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint16_be, Lo, Hi > {}; + template< std::uint16_t... Cs > struct ranges : internal::ranges< internal::peek_uint16_be, Cs... > {}; + template< std::uint16_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint16_be, Cs >... > {}; + + template< std::uint16_t M, std::uint16_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint16_be< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t Lo, std::uint16_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint16_be< M >, Lo, Hi > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_be< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t Lo, std::uint16_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_be< M >, Lo, Hi > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint16_be< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_be< M >, Cs >... > {}; + // clang-format on + + } // namespace uint16_be + + namespace uint16_le + { + // clang-format off + struct any : internal::any< internal::peek_uint16_le > {}; + + template< std::uint16_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint16_le, Cs... > {}; + template< std::uint16_t Lo, std::uint16_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint16_le, Lo, Hi > {}; + template< std::uint16_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint16_le, Cs... > {}; + template< std::uint16_t Lo, std::uint16_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint16_le, Lo, Hi > {}; + template< std::uint16_t... Cs > struct ranges : internal::ranges< internal::peek_uint16_le, Cs... > {}; + template< std::uint16_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint16_le, Cs >... > {}; + + template< std::uint16_t M, std::uint16_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint16_le< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t Lo, std::uint16_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint16_le< M >, Lo, Hi > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_le< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t Lo, std::uint16_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_le< M >, Lo, Hi > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint16_le< M >, Cs... > {}; + template< std::uint16_t M, std::uint16_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint16_le< M >, Cs >... > {}; + // clang-format on + + } // namespace uint16_le + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/uint32.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint32.hpp new file mode 100644 index 0000000..12f5617 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint32.hpp @@ -0,0 +1,66 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UINT32_HPP +#define TAO_PEGTL_UINT32_HPP + +#include "config.hpp" + +#include "internal/peek_mask_uint.hpp" +#include "internal/peek_uint.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace uint32_be + { + // clang-format off + struct any : internal::any< internal::peek_uint32_be > {}; + + template< std::uint32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint32_be, Cs... > {}; + template< std::uint32_t Lo, std::uint32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint32_be, Lo, Hi > {}; + template< std::uint32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint32_be, Cs... > {}; + template< std::uint32_t Lo, std::uint32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint32_be, Lo, Hi > {}; + template< std::uint32_t... Cs > struct ranges : internal::ranges< internal::peek_uint32_be, Cs... > {}; + template< std::uint32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint32_be, Cs >... > {}; + + template< std::uint32_t M, std::uint32_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint32_be< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t Lo, std::uint32_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint32_be< M >, Lo, Hi > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_be< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t Lo, std::uint32_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_be< M >, Lo, Hi > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint32_be< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_be< M >, Cs >... > {}; + // clang-format on + + } // namespace uint32_be + + namespace uint32_le + { + // clang-format off + struct any : internal::any< internal::peek_uint32_le > {}; + + template< std::uint32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint32_le, Cs... > {}; + template< std::uint32_t Lo, std::uint32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint32_le, Lo, Hi > {}; + template< std::uint32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint32_le, Cs... > {}; + template< std::uint32_t Lo, std::uint32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint32_le, Lo, Hi > {}; + template< std::uint32_t... Cs > struct ranges : internal::ranges< internal::peek_uint32_le, Cs... > {}; + template< std::uint32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint32_le, Cs >... > {}; + + template< std::uint32_t M, std::uint32_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint32_le< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t Lo, std::uint32_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint32_le< M >, Lo, Hi > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_le< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t Lo, std::uint32_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_le< M >, Lo, Hi > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint32_le< M >, Cs... > {}; + template< std::uint32_t M, std::uint32_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint32_le< M >, Cs >... > {}; + // clang-format on + + } // namespace uint32_le + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/uint64.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint64.hpp new file mode 100644 index 0000000..f6d2f7c --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint64.hpp @@ -0,0 +1,67 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UINT64_HPP +#define TAO_PEGTL_UINT64_HPP + +#include "config.hpp" + +#include "internal/peek_mask_uint.hpp" +#include "internal/peek_uint.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace uint64_be + { + // clang-format off + struct any : internal::any< internal::peek_uint64_be > {}; + + template< std::uint64_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint64_be, Cs... > {}; + template< std::uint64_t Lo, std::uint64_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint64_be, Lo, Hi > {}; + template< std::uint64_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint64_be, Cs... > {}; + template< std::uint64_t Lo, std::uint64_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint64_be, Lo, Hi > {}; + template< std::uint64_t... Cs > struct ranges : internal::ranges< internal::peek_uint64_be, Cs... > {}; + template< std::uint64_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint64_be, Cs >... > {}; + + + template< std::uint64_t M, std::uint64_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint64_be< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t Lo, std::uint64_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint64_be< M >, Lo, Hi > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_be< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t Lo, std::uint64_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_be< M >, Lo, Hi > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint64_be< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_be< M >, Cs >... > {}; + // clang-format on + + } // namespace uint64_be + + namespace uint64_le + { + // clang-format off + struct any : internal::any< internal::peek_uint64_le > {}; + + template< std::uint64_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint64_le, Cs... > {}; + template< std::uint64_t Lo, std::uint64_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint64_le, Lo, Hi > {}; + template< std::uint64_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint64_le, Cs... > {}; + template< std::uint64_t Lo, std::uint64_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint64_le, Lo, Hi > {}; + template< std::uint64_t... Cs > struct ranges : internal::ranges< internal::peek_uint64_le, Cs... > {}; + template< std::uint64_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint64_le, Cs >... > {}; + + template< std::uint64_t M, std::uint64_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint64_le< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t Lo, std::uint64_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint64_le< M >, Lo, Hi > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_le< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t Lo, std::uint64_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_le< M >, Lo, Hi > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint64_le< M >, Cs... > {}; + template< std::uint64_t M, std::uint64_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint64_le< M >, Cs >... > {}; + // clang-format on + + } // namespace uint64_le + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/uint8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint8.hpp new file mode 100644 index 0000000..694c40b --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/uint8.hpp @@ -0,0 +1,44 @@ +// Copyright (c) 2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UINT8_HPP +#define TAO_PEGTL_UINT8_HPP + +#include "config.hpp" + +#include "internal/peek_mask_uint8.hpp" +#include "internal/peek_uint8.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace uint8 + { + // clang-format off + struct any : internal::any< internal::peek_uint8 > {}; + + template< std::uint8_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_uint8, Cs... > {}; + template< std::uint8_t Lo, std::uint8_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_uint8, Lo, Hi > {}; + template< std::uint8_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_uint8, Cs... > {}; + template< std::uint8_t Lo, std::uint8_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_uint8, Lo, Hi > {}; + template< std::uint8_t... Cs > struct ranges : internal::ranges< internal::peek_uint8, Cs... > {}; + template< std::uint8_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_uint8, Cs >... > {}; + + template< std::uint8_t M, std::uint8_t... Cs > struct mask_not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_mask_uint8< M >, Cs... > {}; + template< std::uint8_t M, std::uint8_t Lo, std::uint8_t Hi > struct mask_not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_mask_uint8< M >, Lo, Hi > {}; + template< std::uint8_t M, std::uint8_t... Cs > struct mask_one : internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint8< M >, Cs... > {}; + template< std::uint8_t M, std::uint8_t Lo, std::uint8_t Hi > struct mask_range : internal::range< internal::result_on_found::SUCCESS, internal::peek_mask_uint8< M >, Lo, Hi > {}; + template< std::uint8_t M, std::uint8_t... Cs > struct mask_ranges : internal::ranges< internal::peek_mask_uint8< M >, Cs... > {}; + template< std::uint8_t M, std::uint8_t... Cs > struct mask_string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_mask_uint8< M >, Cs >... > {}; + // clang-format on + + } // namespace uint8 + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/utf16.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf16.hpp new file mode 100644 index 0000000..cb47597 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf16.hpp @@ -0,0 +1,53 @@ +// Copyright (c) 2015-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UTF16_HPP +#define TAO_PEGTL_UTF16_HPP + +#include "config.hpp" + +#include "internal/peek_utf16.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf16_be + { + // clang-format off + struct any : internal::any< internal::peek_utf16_be > {}; + struct bom : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_be, 0xfeff > {}; + template< char32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_utf16_be, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_utf16_be, Lo, Hi > {}; + template< char32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_be, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_utf16_be, Lo, Hi > {}; + template< char32_t... Cs > struct ranges : internal::ranges< internal::peek_utf16_be, Cs... > {}; + template< char32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_be, Cs >... > {}; + // clang-format on + + } // namespace utf16_be + + namespace utf16_le + { + // clang-format off + struct any : internal::any< internal::peek_utf16_le > {}; + struct bom : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_le, 0xfeff > {}; + template< char32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_utf16_le, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_utf16_le, Lo, Hi > {}; + template< char32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_le, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_utf16_le, Lo, Hi > {}; + template< char32_t... Cs > struct ranges : internal::ranges< internal::peek_utf16_le, Cs... > {}; + template< char32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_utf16_le, Cs >... > {}; + // clang-format on + + } // namespace utf16_le + + namespace utf16 = TAO_PEGTL_NATIVE_UTF16; // NOLINT(misc-unused-alias-decls) + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/utf32.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf32.hpp new file mode 100644 index 0000000..34e102f --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf32.hpp @@ -0,0 +1,53 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UTF32_HPP +#define TAO_PEGTL_UTF32_HPP + +#include "config.hpp" + +#include "internal/peek_utf32.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf32_be + { + // clang-format off + struct any : internal::any< internal::peek_utf32_be > {}; + struct bom : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_be, 0xfeff > {}; + template< char32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_utf32_be, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_utf32_be, Lo, Hi > {}; + template< char32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_be, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_utf32_be, Lo, Hi > {}; + template< char32_t... Cs > struct ranges : internal::ranges< internal::peek_utf32_be, Cs... > {}; + template< char32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_be, Cs >... > {}; + // clang-format on + + } // namespace utf32_be + + namespace utf32_le + { + // clang-format off + struct any : internal::any< internal::peek_utf32_le > {}; + struct bom : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_le, 0xfeff > {}; + template< char32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_utf32_le, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_utf32_le, Lo, Hi > {}; + template< char32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_le, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_utf32_le, Lo, Hi > {}; + template< char32_t... Cs > struct ranges : internal::ranges< internal::peek_utf32_le, Cs... > {}; + template< char32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_utf32_le, Cs >... > {}; + // clang-format on + + } // namespace utf32_le + + namespace utf32 = TAO_PEGTL_NATIVE_UTF32; // NOLINT(misc-unused-alias-decls) + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/utf8.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf8.hpp new file mode 100644 index 0000000..c76e83e --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/utf8.hpp @@ -0,0 +1,36 @@ +// Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_UTF8_HPP +#define TAO_PEGTL_UTF8_HPP + +#include "config.hpp" + +#include "internal/peek_utf8.hpp" +#include "internal/result_on_found.hpp" +#include "internal/rules.hpp" + +namespace tao +{ + namespace TAO_PEGTL_NAMESPACE + { + namespace utf8 + { + // clang-format off + struct any : internal::any< internal::peek_utf8 > {}; + struct bom : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf8, 0xfeff > {}; + template< char32_t... Cs > struct not_one : internal::one< internal::result_on_found::FAILURE, internal::peek_utf8, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct not_range : internal::range< internal::result_on_found::FAILURE, internal::peek_utf8, Lo, Hi > {}; + template< char32_t... Cs > struct one : internal::one< internal::result_on_found::SUCCESS, internal::peek_utf8, Cs... > {}; + template< char32_t Lo, char32_t Hi > struct range : internal::range< internal::result_on_found::SUCCESS, internal::peek_utf8, Lo, Hi > {}; + template< char32_t... Cs > struct ranges : internal::ranges< internal::peek_utf8, Cs... > {}; + template< char32_t... Cs > struct string : internal::seq< internal::one< internal::result_on_found::SUCCESS, internal::peek_utf8, Cs >... > {}; + // clang-format on + + } // namespace utf8 + + } // namespace TAO_PEGTL_NAMESPACE + +} // namespace tao + +#endif diff --git a/cpp_to_py/common/lib/spef/pegtl/pegtl/version.hpp b/cpp_to_py/common/lib/spef/pegtl/pegtl/version.hpp new file mode 100644 index 0000000..6db7979 --- /dev/null +++ b/cpp_to_py/common/lib/spef/pegtl/pegtl/version.hpp @@ -0,0 +1,19 @@ +// Copyright (c) 2017-2018 Dr. Colin Hirsch and Daniel Frey +// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/ + +#ifndef TAO_PEGTL_VERSION_HPP +#define TAO_PEGTL_VERSION_HPP + +#define TAO_PEGTL_VERSION "2.7.0" + +#define TAO_PEGTL_VERSION_MAJOR 2 +#define TAO_PEGTL_VERSION_MINOR 7 +#define TAO_PEGTL_VERSION_PATCH 0 + +// Compatibility, remove with 3.0 +#define TAOCPP_PEGTL_VERSION TAO_PEGTL_VERSION +#define TAOCPP_PEGTL_VERSION_MAJOR TAO_PEGTL_VERSION_MAJOR +#define TAOCPP_PEGTL_VERSION_MINOR TAO_PEGTL_VERSION_MINOR +#define TAOCPP_PEGTL_VERSION_PATCH TAO_PEGTL_VERSION_PATCH + +#endif diff --git a/cpp_to_py/common/lib/tokenizer.cpp b/cpp_to_py/common/lib/tokenizer.cpp new file mode 100755 index 0000000..81dec50 --- /dev/null +++ b/cpp_to_py/common/lib/tokenizer.cpp @@ -0,0 +1,163 @@ +#include "tokenizer.h" + +// TODO +// 1. Consider removing the utf-8 bom (https://github.com/zer4tul/utf8-bom-strip) + +namespace gt { + +std::string to_lower(std::string s) { + std::transform(s.begin(), s.end(), s.begin(), [] (auto c) { + return std::tolower(c); + }); + return s; +} + +std::string to_upper(std::string s) { + std::transform(s.begin(), s.end(), s.begin(), [] (auto c) { + return std::toupper(c); + }); + return s; +} + +std::string remove_quote(std::string s) { + s.erase(std::remove( s.begin(), s.end(), '\"'), s.end()); + return s; +} + +std::string unquoted(std::string s) { + if(s.size() >= 2 && s.front() == '\"' && s.back() == '\"') { + return s.substr(1, s.size() - 2); + } + else return s; +} + +bool is_numeric(const std::string& token) { + return std::regex_match(token, std::regex("(\\+|-)?[0-9]*(\\.?([0-9]+))$")); +} + +bool is_array(const std::string& token) { + return std::regex_match(token, std::regex("[a-zA-Z_][a-zA-Z_0-9]*(\\[[0-9]+\\])+")); +} + +bool is_word(const std::string& token) { + return std::regex_match(token, std::regex("[a-zA-Z_][a-zA-Z_0-9]*")); +} + + +std::vector split(const std::string& str, std::string_view dels) { + + // Parse the token. + std::string token; + std::vector tokens; + + for(size_t i=0; i tokenize( + const std::filesystem::path& path, + std::string_view dels, + std::string_view exps +) { + + using namespace std::literals::string_literals; + + std::ifstream ifs(path, std::ios::ate); + + if(!ifs.good()) { + //throw std::invalid_argument("failed to open the file '"s + path.c_str() + '\''); + return {}; + } + + // Read the file to a local buffer. + size_t fsize = ifs.tellg(); + ifs.seekg(0, std::ios::beg); + std::vector buffer(fsize + 1); + ifs.read(buffer.data(), fsize); + buffer[fsize] = 0; + + // Mart out the comment + for(size_t i=0; i tokens; + + for(size_t i=0; i +auto find_quote_pair(const I b, const I e) { + + if(auto l = std::find(b, e, '"'); l == e) { + return std::make_pair(e, e); + } + else { + if(auto r = std::find(std::next(l), e, '"'); r == e) { + return std::make_pair(e, e); + } + else { + return std::make_pair(l, r); + } + } +} + +template +auto find_brace_pair(const I b, const I e) { + + auto l = std::find(b, e, '{'); + auto r = l; + + int stack = 0; + + while(r != e) { + if(*r == '{') ++stack; + else if(*r == '}') --stack; + if(stack == 0) break; + ++r; + } + + if(l == e || r == e) { + return std::make_pair(e, e); + } + + return std::make_pair(l, r); +} + +template +auto find_bracket_pair(const I b, const I e) { + + auto l = std::find(b, e, '['); + auto r = l; + + int stack = 0; + + while(r != e) { + if(*r == '[') ++stack; + else if(*r == ']') --stack; + if(stack == 0) break; + ++r; + } + + if(l == e || r == e) { + return std::make_pair(e, e); + } + + return std::make_pair(l, r); +} + +template +auto on_next_parentheses(const I b, const I e, C&& c) { + + auto l = std::find(b, e, "("); + auto r = l; + //std::find(l, e, ")"); + + int stack = 0; + + while(r != e) { + if(*r == "(") { + ++stack; + } + else if(*r == ")") { + --stack; + } + if(stack == 0) { + break; + } + ++r; + } + + if(l == e || r == e) return e; + + for(++l; l != r; ++l) { + c(*l); + } + + return r; +} + +std::vector tokenize(const std::filesystem::path&, std::string_view="", std::string_view=""); +std::vector split(const std::string&, std::string_view=""); + +}; // namespace gt diff --git a/cpp_to_py/common/lib/unit.cpp b/cpp_to_py/common/lib/unit.cpp new file mode 100755 index 0000000..9216706 --- /dev/null +++ b/cpp_to_py/common/lib/unit.cpp @@ -0,0 +1,291 @@ +#include "unit.h" + +namespace gt { + +std::optional make_time_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(s)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s* 1_s; + } + else if(b == "f") { + return s * 1_fs; + } + else if(b == "p") { + return s * 1_ps; + } + else if(b == "n") { + return s * 1_ns; + } + else if(b == "u") { + return s * 1_us; + } + else if(b == "m") { + return s * 1_ms; + } + else if(b == "k" || b == "K") { + return s * 1_ks; + } + else if(b == "M") { + return s * 1_Ms; + } + else return std::nullopt; + } + else return std::nullopt; +} + +std::optional make_power_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(W)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s * 1_W; + } + else if(b == "f") { + return s * 1_fW; + } + else if(b == "p") { + return s * 1_pW; + } + else if(b == "n") { + return s * 1_nW; + } + else if(b == "u") { + return s * 1_uW; + } + else if(b == "m") { + return s * 1_mW; + } + else if(b == "k" || b == "K") { + return s * 1_kW; + } + else if(b == "M") { + return s * 1_MW; + } + else { + return std::nullopt; + } + } + else return std::nullopt; +} + +std::optional make_capacitance_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(F)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s * 1_F; + } + else if(b == "f") { + return s * 1_fF; + } + else if(b == "p") { + return s * 1_pF; + } + else if(b == "n") { + return s * 1_nF; + } + else if(b == "u") { + return s * 1_uF; + } + else if(b == "m") { + return s * 1_mF; + } + else if(b == "k" || b == "K") { + return s * 1_kF; + } + else if(b == "M") { + return s * 1_MF; + } + else { + return std::nullopt; + } + } + else return std::nullopt; +} + +std::optional make_voltage_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(V)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s * 1_V; + } + else if(b == "f") { + return s * 1_fV; + } + else if(b == "p") { + return s * 1_pV; + } + else if(b == "n") { + return s * 1_nV; + } + else if(b == "u") { + return s * 1_uV; + } + else if(b == "m") { + return s * 1_mV; + } + else if(b == "k" || b == "K") { + return s * 1_kV; + } + else if(b == "M") { + return s * 1_MV; + } + else { + return std::nullopt; + } + } + else return std::nullopt; +} + +std::optional make_current_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(A)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s * 1_A; + } + else if(b == "f") { + return s * 1_fA; + } + else if(b == "p") { + return s * 1_pA; + } + else if(b == "n") { + return s * 1_nA; + } + else if(b == "u") { + return s * 1_uA; + } + else if(b == "m") { + return s * 1_mA; + } + else if(b == "k" || b == "K") { + return s * 1_kA; + } + else if(b == "M") { + return s * 1_MA; + } + else { + return std::nullopt; + } + } + else return std::nullopt; +} + +std::optional make_resistance_unit(std::string_view str) { + + using namespace units::literals; + + static const std::regex unit_regex( + "([\\+-]?\\d*\\.?\\d+)\\s*([fpnumkM]?)\\s*(ohm)", + std::regex::icase + ); + + if(std::cmatch pieces; std::regex_match(str.begin(), str.end(), pieces, unit_regex)) { + + if(pieces.size() != 4) { + return std::nullopt; + } + + auto s = std::stof(pieces[1].str()); + + if(const auto& b = pieces[2].str(); b.empty()) { + return s * 1_Ohm; + } + else if(b == "f") { + return s * 1_fOhm; + } + else if(b == "p") { + return s * 1_pOhm; + } + else if(b == "n") { + return s * 1_nOhm; + } + else if(b == "u") { + return s * 1_uOhm; + } + else if(b == "m") { + return s * 1_mOhm; + } + else if(b == "k" || b == "K") { + return s * 1_kOhm; + } + else if(b == "M") { + return s * 1_MOhm; + } + else { + return std::nullopt; + } + } + else return std::nullopt; +} + +}; // namespace gt diff --git a/cpp_to_py/common/lib/unit.h b/cpp_to_py/common/lib/unit.h new file mode 100755 index 0000000..82e85ee --- /dev/null +++ b/cpp_to_py/common/lib/unit.h @@ -0,0 +1,21 @@ +#pragma once + +#include "common/lib/Helper.h" + +namespace gt { + +using ohm_t = units::impedance::ohm_t; // resistance unit (Ohm) +using farad_t = units::capacitance::farad_t; // capacitance unit (F) +using second_t = units::time::second_t; // time unit (s) +using volt_t = units::voltage::volt_t; // voltage unit (V) +using ampere_t = units::current::ampere_t; // current unit (A) +using watt_t = units::power::watt_t; // power unit (W) + +std::optional make_time_unit(std::string_view); +std::optional make_resistance_unit(std::string_view); +std::optional make_voltage_unit(std::string_view); +std::optional make_current_unit(std::string_view); +std::optional make_power_unit(std::string_view); +std::optional make_capacitance_unit(std::string_view); + +}; // namespace gt diff --git a/cpp_to_py/common/lib/units.hpp b/cpp_to_py/common/lib/units.hpp new file mode 100755 index 0000000..140227e --- /dev/null +++ b/cpp_to_py/common/lib/units.hpp @@ -0,0 +1,4851 @@ +//-------------------------------------------------------------------------------------------------- +// +// Units: A compile-time c++14 unit conversion library with no dependencies +// +//-------------------------------------------------------------------------------------------------- +// +// The MIT License (MIT) +// +// 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. +// +//-------------------------------------------------------------------------------------------------- +// +// Copyright (c) 2016 Nic Holthaus +// +//-------------------------------------------------------------------------------------------------- +// +// ATTRIBUTION: +// Parts of this work have been adapted from: +// http://stackoverflow.com/questions/35069778/create-comparison-trait-for-template-classes-whose-parameters-are-in-a-different +// http://stackoverflow.com/questions/28253399/check-traits-for-all-variadic-template-arguments/28253503 +// http://stackoverflow.com/questions/36321295/rational-approximation-of-square-root-of-stdratio-at-compile-time?noredirect=1#comment60266601_36321295 +// +//-------------------------------------------------------------------------------------------------- +// +/// @file units.h +/// @brief Complete implementation of `units` - a compile-time, header-only, unit conversion +/// library built on c++14 with no dependencies. +// +//-------------------------------------------------------------------------------------------------- + +#pragma once + +#ifndef units_h__ +#define units_h__ + +#ifdef _MSC_VER +# pragma push_macro("pascal") +# undef pascal +# if _MSC_VER <= 1800 +# define _ALLOW_KEYWORD_MACROS +# pragma warning(push) +# pragma warning(disable : 4520) +# pragma push_macro("constexpr") +# define constexpr /*constexpr*/ +# pragma push_macro("noexcept") +# define noexcept throw() +# endif // _MSC_VER < 1800 +#endif // _MSC_VER + +#if !defined(_MSC_VER) || _MSC_VER > 1800 +# define UNIT_HAS_LITERAL_SUPPORT +# define UNIT_HAS_VARIADIC_TEMPLATE_SUPPORT +#endif + +#ifndef UNIT_LIB_DEFAULT_TYPE +# define UNIT_LIB_DEFAULT_TYPE double +#endif + +//-------------------- +// INCLUDES +//-------------------- + +#include +#include +#include +#include +#include +#include + +#if !defined(UNIT_LIB_DISABLE_IOSTREAM) + #include + #include + #include + + //------------------------------ + // STRING FORMATTER + //------------------------------ + + namespace units + { + namespace detail + { + template std::string to_string(const T& t) + { + std::string str{ std::to_string(t) }; + int offset{ 1 }; + + // remove trailing decimal points for integer value units. Locale aware! + struct lconv * lc; + lc = localeconv(); + char decimalPoint = *lc->decimal_point; + if (str.find_last_not_of('0') == str.find(decimalPoint)) { offset = 0; } + str.erase(str.find_last_not_of('0') + offset, std::string::npos); + return str; + } + } + } +#endif + +namespace units +{ + template inline constexpr const char* name(const T&); + template inline constexpr const char* abbreviation(const T&); +} + +//------------------------------ +// MACROS +//------------------------------ + +/** + * @def UNIT_ADD_UNIT_TAGS(namespaceName,nameSingular, namePlural, abbreviation, definition) + * @brief Helper macro for generating the boiler-plate code generating the tags of a new unit. + * @details The macro generates singular, plural, and abbreviated forms + * of the unit definition (e.g. `meter`, `meters`, and `m`), as aliases for the + * unit tag. + * @param namespaceName namespace in which the new units will be encapsulated. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param namePlural - plural version of the unit name, e.g. 'meters' + * @param abbreviation - abbreviated unit name, e.g. 'm' + * @param definition - the variadic parameter is used for the definition of the unit + * (e.g. `unit, units::category::length_unit>`) + * @note a variadic template is used for the definition to allow templates with + * commas to be easily expanded. All the variadic 'arguments' should together + * comprise the unit definition. + */ +#define UNIT_ADD_UNIT_TAGS(namespaceName,nameSingular, namePlural, abbreviation, /*definition*/...)\ + namespace namespaceName\ + {\ + /** @name Units (full names plural) */ /** @{ */ typedef __VA_ARGS__ namePlural; /** @} */\ + /** @name Units (full names singular) */ /** @{ */ typedef namePlural nameSingular; /** @} */\ + /** @name Units (abbreviated) */ /** @{ */ typedef namePlural abbreviation; /** @} */\ + } + +/** + * @def UNIT_ADD_UNIT_DEFINITION(namespaceName,nameSingular) + * @brief Macro for generating the boiler-plate code for the unit_t type definition. + * @details The macro generates the definition of the unit container types, e.g. `meter_t` + * @param namespaceName namespace in which the new units will be encapsulated. + * @param nameSingular singular version of the unit name, e.g. 'meter' + */ +#define UNIT_ADD_UNIT_DEFINITION(namespaceName,nameSingular)\ + namespace namespaceName\ + {\ + /** @name Unit Containers */ /** @{ */ typedef unit_t nameSingular ## _t; /** @} */\ + } + +/** + * @def UNIT_ADD_CUSTOM_TYPE_UNIT_DEFINITION(namespaceName,nameSingular,underlyingType) + * @brief Macro for generating the boiler-plate code for a unit_t type definition with a non-default underlying type. + * @details The macro generates the definition of the unit container types, e.g. `meter_t` + * @param namespaceName namespace in which the new units will be encapsulated. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param underlyingType the underlying type + */ +#define UNIT_ADD_CUSTOM_TYPE_UNIT_DEFINITION(namespaceName,nameSingular, underlyingType)\ + namespace namespaceName\ + {\ + /** @name Unit Containers */ /** @{ */ typedef unit_t nameSingular ## _t; /** @} */\ + } +/** + * @def UNIT_ADD_IO(namespaceName,nameSingular, abbreviation) + * @brief Macro for generating the boiler-plate code needed for I/O for a new unit. + * @details The macro generates the code to insert units into an ostream. It + * prints both the value and abbreviation of the unit when invoked. + * @param namespaceName namespace in which the new units will be encapsulated. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param abbrev - abbreviated unit name, e.g. 'm' + * @note When UNIT_LIB_DISABLE_IOSTREAM is defined, the macro does not generate any code + */ +#if defined(UNIT_LIB_DISABLE_IOSTREAM) + #define UNIT_ADD_IO(namespaceName, nameSingular, abbrev) +#else + #define UNIT_ADD_IO(namespaceName, nameSingular, abbrev)\ + namespace namespaceName\ + {\ + inline std::ostream& operator<<(std::ostream& os, const nameSingular ## _t& obj) \ + {\ + os << obj() << " "#abbrev; return os; \ + }\ + inline std::string to_string(const nameSingular ## _t& obj)\ + {\ + return units::detail::to_string(obj()) + std::string(" "#abbrev);\ + }\ + } +#endif + + /** + * @def UNIT_ADD_NAME(namespaceName,nameSingular,abbreviation) + * @brief Macro for generating constexpr names/abbreviations for units. + * @details The macro generates names for units. E.g. name() of 1_m would be "meter", and + * abbreviation would be "m". + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param abbreviation - abbreviated unit name, e.g. 'm' + */ +#define UNIT_ADD_NAME(namespaceName, nameSingular, abbrev)\ +template<> inline constexpr const char* name(const namespaceName::nameSingular ## _t&)\ +{\ + return #nameSingular;\ +}\ +template<> inline constexpr const char* abbreviation(const namespaceName::nameSingular ## _t&)\ +{\ + return #abbrev;\ +} + +/** + * @def UNIT_ADD_LITERALS(namespaceName,nameSingular,abbreviation) + * @brief Macro for generating user-defined literals for units. + * @details The macro generates user-defined literals for units. A literal suffix is created + * using the abbreviation (e.g. `10.0_m`). + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param abbreviation - abbreviated unit name, e.g. 'm' + * @note When UNIT_HAS_LITERAL_SUPPORT is not defined, the macro does not generate any code + */ +#if defined(UNIT_HAS_LITERAL_SUPPORT) + #define UNIT_ADD_LITERALS(namespaceName, nameSingular, abbreviation)\ + namespace literals\ + {\ + inline constexpr namespaceName::nameSingular ## _t operator""_ ## abbreviation(long double d)\ + {\ + return namespaceName::nameSingular ## _t(static_cast(d));\ + }\ + inline constexpr namespaceName::nameSingular ## _t operator""_ ## abbreviation (unsigned long long d)\ + {\ + return namespaceName::nameSingular ## _t(static_cast(d));\ + }\ + } +#else + #define UNIT_ADD_LITERALS(namespaceName, nameSingular, abbreviation) +#endif + +/** + * @def UNIT_ADD(namespaceName,nameSingular, namePlural, abbreviation, definition) + * @brief Macro for generating the boiler-plate code needed for a new unit. + * @details The macro generates singular, plural, and abbreviated forms + * of the unit definition (e.g. `meter`, `meters`, and `m`), as well as the + * appropriately named unit container (e.g. `meter_t`). A literal suffix is created + * using the abbreviation (e.g. `10.0_m`). It also defines a class-specific + * cout function which prints both the value and abbreviation of the unit when invoked. + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param namePlural - plural version of the unit name, e.g. 'meters' + * @param abbreviation - abbreviated unit name, e.g. 'm' + * @param definition - the variadic parameter is used for the definition of the unit + * (e.g. `unit, units::category::length_unit>`) + * @note a variadic template is used for the definition to allow templates with + * commas to be easily expanded. All the variadic 'arguments' should together + * comprise the unit definition. + */ +#define UNIT_ADD(namespaceName, nameSingular, namePlural, abbreviation, /*definition*/...)\ + UNIT_ADD_UNIT_TAGS(namespaceName,nameSingular, namePlural, abbreviation, __VA_ARGS__)\ + UNIT_ADD_UNIT_DEFINITION(namespaceName,nameSingular)\ + UNIT_ADD_NAME(namespaceName,nameSingular, abbreviation)\ + UNIT_ADD_IO(namespaceName,nameSingular, abbreviation)\ + UNIT_ADD_LITERALS(namespaceName,nameSingular, abbreviation) + +/** + * @def UNIT_ADD_WITH_CUSTOM_TYPE(namespaceName,nameSingular, namePlural, abbreviation, underlyingType, definition) + * @brief Macro for generating the boiler-plate code needed for a new unit with a non-default underlying type. + * @details The macro generates singular, plural, and abbreviated forms + * of the unit definition (e.g. `meter`, `meters`, and `m`), as well as the + * appropriately named unit container (e.g. `meter_t`). A literal suffix is created + * using the abbreviation (e.g. `10.0_m`). It also defines a class-specific + * cout function which prints both the value and abbreviation of the unit when invoked. + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param namePlural - plural version of the unit name, e.g. 'meters' + * @param abbreviation - abbreviated unit name, e.g. 'm' + * @param underlyingType - the underlying type, e.g. 'int' or 'float' + * @param definition - the variadic parameter is used for the definition of the unit + * (e.g. `unit, units::category::length_unit>`) + * @note a variadic template is used for the definition to allow templates with + * commas to be easily expanded. All the variadic 'arguments' should together + * comprise the unit definition. + */ +#define UNIT_ADD_WITH_CUSTOM_TYPE(namespaceName, nameSingular, namePlural, abbreviation, underlyingType, /*definition*/...)\ + UNIT_ADD_UNIT_TAGS(namespaceName,nameSingular, namePlural, abbreviation, __VA_ARGS__)\ + UNIT_ADD_CUSTOM_TYPE_UNIT_DEFINITION(namespaceName,nameSingular,underlyingType)\ + UNIT_ADD_IO(namespaceName,nameSingular, abbreviation)\ + UNIT_ADD_LITERALS(namespaceName,nameSingular, abbreviation) + +/** + * @def UNIT_ADD_DECIBEL(namespaceName, nameSingular, abbreviation) + * @brief Macro to create decibel container and literals for an existing unit type. + * @details This macro generates the decibel unit container, cout overload, and literal definitions. + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the base unit name, e.g. 'watt' + * @param abbreviation - abbreviated decibel unit name, e.g. 'dBW' + */ +#define UNIT_ADD_DECIBEL(namespaceName, nameSingular, abbreviation)\ + namespace namespaceName\ + {\ + /** @name Unit Containers */ /** @{ */ typedef unit_t abbreviation ## _t; /** @} */\ + }\ + UNIT_ADD_IO(namespaceName, abbreviation, abbreviation)\ + UNIT_ADD_LITERALS(namespaceName, abbreviation, abbreviation) + +/** + * @def UNIT_ADD_CATEGORY_TRAIT(unitCategory, baseUnit) + * @brief Macro to create the `is_category_unit` type trait. + * @details This trait allows users to test whether a given type matches + * an intended category. This macro comprises all the boiler-plate + * code necessary to do so. + * @param unitCategory The name of the category of unit, e.g. length or mass. + */ + +#define UNIT_ADD_CATEGORY_TRAIT_DETAIL(unitCategory)\ + namespace traits\ + {\ + /** @cond */\ + namespace detail\ + {\ + template struct is_ ## unitCategory ## _unit_impl : std::false_type {};\ + template\ + struct is_ ## unitCategory ## _unit_impl> : std::is_same>::base_unit_type>, units::category::unitCategory ## _unit>::type {};\ + template class N>\ + struct is_ ## unitCategory ## _unit_impl> : std::is_same>::unit_type>, units::category::unitCategory ## _unit>::type {};\ + }\ + /** @endcond */\ + } + +#if defined(UNIT_HAS_VARIADIC_TEMPLATE_SUPPORT) +#define UNIT_ADD_IS_UNIT_CATEGORY_TRAIT(unitCategory)\ + namespace traits\ + {\ + template struct is_ ## unitCategory ## _unit : std::integral_constant>::value...>::value> {};\ + } +#else +#define UNIT_ADD_IS_UNIT_CATEGORY_TRAIT(unitCategory)\ + namespace traits\ + {\ + template\ + struct is_ ## unitCategory ## _unit : std::integral_constant::type>::value &&\ + units::traits::detail::is_ ## unitCategory ## _unit_impl::type>::value &&\ + units::traits::detail::is_ ## unitCategory ## _unit_impl::type>::value>{};\ + } +#endif + +#define UNIT_ADD_CATEGORY_TRAIT(unitCategory)\ + UNIT_ADD_CATEGORY_TRAIT_DETAIL(unitCategory)\ + /** @ingroup TypeTraits*/\ + /** @brief Trait which tests whether a type represents a unit of unitCategory*/\ + /** @details Inherits from `std::true_type` or `std::false_type`. Use `is_ ## unitCategory ## _unit::value` to test the unit represents a unitCategory quantity.*/\ + /** @tparam T one or more types to test*/\ + UNIT_ADD_IS_UNIT_CATEGORY_TRAIT(unitCategory) + +/** + * @def UNIT_ADD_WITH_METRIC_PREFIXES(nameSingular, namePlural, abbreviation, definition) + * @brief Macro for generating the boiler-plate code needed for a new unit, including its metric + * prefixes from femto to peta. + * @details See UNIT_ADD. In addition to generating the unit definition and containers '(e.g. `meters` and 'meter_t', + * it also creates corresponding units with metric suffixes such as `millimeters`, and `millimeter_t`), as well as the + * literal suffixes (e.g. `10.0_mm`). + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'meter' + * @param namePlural - plural version of the unit name, e.g. 'meters' + * @param abbreviation - abbreviated unit name, e.g. 'm' + * @param definition - the variadic parameter is used for the definition of the unit + * (e.g. `unit, units::category::length_unit>`) + * @note a variadic template is used for the definition to allow templates with + * commas to be easily expanded. All the variadic 'arguments' should together + * comprise the unit definition. + */ +#define UNIT_ADD_WITH_METRIC_PREFIXES(namespaceName, nameSingular, namePlural, abbreviation, /*definition*/...)\ + UNIT_ADD(namespaceName, nameSingular, namePlural, abbreviation, __VA_ARGS__)\ + UNIT_ADD(namespaceName, femto ## nameSingular, femto ## namePlural, f ## abbreviation, femto)\ + UNIT_ADD(namespaceName, pico ## nameSingular, pico ## namePlural, p ## abbreviation, pico)\ + UNIT_ADD(namespaceName, nano ## nameSingular, nano ## namePlural, n ## abbreviation, nano)\ + UNIT_ADD(namespaceName, micro ## nameSingular, micro ## namePlural, u ## abbreviation, micro)\ + UNIT_ADD(namespaceName, milli ## nameSingular, milli ## namePlural, m ## abbreviation, milli)\ + UNIT_ADD(namespaceName, centi ## nameSingular, centi ## namePlural, c ## abbreviation, centi)\ + UNIT_ADD(namespaceName, deci ## nameSingular, deci ## namePlural, d ## abbreviation, deci)\ + UNIT_ADD(namespaceName, deca ## nameSingular, deca ## namePlural, da ## abbreviation, deca)\ + UNIT_ADD(namespaceName, hecto ## nameSingular, hecto ## namePlural, h ## abbreviation, hecto)\ + UNIT_ADD(namespaceName, kilo ## nameSingular, kilo ## namePlural, k ## abbreviation, kilo)\ + UNIT_ADD(namespaceName, mega ## nameSingular, mega ## namePlural, M ## abbreviation, mega)\ + UNIT_ADD(namespaceName, giga ## nameSingular, giga ## namePlural, G ## abbreviation, giga)\ + UNIT_ADD(namespaceName, tera ## nameSingular, tera ## namePlural, T ## abbreviation, tera)\ + UNIT_ADD(namespaceName, peta ## nameSingular, peta ## namePlural, P ## abbreviation, peta)\ + + /** + * @def UNIT_ADD_WITH_METRIC_AND_BINARY_PREFIXES(nameSingular, namePlural, abbreviation, definition) + * @brief Macro for generating the boiler-plate code needed for a new unit, including its metric + * prefixes from femto to peta, and binary prefixes from kibi to exbi. + * @details See UNIT_ADD. In addition to generating the unit definition and containers '(e.g. `bytes` and 'byte_t', + * it also creates corresponding units with metric suffixes such as `millimeters`, and `millimeter_t`), as well as the + * literal suffixes (e.g. `10.0_B`). + * @param namespaceName namespace in which the new units will be encapsulated. All literal values + * are placed in the `units::literals` namespace. + * @param nameSingular singular version of the unit name, e.g. 'byte' + * @param namePlural - plural version of the unit name, e.g. 'bytes' + * @param abbreviation - abbreviated unit name, e.g. 'B' + * @param definition - the variadic parameter is used for the definition of the unit + * (e.g. `unit, units::category::data_unit>`) + * @note a variadic template is used for the definition to allow templates with + * commas to be easily expanded. All the variadic 'arguments' should together + * comprise the unit definition. + */ +#define UNIT_ADD_WITH_METRIC_AND_BINARY_PREFIXES(namespaceName, nameSingular, namePlural, abbreviation, /*definition*/...)\ + UNIT_ADD_WITH_METRIC_PREFIXES(namespaceName, nameSingular, namePlural, abbreviation, __VA_ARGS__)\ + UNIT_ADD(namespaceName, kibi ## nameSingular, kibi ## namePlural, Ki ## abbreviation, kibi)\ + UNIT_ADD(namespaceName, mebi ## nameSingular, mebi ## namePlural, Mi ## abbreviation, mebi)\ + UNIT_ADD(namespaceName, gibi ## nameSingular, gibi ## namePlural, Gi ## abbreviation, gibi)\ + UNIT_ADD(namespaceName, tebi ## nameSingular, tebi ## namePlural, Ti ## abbreviation, tebi)\ + UNIT_ADD(namespaceName, pebi ## nameSingular, pebi ## namePlural, Pi ## abbreviation, pebi)\ + UNIT_ADD(namespaceName, exbi ## nameSingular, exbi ## namePlural, Ei ## abbreviation, exbi) + +//-------------------- +// UNITS NAMESPACE +//-------------------- + +/** + * @namespace units + * @brief Unit Conversion Library namespace + */ +namespace units +{ + //---------------------------------- + // DOXYGEN + //---------------------------------- + + /** + * @defgroup UnitContainers Unit Containers + * @brief Defines a series of classes which contain dimensioned values. Unit containers + * store a value, and support various arithmetic operations. + */ + + /** + * @defgroup UnitTypes Unit Types + * @brief Defines a series of classes which represent units. These types are tags used by + * the conversion function, to create compound units, or to create `unit_t` types. + * By themselves, they are not containers and have no stored value. + */ + + /** + * @defgroup UnitManipulators Unit Manipulators + * @brief Defines a series of classes used to manipulate unit types, such as `inverse<>`, `squared<>`, and metric prefixes. + * Unit manipulators can be chained together, e.g. `inverse>>` to + * represent picoseconds^-2. + */ + + /** + * @defgroup CompileTimeUnitManipulators Compile-time Unit Manipulators + * @brief Defines a series of classes used to manipulate `unit_value_t` types at compile-time, such as `unit_value_add<>`, `unit_value_sqrt<>`, etc. + * Compile-time manipulators can be chained together, e.g. `unit_value_sqrt, unit_value_power>>` to + * represent `c = sqrt(a^2 + b^2). + */ + + /** + * @defgroup UnitMath Unit Math + * @brief Defines a collection of unit-enabled, strongly-typed versions of `` functions. + * @details Includes most c++11 extensions. + */ + + /** + * @defgroup Conversion Explicit Conversion + * @brief Functions used to convert values of one logical type to another. + */ + + /** + * @defgroup TypeTraits Type Traits + * @brief Defines a series of classes to obtain unit type information at compile-time. + */ + + //------------------------------ + // FORWARD DECLARATIONS + //------------------------------ + + /** @cond */ // DOXYGEN IGNORE + namespace constants + { + namespace detail + { + static constexpr const UNIT_LIB_DEFAULT_TYPE PI_VAL = 3.14159265358979323846264338327950288419716939937510; + } + } + /** @endcond */ // END DOXYGEN IGNORE + + //------------------------------ + // RATIO TRAITS + //------------------------------ + + /** + * @ingroup TypeTraits + * @{ + */ + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /// has_num implementation. + template + struct has_num_impl + { + template + static constexpr auto test(U*)->std::is_integral {return std::is_integral{}; } + template + static constexpr std::false_type test(...) { return std::false_type{}; } + + using type = decltype(test(0)); + }; + } + + /** + * @brief Trait which checks for the existence of a static numerator. + * @details Inherits from `std::true_type` or `std::false_type`. Use `has_num::value` to test + * whether `class T` has a numerator static member. + */ + template + struct has_num : units::detail::has_num_impl::type {}; + + namespace detail + { + /// has_den implementation. + template + struct has_den_impl + { + template + static constexpr auto test(U*)->std::is_integral { return std::is_integral{}; } + template + static constexpr std::false_type test(...) { return std::false_type{}; } + + using type = decltype(test(0)); + }; + } + + /** + * @brief Trait which checks for the existence of a static denominator. + * @details Inherits from `std::true_type` or `std::false_type`. Use `has_den::value` to test + * whether `class T` has a denominator static member. + */ + template + struct has_den : units::detail::has_den_impl::type {}; + + /** @endcond */ // END DOXYGEN IGNORE + + namespace traits + { + /** + * @brief Trait that tests whether a type represents a std::ratio. + * @details Inherits from `std::true_type` or `std::false_type`. Use `is_ratio::value` to test + * whether `class T` implements a std::ratio. + */ + template + struct is_ratio : std::integral_constant::value && + has_den::value> + {}; + } + + //------------------------------ + // UNIT TRAITS + //------------------------------ + + /** @cond */ // DOXYGEN IGNORE + /** + * @brief void type. + * @details Helper class for creating type traits. + */ + template + struct void_t { typedef void type; }; + + /** + * @brief parameter pack for boolean arguments. + */ + template struct bool_pack {}; + + /** + * @brief Trait which tests that a set of other traits are all true. + */ + template + struct all_true : std::is_same, units::bool_pack> {}; + /** @endcond */ // DOXYGEN IGNORE + + /** + * @brief namespace representing type traits which can access the properties of types provided by the units library. + */ + namespace traits + { +#ifdef FOR_DOXYGEN_PURPOSES_ONLY + /** + * @ingroup TypeTraits + * @brief Traits class defining the properties of units. + * @details The units library determines certain properties of the units passed to + * them and what they represent by using the members of the corresponding + * unit_traits instantiation. + */ + template + struct unit_traits + { + typedef typename T::base_unit_type base_unit_type; ///< Unit type that the unit was derived from. May be a `base_unit` or another `unit`. Use the `base_unit_of` trait to find the SI base unit type. This will be `void` if type `T` is not a unit. + typedef typename T::conversion_ratio conversion_ratio; ///< `std::ratio` representing the conversion factor to the `base_unit_type`. This will be `void` if type `T` is not a unit. + typedef typename T::pi_exponent_ratio pi_exponent_ratio; ///< `std::ratio` representing the exponent of pi to be used in the conversion. This will be `void` if type `T` is not a unit. + typedef typename T::translation_ratio translation_ratio; ///< `std::ratio` representing a datum translation to the base unit (i.e. degrees C to degrees F conversion). This will be `void` if type `T` is not a unit. + }; +#endif + /** @cond */ // DOXYGEN IGNORE + /** + * @brief unit traits implementation for classes which are not units. + */ + template + struct unit_traits + { + typedef void base_unit_type; + typedef void conversion_ratio; + typedef void pi_exponent_ratio; + typedef void translation_ratio; + }; + + template + struct unit_traits + ::type> + { + typedef typename T::base_unit_type base_unit_type; ///< Unit type that the unit was derived from. May be a `base_unit` or another `unit`. Use the `base_unit_of` trait to find the SI base unit type. This will be `void` if type `T` is not a unit. + typedef typename T::conversion_ratio conversion_ratio; ///< `std::ratio` representing the conversion factor to the `base_unit_type`. This will be `void` if type `T` is not a unit. + typedef typename T::pi_exponent_ratio pi_exponent_ratio; ///< `std::ratio` representing the exponent of pi to be used in the conversion. This will be `void` if type `T` is not a unit. + typedef typename T::translation_ratio translation_ratio; ///< `std::ratio` representing a datum translation to the base unit (i.e. degrees C to degrees F conversion). This will be `void` if type `T` is not a unit. + }; + /** @endcond */ // END DOXYGEN IGNORE + } + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief helper type to identify base units. + * @details A non-templated base class for `base_unit` which enables RTTI testing. + */ + struct _base_unit_t {}; + } + /** @endcond */ // END DOXYGEN IGNORE + + namespace traits + { + /** + * @ingroup TypeTraits + * @brief Trait which tests if a class is a `base_unit` type. + * @details Inherits from `std::true_type` or `std::false_type`. Use `is_base_unit::value` to test + * whether `class T` implements a `base_unit`. + */ + template + struct is_base_unit : std::is_base_of {}; + } + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief helper type to identify units. + * @details A non-templated base class for `unit` which enables RTTI testing. + */ + struct _unit {}; + + template + using meter_ratio = std::ratio; + } + /** @endcond */ // END DOXYGEN IGNORE + + namespace traits + { + /** + * @ingroup TypeTraits + * @brief Traits which tests if a class is a `unit` + * @details Inherits from `std::true_type` or `std::false_type`. Use `is_unit::value` to test + * whether `class T` implements a `unit`. + */ + template + struct is_unit : std::is_base_of::type {}; + } + + /** @} */ // end of TypeTraits + + //------------------------------ + // BASE UNIT CLASS + //------------------------------ + + /** + * @ingroup UnitTypes + * @brief Class representing SI base unit types. + * @details Base units are represented by a combination of `std::ratio` template parameters, each + * describing the exponent of the type of unit they represent. Example: meters per second + * would be described by a +1 exponent for meters, and a -1 exponent for seconds, thus: + * `base_unit, std::ratio<0>, std::ratio<-1>>` + * @tparam Meter `std::ratio` representing the exponent value for meters. + * @tparam Kilogram `std::ratio` representing the exponent value for kilograms. + * @tparam Second `std::ratio` representing the exponent value for seconds. + * @tparam Radian `std::ratio` representing the exponent value for radians. Although radians are not SI base units, they are included because radians are described by the SI as m * m^-1, which would make them indistinguishable from scalars. + * @tparam Ampere `std::ratio` representing the exponent value for amperes. + * @tparam Kelvin `std::ratio` representing the exponent value for Kelvin. + * @tparam Mole `std::ratio` representing the exponent value for moles. + * @tparam Candela `std::ratio` representing the exponent value for candelas. + * @tparam Byte `std::ratio` representing the exponent value for bytes. + * @sa category for type aliases for SI base_unit types. + */ + template, + class Kilogram = std::ratio<0>, + class Second = std::ratio<0>, + class Radian = std::ratio<0>, + class Ampere = std::ratio<0>, + class Kelvin = std::ratio<0>, + class Mole = std::ratio<0>, + class Candela = std::ratio<0>, + class Byte = std::ratio<0>> + struct base_unit : units::detail::_base_unit_t + { + static_assert(traits::is_ratio::value, "Template parameter `Meter` must be a `std::ratio` representing the exponent of meters the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Kilogram` must be a `std::ratio` representing the exponent of kilograms the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Second` must be a `std::ratio` representing the exponent of seconds the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Ampere` must be a `std::ratio` representing the exponent of amperes the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Kelvin` must be a `std::ratio` representing the exponent of kelvin the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Candela` must be a `std::ratio` representing the exponent of candelas the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Mole` must be a `std::ratio` representing the exponent of moles the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Radian` must be a `std::ratio` representing the exponent of radians the unit has"); + static_assert(traits::is_ratio::value, "Template parameter `Byte` must be a `std::ratio` representing the exponent of bytes the unit has"); + + typedef Meter meter_ratio; + typedef Kilogram kilogram_ratio; + typedef Second second_ratio; + typedef Radian radian_ratio; + typedef Ampere ampere_ratio; + typedef Kelvin kelvin_ratio; + typedef Mole mole_ratio; + typedef Candela candela_ratio; + typedef Byte byte_ratio; + }; + + //------------------------------ + // UNIT CATEGORIES + //------------------------------ + + /** + * @brief namespace representing the implemented base and derived unit types. These will not generally be needed by library users. + * @sa base_unit for the definition of the category parameters. + */ + namespace category + { + // SCALAR (DIMENSIONLESS) TYPES + typedef base_unit<> scalar_unit; ///< Represents a quantity with no dimension. + typedef base_unit<> dimensionless_unit; ///< Represents a quantity with no dimension. + + // SI BASE UNIT TYPES + // METERS KILOGRAMS SECONDS RADIANS AMPERES KELVIN MOLE CANDELA BYTE --- CATEGORY + typedef base_unit> length_unit; ///< Represents an SI base unit of length + typedef base_unit, std::ratio<1>> mass_unit; ///< Represents an SI base unit of mass + typedef base_unit, std::ratio<0>, std::ratio<1>> time_unit; ///< Represents an SI base unit of time + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<1>> angle_unit; ///< Represents an SI base unit of angle + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> current_unit; ///< Represents an SI base unit of current + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> temperature_unit; ///< Represents an SI base unit of temperature + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> substance_unit; ///< Represents an SI base unit of amount of substance + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> luminous_intensity_unit; ///< Represents an SI base unit of luminous intensity + + // SI DERIVED UNIT TYPES + // METERS KILOGRAMS SECONDS RADIANS AMPERES KELVIN MOLE CANDELA BYTE --- CATEGORY + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<2>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>> solid_angle_unit; ///< Represents an SI derived unit of solid angle + typedef base_unit, std::ratio<0>, std::ratio<-1>> frequency_unit; ///< Represents an SI derived unit of frequency + typedef base_unit, std::ratio<0>, std::ratio<-1>> velocity_unit; ///< Represents an SI derived unit of velocity + typedef base_unit, std::ratio<0>, std::ratio<-1>, std::ratio<1>> angular_velocity_unit; ///< Represents an SI derived unit of angular velocity + typedef base_unit, std::ratio<0>, std::ratio<-2>> acceleration_unit; ///< Represents an SI derived unit of acceleration + typedef base_unit, std::ratio<1>, std::ratio<-2>> force_unit; ///< Represents an SI derived unit of force + typedef base_unit, std::ratio<1>, std::ratio<-2>> pressure_unit; ///< Represents an SI derived unit of pressure + typedef base_unit, std::ratio<0>, std::ratio<1>, std::ratio<0>, std::ratio<1>> charge_unit; ///< Represents an SI derived unit of charge + typedef base_unit, std::ratio<1>, std::ratio<-2>> energy_unit; ///< Represents an SI derived unit of energy + typedef base_unit, std::ratio<1>, std::ratio<-3>> power_unit; ///< Represents an SI derived unit of power + typedef base_unit, std::ratio<1>, std::ratio<-3>, std::ratio<0>, std::ratio<-1>> voltage_unit; ///< Represents an SI derived unit of voltage + typedef base_unit, std::ratio<-1>, std::ratio<4>, std::ratio<0>, std::ratio<2>> capacitance_unit; ///< Represents an SI derived unit of capacitance + typedef base_unit, std::ratio<1>, std::ratio<-3>, std::ratio<0>, std::ratio<-2>> impedance_unit; ///< Represents an SI derived unit of impedance + typedef base_unit, std::ratio<-1>, std::ratio<3>, std::ratio<0>, std::ratio<2>> conductance_unit; ///< Represents an SI derived unit of conductance + typedef base_unit, std::ratio<1>, std::ratio<-2>, std::ratio<0>, std::ratio<-1>> magnetic_flux_unit; ///< Represents an SI derived unit of magnetic flux + typedef base_unit, std::ratio<1>, std::ratio<-2>, std::ratio<0>, std::ratio<-1>> magnetic_field_strength_unit; ///< Represents an SI derived unit of magnetic field strength + typedef base_unit, std::ratio<1>, std::ratio<-2>, std::ratio<0>, std::ratio<-2>> inductance_unit; ///< Represents an SI derived unit of inductance + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<2>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> luminous_flux_unit; ///< Represents an SI derived unit of luminous flux + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<2>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> illuminance_unit; ///< Represents an SI derived unit of illuminance + typedef base_unit, std::ratio<0>, std::ratio<-1>> radioactivity_unit; ///< Represents an SI derived unit of radioactivity + + // OTHER UNIT TYPES + // METERS KILOGRAMS SECONDS RADIANS AMPERES KELVIN MOLE CANDELA BYTE --- CATEGORY + typedef base_unit, std::ratio<1>, std::ratio<-2>> torque_unit; ///< Represents an SI derived unit of torque + typedef base_unit> area_unit; ///< Represents an SI derived unit of area + typedef base_unit> volume_unit; ///< Represents an SI derived unit of volume + typedef base_unit, std::ratio<1>> density_unit; ///< Represents an SI derived unit of density + typedef base_unit<> concentration_unit; ///< Represents a unit of concentration + typedef base_unit, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> data_unit; ///< Represents a unit of data size + typedef base_unit, std::ratio<0>, std::ratio<-1>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<0>, std::ratio<1>> data_transfer_rate_unit; ///< Represents a unit of data transfer rate + } + + //------------------------------ + // UNIT CLASSES + //------------------------------ + + /** @cond */ // DOXYGEN IGNORE + /** + * @brief unit type template specialization for units derived from base units. + */ + template struct unit; + template + struct unit, PiExponent, Translation> : units::detail::_unit + { + static_assert(traits::is_ratio::value, "Template parameter `Conversion` must be a `std::ratio` representing the conversion factor to `BaseUnit`."); + static_assert(traits::is_ratio::value, "Template parameter `PiExponent` must be a `std::ratio` representing the exponents of Pi the unit has."); + static_assert(traits::is_ratio::value, "Template parameter `Translation` must be a `std::ratio` representing an additive translation required by the unit conversion."); + + typedef typename units::base_unit base_unit_type; + typedef Conversion conversion_ratio; + typedef Translation translation_ratio; + typedef PiExponent pi_exponent_ratio; + }; + /** @endcond */ // END DOXYGEN IGNORE + + /** + * @brief Type representing an arbitrary unit. + * @ingroup UnitTypes + * @details `unit` types are used as tags for the `conversion` function. They are *not* containers + * (see `unit_t` for a container class). Each unit is defined by: + * + * - A `std::ratio` defining the conversion factor to the base unit type. (e.g. `std::ratio<1,12>` for inches to feet) + * - A base unit that the unit is derived from (or a unit category. Must be of type `unit` or `base_unit`) + * - An exponent representing factors of PI required by the conversion. (e.g. `std::ratio<-1>` for a radians to degrees conversion) + * - a ratio representing a datum translation required for the conversion (e.g. `std::ratio<32>` for a farenheit to celsius conversion) + * + * Typically, a specific unit, like `meters`, would be implemented as a type alias + * of `unit`, i.e. `using meters = unit, units::category::length_unit`, or + * `using inches = unit, feet>`. + * @tparam Conversion std::ratio representing scalar multiplication factor. + * @tparam BaseUnit Unit type which this unit is derived from. May be a `base_unit`, or another `unit`. + * @tparam PiExponent std::ratio representing the exponent of pi required by the conversion. + * @tparam Translation std::ratio representing any datum translation required by the conversion. + */ + template, class Translation = std::ratio<0>> + struct unit : units::detail::_unit + { + static_assert(traits::is_unit::value, "Template parameter `BaseUnit` must be a `unit` type."); + static_assert(traits::is_ratio::value, "Template parameter `Conversion` must be a `std::ratio` representing the conversion factor to `BaseUnit`."); + static_assert(traits::is_ratio::value, "Template parameter `PiExponent` must be a `std::ratio` representing the exponents of Pi the unit has."); + + typedef typename units::traits::unit_traits::base_unit_type base_unit_type; + typedef typename std::ratio_multiply conversion_ratio; + typedef typename std::ratio_add pi_exponent_ratio; + typedef typename std::ratio_add, typename BaseUnit::translation_ratio> translation_ratio; + }; + + //------------------------------ + // BASE UNIT MANIPULATORS + //------------------------------ + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief base_unit_of trait implementation + * @details recursively seeks base_unit type that a unit is derived from. Since units can be + * derived from other units, the `base_unit_type` typedef may not represent this value. + */ + template struct base_unit_of_impl; + template + struct base_unit_of_impl> : base_unit_of_impl {}; + template + struct base_unit_of_impl> + { + typedef base_unit type; + }; + template<> + struct base_unit_of_impl + { + typedef void type; + }; + } + /** @endcond */ // END DOXYGEN IGNORE + + namespace traits + { + /** + * @brief Trait which returns the `base_unit` type that a unit is originally derived from. + * @details Since units can be derived from other `unit` types in addition to `base_unit` types, + * the `base_unit_type` typedef will not always be a `base_unit` (or unit category). + * Since compatible + */ + template + using base_unit_of = typename units::detail::base_unit_of_impl::type; + } + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief implementation of base_unit_multiply + * @details 'multiples' (adds exponent ratios of) two base unit types. Base units can be found + * using `base_unit_of`. + */ + template struct base_unit_multiply_impl; + template + struct base_unit_multiply_impl, base_unit> { + using type = base_unit...>; + }; + + /** + * @brief represents type of two base units multiplied together + */ + template + using base_unit_multiply = typename base_unit_multiply_impl::type; + + /** + * @brief implementation of base_unit_divide + * @details 'dived' (subtracts exponent ratios of) two base unit types. Base units can be found + * using `base_unit_of`. + */ + template struct base_unit_divide_impl; + template + struct base_unit_divide_impl, base_unit> { + using type = base_unit...>; + }; + + /** + * @brief represents the resulting type of `base_unit` U1 divided by U2. + */ + template + using base_unit_divide = typename base_unit_divide_impl::type; + + /** + * @brief implementation of inverse_base + * @details multiplies all `base_unit` exponent ratios by -1. The resulting type represents + * the inverse base unit of the given `base_unit` type. + */ + template struct inverse_base_impl; + + template + struct inverse_base_impl> { + using type = base_unit>...>; + }; + + /** + * @brief represent the inverse type of `class U` + * @details E.g. if `U` is `length_unit`, then `inverse` will represent `length_unit^-1`. + */ + template using inverse_base = typename inverse_base_impl::type; + + /** + * @brief implementation of `squared_base` + * @details multiplies all the exponent ratios of the given class by 2. The resulting type is + * equivalent to the given type squared. + */ + template struct squared_base_impl; + template + struct squared_base_impl> { + using type = base_unit>...>; + }; + + /** + * @brief represents the type of a `base_unit` squared. + * @details E.g. `squared` will represent `length_unit^2`. + */ + template using squared_base = typename squared_base_impl::type; + + /** + * @brief implementation of `cubed_base` + * @details multiplies all the exponent ratios of the given class by 3. The resulting type is + * equivalent to the given type cubed. + */ + template struct cubed_base_impl; + template + struct cubed_base_impl> { + using type = base_unit>...>; + }; + + /** + * @brief represents the type of a `base_unit` cubed. + * @details E.g. `cubed` will represent `length_unit^3`. + */ + template using cubed_base = typename cubed_base_impl::type; + + /** + * @brief implementation of `sqrt_base` + * @details divides all the exponent ratios of the given class by 2. The resulting type is + * equivalent to the square root of the given type. + */ + template struct sqrt_base_impl; + template + struct sqrt_base_impl> { + using type = base_unit>...>; + }; + + /** + * @brief represents the square-root type of a `base_unit`. + * @details E.g. `sqrt` will represent `length_unit^(1/2)`. + */ + template using sqrt_base = typename sqrt_base_impl::type; + + /** + * @brief implementation of `cbrt_base` + * @details divides all the exponent ratios of the given class by 3. The resulting type is + * equivalent to the given type's cube-root. + */ + template struct cbrt_base_impl; + template + struct cbrt_base_impl> { + using type = base_unit>...>; + }; + + /** + * @brief represents the cube-root type of a `base_unit` . + * @details E.g. `cbrt` will represent `length_unit^(1/3)`. + */ + template using cbrt_base = typename cbrt_base_impl::type; + } + /** @endcond */ // END DOXYGEN IGNORE + + //------------------------------ + // UNIT MANIPULATORS + //------------------------------ + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief implementation of `unit_multiply`. + * @details multiplies two units. The base unit becomes the base units of each with their exponents + * added together. The conversion factors of each are multiplied by each other. Pi exponent ratios + * are added, and datum translations are removed. + */ + template + struct unit_multiply_impl + { + using type = unit < std::ratio_multiply, + base_unit_multiply , traits::base_unit_of>, + std::ratio_add, + std::ratio < 0 >> ; + }; + + /** + * @brief represents the type of two units multiplied together. + * @details recalculates conversion and exponent ratios at compile-time. + */ + template + using unit_multiply = typename unit_multiply_impl::type; + + /** + * @brief implementation of `unit_divide`. + * @details divides two units. The base unit becomes the base units of each with their exponents + * subtracted from each other. The conversion factors of each are divided by each other. Pi exponent ratios + * are subtracted, and datum translations are removed. + */ + template + struct unit_divide_impl + { + using type = unit < std::ratio_divide, + base_unit_divide, traits::base_unit_of>, + std::ratio_subtract, + std::ratio < 0 >> ; + }; + + /** + * @brief represents the type of two units divided by each other. + * @details recalculates conversion and exponent ratios at compile-time. + */ + template + using unit_divide = typename unit_divide_impl::type; + + /** + * @brief implementation of `inverse` + * @details inverts a unit (equivalent to 1/unit). The `base_unit` and pi exponents are all multiplied by + * -1. The conversion ratio numerator and denominator are swapped. Datum translation + * ratios are removed. + */ + template + struct inverse_impl + { + using type = unit < std::ratio, + inverse_base::base_unit_type>>, + std::ratio_multiply::pi_exponent_ratio, std::ratio<-1>>, + std::ratio < 0 >> ; // inverses are rates or change, the translation factor goes away. + }; + } + /** @endcond */ // END DOXYGEN IGNORE + + /** + * @brief represents the inverse unit type of `class U`. + * @ingroup UnitManipulators + * @tparam U `unit` type to invert. + * @details E.g. `inverse` will represent meters^-1 (i.e. 1/meters). + */ + template using inverse = typename units::detail::inverse_impl::type; + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief implementation of `squared` + * @details Squares the conversion ratio, `base_unit` exponents, pi exponents, and removes + * datum translation ratios. + */ + template + struct squared_impl + { + static_assert(traits::is_unit::value, "Template parameter `Unit` must be a `unit` type."); + using Conversion = typename Unit::conversion_ratio; + using type = unit < std::ratio_multiply, + squared_base>, + std::ratio_multiply>, + typename Unit::translation_ratio + > ; + }; + } + /** @endcond */ // END DOXYGEN IGNORE + + /** + * @brief represents the unit type of `class U` squared + * @ingroup UnitManipulators + * @tparam U `unit` type to square. + * @details E.g. `square` will represent meters^2. + */ + template + using squared = typename units::detail::squared_impl::type; + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + /** + * @brief implementation of `cubed` + * @details Cubes the conversion ratio, `base_unit` exponents, pi exponents, and removes + * datum translation ratios. + */ + template + struct cubed_impl + { + static_assert(traits::is_unit::value, "Template parameter `Unit` must be a `unit` type."); + using Conversion = typename Unit::conversion_ratio; + using type = unit < std::ratio_multiply>, + cubed_base>, + std::ratio_multiply>, + typename Unit::translation_ratio> ; + }; + } + /** @endcond */ // END DOXYGEN IGNORE + + /** + * @brief represents the type of `class U` cubed. + * @ingroup UnitManipulators + * @tparam U `unit` type to cube. + * @details E.g. `cubed` will represent meters^3. + */ + template + using cubed = typename units::detail::cubed_impl::type; + + /** @cond */ // DOXYGEN IGNORE + namespace detail + { + //---------------------------------- + // RATIO_SQRT IMPLEMENTATION + //---------------------------------- + + using Zero = std::ratio<0>; + using One = std::ratio<1>; + template using Square = std::ratio_multiply; + + // Find the largest std::integer N such that Predicate::value is true. + template