File: scoring_functor.h

package info (click to toggle)
chromium 138.0.7204.183-1~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 6,080,960 kB
  • sloc: cpp: 34,937,079; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,954; asm: 946,768; xml: 739,971; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,811; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (34 lines) | stat: -rw-r--r-- 1,077 bytes parent folder | download | duplicates (7) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
 
// Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef COMPONENTS_OMNIBOX_BROWSER_SCORING_FUNCTOR_H_
#define COMPONENTS_OMNIBOX_BROWSER_SCORING_FUNCTOR_H_

#include <stddef.h>

#include "components/query_parser/snippet.h"

// `for_each()` helper functor to score how similar an input and suggestion text
// are. Can be used for titles or URLs. For each string match, computes the
// product of:
// 1) how many characters matched; this will range (0, `length_`].
// 2) where the match is positioned (0, 1].
// These products are summed; this too will range (0, `length_`].
class ScoringFunctor {
 public:
  // `length` is the length of the suggestion text.
  explicit ScoringFunctor(size_t length);

  // Called for each match.
  void operator()(const query_parser::Snippet::MatchPosition& match);

  // Returns the accumulated score.
  double ScoringFactor();

 private:
  double length_;
  double scoring_factor_ = 0;
};

#endif  // COMPONENTS_OMNIBOX_BROWSER_SCORING_FUNCTOR_H_