內(nèi)容: 1.Dominator Tree與Retained Set 2.Dominator Tree詳解 一、Dominator Tree與Retained Set
Retained set:是這個(gè)對(duì)象本身和他持有引用的對(duì)象和這些對(duì)象的retained set所占內(nèi)存大小的總和; Dominator Tree(支配樹(shù))視圖,在此視圖中列出了每個(gè)對(duì)象(Object Instance)與其引用關(guān)系的樹(shù)狀結(jié)構(gòu),同時(shí)包含了占用內(nèi)存的大小和百分比。通過(guò)Dominator Tree視圖可以很容易的找出占用內(nèi)存最多的幾個(gè)對(duì)象(根據(jù)Retained Heap或Percentage排序);
|