Home
last modified time | relevance | path

Searched refs:Rescore (Results 1 – 25 of 63) sorted by relevance

123

/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/google/cadvisor/Godeps/_workspace/src/gopkg.in/olivere/elastic.v2/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() interface{} { argument
H A Dsearch_source.go35 rescores []*Rescore
55 rescores: make([]*Rescore, 0),
197 func (s *SearchSource) AddRescore(rescore *Rescore) *SearchSource {
204 s.rescores = make([]*Rescore, 0)
426 rescores := make([]*Rescore, 0)
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/gopkg.in/olivere/elastic.v5/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
H A Dsearch_source.go35 rescores []*Rescore
218 func (s *SearchSource) Rescorer(rescore *Rescore) *SearchSource {
225 s.rescores = make([]*Rescore, 0)
469 var rescores []*Rescore
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/olivere/elastic/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/www/gitea/gitea-1.16.5/vendor/github.com/olivere/elastic/v7/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/gopkg.in/olivere/elastic.v6/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/textproc/gitlab-elasticsearch-indexer/gitlab-elasticsearch-indexer-ef1440548effec15831eda2d246dacc43233cefb/vendor/github.com/olivere/elastic/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/olivere/elastic/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/olivere/elastic/v7/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/gopkg.in/olivere/elastic.v3/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
H A Dsearch_source.go33 rescores []*Rescore
50 rescores: make([]*Rescore, 0),
193 func (s *SearchSource) Rescorer(rescore *Rescore) *SearchSource {
200 s.rescores = make([]*Rescore, 0)
423 var rescores []*Rescore
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/gopkg.in/olivere/elastic.v5/
H A Drescore.go7 type Rescore struct { struct
13 func NewRescore() *Rescore {
14 return &Rescore{}
17 func (r *Rescore) WindowSize(windowSize int) *Rescore { argument
22 func (r *Rescore) IsEmpty() bool { argument
26 func (r *Rescore) Rescorer(rescorer Rescorer) *Rescore { argument
31 func (r *Rescore) Source() (interface{}, error) { argument
H A Dsearch_source.go35 rescores []*Rescore
218 func (s *SearchSource) Rescorer(rescore *Rescore) *SearchSource {
225 s.rescores = make([]*Rescore, 0)
469 var rescores []*Rescore
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/binary_space_tree/
H A Ddual_tree_traverser_impl.hpp138 rightScore = rule.Rescore(queryNode, *referenceNode.Right(), rightScore); in Traverse()
155 leftScore = rule.Rescore(queryNode, *referenceNode.Left(), leftScore); in Traverse()
180 rightScore = rule.Rescore(queryNode, *referenceNode.Right(), in Traverse()
216 rightScore = rule.Rescore(*queryNode.Left(), *referenceNode.Right(), in Traverse()
234 leftScore = rule.Rescore(*queryNode.Left(), *referenceNode.Left(), in Traverse()
261 rightScore = rule.Rescore(*queryNode.Left(), *referenceNode.Right(), in Traverse()
294 rightScore = rule.Rescore(*queryNode.Right(), *referenceNode.Right(), in Traverse()
312 leftScore = rule.Rescore(*queryNode.Right(), *referenceNode.Left(), in Traverse()
339 rightScore = rule.Rescore(*queryNode.Right(), *referenceNode.Right(), in Traverse()
H A Dsingle_tree_traverser_impl.hpp82 rightScore = rule.Rescore(queryIndex, *referenceNode.Right(), rightScore); in Traverse()
95 leftScore = rule.Rescore(queryIndex, *referenceNode.Left(), leftScore); in Traverse()
114 rightScore = rule.Rescore(queryIndex, *referenceNode.Right(), in Traverse()
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/spill_tree/
H A Dspill_dual_tree_traverser_impl.hpp177 rightScore = rule.Rescore(queryNode, *referenceNode.Right(), in Traverse()
195 leftScore = rule.Rescore(queryNode, *referenceNode.Left(), leftScore); in Traverse()
220 rightScore = rule.Rescore(queryNode, *referenceNode.Right(), in Traverse()
290 rightScore = rule.Rescore(*queryNode.Left(), *referenceNode.Right(), in Traverse()
308 leftScore = rule.Rescore(*queryNode.Left(), *referenceNode.Left(), in Traverse()
335 rightScore = rule.Rescore(*queryNode.Left(), *referenceNode.Right(), in Traverse()
368 rightScore = rule.Rescore(*queryNode.Right(), *referenceNode.Right(), in Traverse()
386 leftScore = rule.Rescore(*queryNode.Right(), *referenceNode.Left(), in Traverse()
413 rightScore = rule.Rescore(*queryNode.Right(), *referenceNode.Right(), in Traverse()
H A Dspill_single_tree_traverser_impl.hpp87 rightScore = rule.Rescore(queryIndex, *referenceNode.Right(), in Traverse()
101 leftScore = rule.Rescore(queryIndex, *referenceNode.Left(), leftScore); in Traverse()
120 rightScore = rule.Rescore(queryIndex, *referenceNode.Right(), in Traverse()
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/kde/
H A Dkde_rules.hpp70 double Rescore(const size_t queryIndex,
78 double Rescore(TreeType& queryNode,
202 double Rescore(const size_t /* queryIndex */, in Rescore() function in mlpack::kde::KDECleanRules
210 double Rescore(TreeType& /* queryNode */, in Rescore() function in mlpack::kde::KDECleanRules
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/emst/
H A Ddtb_rules.hpp56 double Rescore(const size_t queryIndex,
81 double Rescore(TreeType& queryNode,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/range_search/
H A Drange_search_rules.hpp81 double Rescore(const size_t queryIndex,
106 double Rescore(TreeType& queryNode,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/kmeans/
H A Ddual_tree_kmeans_rules.hpp40 double Rescore(const size_t queryIndex,
43 double Rescore(TreeType& queryNode,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/fastmks/
H A Dfastmks_rules.hpp93 double Rescore(const size_t queryIndex,
108 double Rescore(TreeType& queryNode,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/
H A Dneighbor_search_rules.hpp113 double Rescore(const size_t queryIndex,
138 double Rescore(TreeType& queryNode,
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/rann/
H A Dra_search_rules.hpp155 double Rescore(const size_t queryIndex,
225 double Rescore(TreeType& queryNode,

123