Home
last modified time | relevance | path

Searched refs:v1Size (Results 1 – 6 of 6) sorted by relevance

/dports/devel/spark/spark-2.1.1/mllib-local/src/main/scala/org/apache/spark/ml/linalg/
H A DVectors.scala411 val v1Size = v1Values.length constant
417 while (k1 < v1Size && v1Values(k1) == 0) k1 += 1
420 if (k1 >= v1Size || k2 >= v2Size) {
421 return k1 >= v1Size && k2 >= v2Size // check end alignment
/dports/devel/spark/spark-2.1.1/mllib/src/main/scala/org/apache/spark/mllib/linalg/
H A DVectors.scala565 val v1Size = v1Values.length constant
571 while (k1 < v1Size && v1Values(k1) == 0) k1 += 1
574 if (k1 >= v1Size || k2 >= v2Size) {
575 return k1 >= v1Size && k2 >= v2Size // check end alignment
/dports/math/cvc3/cvc3-2.4.1/src/theory_arith/
H A Dtheory_arith3.cpp1755 int v1Size = v1.size(); in selectSmallest() local
1756 vector<bool> v3(v1Size); in selectSmallest()
1757 for(int j=0; j < v1Size; ++j) in selectSmallest()
1760 for(int j=0; j < v1Size; ++j) { in selectSmallest()
1762 for(int i =0; i < v1Size; ++i) { in selectSmallest()
1773 for(int j = 0; j < v1Size; ++j) in selectSmallest()
1783 int v1Size = v1.size(); in selectLargest() local
1784 vector<bool> v3(v1Size); in selectLargest()
1785 for(int j=0; j < v1Size; ++j) in selectLargest()
1788 for(int j=0; j < v1Size; ++j) { in selectLargest()
[all …]
H A Dtheory_arith_new.cpp1001 int v1Size = v1.size(); in selectSmallest() local
1002 vector<bool> v3(v1Size); in selectSmallest()
1003 for(int j=0; j < v1Size; ++j) in selectSmallest()
1006 for(int j=0; j < v1Size; ++j) { in selectSmallest()
1008 for(int i =0; i < v1Size; ++i) { in selectSmallest()
1019 for(int j = 0; j < v1Size; ++j) in selectSmallest()
1029 int v1Size = v1.size(); in selectLargest() local
1030 vector<bool> v3(v1Size); in selectLargest()
1031 for(int j=0; j < v1Size; ++j) in selectLargest()
1034 for(int j=0; j < v1Size; ++j) { in selectLargest()
[all …]
H A Dtheory_arith_old.cpp2173 int v1Size = v1.size(); in selectSmallest() local
2174 vector<bool> v3(v1Size); in selectSmallest()
2175 for(int j=0; j < v1Size; ++j) in selectSmallest()
2178 for(int j=0; j < v1Size; ++j) { in selectSmallest()
2180 for(int i =0; i < v1Size; ++i) { in selectSmallest()
2191 for(int j = 0; j < v1Size; ++j) in selectSmallest()
2201 int v1Size = v1.size(); in selectLargest() local
2202 vector<bool> v3(v1Size); in selectLargest()
2203 for(int j=0; j < v1Size; ++j) in selectLargest()
2206 for(int j=0; j < v1Size; ++j) { in selectLargest()
[all …]
/dports/textproc/kdiff3/kdiff3-1.9.4/src/
H A Ddirectorymergewindow.cpp273 quint32 v1Size = getParents(m_pFA, v1, 100); in operator <() local
276 for(quint32 i = 0; i < v1Size && i < v2Size; ++i) in operator <()
278 …int r = v1[v1Size - i - 1]->fileName().compare(v2[v2Size - i - 1]->fileName(), s_eCaseSensitivity); in operator <()
285 return v1Size < v2Size; in operator <()