Home
last modified time | relevance | path

Searched refs:cCount (Results 1 – 25 of 664) sorted by relevance

12345678910>>...27

/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/swing/event/
H A DTreeModelEvent.java257 int cCount = children.length; in getChildren() local
258 Object[] retChildren = new Object[cCount]; in getChildren()
260 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
278 int cCount = childIndices.length; in getChildIndices() local
279 int[] retArray = new int[cCount]; in getChildIndices()
281 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.desktop/share/classes/javax/swing/event/
H A DTreeModelEvent.java258 int cCount = children.length; in getChildren() local
259 Object[] retChildren = new Object[cCount]; in getChildren()
261 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
279 int cCount = childIndices.length; in getChildIndices() local
280 int[] retArray = new int[cCount]; in getChildIndices()
282 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/swing/event/
H A DTreeModelEvent.java257 int cCount = children.length; in getChildren() local
258 Object[] retChildren = new Object[cCount]; in getChildren()
260 System.arraycopy(children, 0, retChildren, 0, cCount); in getChildren()
278 int cCount = childIndices.length; in getChildIndices() local
279 int[] retArray = new int[cCount]; in getChildIndices()
281 System.arraycopy(childIndices, 0, retArray, 0, cCount); in getChildIndices()
/dports/graphics/glx-utils/demos-5435fc7fbd332e171da9a71e33a9b190e9462cf0/src/samples/
H A Dstretch.c66 int cCount, cIndex[2], cStep; variable
94 for (i = 0; i < cCount; i++) { in DrawPoint()
160 cList[cCount].x = (float)x; in SetPoint()
161 cList[cCount].y = (float)y; in SetPoint()
162 cCount++; in SetPoint()
215 if (cIndex[1] == cCount) { in Stretch()
232 if (cCount > 1) { in Key()
256 cCount = 0; in Mouse()
378 cCount = 0; in main()
/dports/graphics/mesa-demos/mesa-demos-8.4.0/src/samples/
H A Dstretch.c66 int cCount, cIndex[2], cStep; variable
94 for (i = 0; i < cCount; i++) { in DrawPoint()
160 cList[cCount].x = (float)x; in SetPoint()
161 cList[cCount].y = (float)y; in SetPoint()
162 cCount++; in SetPoint()
215 if (cIndex[1] == cCount) { in Stretch()
232 if (cCount > 1) { in Key()
256 cCount = 0; in Mouse()
378 cCount = 0; in main()
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/go-git/go-git/v5/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/go-git/go-git/v5/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/devel/awless/awless-0.1.11/vendor/gopkg.in/src-d/go-git.v4/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/go-git/go-git/v5/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/jesseduffield/go-git/v5/go-git-341962be15a4/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/go-git/go-git/v5/_examples/open/
H A Dmain.go33 var cCount int
35 cCount++
41 fmt.Println(cCount)
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/io/
H A DBioJavaSequence.java21 private int cCount; field in BioJavaSequence
55 return cCount; in getCCount()
79 return (symbols.length() - aCount - cCount - gCount -tCount); in getOtherCount()
163 cCount = c; in countSymbols()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/swing/tree/
H A DDefaultTreeModel.java309 int cCount = childIndices.length; in nodesWereInserted() local
310 Object[] newChildren = new Object[cCount]; in nodesWereInserted()
312 for(int counter = 0; counter < cCount; counter++) in nodesWereInserted()
340 int cCount = childIndices.length; in nodesChanged() local
342 if(cCount > 0) { in nodesChanged()
343 Object[] cChildren = new Object[cCount]; in nodesChanged()
345 for(int counter = 0; counter < cCount; counter++) in nodesChanged()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/swing/tree/
H A DDefaultTreeModel.java309 int cCount = childIndices.length; in nodesWereInserted() local
310 Object[] newChildren = new Object[cCount]; in nodesWereInserted()
312 for(int counter = 0; counter < cCount; counter++) in nodesWereInserted()
340 int cCount = childIndices.length; in nodesChanged() local
342 if(cCount > 0) { in nodesChanged()
343 Object[] cChildren = new Object[cCount]; in nodesChanged()
345 for(int counter = 0; counter < cCount; counter++) in nodesChanged()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/lang/invoke/
H A DStringConcatFactory.java378 int cCount = 0; in parseRecipe() local
387 if (cCount == constants.length) { in parseRecipe()
389 throw constantMismatch(constants, cCount); in parseRecipe()
393 acc.append(constants[cCount++]); in parseRecipe()
416 if (cCount < constants.length) { in parseRecipe()
417 throw constantMismatch(constants, cCount); in parseRecipe()
432 int cCount) { in constantMismatch() argument
435 cCount + in constantMismatch()
/dports/games/libretro-paralleln64/parallel-n64-6e26fbb/mupen64plus-core/tools/
H A Dcheat_code_convert.py53 cCount=0 variable
66 cCount=0
115 if(n > cCount):
116 cCount = n variable
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/javax/swing/tree/
H A DDefaultTreeModel.java326 int cCount = childIndices.length; in nodesWereInserted() local
327 Object[] newChildren = new Object[cCount]; in nodesWereInserted()
329 for(int counter = 0; counter < cCount; counter++) in nodesWereInserted()
364 int cCount = childIndices.length; in nodesChanged() local
366 if(cCount > 0) { in nodesChanged()
367 Object[] cChildren = new Object[cCount]; in nodesChanged()
369 for(int counter = 0; counter < cCount; counter++) in nodesChanged()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.desktop/share/classes/javax/swing/tree/
H A DDefaultTreeModel.java326 int cCount = childIndices.length; in nodesWereInserted() local
327 Object[] newChildren = new Object[cCount]; in nodesWereInserted()
329 for(int counter = 0; counter < cCount; counter++) in nodesWereInserted()
364 int cCount = childIndices.length; in nodesChanged() local
366 if(cCount > 0) { in nodesChanged()
367 Object[] cChildren = new Object[cCount]; in nodesChanged()
369 for(int counter = 0; counter < cCount; counter++) in nodesChanged()

12345678910>>...27