HomeSort by relevance Sort by last modified time
    Searched refs:InternalNode (Results 1 - 5 of 5) sorted by null

  /external/chromium_org/ui/views/controls/tree/
tree_view.h 179 // InternalNode is used to track information about the set of nodes displayed
181 class InternalNode : public ui::TreeNode<InternalNode> {
183 InternalNode();
184 virtual ~InternalNode();
189 // The model node this InternalNode represents.
223 DISALLOW_COPY_AND_ASSIGN(InternalNode);
228 // If an InternalNode hasn't been created yet, create it.
231 // Don't create an InternalNode if one hasn't been created yet.
252 void LoadChildren(InternalNode* node)
    [all...]
tree_view.cc 223 InternalNode* node = model_node ? GetInternalNodeForModelNode(
261 InternalNode* node =
301 InternalNode* node = GetInternalNodeForModelNode(
329 InternalNode* node = GetNodeByRow(row, &depth);
334 InternalNode* internal_node =
396 InternalNode* node = GetNodeByRow(row, &depth);
425 InternalNode* parent_node =
430 InternalNode* child = new InternalNode;
442 InternalNode* parent_node
    [all...]
tree_view_unittest.cc 71 std::string InternalNodeAsString(TreeView::InternalNode* node);
137 TreeView::InternalNode* node) {
  /external/chromium_org/net/quic/crypto/
strike_register.h 153 class InternalNode;
212 InternalNode* internal_nodes_;
strike_register.cc 47 // InternalNode represents a non-leaf node in the critbit tree. See the comment
49 class StrikeRegister::InternalNode {
90 CHECK_EQ(sizeof(InternalNode), 8u); // in case of compiler changes.
108 internal_nodes_ = new InternalNode[max_entries];
229 InternalNode* inode = &internal_nodes_[internal_node_index];
243 InternalNode* node = &internal_nodes_[*where_index >> 8];
360 InternalNode* node = &internal_nodes_[next];
406 InternalNode* inode = &internal_nodes_[p];
453 const InternalNode* i = &internal_nodes_[internal_node];

Completed in 75 milliseconds