50   explicit MapEntry(ValueObjectSP entry_sp) : m_entry_sp(entry_sp) {}  in MapEntry()
52       : m_entry_sp(entry ? entry->GetSP() : ValueObjectSP()) {}  in MapEntry()
54   ValueObjectSP left() const {  in left()
61   ValueObjectSP right() const {  in right()
69   ValueObjectSP parent() const {  in parent()
91   ValueObjectSP GetEntry() const { return m_entry_sp; }  in GetEntry()
93   void SetEntry(ValueObjectSP entry) { m_entry_sp = entry; }  in SetEntry()
100   ValueObjectSP m_entry_sp;
110   ValueObjectSP value() { return m_entry.GetEntry(); }  in value()
112   ValueObjectSP advance(size_t count) {  in advance()
113     ValueObjectSP fail;  in advance()
190   LibcxxStdMapSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
196   lldb::ValueObjectSP GetChildAtIndex(uint32_t idx) override;
219   ValueObjectSP GetKeyValuePair(size_t idx, size_t max_depth);
230   LibCxxMapIteratorSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
234   lldb::ValueObjectSP GetChildAtIndex(uint32_t idx) override;
245   ValueObjectSP m_pair_sp = nullptr;
251     LibcxxStdMapSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)  in LibcxxStdMapSyntheticFrontEnd()
265   ValueObjectSP size_node(m_tree->GetChildMemberWithName("__pair3_"));  in CalculateNumChildren()
278 ValueObjectSP
294   ValueObjectSP iterated_sp(iterator.advance(advance_by));  in GetKeyValuePair()
318 lldb::ValueObjectSP
330   ValueObjectSP key_val_sp = GetKeyValuePair(idx, /*max_depth=*/num_children);  in GetChildAtIndex()
393     CXXSyntheticChildren *, lldb::ValueObjectSP valobj_sp) {  in LibcxxStdMapSyntheticFrontEndCreator()
398     LibCxxMapIteratorSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp)  in LibCxxMapIteratorSyntheticFrontEnd()
408   ValueObjectSP valobj_sp = m_backend.GetSP();  in Update()
472 lldb::ValueObjectSP
496     CXXSyntheticChildren *, lldb::ValueObjectSP valobj_sp) {  in LibCxxMapIteratorSyntheticFrontEndCreator()