Home
last modified time | relevance | path

Searched refs:travTree (Results 1 – 4 of 4) sorted by relevance

/dports/net/wireshark/wireshark-3.6.1/ui/qt/
H A Dproto_tree.cpp704 QString ProtoTree::traverseTree(const QModelIndex & travTree, int identLevel) const in traverseTree() argument
708 if (travTree.isValid()) in traverseTree()
711 result.append(travTree.data().toString()); in traverseTree()
715 if (isExpanded(travTree)) in traverseTree()
717 int children = proto_tree_model_->rowCount(travTree); in traverseTree()
720 result += traverseTree(proto_tree_model_->index(child, 0, travTree), identLevel); in traverseTree()
/dports/net/wireshark-lite/wireshark-3.6.1/ui/qt/
H A Dproto_tree.cpp704 QString ProtoTree::traverseTree(const QModelIndex & travTree, int identLevel) const in traverseTree() argument
708 if (travTree.isValid()) in traverseTree()
711 result.append(travTree.data().toString()); in traverseTree()
715 if (isExpanded(travTree)) in traverseTree()
717 int children = proto_tree_model_->rowCount(travTree); in traverseTree()
720 result += traverseTree(proto_tree_model_->index(child, 0, travTree), identLevel); in traverseTree()
/dports/net/tshark-lite/wireshark-3.6.1/ui/qt/
H A Dproto_tree.cpp704 QString ProtoTree::traverseTree(const QModelIndex & travTree, int identLevel) const
708 if (travTree.isValid())
711 result.append(travTree.data().toString());
715 if (isExpanded(travTree))
717 int children = proto_tree_model_->rowCount(travTree);
720 result += traverseTree(proto_tree_model_->index(child, 0, travTree), identLevel);
/dports/net/tshark/wireshark-3.6.1/ui/qt/
H A Dproto_tree.cpp704 QString ProtoTree::traverseTree(const QModelIndex & travTree, int identLevel) const in traverseTree() argument
708 if (travTree.isValid()) in traverseTree()
711 result.append(travTree.data().toString()); in traverseTree()
715 if (isExpanded(travTree)) in traverseTree()
717 int children = proto_tree_model_->rowCount(travTree); in traverseTree()
720 result += traverseTree(proto_tree_model_->index(child, 0, travTree), identLevel); in traverseTree()