Lines Matching refs:overlap
66 static void fillTriangular(T &v, size_t overlap) { in fillTriangular() argument
70 if (overlap > 0) { in fillTriangular()
71 for (; i < overlap; i++) { in fillTriangular()
72 v[i] = (2.0 * i + 1) / (2 * overlap); in fillTriangular()
77 for (; i < size - overlap; i++) { in fillTriangular()
82 if (overlap > 0) { in fillTriangular()
84 v[i] = (2.0 * (size - i) - 1) / (2 * overlap); in fillTriangular()
90 static void fillHamming(T &v, size_t overlap) { in fillHamming() argument
92 const size_t twoOverlap = 2 * overlap; in fillHamming()
94 if (overlap > 0) { in fillHamming()
95 for (; i < overlap; i++) { in fillHamming()
101 for (; i < size - overlap; i++) { in fillHamming()
106 if (overlap > 0) { in fillHamming()
108 int k = i - ((int)size - 2 * overlap); in fillHamming()
115 static void fillHanning(T &v, size_t overlap) { in fillHanning() argument
117 const size_t twoOverlap = 2 * overlap; in fillHanning()
120 if (overlap > 0) { in fillHanning()
121 for (; i < overlap; i++) { in fillHanning()
127 for (; i < size - overlap; i++) { in fillHanning()
132 if (overlap > 0) { in fillHanning()
134 int k = i - ((int)size - 2 * overlap); in fillHanning()
141 static void fill_window(T &v, int type, size_t size, size_t overlap) { in fill_window() argument
142 if (overlap > size / 2) { in fill_window()
143 overlap = size / 2; in fill_window()
155 fillTriangular(v, overlap); in fill_window()
161 fillHamming(v, overlap); in fill_window()
167 fillHanning(v, overlap); in fill_window()