File: reader.cpp

package info (click to toggle)
jazz2-native 3.5.0-2
  • links: PTS, VCS
  • area: contrib
  • in suites: forky, sid
  • size: 16,912 kB
  • sloc: cpp: 172,557; xml: 113; python: 36; makefile: 5; sh: 2
file content (1227 lines) | stat: -rw-r--r-- 35,379 bytes parent folder | download
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
// Copyright 2007-2011 Baptiste Lepilleur and The JsonCpp Authors
// Copyright (C) 2016 InfoTeCS JSC. All rights reserved.
// Distributed under MIT license, or public domain if desired and
// recognized in your jurisdiction.
// See file LICENSE for detail or copy at http://jsoncpp.sourceforge.net/LICENSE

#include "json_tool.h"
#include "assertions.h"
#include "reader.h"
#include "value.h"

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <istream>
#include <limits>
#include <memory>
#include <set>
#include <sstream>
#include <utility>

#include <cstdio>

#if defined(_MSC_VER)
#	if !defined(_CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES)
#		define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1
#	endif //_CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES
#endif //_MSC_VER

#if defined(_MSC_VER)
// Disable warning about strdup being deprecated.
#pragma warning(disable : 4996)
#endif

// Define JSONCPP_DEPRECATED_STACK_LIMIT as an appropriate integer at compile
// time to change the stack limit
#if !defined(JSONCPP_DEPRECATED_STACK_LIMIT)
#	define JSONCPP_DEPRECATED_STACK_LIMIT 1000
#endif

static size_t const stackLimit_g = JSONCPP_DEPRECATED_STACK_LIMIT; // see readValue()

namespace Json
{
	using CharReaderPtr = std::unique_ptr<CharReader>;

	class OurFeatures {
	public:
		static OurFeatures all();
		bool allowComments_;
		bool allowTrailingCommas_;
		bool strictRoot_;
		bool allowDroppedNullPlaceholders_;
		bool allowNumericKeys_;
		bool allowSingleQuotes_;
		bool failIfExtra_;
		bool rejectDupKeys_;
		bool allowSpecialFloats_;
		bool skipBom_;
		size_t stackLimit_;
	}; // OurFeatures

	OurFeatures OurFeatures::all() {
		return {};
	}

	// Implementation of class Reader
	// ////////////////////////////////

	class OurReader {
	public:
		using Char = char;
		using Location = const Char*;

		explicit OurReader(OurFeatures const& features);
		bool parse(const char* beginDoc, const char* endDoc, Value& root,
				   bool collectComments = true);
		StringContainer getFormattedErrorMessages() const;
		std::vector<CharReader::StructuredError> getStructuredErrors() const;

	private:
		OurReader(OurReader const&);      // no impl
		void operator=(OurReader const&); // no impl

		enum TokenType {
			tokenEndOfStream = 0,
			tokenObjectBegin,
			tokenObjectEnd,
			tokenArrayBegin,
			tokenArrayEnd,
			tokenString,
			tokenNumber,
			tokenTrue,
			tokenFalse,
			tokenNull,
			tokenNaN,
			tokenPosInf,
			tokenNegInf,
			tokenArraySeparator,
			tokenMemberSeparator,
			tokenComment,
			tokenError
		};

		class Token {
		public:
			TokenType type_;
			Location start_;
			Location end_;
		};

		class ErrorInfo {
		public:
			Token token_;
			StringContainer message_;
			Location extra_;
		};

		using Errors = std::deque<ErrorInfo>;

		bool readToken(Token& token);
		bool readTokenSkippingComments(Token& token);
		void skipSpaces();
		void skipBom(bool skipBom);
		bool match(const Char* pattern, int patternLength);
		bool readComment();
		bool readCStyleComment(bool* containsNewLineResult);
		bool readCppStyleComment();
		bool readString();
		bool readStringSingleQuote();
		bool readNumber(bool checkInf);
		bool readValue();
		bool readObject(Token& token);
		bool readArray(Token& token);
		bool decodeNumber(Token& token);
		bool decodeNumber(Token& token, Value& decoded);
		bool decodeString(Token& token);
		bool decodeString(Token& token, StringContainer& decoded);
		bool decodeDouble(Token& token);
		bool decodeDouble(Token& token, Value& decoded);
		bool decodeUnicodeCodePoint(Token& token, Location& current, Location end, unsigned int& unicode);
		bool decodeUnicodeEscapeSequence(Token& token, Location& current, Location end, unsigned int& unicode);
		bool addError(const StringContainer& message, Token& token, Location extra = nullptr);
		bool recoverFromError(TokenType skipUntilToken);
		bool addErrorAndRecover(const StringContainer& message, Token& token, TokenType skipUntilToken);
		Value& currentValue();
		Char getNextChar();
		void getLocationLineAndColumn(Location location, int& line, int& column) const;
		StringContainer getLocationLineAndColumn(Location location) const;
		void addComment(Location begin, Location end, CommentPlacement placement);

