Welcome to mirror list, hosted at ThFree Co, Russian Federation.

Basic.c « multitest « test « ghost « intern - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: c26cf7c92ca7d2cecaa236715b01aa0b42508e51 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/**
 * $Id$
 * ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version. The Blender
 * Foundation also sells licenses for use in proprietary software under
 * the Blender License.  See http://www.blender.org/BL/ for information
 * about this.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
 * All rights reserved.
 *
 * The Original Code is: all of this file.
 *
 * Contributor(s): none yet.
 *
 * ***** END GPL/BL DUAL LICENSE BLOCK *****
 */

#include "Basic.h"


int min_i(int a, int b) { 
	return (a<b)?a:b; 
}
int max_i(int a, int b) {
	return (b<a)?a:b; 
}
int clamp_i(int val, int min, int max) { 
	return min_i(max_i(val, min), max);
}

float min_f(float a, float b) { 
	return (a<b)?a:b; 
}
float max_f(float a, float b) { 
	return (b<a)?a:b; 
}
float clamp_f(float val, float min, float max) { 
	return min_f(max_f(val, min), max);
}

void rect_copy(int dst[2][2], int src[2][2]) {
	dst[0][0]= src[0][0], dst[0][1]= src[0][1];
	dst[1][0]= src[1][0], dst[1][1]= src[1][1];
}
int rect_contains_pt(int rect[2][2], int pt[2]){
	return ((rect[0][0] <= pt[0] && pt[0] <= rect[1][0]) &&
			(rect[0][1] <= pt[1] && pt[1] <= rect[1][1]));
}
int rect_width(int rect[2][2]) {
	return (rect[1][0]-rect[0][0]);
}
int rect_height(int rect[2][2]) {
	return (rect[1][1]-rect[0][1]);
}