chromium/components/history/core/browser/visit_tracker.cc

// Copyright 2006-2008 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "components/history/core/browser/visit_tracker.h"

#include <stddef.h>

#include <algorithm>

namespace history {

// When the list gets longer than 'MaxItems', CleanupTransitionList will resize
// the list down to 'ResizeTo' size. This is so we only do few block moves of
// the data rather than constantly shuffle stuff around in the vector.
static const size_t kMaxItemsInTransitionList = …;
static const size_t kResizeBigTransitionListTo = …;
static_assert …;

VisitTracker::VisitTracker() { … }

VisitTracker::~VisitTracker() { … }

// This function is potentially slow because it may do up to two brute-force
// searches of the transitions list. This transitions list is kept to a
// relatively small number by CleanupTransitionList so it shouldn't be a big
// deal. However, if this ends up being noticeable for performance, we may want
// to optimize lookup.
VisitID VisitTracker::GetLastVisit(ContextID context_id,
                                   int nav_entry_id,
                                   const GURL& url) { … }

void VisitTracker::AddVisit(ContextID context_id,
                            int nav_entry_id,
                            const GURL& url,
                            VisitID visit_id) { … }

void VisitTracker::RemoveVisitById(VisitID visit_id) { … }

void VisitTracker::Clear() { … }

void VisitTracker::ClearCachedDataForContextID(ContextID context_id) { … }

void VisitTracker::CleanupTransitionList(TransitionList* transitions) { … }

VisitTracker::TransitionList::const_iterator
VisitTracker::FindTransitionListIteratorByVisitId(
    const TransitionList& transitions,
    const Transition& transition_for_search) { … }

}  // namespace history