X-Git-Url: http://git.salome-platform.org/gitweb/?p=modules%2Fsmesh.git;a=blobdiff_plain;f=src%2FStdMeshersGUI%2FStdMeshersGUI_DistrTable.cxx;h=293e7ec893baf8b842ae2e69bbdca634dce2b589;hp=582b92b2585ab0bd1df17b282c932c538be729f7;hb=HEAD;hpb=b0a908c0d20341651771d0249fb10882f54b2aad;ds=sidebyside

diff --git a/src/StdMeshersGUI/StdMeshersGUI_DistrTable.cxx b/src/StdMeshersGUI/StdMeshersGUI_DistrTable.cxx
index 582b92b25..1380b981c 100644
--- a/src/StdMeshersGUI/StdMeshersGUI_DistrTable.cxx
+++ b/src/StdMeshersGUI/StdMeshersGUI_DistrTable.cxx
@@ -1,4 +1,4 @@
-// Copyright (C) 2007-2014  CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2024  CEA, EDF, OPEN CASCADE
 //
 // Copyright (C) 2003-2007  OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
@@ -28,7 +28,7 @@
 
 #include <SMESHGUI_SpinBox.h>
 
-// Qt incldues
+// Qt includes
 #include <QItemDelegate>
 #include <QTableWidget>
 #include <QHeaderView>
@@ -331,7 +331,7 @@ StdMeshersGUI_DistrTableFrame::Table::
 argMinimum( int r ) const
 {
   // for the first row the minimum value is always 0.0
-  // for the other rows the minumum value is the above row's value
+  // for the other rows the minimum value is the above row's value
   double val = 0.0;
   if ( r > 0 && r < rowCount() )
     val = value( r-1, ArgColumn );
@@ -343,7 +343,7 @@ StdMeshersGUI_DistrTableFrame::Table::
 argMaximum( int r ) const
 {
   // for the last row the maximum value is always 1.0
-  // for the other rows the maxumum value is the below row's value
+  // for the other rows the maximum value is the below row's value
   double val = 1.0;
   if ( r >= 0 && r < rowCount()-1 ) {
     val = value( r+1, ArgColumn );
@@ -445,7 +445,7 @@ deleteRow()
 {
   QList<int> selRows = selectedRows();
   for ( int r = selRows.count()-1; r >= 0; r-- )
-    removeRow( r );
+    removeRow( selRows.at(r) );
 }
 
 void
@@ -574,7 +574,7 @@ StdMeshersGUI_DistrTableFrame::
 setData( const DataArray& array )
 {
   QList<double> d;
-  for ( int i = 0; i < array.length(); i++ )
+  for ( CORBA::ULong i = 0; i < array.length(); i++ )
     d.append( array[i] );
 
   sortData( d );