Home
last modified time | relevance | path

Searched refs:nSplits (Results 1 – 25 of 65) sorted by relevance

123

/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/src/core/util/
H A DCrossover.cpp43 nSplits = 0; in construct()
109 nSplits = bands - 1; in init()
188 if (sp >= nSplits) in set_slope()
204 if (sp >= nSplits) in set_frequency()
220 if (sp >= nSplits) in set_mode()
236 if (band > nSplits) in set_gain()
264 if (band > nSplits) in set_handler()
277 if (band > nSplits) in unset_handler()
289 if (band > nSplits) in band_active()
487 if (band > nSplits) in freq_chart()
[all …]
/dports/science/gromacs/gromacs-2021.4/api/nblib/listed_forces/
H A Dhelpers.hpp133 static int computeChunkIndex(int index, int totalRange, int nSplits) in computeChunkIndex() argument
135 if (totalRange < nSplits) in computeChunkIndex()
141 int splitLength = totalRange / nSplits; in computeChunkIndex()
142 return std::min(index / splitLength, nSplits - 1); in computeChunkIndex()
158 int nSplits) in splitListedWork() argument
160 std::vector<ListedInteractionData> workDivision(nSplits); in splitListedWork()
162 auto splitOneElement = [totalRange, nSplits, &workDivision](const auto& inputElement) { in splitListedWork()
182 int splitIndex = detail::computeChunkIndex(representativeIndex, totalRange, nSplits); in splitListedWork()
/dports/editors/libreoffice/libreoffice-7.2.6.2/svx/source/table/
H A Dcellcursor.cxx337 sal_Int32 nSplits = nColumns + 1; in split_column() local
338 while( nSplits-- ) in split_column()
341 if( nSplits == 0 ) in split_column()
345 if( nSplits > 0 ) in split_column()
451 sal_Int32 nSplits = nRows + 1; in split_row() local
452 while( nSplits-- ) in split_row()
455 if( nSplits == 0 ) in split_row()
459 if( nSplits > 0 ) in split_row()
/dports/editors/libreoffice6/libreoffice-6.4.7.2/svx/source/table/
H A Dcellcursor.cxx336 sal_Int32 nSplits = nColumns + 1; in split_column() local
337 while( nSplits-- ) in split_column()
340 if( nSplits == 0 ) in split_column()
344 if( nSplits > 0 ) in split_column()
450 sal_Int32 nSplits = nRows + 1; in split_row() local
451 while( nSplits-- ) in split_row()
454 if( nSplits == 0 ) in split_row()
458 if( nSplits > 0 ) in split_row()
/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/include/core/util/
H A DCrossover.h136 size_t nSplits; // Number of splits variable
179 inline size_t num_bands() const { return nSplits+1; } in num_bands()
185 inline size_t num_splits() const { return nSplits; } in num_splits()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DDStroker.java1145 int nSplits = 0; in _curveTo() local
1154 nSplits = monotonizer.nbSplits; in _curveTo()
1167 for (int i = 0, off = 0; i <= nSplits; i++, off += 6) { in _curveTo()
1277 int nSplits = 0; in _quadTo() local
1286 nSplits = monotonizer.nbSplits; in _quadTo()
1298 for (int i = 0, off = 0; i <= nSplits; i++, off += 4) { in _quadTo()
H A DStroker.java1147 int nSplits = 0; in _curveTo() local
1156 nSplits = monotonizer.nbSplits; in _curveTo()
1169 for (int i = 0, off = 0; i <= nSplits; i++, off += 6) { in _curveTo()
1279 int nSplits = 0; in _quadTo() local
1288 nSplits = monotonizer.nbSplits; in _quadTo()
1300 for (int i = 0, off = 0; i <= nSplits; i++, off += 4) { in _quadTo()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.desktop/share/classes/sun/java2d/marlin/
H A DDTransformingPathConsumer2D.java1015 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1019 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1022 if (nSplits == 0) { in subdivideAtIntersections()
1028 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1036 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1101 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1104 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1112 this.nbSplits = nSplits; in curve()
1126 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1129 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DTransformingPathConsumer2D.java1016 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1020 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1023 if (nSplits == 0) { in subdivideAtIntersections()
1029 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1037 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1102 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1105 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1113 this.nbSplits = nSplits; in curve()
1127 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1130 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DTransformingPathConsumer2D.java1027 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.desktop/share/classes/sun/java2d/marlin/
H A DTransformingPathConsumer2D.java1028 final int nSplits = Helpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1032 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1035 if (nSplits == 0) { in subdivideAtIntersections()
1041 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1049 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1114 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1117 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1125 this.nbSplits = nSplits; in curve()
1139 final int nSplits = Helpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1142 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
H A DDTransformingPathConsumer2D.java1027 final int nSplits = DHelpers.findClipPoints(curve, mid, subTs, type, in subdivideAtIntersections() local
1031 MarlinUtils.logInfo("nSplits: " + nSplits); in subdivideAtIntersections()
1034 if (nSplits == 0) { in subdivideAtIntersections()
1040 for (int i = 0, off = 0; i < nSplits; i++, off += type) { in subdivideAtIntersections()
1048 for (int i = 0, off = 0; i <= nSplits; i++, off += type) { in subdivideAtIntersections()
1113 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 8, lw2); in curve() local
1116 for (int i = 0, off = 0; i < nSplits; i++, off += 6) { in curve()
1124 this.nbSplits = nSplits; in curve()
1138 final int nSplits = DHelpers.findSubdivPoints(curve, mid, subTs, 6, lw2); in quad() local
1141 for (int i = 0, off = 0; i < nSplits; i++, off += 4) { in quad()
[all …]
/dports/science/gromacs/gromacs-2021.4/api/nblib/listed_forces/tests/
H A Dhelpers.cpp69 int nSplits = 3; // split ranges: [0,5], [6,11], [12, 19] in TEST() local
82 splitListedWork(interactions, largestIndex, nSplits); in TEST()
/dports/devel/hadoop/hadoop-1.2.1/src/tools/org/apache/hadoop/tools/distcp2/mapred/lib/
H A DDynamicInputFormat.java84 final int nSplits = Math.min(numMaps, chunks.size()); in createSplits() local
85 List<InputSplit> splits = new ArrayList<InputSplit>(nSplits); in createSplits()
87 for (int i=0; i< nSplits; ++i) { in createSplits()
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-tools/hadoop-distcp/src/main/java/org/apache/hadoop/tools/mapred/lib/
H A DDynamicInputFormat.java86 final int nSplits = Math.min(numMaps, chunks.size()); in createSplits() local
87 List<InputSplit> splits = new ArrayList<InputSplit>(nSplits); in createSplits()
89 for (int i=0; i< nSplits; ++i) { in createSplits()

123