Proof of concept implementation of context based history filtering.

components/history/core/browser/history_types.h

 // 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.
 
 #ifndef COMPONENTS_HISTORY_CORE_BROWSER_HISTORY_TYPES_H_
 #define COMPONENTS_HISTORY_CORE_BROWSER_HISTORY_TYPES_H_
 
 #include <deque>
 #include <map>
 #include <set>
@@ skipping 79 matching lines @@
 
   // The segment id (see visitsegment_database.*).
   // If 0, the segment id is null in the table.
   SegmentID segment_id;
 
   // Record how much time a user has this visit starting from the user
   // opened this visit to the user closed or ended this visit.
   // This includes both active and inactive time as long as
   // the visit was present.
   base::TimeDelta visit_duration;
-
+  HistoryContext context;
   // Compares two visits based on dates, for sorting.
   bool operator<(const VisitRow& other) {
     return visit_time < other.visit_time;
   }
 
   // We allow the implicit copy constuctor and operator=.
 };
 
 // We pass around vectors of visits a lot
 typedef std::vector<VisitRow> VisitVector;
@@ skipping 123 matching lines @@
   // The time range to search for matches in. The beginning is inclusive and
   // the ending is exclusive. Either one (or both) may be null.
   //
   // This will match only the one recent visit of a URL. For text search
   // queries, if the URL was visited in the given time period, but has also
   // been visited more recently than that, it will not be returned. When the
   // text query is empty, this will return the most recent visit within the
   // time range.
   base::Time begin_time;
   base::Time end_time;
-
+  HistoryContext context;
   // Sets the query time to the last |days_ago| days to the present time.
   void SetRecentDayRange(int days_ago);
 
   // The maximum number of results to return. The results will be sorted with
   // the most recent first, so older results may not be returned if there is not
   // enough room. When 0, this will return everything (the default).
   int max_count;
 
   enum DuplicateHandling {
     // Omit visits for which there is a more recent visit to the same URL.
@@ skipping 261 matching lines @@
   void SetTimeRangeForOneDay(base::Time time);
 
   std::set<GURL> urls;
   base::Time begin_time;
   base::Time end_time;
 };
 
 }  // namespace history
 
 #endif  // COMPONENTS_HISTORY_CORE_BROWSER_HISTORY_TYPES_H_