size/iterator
| 88 | |
| 89 | // size/iterator |
| 90 | std::size_t node_data::size() const { |
| 91 | if (!m_isDefined) |
| 92 | return 0; |
| 93 | |
| 94 | switch (m_type) { |
| 95 | case NodeType::Sequence: |
| 96 | compute_seq_size(); |
| 97 | return m_seqSize; |
| 98 | case NodeType::Map: |
| 99 | compute_map_size(); |
| 100 | return m_map.size() - m_undefinedPairs.size(); |
| 101 | default: |
| 102 | return 0; |
| 103 | } |
| 104 | return 0; |
| 105 | } |
| 106 | |
| 107 | void node_data::compute_seq_size() const { |
| 108 | while (m_seqSize < m_sequence.size() && m_sequence[m_seqSize]->is_defined()) |
no outgoing calls
no test coverage detected