Home
last modified time | relevance | path

Searched refs:maxJ (Results 1 – 4 of 4) sorted by relevance

/external/opencv/cv/src/
Dcvlkpyramid.cpp450 CvPoint minI, maxI, minJ, maxJ; in cvCalcOpticalFlowPyrLK() local
481 minI = maxI = minJ = maxJ = cvPoint( 0, 0 ); in cvCalcOpticalFlowPyrLK()
509 intersect( v, winSize, levelSize, &minJ, &maxJ ); in cvCalcOpticalFlowPyrLK()
514 maxJ.x = MIN( maxJ.x, maxI.x ); in cvCalcOpticalFlowPyrLK()
515 maxJ.y = MIN( maxJ.y, maxI.y ); in cvCalcOpticalFlowPyrLK()
517 jsz = cvSize(maxJ.x - minJ.x, maxJ.y - minJ.y); in cvCalcOpticalFlowPyrLK()
519 _v.x = v.x + (minJ.x - (patchSize.width - maxJ.x + 1))*0.5f; in cvCalcOpticalFlowPyrLK()
520 _v.y = v.y + (minJ.y - (patchSize.height - maxJ.y + 1))*0.5f; in cvCalcOpticalFlowPyrLK()
531 if( maxJ.x == prev_maxJ.x && maxJ.y == prev_maxJ.y && in cvCalcOpticalFlowPyrLK()
588 prev_maxJ = maxJ; in cvCalcOpticalFlowPyrLK()
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/io/
DSerializationStressTest2.java1769 int i, j, maxJ = 3, maxI = 200; in test_18_71_writeObject() local
1770 byte[][] obj = new byte[maxJ][maxI]; in test_18_71_writeObject()
1771 for (j = 0; j < maxJ; j++) { in test_18_71_writeObject()
1783 for (j = 0; j < maxJ; j++) { in test_18_71_writeObject()
1814 int i, j, maxJ = 3, maxI = 200; in test_18_72_writeObject() local
1815 int[][] obj = new int[maxJ][maxI]; in test_18_72_writeObject()
1816 for (j = 0; j < maxJ; j++) { in test_18_72_writeObject()
1828 for (j = 0; j < maxJ; j++) { in test_18_72_writeObject()
1860 int i, j, maxJ = 3, maxI = 70; in test_18_73_writeObject() local
1861 String[][] obj = new String[maxJ][maxI]; in test_18_73_writeObject()
[all …]
/external/opencv/cvaux/src/
Dcvepilines.cpp1216 int maxI=0,maxJ=0; in icvGetCrossRectDirect() local
1237 maxJ = j; in icvGetCrossRectDirect()
1251 *end = cross[maxJ]; in icvGetCrossRectDirect()
/external/smack/asmack-master/jingle/
D60-remove-jingle_mediaimpl.patch916 - private int maxJ;
926 - maxJ = (int) Math.ceil(area.getHeight() / tileWidth);
928 - tiles = new int[maxI][maxJ][tileWidth * tileWidth];
969 - for (int j = 0; j < maxJ; j++) {