HomeSort by relevance Sort by last modified time
    Searched refs:prefixes (Results 1 - 25 of 176) sorted by null

1 2 3 4 5 6 7 8

  /packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/
PrefixFileFilter.java 49 /** The filename prefixes to search for */
50 private final String[] prefixes; field in class:PrefixFileFilter
78 this.prefixes = new String[] {prefix};
83 * Constructs a new Prefix file filter for any of an array of prefixes.
88 * @param prefixes the prefixes to allow, must not be null
91 public PrefixFileFilter(String[] prefixes) {
92 this(prefixes, IOCase.SENSITIVE);
96 * Constructs a new Prefix file filter for any of an array of prefixes
102 * @param prefixes the prefixes to allow, must not be null
    [all...]
  /external/chromium_org/chrome/browser/autocomplete/
url_prefix.cc 18 CR_DEFINE_STATIC_LOCAL(URLPrefixes, prefixes, ());
19 if (prefixes.empty()) {
20 prefixes.push_back(URLPrefix(ASCIIToUTF16("https://www."), 2));
21 prefixes.push_back(URLPrefix(ASCIIToUTF16("http://www."), 2));
22 prefixes.push_back(URLPrefix(ASCIIToUTF16("ftp://ftp."), 2));
23 prefixes.push_back(URLPrefix(ASCIIToUTF16("ftp://www."), 2));
24 prefixes.push_back(URLPrefix(ASCIIToUTF16("https://"), 1));
25 prefixes.push_back(URLPrefix(ASCIIToUTF16("http://"), 1));
26 prefixes.push_back(URLPrefix(ASCIIToUTF16("ftp://"), 1));
27 prefixes.push_back(URLPrefix(string16(), 0))
    [all...]
  /external/chromium_org/chrome/browser/safe_browsing/
prefix_set_unittest.cc 30 // Generate a set of random prefixes to share between tests. For
42 // Check that all elements of |prefixes| are in |prefix_set|, and
46 const std::vector<SBPrefix> &prefixes) {
47 // The set can generate the prefixes it believes it has, so that's
49 std::set<SBPrefix> check(prefixes.begin(), prefixes.end());
55 for (size_t i = 0; i < prefixes.size(); ++i) {
56 EXPECT_TRUE(prefix_set.Exists(prefixes[i]));
58 const SBPrefix left_sibling = prefixes[i] - 1;
62 const SBPrefix right_sibling = prefixes[i] + 1
188 std::vector<SBPrefix> prefixes; local
215 std::vector<SBPrefix> prefixes; local
246 std::vector<SBPrefix> prefixes; local
329 std::vector<SBPrefix> prefixes; local
343 std::vector<SBPrefix> prefixes; local
    [all...]
prefix_set.h 5 // A read-only set implementation for |SBPrefix| items. Prefixes are
19 // prefixes of a certain size. As of this writing, my safe-browsing
21 // 653132 add prefixes
32 // overhead starts to become a problem a bit under 200k prefixes. The
34 // 75k prefixes. Fortunately, the actual memory footprint also falls.
67 // |true| if |prefix| was in |prefixes| passed to the constructor.
74 // Regenerate the vector of prefixes passed to the constructor into
75 // |prefixes|. Prefixes will be added in sorted order.
76 void GetPrefixes(std::vector<SBPrefix>* prefixes) const
    [all...]
safe_browsing_database_unittest.cc 81 // Same as InsertAddChunkHostPrefixUrl, but with two urls for prefixes.
146 // Same as InsertSubChunkHostPrefixUrl, but with two urls for prefixes.
631 // Test removing all the prefixes from an add chunk.
847 std::vector<SBPrefix> prefixes; local
848 database_->CacheHashResults(prefixes, results);
859 std::vector<SBPrefix> prefixes; local
863 &listname, &prefixes, &full_hashes, Time::Now());
868 prefixes.clear();
874 &listname, &prefixes, &full_hashes, Time::Now());
879 prefixes.clear()
1514 std::vector<SBPrefix> prefixes; local
    [all...]
  /external/chromium/chrome/browser/safe_browsing/
prefix_set_unittest.cc 29 // Generate a set of random prefixes to share between tests. For
41 // Check that all elements of |prefixes| are in |prefix_set|, and
45 const std::vector<SBPrefix> &prefixes) {
46 // The set can generate the prefixes it believes it has, so that's
48 std::set<SBPrefix> check(prefixes.begin(), prefixes.end());
54 for (size_t i = 0; i < prefixes.size(); ++i) {
55 EXPECT_TRUE(prefix_set->Exists(prefixes[i]));
57 const SBPrefix left_sibling = prefixes[i] - 1;
61 const SBPrefix right_sibling = prefixes[i] + 1
185 std::vector<SBPrefix> prefixes; local
212 std::vector<SBPrefix> prefixes; local
243 std::vector<SBPrefix> prefixes; local
438 std::vector<SBPrefix> prefixes; local
    [all...]
filter_false_positive_perftest.cc 103 // Constructs a bloom filter of the appropriate size from the provided prefixes.
105 const std::vector<SBPrefix>& prefixes,
108 const int key_count = std::max(static_cast<int>(prefixes.size()),
113 // Add the prefixes to it.
114 for (size_t i = 0; i < prefixes.size(); ++i)
115 (*bloom_filter)->Insert(prefixes[i]);
117 std::cout << "Bloom filter with prefixes: " << prefixes.size()
123 // Reads the set of add prefixes contained in a SafeBrowsing database into a
126 bool ReadDatabase(const FilePath& path, std::vector<SBPrefix>* prefixes) {
251 std::vector<SBPrefix> prefixes; local
    [all...]
prefix_set.h 5 // A read-only set implementation for |SBPrefix| items. Prefixes are
19 // prefixes of a certain size. As of this writing, my safe-browsing
21 // 653132 add prefixes
32 // overhead starts to become a problem a bit under 200k prefixes. The
34 // 75k prefixes. Fortunately, the actual memory footprint also falls.
66 // |true| if |prefix| was in |prefixes| passed to the constructor.
73 // Regenerate the vector of prefixes passed to the constructor into
74 // |prefixes|. Prefixes will be added in sorted order.
75 void GetPrefixes(std::vector<SBPrefix>* prefixes) const
    [all...]
safe_browsing_database.cc 67 // |include_whitelist_hashes| is true we will generate additional path-prefixes
111 // Get the prefixes matching the download |urls|.
113 std::vector<SBPrefix>* prefixes) {
119 prefixes->push_back(full_hashes[i].prefix);
262 // |prefixes|. For now, |prefixes| is useful while debugging
264 std::vector<SBPrefix> prefixes; local
266 prefixes.push_back(add_prefixes[i].prefix);
269 std::sort(prefixes.begin(), prefixes.end())
1049 std::vector<SBAddPrefix> prefixes; local
    [all...]
safe_browsing_database_unittest.cc 81 // Same as InsertAddChunkHostPrefixUrl, but with two urls for prefixes.
146 // Same as InsertSubChunkHostPrefixUrl, but with two urls for prefixes.
623 // Test removing all the prefixes from an add chunk.
839 std::vector<SBPrefix> prefixes; local
840 database_->CacheHashResults(prefixes, results);
851 std::vector<SBPrefix> prefixes; local
855 &listname, &prefixes, &full_hashes, Time::Now());
860 prefixes.clear();
866 &listname, &prefixes, &full_hashes, Time::Now());
871 prefixes.clear()
1397 std::vector<SBPrefix> prefixes; local
    [all...]
safe_browsing_database.h 85 // prefixes. This function is safe to call from threads other than
94 // true, |prefix_hits| should contain the prefixes for the URLs that were in
138 // cache the prefixes until the next update so that we don't have to issue
141 const std::vector<SBPrefix>& prefixes,
223 virtual void CacheHashResults(const std::vector<SBPrefix>& prefixes,
272 // Helper function to compare addprefixes in download_store_ with |prefixes|.
276 // matching prefixes.
278 const std::vector<SBPrefix>& prefixes,
292 // For browsing related (phishing and malware URLs) chunks and prefixes.
296 // For download related (download URL and binary hash) chunks and prefixes
    [all...]
  /libcore/luni/src/test/java/tests/api/org/xml/sax/helpers/
NamespaceSupportTest.java 56 Enumeration<String> prefixes = ns.getDeclaredPrefixes(); local
58 while (prefixes.hasMoreElements()) {
59 prefix = prefixes.nextElement();
126 // Part 1: Check that xml and xmlns are not accepted as prefixes.
134 // prefixes.
161 ArrayList<String> prefixes; local
163 prefixes = Collections.list(ns.getPrefixes(marketUri));
164 assertTrue("Test 1: Incorrect set of prefixes returned.",
165 expected.containsAll(prefixes) && prefixes.containsAll(expected))
182 ArrayList<String> prefixes; local
193 ArrayList<String> prefixes; local
315 ArrayList<String> prefixes = Collections.list(ns.getPrefixes()); local
    [all...]
  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/geocoding/
geocoding_data.h 34 // Sorted array of phone number prefixes.
35 const int32* prefixes; member in struct:i18n::phonenumbers::PrefixDescriptions
37 // Number of elements in prefixes.
41 // to prefixes.
default_map_storage.cc 45 prefixes_ = descriptions->prefixes;
  /external/elfutils/libcpu/
i386_data.h 38 /* The rep/repe prefixes. */
88 if (*d->prefixes & has_cs)
91 *d->prefixes &= ~has_cs;
93 else if (*d->prefixes & has_ds)
96 *d->prefixes &= ~has_ds;
98 else if (*d->prefixes & has_es)
101 *d->prefixes &= ~has_es;
103 else if (*d->prefixes & has_fs)
106 *d->prefixes &= ~has_fs;
108 else if (*d->prefixes & has_gs
160 int prefixes = *d->prefixes; local
936 int prefixes = *d->prefixes; local
1016 int prefixes = *d->prefixes; local
    [all...]
i386_disasm.c 257 int *prefixes; member in struct:output_data
314 int prefixes; local
322 .prefixes = &prefixes,
333 prefixes = 0;
338 /* Recognize all prefixes. */
349 prefixes |= last_prefix_bit = 1 << i;
356 prefixes |= ((*data++) & 0xf) | has_rex;
368 if (prefixes != 0)
426 || (prefixes & correct_prefix) != 0)
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/
NamespaceSupport.java 156 // ignore "xml" and "xmlns" prefixes
252 String[] prefixes = new String[fNamespaceSize]; local
253 fPrefixes = prefixes;
270 return new Prefixes(fPrefixes, count);
273 protected final class Prefixes implements Enumeration {
274 private String[] prefixes; field in class:NamespaceSupport.Prefixes
279 * Constructor for Prefixes.
281 public Prefixes(String [] prefixes, int size) {
282 this.prefixes = prefixes;
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
NamespaceMappings.java 56 * processed. At any given moment of processing the currently visible prefixes
67 * This member is continually incremented when new prefixes need to be
91 * All prefixes pushed at the current depth can be
168 Enumeration prefixes = m_namespaces.keys(); local
169 while (prefixes.hasMoreElements())
171 String prefix = (String) prefixes.nextElement();
185 Enumeration prefixes = m_namespaces.keys(); local
186 while (prefixes.hasMoreElements())
188 String prefix = (String) prefixes.nextElement();
204 // Prefixes "xml" and "xmlns" cannot be redefine
486 Enumeration prefixes = m_namespaces.keys(); local
    [all...]
  /external/qemu/
i386-dis.c 241 /* Flags for the prefixes for the current instruction. See below. */
242 static int prefixes; variable
263 /* Flags for prefixes which we somehow handled when printing the
267 /* Flags stored in PREFIXES. */
467 #define v_mode 2 /* operand size depends on prefixes */
476 #define dq_mode 11 /* operand size depends on REX prefixes. */
481 #define z_mode 16 /* non-quad operand size depends on prefixes */
    [all...]
  /libcore/luni/src/main/java/org/xml/sax/helpers/
ParserAdapter.java 158 private static final String NAMESPACE_PREFIXES = FEATURES + "namespace-prefixes";
166 * namespace-prefixes.</p>
182 if (!namespaces && !prefixes) {
183 prefixes = true;
187 prefixes = value;
188 if (!prefixes && !namespaces) {
204 * namespace-prefixes.</p>
220 return prefixes;
555 if (prefixes) {
624 Enumeration prefixes = nsSupport.getDeclaredPrefixes()
622 Enumeration prefixes = nsSupport.getDeclaredPrefixes(); local
825 private boolean prefixes = false; field in class:ParserAdapter
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/
ConfigResults.java 169 * Returns a list of build results which names starts with one of the given prefixes.
171 * @param prefixes List of expected prefixes
174 public List getBuildsMatchingPrefixes(List prefixes) {
177 int length = prefixes.size();
182 if (buildName.startsWith((String)prefixes.get(j))) {
392 * prefixes.
394 * @param prefixes List of prefixes to filter builds. If <code>null</code>
404 public double[] getStatistics(List prefixes) {
    [all...]
  /frameworks/base/core/java/android/text/util/
Linkify.java 398 private static final String makeUrl(String url, String[] prefixes,
406 for (int i = 0; i < prefixes.length; i++) {
407 if (url.regionMatches(true, 0, prefixes[i], 0,
408 prefixes[i].length())) {
412 if (!url.regionMatches(false, 0, prefixes[i], 0,
413 prefixes[i].length())) {
414 url = prefixes[i] + url.substring(prefixes[i].length());
422 url = prefixes[0] + url;
  /external/chromium_org/ppapi/tests/
test_case.cc 20 const char* const prefixes[] = { local
22 for (size_t i = 0; i < sizeof(prefixes)/sizeof(prefixes[0]); ++i)
23 if (test_name.find(prefixes[i]) == 0)
24 return test_name.substr(strlen(prefixes[i]));
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
insn.c 141 insn->prefixes =
142 yasm_xrealloc(insn->prefixes,
144 insn->prefixes[insn->num_prefixes] = prefix;
162 insn->prefixes = NULL;
195 yasm_xfree(insn->prefixes);
  /external/chromium_org/third_party/mesa/src/scons/
crossmingw.py 68 prefixes = prefixes64
70 prefixes = prefixes32
71 for prefix in prefixes:

Completed in 1066 milliseconds

1 2 3 4 5 6 7 8