Skip to content

Commit a058969

Browse files
committed
doco changes
1 parent 8587825 commit a058969

File tree

2 files changed

+4
-3
lines changed

2 files changed

+4
-3
lines changed

lib/jtc_guide.hpp

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -185,6 +185,7 @@ std::string GuideJtc::jtc_examples_{R"(
185185
* Some examples and explanations:
186186
* - for a complete user guide visit:
187187
* https://github.com/ldn-softdev/jtc/blob/master/User%20Guide.md
188+
* hint: use -ddd (verbose debugging) to better understand these examples
188189
189190
Consider following source JSON (stored in the file example.json):
190191
{

lib/wp_guide.hpp

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,11 +115,11 @@ a. Subscript lexemes: enclosed into square braces '[', ']', their meaning depend
115115
116116
b. search lexemes: enclosed into angular braces '<', '>', instruct to perform a recursive (or a
117117
non-recursive) search under a given JSON tree point; following notation forms are possible:
118-
'<txt>', '<txt>S', '<txt>N', '<txt>SN'
118+
'<>', '<txt>', '<txt>S', '<txt>N', '<txt>SN'
119119
and the respective non-recursive search lexeme forms:
120120
'>txt<', '>txt<S', '>txt<N', '>txt<SN'
121-
where txt - is any text to search for, S - is an optional one letter suffix, N - is an optional
122-
quantifier, which comes in several variants
121+
where txt - is any text to search for (or '<>' match anything), S - is an optional one
122+
letter suffix, N - is an optional quantifier, which comes in several variants
123123
- if a lexeme is given using '<..>' encasement, then a *recursive* search applied off the
124124
current JSON node, otherwise (i.e. '>..<' encasement given) - a *non-recursive* search is
125125
performed among immediate JSON node's children only

0 commit comments

Comments
 (0)