blob: 767a1907d0613dcc90a0c423bedf52f2ecd7b797 [file] [log] [blame]
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <stddef.h>
#include <cstddef>
#include <utility>
#include <vector>
namespace bookmarks {
class TitledUrlNode;
struct TitledUrlMatch {
// Each MatchPosition is the [begin, end) positions of a match within a
// string.
using MatchPosition = std::pair<size_t, size_t>;
using MatchPositions = std::vector<MatchPosition>;
TitledUrlMatch(const TitledUrlMatch& other);
// Extracts and returns the offsets from |match_positions|.
static std::vector<size_t> OffsetsFromMatchPositions(
const MatchPositions& match_positions);
// Replaces the offsets in |match_positions| with those given in |offsets|,
// deleting any which are npos, and returns the updated list of match
// positions.
static MatchPositions ReplaceOffsetsInMatchPositions(
const MatchPositions& match_positions,
const std::vector<size_t>& offsets);
// The matching node of a query.
const TitledUrlNode* node;
// Location of the matching words in the title of the node.
MatchPositions title_match_positions;
// Location of the matching words in the URL of the node.
MatchPositions url_match_positions;
} // namespace bookmarks