{{ size={$T2} }} $T2 $T2 m_array {*m_iter} m_iter {{ size={m_NbElement} }} m_NbElement m_NbElement (32 - ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32))) ? ((((&(m_pArray[((m_BitPerElement * $i) / 32)]))[0] & ((0xFFFFFFFF >> (32 - m_BitPerElement)) << ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32)))) >> ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32))) | (((&(m_pArray[((m_BitPerElement * $i) / 32)]))[1] & ((0xFFFFFFFF >> (32 - m_BitPerElement)) >> (32 - ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32))))) << (32 - ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32))))) : (((&(m_pArray[((m_BitPerElement * $i) / 32)]))[0] & ((0xFFFFFFFF >> (32 - m_BitPerElement)) << ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32)))) >> ((m_BitPerElement * $i) - (((m_BitPerElement * $i) / 32) * 32))) ]]> {{ size={$T1} }} $T1 *m_pBits $T1 > 5] >> ($i & 31)) & 1 ]]> {{ size={m_array.m_size}, NextRead={m_array.m_array[m_elementReadPos]} }} m_array.m_size m_availablelement m_elementReadPos m_elementWritePos m_circularWrite m_availablelement m_array.m_array[(m_elementReadPos + $i) % m_array.m_size] m_array.m_size m_array.m_array {{ size={m_begin <= m_end ? m_end - m_begin : (m_capacity - m_begin) + m_end} }} m_begin <= m_end ? m_end - m_begin : (m_capacity - m_begin) + m_end m_capacity m_array[m_begin] m_array[(m_end - 1 + m_capacity) % m_capacity] m_array[(m_begin + $i) % m_capacity] {m_parent->m_array[m_pos]} m_pos - m_parent->m_begin m_array[m_pos]) ]]> {{ ... }} Circular Linked Lists are not handled properly and will loop indefinitly in vs2012 (use vs2013+ for correct behavior) m_node.m_next m_next *)this)->mValue ]]> {m_node->mValue} {{ size={m_tree.m_count} }} m_tree.m_keyCompare m_tree.m_count m_tree.m_count m_tree.m_tree.m_parent m_left m_right ,$T1,$T3,G4::Select1st > >::TreeNode*)this)->m_element ]]> {{ size={m_tree.m_count} }} m_tree.m_keyCompare m_tree.m_count m_tree.m_count m_tree.m_tree.m_parent m_left m_right >::TreeNode*)this)->m_element ]]> {{ {first}, {second} }} {m_container} m_comparator m_container {m_container} m_container {{ size={m_count} }} m_keyCompare m_count ::TreeNode*)m_tree.m_parent) ]]> m_count m_tree.m_parent m_left m_right ::TreeNode*)this)->m_element ]]> ::TreeNode*)m_node)->m_element} ]]> {{ element={m_element}, color={m_color} ... }} m_element m_color ::TreeNode*)m_left ]]> ::TreeNode*)m_right ]]> {{ size={m_size} }} m_size m_size {m_container} m_container {{ size={m_size} }} m_size $T2 m_size m_staticArray.m_array {{ size={m_uiCount} }} m_hashingMethod m_keyEqual Natvis doesn't support displaying this type properly, follow the link and vote for this feature to be supported: http://visualstudio.uservoice.com/forums/121579-visual-studio/suggestions/4256222-add-support-for-bucketed-linked-lists-in-natvis-fi m_uiHashSize m_pHashTable {m_iterator->m_val} m_iterator {{ size={m_size} }} m_size m_capacity m_size m_array {*m_iterator} m_iterator {m_string ? m_string->data : ""} m_string->size m_string->capacity m_string->refCount