| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 56 TEST(LogTagSet, ntags) { in TEST() argument
58 EXPECT_EQ(1u, ts.ntags()); in TEST()
60 EXPECT_EQ(5u, ts2.ntags()); in TEST()
157 if (ts->ntags() != other->ntags()) { in TEST()
161 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/hotspot/gtest/logging/ |
| H A D | test_logTagSet.cpp | 55 TEST(LogTagSet, ntags) { in TEST() argument
57 EXPECT_EQ(1u, ts.ntags()); in TEST()
59 EXPECT_EQ(5u, ts2.ntags()); in TEST()
150 if (ts->ntags() != other->ntags()) { in TEST()
154 for (size_t i = 0; i < ts->ntags(); i++) { in TEST()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/logging/ |
| H A D | logOutput.cpp | 95 size_t ntags = 0; in sort_tags() local
96 while (tags[ntags] != LogTag::__NO_TAG) { in sort_tags()
97 ntags++; in sort_tags()
99 qsort(tags, ntags, sizeof(*tags), tag_cmp); in sort_tags()
156 for (size_t i = 0; i < tagset.ntags(); i++) { in add_selections()
292 (score == max_score && selections[i].ntags() < best_selection->ntags())) { in update_config_string()
|
| /dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/CSharp/runtime/CSharp/Antlr4.Runtime/Tree/Pattern/ |
| H A D | ParseTreePatternMatcher.cs | 636 int ntags = starts.Count; in Split()
637 for (int i = 0; i < ntags; i++) in Split()
645 if (ntags == 0) in Split()
650 if (ntags > 0 && starts[0] > 0) in Split()
656 for (int i_1 = 0; i_1 < ntags; i_1++) in Split()
669 if (i_1 + 1 < ntags) in Split()
676 if (ntags > 0) in Split()
678 int afterLastTag = stops[ntags - 1] + stop.Length; in Split()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 92 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
98 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
100 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 92 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
98 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
100 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 92 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
98 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
100 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 92 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
98 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
100 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 89 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
95 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
97 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
| H A D | ReturnTaglet.java | 90 List<DocTree> ntags = new ArrayList<>(); in getTagletOutput()
96 ntags.add(inheritedDoc.holderTag); in getTagletOutput()
98 return !ntags.isEmpty() ? writer.returnTagOutput(holder, ntags.get(0)) : null; in getTagletOutput()
|
| /dports/games/fs2open/fs2open.github.com-release_21_4_1/lib/antlr4-cpp-runtime/runtime/src/tree/pattern/ |
| H A D | ParseTreePatternMatcher.cpp | 307 size_t ntags = starts.size(); in split() local
308 for (size_t i = 0; i < ntags; i++) { in split()
315 if (ntags == 0) { in split()
320 if (ntags > 0 && starts[0] > 0) { // copy text up to first tag into chunks in split()
325 for (size_t i = 0; i < ntags; i++) { in split()
336 if (i + 1 < ntags) { in split()
343 if (ntags > 0) { in split()
344 size_t afterLastTag = stops[ntags - 1] + _stop.length(); in split()
|
| /dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Cpp/runtime/src/tree/pattern/ |
| H A D | ParseTreePatternMatcher.cpp | 307 size_t ntags = starts.size(); in split() local
308 for (size_t i = 0; i < ntags; i++) { in split()
315 if (ntags == 0) { in split()
320 if (ntags > 0 && starts[0] > 0) { // copy text up to first tag into chunks in split()
325 for (size_t i = 0; i < ntags; i++) { in split()
336 if (i + 1 < ntags) { in split()
343 if (ntags > 0) { in split()
344 size_t afterLastTag = stops[ntags - 1] + _stop.length(); in split()
|
| /dports/devel/libantlr4/libantlr4-4.9.3/runtime/src/tree/pattern/ |
| H A D | ParseTreePatternMatcher.cpp | 307 size_t ntags = starts.size(); in split() local
308 for (size_t i = 0; i < ntags; i++) { in split()
315 if (ntags == 0) { in split()
320 if (ntags > 0 && starts[0] > 0) { // copy text up to first tag into chunks in split()
325 for (size_t i = 0; i < ntags; i++) { in split()
336 if (i + 1 < ntags) { in split()
343 if (ntags > 0) { in split()
344 size_t afterLastTag = stops[ntags - 1] + _stop.length(); in split()
|