Home
last modified time | relevance | path

Searched refs:subCost (Results 1 – 25 of 102) sorted by relevance

12345

/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/agext/levenshtein/
H A Dparams_test.go37 if p.subCost != 1 {
38 t.Errorf(`NewParams().subCost == %v, want %v`, p.subCost, 1)
66 if p = NewParams().SubCost(3); p.subCost != 3 {
67 t.Errorf(`NewParams().SubCost(3).subCost == %v, want %v`, p.subCost, 3)
69 if p = NewParams().SubCost(-3); p.subCost != 1 {
70 t.Errorf(`NewParams().SubCost(-3).subCost == %v, want %v`, p.subCost, 1)
124 if p2.subCost != 1 {
125 t.Errorf(`nil.Clone().subCost == %v, want %v`, p2.subCost, 1)
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/terraform-switcher/terraform-switcher-0.13.1201/vendor/github.com/agext/levenshtein/
H A Dparams_test.go37 if p.subCost != 1 {
38 t.Errorf(`NewParams().subCost == %v, want %v`, p.subCost, 1)
66 if p = NewParams().SubCost(3); p.subCost != 3 {
67 t.Errorf(`NewParams().SubCost(3).subCost == %v, want %v`, p.subCost, 3)
69 if p = NewParams().SubCost(-3); p.subCost != 1 {
70 t.Errorf(`NewParams().SubCost(-3).subCost == %v, want %v`, p.subCost, 1)
124 if p2.subCost != 1 {
125 t.Errorf(`nil.Clone().subCost == %v, want %v`, p2.subCost, 1)
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/terraform-docs/terraform-docs-0.16.0/vendor/github.com/agext/levenshtein/
H A Dparams_test.go37 if p.subCost != 1 {
38 t.Errorf(`NewParams().subCost == %v, want %v`, p.subCost, 1)
66 if p = NewParams().SubCost(3); p.subCost != 3 {
67 t.Errorf(`NewParams().SubCost(3).subCost == %v, want %v`, p.subCost, 3)
69 if p = NewParams().SubCost(-3); p.subCost != 1 {
70 t.Errorf(`NewParams().SubCost(-3).subCost == %v, want %v`, p.subCost, 1)
124 if p2.subCost != 1 {
125 t.Errorf(`nil.Clone().subCost == %v, want %v`, p2.subCost, 1)
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/agext/levenshtein/
H A Dparams_test.go37 if p.subCost != 1 {
38 t.Errorf(`NewParams().subCost == %v, want %v`, p.subCost, 1)
66 if p = NewParams().SubCost(3); p.subCost != 3 {
67 t.Errorf(`NewParams().SubCost(3).subCost == %v, want %v`, p.subCost, 3)
69 if p = NewParams().SubCost(-3); p.subCost != 1 {
70 t.Errorf(`NewParams().SubCost(-3).subCost == %v, want %v`, p.subCost, 1)
124 if p2.subCost != 1 {
125 t.Errorf(`nil.Clone().subCost == %v, want %v`, p2.subCost, 1)
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/nomad/vendor/github.com/agext/levenshtein/
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/nomad/nomad-1.1.0/vendor/github.com/agext/levenshtein/
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/terraform-provider-gridscale/terraform-provider-gridscale-1.6.2/vendor/github.com/agext/levenshtein/
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/sysutils/terraform-provider-vultr/terraform-provider-vultr-0.1.10/vendor/github.com/agext/levenshtein/
H A Dlevenshtein.go37 func Calculate(str1, str2 []rune, maxCost, insCost, subCost, delCost int) (dist, prefixLen, suffixL… argument
74 if subCost < delCost+insCost {
75 if maxCost >= l1*subCost+(l2-l1)*insCost {
113 dy += subCost
124 dy += subCost
136 dy += subCost
176 dy += subCost
200 dist, _, _ := Calculate([]rune(str1), []rune(str2), p.maxCost, p.insCost, p.subCost, p.delCost)
249 if p.subCost < delCost+insCost {
250 maxDist = l1*p.subCost + (l2-l1)*insCost
[all …]
H A Dparams.go21 subCost int member
38 subCost: 1,
56 subCost: p.subCost,
79 p.subCost = v
/dports/devel/kcachegrind/kcachegrind-21.12.3/cgview/
H A Dmain.cpp87 out << d->subCost(et).pretty(); in main()
95 out << d->subCost(et).pretty(); in main()
130 hc.addCost(f, f->subCost(et)); in main()
132 hc.addCost(f, f->inclusive()->subCost(et)); in main()
148 out << c->subCost(et).pretty(); in main()
159 out << f->inclusive()->subCost(et).pretty(); in main()
160 out << f->subCost(et).pretty(); in main()
170 out << c->subCost(et).pretty(); in main()
/dports/devel/kcachegrind/kcachegrind-21.12.3/libviews/
H A Dpartgraph.cpp230 return (double)_data->subCost(w->eventType()); in value()
258 v = _p->subCost(ct); in text()
262 double p = 100.0 * v / t->subCost(ct); in text()
293 return (double) pf->inclusive()->subCost(ct); in value()
298 return (double) _p->subCost(ct); in value()
422 v = ((TracePartFunction*)_partCostItem)->inclusive()->subCost(ct); in text()
424 v = _partCostItem->subCost(ct); in text()
429 double p = 100.0 * v / t->subCost(ct); in text()
452 return costPixmap( ct, c, (double) (t->subCost(ct)), false ); in pixmap()
463 ((TracePartFunction*)_partCostItem)->inclusive()->subCost(ct); in value()
[all …]
H A Dcallmapview.cpp639 double sum, total = t->subCost(ct); in text()
670 return (double) _f->inclusive()->subCost(ct); in value()
776 SubCost val = SubCost(_factor * _c->subCost(ct)); in text()
780 double p = 100.0 * _factor * _c->subCost(ct) / t->subCost(ct); in text()
805 return _factor * _c->subCost(ct); in value()
829 SubCost s = _c->called()->inclusive()->subCost(ct); in children()
830 SubCost v = _c->subCost(ct); in children()
895 SubCost val = SubCost(_factor * _c->subCost(ct)); in text()
898 double p = 100.0 * _factor * _c->subCost(ct) / t->subCost(ct); in text()
922 return (double) _c->subCost(ct); in value()
[all …]
H A Dstackitem.cpp76 _sum = _call->subCost(ct); in updateCost()
77 double total = _call->called()->data()->subCost(ct); in updateCost()
98 _sum = _call->subCost(ct2); in updateCost()
99 total = _call->called()->data()->subCost(ct2); in updateCost()
/dports/devel/kcachegrind/kcachegrind-21.12.3/libcore/
H A Dcoverage.cpp99 incl = (double) (_function->inclusive()->subCost(_costType)); in addCallerCoverage()
137 if (call->subCost(_costType)>0) { in addCallerCoverage()
153 callVal = (double) call->subCost(_costType); in addCallerCoverage()
196 incl = (double) (_function->inclusive()->subCost(_costType)); in addCallingCoverage()
219 self = pForward * (_function->subCost(_costType)) / incl; in addCallingCoverage()
248 if (call->subCost(_costType)>0) { in addCallingCoverage()
264 callVal = (double) call->subCost(_costType); in addCallingCoverage()
267 calling->inclusive()->subCost(_costType)); in addCallingCoverage()

12345