/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/Data/ |
H A D | Quantize.py | 135 nBounds = len(cuts) 148 if which < nBounds - 1: 156 for i in range(which + 1, nBounds): 199 nBounds = len(cuts) 211 if which < nBounds - 1: 229 for i in range(which + 1, nBounds): 319 if len(startNext) < nBounds: 320 nBounds = len(startNext) - 1 321 if nBounds == 0: 322 nBounds = 1 [all …]
|
H A D | FindQuantBounds.py | 11 def runIt(namesAndTypes, dbConnect, nBounds, resCol, typesToDo=['float']): argument 17 qDat = Quantize.FindVarMultQuantBounds(dList, nBounds, results, nPossibleRes) 46 nBounds = 1 variable 56 nBounds = int(val) 69 runIt(namesAndTypes, dbConnect, nBounds, resCol, typesToDo)
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/langtools/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 89 int nBounds; field in IntersectionTypeParserTest.CastKind 91 CastKind(String castTemplate, int nBounds) { in CastKind() argument 93 this.nBounds = nBounds; in CastKind() 98 for (int i = 0; i < nBounds ; i++) { in asString() 114 if (ck.nBounds == 1) { in main() 121 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/langtools/test/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 88 int nBounds; field in IntersectionTypeParserTest.CastKind 90 CastKind(String castTemplate, int nBounds) { in CastKind() argument 92 this.nBounds = nBounds; in CastKind() 97 for (int i = 0; i < nBounds ; i++) { in asString() 113 if (ck.nBounds == 1) { in main() 120 if (ck.nBounds == 2) { in main()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/langtools/test/tools/javac/cast/intersection/ |
H A D | IntersectionTypeParserTest.java | 88 int nBounds; field in IntersectionTypeParserTest.CastKind 90 CastKind(String castTemplate, int nBounds) { in CastKind() argument 92 this.nBounds = nBounds; in CastKind() 97 for (int i = 0; i < nBounds ; i++) { in asString() 113 if (ck.nBounds == 1) { in main() 120 if (ck.nBounds == 2) { in main()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/DecTree/ |
H A D | QuantTree.py | 23 self.nBounds = 0 53 self.nBounds = len(self.qBounds) 54 if self.nBounds: 67 self.nBounds = len(self.qBounds)
|
H A D | BuildQuantTree.py | 39 nBounds = nBoundsPerVar[var] 40 if nBounds > 0: 48 vTable, nBounds, resCodes, nPossibleRes) 50 elif nBounds == 0:
|
/dports/science/cdk/cdk-cdk-2.3/app/depict/src/main/java/org/openscience/cdk/depict/ |
H A D | Dimensions.java | 91 int nBounds = bounds.size(); in ofGrid() local 92 for (int i = 0; i < nBounds; i++) { in ofGrid()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/ML/Data/ |
H A D | cQuantize.cpp | 132 int i, nBounds = nCuts; in RecurseHelper() local 150 if (which < nBounds - 1) { in RecurseHelper() 175 for (i = which + 1; i < nBounds; i++) { in RecurseHelper()
|
/dports/graphics/mapserver/mapserver-7.6.4/ |
H A D | mapogcfiltercommon.cpp | 141 int nBounds = 0; in FLTGetIsBetweenComparisonCommonExpresssion() local 142 char** aszBounds = msStringSplit(psFilterNode->psRightNode->pszValue, ';', &nBounds); in FLTGetIsBetweenComparisonCommonExpresssion() 143 if (nBounds != 2) { in FLTGetIsBetweenComparisonCommonExpresssion() 144 msFreeCharArray(aszBounds, nBounds); in FLTGetIsBetweenComparisonCommonExpresssion() 248 msFreeCharArray(aszBounds, nBounds); in FLTGetIsBetweenComparisonCommonExpresssion()
|
H A D | mapogcfilter.c | 2529 int nBounds = 0; in FLTGetIsBetweenComparisonSQLExpresssion() local 2545 aszBounds = msStringSplit(psFilterNode->psRightNode->pszValue, ';', &nBounds); in FLTGetIsBetweenComparisonSQLExpresssion() 2546 if (nBounds != 2) { in FLTGetIsBetweenComparisonSQLExpresssion() 2547 msFreeCharArray(aszBounds, nBounds); in FLTGetIsBetweenComparisonSQLExpresssion() 2615 msFreeCharArray(aszBounds, nBounds); in FLTGetIsBetweenComparisonSQLExpresssion()
|
/dports/net-im/convey/convey-src-0.3/src/org/convey/ |
H A D | GroupGraphic.java | 258 Rectangle nBounds = new Rectangle(); in fitToRect() local 265 nBounds.setBounds((int)x1, (int)y1, (int)(x2 - x1), (int)(y2 - y1)); in fitToRect() 267 g.fitToRect(nBounds); in fitToRect()
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.ui/org.eclipse.jdt.core.manipulation/core extension/org/eclipse/jdt/internal/corext/util/ |
H A D | MethodOverrideTester.java | 271 int nBounds= overriddenTypeParameters[i].getBounds().length; in hasCompatibleTypeParameters() local 272 if (nBounds > 1 && nBounds != overridingTypeParameters[i].getBounds().length) { in hasCompatibleTypeParameters()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/ML/test_data/ |
H A D | ferromag_quant_10_3.pkl | 72 sS'nBounds'
|
H A D | ferromag_quant_10_3_lessgreedy.pkl | 72 sS'nBounds'
|
/dports/x11-themes/irssi-themes/irssi-themes-2016082001/ |
H A D | syntax.theme | 245 …window_info_bound_items_header = "%K·%w·%W· %WWindow: %nBounds : {hilight Name …
|
H A D | purplechat.theme | 242 …window_info_bound_items_header = "%K-%m-%M- %WWindow: %nBounds : {hilight Name …
|
H A D | xchat2.theme | 243 …window_info_bound_items_header = "%w-%c-%C- %WWindow: %nBounds : {hilight Name …
|