Home
last modified time | relevance | path

Searched full:which (Results 1 – 25 of 12914) sorted by relevance

12345678910>>...517

/third_party/gettext/gettext-tools/examples/hello-c++-kde/admin/
Ddetect-autoconf.sh16 if test -x "`$WHICH autoconf-2.5x`" ; then
17 AUTOCONF="`$WHICH autoconf-2.5x`"
18 elif test -x "`$WHICH autoconf-2.54`" ; then
19 AUTOCONF="`$WHICH autoconf-2.54`"
20 elif test -x "`$WHICH autoconf-2.53`" ; then
21 AUTOCONF="`$WHICH autoconf-2.53`"
22 elif test -x "`$WHICH autoconf-2.53a`" ; then
23 AUTOCONF="`$WHICH autoconf-2.53a`"
24 elif test -x "`$WHICH autoconf-2.52`" ; then
25 AUTOCONF="`$WHICH autoconf-2.52`"
[all …]
/third_party/node/deps/npm/node_modules/which/
Dpackage.json2 "_from": "which@1.3.1",
3 "_id": "which@1.3.1",
6 "_location": "/which",
11 "raw": "which@1.3.1",
12 "name": "which",
13 "escapedName": "which",
28 "_resolved": "https://registry.npmjs.org/which/-/which-1.3.1.tgz",
30 "_spec": "which@1.3.1",
38 "which": "./bin/which" string
41 "url": "https://github.com/isaacs/node-which/issues"
[all …]
/third_party/flutter/flutter/packages/flutter/lib/src/cupertino/
Dicons.dart49 /// * [share_solid], which is similar, but filled in.
57 /// * [share], which is similar, but not filled in.
65 /// * [book_solid], which is similar, but filled in.
72 /// * [book], which is similar, but not filled in.
79 /// * [bookmark_solid], which is similar, but filled in.
86 /// * [bookmark], which is similar, but not filled in.
119 /// * [check_mark_circled], which consists of this check mark and a circle surrounding it.
126 /// * [check_mark_circled_solid], which is similar, but filled in.
127 /// * [check_mark], which is the check mark without a circle.
134 /// * [check_mark_circled], which is similar, but not filled in.
[all …]
/third_party/boost/boost/geometry/strategies/
Dside_info.hpp48 template <int Which>
51 sides[Which].first = first; in set()
52 sides[Which].second = second; in set()
55 template <int Which, int Index>
60 sides[Which].first = 0; in correct_to_zero()
64 sides[Which].second = 0; in correct_to_zero()
68 template <int Which, int Index>
71 return Index == 0 ? sides[Which].first : sides[Which].second; in get()
77 template <int Which>
80 return sides[Which].first * sides[Which].second == 1; in same()
[all …]
/third_party/flutter/skia/third_party/externals/icu/source/common/
Duprops.cpp50 typedef UBool BinaryPropertyContains(const BinaryProperty &prop, UChar32 c, UProperty which);
58 static UBool defaultContains(const BinaryProperty &prop, UChar32 c, UProperty /*which*/) { in defaultContains()
63 static UBool caseBinaryPropertyContains(const BinaryProperty &/*prop*/, UChar32 c, UProperty which)… in caseBinaryPropertyContains() argument
64 return static_cast<UBool>(ucase_hasBinaryProperty(c, which)); in caseBinaryPropertyContains()
67 static UBool isBidiControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isBidiControl()
71 static UBool isMirrored(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isMirrored()
75 static UBool isJoinControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isJoinControl()
84 …UBool hasFullCompositionExclusion(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in hasFullCompositionExclusion()
98 static UBool isNormInert(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) { in isNormInert() argument
101 (UNormalizationMode)(which-UCHAR_NFD_INERT+UNORM_NFD), errorCode); in isNormInert()
[all …]
/third_party/libinput/udev/
Dtest-libinput-fuzz-extract.c37 uint32_t which; in START_TEST() member
42 { .which = (MIN|MAX), in START_TEST()
45 { .which = (MIN|MAX), in START_TEST()
48 { .which = (MIN|MAX|RES), in START_TEST()
51 { .which = (RES), in START_TEST()
54 { .which = (MIN), in START_TEST()
57 { .which = (MAX|RES), in START_TEST()
60 { .which = (MIN|MAX|RES|FUZZ), in START_TEST()
63 { .which = (MIN|MAX|RES|FUZZ|FLAT), in START_TEST()
66 { .which = (MIN|RES|FUZZ|FLAT), in START_TEST()
[all …]
/third_party/node/deps/icu-small/source/common/
Duprops.cpp160 typedef UBool BinaryPropertyContains(const BinaryProperty &prop, UChar32 c, UProperty which);
168 static UBool defaultContains(const BinaryProperty &prop, UChar32 c, UProperty /*which*/) { in defaultContains()
173 static UBool caseBinaryPropertyContains(const BinaryProperty &/*prop*/, UChar32 c, UProperty which)… in caseBinaryPropertyContains() argument
174 return static_cast<UBool>(ucase_hasBinaryProperty(c, which)); in caseBinaryPropertyContains()
177 static UBool isBidiControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isBidiControl()
181 static UBool isMirrored(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isMirrored()
185 static UBool isJoinControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isJoinControl()
194 …UBool hasFullCompositionExclusion(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in hasFullCompositionExclusion()
208 static UBool isNormInert(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) { in isNormInert() argument
211 (UNormalizationMode)(which-UCHAR_NFD_INERT+UNORM_NFD), errorCode); in isNormInert()
[all …]
Demojiprops.cpp125 EmojiProps::hasBinaryProperty(UChar32 c, UProperty which) { in hasBinaryProperty() argument
128 return U_SUCCESS(errorCode) && ep->hasBinaryPropertyImpl(c, which); in hasBinaryProperty()
132 EmojiProps::hasBinaryPropertyImpl(UChar32 c, UProperty which) const { in hasBinaryPropertyImpl()
133 if (which < UCHAR_EMOJI || UCHAR_RGI_EMOJI < which) { in hasBinaryPropertyImpl()
154 int32_t bit = bitFlags[which - UCHAR_EMOJI]; in hasBinaryPropertyImpl()
163 EmojiProps::hasBinaryProperty(const UChar *s, int32_t length, UProperty which) { in hasBinaryProperty() argument
166 return U_SUCCESS(errorCode) && ep->hasBinaryPropertyImpl(s, length, which); in hasBinaryProperty()
170 EmojiProps::hasBinaryPropertyImpl(const UChar *s, int32_t length, UProperty which) const { in hasBinaryPropertyImpl()
173 // The caller should have delegated single code points to hasBinaryProperty(c, which). in hasBinaryPropertyImpl()
174 if (which < UCHAR_BASIC_EMOJI || UCHAR_RGI_EMOJI < which) { in hasBinaryPropertyImpl()
[all …]
/third_party/skia/third_party/externals/icu/source/common/
Duprops.cpp158 typedef UBool BinaryPropertyContains(const BinaryProperty &prop, UChar32 c, UProperty which);
166 static UBool defaultContains(const BinaryProperty &prop, UChar32 c, UProperty /*which*/) { in defaultContains()
171 static UBool caseBinaryPropertyContains(const BinaryProperty &/*prop*/, UChar32 c, UProperty which)… in caseBinaryPropertyContains() argument
172 return static_cast<UBool>(ucase_hasBinaryProperty(c, which)); in caseBinaryPropertyContains()
175 static UBool isBidiControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isBidiControl()
179 static UBool isMirrored(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isMirrored()
183 static UBool isJoinControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isJoinControl()
192 …UBool hasFullCompositionExclusion(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in hasFullCompositionExclusion()
206 static UBool isNormInert(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) { in isNormInert() argument
209 (UNormalizationMode)(which-UCHAR_NFD_INERT+UNORM_NFD), errorCode); in isNormInert()
[all …]
/third_party/icu/icu4c/source/common/
Duprops.cpp158 typedef UBool BinaryPropertyContains(const BinaryProperty &prop, UChar32 c, UProperty which);
166 static UBool defaultContains(const BinaryProperty &prop, UChar32 c, UProperty /*which*/) { in defaultContains()
171 static UBool caseBinaryPropertyContains(const BinaryProperty &/*prop*/, UChar32 c, UProperty which)… in caseBinaryPropertyContains() argument
172 return static_cast<UBool>(ucase_hasBinaryProperty(c, which)); in caseBinaryPropertyContains()
175 static UBool isBidiControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isBidiControl()
179 static UBool isMirrored(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isMirrored()
183 static UBool isJoinControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in isJoinControl()
192 …UBool hasFullCompositionExclusion(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) { in hasFullCompositionExclusion()
206 static UBool isNormInert(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) { in isNormInert() argument
209 (UNormalizationMode)(which-UCHAR_NFD_INERT+UNORM_NFD), errorCode); in isNormInert()
[all …]
/third_party/boost/boost/iostreams/
Dclose.hpp41 void close(T& t, BOOST_IOS::openmode which);
44 void close(T& t, Sink& snk, BOOST_IOS::openmode which);
93 void close(T& t, BOOST_IOS::openmode which) in close() argument
96 BOOST_ASSERT(which == BOOST_IOS::in || which == BOOST_IOS::out); in close()
98 if (which == (BOOST_IOS::in | BOOST_IOS::out)) { in close()
103 detail::close_impl<T>::close(detail::unwrap(t), which); in close()
107 void close(T& t, Sink& snk, BOOST_IOS::openmode which) in close() argument
110 BOOST_ASSERT(which == BOOST_IOS::in || which == BOOST_IOS::out); in close()
112 if (which == (BOOST_IOS::in | BOOST_IOS::out)) { in close()
117 detail::close_impl<T>::close(detail::unwrap(t), snk, which); in close()
[all …]
/third_party/node/deps/npm/node_modules/which-module/
Dpackage.json2 "_from": "which-module@^2.0.0",
3 "_id": "which-module@2.0.0",
6 "_location": "/which-module",
11 "raw": "which-module@^2.0.0",
12 "name": "which-module",
13 "escapedName": "which-module",
21 "_resolved": "https://registry.npmjs.org/which-module/-/which-module-2.0.0.tgz",
23 "_spec": "which-module@^2.0.0",
29 "url": "https://github.com/nexdrew/which-module/issues"
44 "homepage": "https://github.com/nexdrew/which-module#readme",
[all …]
/third_party/typescript/tests/baselines/reference/
DtypeParameterDiamond3.errors.txt2 'Top' could be instantiated with an arbitrary type which could be unrelated to 'T | U'.
4 'Top' could be instantiated with an arbitrary type which could be unrelated to 'T'.
9 'U' could be instantiated with an arbitrary type which could be unrelated to 'Top'.
11 'U' could be instantiated with an arbitrary type which could be unrelated to 'Bottom'.
13 … 'U' could be instantiated with an arbitrary type which could be unrelated to 'Top | T | U'.
15 … 'U' could be instantiated with an arbitrary type which could be unrelated to 'Top'.
17 'Top' could be instantiated with an arbitrary type which could be unrelated to 'Bottom'.
19 'Top' could be instantiated with an arbitrary type which could be unrelated to 'Top | T | U'.
21 'Top' could be instantiated with an arbitrary type which could be unrelated to 'T'.
35 !!! error TS2322: 'Top' could be instantiated with an arbitrary type which could be unrelated to …
[all …]
DimportHelpersNoHelpers.errors.txt1 …rror TS2343: This syntax requires an imported helper named '__exportStar' which does not exist in …
2 …: error TS2343: This syntax requires an imported helper named '__extends' which does not exist in …
3 … error TS2343: This syntax requires an imported helper named '__decorate' which does not exist in …
4 … error TS2343: This syntax requires an imported helper named '__metadata' which does not exist in …
5 …2): error TS2343: This syntax requires an imported helper named '__param' which does not exist in …
6 …): error TS2343: This syntax requires an imported helper named '__assign' which does not exist in …
7 …12): error TS2343: This syntax requires an imported helper named '__rest' which does not exist in …
13 !!! error TS2343: This syntax requires an imported helper named '__exportStar' which does not exist…
17 !!! error TS2343: This syntax requires an imported helper named '__extends' which does not exist in…
23 !!! error TS2343: This syntax requires an imported helper named '__decorate' which does not exist i…
[all …]
/third_party/boost/libs/variant/test/
Dvariant_swap_test.cpp27 BOOST_TEST(v0.which() == 0); in run1()
28 BOOST_TEST(v1.which() == 1); in run1()
32 BOOST_TEST(v0.which() == 1); in run1()
33 BOOST_TEST(v1.which() == 0); in run1()
46 BOOST_TEST(v0.which() == 0); in run2()
47 BOOST_TEST(v1.which() == 1); in run2()
51 BOOST_TEST(v0.which() == 1); in run2()
52 BOOST_TEST(v1.which() == 0); in run2()
56 BOOST_TEST(v0.which() == 0); in run2()
57 BOOST_TEST(v1.which() == 1); in run2()
[all …]
Dvariant_nonempty_check.cpp200 BOOST_TEST(!v.which()); in check_1_impl()
203 BOOST_TEST(!v.which()); in check_1_impl()
210 BOOST_TEST(!v.which()); in check_1_impl()
213 BOOST_TEST(!v.which()); in check_1_impl()
233 BOOST_TEST(v.which() == 1); in check_2_impl()
236 BOOST_TEST(!v.which()); in check_2_impl()
243 BOOST_TEST(v.which() == 1); in check_2_impl()
246 BOOST_TEST(!v.which()); in check_2_impl()
268 BOOST_TEST(v1.which() == 1); in check_3_impl()
271 BOOST_TEST(!v1.which()); in check_3_impl()
[all …]
Doverload_selection.cpp68 const int which0 = static_cast< boost::variant<B, A>& >(tester).which(); in test_overload_selection_variant_assignment()
74 const int which1 = static_cast< boost::variant<B, A>& >(tester).which(); in test_overload_selection_variant_assignment()
91 BOOST_TEST(y.which() == 0); in test_implicit_conversion_operator()
103 BOOST_TEST(y.which() == 0); in test_derived_from_variant_construction()
107 BOOST_TEST(v2.which() == 0); in test_derived_from_variant_construction()
112 BOOST_TEST(ab_c.which() == 0); in test_derived_from_variant_construction()
115 BOOST_TEST(a_b.which() == 0); in test_derived_from_variant_construction()
118 BOOST_TEST(b_c_a1.which() == 2); in test_derived_from_variant_construction()
123 // BOOST_TEST(b_c_a.which() == 2); in test_derived_from_variant_construction()
131 BOOST_TEST(y.which() == 0); in test_derived_from_variant_assignment()
[all …]
/third_party/toybox/
Dmain.c40 // skip the first entry, which is out of order. in toy_find()
76 toys.which = toy_list; in unknown()
81 static void toy_singleinit(struct toy_list *which, char *argv[]) in toy_singleinit() argument
83 toys.which = which; in toy_singleinit()
90 if (CFG_TOYBOX_HELP_DASHDASH && !(which->flags & TOYFLAG_NOHELP) && argv[1]) { in toy_singleinit()
92 if (CFG_TOYBOX && toys.which == toy_list && toys.argv[2]) in toy_singleinit()
93 if (!(toys.which = toy_find(toys.argv[2]))) unknown(toys.argv[2]); in toy_singleinit()
104 if (NEED_OPTIONS && which->options) get_optflags(); in toy_singleinit()
110 if (!(which->flags & TOYFLAG_UMASK)) umask(toys.old_umask); in toy_singleinit()
116 void toy_init(struct toy_list *which, char *argv[]) in toy_init() argument
[all …]
/third_party/toybox/porting/liteos_a/
Dmain.c40 // skip the first entry, which is out of order. in toy_find()
76 toys.which = toy_list; in unknown()
81 static void toy_singleinit(struct toy_list *which, char *argv[]) in toy_singleinit() argument
83 toys.which = which; in toy_singleinit()
90 if (CFG_TOYBOX_HELP_DASHDASH && !(which->flags & TOYFLAG_NOHELP) && argv[1]) { in toy_singleinit()
92 if (CFG_TOYBOX && toys.which == toy_list && toys.argv[2]) in toy_singleinit()
93 if (!(toys.which = toy_find(toys.argv[2]))) unknown(toys.argv[2]); in toy_singleinit()
104 if (NEED_OPTIONS && which->options) get_optflags(); in toy_singleinit()
110 if (!(which->flags & TOYFLAG_UMASK)) umask(toys.old_umask); in toy_singleinit()
116 void toy_init(struct toy_list *which, char *argv[]) in toy_init() argument
[all …]
/third_party/boost/libs/spirit/test/qi/
Dutree3.cpp61 ut.which() == utree_type::int_type && check(ut, "10")); in main()
64 ut.which() == utree_type::double_type && check(ut, "10.2")); in main()
69 ut.which() == utree_type::int_type && check(ut, "10")); in main()
72 ut.which() == utree_type::double_type && check(ut, "10.2")); in main()
77 ut.which() == utree_type::int_type && check(ut, "10")); in main()
80 ut.which() == utree_type::double_type && check(ut, "10.2")); in main()
85 ut.which() == utree_type::list_type && check(ut, "( 10 )")); in main()
88 ut.which() == utree_type::list_type && check(ut, "( 10.2 )")); in main()
96 BOOST_TEST(ut.which() == utree_type::string_type); in main()
101 BOOST_TEST(ut.which() == utree_type::invalid_type); in main()
[all …]
Dutree4.cpp63 ut.which() == utree_type::string_type && check(ut, "\"xy\"")); in main()
67 ut.which() == utree_type::list_type && check(ut, "( \"ab\" 1.2 )")); in main()
71 ut.which() == utree_type::string_type && check(ut, "\"xy\"")); in main()
75 ut.which() == utree_type::string_type && check(ut, "\"xy\"")); in main()
79 ut.which() == utree_type::list_type && check(ut, "( \"x\" \"y\" )")); in main()
83 ut.which() == utree_type::list_type && check(ut, "( \"ab\" 1.2 )")); in main()
87 ut.which() == utree_type::list_type && check(ut, "( \"a\" \"b\" 1.2 )")); in main()
91 ut.which() == utree_type::symbol_type && check(ut, "xy")); in main()
95 ut.which() == utree_type::list_type && check(ut, "( ab 1.2 )")); in main()
99 ut.which() == utree_type::symbol_type && check(ut, "xy")); in main()
[all …]
/third_party/boost/libs/regex/doc/
Dlocale.qbk13 Front-end localization deals with everything which the user sees -
51 which needs to be called with a string identifying the name of the resource
83 `imbue` which allows the locale for the expression to be set on a
85 which will be loaded via the `std::messages` facet of the expression's locale,
90 which needs to be called with a string identifying the name of the
133 …[[118][The character which when preceded by an escape character represents the word boundary asser…
134 …[[119][The character which when preceded by an escape character represents the non-word boundary a…
135 …[[120][The character which when preceded by an escape character represents the word-start boundary…
136 …[[121][The character which when preceded by an escape character represents the word-end boundary a…
137 …[[122][The character which when preceded by an escape character represents any word character.]["w…
[all …]
/third_party/python/Doc/
DREADME.rst17 The documentation is built with several tools which are not included in this
42 You can also skip creating the virtual environment altogether, in which case
53 * "clean", which removes all build files and the virtual environment.
55 * "clean-venv", which removes the virtual environment directory.
57 * "venv", which creates a virtual environment with all necessary tools
60 * "html", which builds standalone HTML files for offline viewing.
62 * "htmlview", which re-uses the "html" builder, but then opens the main page
65 * "htmlhelp", which builds HTML files and a HTML Help project file usable to
73 * "latex", which builds LaTeX source files as input to "pdflatex" to produce
76 * "text", which builds a plain text file for each source file.
[all …]
/third_party/e2fsprogs/doc/RelNotes/
Dv1.42.txt7 Fixed a bug which could cause e2fsck to corrupt Hurd file systems.
10 Fixed a deadlock which occurs when using systemd and e2fsck.conf's
13 Fixed a bug which could cause programs using libext2's inode table
33 Fixed a bug which could cause badblocks to crash if there are millions
71 s_first_meta_bg field, which had previously caused all e2fsprogs
82 freshly created file system, as well as allowing mke2fs commands which
94 Fix a bug which could cause resize2fs to get confused and produce a
97 format, but which no longer needs to use the meta_bg file system
109 Add a new debugfs command, "inode_dump", which prints the inode in hex
152 Add a new function ext2s_inode_size_set() which takes care of all of
[all …]
/third_party/boost/libs/tti/doc/
Dtti_functionality.qbk10 The elements of a type about which a template metaprogrammer might be interested in finding
14 * Does it have a nested type with a particular name which fulfills some other possibility for that …
16 * Does it have a particular user-defined nested type with a particular name which fulfills some oth…
28 These are some of the compile-time questions which the TTI library answers. It
29 does this by creating metafunctions, which can be used at compile-time, using
31 bool value which answers one of the above questions at compile time. When the
45 generate an appropriate metafunction, which the template metaprogrammer can then use to
52 # In the simplest macro form, which I call the simple macro form, the 'name' of the inner element
59 # In a more complicated macro form, which I call the complex macro form, the macro starts with
77 For the simple macro form, even though it is fairly easy to remember the algorithm by which
[all …]

12345678910>>...517