Home
last modified time | relevance | path

Searched refs:nodes_ (Results 1 – 25 of 773) sorted by relevance

12345678910>>...31

/dports/audio/bshapr-lv2/BShapr-0.13/src/
H A DShape.hpp124 renderBezier (nodes_[0], nodes_[1]); in setDefaultShape()
171 if (p < nodes_.size) nodes_.insert (nodes_.begin() + p, node); in insertRawNode()
249 nodes_.erase (nodes_.begin() + pos); in deleteNode()
312 if (nodes_[nr].point.x < nodes_[nr - 1].point.x) nodes_[nr].point.x = nodes_[nr - 1].point.x; in validateNode()
313 if (nodes_[nr].point.x > nodes_[nr + 1].point.x) nodes_[nr].point.x = nodes_[nr + 1].point.x; in validateNode()
329 …double dist = (nodes_[nr].point.x - nodes_[nr-1].point.x > nodes_[nr+1].point.x - nodes_[nr].point… in validateNode()
348 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
359 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
372 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
391 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
[all …]
/dports/audio/boops-lv2/BOops-1.8.2/src/
H A DShape.hpp124 renderBezier (nodes_[0], nodes_[1]); in setDefaultShape()
171 if (p < nodes_.size) nodes_.insert (nodes_.begin() + p, node); in insertRawNode()
249 nodes_.erase (nodes_.begin() + pos); in deleteNode()
312 if (nodes_[nr].point.x < nodes_[nr - 1].point.x) nodes_[nr].point.x = nodes_[nr - 1].point.x; in validateNode()
313 if (nodes_[nr].point.x > nodes_[nr + 1].point.x) nodes_[nr].point.x = nodes_[nr + 1].point.x; in validateNode()
329 …double dist = (nodes_[nr].point.x - nodes_[nr-1].point.x > nodes_[nr+1].point.x - nodes_[nr].point… in validateNode()
348 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
359 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
372 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
391 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
[all …]
/dports/audio/bharvestr-lv2/BHarvestr-7e6a1e7c81d0af61d4fabcd823978d62c8970502/src/
H A DShape.hpp124 renderBezier (nodes_[0], nodes_[1]); in setDefaultShape()
171 if (p < nodes_.size) nodes_.insert (nodes_.begin() + p, node); in insertRawNode()
249 nodes_.erase (nodes_.begin() + pos); in deleteNode()
312 if (nodes_[nr].point.x < nodes_[nr - 1].point.x) nodes_[nr].point.x = nodes_[nr - 1].point.x; in validateNode()
313 if (nodes_[nr].point.x > nodes_[nr + 1].point.x) nodes_[nr].point.x = nodes_[nr + 1].point.x; in validateNode()
329 …double dist = (nodes_[nr].point.x - nodes_[nr-1].point.x > nodes_[nr+1].point.x - nodes_[nr].point… in validateNode()
348 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
359 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
372 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
391 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
[all …]
/dports/audio/bschaffl-lv2/BSchaffl-1.4.8/src/
H A DShape.hpp124 renderBezier (nodes_[0], nodes_[1]); in setDefaultShape()
171 if (p < nodes_.size) nodes_.insert (nodes_.begin() + p, node); in insertRawNode()
249 nodes_.erase (nodes_.begin() + pos); in deleteNode()
312 if (nodes_[nr].point.x < nodes_[nr - 1].point.x) nodes_[nr].point.x = nodes_[nr - 1].point.x; in validateNode()
313 if (nodes_[nr].point.x > nodes_[nr + 1].point.x) nodes_[nr].point.x = nodes_[nr + 1].point.x; in validateNode()
329 …double dist = (nodes_[nr].point.x - nodes_[nr-1].point.x > nodes_[nr+1].point.x - nodes_[nr].point… in validateNode()
348 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
359 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
372 if (nodes_[nr].point.x + nodes_[nr].handle1.x < nodes_[nr-1].point.x) in validateNode()
391 if (nodes_[nr].point.x + nodes_[nr].handle2.x > nodes_[nr+1].point.x) in validateNode()
[all …]
/dports/www/aria2/aria2-1.36.0/src/
H A DDHTBucket.cc109 auto itr = std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node)); in addNode()
117 nodes_.erase(nodes_.begin()); in addNode()
127 nodes_.erase(itr); in addNode()
145 auto itr = std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node)); in dropNode()
156 auto itr = std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node)); in moveToHead()
158 nodes_.erase(itr); in moveToHead()
165 auto itr = std::find_if(nodes_.begin(), nodes_.end(), derefEqual(node)); in moveToTail()
167 nodes_.erase(itr); in moveToTail()
201 nodes_ = lNodes; in split()
217 goodNodes.insert(goodNodes.end(), nodes_.begin(), nodes_.end()); in getGoodNodes()
[all …]
/dports/www/proxygen/proxygen-2021.12.27.00/proxygen/lib/http/session/test/
H A DHTTP2PriorityQueueTest.cpp110 nodes_.clear(); in dump()
118 nodes_.clear(); in dumpBFS()
126 nodes_.clear(); in nextEgress()
134 IDList nodes_; member in proxygen::QueueTest
287 EXPECT_EQ(nodes_, in TEST_F()
296 nodes_, in TEST_F()
396 EXPECT_EQ(nodes_, in TEST_F()
407 nodes_, in TEST_F()
416 EXPECT_EQ(nodes_, in TEST_F()
775 EXPECT_EQ(nodes_, IDList({})); in TEST_F()
[all …]
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcTree.cpp157 nodes_ = rhs.nodes_; in CbcTree()
174 nodes_ = rhs.nodes_; in operator =()
196 std::make_heap(nodes_.begin(), nodes_.end(), comparison_); in rebuild()
377 std::push_heap(nodes_.begin(), nodes_.end(), comparison_); in push()
403 std::pop_heap(nodes_.begin(), nodes_.end(), comparison_); in pop()
483 if (nodes_[i] && nodes_[i]->objectiveValue() != COIN_DBL_MAX && nodes_[i]->nodeInfo()) in bestNode()
485 if (nodes_[i] && nodes_[i]->objectiveValue() < cutoff in bestNode()
514 std::pop_heap(nodes_.begin(), nodes_.end(), comparison_); in bestNode()
1131 push_heap(nodes_.begin(), nodes_.end(), comparison_); in push()
1195 if (nodes_[i] && nodes_[i]->objectiveValue() != COIN_DBL_MAX && nodes_[i]->nodeInfo()) in bestNode()
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/graph/
H A Dperfect_matching.cc122 nodes_.reserve(num_nodes); in BlossomGraph()
166 nodes_[n].type = 1; in Initialize()
231 nodes_[n].dual = nodes_[n].pseudo_dual; in Initialize()
371 if (nodes_[tail].root == nodes_[head].root) { in DebugCheckNoPossiblePrimalUpdates()
413 if (nodes_[tail].root != nodes_[head].root) { in PrimalUpdates()
546 n = nodes_[n].parent; in AppendNodePathToRoot()
661 DCHECK_EQ(nodes_[Tail(edge)].root, nodes_[Head(edge)].root); in Shrink()
1013 nodes_[n].type = 0; in Expand()
1014 nodes_[n].parent = n; in Expand()
1015 nodes_[n].root = n; in Expand()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/xml/
H A Dxpath_node_set.h44 void Trace(Visitor* visitor) { visitor->Trace(nodes_); } in Trace()
46 wtf_size_t size() const { return nodes_.size(); } in size()
47 bool IsEmpty() const { return !nodes_.size(); } in IsEmpty()
52 return nodes_.begin(); in begin()
56 nodes_.ReserveCapacity(new_capacity); in ReserveCapacity()
58 void clear() { nodes_.clear(); } in clear()
62 nodes_.swap(other.nodes_); in Swap()
66 void Append(Node* node) { nodes_.push_back(node); } in Append()
67 void Append(const NodeSet& node_set) { nodes_.AppendVector(node_set.nodes_); } in Append()
88 return subtrees_are_disjoint_ || nodes_.size() < 2; in SubtreesAreDisjoint()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/xml/
H A Dxpath_node_set.h44 void Trace(Visitor* visitor) const { visitor->Trace(nodes_); } in Trace()
46 wtf_size_t size() const { return nodes_.size(); } in size()
47 bool IsEmpty() const { return !nodes_.size(); } in IsEmpty()
52 return nodes_.begin(); in begin()
56 nodes_.ReserveCapacity(new_capacity); in ReserveCapacity()
58 void clear() { nodes_.clear(); } in clear()
62 nodes_.swap(other.nodes_); in Swap()
66 void Append(Node* node) { nodes_.push_back(node); } in Append()
67 void Append(const NodeSet& node_set) { nodes_.AppendVector(node_set.nodes_); } in Append()
88 return subtrees_are_disjoint_ || nodes_.size() < 2; in SubtreesAreDisjoint()
[all …]
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/recognition/include/pcl/recognition/ransac_based/
H A Dorr_graph.h133 … for ( typename std::vector<Node*>::iterator nit = nodes_.begin () ; nit != nodes_.end () ; ++nit ) in clear()
136 nodes_.clear (); in clear()
152 nodes_[i] = new Node (i); in resize()
162 … for ( typename std::vector<Node*>::iterator it = nodes_.begin () ; it != nodes_.end () ; ++it ) in computeMaximalOnOffPartition()
196 nodes_[id1]->neighbors_.insert (nodes_[id2]); in insertUndirectedEdge()
197 nodes_[id2]->neighbors_.insert (nodes_[id1]); in insertUndirectedEdge()
203 nodes_[id1]->neighbors_.insert (nodes_[id2]); in insertDirectedEdge()
209 nodes_[id1]->neighbors_.erase (nodes_[id2]); in deleteUndirectedEdge()
210 nodes_[id2]->neighbors_.erase (nodes_[id1]); in deleteUndirectedEdge()
216 nodes_[id1]->neighbors_.erase (nodes_[id2]); in deleteDirectedEdge()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/aom/
H A Daccessible_node_list.cc20 result->nodes_ = nodes; in Create()
47 if (offset < nodes_.size()) in item()
48 return nodes_[offset]; in item()
66 nodes_.insert(index, node); in add()
71 nodes_.EraseAt(index); in remove()
86 nodes_.resize(index + 1); in AnonymousIndexedSetter()
88 nodes_[i] = nullptr; in AnonymousIndexedSetter()
90 nodes_[index] = node; in AnonymousIndexedSetter()
95 return nodes_.size(); in length()
101 nodes_.resize(new_length); in setLength()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/aom/
H A Daccessible_node_list.cc20 result->nodes_ = nodes; in Create()
47 if (offset < nodes_.size()) in item()
48 return nodes_[offset]; in item()
66 nodes_.insert(index, node); in add()
71 nodes_.EraseAt(index); in remove()
86 nodes_.resize(index + 1); in AnonymousIndexedSetter()
88 nodes_[i] = nullptr; in AnonymousIndexedSetter()
90 nodes_[index] = node; in AnonymousIndexedSetter()
95 return nodes_.size(); in length()
101 nodes_.resize(new_length); in setLength()
[all …]
/dports/math/openmesh/OpenMesh-8.1/src/OpenMesh/Tools/VDPM/
H A DVHierarchy.hh81 VHierarchyNodeContainer nodes_; member in OpenMesh::VDPM::VHierarchy
110 return nodes_[_vhierarchynode_handle.idx()]; in node()
116 return nodes_[_vhierarchynode_handle.idx()]; in node()
128 { return nodes_[_node_handle.idx()].is_leaf(); } in is_leaf_node()
131 { return nodes_[_node_handle.idx()].is_root(); } in is_root_node()
136 return nodes_[_node_handle.idx()].normal(); in normal()
141 { return nodes_[_node_handle.idx()].node_index(); } in node_index()
144 { return nodes_[_node_handle.idx()].node_index(); } in node_index()
164 { return nodes_[_node_handle.idx()].parent_handle(); } in parent_handle()
167 { return nodes_[_node_handle.idx()].lchild_handle(); } in lchild_handle()
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/
H A Dlb_tree_search.cc64 Node& parent = nodes_[parent_index]; in UpdateParentObjective()
66 const Node& child = nodes_[child_index]; in UpdateParentObjective()
83 Node& child = nodes_[child_index]; in UpdateObjectiveFromParent()
106 const Node& node = nodes_[n]; in DebugDisplayTree()
241 nodes_.clear(); in Search()
355 if (n < nodes_.size()) { in Search()
397 const NodeIndex n(nodes_.size()); in Search()
404 nodes_[parent].true_child = n; in Search()
405 nodes_[parent].UpdateTrueObjective(nodes_.back().MinObjective()); in Search()
409 nodes_[parent].UpdateFalseObjective(nodes_.back().MinObjective()); in Search()
[all …]
/dports/math/spot/spot-2.10.2/spot/twaalgos/
H A Dzlktree.cc118 nodes_.emplace_back(); in zielonka_tree()
119 nodes_[0].parent = 0; in zielonka_tree()
120 nodes_[0].colors = all; in zielonka_tree()
121 nodes_[0].level = 0; in zielonka_tree()
147 nodes_.push_back({node, static_cast<unsigned>(nodes_.size() + 1), in zielonka_tree()
167 unsigned ns = nodes_.size(); in dot()
194 if (SPOT_UNLIKELY(nodes_.size() <= branch || nodes_[branch].first_child)) in step()
505 auto& nn = nodes_[node]; in build_()
713 for (auto& node: nodes_) in build_()
982 return nodes_[n].level; in node_level()
[all …]
/dports/math/py-spot/spot-2.10.2/spot/twaalgos/
H A Dzlktree.cc118 nodes_.emplace_back(); in zielonka_tree()
119 nodes_[0].parent = 0; in zielonka_tree()
120 nodes_[0].colors = all; in zielonka_tree()
121 nodes_[0].level = 0; in zielonka_tree()
147 nodes_.push_back({node, static_cast<unsigned>(nodes_.size() + 1), in zielonka_tree()
167 unsigned ns = nodes_.size(); in dot()
194 if (SPOT_UNLIKELY(nodes_.size() <= branch || nodes_[branch].first_child)) in step()
505 auto& nn = nodes_[node]; in build_()
713 for (auto& node: nodes_) in build_()
982 return nodes_[n].level; in node_level()
[all …]
/dports/math/minizinc-ide/MiniZincIDE-2.5.5/cp-profiler/src/cpprofiler/tree/
H A Dstructure.cpp18 nodes_.reserve(100); in Structure()
28 if (nodes_.size() > 0) in createRoot()
59 nodes_[pid]->setChild(nid, alt); in createChild()
69 nodes_[pid]->addChild(); in addExtraChild()
91 nodes_[pid]->removeChild(alt); in removeChild()
96 return nodes_[pid]->getChild(alt); in getChild()
101 return nodes_[nid]->getParent(); in getParent()
140 return nodes_.size(); in nodeCount()
145 nodes_.resize(size); in db_initialize()
156 nodes_[pid]->setChild(nid, alt); in db_createChild()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update(nodes_[index]->data(), in Update()
102 nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/libtgvoip/webrtc_dsp/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update(nodes_[index]->data(), in Update()
102 nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/net-im/tg_owt/tg_owt-d578c76/src/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update(nodes_[index]->data(), in Update()
102 nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update(nodes_[index]->data(), in Update()
102 nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/www/firefox/firefox-99.0/third_party/libwebrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update(nodes_[index]->data(), in Update()
102 nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/libwebrtc/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update( in Update()
102 nodes_[index]->data(), nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()
/dports/lang/spidermonkey60/firefox-60.9.0/media/webrtc/trunk/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
55 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
58 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
72 return nodes_[(1 << level) + index].get(); in NodeAt()
81 int update_result = nodes_[1]->set_data(data, data_length); in Update()
101 update_result = nodes_[index_left_child]->Update( in Update()
102 nodes_[index]->data(), nodes_[index]->length()); in Update()
107 update_result = nodes_[index_right_child]->Update( in Update()
108 nodes_[index]->data(), nodes_[index]->length()); in Update()

12345678910>>...31