代码拉取完成,页面将自动刷新
// Copyright 2013 Hui Chen
// Copyright 2016 ego authors
//
// Licensed under the Apache License, Version 2.0 (the "License"): you may
// not use this file except in compliance with the License. You may obtain
// a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations
// under the License.
package riot
import (
"github.com/go-ego/riot/types"
)
type rankerAddDocReq struct {
docId string
fields interface{}
// new
content string
// new 属性
attri interface{}
}
type rankerRankReq struct {
docs []types.IndexedDoc
options types.RankOpts
rankerReturnChan chan rankerReturnReq
countDocsOnly bool
}
type rankerReturnReq struct {
// docs types.ScoredDocs
docs interface{}
numDocs int
}
type rankerRemoveDocReq struct {
docId string
}
func (engine *Engine) rankerAddDoc(shard int) {
for {
request := <-engine.rankerAddDocChans[shard]
if engine.initOptions.IDOnly {
engine.rankers[shard].AddDoc(request.docId, request.fields)
} else {
engine.rankers[shard].AddDoc(request.docId, request.fields,
request.content, request.attri)
}
}
}
func (engine *Engine) rankerRank(shard int) {
for {
request := <-engine.rankerRankChans[shard]
if request.options.MaxOutputs != 0 {
request.options.MaxOutputs += request.options.OutputOffset
}
request.options.OutputOffset = 0
outputDocs, numDocs := engine.rankers[shard].Rank(request.docs,
request.options, request.countDocsOnly)
request.rankerReturnChan <- rankerReturnReq{
docs: outputDocs, numDocs: numDocs}
}
}
func (engine *Engine) rankerRemoveDoc(shard int) {
for {
request := <-engine.rankerRemoveDocChans[shard]
engine.rankers[shard].RemoveDoc(request.docId)
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。