NodeId             32 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId             42 net/spdy/spdy_priority_forest.h   bool NodeExists(NodeId node_id) const;
NodeId             46 net/spdy/spdy_priority_forest.h   bool AddRootNode(NodeId node_id, Priority priority);
NodeId             51 net/spdy/spdy_priority_forest.h   bool AddNonRootNode(NodeId node_id, NodeId parent_id, bool unordered);
NodeId             55 net/spdy/spdy_priority_forest.h   bool RemoveNode(NodeId node_id);
NodeId             59 net/spdy/spdy_priority_forest.h   Priority GetPriority(NodeId node_id) const;
NodeId             63 net/spdy/spdy_priority_forest.h   NodeId GetParent(NodeId node_id) const;
NodeId             68 net/spdy/spdy_priority_forest.h   bool IsNodeUnordered(NodeId node_id) const;
NodeId             72 net/spdy/spdy_priority_forest.h   NodeId GetChild(NodeId node_id) const;
NodeId             77 net/spdy/spdy_priority_forest.h   bool SetPriority(NodeId node_id, Priority priority);
NodeId             84 net/spdy/spdy_priority_forest.h   bool SetParent(NodeId node_id, NodeId parent_id, bool unordered);
NodeId             88 net/spdy/spdy_priority_forest.h   bool IsMarkedReadyToRead(NodeId node_id) const;
NodeId             91 net/spdy/spdy_priority_forest.h   bool MarkReadyToRead(NodeId node_id);
NodeId             92 net/spdy/spdy_priority_forest.h   bool MarkNoLongerReadyToRead(NodeId node_id);
NodeId             95 net/spdy/spdy_priority_forest.h   NodeId NextNodeToRead();
NodeId             99 net/spdy/spdy_priority_forest.h   bool IsMarkedReadyToWrite(NodeId node_id) const;
NodeId            102 net/spdy/spdy_priority_forest.h   bool MarkReadyToWrite(NodeId node_id);
NodeId            103 net/spdy/spdy_priority_forest.h   bool MarkNoLongerReadyToWrite(NodeId node_id);
NodeId            106 net/spdy/spdy_priority_forest.h   NodeId NextNodeToWrite();
NodeId            122 net/spdy/spdy_priority_forest.h       NodeId parent_id;  // used for non-root nodes
NodeId            124 net/spdy/spdy_priority_forest.h     NodeId child;  // node ID of child (or NodeId() for no child)
NodeId            136 net/spdy/spdy_priority_forest.h   bool IsMarked(NodeId node_id, unsigned int flag) const;
NodeId            138 net/spdy/spdy_priority_forest.h   bool Mark(NodeId node_id, unsigned int flag);
NodeId            140 net/spdy/spdy_priority_forest.h   bool Unmark(NodeId node_id, unsigned int flag);
NodeId            142 net/spdy/spdy_priority_forest.h   NodeId FirstMarkedNode(unsigned int flag);
NodeId            144 net/spdy/spdy_priority_forest.h   const Node* FindNode(NodeId node_id) const;
NodeId            151 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            152 net/spdy/spdy_priority_forest.h SpdyPriorityForest<NodeId, Priority>::SpdyPriorityForest() {}
NodeId            154 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            155 net/spdy/spdy_priority_forest.h SpdyPriorityForest<NodeId, Priority>::~SpdyPriorityForest() {}
NodeId            157 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            158 net/spdy/spdy_priority_forest.h int SpdyPriorityForest<NodeId, Priority>::num_nodes() const {
NodeId            162 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            163 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::NodeExists(NodeId node_id) const {
NodeId            167 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            168 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::AddRootNode(
NodeId            169 net/spdy/spdy_priority_forest.h     NodeId node_id, Priority priority) {
NodeId            179 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            180 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::AddNonRootNode(
NodeId            181 net/spdy/spdy_priority_forest.h     NodeId node_id, NodeId parent_id, bool unordered) {
NodeId            187 net/spdy/spdy_priority_forest.h   if (parent->child != NodeId()) {
NodeId            198 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            199 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::RemoveNode(NodeId node_id) {
NodeId            215 net/spdy/spdy_priority_forest.h   if (node.child != NodeId()) {
NodeId            238 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            239 net/spdy/spdy_priority_forest.h Priority SpdyPriorityForest<NodeId, Priority>::GetPriority(
NodeId            240 net/spdy/spdy_priority_forest.h     NodeId node_id) const {
NodeId            249 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            250 net/spdy/spdy_priority_forest.h NodeId SpdyPriorityForest<NodeId, Priority>::GetParent(NodeId node_id) const {
NodeId            255 net/spdy/spdy_priority_forest.h     return NodeId();
NodeId            259 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            260 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::IsNodeUnordered(
NodeId            261 net/spdy/spdy_priority_forest.h     NodeId node_id) const {
NodeId            266 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            267 net/spdy/spdy_priority_forest.h NodeId SpdyPriorityForest<NodeId, Priority>::GetChild(NodeId node_id) const {
NodeId            272 net/spdy/spdy_priority_forest.h     return NodeId();
NodeId            276 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            277 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::SetPriority(
NodeId            278 net/spdy/spdy_priority_forest.h     NodeId node_id, Priority priority) {
NodeId            288 net/spdy/spdy_priority_forest.h     parent->child = NodeId();
NodeId            296 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            297 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::SetParent(
NodeId            298 net/spdy/spdy_priority_forest.h     NodeId node_id, NodeId parent_id, bool unordered) {
NodeId            312 net/spdy/spdy_priority_forest.h   if (new_parent->child != NodeId()) {
NodeId            319 net/spdy/spdy_priority_forest.h   NodeId last_id = node_id;
NodeId            320 net/spdy/spdy_priority_forest.h   while (last->child != NodeId()) {
NodeId            330 net/spdy/spdy_priority_forest.h     const NodeId old_parent_id = node->depends_on.parent_id;
NodeId            335 net/spdy/spdy_priority_forest.h     old_parent->child = NodeId();
NodeId            345 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            346 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::IsMarkedReadyToRead(
NodeId            347 net/spdy/spdy_priority_forest.h     NodeId node_id) const {
NodeId            351 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            352 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::MarkReadyToRead(NodeId node_id) {
NodeId            356 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            357 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::MarkNoLongerReadyToRead(
NodeId            358 net/spdy/spdy_priority_forest.h     NodeId node_id) {
NodeId            362 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            363 net/spdy/spdy_priority_forest.h NodeId SpdyPriorityForest<NodeId, Priority>::NextNodeToRead() {
NodeId            367 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            368 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::IsMarkedReadyToWrite(
NodeId            369 net/spdy/spdy_priority_forest.h     NodeId node_id) const {
NodeId            373 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            374 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::MarkReadyToWrite(NodeId node_id) {
NodeId            378 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            379 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::MarkNoLongerReadyToWrite(
NodeId            380 net/spdy/spdy_priority_forest.h     NodeId node_id) {
NodeId            384 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            385 net/spdy/spdy_priority_forest.h NodeId SpdyPriorityForest<NodeId, Priority>::NextNodeToWrite() {
NodeId            389 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            390 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::IsMarked(
NodeId            391 net/spdy/spdy_priority_forest.h     NodeId node_id, unsigned int flag) const {
NodeId            396 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            397 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::Mark(
NodeId            398 net/spdy/spdy_priority_forest.h     NodeId node_id, unsigned int flag) {
NodeId            406 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            407 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::Unmark(
NodeId            408 net/spdy/spdy_priority_forest.h     NodeId node_id, unsigned int flag) {
NodeId            416 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            417 net/spdy/spdy_priority_forest.h NodeId SpdyPriorityForest<NodeId, Priority>::FirstMarkedNode(
NodeId            423 net/spdy/spdy_priority_forest.h   std::map<uint64, NodeId> roots;  // maps cumulative weight to root node ID
NodeId            426 net/spdy/spdy_priority_forest.h     const NodeId root_id = iter->first;
NodeId            436 net/spdy/spdy_priority_forest.h         if (node->child == NodeId()) {
NodeId            447 net/spdy/spdy_priority_forest.h     return NodeId();
NodeId            453 net/spdy/spdy_priority_forest.h   typename std::map<uint64, NodeId>::const_iterator root_iter =
NodeId            456 net/spdy/spdy_priority_forest.h   const NodeId root_id = root_iter->second;
NodeId            459 net/spdy/spdy_priority_forest.h   NodeId node_id = root_id;
NodeId            466 net/spdy/spdy_priority_forest.h       std::vector<NodeId> group;
NodeId            468 net/spdy/spdy_priority_forest.h       for (Node* next = node; next->child != NodeId();) {
NodeId            486 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            487 net/spdy/spdy_priority_forest.h const typename SpdyPriorityForest<NodeId, Priority>::Node*
NodeId            488 net/spdy/spdy_priority_forest.h SpdyPriorityForest<NodeId, Priority>::FindNode(NodeId node_id) const {
NodeId            496 net/spdy/spdy_priority_forest.h template <typename NodeId, typename Priority>
NodeId            497 net/spdy/spdy_priority_forest.h bool SpdyPriorityForest<NodeId, Priority>::ValidateInvariantsForTests() const {
NodeId            500 net/spdy/spdy_priority_forest.h     const NodeId node_id = iter->first;
NodeId            507 net/spdy/spdy_priority_forest.h     if (node.child != NodeId()) {
NodeId            513 net/spdy/spdy_priority_forest.h     NodeId child_id = node.child;
NodeId            515 net/spdy/spdy_priority_forest.h     while (child_id != NodeId()) {