c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
83 lines
3.3 KiB
C
83 lines
3.3 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2013 by Campbell Barton. All rights reserved. */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bmesh
|
|
*/
|
|
|
|
struct BMEdgeLoopStore;
|
|
struct GSet;
|
|
struct ListBase;
|
|
|
|
/* multiple edgeloops (ListBase) */
|
|
/**
|
|
* \return listbase of listbases, each linking to a vertex.
|
|
*/
|
|
int BM_mesh_edgeloops_find(BMesh *bm,
|
|
struct ListBase *r_eloops,
|
|
bool (*test_fn)(BMEdge *, void *user_data),
|
|
void *user_data);
|
|
bool BM_mesh_edgeloops_find_path(BMesh *bm,
|
|
ListBase *r_eloops,
|
|
bool (*test_fn)(BMEdge *, void *user_data),
|
|
void *user_data,
|
|
BMVert *v_src,
|
|
BMVert *v_dst);
|
|
|
|
void BM_mesh_edgeloops_free(struct ListBase *eloops);
|
|
void BM_mesh_edgeloops_calc_center(BMesh *bm, struct ListBase *eloops);
|
|
void BM_mesh_edgeloops_calc_normal(BMesh *bm, struct ListBase *eloops);
|
|
void BM_mesh_edgeloops_calc_normal_aligned(BMesh *bm,
|
|
struct ListBase *eloops,
|
|
const float no_align[3]);
|
|
void BM_mesh_edgeloops_calc_order(BMesh *bm, ListBase *eloops, bool use_normals);
|
|
|
|
/**
|
|
* Copy a single edge-loop.
|
|
* \return new edge-loops.
|
|
*/
|
|
struct BMEdgeLoopStore *BM_edgeloop_copy(struct BMEdgeLoopStore *el_store);
|
|
struct BMEdgeLoopStore *BM_edgeloop_from_verts(BMVert **v_arr, int v_arr_tot, bool is_closed);
|
|
|
|
void BM_edgeloop_free(struct BMEdgeLoopStore *el_store);
|
|
bool BM_edgeloop_is_closed(struct BMEdgeLoopStore *el_store);
|
|
int BM_edgeloop_length_get(struct BMEdgeLoopStore *el_store);
|
|
struct ListBase *BM_edgeloop_verts_get(struct BMEdgeLoopStore *el_store);
|
|
const float *BM_edgeloop_normal_get(struct BMEdgeLoopStore *el_store);
|
|
const float *BM_edgeloop_center_get(struct BMEdgeLoopStore *el_store);
|
|
/**
|
|
* Edges are assigned to one vert -> the next.
|
|
*/
|
|
void BM_edgeloop_edges_get(struct BMEdgeLoopStore *el_store, BMEdge **e_arr);
|
|
void BM_edgeloop_calc_center(BMesh *bm, struct BMEdgeLoopStore *el_store);
|
|
bool BM_edgeloop_calc_normal(BMesh *bm, struct BMEdgeLoopStore *el_store);
|
|
/**
|
|
* For open loops that are straight lines,
|
|
* calculating the normal as if it were a polygon is meaningless.
|
|
*
|
|
* Instead use an alignment vector and calculate the normal based on that.
|
|
*/
|
|
bool BM_edgeloop_calc_normal_aligned(BMesh *bm,
|
|
struct BMEdgeLoopStore *el_store,
|
|
const float no_align[3]);
|
|
void BM_edgeloop_flip(BMesh *bm, struct BMEdgeLoopStore *el_store);
|
|
void BM_edgeloop_expand(BMesh *bm,
|
|
struct BMEdgeLoopStore *el_store,
|
|
int el_store_len,
|
|
bool split,
|
|
struct GSet *split_edges);
|
|
|
|
bool BM_edgeloop_overlap_check(struct BMEdgeLoopStore *el_store_a,
|
|
struct BMEdgeLoopStore *el_store_b);
|
|
|
|
#define BM_EDGELINK_NEXT(el_store, elink) \
|
|
(elink)->next ? \
|
|
(elink)->next : \
|
|
(BM_edgeloop_is_closed(el_store) ? BM_edgeloop_verts_get(el_store)->first : NULL)
|
|
|
|
#define BM_EDGELOOP_NEXT(el_store) \
|
|
(CHECK_TYPE_INLINE(el_store, struct BMEdgeLoopStore *), \
|
|
(struct BMEdgeLoopStore *)((LinkData *)el_store)->next)
|