Searched refs:num_nodes_ (Results 1 – 13 of 13) sorted by relevance
50 num_nodes_ = *(reinterpret_cast<const uint32_t*>(raw_data_)); in StaticMap()53 raw_data_ + sizeof(num_nodes_)); in StaticMap()56 raw_data_ + (1 + num_nodes_) * sizeof(uint32_t)); in StaticMap()64 int end = num_nodes_; in find()85 int end = num_nodes_; in lower_bound()106 int end = num_nodes_; in upper_bound()134 if (num_nodes_) { in ValidateInMemoryStructure()135 uint64_t first_offset = sizeof(int32_t) * (num_nodes_ + 1) in ValidateInMemoryStructure()136 + sizeof(Key) * num_nodes_; in ValidateInMemoryStructure()148 for (node_index = 1; node_index < num_nodes_; ++node_index) { in ValidateInMemoryStructure()[all …]
50 num_nodes_ = *(reinterpret_cast<const int32_t*>(base_)); in StaticMapIterator()51 offsets_ = reinterpret_cast<const uint32_t*>(base_ + sizeof(num_nodes_)); in StaticMapIterator()53 base_ + (1 + num_nodes_) * sizeof(num_nodes_)); in StaticMapIterator()64 if (++index_ > num_nodes_) index_ = num_nodes_;76 if (++index_ > num_nodes_) index_ = num_nodes_;139 if (!base_ || index_ < 0 || index_ > num_nodes_) in IsValid()
89 num_nodes_(0), in StaticMap()95 inline bool empty() const { return num_nodes_ == 0; } in empty()96 inline unsigned int size() const { return num_nodes_; } in size()100 inline iterator last() const { return IteratorAtIndex(num_nodes_ - 1); } in last()101 inline iterator end() const { return IteratorAtIndex(num_nodes_); } in end()129 int32_t num_nodes_; variable
99 int32_t num_nodes_; variable
50 num_nodes_ = graph.node_size(); in InitializeFromGraph()51 index_to_node_name_.resize(num_nodes_); in InitializeFromGraph()52 node_name_to_index_.rehash(num_nodes_); in InitializeFromGraph()53 fanins_.resize(num_nodes_); in InitializeFromGraph()54 fanouts_.resize(num_nodes_); in InitializeFromGraph()57 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph()102 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph()136 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph()176 DCHECK(node_idx >= 0 && node_idx < num_nodes_) << "node_idx is out of range"; in GetNode()197 const bool is_valid_node_idx = node_idx >= 0 && node_idx < num_nodes_; in GetFanin()[all …]
67 int num_nodes() const { return num_nodes_; } in num_nodes()100 int num_nodes_ = 0; variable
77 int num_nodes() const { return num_nodes_; } in num_nodes()85 int num_nodes_; variable
28 num_nodes_((1 << (levels + 1)) - 1) { in WPDTree()35 nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
72 num_nodes_ = 0; in OsLayer()108 num_nodes_ = 1; in Initialize()110 num_cpus_per_node_ = num_cpus_ / num_nodes_; in Initialize()112 logprintf(5, "Log: %d nodes, %d cpus.\n", num_nodes_, num_cpus_); in Initialize()114 cpu_sets_.resize(num_nodes_); in Initialize()115 cpu_sets_valid_.resize(num_nodes_); in Initialize()323 region %= num_nodes_; in FindCoreMask()
330 int num_nodes() const { return num_nodes_; } in num_nodes()381 int num_nodes_; // Number of nodes in the system. variable
540 int num_nodes() const { return num_nodes_; } in num_nodes()544 DCHECK_GE(num_nodes_, 2); in num_op_nodes()545 return num_nodes_ - 2; in num_op_nodes()680 int64 num_nodes_ = 0; variable
758 ++num_nodes_; in AllocateNode()766 --num_nodes_; in ReleaseNode()
268 DCHECK_LT(id, num_nodes_); in node()279 int32 num_nodes_ = 0; member in tensorflow::__anon675242740111::GraphView400 for (int i = 0; i < num_nodes_; i++) { in ~GraphView()556 num_nodes_ = num_nodes; in Initialize()