forked from qt-creator/qt-creator
Debugger: Adjust std::__1::unordered_map dumper
Implementation seems to have changed. Change-Id: I196d02cddcccdd7765e5a098bb98f894122781a1 Reviewed-by: Christian Stenger <christian.stenger@theqtcompany.com>
This commit is contained in:
@@ -640,11 +640,18 @@ def qdump__std____1__unordered_map(d, value):
|
|||||||
size = int(value["__table_"]["__p2_"]["__first_"])
|
size = int(value["__table_"]["__p2_"]["__first_"])
|
||||||
d.putItemCount(size)
|
d.putItemCount(size)
|
||||||
if d.isExpanded():
|
if d.isExpanded():
|
||||||
|
# There seem to be several versions of the implementation.
|
||||||
|
def valueCCorNot(val):
|
||||||
|
try:
|
||||||
|
return val["__cc"]
|
||||||
|
except:
|
||||||
|
return val
|
||||||
|
|
||||||
node = value["__table_"]["__p1_"]["__first_"]["__next_"]
|
node = value["__table_"]["__p1_"]["__first_"]["__next_"]
|
||||||
with PairedChildren(d, size, pairType=node["__value_"].type, maxNumChild=1000):
|
with PairedChildren(d, size, pairType=valueCCorNot(node["__value_"]).type):
|
||||||
for i in d.childRange():
|
for i in d.childRange():
|
||||||
with SubItem(d, i):
|
with SubItem(d, i):
|
||||||
d.putPair(node["__value_"], i)
|
d.putPair(valueCCorNot(node["__value_"]), i)
|
||||||
node = node["__next_"]
|
node = node["__next_"]
|
||||||
|
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user