		static StringContainer normalizeEOL(Location begin, Location end);
		static bool containsNewLine(Location begin, Location end);

		using Nodes = std::stack<Value*>;

		Nodes nodes_{};
		Errors errors_{};
		StringContainer document_{};
		Location begin_ = nullptr;
		Location end_ = nullptr;
		Location current_ = nullptr;
		Location lastValueEnd_ = nullptr;
		Value* lastValue_ = nullptr;
		bool lastValueHasAComment_ = false;
		StringContainer commentsBefore_{};

		OurFeatures const features_;
		bool collectComments_ = false;
	}; // OurReader

	// complete copy of Read impl, for OurReader

	bool OurReader::containsNewLine(OurReader::Location begin, OurReader::Location end) {
		return std::any_of(begin, end, [](char b) { return b == '\n' || b == '\r'; });
	}

	OurReader::OurReader(OurFeatures const& features)
		: features_(features) {}

	bool OurReader::parse(const char* beginDoc, const char* endDoc, Value& root, bool collectComments) {
		if (!features_.allowComments_) {
			collectComments = false;
		}

		begin_ = beginDoc;
		end_ = endDoc;
		collectComments_ = collectComments;
		current_ = begin_;
		lastValueEnd_ = nullptr;
		lastValue_ = nullptr;
		commentsBefore_.clear();
		errors_.clear();
		while (!nodes_.empty())
			nodes_.pop();
		nodes_.push(&root);

		// skip byte order mark if it exists at the beginning of the UTF-8 text.
		skipBom(features_.skipBom_);
		bool successful = readValue();
		nodes_.pop();
		Token token;
		readTokenSkippingComments(token);
		if (features_.failIfExtra_ && (token.type_ != tokenEndOfStream)) {
			addError("Extra non-whitespace after JSON value.", token);
			return false;
		}
		if (collectComments_ && !commentsBefore_.empty())
			root.setComment(commentsBefore_, commentAfter);
		if (features_.strictRoot_) {
			if (!root.isArray() && !root.isObject()) {
				// Set error location to start of doc, ideally should be first token found
				// in doc
				token.type_ = tokenError;
				token.start_ = beginDoc;
				token.end_ = endDoc;
				addError("A valid JSON document must be either an array or an object value.", token);
				return false;
			}
		}
		return successful;
	}

