Home
last modified time | relevance | path

Searched refs:occurrences (Results 1 – 25 of 157) sorted by relevance

1234567

/third_party/boost/libs/bimap/example/mi_to_b_path/
Dhashed_indices.cpp34 struct occurrences {}; struct
39 multiset_of< tagged<unsigned int,occurrences>, std::greater<unsigned int> >,
68 word_counter::map_by<occurrences>::iterator wit = in main()
69 wc.by<occurrences>().insert( in main()
70 word_counter::map_by<occurrences>::value_type(0,*it) in main()
73 wc.by<occurrences>().modify_key( wit, ++_key); in main()
80 for( word_counter::map_by<occurrences>::const_iterator in main()
81 wit = wc.by<occurrences>().begin(), in main()
82 wit_end = wc.by<occurrences>().end(); in main()
88 << 100.0 * wit->get<occurrences>() / total_occurrences << "%" in main()
Dmi_hashed_indices.cpp38 unsigned int occurrences; member
40 word_counter_entry( std::string word_ ) : word(word_), occurrences(0) {} in word_counter_entry()
51 word_counter_entry,unsigned int,occurrences),
94 << 100.0 * wit->occurrences / total_occurrences << "%" in main()
/third_party/typescript/src/services/refactors/
DconvertToOptionalChainExpression.ts52 occurrences: Occurrence[], property
110 return { finalExpression, occurrences: [condition], expression };
113 const occurrences = getOccurrencesInExpression(finalExpression.expression, condition); constant
114 return occurrences ? { finalExpression, occurrences, expression } :
127 const occurrences = getOccurrencesInExpression(finalExpression.expression, expression.left); constant
128 return occurrences ? { finalExpression, occurrences, expression } :
136 const occurrences: Occurrence[] = []; constant
142 occurrences.push(match);
148 occurrences.push(finalMatch);
150 return occurrences.length > 0 ? occurrences: undefined;
[all …]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/lang/
DUTF16Test.java1039 int occurrences = 0; in TestIndexOf() local
1044 ++ occurrences; in TestIndexOf()
1048 if (occurrences != 6) { in TestIndexOf()
1050 + occurrences); in TestIndexOf()
1053 occurrences = 0; in TestIndexOf()
1058 ++ occurrences; in TestIndexOf()
1062 if (occurrences != 4) { in TestIndexOf()
1064 + occurrences); in TestIndexOf()
1067 occurrences = 0; in TestIndexOf()
1072 ++ occurrences; in TestIndexOf()
[all …]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
DUTF16Test.java1036 int occurrences = 0; in TestIndexOf() local
1041 ++ occurrences; in TestIndexOf()
1045 if (occurrences != 6) { in TestIndexOf()
1047 + occurrences); in TestIndexOf()
1050 occurrences = 0; in TestIndexOf()
1055 ++ occurrences; in TestIndexOf()
1059 if (occurrences != 4) { in TestIndexOf()
1061 + occurrences); in TestIndexOf()
1064 occurrences = 0; in TestIndexOf()
1069 ++ occurrences; in TestIndexOf()
[all …]
/third_party/icu/icu4c/source/test/intltest/
Dustrtest.cpp719 uint16_t occurrences = 0; in TestSearching() local
723 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0) in TestSearching()
725 if (occurrences != 6) in TestSearching()
726 … errln(UnicodeString("indexOf failed: expected to find 6 occurrences, found ") + occurrences); in TestSearching()
728 for ( occurrences = 0, startPos = 10; in TestSearching()
730 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0) in TestSearching()
732 if (occurrences != 4) in TestSearching()
734 "expected to find 4 occurrences, found ") + occurrences); in TestSearching()
737 for ( occurrences = 0, startPos = 5; in TestSearching()
739 …(startPos = test1.indexOf(test2, startPos, endPos - startPos)) != -1 ? (++occurrences, startPos +=… in TestSearching()
[all …]
/third_party/boost/libs/multi_index/example/
Dhashed.cpp35 unsigned int occurrences; member
37 word_counter_entry(std::string word_):word(word_),occurrences(0){} in word_counter_entry()
48 BOOST_MULTI_INDEX_MEMBER(word_counter_entry,unsigned int,occurrences),
119 <<std::setw(5) <<100.0*wit->occurrences/total_occurrences<<"%" in main()
/third_party/node/deps/npm/node_modules/har-validator/node_modules/ajv/scripts/
Dcompile-dots.js57 var count = occurrences(regexp);
65 var countUsed = occurrences(ERROR_KEYWORD);
66 var countOr = occurrences(ERROR_KEYWORD_OR);
70 function occurrences(regexp) { function
/third_party/boost/libs/program_options/doc/
Drationale7 occurrences in options_and_arguments. First is store them
9 occurrences before certain position on command line. The
13 added, then we're be mostly interested in occurrences of
/third_party/e2fsprogs/po/
Dinsert-header.sin5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
Dremove-potcdate.sin4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
/third_party/gettext/gettext-runtime/po/
Dinsert-header.sin10 # occurrences, do nothing. The distinction between the first and the following
11 # occurrences is achieved by looking at the hold space.
25 # The hold space was nonempty. Following occurrences. Do nothing.
Dremove-potcdate.sin10 # The distinction between the first and the following occurrences of the
22 # The hold space was nonempty. Following occurrences. Do nothing.
/third_party/gettext/gettext-tools/examples/po/
Dremove-potcdate.sin10 # The distinction between the first and the following occurrences of the
22 # The hold space was nonempty. Following occurrences. Do nothing.
/third_party/icu/icu4c/source/samples/strsrch/
Dreadme.txt5 strsrch: a sample program which finds the occurrences of a pattern string in a source string, using…
9 Finding all occurrences of a pattern string in a given source string.
/third_party/skia/third_party/externals/icu/source/samples/strsrch/
Dreadme.txt5 strsrch: a sample program which finds the occurrences of a pattern string in a source string, using…
9 Finding all occurrences of a pattern string in a given source string.
/third_party/flutter/skia/third_party/externals/icu/source/samples/strsrch/
Dreadme.txt5 strsrch: a sample program which finds the occurrences of a pattern string in a source string, using…
9 Finding all occurrences of a pattern string in a given source string.
/third_party/boost/tools/build/example/customization/
Dusage.verbatim4 This program takes a template of C++ code and replaces of all occurrences of
/third_party/boost/tools/build/doc/src/
Dregex.adoc56 Replaces occurrences of a match string in a given string and returns the
61 Replaces occurrences of a match string in a given list of strings and
/third_party/node/deps/npm/node_modules/split-on-first/
Dreadme.md5 …Reference/Global_Objects/String/split), but that one splits on all the occurrences, not just the f…
/third_party/boost/tools/build/src/util/
Dregex.jam115 # Replaces occurrences of a match string in a given string and returns the new
147 # Replaces occurrences of a match string in a given list of strings and returns
/third_party/ltp/scripts/coccinelle/
Dlibltp-test-macro.cocci100 // Replace any remaining occurrences of TEST
/third_party/boost/libs/regex/doc/
Dregex_iterator.qbk64 all occurrences of a regular expression within that iterator range.
78 [*Effects]: constructs a [regex_iterator] that will enumerate all occurrences of
206 [*Effects]: returns an iterator that enumerates all occurrences of expression /e/
/third_party/boost/tools/auto_index/doc/
Dauto_index.qbk564 will index occurrences of "foobar" and:
574 Will only index occurrences of "reflex" as a whole word, but:
578 will index occurrences of "reflex", "reflexing" and
709 For example, if you want to index occurrences of Lord Kelvin's name,
764 will index occurrences of "foobar" in any section, but
773 will only index occurrences of "reflex" as a whole word, but:
777 will index occurrences of "reflex", "reflexes", "reflexing" and "reflexed" ...
789 for occurrences of ['term].
800 will index occurrences of "myclass" as a whole word,
811 will index occurrences of "myclass" in any section,
[all …]
/third_party/boost/libs/system/doc/system/
Dintroduction.adoc37 occurrences and must be dealt with as they arise, programs become littered with

1234567