X-Git-Url: http://git.salome-platform.org/gitweb/?p=modules%2Fsmesh.git;a=blobdiff_plain;f=src%2FTools%2FblocFissure%2Fgmu%2FsortEdges.py;h=212cfef3fffa3289e978dbd16ad10e6067b493fe;hp=576338bd5e6d40c2cd4c1554c1815741a45a9164;hb=b4a070b88fa66729853637acf3f5aa91a429a7d7;hpb=b7a7d49664daa32e1befb558280e13ed0bde37c9 diff --git a/src/Tools/blocFissure/gmu/sortEdges.py b/src/Tools/blocFissure/gmu/sortEdges.py index 576338bd5..212cfef3f 100644 --- a/src/Tools/blocFissure/gmu/sortEdges.py +++ b/src/Tools/blocFissure/gmu/sortEdges.py @@ -1,19 +1,34 @@ # -*- coding: utf-8 -*- +# Copyright (C) 2014-2021 EDF R&D +# +# This library is free software; you can redistribute it and/or +# modify it under the terms of the GNU Lesser General Public +# License as published by the Free Software Foundation; either +# version 2.1 of the License, or (at your option) any later version. +# +# This library 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 +# Lesser General Public License for more details. +# +# You should have received a copy of the GNU Lesser General Public +# License along with this library; if not, write to the Free Software +# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +# +# See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com +# +"""tri par longueur d'edges""" import logging -from .geomsmesh import geompy -# ----------------------------------------------------------------------------- -# --- tri par longueur d'edges +from .geomsmesh import geompy def sortEdges(edgesToSort): - """ - tri des edges par longueur - """ + """tri des edges par longueur""" logging.info('start') - lenEdges = [(geompy.BasicProperties(edge)[0], i, edge) for i, edge in enumerate(edgesToSort)] - lenEdges.sort() - edgesSorted = [edge for length, i, edge in lenEdges] - return edgesSorted, lenEdges[0][0], lenEdges[-1][0] + l_length = [(geompy.BasicProperties(edge)[0], i, edge) for i, edge in enumerate(edgesToSort)] + l_length.sort() + edgesSorted = [edge for _, i, edge in l_length] + return edgesSorted, l_length[0][0], l_length[-1][0]