	bool OurReader::readValue() {
		//  To preserve the old behaviour we cast size_t to int.
		if (nodes_.size() > features_.stackLimit_)
			throwRuntimeError("Exceeded stackLimit in readValue().");
		Token token;
		readTokenSkippingComments(token);
		bool successful = true;

		if (collectComments_ && !commentsBefore_.empty()) {
			currentValue().setComment(commentsBefore_, commentBefore);
			commentsBefore_.clear();
		}

		switch (token.type_) {
			case tokenObjectBegin:
				successful = readObject(token);
				currentValue().setOffsetLimit(current_ - begin_);
				break;
			case tokenArrayBegin:
				successful = readArray(token);
				currentValue().setOffsetLimit(current_ - begin_);
				break;
			case tokenNumber:
				successful = decodeNumber(token);
				break;
			case tokenString:
				successful = decodeString(token);
				break;
			case tokenTrue: {
				Value v(true);
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenFalse: {
				Value v(false);
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenNull: {
				Value v;
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenNaN: {
				Value v(std::numeric_limits<double>::quiet_NaN());
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenPosInf: {
				Value v(std::numeric_limits<double>::infinity());
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenNegInf: {
				Value v(-std::numeric_limits<double>::infinity());
				currentValue().swapPayload(v);
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
			} break;
			case tokenArraySeparator:
			case tokenObjectEnd:
			case tokenArrayEnd:
				if (features_.allowDroppedNullPlaceholders_) {
					// "Un-read" the current token and mark the current value as a null
					// token.
					current_--;
					Value v;
					currentValue().swapPayload(v);
					currentValue().setOffsetStart(current_ - begin_ - 1);
					currentValue().setOffsetLimit(current_ - begin_);
					break;
				} // else, fall through ...
			default:
				currentValue().setOffsetStart(token.start_ - begin_);
				currentValue().setOffsetLimit(token.end_ - begin_);
				return addError("Syntax error: value, object or array expected.", token);
		}

		if (collectComments_) {
			lastValueEnd_ = current_;
			lastValueHasAComment_ = false;
			lastValue_ = &currentValue();
		}

		return successful;
	}

	bool OurReader::readTokenSkippingComments(Token& token) {
		bool success = readToken(token);
		if (features_.allowComments_) {
			while (success && token.type_ == tokenComment) {
				success = readToken(token);
			}
		}
		return success;
	}

	bool OurReader::readToken(Token& token) {
		skipSpaces();
		token.start_ = current_;
		Char c = getNextChar();
		bool ok = true;
		switch (c) {
			case '{':
				token.type_ = tokenObjectBegin;
				break;
			case '}':
				token.type_ = tokenObjectEnd;
				break;
			case '[':
				token.type_ = tokenArrayBegin;
				break;
			case ']':
				token.type_ = tokenArrayEnd;
				break;
			case '"':
				token.type_ = tokenString;
				ok = readString();
				break;
			case '\'':
				if (features_.allowSingleQuotes_) {
					token.type_ = tokenString;
					ok = readStringSingleQuote();
				} else {
					// If we don't allow single quotes, this is a failure case.
					ok = false;
				}
				break;
			case '/':
				token.type_ = tokenComment;
				ok = readComment();
				break;
			case '0':
			case '1':
			case '2':
			case '3':
			case '4':
			case '5':
			case '6':
			case '7':
			case '8':
			case '9':
				token.type_ = tokenNumber;
				readNumber(false);
				break;
			case '-':
				if (readNumber(true)) {
					token.type_ = tokenNumber;
				} else {
					token.type_ = tokenNegInf;
					ok = features_.allowSpecialFloats_ && match("nfinity", 7);
				}
				break;
			case '+':
				if (readNumber(true)) {
					token.type_ = tokenNumber;
				} else {
					token.type_ = tokenPosInf;
					ok = features_.allowSpecialFloats_ && match("nfinity", 7);
				}
				break;
			case 't':
				token.type_ = tokenTrue;
				ok = match("rue", 3);
				break;
			case 'f':
				token.type_ = tokenFalse;
				ok = match("alse", 4);
				break;
			case 'n':
				token.type_ = tokenNull;
				ok = match("ull", 3);
				break;
			case 'N':
				if (features_.allowSpecialFloats_) {
					token.type_ = tokenNaN;
					ok = match("aN", 2);
				} else {
					ok = false;
				}
				break;
			case 'I':
				if (features_.allowSpecialFloats_) {
					token.type_ = tokenPosInf;
					ok = match("nfinity", 7);
				} else {
					ok = false;
				}
				break;
			case ',':
				token.type_ = tokenArraySeparator;
				break;
			case ':':
				token.type_ = tokenMemberSeparator;
				break;
			case 0:
				token.type_ = tokenEndOfStream;
				break;
			default:
				ok = false;
				break;
		}
		if (!ok)
			token.type_ = tokenError;
		token.end_ = current_;
		return ok;
	}

	void OurReader::skipSpaces() {
		std::int32_t newLineCount = 0;
		while (current_ != end_) {
			Char c = *current_;
			if (c == '\r' || c == '\n') {
				++newLineCount;
				++current_;
				if (*current_ == '\n') {
					++current_;
				}
			} else if (c == ' ' || c == '\t') {
				++current_;
			} else {
				break;
			}
		}

		if (newLineCount > 1) {
			commentsBefore_.append(newLineCount - 1, '\n');
		}
	}

	void OurReader::skipBom(bool skipBom) {
		// The default behavior is to skip BOM.
		if (skipBom) {
			if ((end_ - begin_) >= 3 && strncmp(begin_, "\xEF\xBB\xBF", 3) == 0) {
				begin_ += 3;
				current_ = begin_;
			}
		}
	}

	bool OurReader::match(const Char* pattern, int patternLength) {
		if (end_ - current_ < patternLength)
			return false;
		int index = patternLength;
		while (index--)
			if (current_[index] != pattern[index])
				return false;
		current_ += patternLength;
		return true;
	}

	bool OurReader::readComment() {
		const Location commentBegin = current_ - 1;
		const Char c = getNextChar();
		bool successful = false;
		bool cStyleWithEmbeddedNewline = false;

		const bool isCStyleComment = (c == '*');
		const bool isCppStyleComment = (c == '/');
		if (isCStyleComment) {
			successful = readCStyleComment(&cStyleWithEmbeddedNewline);
		} else if (isCppStyleComment) {
			successful = readCppStyleComment();
		}

		if (!successful)
			return false;

		if (collectComments_) {
			CommentPlacement placement = commentBefore;

			if (!lastValueHasAComment_) {
				if (lastValueEnd_ && !containsNewLine(lastValueEnd_, commentBegin)) {
					if (isCppStyleComment || !cStyleWithEmbeddedNewline) {
						placement = commentAfterOnSameLine;
						lastValueHasAComment_ = true;
					}
				}
			}

			addComment(commentBegin, current_, placement);
		}
		return true;
	}

	StringContainer OurReader::normalizeEOL(OurReader::Location begin,
								   OurReader::Location end) {
		StringContainer normalized;
		normalized.reserve(static_cast<size_t>(end - begin));
		OurReader::Location current = begin;
		while (current != end) {
			char c = *current++;
			if (c == '\r') {
				if (current != end && *current == '\n') {
					// convert dos EOL
					++current;
				}
				// convert Mac EOL
				normalized += '\n';
			} else {
				normalized += c;
			}
		}
		return normalized;
	}

	void OurReader::addComment(Location begin, Location end, CommentPlacement placement) {
		assert(collectComments_);
		auto normalized = normalizeEOL(begin, end);
		if (placement == commentAfterOnSameLine) {
			assert(lastValue_ != nullptr);
			lastValue_->setComment(normalized, placement);
		} else {
			commentsBefore_ += normalized;
		}
	}

	bool OurReader::readCStyleComment(bool* containsNewLineResult) {
		*containsNewLineResult = false;

		while ((current_ + 1) < end_) {
			Char c = getNextChar();
			if (c == '*' && *current_ == '/') {
				break;
			}
			if (c == '\n') {
				*containsNewLineResult = true;
			}
		}

		bool success = (getNextChar() == '/');

		Location current = current_;
		while (current != end_) {
			Char c = *current;
			if (c == ' ' || c == '\t' || c == '\r' || c == '\n') {
				++current;
			} else {
				break;
			}
		}

		if (current + 1 < end_ && *current == '/' && (*(current + 1) == '*' || *(current + 1) == '/')) {
			current_ = current;
		}

		return success;
	}

	bool OurReader::readCppStyleComment() {
		while (current_ != end_) {
			Char c = getNextChar();
			if (c == '\n')
				break;
			if (c == '\r') {
				// Consume DOS EOL. It will be normalized in addComment.
				if (current_ != end_ && *current_ == '\n') {
					getNextChar();
				}
				// Break on Moc OS 9 EOL.
				break;
			}
		}

		Location current = current_;
		while (current != end_) {
			Char c = *current;
			if (c == ' ' || c == '\t' || c == '\r' || c == '\n') {
				++current;
			} else {
				break;
			}
		}

		if (current + 1 < end_ && *current == '/' && (*(current + 1) == '*' || *(current + 1) == '/')) {
			current_ = current;
		}

		return true;
	}

	bool OurReader::readNumber(bool checkInf) {
		Location p = current_;
		if (checkInf && p != end_ && *p == 'I') {
			current_ = ++p;
			return false;
		}
		char c = '0'; // stopgap for already consumed character
		// integral part
		while (c >= '0' && c <= '9') {
			c = (current_ = p) < end_ ? *p++ : '\0';
		}
		// fractional part
		if (c == '.') {
			c = (current_ = p) < end_ ? *p++ : '\0';
			while (c >= '0' && c <= '9') {
				c = (current_ = p) < end_ ? *p++ : '\0';
			}
		}
		// exponential part
		if (c == 'e' || c == 'E') {
			c = (current_ = p) < end_ ? *p++ : '\0';
			if (c == '+' || c == '-') {
				c = (current_ = p) < end_ ? *p++ : '\0';
			}
			while (c >= '0' && c <= '9') {
				c = (current_ = p) < end_ ? *p++ : '\0';
			}
		}
		return true;
	}
	bool OurReader::readString() {
		Char c = 0;
		while (current_ != end_) {
			c = getNextChar();
			if (c == '\\') {
				getNextChar();
			}
			else if (c == '"') {
				break;
			}
		}
		return c == '"';
	}

	bool OurReader::readStringSingleQuote() {
		Char c = 0;
		while (current_ != end_) {
			c = getNextChar();
			if (c == '\\') {
				getNextChar();
			}
			else if (c == '\'') {
				break;
			}
		}
		return c == '\'';
	}

	bool OurReader::readObject(Token& token) {
		Token tokenName;
		StringContainer name;
		Value init(objectValue);
		currentValue().swapPayload(init);
		currentValue().setOffsetStart(token.start_ - begin_);
		while (readTokenSkippingComments(tokenName)) {
			if (tokenName.type_ == tokenObjectEnd && (name.empty() || features_.allowTrailingCommas_)) { // empty object or trailing comma
				return true;
			}
			name.clear();
			if (tokenName.type_ == tokenString) {
				if (!decodeString(tokenName, name))
					return recoverFromError(tokenObjectEnd);
			} else if (tokenName.type_ == tokenNumber && features_.allowNumericKeys_) {
				Value numberName;
				if (!decodeNumber(tokenName, numberName))
					return recoverFromError(tokenObjectEnd);
				name = numberName.asString();
			} else {
				break;
			}
			if (name.length() >= (1U << 30))
				throwRuntimeError("keylength >= 2^30");
			if (features_.rejectDupKeys_ && currentValue().isMember(name)) {
				StringContainer msg = "Duplicate key: '" + name + "'";
				return addErrorAndRecover(msg, tokenName, tokenObjectEnd);
			}

			Token colon;
			if (!readToken(colon) || colon.type_ != tokenMemberSeparator) {
				return addErrorAndRecover("Missing ':' after object member name", colon, tokenObjectEnd);
			}
			Value& value = currentValue()[name];
			nodes_.push(&value);
			bool ok = readValue();
			nodes_.pop();
			if (!ok) { // error already set
				return recoverFromError(tokenObjectEnd);
			}

			Token comma;
			if (!readTokenSkippingComments(comma) ||
				(comma.type_ != tokenObjectEnd && comma.type_ != tokenArraySeparator)) {
				return addErrorAndRecover("Missing ',' or '}' in object declaration",
										  comma, tokenObjectEnd);
			}
			if (comma.type_ == tokenObjectEnd)
				return true;
		}
		return addErrorAndRecover("Missing '}' or object member name", tokenName,
								  tokenObjectEnd);
	}

	bool OurReader::readArray(Token& token) {
		Value init(arrayValue);
		currentValue().swapPayload(init);
		currentValue().setOffsetStart(token.start_ - begin_);
		int index = 0;
		for (;;) {
			skipSpaces();
			if (current_ != end_ && *current_ == ']' &&
				(index == 0 ||
					(features_.allowTrailingCommas_ &&
						!features_.allowDroppedNullPlaceholders_))) // empty array or trailing
				// comma
			{
				Token endArray;
				readToken(endArray);
				return true;
			}
			Value& value = currentValue()[index++];
			nodes_.push(&value);
			bool ok = readValue();
			nodes_.pop();
			if (!ok) // error already set
				return recoverFromError(tokenArrayEnd);

			Token currentToken;
			// Accept Comment after last item in the array.
			ok = readTokenSkippingComments(currentToken);
			bool badTokenType = (currentToken.type_ != tokenArraySeparator &&
								 currentToken.type_ != tokenArrayEnd);
			if (!ok || badTokenType) {
				return addErrorAndRecover("Missing ',' or ']' in array declaration",
										  currentToken, tokenArrayEnd);
			}
			if (currentToken.type_ == tokenArrayEnd)
				break;
		}
		return true;
	}

	bool OurReader::decodeNumber(Token& token) {
		Value decoded;
		if (!decodeNumber(token, decoded))
			return false;
		currentValue().swapPayload(decoded);
		currentValue().setOffsetStart(token.start_ - begin_);
		currentValue().setOffsetLimit(token.end_ - begin_);
		return true;
	}

	bool OurReader::decodeNumber(Token& token, Value& decoded) {
		// Attempts to parse the number as an integer. If the number is
		// larger than the maximum supported value of an integer then
		// we decode the number as a double.
		Location current = token.start_;
		const bool isNegative = *current == '-';
		if (isNegative) {
			++current;
		}

		// We assume we can represent the largest and smallest integer types as
		// unsigned integers with separate sign. This is only true if they can fit
		// into an unsigned integer.
		static_assert(Value::maxLargestInt <= Value::maxLargestUInt,
					  "Int must be smaller than UInt");

		// We need to convert minLargestInt into a positive number. The easiest way
		// to do this conversion is to assume our "threshold" value of minLargestInt
		// divided by 10 can fit in maxLargestInt when absolute valued. This should
		// be a safe assumption.
		static_assert(Value::minLargestInt <= -Value::maxLargestInt,
					  "The absolute value of minLargestInt must be greater than or "
					  "equal to maxLargestInt");
		static_assert(Value::minLargestInt / 10 >= -Value::maxLargestInt,
					  "The absolute value of minLargestInt must be only 1 magnitude "
					  "larger than maxLargest Int");

		static constexpr Value::LargestUInt positive_threshold = Value::maxLargestUInt / 10;
		static constexpr Value::UInt positive_last_digit = Value::maxLargestUInt % 10;

		// For the negative values, we have to be more careful. Since typically
		// -Value::minLargestInt will cause an overflow, we first divide by 10 and
		// then take the inverse. This assumes that minLargestInt is only a single
		// power of 10 different in magnitude, which we check above. For the last
		// digit, we take the modulus before negating for the same reason.
		static constexpr auto negative_threshold =
			Value::LargestUInt(-(Value::minLargestInt / 10));
		static constexpr auto negative_last_digit =
			Value::UInt(-(Value::minLargestInt % 10));

		const Value::LargestUInt threshold = (isNegative ? negative_threshold : positive_threshold);
		const Value::UInt max_last_digit = (isNegative ? negative_last_digit : positive_last_digit);

		Value::LargestUInt value = 0;
		while (current < token.end_) {
			Char c = *current++;
			if (c < '0' || c > '9')
				return decodeDouble(token, decoded);

			const auto digit(static_cast<Value::UInt>(c - '0'));
			if (value >= threshold) {
				// We've hit or exceeded the max value divided by 10 (rounded down). If
				// a) we've only just touched the limit, meaning value == threshold,
				// b) this is the last digit, or
				// c) it's small enough to fit in that rounding delta, we're okay.
				// Otherwise treat this number as a double to avoid overflow.
				if (value > threshold || current != token.end_ ||
					digit > max_last_digit) {
					return decodeDouble(token, decoded);
				}
			}
			value = value * 10 + digit;
		}

		if (isNegative) {
			// We use the same magnitude assumption here, just in case.
			const auto last_digit = static_cast<Value::UInt>(value % 10);
			decoded = -Value::LargestInt(value / 10) * 10 - last_digit;
		} else if (value <= Value::LargestUInt(Value::maxLargestInt)) {
			decoded = Value::LargestInt(value);
		} else {
			decoded = value;
		}

		return true;
	}

	bool OurReader::decodeDouble(Token& token) {
		Value decoded;
		if (!decodeDouble(token, decoded))
			return false;
		currentValue().swapPayload(decoded);
		currentValue().setOffsetStart(token.start_ - begin_);
		currentValue().setOffsetLimit(token.end_ - begin_);
		return true;
	}

	bool OurReader::decodeDouble(Token& token, Value& decoded) {
		double value = 0;
		IStringStream is(StringContainer(token.start_, token.end_));
		if (!(is >> value)) {
			if (value == std::numeric_limits<double>::max())
				value = std::numeric_limits<double>::infinity();
			else if (value == std::numeric_limits<double>::lowest())
				value = -std::numeric_limits<double>::infinity();
			else if (!std::isinf(value))
				return addError("'" + StringContainer(token.start_, token.end_) + "' is not a number.", token);
		}
		decoded = value;
		return true;
	}

	bool OurReader::decodeString(Token& token) {
		StringContainer decoded_string;
		if (!decodeString(token, decoded_string))
			return false;
		Value decoded(decoded_string);
		currentValue().swapPayload(decoded);
		currentValue().setOffsetStart(token.start_ - begin_);
		currentValue().setOffsetLimit(token.end_ - begin_);
		return true;
	}

	bool OurReader::decodeString(Token& token, StringContainer& decoded) {
		decoded.reserve(static_cast<size_t>(token.end_ - token.start_ - 2));
		Location current = token.start_ + 1; // skip '"'
		Location end = token.end_ - 1;       // do not include '"'
		while (current != end) {
			Char c = *current++;
			if (c == '"')
				break;
			if (c == '\\') {
				if (current == end)
					return addError("Empty escape sequence in string", token, current);
				Char escape = *current++;
				switch (escape) {
					case '"':
						decoded += '"';
						break;
					case '/':
						decoded += '/';
						break;
					case '\\':
						decoded += '\\';
						break;
					case 'b':
						decoded += '\b';
						break;
					case 'f':
						decoded += '\f';
						break;
					case 'n':
						decoded += '\n';
						break;
					case 'r':
						decoded += '\r';
						break;
					case 't':
						decoded += '\t';
						break;
					case 'u': {
						unsigned int unicode;
						if (!decodeUnicodeCodePoint(token, current, end, unicode))
							return false;
						decoded += codePointToUTF8(unicode);
						break;
					}
					default:
						return addError("Bad escape sequence in string", token, current);
				}
			} else {
				decoded += c;
			}
		}
		return true;
	}

	bool OurReader::decodeUnicodeCodePoint(Token& token, Location& current, Location end, unsigned int& unicode) {

		if (!decodeUnicodeEscapeSequence(token, current, end, unicode))
			return false;
		if (unicode >= 0xD800 && unicode <= 0xDBFF) {
			// surrogate pairs
			if (end - current < 6)
				return addError(
					"additional six characters expected to parse unicode surrogate pair.",
					token, current);
			if (*(current++) == '\\' && *(current++) == 'u') {
				unsigned int surrogatePair;
				if (decodeUnicodeEscapeSequence(token, current, end, surrogatePair)) {
					unicode = 0x10000 + ((unicode & 0x3FF) << 10) + (surrogatePair & 0x3FF);
				} else {
					return false;
				}
			} else
				return addError("expecting another \\u token to begin the second half of a unicode surrogate pair",
								token, current);
		}
		return true;
	}

	bool OurReader::decodeUnicodeEscapeSequence(Token& token, Location& current, Location end, unsigned int& ret_unicode) {
		if (end - current < 4)
			return addError("Bad unicode escape sequence in string: four digits expected.", token, current);
		int unicode = 0;
		for (int index = 0; index < 4; ++index) {
			Char c = *current++;
			unicode *= 16;
			if (c >= '0' && c <= '9')
				unicode += c - '0';
			else if (c >= 'a' && c <= 'f')
				unicode += c - 'a' + 10;
			else if (c >= 'A' && c <= 'F')
				unicode += c - 'A' + 10;
			else
				return addError(
					"Bad unicode escape sequence in string: hexadecimal digit expected.",
					token, current);
		}
		ret_unicode = static_cast<unsigned int>(unicode);
		return true;
	}

	bool OurReader::addError(const StringContainer& message, Token& token, Location extra) {
		ErrorInfo info;
		info.token_ = token;
		info.message_ = message;
		info.extra_ = extra;
		errors_.push_back(info);
		return false;
	}

	bool OurReader::recoverFromError(TokenType skipUntilToken) {
		size_t errorCount = errors_.size();
		Token skip;
		for (;;) {
			if (!readToken(skip))
				errors_.resize(errorCount); // discard errors caused by recovery
			if (skip.type_ == skipUntilToken || skip.type_ == tokenEndOfStream)
				break;
		}
		errors_.resize(errorCount);
		return false;
	}

	bool OurReader::addErrorAndRecover(const StringContainer& message, Token& token, TokenType skipUntilToken) {
		addError(message, token);
		return recoverFromError(skipUntilToken);
	}

	Value& OurReader::currentValue() {
		return *(nodes_.top());
	}

	OurReader::Char OurReader::getNextChar() {
		if (current_ == end_)
			return 0;
		return *current_++;
	}

	void OurReader::getLocationLineAndColumn(Location location, int& line, int& column) const {
		Location current = begin_;
		Location lastLineStart = current;
		line = 0;
		while (current < location && current != end_) {
			Char c = *current++;
			if (c == '\r') {
				if (current != end_ && *current == '\n')
					++current;
				lastLineStart = current;
				++line;
			} else if (c == '\n') {
				lastLineStart = current;
				++line;
			}
		}
		// column & line start at 1
		column = int(location - lastLineStart) + 1;
		++line;
	}

	StringContainer OurReader::getLocationLineAndColumn(Location location) const {
		int line, column;
		getLocationLineAndColumn(location, line, column);
		char buffer[18 + 16 + 16 + 1];
		jsoncpp_snprintf(buffer, sizeof(buffer), "Line %d, Column %d", line, column);
		return buffer;
	}

	StringContainer OurReader::getFormattedErrorMessages() const {
		StringContainer formattedMessage;
		for (const auto& error : errors_) {
			formattedMessage += "* " + getLocationLineAndColumn(error.token_.start_) + "\n";
			formattedMessage += "  " + error.message_ + "\n";
			if (error.extra_)
				formattedMessage +=
				"See " + getLocationLineAndColumn(error.extra_) + " for detail.\n";
		}
		return formattedMessage;
	}

	std::vector<CharReader::StructuredError>
		OurReader::getStructuredErrors() const {
		std::vector<CharReader::StructuredError> allErrors;
		for (const auto& error : errors_) {
			CharReader::StructuredError structured;
			structured.offset_start = error.token_.start_ - begin_;
			structured.offset_limit = error.token_.end_ - begin_;
			structured.message = error.message_;
			allErrors.push_back(structured);
		}
		return allErrors;
	}

	class OurCharReader : public CharReader {
	public:
		OurCharReader(bool collectComments, OurFeatures const& features)
			: CharReader(std::unique_ptr<OurImpl>(new OurImpl(collectComments, features))) {
		}

	protected:
		class OurImpl : public Impl {
		public:
			OurImpl(bool collectComments, OurFeatures const& features)
				: collectComments_(collectComments), reader_(features) {
			}

			bool parse(char const* beginDoc, char const* endDoc, Value* root, StringContainer* errs) override {
				bool ok = reader_.parse(beginDoc, endDoc, *root, collectComments_);
				if (errs) {
					*errs = reader_.getFormattedErrorMessages();
				}
				return ok;
			}

			std::vector<CharReader::StructuredError>
				getStructuredErrors() const override {
				return reader_.getStructuredErrors();
			}

		private:
			bool const collectComments_;
			OurReader reader_;
		};
	};

	CharReaderBuilder::CharReaderBuilder() {
		setDefaults(&settings_);
	}
	CharReaderBuilder::~CharReaderBuilder() = default;
	CharReader* CharReaderBuilder::newCharReader() const {
		bool collectComments = settings_["collectComments"].asBool();
		OurFeatures features = OurFeatures::all();
		features.allowComments_ = settings_["allowComments"].asBool();
		features.allowTrailingCommas_ = settings_["allowTrailingCommas"].asBool();
		features.strictRoot_ = settings_["strictRoot"].asBool();
		features.allowDroppedNullPlaceholders_ =
			settings_["allowDroppedNullPlaceholders"].asBool();
		features.allowNumericKeys_ = settings_["allowNumericKeys"].asBool();
		features.allowSingleQuotes_ = settings_["allowSingleQuotes"].asBool();

		// Stack limit is always a size_t, so we get this as an unsigned int
		// regardless of it we have 64-bit integer support enabled.
		features.stackLimit_ = static_cast<size_t>(settings_["stackLimit"].asUInt());
		features.failIfExtra_ = settings_["failIfExtra"].asBool();
		features.rejectDupKeys_ = settings_["rejectDupKeys"].asBool();
		features.allowSpecialFloats_ = settings_["allowSpecialFloats"].asBool();
		features.skipBom_ = settings_["skipBom"].asBool();
		return new OurCharReader(collectComments, features);
	}

	bool CharReaderBuilder::validate(Json::Value* invalid) const {
#ifdef JSONCPP_HAS_STRING_VIEW
		static const auto& valid_keys = *new std::set<std::string_view>
#else
		static const auto & valid_keys = *new std::set<StringContainer>
#endif
		{
		   "collectComments",
		   "allowComments",
		   "allowTrailingCommas",
		   "strictRoot",
		   "allowDroppedNullPlaceholders",
		   "allowNumericKeys",
		   "allowSingleQuotes",
		   "stackLimit",
		   "failIfExtra",
		   "rejectDupKeys",
		   "allowSpecialFloats",
		   "skipBom",
		};
		for (auto si = settings_.begin(); si != settings_.end(); ++si) {
			auto key = si.name();
			if (valid_keys.count(key))
				continue;
			if (invalid)
				(*invalid)[key] = *si;
			else
				return false;
		}
		return invalid ? invalid->empty() : true;
	}

	Value& CharReaderBuilder::operator[](const StringContainer& key) {
		return settings_[key];
	}
	// static
	void CharReaderBuilder::strictMode(Json::Value* settings) {
		//! [CharReaderBuilderStrictMode]
		(*settings)["allowComments"] = false;
		(*settings)["allowTrailingCommas"] = false;
		(*settings)["strictRoot"] = true;
		(*settings)["allowDroppedNullPlaceholders"] = false;
		(*settings)["allowNumericKeys"] = false;
		(*settings)["allowSingleQuotes"] = false;
		(*settings)["stackLimit"] = 1000;
		(*settings)["failIfExtra"] = true;
		(*settings)["rejectDupKeys"] = true;
		(*settings)["allowSpecialFloats"] = false;
		(*settings)["skipBom"] = true;
		//! [CharReaderBuilderStrictMode]
	}
	// static
	void CharReaderBuilder::setDefaults(Json::Value* settings) {
		//! [CharReaderBuilderDefaults]
		(*settings)["collectComments"] = true;
		(*settings)["allowComments"] = true;
		(*settings)["allowTrailingCommas"] = true;
		(*settings)["strictRoot"] = false;
		(*settings)["allowDroppedNullPlaceholders"] = false;
		(*settings)["allowNumericKeys"] = false;
		(*settings)["allowSingleQuotes"] = false;
		(*settings)["stackLimit"] = 1000;
		(*settings)["failIfExtra"] = true;
		(*settings)["rejectDupKeys"] = false;
		(*settings)["allowSpecialFloats"] = false;
		(*settings)["skipBom"] = true;
		//! [CharReaderBuilderDefaults]
	}
	// static
	void CharReaderBuilder::ecma404Mode(Json::Value* settings) {
		//! [CharReaderBuilderECMA404Mode]
		(*settings)["allowComments"] = false;
		(*settings)["allowTrailingCommas"] = false;
		(*settings)["strictRoot"] = false;
		(*settings)["allowDroppedNullPlaceholders"] = false;
		(*settings)["allowNumericKeys"] = false;
		(*settings)["allowSingleQuotes"] = false;
		(*settings)["stackLimit"] = 1000;
		(*settings)["failIfExtra"] = true;
		(*settings)["rejectDupKeys"] = false;
		(*settings)["allowSpecialFloats"] = false;
		(*settings)["skipBom"] = false;
		//! [CharReaderBuilderECMA404Mode]
	}

	std::vector<CharReader::StructuredError> CharReader::getStructuredErrors() const {
		return _impl->getStructuredErrors();
	}

	bool CharReader::parse(char const* beginDoc, char const* endDoc, Value* root, StringContainer* errs) {
		return _impl->parse(beginDoc, endDoc, root, errs);
	}

} // namespace Json