openscad/dotSCAD
1
0
Fork 0
mirror of https://github.com/JustinSDK/dotSCAD.git synced 2025-08-05 06:17:32 +02:00
Code Issues Releases Wiki Activity

refactor: use contains

Browse Source
This commit is contained in:
Justin Lin
2022-04-15 09:44:05 +08:00
parent 3ad74ff561
commit fd34e9d5b9
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/triangle/_impl/_tri_delaunay_impl.scad
View File

@@ -4,7 +4,7 @@ use <../../util/map/hashmap_get.scad>;
use <../../util/map/hashmap_del.scad>; use <../../util/map/hashmap_del.scad>;
use <../../util/map/hashmap_keys.scad>; use <../../util/map/hashmap_keys.scad>;
use <../../util/map/hashmap_put.scad>; use <../../util/map/hashmap_put.scad>;
use <../../util/has.scad>; use <../../util/contains.scad>;
use <../../util/find_index.scad>; use <../../util/find_index.scad>;
function ihash(a, b, c) = a * 961 + b * 31 + c; function ihash(a, b, c) = a * 961 + b * 31 + c;
@@ -129,7 +129,7 @@ function _adjustNeighborsDtri(d, newTriangles, leng, _indices_hash, i = 0) =
let( let(
neighbors = hashmap_get(delaunay_triangles(d), delaunayTri, hash = _indices_hash), neighbors = hashmap_get(delaunay_triangles(d), delaunayTri, hash = _indices_hash),
leng_nbrs = len(neighbors), leng_nbrs = len(neighbors),
nbri = find_index(neighbors, function(nbr) nbr != undef && has(nbr, edge[1]) && has(nbr, edge[0])), nbri = find_index(neighbors, function(nbr) nbr != undef && contains(nbr, edge[1]) && contains(nbr, edge[0])),
nd = nbri == -1 ? d : updateNbrs(d, delaunayTri, [ nd = nbri == -1 ? d : updateNbrs(d, delaunayTri, [
for(j = 0; j < leng_nbrs; j = j + 1) for(j = 0; j < leng_nbrs; j = j + 1)
j == nbri ? t : neighbors[j] j == nbri ? t : neighbors[j]