| /dports/graphics/vigra/vigra-8acd73a/include/vigra/ |
| H A D | union_find.hxx | 203 mutable ArrayVector<T> labels_; member in vigra::UnionFindArray
224 return const_iterator(IteratorPolicy(labels_, labels_.size()-1)); in end()
229 return T(labels_.size() - 1); in nextFreeIndex()
236 root = (IndexType)labels_[root]; in findIndex()
241 labels_[(IndexType)index] = root; in findIndex()
268 labels_[i2] = i1; in makeUnion()
273 labels_[i1] = i2; in makeUnion()
280 if(index == (T)labels_.size()-1) in finalizeIndex()
286 labels_.push_back(LabelAccessor::toAnchor((T)labels_.size())); in finalizeIndex()
291 labels_.back() = LabelAccessor::toAnchor((T)labels_.size()-1); in finalizeIndex()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/courgette/ |
| H A D | label_manager.cc | 22 : labels_(labels) { in SimpleIndexAssigner()
28 for (const Label& label : *labels_) { in SimpleIndexAssigner()
44 for (auto p = labels_->begin(); p != labels_->end(); ++p) { in DoForwardFill()
66 for (auto p = labels_->rbegin(); p != labels_->rend(); ++p) { in DoBackwardFill()
83 for (Label& label : *labels_) { in DoInFill()
113 labels_.begin(), labels_.end(), Label(rva), in Find()
119 for (Label& label : labels_) in UnassignIndexes()
125 for (Label& label : labels_) { in DefaultAssignIndexes()
167 DCHECK(labels_.empty()); in Read()
168 labels_.reserve(num_distinct_rva); in Read()
[all …]
|
| /dports/graphics/tesseract/tesseract-5.0.0/src/training/common/ |
| H A D | ctc.cpp | 85 num_labels_ = labels_.size(); in CTC()
96 if (labels_[min_u] == null_char_) { in ComputeLabelLimits()
103 if (labels_[min_u] == null_char_ && min_u > 0 && labels_[min_u + 1] != labels_[min_u - 1]) { in ComputeLabelLimits()
108 int max_u = labels_[0] == null_char_; in ComputeLabelLimits()
117 labels_[max_u + 1] != labels_[max_u - 1]) { in ComputeLabelLimits()
134 int label = labels_[l]; in ComputeSimpleTargets()
242 ++truth_counts[labels_[l]]; in CalculateBiasFraction()
288 if (labels_[0] == null_char_) { in Forward()
301 if (u >= 2 && labels_[u - 1] == null_char_ && labels_[u] != labels_[u - 2]) { in Forward()
330 if (u + 2 < num_labels_ && labels_[u + 1] == null_char_ && labels_[u] != labels_[u + 2]) { in Backward()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bmdl/ |
| H A D | bmdl_classify.hxx | 233 labels_(i,j) = 0; in segment()
236 labels_(i,j) = 1; in segment()
239 labels_(i,j) = 2; in segment()
272 if (labels_(0,0) >= 2) in cluster_buildings()
281 if (labels_(i,0)!=2) in cluster_buildings()
302 if (labels_(0,j)!=2) in cluster_buildings()
331 int idx1 = labels_(i-1,j)-2, idx2 = labels_(i,j-1)-2; in cluster_buildings()
399 labels_(i,j) = unique_map[labels_(i,j)-2]+2; in cluster_buildings()
557 labels_(i,j) = label_map[labels_(i,j)-2]; in threshold_building_area()
603 labels_(i,j) = idx_map[labels_(i,j)-2]; in refine_buildings()
[all …]
|
| /dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/tests/ |
| H A D | test_flat.py | 42 def n_clusters_from_labels(labels_): argument
43 return np.amax(labels_) + 1
52 n_clusters = n_clusters_from_labels(clusterer.labels_)
59 assert_array_equal(clusterer_flat.labels_, clusterer.labels_)
65 n_clusters = n_clusters_from_labels(clusterer.labels_)
72 assert_array_equal(clusterer_flat.labels_, clusterer.labels_)
95 assert_array_equal(clusterer_flat.labels_, clusterer.labels_)
111 assert_array_equal(clusterer_flat.labels_, clusterer.labels_)
126 max_clusters = n_clusters_from_labels(clusterer.labels_)
144 assert_array_equal(clusterer_flat.labels_, clusterer_leaf.labels_)
[all …]
|
| /dports/math/openturns/openturns-1.18/lib/src/Base/Graph/ |
| H A D | Pie.cxx | 47 , labels_(0) in Pie()
62 , labels_(labels) in Pie()
79 , labels_(labels) in Pie()
93 << " labels=" << labels_ in __repr__()
124 return labels_; in getLabels()
128 labels_ = labels; in setLabels()
168 UnsignedInteger size = labels_.getSize(); in draw()
174 …e; ++i, separator = "\",\"") oss << separator << (data_(i, 0) >= labelThreshold ? labels_[i] : ""); in draw()
246 labels_ = Description(size); in buildDefaultLabels()
259 adv.saveAttribute( "labels_", labels_ ); in save()
[all …]
|
| H A D | Contour.cxx | 50 , labels_(ResourceMap::GetAsUnsignedInteger( "Contour-DefaultLevelsNumber" )) in Contour()
80 , labels_(labels) in Contour()
99 << " labels=" << labels_ in __repr__()
142 return labels_; in getLabels()
148 labels_ = labels; in setLabels()
217 oss << labels_[i] << "\",\""; in draw()
219 oss << labels_[length] << "\")\n"; in draw()
262 labels_ = Description(number); in buildDefaultLabels()
263 for (UnsignedInteger i = 0; i < number; ++i) labels_[i] = OSS() << levels_[i]; in buildDefaultLabels()
273 adv.saveAttribute( "labels_", labels_ ); in save()
[all …]
|
| /dports/games/scorched3d/scorched/src/common/weapons/ |
| H A D | AccessoryCreateContext.cpp | 35 labels_.find(label); in getLabel()
36 if (findItor == labels_.end()) return 0; in getLabel()
42 labels_[label] = weapon; in addLabel()
48 labels_.find(label); in removeLabel()
49 if (findItor != labels_.end()) labels_.erase(findItor); in removeLabel()
|
| /dports/www/node10/node-v10.24.1/deps/v8/src/interpreter/ |
| H A D | bytecode-label.h | 61 explicit BytecodeLabels(Zone* zone) : labels_(zone) {} in BytecodeLabels()
70 bool is_bound = !labels_.empty() && labels_.front().is_bound(); in is_bound()
72 std::all_of(labels_.begin(), labels_.end(), in is_bound()
77 bool empty() const { return labels_.empty(); } in empty()
80 ZoneLinkedList<BytecodeLabel> labels_;
|
| H A D | bytecode-label.cc | 16 labels_.emplace_back(BytecodeLabel()); in New()
17 return &labels_.back(); in New()
21 for (auto& label : labels_) { in Bind()
28 for (auto& label : labels_) { in BindToLabel()
|
| /dports/graphics/nplot/nplot-9a92e78/src/ |
| H A D | LabelAxis.cs | 40 private ArrayList labels_; field in NPlot.LabelAxis
131 a.labels_ = (ArrayList) b.labels_.Clone(); in DoClone()
143 labels_ = new ArrayList(); in Init()
154 labels_.Add(name); in AddLabel()
182 for (int i = 0; i < labels_.Count; ++i) in DrawTicks()
195 (string) labels_[i], in DrawTicks()
257 for (int i = 0; i < labels_.Count; ++i) in WorldTickPositions_FirstPass()
280 for (int i = 1; i < labels_.Count; ++i) in WorldTickPositions_FirstPass()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/gel/gevd/ |
| H A D | gevd_region_edge.h | 54 : vbl_ref_count(), edge_(e.edge_), labels_(e.labels_) {} in gevd_region_edge()
59 unsigned int NumLabels() const {return labels_.size();} in NumLabels()
60 unsigned int GetLabel(unsigned int i) const {return i<NumLabels() ? labels_[i] : 0;} in GetLabel()
67 std::vector<unsigned int> labels_; variable
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/tests/ |
| H A D | test_optics.py | 105 assert_array_equal(clust.labels_, expected_labels)
111 assert_array_equal(clust.labels_, expected_labels)
123 assert_array_equal(clust.labels_, expected_labels)
162 n_clusters_1 = len(set(clust.labels_)) - int(-1 in clust.labels_)
166 assert clust.labels_.shape == (len(X),)
167 assert clust.labels_.dtype.kind == "i"
273 assert max(clust.labels_) == 2
292 contingency = contingency_matrix(db.labels_, op.labels_)
329 cluster_sizes = np.bincount(clust.labels_[clust.labels_ != -1])
337 assert_array_equal(clust.labels_, clust_frac.labels_)
[all …]
|
| H A D | test_dbscan.py | 46 labels = db.fit(D).labels_
68 labels = db.fit(X).labels_
137 assert_array_equal(db.labels_, -1)
160 labels = db.fit(X).labels_
184 core_sample_1, labels_1 = db.core_sample_indices_, db.labels_
242 labels = db.fit(X).labels_
248 labels = db.fit(X).labels_
254 labels = db.fit(X).labels_
260 labels = db.fit(X).labels_
361 label4 = est.labels_
[all …]
|
| H A D | test_spectral.py | 55 labels = model.labels_
64 assert_array_equal(model_copy.labels_, model.labels_)
117 .labels_
141 .labels_
159 assert adjusted_rand_score(y, sp.labels_) == 1
162 labels = sp.fit(X).labels_
173 labels = sp.fit(X).labels_
177 labels = sp.fit(X).labels_
186 labels = sp.fit(X).labels_
271 labels = sp.fit(X).labels_
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/sdet/ |
| H A D | sdet_region_edge.cxx | 28 if (std::find(labels_.begin(), labels_.end(), label) == labels_.end()) in SetNewLabel()
29 labels_.push_back(label); in SetNewLabel()
35 unsigned int n = labels_.size(); in NumLabels()
|
| H A D | sdet_region_edge.h | 55 : vbl_ref_count(), edge_(e.edge_), labels_(e.labels_) {} in sdet_region_edge()
67 { return i<NumLabels(max_label) ? labels_[i] : 0; } in GetLabel()
75 std::vector<unsigned int> labels_; variable
|
| /dports/databases/hbase/hbase-1.2.1/hbase-rest/src/main/java/org/apache/hadoop/hbase/rest/protobuf/generated/ |
| H A D | ScannerMessage.java | 283 labels_ = new com.google.protobuf.UnmodifiableLazyStringList(labels_); in Scanner()
511 return labels_; in getLabelsList()
517 return labels_.size(); in getLabelsCount()
883 labels_); in buildPartial()
886 result.labels_ = labels_; in buildPartial()
945 labels_ = other.labels_; in mergeFrom()
949 labels_.addAll(other.labels_); in mergeFrom()
1386 labels_ = new com.google.protobuf.LazyStringArrayList(labels_); in ensureLabelsIsMutable()
1401 return labels_.size(); in getLabelsCount()
1438 labels_.add(value); in addLabels()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/segmentation/include/pcl/segmentation/ |
| H A D | euclidean_cluster_comparator.h | 119 labels_ = labels; in setLabels()
126 return labels_; in getLabels()
152 if (labels_ && exclude_labels_) in compare()
154 assert (labels_->size () == input_->size ()); in compare()
155 const std::uint32_t &label1 = (*labels_)[idx1].label; in compare()
156 const std::uint32_t &label2 = (*labels_)[idx2].label; in compare()
189 PointCloudLPtr labels_;
|
| /dports/games/wesnoth/wesnoth-1.14.17/src/map/ |
| H A D | label.cpp | 48 , labels_() in map_labels()
56 , labels_() in map_labels()
81 for(const auto& group : labels_) { in write()
105 if(label_map != labels_.end()) { in get_label_private()
213 if(i != labels_.end()) { in clear()
217 i = labels_.find(""); in clear()
218 if(i != labels_.end()) { in clear()
241 labels_.clear(); in clear_all()
246 for(auto& m : labels_) { in recalculate_labels()
279 for(auto& m : labels_) { in recalculate_shroud()
[all …]
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/ |
| H A D | _feature_agglomeration.py | 43 size = np.bincount(self.labels_)
47 [np.bincount(self.labels_, X[i, :]) / size for i in range(n_samples)]
51 self.pooling_func(X[:, self.labels_ == l], axis=1)
52 for l in np.unique(self.labels_)
74 unil, inverse = np.unique(self.labels_, return_inverse=True)
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/platform/text/ |
| H A D | locale_icu_test.cc | 45 Labels(const Vector<String> labels) : labels_(labels) {} in Labels()
49 if (labels_.size() != other.labels_.size()) in operator ==()
51 for (unsigned index = 0; index < labels_.size(); ++index) { in operator ==()
52 if (labels_[index] != other.labels_[index]) in operator ==()
61 for (unsigned index = 0; index < labels_.size(); ++index) { in ToString()
65 builder.Append(labels_[index]); in ToString()
73 Vector<String> labels_; member in blink::LocaleICUTest::Labels
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/platform/text/ |
| H A D | locale_icu_test.cc | 45 Labels(const Vector<String> labels) : labels_(labels) {} in Labels()
49 if (labels_.size() != other.labels_.size()) in operator ==()
51 for (unsigned index = 0; index < labels_.size(); ++index) { in operator ==()
52 if (labels_[index] != other.labels_[index]) in operator ==()
61 for (unsigned index = 0; index < labels_.size(); ++index) { in ToString()
65 builder.Append(labels_[index]); in ToString()
73 Vector<String> labels_; member in blink::LocaleICUTest::Labels
|
| /dports/science/py-dlib/dlib-19.22/dlib/clustering/ |
| H A D | modularity_clustering.h | 414 const std::vector<unsigned long>& labels_ = dlib::impl::remap_labels(labels,num_labels); in modularity() local
434 if (labels_[n1] == labels_[n2]) in modularity()
446 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
448 cluster_sums[labels_[i]] += k[i]; in modularity()
451 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
453 Q -= k[i]*cluster_sums[labels_[i]]/(2*m); in modularity()
488 if (labels_[n1] == labels_[n2]) in modularity()
497 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
499 cluster_sums[labels_[i]] += k[i]; in modularity()
502 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
[all …]
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/clustering/ |
| H A D | modularity_clustering.h | 414 const std::vector<unsigned long>& labels_ = dlib::impl::remap_labels(labels,num_labels); in modularity() local
434 if (labels_[n1] == labels_[n2]) in modularity()
446 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
448 cluster_sums[labels_[i]] += k[i]; in modularity()
451 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
453 Q -= k[i]*cluster_sums[labels_[i]]/(2*m); in modularity()
488 if (labels_[n1] == labels_[n2]) in modularity()
497 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
499 cluster_sums[labels_[i]] += k[i]; in modularity()
502 for (unsigned long i = 0; i < labels_.size(); ++i) in modularity()
[all …]
|