| 62 | } |
| 63 | |
| 64 | bool RapidJsonHandler::String(const Ch* str, unsigned /*length*/, bool /*copy*/) |
| 65 | { |
| 66 | if (!str) |
| 67 | return false; |
| 68 | |
| 69 | // handle case, when there is only a value in input |
| 70 | if (m_NodeStack.empty()) |
| 71 | { |
| 72 | m_pTreeHandler->InsertToTree(m_treeRoot, str); |
| 73 | return true; |
| 74 | } |
| 75 | |
| 76 | TreeNode* parent = m_NodeStack.top(); |
| 77 | InsertToTree(parent, str, true); |
| 78 | |
| 79 | return true; |
| 80 | } |
| 81 | |
| 82 | bool RapidJsonHandler::Key(const Ch* str, unsigned length, bool /*copy*/) |
| 83 | { |
nothing calls this directly
no test coverage detected