Differential D3845 Diff 12374 source/blender/editors/util/select_utils.c

Changeset View

Standalone View

source/blender/editors/util/select_utils.c

Show All 17 Lines
* *** END GPL LICENSE BLOCK ***		* *** END GPL LICENSE BLOCK ***
*/		*/

/** \file select_utils.c		/** \file select_utils.c
* \ingroup edutil		* \ingroup edutil
*/		*/

#include "BLI_utildefines.h"		#include "BLI_utildefines.h"
		#include "BLI_kdtree.h"
		#include "BLI_math.h"

#include "ED_select_utils.h"		#include "ED_select_utils.h"

		#include "float.h"

/** 1: select, 0: deselect, -1: pass. */		/** 1: select, 0: deselect, -1: pass. */
int ED_select_op_action(const eSelectOp sel_op, const bool is_select, const bool is_inside)		int ED_select_op_action(const eSelectOp sel_op, const bool is_select, const bool is_inside)
{		{
switch (sel_op) {		switch (sel_op) {
case SEL_OP_ADD:		case SEL_OP_ADD:
return (!is_select && (is_inside)) ? 1 : -1;		return (!is_select && (is_inside)) ? 1 : -1;
case SEL_OP_SUB:		case SEL_OP_SUB:
return (is_select && is_inside) ? 0 : -1;		return (is_select && is_inside) ? 0 : -1;
Show All 26 Lines	switch (sel_op) {
case SEL_OP_AND:		case SEL_OP_AND:
return (is_select && is_inside) ? -1 : (is_select ? 0 : -1);		return (is_select && is_inside) ? -1 : (is_select ? 0 : -1);
case SEL_OP_XOR:		case SEL_OP_XOR:
return (is_select && is_inside) ? 0 : ((!is_select && is_inside) ? 1 : -1);		return (is_select && is_inside) ? 0 : ((!is_select && is_inside) ? 1 : -1);
}		}
BLI_assert(!"invalid sel_op");		BLI_assert(!"invalid sel_op");
return -1;		return -1;
}		}

		int ED_select_similar_compare_float(const float delta, const float thresh, const int compare)
		{
		switch (compare) {
		case SIM_CMP_EQ:
		return (fabsf(delta) < thresh + FLT_EPSILON);
		case SIM_CMP_GT:
		return ((delta + thresh) > -FLT_EPSILON);
		case SIM_CMP_LT:
		return ((delta - thresh) < FLT_EPSILON);
		default:
		BLI_assert(0);
		return 0;
		}
		}

		bool ED_select_similar_compare_float_tree(const KDTree *tree, const float length, const float thresh, const int compare)
		{
		/* Length of the edge we want to compare against. */
		float nearest_edge_length;

		switch (compare) {
		case SIM_CMP_EQ:
		/* Compare to the edge closest to the current edge. */
		nearest_edge_length = length;
		break;
		case SIM_CMP_GT:
		/* Compare against the shortest edge. */
		/* -FLT_MAX leads to some precision issues and the wrong edge being selected.
		* For example, in a tree with 1, 2 and 3, which is stored squared as 1, 4, 9, it returns as the nearest
		* length/node the "4" instead of "1". */
		nearest_edge_length = -1.0f;
		break;
		case SIM_CMP_LT:
		/* Compare against the longest edge. */
		nearest_edge_length = FLT_MAX;
		break;
		default:
		BLI_assert(0);
		return false;
		}

		KDTreeNearest nearest;
		float dummy[3] = {nearest_edge_length, 0.0f, 0.0f};
		if (BLI_kdtree_find_nearest(tree, dummy, &nearest) != -1) {
		float delta = length - nearest.co[0];
		return ED_select_similar_compare_float(delta, thresh, compare);
		}

		return false;
		}