Home
last modified time | relevance | path

Searched full:search (Results 1 – 25 of 5816) sorted by relevance

12345678910>>...233

/third_party/curl/packages/vms/
Dclean_gnv_curl.com45 $ if f$search(file) .nes. "" then delete 'file';*
48 $ if f$search(file) .nes. "" then delete 'file';*
51 $ if f$search(file) .nes. "" then delete 'file';*
54 $ if f$search(file) .nes. "" then delete 'file';*
57 $ if f$search(file) .nes. "" then delete 'file';*
60 $ if f$search(file) .nes. "" then delete 'file';*
64 $ if f$search(file) .nes. "" then delete 'file';*
66 $ if f$search(file) .nes. "" then delete 'file';*
70 $ if f$search(file) .nes. "" then delete 'file';*
72 $ if f$search(file) .nes. "" then delete 'file';*
[all …]
/third_party/jerryscript/tests/jerry/es2015/
Dsymbol-search.js15 var search = RegExp.prototype[Symbol.search]; variable
18 search.call (0, "string");
25 search.call (new RegExp(), {
36 search.call ({
47 search.call ({
61 search.call ({
72 search.call ({
81 search.call ({
90 search.call ({
101 search.call ({
[all …]
/third_party/node/deps/npm/man/man1/
Dnpm-search.11 .TH "NPM\-SEARCH" "1" "April 2022" "" ""
3 \fBnpm-search\fR \- Search for packages
8 npm search [\-l|\-\-long] [\-\-json] [\-\-parseable] [\-\-no\-description] [search terms \.\.\.]
15 Search the registry for packages matching the search terms\. \fBnpm search\fP
16 performs a linear, incremental, lexically\-ordered search through package
21 more search terms will respectively include and exclude further patterns\. The
22 main difference between \fB\-\-searchopts\fP and the standard search terms is that the
25 default search filtering behavior\.
27 Search also allows targeting of maintainers in search results, by prefixing
45 Used as \fB\-\-no\-description\fP, disables search matching in package descriptions and
[all …]
/third_party/node/deps/npm/docs/content/cli-commands/
Dnpm-search.md3 title: npm-search
4 description: Search for packages
7 # npm-search(1)
9 ## Search for packages
14 npm search [-l|--long] [--json] [--parseable] [--no-description] [search terms ...]
21 Search the registry for packages matching the search terms. `npm search`
22 performs a linear, incremental, lexically-ordered search through package
27 more search terms will respectively include and exclude further patterns. The
28 main difference between `--searchopts` and the standard search terms is that the
31 default search filtering behavior.
[all …]
/third_party/python/Lib/idlelib/
Dsearch.py1 """Search dialog for Find, Find Again, and Find Selection
5 to prepare search pattern.
28 """Open the search dialog.
32 used as the search phrase; otherwise, the previous entry
33 is used. No search is done with this command.
39 """Repeat the search for the last pattern and preferences.
42 instance to search again using the user entries and preferences
43 from the last dialog. If there was no prior search, open the
44 search dialog; otherwise, perform the search without showing the
50 """Search for the selected pattern in the text.
[all …]
/third_party/libxml2/doc/
Dsearches.html10 …Search statistics for 20040408</title></head><body bgcolor="#8b7765" text="#000000" link="#a06060"…
11 …9875 uniq words.</p><p> Top 50 queries:</p><p><br /><a href="search.php?query=libxml2">libxml2</a>…
12 <br /><a href="search.php?query=libxml">libxml</a> 10170 times.
13 <br /><a href="search.php?query=xpath">xpath</a> 6172 times.
14 <br /><a href="search.php?query=schema">schema</a> 5798 times.
15 <br /><a href="search.php?query=xmllint">xmllint</a> 5472 times.
16 <br /><a href="search.php?query=XML">XML</a> 5435 times.
17 <br /><a href="search.php?query=xmlParseFile">xmlParseFile</a> 4219 times.
18 <br /><a href="search.php?query=php">php</a> 3935 times.
19 <br /><a href="search.php?query=DTD">DTD</a> 3270 times.
[all …]
/third_party/icu/docs/userguide/collation/
Dstring-search.md3 title: String Search
12 # String Search Service
27 the basic string search algorithm in the implementations on most operating
30 Therefore, a string search algorithm that is language-aware has become more
49 special "search" collator with the appropriate level settings for search.
63 example, a user may search for "blackbird" and want to include entries such
66 ## ICU String Search Model
68 The ICU string search service provides similar APIs to the other text iterating
76 The string search service supports two different types of canonical match
100 character exists in the future, the string search service may not work correctly
[all …]
/third_party/node/test/fixtures/wpt/url/resources/
Durltestdata.json15 "search": "", string
30 "search": "?b", string
45 "search": "", string
60 "search": "", string
75 "search": "", string
90 "search": "", string
105 "search": "", string
120 "search": "", string
135 "search": "", string
150 "search": "", string
[all …]
/third_party/ltp/testcases/kernel/security/integrity/ima/tests/
Dima_violations.sh64 local search="$1"
65 echo $(grep -c "$search.*$FILE" $LOG)
72 local search="$3"
78 count2="$(get_count $search)"
81 tst_res TPASS "$search violation added"
84 tst_res TINFO "$search not found in $LOG ($i/$max_attempt attempt)..."
88 tst_res TFAIL "$search violation not added"
92 tst_res TFAIL "$search not found in $LOG"
99 local search="open_writers"
103 count="$(get_count $search)"
[all …]
/third_party/boost/libs/range/test/algorithm_test/
Dsearch.cpp11 #include <boost/range/algorithm/search.hpp>
35 iterator1_t it = boost::search(cont1, cont2); in test_search_impl()
36 BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1), cont2) ); in test_search_impl()
37 BOOST_CHECK( it == boost::search(cont1, boost::make_iterator_range(cont2)) ); in test_search_impl()
38 BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1), in test_search_impl()
40 iterator1_t it2 = boost::search(cont1, ccont2); in test_search_impl()
41 BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1), ccont2) ); in test_search_impl()
42 BOOST_CHECK( it2 == boost::search(cont1, boost::make_iterator_range(ccont2)) ); in test_search_impl()
43 BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1), in test_search_impl()
45 const_iterator1_t cit = boost::search(ccont1, cont2); in test_search_impl()
[all …]
/third_party/flutter/flutter/packages/flutter/lib/src/material/
Dsearch.dart20 /// Shows a full screen search page and returns the search result selected by
23 /// The search page consists of an app bar with a search field and a body which
24 /// can either show suggested search queries or the search results.
26 /// The appearance of the search page is determined by the provided
31 /// This method returns the selected search result, which can be set in the
32 /// [SearchDelegate.close] call. If the search page is closed with the system
39 /// The transition to the search page triggered by this method looks best if the
43 /// to trigger additional animations in the underlying page while the search
46 /// used to exit the search page.
50 /// * [SearchDelegate] to define the content of the search page.
[all …]
/third_party/boost/boost/algorithm/string/
Dreplace.hpp116 Replace the first match of the search substring in the input
123 \param Search A substring to be searched for
138 const Range2T& Search, in replace_first_copy() argument
144 ::boost::algorithm::first_finder(Search), in replace_first_copy()
155 const Range1T& Search, in replace_first_copy() argument
160 ::boost::algorithm::first_finder(Search), in replace_first_copy()
166 replace the first match of the search substring in the input
170 \param Search A substring to be searched for
176 const Range1T& Search, in replace_first() argument
181 ::boost::algorithm::first_finder(Search), in replace_first()
[all …]
Derase.hpp112 \param Search A substring to be searched for
125 const Range2T& Search ) in erase_first_copy() argument
130 ::boost::algorithm::first_finder(Search), in erase_first_copy()
141 const RangeT& Search ) in erase_first_copy() argument
145 ::boost::algorithm::first_finder(Search), in erase_first_copy()
155 \param Search A substring to be searched for.
160 const RangeT& Search ) in erase_first() argument
164 ::boost::algorithm::first_finder(Search), in erase_first()
179 \param Search A substring to be searched for
193 const Range2T& Search, in ierase_first_copy() argument
[all …]
/third_party/typescript/tests/cases/compiler/
DdeclarationEmitSymlinkPaths.ts2 // @outDir: /packages/search-prefix/lib
3 // @rootDir: /packages/search-prefix/src
5 // @filename: /packages/search/package.json
7 "name": "search",
13 // @filename: /packages/search/lib/index.d.ts
15 // @filename: /packages/search-prefix/src/API/NotificationAPIUtils.ts
21 // @filename: /packages/search-prefix/src/Store/NotificationStore.ts
22 import { test } from "search/lib/index";
28 // @link: /packages/search -> /node_modules/search
29 // @link: /packages/search-prefix -> /node_modules/search-prefix
/third_party/node/deps/icu-small/source/i18n/
Dusearch.cpp121 * @param strsrch string search data
263 * @param strsrch string search data
329 * @param strsrch string search data
456 if (strsrch->search->breakIter != nullptr) { in getBreakIterator()
457 return strsrch->search->breakIter; in getBreakIterator()
460 if (strsrch->search->internalBreakIter != nullptr) { in getBreakIterator()
461 return strsrch->search->internalBreakIter; in getBreakIterator()
465 strsrch->search->internalBreakIter = ubrk_open(UBRK_CHARACTER, in getBreakIterator()
467 strsrch->search->text, strsrch->search->textLength, &status); in getBreakIterator()
469 return strsrch->search->internalBreakIter; in getBreakIterator()
[all …]
/third_party/node/deps/npm/node_modules/libnpmsearch/
DREADME.md4 programmatically accessing the npm search endpoint. It does **not** support
5 legacy search through `/-/all`.
10 const search = require('libnpmsearch')
12 console.log(await search('libnpm'))
38 * [search opts](#opts)
39 * [`search()`](#search)
40 * [`search.stream()`](#search-stream)
67 #### <a name="search"></a> `> search(query, [opts]) -> Promise`
69 `query` must be either a String or an Array of search terms.
75 The returned Promise resolved to an Array of search results with the following
[all …]
/third_party/node/deps/npm/lib/
Dsearch.js3 module.exports = exports = search
6 const allPackageSearch = require('./search/all-package-search')
8 const formatPackageStream = require('./search/format-package-stream.js')
9 const libSearch = require('libnpm/search')
16 search.usage = usage(
17 'search',
18 'npm search [--long] [search terms ...]'
21 search.completion = function (opts, cb) {
35 function search (args, cb) { function
46 return cb(new Error('search must be called with arguments'))
[all …]
/third_party/icu/icu4c/source/test/cintltst/
Dusrchtst.c248 log_err_status(status, "Error: NULL break iterator is valid for opening search\n"); in TestOpenClose()
265 log_err("Error: NULL break iterator is valid for opening search\n"); in TestOpenClose()
278 log_err_status(status, "Error: Break iterator is valid for opening search\n"); in TestOpenClose()
290 log_err("Error: Break iterator is valid for opening search\n"); in TestOpenClose()
320 log_err("Error opening search %s\n", u_errorName(status)); in TestInitialization()
332 log_err("Error opening search %s\n", u_errorName(status)); in TestInitialization()
339 const SearchData search) in assertEqualWithUStringSearch() argument
343 int32_t matchindex = search.offset[count]; in assertEqualWithUStringSearch()
350 usearch_setAttribute(strsrch, USEARCH_ELEMENT_COMPARISON, search.elemCompare, &status); in assertEqualWithUStringSearch()
362 matchlength = search.size[count]; in assertEqualWithUStringSearch()
[all …]
/third_party/flutter/flutter/packages/flutter/test/material/
Dsearch_test.dart13 testWidgets('Can open and close search', (WidgetTester tester) async {
27 // Open search
28 await tester.tap(find.byTooltip('Search'));
39 // Close search
49 …testWidgets('Can close search with system back button to return null', (WidgetTester tester) async…
65 // Open search
66 await tester.tap(find.byTooltip('Search'));
85 // Open search again
86 await tester.tap(find.byTooltip('Search'));
100 await tester.tap(find.byTooltip('Search'));
[all …]
/third_party/node/test/parallel/
Dtest-repl-reverse-search.js117 // 2. SEARCH FORWARDS
118 '\nfwd-i-search: _', '\x1B[1A', '\x1B[4G',
119 // 3. SEARCH FORWARDS
121 '7\nfwd-i-search: _', '\x1B[1A', '\x1B[4G',
124 '7\nfailed-fwd-i-search: a_', '\x1B[1A', '\x1B[4G',
125 // 5. SEARCH BACKWARDS
127 'Arr\x1B[4ma\x1B[24my(100).fill(1)\nbck-i-search: a_',
129 // 6. SEARCH FORWARDS
131 '7\nfailed-fwd-i-search: a_', '\x1B[1A', '\x1B[4G',
132 // 7. SEARCH BACKWARDS
[all …]
/third_party/skia/site/docs/dev/tools/
Dcodesearch.md3 title: "Code Search"
4 linkTitle: "Code Search"
9 There are a number of ways to search the Skia codebase, each with advantages and
13 [Chromium code search](https://code.google.com/p/chromium/codesearch) restricted
15 e.g. [cs.skia.org/foo](http://cs.skia.org/foo) will search for "foo" within the
16 Skia tree. Chromium code search provides cross-references.
19 internal Code Search. In addition to the
20 main [skia](http://cs/#skia/skia/) repo, internal Code Search indexes the
28 branches. However, the search functionality is fairly limited, cross-references
36 Code search option |Search |XRef |History |Repos |Branches |Freshness
[all …]
/third_party/boost/libs/range/doc/reference/algorithm/
Dsearch.qbk6 [section:search search]
13 search(ForwardRange1& rng1, const ForwardRange2& rng2);
17 search(const ForwardRange1& rng1, const ForwardRange2& rng2);
25 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
33 search(const ForwardRange1& rng1, ForwardRange2& rng2, BinaryPredicate pred);
42 search(ForwardRange1& rng1, const ForwardRange2& rng2);
50 search(const ForwardRange1& rng1, const ForwardRange2& rng2);
59 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
68 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);
73 The versions of `search` that return an iterator, return an iterator to the start of the first subs…
[all …]
/third_party/boost/boost/range/algorithm/
Dsearch.hpp24 /// \brief template function search
26 /// range-based version of the search std algorithm
33 search(ForwardRange1& rng1, const ForwardRange2& rng2) in search() function
37 return std::search(boost::begin(rng1),boost::end(rng1), in search()
44 search(const ForwardRange1& rng1, const ForwardRange2& rng2) in search() function
48 return std::search(boost::begin(rng1), boost::end(rng1), in search()
55 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search() function
59 return std::search(boost::begin(rng1),boost::end(rng1), in search()
66 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search() function
70 return std::search(boost::begin(rng1), boost::end(rng1), in search()
[all …]
/third_party/node/test/fixtures/wpt/url/
Durl-searchparams.any.js21 assert_equals(url.search, '?a=b')
22 url.search = ''
24 assert_equals(url.search, '')
39 assert_equals(url.search, '?a=b&c=d')
42 // Test that setting 'search' propagates to the URL object's query object.
43 url.search = 'e=f&g=h'
44 assert_equals(url.search, '?e=f&g=h')
48 url.search = '?e=f&g=h'
49 assert_equals(url.search, '?e=f&g=h')
53 // back to 'search'.
[all …]
/third_party/icu/icu4c/source/test/intltest/
Dsrchtest.cpp258 const SearchData *search) in assertEqualWithStringSearch() argument
262 int32_t matchindex = search->offset[count]; in assertEqualWithStringSearch()
266 strsrch->setAttribute(USEARCH_ELEMENT_COMPARISON, search->elemCompare, status); in assertEqualWithStringSearch()
279 matchlength = search->size[count]; in assertEqualWithStringSearch()
304 matchindex = search->offset[count]; in assertEqualWithStringSearch()
320 matchindex = search->offset[count]; in assertEqualWithStringSearch()
322 matchlength = search->size[count]; in assertEqualWithStringSearch()
346 matchindex = count > 0 ? search->offset[count - 1] : -1; in assertEqualWithStringSearch()
366 matchindex = search->offset[count]; in assertEqualWithStringSearch()
388 matchlength = search->size[count]; in assertEqualWithStringSearch()
[all …]

12345678910>>...233