rj_schema 0.0.1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/Rakefile +18 -0
- data/ext/rj_schema/extconf.rb +7 -0
- data/ext/rj_schema/rapidjson/CHANGELOG.md +158 -0
- data/ext/rj_schema/rapidjson/CMakeLists.txt +221 -0
- data/ext/rj_schema/rapidjson/CMakeModules/FindGTestSrc.cmake +30 -0
- data/ext/rj_schema/rapidjson/RapidJSON.pc.in +7 -0
- data/ext/rj_schema/rapidjson/RapidJSONConfig.cmake.in +15 -0
- data/ext/rj_schema/rapidjson/RapidJSONConfigVersion.cmake.in +10 -0
- data/ext/rj_schema/rapidjson/appveyor.yml +41 -0
- data/ext/rj_schema/rapidjson/bin/data/glossary.json +22 -0
- data/ext/rj_schema/rapidjson/bin/data/menu.json +27 -0
- data/ext/rj_schema/rapidjson/bin/data/readme.txt +1 -0
- data/ext/rj_schema/rapidjson/bin/data/sample.json +3315 -0
- data/ext/rj_schema/rapidjson/bin/data/webapp.json +88 -0
- data/ext/rj_schema/rapidjson/bin/data/widget.json +26 -0
- data/ext/rj_schema/rapidjson/bin/draft-04/schema +150 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf16be.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf16bebom.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf16le.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf16lebom.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf32be.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf32bebom.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf32le.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf32lebom.json +0 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf8.json +7 -0
- data/ext/rj_schema/rapidjson/bin/encodings/utf8bom.json +7 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail1.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail10.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail11.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail12.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail13.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail14.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail15.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail16.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail17.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail18.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail19.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail2.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail20.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail21.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail22.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail23.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail24.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail25.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail26.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail27.json +2 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail28.json +2 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail29.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail3.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail30.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail31.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail32.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail33.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail4.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail5.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail6.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail7.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail8.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/fail9.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/pass1.json +58 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/pass2.json +1 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/pass3.json +6 -0
- data/ext/rj_schema/rapidjson/bin/jsonchecker/readme.txt +3 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/LICENSE +19 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/README.md +148 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/bin/jsonschema_suite +283 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/remotes/folder/folderInteger.json +3 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/remotes/integer.json +3 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/remotes/subSchemas.json +8 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/additionalItems.json +82 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/additionalProperties.json +88 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/default.json +49 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/dependencies.json +108 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/disallow.json +80 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/divisibleBy.json +60 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/enum.json +71 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/extends.json +94 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/items.json +46 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/maxItems.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/maxLength.json +33 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/maximum.json +42 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/minItems.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/minLength.json +33 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/minimum.json +42 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/optional/bignum.json +107 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/optional/format.json +222 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/optional/jsregex.json +18 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/optional/zeroTerminatedFloats.json +15 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/pattern.json +34 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/patternProperties.json +110 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/properties.json +92 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/ref.json +159 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/refRemote.json +74 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/required.json +53 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/type.json +474 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft3/uniqueItems.json +79 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/additionalItems.json +82 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/additionalProperties.json +88 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/allOf.json +112 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/anyOf.json +68 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/default.json +49 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/definitions.json +32 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/dependencies.json +113 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/enum.json +72 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/items.json +46 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/maxItems.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/maxLength.json +33 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/maxProperties.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/maximum.json +42 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/minItems.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/minLength.json +33 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/minProperties.json +28 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/minimum.json +42 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/multipleOf.json +60 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/not.json +96 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/oneOf.json +68 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/optional/bignum.json +107 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/optional/format.json +148 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/optional/zeroTerminatedFloats.json +15 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/pattern.json +34 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/patternProperties.json +110 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/properties.json +92 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/ref.json +159 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/refRemote.json +74 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/required.json +39 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/type.json +330 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tests/draft4/uniqueItems.json +79 -0
- data/ext/rj_schema/rapidjson/bin/jsonschema/tox.ini +8 -0
- data/ext/rj_schema/rapidjson/bin/types/booleans.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/floats.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/guids.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/integers.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/mixed.json +592 -0
- data/ext/rj_schema/rapidjson/bin/types/nulls.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/paragraphs.json +102 -0
- data/ext/rj_schema/rapidjson/bin/types/readme.txt +1 -0
- data/ext/rj_schema/rapidjson/contrib/natvis/LICENSE +45 -0
- data/ext/rj_schema/rapidjson/contrib/natvis/README.md +7 -0
- data/ext/rj_schema/rapidjson/contrib/natvis/rapidjson.natvis +38 -0
- data/ext/rj_schema/rapidjson/doc/CMakeLists.txt +27 -0
- data/ext/rj_schema/rapidjson/doc/Doxyfile.in +2369 -0
- data/ext/rj_schema/rapidjson/doc/Doxyfile.zh-cn.in +2369 -0
- data/ext/rj_schema/rapidjson/doc/diagram/architecture.dot +50 -0
- data/ext/rj_schema/rapidjson/doc/diagram/architecture.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/insituparsing.dot +65 -0
- data/ext/rj_schema/rapidjson/doc/diagram/insituparsing.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/iterative-parser-states-diagram.dot +62 -0
- data/ext/rj_schema/rapidjson/doc/diagram/iterative-parser-states-diagram.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/makefile +8 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move1.dot +47 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move1.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move2.dot +62 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move2.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move3.dot +60 -0
- data/ext/rj_schema/rapidjson/doc/diagram/move3.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/normalparsing.dot +56 -0
- data/ext/rj_schema/rapidjson/doc/diagram/normalparsing.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/simpledom.dot +54 -0
- data/ext/rj_schema/rapidjson/doc/diagram/simpledom.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/tutorial.dot +58 -0
- data/ext/rj_schema/rapidjson/doc/diagram/tutorial.png +0 -0
- data/ext/rj_schema/rapidjson/doc/diagram/utilityclass.dot +73 -0
- data/ext/rj_schema/rapidjson/doc/diagram/utilityclass.png +0 -0
- data/ext/rj_schema/rapidjson/doc/dom.md +280 -0
- data/ext/rj_schema/rapidjson/doc/dom.zh-cn.md +284 -0
- data/ext/rj_schema/rapidjson/doc/encoding.md +146 -0
- data/ext/rj_schema/rapidjson/doc/encoding.zh-cn.md +152 -0
- data/ext/rj_schema/rapidjson/doc/faq.md +289 -0
- data/ext/rj_schema/rapidjson/doc/faq.zh-cn.md +290 -0
- data/ext/rj_schema/rapidjson/doc/features.md +104 -0
- data/ext/rj_schema/rapidjson/doc/features.zh-cn.md +103 -0
- data/ext/rj_schema/rapidjson/doc/internals.md +368 -0
- data/ext/rj_schema/rapidjson/doc/internals.zh-cn.md +363 -0
- data/ext/rj_schema/rapidjson/doc/logo/rapidjson.png +0 -0
- data/ext/rj_schema/rapidjson/doc/logo/rapidjson.svg +119 -0
- data/ext/rj_schema/rapidjson/doc/misc/DoxygenLayout.xml +194 -0
- data/ext/rj_schema/rapidjson/doc/misc/doxygenextra.css +274 -0
- data/ext/rj_schema/rapidjson/doc/misc/footer.html +11 -0
- data/ext/rj_schema/rapidjson/doc/misc/header.html +24 -0
- data/ext/rj_schema/rapidjson/doc/npm.md +31 -0
- data/ext/rj_schema/rapidjson/doc/performance.md +26 -0
- data/ext/rj_schema/rapidjson/doc/performance.zh-cn.md +26 -0
- data/ext/rj_schema/rapidjson/doc/pointer.md +234 -0
- data/ext/rj_schema/rapidjson/doc/pointer.zh-cn.md +234 -0
- data/ext/rj_schema/rapidjson/doc/sax.md +509 -0
- data/ext/rj_schema/rapidjson/doc/sax.zh-cn.md +487 -0
- data/ext/rj_schema/rapidjson/doc/schema.md +505 -0
- data/ext/rj_schema/rapidjson/doc/schema.zh-cn.md +237 -0
- data/ext/rj_schema/rapidjson/doc/stream.md +426 -0
- data/ext/rj_schema/rapidjson/doc/stream.zh-cn.md +426 -0
- data/ext/rj_schema/rapidjson/doc/tutorial.md +536 -0
- data/ext/rj_schema/rapidjson/doc/tutorial.zh-cn.md +534 -0
- data/ext/rj_schema/rapidjson/docker/debian/Dockerfile +8 -0
- data/ext/rj_schema/rapidjson/example/CMakeLists.txt +45 -0
- data/ext/rj_schema/rapidjson/example/archiver/archiver.cpp +292 -0
- data/ext/rj_schema/rapidjson/example/archiver/archiver.h +145 -0
- data/ext/rj_schema/rapidjson/example/archiver/archivertest.cpp +287 -0
- data/ext/rj_schema/rapidjson/example/capitalize/capitalize.cpp +67 -0
- data/ext/rj_schema/rapidjson/example/condense/condense.cpp +32 -0
- data/ext/rj_schema/rapidjson/example/filterkey/filterkey.cpp +135 -0
- data/ext/rj_schema/rapidjson/example/filterkeydom/filterkeydom.cpp +170 -0
- data/ext/rj_schema/rapidjson/example/jsonx/jsonx.cpp +207 -0
- data/ext/rj_schema/rapidjson/example/lookaheadparser/lookaheadparser.cpp +350 -0
- data/ext/rj_schema/rapidjson/example/messagereader/messagereader.cpp +105 -0
- data/ext/rj_schema/rapidjson/example/parsebyparts/parsebyparts.cpp +176 -0
- data/ext/rj_schema/rapidjson/example/pretty/pretty.cpp +30 -0
- data/ext/rj_schema/rapidjson/example/prettyauto/prettyauto.cpp +56 -0
- data/ext/rj_schema/rapidjson/example/schemavalidator/schemavalidator.cpp +78 -0
- data/ext/rj_schema/rapidjson/example/serialize/serialize.cpp +173 -0
- data/ext/rj_schema/rapidjson/example/simpledom/simpledom.cpp +29 -0
- data/ext/rj_schema/rapidjson/example/simplepullreader/simplepullreader.cpp +53 -0
- data/ext/rj_schema/rapidjson/example/simplereader/simplereader.cpp +42 -0
- data/ext/rj_schema/rapidjson/example/simplewriter/simplewriter.cpp +36 -0
- data/ext/rj_schema/rapidjson/example/tutorial/tutorial.cpp +151 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/allocators.h +271 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/cursorstreamwrapper.h +78 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/document.h +2630 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/encodedstream.h +299 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/encodings.h +716 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/error/en.h +74 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/error/error.h +161 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/filereadstream.h +99 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/filewritestream.h +104 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/fwd.h +151 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/biginteger.h +290 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/diyfp.h +258 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/dtoa.h +245 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/ieee754.h +78 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/itoa.h +304 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/meta.h +181 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/pow10.h +55 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/regex.h +734 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/stack.h +231 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/strfunc.h +69 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/strtod.h +269 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/internal/swap.h +46 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/istreamwrapper.h +115 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/memorybuffer.h +70 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/memorystream.h +71 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/msinttypes/inttypes.h +316 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/msinttypes/stdint.h +300 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/ostreamwrapper.h +81 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/pointer.h +1363 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/prettywriter.h +277 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/rapidjson.h +628 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/reader.h +2222 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/schema.h +2479 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/stream.h +223 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/stringbuffer.h +121 -0
- data/ext/rj_schema/rapidjson/include/rapidjson/writer.h +716 -0
- data/ext/rj_schema/rapidjson/include_dirs.js +2 -0
- data/ext/rj_schema/rapidjson/library.json +15 -0
- data/ext/rj_schema/rapidjson/license.txt +57 -0
- data/ext/rj_schema/rapidjson/package.json +24 -0
- data/ext/rj_schema/rapidjson/rapidjson.autopkg +77 -0
- data/ext/rj_schema/rapidjson/readme.md +160 -0
- data/ext/rj_schema/rapidjson/readme.zh-cn.md +152 -0
- data/ext/rj_schema/rapidjson/test/CMakeLists.txt +20 -0
- data/ext/rj_schema/rapidjson/test/perftest/CMakeLists.txt +28 -0
- data/ext/rj_schema/rapidjson/test/perftest/misctest.cpp +974 -0
- data/ext/rj_schema/rapidjson/test/perftest/perftest.cpp +24 -0
- data/ext/rj_schema/rapidjson/test/perftest/perftest.h +185 -0
- data/ext/rj_schema/rapidjson/test/perftest/platformtest.cpp +166 -0
- data/ext/rj_schema/rapidjson/test/perftest/rapidjsontest.cpp +472 -0
- data/ext/rj_schema/rapidjson/test/perftest/schematest.cpp +216 -0
- data/ext/rj_schema/rapidjson/test/unittest/CMakeLists.txt +92 -0
- data/ext/rj_schema/rapidjson/test/unittest/allocatorstest.cpp +102 -0
- data/ext/rj_schema/rapidjson/test/unittest/bigintegertest.cpp +133 -0
- data/ext/rj_schema/rapidjson/test/unittest/cursorstreamwrappertest.cpp +115 -0
- data/ext/rj_schema/rapidjson/test/unittest/documenttest.cpp +672 -0
- data/ext/rj_schema/rapidjson/test/unittest/dtoatest.cpp +98 -0
- data/ext/rj_schema/rapidjson/test/unittest/encodedstreamtest.cpp +313 -0
- data/ext/rj_schema/rapidjson/test/unittest/encodingstest.cpp +451 -0
- data/ext/rj_schema/rapidjson/test/unittest/filestreamtest.cpp +112 -0
- data/ext/rj_schema/rapidjson/test/unittest/fwdtest.cpp +230 -0
- data/ext/rj_schema/rapidjson/test/unittest/istreamwrappertest.cpp +181 -0
- data/ext/rj_schema/rapidjson/test/unittest/itoatest.cpp +160 -0
- data/ext/rj_schema/rapidjson/test/unittest/jsoncheckertest.cpp +143 -0
- data/ext/rj_schema/rapidjson/test/unittest/namespacetest.cpp +70 -0
- data/ext/rj_schema/rapidjson/test/unittest/ostreamwrappertest.cpp +92 -0
- data/ext/rj_schema/rapidjson/test/unittest/pointertest.cpp +1529 -0
- data/ext/rj_schema/rapidjson/test/unittest/prettywritertest.cpp +344 -0
- data/ext/rj_schema/rapidjson/test/unittest/readertest.cpp +1895 -0
- data/ext/rj_schema/rapidjson/test/unittest/regextest.cpp +638 -0
- data/ext/rj_schema/rapidjson/test/unittest/schematest.cpp +2009 -0
- data/ext/rj_schema/rapidjson/test/unittest/simdtest.cpp +219 -0
- data/ext/rj_schema/rapidjson/test/unittest/strfunctest.cpp +30 -0
- data/ext/rj_schema/rapidjson/test/unittest/stringbuffertest.cpp +192 -0
- data/ext/rj_schema/rapidjson/test/unittest/strtodtest.cpp +132 -0
- data/ext/rj_schema/rapidjson/test/unittest/unittest.cpp +51 -0
- data/ext/rj_schema/rapidjson/test/unittest/unittest.h +140 -0
- data/ext/rj_schema/rapidjson/test/unittest/valuetest.cpp +1829 -0
- data/ext/rj_schema/rapidjson/test/unittest/writertest.cpp +598 -0
- data/ext/rj_schema/rapidjson/test/valgrind.supp +17 -0
- data/ext/rj_schema/rapidjson/travis-doxygen.sh +121 -0
- data/ext/rj_schema/rj_schema.cpp +136 -0
- data/lib/rj_schema.rb +7 -0
- metadata +371 -0
@@ -0,0 +1,245 @@
|
|
1
|
+
// Tencent is pleased to support the open source community by making RapidJSON available.
|
2
|
+
//
|
3
|
+
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
4
|
+
//
|
5
|
+
// Licensed under the MIT License (the "License"); you may not use this file except
|
6
|
+
// in compliance with the License. You may obtain a copy of the License at
|
7
|
+
//
|
8
|
+
// http://opensource.org/licenses/MIT
|
9
|
+
//
|
10
|
+
// Unless required by applicable law or agreed to in writing, software distributed
|
11
|
+
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
12
|
+
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
13
|
+
// specific language governing permissions and limitations under the License.
|
14
|
+
|
15
|
+
// This is a C++ header-only implementation of Grisu2 algorithm from the publication:
|
16
|
+
// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with
|
17
|
+
// integers." ACM Sigplan Notices 45.6 (2010): 233-243.
|
18
|
+
|
19
|
+
#ifndef RAPIDJSON_DTOA_
|
20
|
+
#define RAPIDJSON_DTOA_
|
21
|
+
|
22
|
+
#include "itoa.h" // GetDigitsLut()
|
23
|
+
#include "diyfp.h"
|
24
|
+
#include "ieee754.h"
|
25
|
+
|
26
|
+
RAPIDJSON_NAMESPACE_BEGIN
|
27
|
+
namespace internal {
|
28
|
+
|
29
|
+
#ifdef __GNUC__
|
30
|
+
RAPIDJSON_DIAG_PUSH
|
31
|
+
RAPIDJSON_DIAG_OFF(effc++)
|
32
|
+
RAPIDJSON_DIAG_OFF(array-bounds) // some gcc versions generate wrong warnings https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59124
|
33
|
+
#endif
|
34
|
+
|
35
|
+
inline void GrisuRound(char* buffer, int len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {
|
36
|
+
while (rest < wp_w && delta - rest >= ten_kappa &&
|
37
|
+
(rest + ten_kappa < wp_w || /// closer
|
38
|
+
wp_w - rest > rest + ten_kappa - wp_w)) {
|
39
|
+
buffer[len - 1]--;
|
40
|
+
rest += ten_kappa;
|
41
|
+
}
|
42
|
+
}
|
43
|
+
|
44
|
+
inline int CountDecimalDigit32(uint32_t n) {
|
45
|
+
// Simple pure C++ implementation was faster than __builtin_clz version in this situation.
|
46
|
+
if (n < 10) return 1;
|
47
|
+
if (n < 100) return 2;
|
48
|
+
if (n < 1000) return 3;
|
49
|
+
if (n < 10000) return 4;
|
50
|
+
if (n < 100000) return 5;
|
51
|
+
if (n < 1000000) return 6;
|
52
|
+
if (n < 10000000) return 7;
|
53
|
+
if (n < 100000000) return 8;
|
54
|
+
// Will not reach 10 digits in DigitGen()
|
55
|
+
//if (n < 1000000000) return 9;
|
56
|
+
//return 10;
|
57
|
+
return 9;
|
58
|
+
}
|
59
|
+
|
60
|
+
inline void DigitGen(const DiyFp& W, const DiyFp& Mp, uint64_t delta, char* buffer, int* len, int* K) {
|
61
|
+
static const uint32_t kPow10[] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };
|
62
|
+
const DiyFp one(uint64_t(1) << -Mp.e, Mp.e);
|
63
|
+
const DiyFp wp_w = Mp - W;
|
64
|
+
uint32_t p1 = static_cast<uint32_t>(Mp.f >> -one.e);
|
65
|
+
uint64_t p2 = Mp.f & (one.f - 1);
|
66
|
+
int kappa = CountDecimalDigit32(p1); // kappa in [0, 9]
|
67
|
+
*len = 0;
|
68
|
+
|
69
|
+
while (kappa > 0) {
|
70
|
+
uint32_t d = 0;
|
71
|
+
switch (kappa) {
|
72
|
+
case 9: d = p1 / 100000000; p1 %= 100000000; break;
|
73
|
+
case 8: d = p1 / 10000000; p1 %= 10000000; break;
|
74
|
+
case 7: d = p1 / 1000000; p1 %= 1000000; break;
|
75
|
+
case 6: d = p1 / 100000; p1 %= 100000; break;
|
76
|
+
case 5: d = p1 / 10000; p1 %= 10000; break;
|
77
|
+
case 4: d = p1 / 1000; p1 %= 1000; break;
|
78
|
+
case 3: d = p1 / 100; p1 %= 100; break;
|
79
|
+
case 2: d = p1 / 10; p1 %= 10; break;
|
80
|
+
case 1: d = p1; p1 = 0; break;
|
81
|
+
default:;
|
82
|
+
}
|
83
|
+
if (d || *len)
|
84
|
+
buffer[(*len)++] = static_cast<char>('0' + static_cast<char>(d));
|
85
|
+
kappa--;
|
86
|
+
uint64_t tmp = (static_cast<uint64_t>(p1) << -one.e) + p2;
|
87
|
+
if (tmp <= delta) {
|
88
|
+
*K += kappa;
|
89
|
+
GrisuRound(buffer, *len, delta, tmp, static_cast<uint64_t>(kPow10[kappa]) << -one.e, wp_w.f);
|
90
|
+
return;
|
91
|
+
}
|
92
|
+
}
|
93
|
+
|
94
|
+
// kappa = 0
|
95
|
+
for (;;) {
|
96
|
+
p2 *= 10;
|
97
|
+
delta *= 10;
|
98
|
+
char d = static_cast<char>(p2 >> -one.e);
|
99
|
+
if (d || *len)
|
100
|
+
buffer[(*len)++] = static_cast<char>('0' + d);
|
101
|
+
p2 &= one.f - 1;
|
102
|
+
kappa--;
|
103
|
+
if (p2 < delta) {
|
104
|
+
*K += kappa;
|
105
|
+
int index = -kappa;
|
106
|
+
GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * (index < 9 ? kPow10[index] : 0));
|
107
|
+
return;
|
108
|
+
}
|
109
|
+
}
|
110
|
+
}
|
111
|
+
|
112
|
+
inline void Grisu2(double value, char* buffer, int* length, int* K) {
|
113
|
+
const DiyFp v(value);
|
114
|
+
DiyFp w_m, w_p;
|
115
|
+
v.NormalizedBoundaries(&w_m, &w_p);
|
116
|
+
|
117
|
+
const DiyFp c_mk = GetCachedPower(w_p.e, K);
|
118
|
+
const DiyFp W = v.Normalize() * c_mk;
|
119
|
+
DiyFp Wp = w_p * c_mk;
|
120
|
+
DiyFp Wm = w_m * c_mk;
|
121
|
+
Wm.f++;
|
122
|
+
Wp.f--;
|
123
|
+
DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);
|
124
|
+
}
|
125
|
+
|
126
|
+
inline char* WriteExponent(int K, char* buffer) {
|
127
|
+
if (K < 0) {
|
128
|
+
*buffer++ = '-';
|
129
|
+
K = -K;
|
130
|
+
}
|
131
|
+
|
132
|
+
if (K >= 100) {
|
133
|
+
*buffer++ = static_cast<char>('0' + static_cast<char>(K / 100));
|
134
|
+
K %= 100;
|
135
|
+
const char* d = GetDigitsLut() + K * 2;
|
136
|
+
*buffer++ = d[0];
|
137
|
+
*buffer++ = d[1];
|
138
|
+
}
|
139
|
+
else if (K >= 10) {
|
140
|
+
const char* d = GetDigitsLut() + K * 2;
|
141
|
+
*buffer++ = d[0];
|
142
|
+
*buffer++ = d[1];
|
143
|
+
}
|
144
|
+
else
|
145
|
+
*buffer++ = static_cast<char>('0' + static_cast<char>(K));
|
146
|
+
|
147
|
+
return buffer;
|
148
|
+
}
|
149
|
+
|
150
|
+
inline char* Prettify(char* buffer, int length, int k, int maxDecimalPlaces) {
|
151
|
+
const int kk = length + k; // 10^(kk-1) <= v < 10^kk
|
152
|
+
|
153
|
+
if (0 <= k && kk <= 21) {
|
154
|
+
// 1234e7 -> 12340000000
|
155
|
+
for (int i = length; i < kk; i++)
|
156
|
+
buffer[i] = '0';
|
157
|
+
buffer[kk] = '.';
|
158
|
+
buffer[kk + 1] = '0';
|
159
|
+
return &buffer[kk + 2];
|
160
|
+
}
|
161
|
+
else if (0 < kk && kk <= 21) {
|
162
|
+
// 1234e-2 -> 12.34
|
163
|
+
std::memmove(&buffer[kk + 1], &buffer[kk], static_cast<size_t>(length - kk));
|
164
|
+
buffer[kk] = '.';
|
165
|
+
if (0 > k + maxDecimalPlaces) {
|
166
|
+
// When maxDecimalPlaces = 2, 1.2345 -> 1.23, 1.102 -> 1.1
|
167
|
+
// Remove extra trailing zeros (at least one) after truncation.
|
168
|
+
for (int i = kk + maxDecimalPlaces; i > kk + 1; i--)
|
169
|
+
if (buffer[i] != '0')
|
170
|
+
return &buffer[i + 1];
|
171
|
+
return &buffer[kk + 2]; // Reserve one zero
|
172
|
+
}
|
173
|
+
else
|
174
|
+
return &buffer[length + 1];
|
175
|
+
}
|
176
|
+
else if (-6 < kk && kk <= 0) {
|
177
|
+
// 1234e-6 -> 0.001234
|
178
|
+
const int offset = 2 - kk;
|
179
|
+
std::memmove(&buffer[offset], &buffer[0], static_cast<size_t>(length));
|
180
|
+
buffer[0] = '0';
|
181
|
+
buffer[1] = '.';
|
182
|
+
for (int i = 2; i < offset; i++)
|
183
|
+
buffer[i] = '0';
|
184
|
+
if (length - kk > maxDecimalPlaces) {
|
185
|
+
// When maxDecimalPlaces = 2, 0.123 -> 0.12, 0.102 -> 0.1
|
186
|
+
// Remove extra trailing zeros (at least one) after truncation.
|
187
|
+
for (int i = maxDecimalPlaces + 1; i > 2; i--)
|
188
|
+
if (buffer[i] != '0')
|
189
|
+
return &buffer[i + 1];
|
190
|
+
return &buffer[3]; // Reserve one zero
|
191
|
+
}
|
192
|
+
else
|
193
|
+
return &buffer[length + offset];
|
194
|
+
}
|
195
|
+
else if (kk < -maxDecimalPlaces) {
|
196
|
+
// Truncate to zero
|
197
|
+
buffer[0] = '0';
|
198
|
+
buffer[1] = '.';
|
199
|
+
buffer[2] = '0';
|
200
|
+
return &buffer[3];
|
201
|
+
}
|
202
|
+
else if (length == 1) {
|
203
|
+
// 1e30
|
204
|
+
buffer[1] = 'e';
|
205
|
+
return WriteExponent(kk - 1, &buffer[2]);
|
206
|
+
}
|
207
|
+
else {
|
208
|
+
// 1234e30 -> 1.234e33
|
209
|
+
std::memmove(&buffer[2], &buffer[1], static_cast<size_t>(length - 1));
|
210
|
+
buffer[1] = '.';
|
211
|
+
buffer[length + 1] = 'e';
|
212
|
+
return WriteExponent(kk - 1, &buffer[0 + length + 2]);
|
213
|
+
}
|
214
|
+
}
|
215
|
+
|
216
|
+
inline char* dtoa(double value, char* buffer, int maxDecimalPlaces = 324) {
|
217
|
+
RAPIDJSON_ASSERT(maxDecimalPlaces >= 1);
|
218
|
+
Double d(value);
|
219
|
+
if (d.IsZero()) {
|
220
|
+
if (d.Sign())
|
221
|
+
*buffer++ = '-'; // -0.0, Issue #289
|
222
|
+
buffer[0] = '0';
|
223
|
+
buffer[1] = '.';
|
224
|
+
buffer[2] = '0';
|
225
|
+
return &buffer[3];
|
226
|
+
}
|
227
|
+
else {
|
228
|
+
if (value < 0) {
|
229
|
+
*buffer++ = '-';
|
230
|
+
value = -value;
|
231
|
+
}
|
232
|
+
int length, K;
|
233
|
+
Grisu2(value, buffer, &length, &K);
|
234
|
+
return Prettify(buffer, length, K, maxDecimalPlaces);
|
235
|
+
}
|
236
|
+
}
|
237
|
+
|
238
|
+
#ifdef __GNUC__
|
239
|
+
RAPIDJSON_DIAG_POP
|
240
|
+
#endif
|
241
|
+
|
242
|
+
} // namespace internal
|
243
|
+
RAPIDJSON_NAMESPACE_END
|
244
|
+
|
245
|
+
#endif // RAPIDJSON_DTOA_
|
@@ -0,0 +1,78 @@
|
|
1
|
+
// Tencent is pleased to support the open source community by making RapidJSON available.
|
2
|
+
//
|
3
|
+
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
4
|
+
//
|
5
|
+
// Licensed under the MIT License (the "License"); you may not use this file except
|
6
|
+
// in compliance with the License. You may obtain a copy of the License at
|
7
|
+
//
|
8
|
+
// http://opensource.org/licenses/MIT
|
9
|
+
//
|
10
|
+
// Unless required by applicable law or agreed to in writing, software distributed
|
11
|
+
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
12
|
+
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
13
|
+
// specific language governing permissions and limitations under the License.
|
14
|
+
|
15
|
+
#ifndef RAPIDJSON_IEEE754_
|
16
|
+
#define RAPIDJSON_IEEE754_
|
17
|
+
|
18
|
+
#include "../rapidjson.h"
|
19
|
+
|
20
|
+
RAPIDJSON_NAMESPACE_BEGIN
|
21
|
+
namespace internal {
|
22
|
+
|
23
|
+
class Double {
|
24
|
+
public:
|
25
|
+
Double() {}
|
26
|
+
Double(double d) : d_(d) {}
|
27
|
+
Double(uint64_t u) : u_(u) {}
|
28
|
+
|
29
|
+
double Value() const { return d_; }
|
30
|
+
uint64_t Uint64Value() const { return u_; }
|
31
|
+
|
32
|
+
double NextPositiveDouble() const {
|
33
|
+
RAPIDJSON_ASSERT(!Sign());
|
34
|
+
return Double(u_ + 1).Value();
|
35
|
+
}
|
36
|
+
|
37
|
+
bool Sign() const { return (u_ & kSignMask) != 0; }
|
38
|
+
uint64_t Significand() const { return u_ & kSignificandMask; }
|
39
|
+
int Exponent() const { return static_cast<int>(((u_ & kExponentMask) >> kSignificandSize) - kExponentBias); }
|
40
|
+
|
41
|
+
bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; }
|
42
|
+
bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; }
|
43
|
+
bool IsNanOrInf() const { return (u_ & kExponentMask) == kExponentMask; }
|
44
|
+
bool IsNormal() const { return (u_ & kExponentMask) != 0 || Significand() == 0; }
|
45
|
+
bool IsZero() const { return (u_ & (kExponentMask | kSignificandMask)) == 0; }
|
46
|
+
|
47
|
+
uint64_t IntegerSignificand() const { return IsNormal() ? Significand() | kHiddenBit : Significand(); }
|
48
|
+
int IntegerExponent() const { return (IsNormal() ? Exponent() : kDenormalExponent) - kSignificandSize; }
|
49
|
+
uint64_t ToBias() const { return (u_ & kSignMask) ? ~u_ + 1 : u_ | kSignMask; }
|
50
|
+
|
51
|
+
static int EffectiveSignificandSize(int order) {
|
52
|
+
if (order >= -1021)
|
53
|
+
return 53;
|
54
|
+
else if (order <= -1074)
|
55
|
+
return 0;
|
56
|
+
else
|
57
|
+
return order + 1074;
|
58
|
+
}
|
59
|
+
|
60
|
+
private:
|
61
|
+
static const int kSignificandSize = 52;
|
62
|
+
static const int kExponentBias = 0x3FF;
|
63
|
+
static const int kDenormalExponent = 1 - kExponentBias;
|
64
|
+
static const uint64_t kSignMask = RAPIDJSON_UINT64_C2(0x80000000, 0x00000000);
|
65
|
+
static const uint64_t kExponentMask = RAPIDJSON_UINT64_C2(0x7FF00000, 0x00000000);
|
66
|
+
static const uint64_t kSignificandMask = RAPIDJSON_UINT64_C2(0x000FFFFF, 0xFFFFFFFF);
|
67
|
+
static const uint64_t kHiddenBit = RAPIDJSON_UINT64_C2(0x00100000, 0x00000000);
|
68
|
+
|
69
|
+
union {
|
70
|
+
double d_;
|
71
|
+
uint64_t u_;
|
72
|
+
};
|
73
|
+
};
|
74
|
+
|
75
|
+
} // namespace internal
|
76
|
+
RAPIDJSON_NAMESPACE_END
|
77
|
+
|
78
|
+
#endif // RAPIDJSON_IEEE754_
|
@@ -0,0 +1,304 @@
|
|
1
|
+
// Tencent is pleased to support the open source community by making RapidJSON available.
|
2
|
+
//
|
3
|
+
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
4
|
+
//
|
5
|
+
// Licensed under the MIT License (the "License"); you may not use this file except
|
6
|
+
// in compliance with the License. You may obtain a copy of the License at
|
7
|
+
//
|
8
|
+
// http://opensource.org/licenses/MIT
|
9
|
+
//
|
10
|
+
// Unless required by applicable law or agreed to in writing, software distributed
|
11
|
+
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
12
|
+
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
13
|
+
// specific language governing permissions and limitations under the License.
|
14
|
+
|
15
|
+
#ifndef RAPIDJSON_ITOA_
|
16
|
+
#define RAPIDJSON_ITOA_
|
17
|
+
|
18
|
+
#include "../rapidjson.h"
|
19
|
+
|
20
|
+
RAPIDJSON_NAMESPACE_BEGIN
|
21
|
+
namespace internal {
|
22
|
+
|
23
|
+
inline const char* GetDigitsLut() {
|
24
|
+
static const char cDigitsLut[200] = {
|
25
|
+
'0','0','0','1','0','2','0','3','0','4','0','5','0','6','0','7','0','8','0','9',
|
26
|
+
'1','0','1','1','1','2','1','3','1','4','1','5','1','6','1','7','1','8','1','9',
|
27
|
+
'2','0','2','1','2','2','2','3','2','4','2','5','2','6','2','7','2','8','2','9',
|
28
|
+
'3','0','3','1','3','2','3','3','3','4','3','5','3','6','3','7','3','8','3','9',
|
29
|
+
'4','0','4','1','4','2','4','3','4','4','4','5','4','6','4','7','4','8','4','9',
|
30
|
+
'5','0','5','1','5','2','5','3','5','4','5','5','5','6','5','7','5','8','5','9',
|
31
|
+
'6','0','6','1','6','2','6','3','6','4','6','5','6','6','6','7','6','8','6','9',
|
32
|
+
'7','0','7','1','7','2','7','3','7','4','7','5','7','6','7','7','7','8','7','9',
|
33
|
+
'8','0','8','1','8','2','8','3','8','4','8','5','8','6','8','7','8','8','8','9',
|
34
|
+
'9','0','9','1','9','2','9','3','9','4','9','5','9','6','9','7','9','8','9','9'
|
35
|
+
};
|
36
|
+
return cDigitsLut;
|
37
|
+
}
|
38
|
+
|
39
|
+
inline char* u32toa(uint32_t value, char* buffer) {
|
40
|
+
const char* cDigitsLut = GetDigitsLut();
|
41
|
+
|
42
|
+
if (value < 10000) {
|
43
|
+
const uint32_t d1 = (value / 100) << 1;
|
44
|
+
const uint32_t d2 = (value % 100) << 1;
|
45
|
+
|
46
|
+
if (value >= 1000)
|
47
|
+
*buffer++ = cDigitsLut[d1];
|
48
|
+
if (value >= 100)
|
49
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
50
|
+
if (value >= 10)
|
51
|
+
*buffer++ = cDigitsLut[d2];
|
52
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
53
|
+
}
|
54
|
+
else if (value < 100000000) {
|
55
|
+
// value = bbbbcccc
|
56
|
+
const uint32_t b = value / 10000;
|
57
|
+
const uint32_t c = value % 10000;
|
58
|
+
|
59
|
+
const uint32_t d1 = (b / 100) << 1;
|
60
|
+
const uint32_t d2 = (b % 100) << 1;
|
61
|
+
|
62
|
+
const uint32_t d3 = (c / 100) << 1;
|
63
|
+
const uint32_t d4 = (c % 100) << 1;
|
64
|
+
|
65
|
+
if (value >= 10000000)
|
66
|
+
*buffer++ = cDigitsLut[d1];
|
67
|
+
if (value >= 1000000)
|
68
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
69
|
+
if (value >= 100000)
|
70
|
+
*buffer++ = cDigitsLut[d2];
|
71
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
72
|
+
|
73
|
+
*buffer++ = cDigitsLut[d3];
|
74
|
+
*buffer++ = cDigitsLut[d3 + 1];
|
75
|
+
*buffer++ = cDigitsLut[d4];
|
76
|
+
*buffer++ = cDigitsLut[d4 + 1];
|
77
|
+
}
|
78
|
+
else {
|
79
|
+
// value = aabbbbcccc in decimal
|
80
|
+
|
81
|
+
const uint32_t a = value / 100000000; // 1 to 42
|
82
|
+
value %= 100000000;
|
83
|
+
|
84
|
+
if (a >= 10) {
|
85
|
+
const unsigned i = a << 1;
|
86
|
+
*buffer++ = cDigitsLut[i];
|
87
|
+
*buffer++ = cDigitsLut[i + 1];
|
88
|
+
}
|
89
|
+
else
|
90
|
+
*buffer++ = static_cast<char>('0' + static_cast<char>(a));
|
91
|
+
|
92
|
+
const uint32_t b = value / 10000; // 0 to 9999
|
93
|
+
const uint32_t c = value % 10000; // 0 to 9999
|
94
|
+
|
95
|
+
const uint32_t d1 = (b / 100) << 1;
|
96
|
+
const uint32_t d2 = (b % 100) << 1;
|
97
|
+
|
98
|
+
const uint32_t d3 = (c / 100) << 1;
|
99
|
+
const uint32_t d4 = (c % 100) << 1;
|
100
|
+
|
101
|
+
*buffer++ = cDigitsLut[d1];
|
102
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
103
|
+
*buffer++ = cDigitsLut[d2];
|
104
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
105
|
+
*buffer++ = cDigitsLut[d3];
|
106
|
+
*buffer++ = cDigitsLut[d3 + 1];
|
107
|
+
*buffer++ = cDigitsLut[d4];
|
108
|
+
*buffer++ = cDigitsLut[d4 + 1];
|
109
|
+
}
|
110
|
+
return buffer;
|
111
|
+
}
|
112
|
+
|
113
|
+
inline char* i32toa(int32_t value, char* buffer) {
|
114
|
+
uint32_t u = static_cast<uint32_t>(value);
|
115
|
+
if (value < 0) {
|
116
|
+
*buffer++ = '-';
|
117
|
+
u = ~u + 1;
|
118
|
+
}
|
119
|
+
|
120
|
+
return u32toa(u, buffer);
|
121
|
+
}
|
122
|
+
|
123
|
+
inline char* u64toa(uint64_t value, char* buffer) {
|
124
|
+
const char* cDigitsLut = GetDigitsLut();
|
125
|
+
const uint64_t kTen8 = 100000000;
|
126
|
+
const uint64_t kTen9 = kTen8 * 10;
|
127
|
+
const uint64_t kTen10 = kTen8 * 100;
|
128
|
+
const uint64_t kTen11 = kTen8 * 1000;
|
129
|
+
const uint64_t kTen12 = kTen8 * 10000;
|
130
|
+
const uint64_t kTen13 = kTen8 * 100000;
|
131
|
+
const uint64_t kTen14 = kTen8 * 1000000;
|
132
|
+
const uint64_t kTen15 = kTen8 * 10000000;
|
133
|
+
const uint64_t kTen16 = kTen8 * kTen8;
|
134
|
+
|
135
|
+
if (value < kTen8) {
|
136
|
+
uint32_t v = static_cast<uint32_t>(value);
|
137
|
+
if (v < 10000) {
|
138
|
+
const uint32_t d1 = (v / 100) << 1;
|
139
|
+
const uint32_t d2 = (v % 100) << 1;
|
140
|
+
|
141
|
+
if (v >= 1000)
|
142
|
+
*buffer++ = cDigitsLut[d1];
|
143
|
+
if (v >= 100)
|
144
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
145
|
+
if (v >= 10)
|
146
|
+
*buffer++ = cDigitsLut[d2];
|
147
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
148
|
+
}
|
149
|
+
else {
|
150
|
+
// value = bbbbcccc
|
151
|
+
const uint32_t b = v / 10000;
|
152
|
+
const uint32_t c = v % 10000;
|
153
|
+
|
154
|
+
const uint32_t d1 = (b / 100) << 1;
|
155
|
+
const uint32_t d2 = (b % 100) << 1;
|
156
|
+
|
157
|
+
const uint32_t d3 = (c / 100) << 1;
|
158
|
+
const uint32_t d4 = (c % 100) << 1;
|
159
|
+
|
160
|
+
if (value >= 10000000)
|
161
|
+
*buffer++ = cDigitsLut[d1];
|
162
|
+
if (value >= 1000000)
|
163
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
164
|
+
if (value >= 100000)
|
165
|
+
*buffer++ = cDigitsLut[d2];
|
166
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
167
|
+
|
168
|
+
*buffer++ = cDigitsLut[d3];
|
169
|
+
*buffer++ = cDigitsLut[d3 + 1];
|
170
|
+
*buffer++ = cDigitsLut[d4];
|
171
|
+
*buffer++ = cDigitsLut[d4 + 1];
|
172
|
+
}
|
173
|
+
}
|
174
|
+
else if (value < kTen16) {
|
175
|
+
const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
|
176
|
+
const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
|
177
|
+
|
178
|
+
const uint32_t b0 = v0 / 10000;
|
179
|
+
const uint32_t c0 = v0 % 10000;
|
180
|
+
|
181
|
+
const uint32_t d1 = (b0 / 100) << 1;
|
182
|
+
const uint32_t d2 = (b0 % 100) << 1;
|
183
|
+
|
184
|
+
const uint32_t d3 = (c0 / 100) << 1;
|
185
|
+
const uint32_t d4 = (c0 % 100) << 1;
|
186
|
+
|
187
|
+
const uint32_t b1 = v1 / 10000;
|
188
|
+
const uint32_t c1 = v1 % 10000;
|
189
|
+
|
190
|
+
const uint32_t d5 = (b1 / 100) << 1;
|
191
|
+
const uint32_t d6 = (b1 % 100) << 1;
|
192
|
+
|
193
|
+
const uint32_t d7 = (c1 / 100) << 1;
|
194
|
+
const uint32_t d8 = (c1 % 100) << 1;
|
195
|
+
|
196
|
+
if (value >= kTen15)
|
197
|
+
*buffer++ = cDigitsLut[d1];
|
198
|
+
if (value >= kTen14)
|
199
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
200
|
+
if (value >= kTen13)
|
201
|
+
*buffer++ = cDigitsLut[d2];
|
202
|
+
if (value >= kTen12)
|
203
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
204
|
+
if (value >= kTen11)
|
205
|
+
*buffer++ = cDigitsLut[d3];
|
206
|
+
if (value >= kTen10)
|
207
|
+
*buffer++ = cDigitsLut[d3 + 1];
|
208
|
+
if (value >= kTen9)
|
209
|
+
*buffer++ = cDigitsLut[d4];
|
210
|
+
if (value >= kTen8)
|
211
|
+
*buffer++ = cDigitsLut[d4 + 1];
|
212
|
+
|
213
|
+
*buffer++ = cDigitsLut[d5];
|
214
|
+
*buffer++ = cDigitsLut[d5 + 1];
|
215
|
+
*buffer++ = cDigitsLut[d6];
|
216
|
+
*buffer++ = cDigitsLut[d6 + 1];
|
217
|
+
*buffer++ = cDigitsLut[d7];
|
218
|
+
*buffer++ = cDigitsLut[d7 + 1];
|
219
|
+
*buffer++ = cDigitsLut[d8];
|
220
|
+
*buffer++ = cDigitsLut[d8 + 1];
|
221
|
+
}
|
222
|
+
else {
|
223
|
+
const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844
|
224
|
+
value %= kTen16;
|
225
|
+
|
226
|
+
if (a < 10)
|
227
|
+
*buffer++ = static_cast<char>('0' + static_cast<char>(a));
|
228
|
+
else if (a < 100) {
|
229
|
+
const uint32_t i = a << 1;
|
230
|
+
*buffer++ = cDigitsLut[i];
|
231
|
+
*buffer++ = cDigitsLut[i + 1];
|
232
|
+
}
|
233
|
+
else if (a < 1000) {
|
234
|
+
*buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));
|
235
|
+
|
236
|
+
const uint32_t i = (a % 100) << 1;
|
237
|
+
*buffer++ = cDigitsLut[i];
|
238
|
+
*buffer++ = cDigitsLut[i + 1];
|
239
|
+
}
|
240
|
+
else {
|
241
|
+
const uint32_t i = (a / 100) << 1;
|
242
|
+
const uint32_t j = (a % 100) << 1;
|
243
|
+
*buffer++ = cDigitsLut[i];
|
244
|
+
*buffer++ = cDigitsLut[i + 1];
|
245
|
+
*buffer++ = cDigitsLut[j];
|
246
|
+
*buffer++ = cDigitsLut[j + 1];
|
247
|
+
}
|
248
|
+
|
249
|
+
const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
|
250
|
+
const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
|
251
|
+
|
252
|
+
const uint32_t b0 = v0 / 10000;
|
253
|
+
const uint32_t c0 = v0 % 10000;
|
254
|
+
|
255
|
+
const uint32_t d1 = (b0 / 100) << 1;
|
256
|
+
const uint32_t d2 = (b0 % 100) << 1;
|
257
|
+
|
258
|
+
const uint32_t d3 = (c0 / 100) << 1;
|
259
|
+
const uint32_t d4 = (c0 % 100) << 1;
|
260
|
+
|
261
|
+
const uint32_t b1 = v1 / 10000;
|
262
|
+
const uint32_t c1 = v1 % 10000;
|
263
|
+
|
264
|
+
const uint32_t d5 = (b1 / 100) << 1;
|
265
|
+
const uint32_t d6 = (b1 % 100) << 1;
|
266
|
+
|
267
|
+
const uint32_t d7 = (c1 / 100) << 1;
|
268
|
+
const uint32_t d8 = (c1 % 100) << 1;
|
269
|
+
|
270
|
+
*buffer++ = cDigitsLut[d1];
|
271
|
+
*buffer++ = cDigitsLut[d1 + 1];
|
272
|
+
*buffer++ = cDigitsLut[d2];
|
273
|
+
*buffer++ = cDigitsLut[d2 + 1];
|
274
|
+
*buffer++ = cDigitsLut[d3];
|
275
|
+
*buffer++ = cDigitsLut[d3 + 1];
|
276
|
+
*buffer++ = cDigitsLut[d4];
|
277
|
+
*buffer++ = cDigitsLut[d4 + 1];
|
278
|
+
*buffer++ = cDigitsLut[d5];
|
279
|
+
*buffer++ = cDigitsLut[d5 + 1];
|
280
|
+
*buffer++ = cDigitsLut[d6];
|
281
|
+
*buffer++ = cDigitsLut[d6 + 1];
|
282
|
+
*buffer++ = cDigitsLut[d7];
|
283
|
+
*buffer++ = cDigitsLut[d7 + 1];
|
284
|
+
*buffer++ = cDigitsLut[d8];
|
285
|
+
*buffer++ = cDigitsLut[d8 + 1];
|
286
|
+
}
|
287
|
+
|
288
|
+
return buffer;
|
289
|
+
}
|
290
|
+
|
291
|
+
inline char* i64toa(int64_t value, char* buffer) {
|
292
|
+
uint64_t u = static_cast<uint64_t>(value);
|
293
|
+
if (value < 0) {
|
294
|
+
*buffer++ = '-';
|
295
|
+
u = ~u + 1;
|
296
|
+
}
|
297
|
+
|
298
|
+
return u64toa(u, buffer);
|
299
|
+
}
|
300
|
+
|
301
|
+
} // namespace internal
|
302
|
+
RAPIDJSON_NAMESPACE_END
|
303
|
+
|
304
|
+
#endif // RAPIDJSON_ITOA_
|