HomeSort by relevance Sort by last modified time
    Searched defs:Snippet (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
SnippetStorage.js 61 * @return {Array.<WebInspector.Snippet>}
73 * @return {WebInspector.Snippet}
82 * @return {WebInspector.Snippet}
97 this._snippetAdded(WebInspector.Snippet.fromObject(this, savedSnippets[i]));
101 * @param {WebInspector.Snippet} snippet
103 deleteSnippet: function(snippet)
105 delete this._snippets[snippet.id];
110 * @return {WebInspector.Snippet}
117 var snippet = new WebInspector.Snippet(this, snippetId)
    [all...]
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_virtual_range/d/
Snippet.java 3 public class Snippet {
  /external/chromium/chrome/browser/history/
snippet.h 16 class Snippet {
44 Snippet::MatchPositions* match_positions);
46 Snippet();
47 ~Snippet();
49 // Given |matches|, the match positions within |document|, compute the snippet
59 // Efficiently swaps the contents of this snippet with the other.
60 void Swap(Snippet* other);
63 // The text of the snippet.
snippet.cc 5 #include "chrome/browser/history/snippet.h"
20 bool PairFirstLessThan(const Snippet::MatchPosition& a,
21 const Snippet::MatchPosition& b) {
28 Snippet::MatchPositions* match_positions) {
30 Snippet::MatchPosition& pair((*match_positions)[offset]);
44 Snippet::MatchPositions* match_positions) {
47 Snippet::MatchPosition pair(start, end);
54 Snippet::MatchPositions::iterator i =
128 // snippet generation. If not, revisit the way we scan in ComputeSnippet.
138 // Returns true if next match falls within a snippet windo
230 string16 snippet; local
    [all...]
  /external/chromium_org/chrome/browser/history/
snippet.h 15 class Snippet {
43 Snippet::MatchPositions* match_positions);
45 Snippet();
46 ~Snippet();
48 // Given |matches|, the match positions within |document|, compute the snippet
58 // Efficiently swaps the contents of this snippet with the other.
59 void Swap(Snippet* other);
62 // The text of the snippet.
snippet.cc 5 #include "chrome/browser/history/snippet.h"
20 bool PairFirstLessThan(const Snippet::MatchPosition& a,
21 const Snippet::MatchPosition& b) {
28 Snippet::MatchPositions* match_positions) {
30 Snippet::MatchPosition& pair((*match_positions)[offset]);
44 Snippet::MatchPositions* match_positions) {
47 Snippet::MatchPosition pair(start, end);
54 Snippet::MatchPositions::iterator i =
128 // snippet generation. If not, revisit the way we scan in ComputeSnippet.
138 // Returns true if next match falls within a snippet windo
230 string16 snippet; local
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp     [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
fts1.c 202 /* TODO(shess) The snippet-generation code should be using the
1004 typedef struct Snippet {
1016 char *zSnippet; /* Snippet text */
1018 } Snippet;
1111 Snippet snippet; \/* Cached snippet for the current row *\/ member in struct:fulltext_cursor
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2.c 366 /* TODO(shess) The snippet-generation code should be using the
2069 Snippet snippet; \/* Cached snippet for the current row *\/ member in struct:fulltext_cursor
    [all...]

Completed in 2394 milliseconds