Lines Matching defs:v1

149     private float min(float v1, float v2) {
150 return v1 < v2 ? v1 : v2;
152 private float[] min(float[] v1, float[] v2) {
153 assert v1.length == v2.length;
154 float[] rv = new float[v1.length];
155 for (int i = 0; i < v1.length; ++i)
156 rv[i] = min(v1[i], v2[i]);
159 private byte min(byte v1, byte v2) {
160 return v1 < v2 ? v1 : v2;
162 private byte[] min(byte[] v1, byte[] v2) {
163 assert v1.length == v2.length;
164 byte[] rv = new byte[v1.length];
165 for (int i = 0; i < v1.length; ++i)
166 rv[i] = min(v1[i], v2[i]);
169 private short min(short v1, short v2) {
170 return v1 < v2 ? v1 : v2;
172 private short[] min(short[] v1, short[] v2) {
173 assert v1.length == v2.length;
174 short[] rv = new short[v1.length];
175 for (int i = 0; i < v1.length; ++i)
176 rv[i] = min(v1[i], v2[i]);
179 private int min(int v1, int v2) {
180 return v1 < v2 ? v1 : v2;
182 private int[] min(int[] v1, int[] v2) {
183 assert v1.length == v2.length;
184 int[] rv = new int[v1.length];
185 for (int i = 0; i < v1.length; ++i)
186 rv[i] = min(v1[i], v2[i]);
189 private long min(long v1, long v2) {
190 return v1 < v2 ? v1 : v2;
192 private long[] min(long[] v1, long[] v2) {
193 assert v1.length == v2.length;
194 long[] rv = new long[v1.length];
195 for (int i = 0; i < v1.length; ++i)
196 rv[i] = min(v1[i], v2[i]);
202 private float max(float v1, float v2) {
203 return v1 > v2 ? v1 : v2;
205 private float[] max(float[] v1, float[] v2) {
206 assert v1.length == v2.length;
207 float[] rv = new float[v1.length];
208 for (int i = 0; i < v1.length; ++i)
209 rv[i] = max(v1[i], v2[i]);
212 private byte max(byte v1, byte v2) {
213 return v1 > v2 ? v1 : v2;
215 private byte[] max(byte[] v1, byte[] v2) {
216 assert v1.length == v2.length;
217 byte[] rv = new byte[v1.length];
218 for (int i = 0; i < v1.length; ++i)
219 rv[i] = max(v1[i], v2[i]);
222 private short max(short v1, short v2) {
223 return v1 > v2 ? v1 : v2;
225 private short[] max(short[] v1, short[] v2) {
226 assert v1.length == v2.length;
227 short[] rv = new short[v1.length];
228 for (int i = 0; i < v1.length; ++i)
229 rv[i] = max(v1[i], v2[i]);
232 private int max(int v1, int v2) {
233 return v1 > v2 ? v1 : v2;
235 private int[] max(int[] v1, int[] v2) {
236 assert v1.length == v2.length;
237 int[] rv = new int[v1.length];
238 for (int i = 0; i < v1.length; ++i)
239 rv[i] = max(v1[i], v2[i]);
242 private long max(long v1, long v2) {
243 return v1 > v2 ? v1 : v2;
245 private long[] max(long[] v1, long[] v2) {
246 assert v1.length == v2.length;
247 long[] rv = new long[v1.length];
248 for (int i = 0; i < v1.length; ++i)
249 rv[i] = max(v1[i], v2[i]);
255 private float fmin(float v1, float v2) {
256 return min(v1, v2);
258 private float[] fmin(float[] v1, float[] v2) {
259 return min(v1, v2);
261 private float[] fmin(float[] v1, float v2) {
262 float[] rv = new float[v1.length];
263 for (int i = 0; i < v1.length; ++i)
264 rv[i] = min(v1[i], v2);
269 private float fmax(float v1, float v2) {
270 return max(v1, v2);
272 private float[] fmax(float[] v1, float[] v2) {
273 return max(v1, v2);
275 private float[] fmax(float[] v1, float v2) {
276 float[] rv = new float[v1.length];
277 for (int i = 0; i < v1.length; ++i)
278 rv[i] = max(v1[i], v2);