Lines Matching defs:node

84 	virtual	void				ValueNodeChildrenCreated(ValueNode* node);
85 virtual void ValueNodeChildrenDeleted(ValueNode* node);
86 virtual void ValueNodeValueChanged(ValueNode* node);
88 virtual void ModelNodeHidden(ModelNode* node);
90 virtual void ModelNodeValueRequested(ModelNode* node);
92 virtual void ModelNodeRestoreViewStateRequested(ModelNode* node);
334 // draw the node's value with the designated renderer
336 ModelNode* node = dynamic_cast<ModelNode*>(value.ToReferenceable());
337 if (node != NULL && node->GetValue() != NULL
338 && node->TableCellRenderer() != NULL) {
339 node->TableCellRenderer()->RenderValue(node->GetValue(), rect,
355 // get the preferred width from the node's designated renderer
357 ModelNode* node = dynamic_cast<ModelNode*>(value.ToReferenceable());
358 if (node != NULL && node->GetValue() != NULL
359 && node->TableCellRenderer() != NULL) {
360 return node->TableCellRenderer()->PreferredValueWidth(
361 node->GetValue(), targetView);
394 void ValueNodeChildrenCreated(ValueNode* node);
395 void ValueNodeChildrenDeleted(ValueNode* node);
396 void ValueNodeValueChanged(ValueNode* node);
405 bool GetTreePath(ModelNode* node,
408 void NodeExpanded(ModelNode* node);
410 void NotifyNodeChanged(ModelNode* node);
411 void NotifyNodeHidden(ModelNode* node);
492 TableCellContextMenuTracker(ModelNode* node, BLooper* parentLooper,
495 fNode(node),
640 if (message.AddPointer("node", fNode) != B_OK
724 VariablesView::ContainerListener::ValueNodeChildrenCreated(ValueNode* node)
728 fModel->ValueNodeChildrenCreated(node);
734 BReference<ValueNode> nodeReference(node);
737 if (message.AddPointer("node", node) == B_OK
746 VariablesView::ContainerListener::ValueNodeChildrenDeleted(ValueNode* node)
750 fModel->ValueNodeChildrenDeleted(node);
756 BReference<ValueNode> nodeReference(node);
759 if (message.AddPointer("node", node) == B_OK
768 VariablesView::ContainerListener::ValueNodeValueChanged(ValueNode* node)
772 fModel->ValueNodeValueChanged(node);
778 BReference<ValueNode> nodeReference(node);
781 if (message.AddPointer("node", node) == B_OK
790 VariablesView::ContainerListener::ModelNodeHidden(ModelNode* node)
792 BReference<ModelNode> nodeReference(node);
795 if (message.AddPointer("node", node) == B_OK
804 VariablesView::ContainerListener::ModelNodeValueRequested(ModelNode* node)
806 BReference<ModelNode> nodeReference(node);
809 if (message.AddPointer("node", node) == B_OK
819 ModelNode* node)
821 BReference<ModelNode> nodeReference(node);
824 if (message.AddPointer("node", node) == B_OK
947 // check whether we know the node
979 VariablesView::VariableTableModel::ValueNodeChildrenDeleted(ValueNode* node)
984 // check whether we know the node
985 ValueNodeChild* nodeChild = node->NodeChild();
993 // in the case of an address node with a hidden child,
1024 // check whether we know the node
1082 // If the node only has a hidden child, pretend the node directly has the
1102 // If the node only has a hidden child, pretend the node directly has the
1120 ModelNode* node = (ModelNode*)object;
1124 _value.SetTo(node->Name(), B_VARIANT_DONT_COPY_DATA);
1127 if (node->GetValue() == NULL) {
1128 ValueLocation* location = node->NodeChild()->Location();
1132 Type* nodeChildRawType = node->NodeChild()->Node()->GetType()
1151 _value.SetTo(node, VALUE_NODE_TYPE);
1160 VariablesView::VariableTableModel::NodeExpanded(ModelNode* node)
1166 // If the node only has a hidden child, add the child's children instead.
1167 if (node->CountChildren() == 1) {
1168 ModelNode* child = node->ChildAt(0);
1170 node = child;
1174 for (int32 i = 0; ModelNode* child = node->ChildAt(i); i++)
1180 VariablesView::VariableTableModel::NotifyNodeChanged(ModelNode* node)
1182 if (!node->IsHidden()) {
1184 if (GetTreePath(node, treePath)) {
1193 VariablesView::VariableTableModel::NotifyNodeHidden(ModelNode* node)
1195 fContainerListener->ModelNodeHidden(node);
1203 ModelNode* node = (ModelNode*)NodeForPath(path);
1204 if (node == NULL)
1207 if (node->NodeChild()->LocationResolutionState() != B_OK)
1210 ValueLocation* location = node->NodeChild()->Location();
1259 ModelNode* node = new(std::nothrow) ModelNode(parent, variable, nodeChild,
1261 BReference<ModelNode> nodeReference(node, true);
1262 if (node == NULL || node->Init() != B_OK)
1270 if (!parent->AddChild(node))
1276 if (!fNodes.AddItem(node))
1282 fNodeTable.Insert(node);
1284 // if an address type node has only a single child, and that child
1292 node->SetHidden(true);
1297 NotifyNodeHidden(node);
1302 if (!node->IsHidden()) {
1308 // if the node is hidden, add its children
1309 if (node->IsHidden())
1317 VariablesView::VariableTableModel::GetTreePath(ModelNode* node,
1320 // recurse, if the node has a parent
1321 if (ModelNode* parent = node->Parent()) {
1325 if (node->IsHidden())
1328 return _path.AddComponent(parent->IndexOf(node));
1332 int32 index = fNodes.IndexOf(node);
1424 ModelNode* node = (ModelNode*)fVariableTableModel->ChildAt(root, i);
1425 _RequestNodeValue(node);
1455 promptMessage->AddPointer("node", fVariableTable
1469 ModelNode* node = NULL;
1470 if (message->FindPointer("node", reinterpret_cast<void **>(&node))
1496 node->NodeChild(), type, valueNode) != B_OK) {
1502 node->NodeChild()->SetNode(valueNode);
1507 ModelNode* node = reinterpret_cast<ModelNode*>(
1509 ValueLocation* location = node->NodeChild()->Location();
1541 ValueNode* node;
1542 if (message->FindPointer("node", (void**)&node) == B_OK) {
1543 BReference<ValueNode> newNodeReference(node, true);
1544 fVariableTableModel->ValueNodeChildrenCreated(node);
1551 ValueNode* node;
1552 if (message->FindPointer("node", (void**)&node) == B_OK) {
1553 BReference<ValueNode> newNodeReference(node, true);
1554 fVariableTableModel->ValueNodeChildrenDeleted(node);
1561 ValueNode* node;
1562 if (message->FindPointer("node", (void**)&node) == B_OK) {
1563 BReference<ValueNode> newNodeReference(node, true);
1564 fVariableTableModel->ValueNodeValueChanged(node);
1571 ModelNode* node;
1572 if (message->FindPointer("node", (void**)&node) == B_OK) {
1574 if (fVariableTableModel->GetTreePath(node, path)) {
1584 _ApplyViewStateDescendentNodeInfos(viewState, node,
1594 ModelNode* node;
1595 if (message->FindPointer("node", (void**)&node) == B_OK) {
1596 BReference<ModelNode> modelNodeReference(node, true);
1597 _RequestNodeValue(node);
1609 ModelNode* node;
1610 if (message->FindPointer("node", (void**)&node) != B_OK)
1612 BReference<ModelNode> nodeReference(node, true);
1614 fVariableTableModel->NotifyNodeChanged(node);
1664 ModelNode* node = (ModelNode*)fVariableTableModel->NodeForPath(path);
1665 if (node == NULL)
1668 fVariableTableModel->NodeExpanded(node);
1672 // If the node only has a hidden child, directly load the child's
1674 if (node->CountChildren() == 1) {
1675 ModelNode* child = node->ChildAt(0);
1677 node = child;
1681 for (int32 i = 0; ModelNode* child = node->ChildAt(i); i++) {
1701 ModelNode* node = (ModelNode*)fVariableTableModel->NodeForPath(path);
1702 if (node == NULL)
1709 TableCellValueRenderer* cellRenderer = node->TableCellRenderer();
1713 error = node->GetValueHandler()
1714 ->CreateTableCellValueSettingsMenu(node->GetValue(), settings,
1723 TableCellContextMenuTracker(node, Looper(), this);
1733 error = _GetContextActionsForNode(node, preActionList);
1776 VariablesView::_RequestNodeValue(ModelNode* node)
1778 // get the node child and its container
1779 ValueNodeChild* nodeChild = node->NodeChild();
1788 // get the value node and check whether its value has not yet been resolved
1806 VariablesView::_GetContextActionsForNode(ModelNode* node,
1809 ValueLocation* location = node->NodeChild()->Location();
1951 ModelNode* node = (ModelNode*)fVariableTableModel->ChildAt(parent, i);
1955 // add the node's info
1959 status_t error = viewState->SetNodeInfo(node->GetVariable()->ID(),
1960 node->GetPath(), nodeInfo);
1965 error = _AddViewStateDescendentNodeInfos(viewState, node, path);
1982 ModelNode* node = (ModelNode*)fVariableTableModel->ChildAt(parent, i);
1986 // apply the node's info, if any
1988 node->GetVariable()->ID(), node->GetPath());
1993 status_t error = _ApplyViewStateDescendentNodeInfos(viewState, node,