Searched refs:vector1 (Results 1 – 2 of 2) sorted by relevance
120 Vector<int> vector1; in TEST_F() local121 vector1.add(1); in TEST_F()122 vector1.add(2); in TEST_F()123 vector1.add(3); in TEST_F()124 vector1.add(4); in TEST_F()126 Vector<int> vector2 = vector1; in TEST_F()127 ASSERT_EQ(vector1.array(), vector2.array()); in TEST_F()130 ASSERT_NE(vector1.editArray(), vector2.editArray()); in TEST_F()133 ASSERT_EQ(vector1.size(), vector2.size()); in TEST_F()134 for (size_t i = 0; i < vector1.size(); ++i) { in TEST_F()[all …]
407 static float squaredEuclideanDistance(float[] vector1, float[] vector2) { in squaredEuclideanDistance() argument409 int size = vector1.length; in squaredEuclideanDistance()411 float difference = vector1[i] - vector2[i]; in squaredEuclideanDistance()424 static float cosineDistance(float[] vector1, float[] vector2) { in cosineDistance() argument426 int len = vector1.length; in cosineDistance()428 sum += vector1[i] * vector2[i]; in cosineDistance()441 static float minimumCosineDistance(float[] vector1, float[] vector2, int numOrientations) { in minimumCosineDistance() argument442 final int len = vector1.length; in minimumCosineDistance()446 a += vector1[i] * vector2[i] + vector1[i + 1] * vector2[i + 1]; in minimumCosineDistance()447 b += vector1[i] * vector2[i + 1] - vector1[i + 1] * vector2[i]; in minimumCosineDistance()