120 lines
2.9 KiB
C
120 lines
2.9 KiB
C
|
/*
|
||
|
|
* ***** BEGIN GPL 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.
|
||
|
|
*
|
||
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
||
|
|
*
|
||
|
|
* Contributor(s): Francisco De La Cruz
|
||
|
|
*
|
||
|
|
* ***** END GPL LICENSE BLOCK *****
|
||
|
|
*/
|
||
|
|
|
||
|
|
/** \file blender/bmesh/operators/bmo_slide.c
|
||
|
|
* \ingroup bmesh
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "MEM_guardedalloc.h"
|
||
|
|
|
||
|
|
#include "BKE_global.h"
|
||
|
|
|
||
|
|
#include "BLI_math.h"
|
||
|
|
|
||
|
|
#include "bmesh.h"
|
||
|
|
#include "intern/bmesh_operators_private.h" /* own include */
|
||
|
|
|
||
|
|
#define EDGE_MARK 1
|
||
|
|
#define VERT_MARK 2
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Slides a vertex along a connected edge
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
void bmo_vert_slide_exec(BMesh *bm, BMOperator *op)
|
||
|
|
{
|
||
|
|
BMOIter oiter;
|
||
|
|
BMIter iter;
|
||
|
|
BMHeader *h;
|
||
|
|
BMVert *vertex;
|
||
|
|
BMEdge *edge;
|
||
|
|
int is_start_v1 = 0;
|
||
|
|
|
||
|
|
/* Selection counts */
|
||
|
|
int selected_verts = 0;
|
||
|
|
int selected_edges = 0;
|
||
|
|
|
||
|
|
/* Get slide amount */
|
||
|
|
const float distance_t = BMO_slot_float_get(op, "distance_t");
|
||
|
|
|
||
|
|
/* Get start vertex */
|
||
|
|
vertex = BMO_iter_new(&oiter, bm, op, "vert", BM_VERT);
|
||
|
|
|
||
|
|
|
||
|
|
if (!vertex) {
|
||
|
|
if (G.debug & G_DEBUG)
|
||
|
|
fprintf(stderr, "vertslide: No vertex selected...");
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Count selected edges */
|
||
|
|
BMO_ITER(h, &oiter, bm, op, "edge", BM_VERT | BM_EDGE) {
|
||
|
|
switch (h->htype) {
|
||
|
|
case BM_VERT:
|
||
|
|
selected_verts++;
|
||
|
|
break;
|
||
|
|
case BM_EDGE:
|
||
|
|
selected_edges++;
|
||
|
|
/* Mark all selected edges (cast BMHeader->BMEdge) */
|
||
|
|
BMO_elem_flag_enable(bm, (BMElemF *)h, EDGE_MARK);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Only allow sliding between two verts */
|
||
|
|
|
||
|
|
if (selected_verts != 2 || selected_edges == 0) {
|
||
|
|
if (G.debug & G_DEBUG)
|
||
|
|
fprintf(stderr, "vertslide: select a single edge\n");
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Make sure we get the correct edge. */
|
||
|
|
BM_ITER(edge, &iter, bm, BM_EDGES_OF_VERT, vertex) {
|
||
|
|
if (BMO_elem_flag_test(bm, edge, EDGE_MARK)) {
|
||
|
|
is_start_v1 = (edge->v1 == vertex);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Found edge */
|
||
|
|
if (edge) {
|
||
|
|
BMVert *other = BM_edge_other_vert(edge, vertex);
|
||
|
|
|
||
|
|
/* mark */
|
||
|
|
BMO_elem_flag_enable(bm, vertex, VERT_MARK);
|
||
|
|
|
||
|
|
/* Interpolate */
|
||
|
|
interp_v3_v3v3(vertex->co, vertex->co, other->co, distance_t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Deselect the edges */
|
||
|
|
BMO_slot_buffer_hflag_disable(bm, op, "edge", BM_ALL, BM_ELEM_SELECT, TRUE);
|
||
|
|
|
||
|
|
/* Return the new edge. The same previously marked with VERT_MARK */
|
||
|
|
BMO_slot_buffer_from_enabled_flag(bm, op, "vertout", BM_VERT, VERT_MARK);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
#undef EDGE_MARK
|
||
|
|
#undef VERT_MARK
|