0033788: Data Exchange, DE Wrapper - Shape Healing configuration node

DE_ShapeFixParameters class added for shape healing parameters storage.
DE_ShapeFixConfigurationNode class added for work with parameters.

.github/workflows/build-linux-clang-x64-dynamic.yml

@@ -1,40 +0,0 @@
-# This workflow will build OCCT on Ubuntu with Clang compiler
-# using the provided Docker image with Clang tools.
-#
-# Notes:
-# freetype is disabled
-# samples are not built
-
-name: Build OCCT on Linux with Clang x64 dynamic
-
-on:
-  pull_request:
-    branches:
-      - '**'
-
-jobs:
-  build-linux-clang:
-    name: Build on Ubuntu with Clang
-    runs-on: ubuntu-latest
-
-    steps:
-    - name: Checkout repository
-      uses: actions/checkout@v4.1.7
-
-    - name: Install dependencies
-      run: sudo apt-get update && sudo apt-get install -y tcl-dev tk-dev cmake clang make libbtbb-dev libx11-dev libglu1-mesa-dev
-
-    - name: Configure OCCT
-      run: |
-        mkdir -p build
-        cd build
-        cmake -G "Unix Makefiles" \
-              -D CMAKE_C_COMPILER=clang \
-              -D CMAKE_CXX_COMPILER=clang++ \
-              -D USE_FREETYPE=OFF \
-              -D CMAKE_BUILD_TYPE=Release ..
-
-    - name: Build OCCT
-      run: |
-        cd build
-        make -j$(nproc)

.github/workflows/build-linux-gcc-x64-dynamic.yml

@@ -1,40 +0,0 @@
-# This workflow will build OCCT on Linux with GCC x64 dynamic
-# using the provided Docker image with GCC tools.
-#
-# Notes:
-# freetype is disabled
-# samples are not built
-
-name: Build OCCT on Linux with GCC x64 dynamic
-
-on:
-  pull_request:
-    branches:
-      - '**'
-
-jobs:
-  build-linux-gcc:
-    name: Build on Ubuntu with GCC
-    runs-on: ubuntu-latest
-
-    steps:
-    - name: Checkout repository
-      uses: actions/checkout@v4.1.7
-
-    - name: Install dependencies
-      run: sudo apt-get update && sudo apt-get install -y tcl-dev tk-dev cmake gcc g++ make libbtbb-dev libx11-dev libglu1-mesa-dev
-
-    - name: Configure OCCT
-      run: |
-        mkdir -p build
-        cd build
-        cmake -G "Unix Makefiles" \
-              -D CMAKE_C_COMPILER=gcc \
-              -D CMAKE_CXX_COMPILER=g++ \
-              -D USE_FREETYPE=OFF \
-              -D CMAKE_BUILD_TYPE=Release ..
-
-    - name: Build OCCT
-      run: |
-        cd build
-        make -j$(nproc)

.github/workflows/build-macos-clang-x64-dynamic.yml

@@ -1,43 +0,0 @@
-# This workflow builds OCCT on macOS with Clang x64 dynamic.
-#
-# Notes:
-# freetype is disabled
-# samples are not built
-
-name: Build OCCT on macOS with Clang x64 dynamic
-
-on:
-  pull_request:
-    branches:
-      - '**'
-
-jobs:
-  build-macos-clang:
-    name: Build on macOS with Clang
-    runs-on: macos-latest
-
-    steps:
-    - name: Checkout repository
-      uses: actions/checkout@v4.1.7
-
-    - name: Install dependencies
-      run: |
-        brew update
-        brew install tcl-tk tbb gl2ps xerces-c \
-                     libxmu libxi libxft libxpm \
-                     glew
-
-    - name: Configure OCCT
-      run: |
-        mkdir -p build
-        cd build
-        cmake -G "Unix Makefiles" \
-              -D CMAKE_C_COMPILER=clang \
-              -D CMAKE_CXX_COMPILER=clang++ \
-              -D USE_FREETYPE=OFF \
-              -D CMAKE_BUILD_TYPE=Release ..
-
-    - name: Build OCCT
-      run: |
-        cd build
-        make -j$(sysctl -n hw.logicalcpu)

.github/workflows/build-windows-msvc-x64-dynamic.yml

@@ -1,44 +0,0 @@
-# This workflow will build OCCT on Windows with MSVC x64 in dynamic mode
-# using the provided Docker image with MSVC tools.
-#
-# Notes:
-# freetype is disabled
-# Draw module is disabled
-# samples are not built
-
-name: Build OCCT on Windows with MSVC x64 dynamic
-
-on:
-  pull_request:
-    branches:
-      - '**'
-
-jobs:
-  build-windows-msvc:
-    name: Build on Windows with MSVC
-    runs-on: windows-latest
-
-    steps:
-    - name: Checkout repository
-      uses: actions/checkout@v4.1.7
-
-    - name: Set up MSVC
-      uses: ilammy/msvc-dev-cmd@v1.13.0
-      with:
-        arch: x64
-
-    - name: Install dependencies
-      run: |
-        choco install cmake --installargs 'ADD_CMAKE_TO_PATH=System' -y
-        choco install magicsplat-tcl-tk -y
-
-    - name: Configure OCCT
-      run: |
-        mkdir build
-        cd build
-        cmake -T host=x64 -D USE_FREETYPE=OFF -D BUILD_MODULE_Draw=OFF -D CMAKE_BUILD_TYPE=Release ..
-
-    - name: Build OCCT
-      run: |
-        cd build
-        cmake --build . --config Release -- /m

.github/workflows/codemsvc.yml

@@ -1,69 +0,0 @@
-# Security scanning with Microsoft C++ Code Analysis.
-# Checks any master integration and publish warnings into security GitHub tab.
-#
-# Find more information at:
-# https://github.com/microsoft/msvc-code-analysis-action
-
-name: Microsoft C++ Code Analysis
-
-on:
-  push:
-    branches:
-      - 'master'
-
-env:
-  # Path to the CMake build directory.
-  build: '${{ github.workspace }}/build'
-  config: 'Debug'
-
-permissions:
-  contents: read
-
-jobs:
-  analyze:
-    permissions:
-      contents: read # for actions/checkout to fetch code
-      security-events: write # for github/codeql-action/upload-sarif to upload SARIF results
-      actions: read # only required for a private repository by github/codeql-action/upload-sarif to get the Action run status
-    name: Analyze
-    runs-on: windows-latest
-
-    steps:
-      - name: Checkout repository
-        uses: actions/checkout@v4.1.7
-
-      - name: Install dependencies
-        run: |
-            choco install cmake --installargs 'ADD_CMAKE_TO_PATH=System' -y
-            choco install magicsplat-tcl-tk -y
-          
-      - name: Configure CMake
-        run: |
-          mkdir build
-          cd build
-          cmake -D USE_FREETYPE=OFF -DCMAKE_BUILD_TYPE=${{ env.config }} ..
-
-      - name: Run MSVC Code Analysis
-        uses: microsoft/msvc-code-analysis-action@v0.1.1
-        # Provide a unique ID to access the sarif output path
-        id: run-analysis
-        with:
-          cmakeBuildDirectory: ${{ env.build }}
-          buildConfiguration: ${{ env.config }}
-          # Ruleset file that will determine what checks will be run
-          ruleset: NativeRecommendedRules.ruleset
-          # Paths to ignore analysis of CMake targets and includes
-          # ignoredPaths: ${{ github.workspace }}/dependencies;${{ github.workspace }}/test
-
-      # Upload SARIF file to GitHub Code Scanning Alerts
-      #- name: Upload SARIF to GitHub
-      #  uses: github/codeql-action/upload-sarif@v3.26.5
-      #  with:
-      #    sarif_file: ${{ steps.run-analysis.outputs.sarif }}
-
-      # Upload SARIF file as an Artifact to download and view
-      - name: Upload SARIF as an Artifact
-        uses: actions/upload-artifact@v4.3.6
-        with:
-          name: sarif-file
-          path: ${{ steps.run-analysis.outputs.sarif }}

.github/workflows/codeql.yml

@@ -1,60 +0,0 @@
-# Security scanning with CodeQL.
-# Checks any master integration and publish warnings into security GitHub tab.
-#
-# Find more information at:
-# https://docs.github.com/en/github/finding-security-vulnerabilities-and-errors-in-your-code/about-code-scanning
-
-name: CodeQL Code Analysis
-
-on:
-  push:
-    branches:
-      - 'master'
-
-jobs:
-  analyze:
-    name: Analyze (${{ matrix.language }})
-    runs-on: ${{ 'ubuntu-latest' }}
-    permissions:
-      # required for all workflows
-      security-events: write
-
-      # required to fetch internal or private CodeQL packs
-      packages: read
-
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-        - language: c-cpp
-          build-mode: manual
-    steps:
-    - name: Checkout repository
-      uses: actions/checkout@v4.1.7
-
-    - name: Install dependencies
-      run: sudo apt-get update && sudo apt-get install -y tcl-dev tk-dev cmake gcc g++ make libbtbb-dev libx11-dev libglu1-mesa-dev
-
-    # Initializes the CodeQL tools for scanning.
-    - name: Initialize CodeQL
-      uses: github/codeql-action/init@v3.26.5
-      with:
-        languages: ${{ matrix.language }}
-        build-mode: ${{ matrix.build-mode }}
-
-    - if: matrix.build-mode == 'manual'
-      shell: bash
-      run: |
-        mkdir -p build
-        cd build
-        cmake -G "Unix Makefiles" \
-              -D CMAKE_C_COMPILER=gcc \
-              -D CMAKE_CXX_COMPILER=g++ \
-              -D USE_FREETYPE=OFF \
-              -D CMAKE_BUILD_TYPE=Release ..
-        make -j$(nproc)
-
-    - name: Perform CodeQL Analysis
-      uses: github/codeql-action/analyze@v3.26.5
-      with:
-        category: "/language:${{matrix.language}}"

.gitignore

@@ -1,7 +1,6 @@
 
 # standard directories for derived files in CASROOT
 /.adm
-/.vscode
 /lin
 /mac
 /wnt

adm/cmake/3rdparty_macro.cmake

@@ -19,7 +19,7 @@ macro (THIRDPARTY_PRODUCT PRODUCT_NAME HEADER_NAME LIBRARY_CSF_NAME LIBRARY_NAME
   # include occt macros. compiler_bitness, os_wiht_bit, compiler
   OCCT_INCLUDE_CMAKE_FILE ("adm/cmake/occt_macros")
 
-  # specify product folder in connection with 3RDPARTY_DIR
+  # specify product folder in connectin with 3RDPARTY_DIR
   if (3RDPARTY_DIR AND EXISTS "${3RDPARTY_DIR}")
     #CHECK_PATH_FOR_CONSISTENCY (3RDPARTY_DIR 3RDPARTY_${PRODUCT_NAME}_DIR PATH "The directory containing ${PRODUCT_NAME}")
 

adm/cmake/bison.cmake

@@ -12,7 +12,7 @@ if (NOT BISON_EXECUTABLE OR NOT EXISTS "${BISON_EXECUTABLE}")
 endif()
 
 # Add paths to 3rdparty subfolders containing name "bison" to CMAKE_PROGRAM_PATH variable to make
-# these paths searched by find_package
+# these paths searhed by find_package
 if (3RDPARTY_DIR)
   file (GLOB BISON_PATHS LIST_DIRECTORIES true "${3RDPARTY_DIR}/*bison*/")
   foreach (candidate_path ${BISON_PATHS})

adm/cmake/cotire.cmake

@@ -2580,7 +2580,7 @@ function (cotire_setup_target_pch_usage _languages _target _wholeTarget)
 			message (STATUS "add_custom_command: TARGET ${_target} PRE_BUILD ${_cmds}")
 		endif()
 		# because CMake PRE_BUILD command does not support dependencies,
-		# we check dependencies explicitly in cotire script mode when the pre-build action is run
+		# we check dependencies explicity in cotire script mode when the pre-build action is run
 		add_custom_command(
 			TARGET "${_target}"
 			PRE_BUILD ${_cmds}
@@ -2637,7 +2637,7 @@ function (cotire_setup_unity_generation_commands _language _target _targetScript
 		endif()
 		if (WIN32 AND CMAKE_${_language}_COMPILER_ID MATCHES "MSVC|Intel")
 			# unity file compilation results in potentially huge object file,
-			# thus use /bigobj by default under cl.exe and Windows Intel
+			# thus use /bigobj by default unter cl.exe and Windows Intel
 			set_property (SOURCE "${_unityFile}" APPEND_STRING PROPERTY COMPILE_FLAGS "/bigobj")
 		endif()
 		cotire_set_cmd_to_prologue(_unityCmd)

adm/cmake/flex.cmake

@@ -15,7 +15,7 @@ if (NOT FLEX_INCLUDE_DIR OR NOT EXISTS "${FLEX_INCLUDE_DIR}")
 endif()
 
 # Add paths to 3rdparty subfolders containing name "flex" to CMAKE_PROGRAM_PATH and 
-# CMAKE_INCLUDE_PATH variables to make these paths searched by find_package
+# CMAKE_INCLUDE_PATH variables to make these paths searhed by find_package
 if (3RDPARTY_DIR)
   file (GLOB FLEX_PATHS LIST_DIRECTORIES true "${3RDPARTY_DIR}/*flex*")
   foreach (candidate_path ${FLEX_PATHS})

adm/cmake/freetype.cmake

@@ -14,7 +14,7 @@ OCCT_INCLUDE_CMAKE_FILE ("adm/cmake/occt_macros")
 OCCT_MAKE_COMPILER_SHORT_NAME()
 OCCT_MAKE_COMPILER_BITNESS()
 
-# specify freetype folder in connection with 3RDPARTY_DIR
+# specify freetype folder in connectin with 3RDPARTY_DIR
 if (3RDPARTY_DIR AND EXISTS "${3RDPARTY_DIR}")
   #CHECK_PATH_FOR_CONSISTENCY (3RDPARTY_DIR 3RDPARTY_FREETYPE_DIR PATH "The directory containing freetype")
 

adm/cmake/tbb.cmake

@@ -27,7 +27,7 @@ if (WIN32)
 
   # Below, we have correct 3RDPARTY_DIR.
 
-  # Initialize TBB folder in connection with 3RDPARTY_DIR.
+  # Initialize TBB folder in connectin with 3RDPARTY_DIR.
   if (("${3RDPARTY_TBB_DIR}" STREQUAL "") OR (NOT EXISTS "${3RDPARTY_TBB_DIR}"))
     FIND_PRODUCT_DIR ("${3RDPARTY_DIR}" TBB TBB_DIR_NAME)
     if (TBB_DIR_NAME)
@@ -44,7 +44,7 @@ if (WIN32)
       REQUIRED
       CONFIG)
 
-    # Archive include directory
+    # Achive include directory
     get_target_property (TBB_INCLUDE_DIR TBB::tbb INTERFACE_INCLUDE_DIRECTORIES)
     if (NOT DEFINED 3RDPARTY_TBB_INCLUDE_DIR)
       set (3RDPARTY_TBB_INCLUDE_DIR "" CACHE PATH "The directory containing headers of the TBB")
@@ -56,17 +56,13 @@ if (WIN32)
       list (APPEND 3RDPARTY_NOT_INCLUDED 3RDPARTY_TBB_INCLUDE_DIR)
     endif()
 
-    # Get installed configuration of tbb
-    get_target_property (TARGET_TBB_IMPORT_CONFS TBB::tbb IMPORTED_CONFIGURATIONS)
-    list (GET TARGET_TBB_IMPORT_CONFS 0 CHOSEN_IMPORT_CONF)
-
     separate_arguments (CSF_TBB)
     foreach (LIB IN LISTS CSF_TBB)
       string(TOLOWER "${LIB}" LIB_LOWER)
       string(TOUPPER "${LIB}" LIB_UPPER)
 
-      # Archive *.lib files and directory containing it.
+      # Achive *.lib files and directory containing it.
-      get_target_property (TBB_LIB_FILE "TBB::${LIB_LOWER}" IMPORTED_IMPLIB_${CHOSEN_IMPORT_CONF})
+      get_target_property (TBB_LIB_FILE "TBB::${LIB_LOWER}" IMPORTED_IMPLIB_RELEASE)
       # Reserve cache variable for *.lib.
       if (NOT DEFINED 3RDPARTY_${LIB_UPPER}_LIBRARY)
         set (3RDPARTY_${LIB_UPPER}_LIBRARY "" CACHE FILEPATH "${LIB_UPPER} library (*.lib)")
@@ -92,8 +88,8 @@ if (WIN32)
         list (APPEND 3RDPARTY_NO_LIBS 3RDPARTY_${LIB_UPPER}_LIBRARY_DIR)
       endif()
 
-      # Archive *.dll files and directory containing it.
+      # Achive *.dll files and directory containing it.
-      get_target_property (TBB_DLL_FILE "TBB::${LIB_LOWER}" IMPORTED_LOCATION_${CHOSEN_IMPORT_CONF})
+      get_target_property (TBB_DLL_FILE "TBB::${LIB_LOWER}" IMPORTED_LOCATION_RELEASE)
       # Reserve cache variable for *.dll.
       if (NOT DEFINED 3RDPARTY_${LIB_UPPER}_DLL)
         set (3RDPARTY_${LIB_UPPER}_DLL "" CACHE FILEPATH "${LIB_UPPER} library (*.dll)")
@@ -175,9 +171,9 @@ else ()
     REQUIRED
     CONFIG)
   endif()
-  # TBB has been configured (in other case FATAL_ERROR occurs).
+  # TBB has been configured (in other case FATAL_ERROR occures).
 
-  # Archive include directory.
+  # Achive include directory.
   get_target_property (TBB_INCLUDE_DIR TBB::tbb INTERFACE_INCLUDE_DIRECTORIES)
   if (NOT DEFINED 3RDPARTY_TBB_INCLUDE_DIR)
     set (3RDPARTY_TBB_INCLUDE_DIR "" CACHE PATH "The directory containing headers of the TBB")
@@ -189,17 +185,13 @@ else ()
     list (APPEND 3RDPARTY_NOT_INCLUDED 3RDPARTY_TBB_INCLUDE_DIR)
   endif()
 
-  # Get installed configuration of tbb
-  get_target_property (TARGET_TBB_IMPORT_CONFS TBB::tbb IMPORTED_CONFIGURATIONS)
-  list (GET TARGET_TBB_IMPORT_CONFS 0 CHOSEN_IMPORT_CONF)
-
   separate_arguments (CSF_TBB)
   foreach (LIB IN LISTS CSF_TBB)
     string(TOLOWER "${LIB}" LIB_LOWER)
     string(TOUPPER "${LIB}" LIB_UPPER)
 
-    # Archive *.so files and directory containing it.
+    # Achive *.so files and directory containing it.
-    get_target_property (TBB_SO_FILE "TBB::${LIB_LOWER}" IMPORTED_LOCATION_${CHOSEN_IMPORT_CONF})
+    get_target_property (TBB_SO_FILE "TBB::${LIB_LOWER}" IMPORTED_LOCATION_RELEASE)
     # Reserve cache variable for *.so.
     if (NOT DEFINED 3RDPARTY_${LIB_UPPER}_LIBRARY)
       set (3RDPARTY_${LIB_UPPER}_LIBRARY "" CACHE FILEPATH "${LIB_UPPER} library (*.so)")

adm/upgrade.tcl

@@ -405,7 +405,7 @@ proc Rename {thePath theExtensions theNewNames theCheckMode} {
   }
 }
 
-# @thePackagePath either file or folder. If it is a folder, 
+# @thePackagePath eather file or folder. If it is a folder, 
 # all files with @theHeaderExtensions are processed.
 # "fwd.tcollection" section from upgrade.ini file is used to find out what 
 # classes have been converted and, thus, what forward declarations can be replaced

dox/introduction/introduction.md

@@ -370,7 +370,7 @@ https://dev.opencascade.org/resources/download/3rd-party-components
 | Flex 2.6.4+ and Bison 3.7.1+ | https://sourceforge.net/projects/winflexbison/ | Data Exchange | Updating STEP and ExprIntrp parsers |
 | RapidJSON 1.1+ | https://rapidjson.org/ | Data Exchange | Reading glTF files |
 | Draco 1.4.1+ | https://github.com/google/draco | Data Exchange | Reading compressed glTF files |
-| Tcl/Tk 8.6.3+ | https://www.tcl.tk/software/tcltk/download.html | DRAW Test Harness | Tcl interpreter in Draw module |
+| Tcl/Tk 8.6.3+ | https://www.tcl.tk/software/tcltk/download.html | DRAW Test Harness | Tcl interpretor in Draw module |
 | Qt 5.3.2+ | https://www.qt.io/download/ | Inspector and Samples | Inspector Qt samples and  |
 | Doxygen 1.8.5+ | https://www.doxygen.nl/download.html | Documentation | (Re)generating documentation |
 | Graphviz 2.38+ | https://graphviz.org/ | Documentation | Generating dependency graphs |

dox/user_guides/ocaf/ocaf.md

@@ -763,7 +763,7 @@ filter2->AddSkipped("TDataStd_Integer");
 app->Open("example.cbf", doc, filter2); 
 ~~~~
 
-*PCDM_ReaderFilter::AppendMode_Protect* means that if the loading algorithm finds already existing attribute in the document, it will not be overwritten by attribute from the loading file. If it is needed to
+*PCDM_ReaderFilter::AppendMode_Protect* means that if the loading algorithm finds already existing attribute in the document, it will not be overwritten by attibute from the loading file. If it is needed to
 substitute the existing attributes, the reading mode *PCDM_ReaderFilter::AppendMode_Overwrite* must be used instead.
 
 *AddRead* and *AddSkipped* methods for attributes should not be used in one filter. If it is so, *AddSkipped* attributes are ignored during the read.
@@ -971,7 +971,7 @@ The "correct" history of a used modeling operation serves the basis of naming me
 | Closed wire | Edges | All edges |
 | Opened wire |	Edges and ending vertexes | All edges plus ending vertexes of the wire |
 | Edge | Vertexes |	Two vertexes are expected |
-| Compound or CompSolid	| To be used consequently the above declared rule applied to all sub-shapes of the first level | Compound/CompSolid to be explored level by level until any the mentioned above types will be met | 
+| Compound or CompSolid	| To be used consequentially the above declared rule applied to all sub-shapes of the first level | Compound/CompSolid to be explored level by level until any the mentioned above types will be met | 
 
 The history should return (and track) only elementary types of sub-shapes, i.e. Faces, Edges and Vertexes, while other so-called aggregation types: Compounds, Shells, Wires, are calculated by Selection mechanism automatically.
 

samples/glfw/adm/cmake/FindOpenCASCADE.cmake

@@ -119,7 +119,7 @@ if (OpenCASCADE_INCLUDE_DIR_FOUND AND OpenCASCADE_LIBRARY_DIR_FOUND)
   set (OpenCASCADE_INSTALL_PREFIX ${OpenCASCADE_DIR})
 
   # Define OCCT toolkits so that CMake can put absolute paths to linker;
-  # the library existence is not checked here, since modules can be disabled.
+  # the library existance is not checked here, since modules can be disabled.
   foreach (aLibIter ${OpenCASCADE_TKLIST})
     add_library (${aLibIter} SHARED IMPORTED)
 

src/AIS/AIS.hxx

@@ -36,7 +36,7 @@
 //! The Datum groups together the construction elements such as lines, circles, points, trihedra, plane trihedra, planes and axes.
 //! The Relation is made up of constraints on one or more interactive shapes and the corresponding reference geometry.
 //! For example, you might want to constrain two edges in a parallel relation.
-//! This constraint is considered as an object in its own right, and is shown as a sensitive primitive.
+//! This contraint is considered as an object in its own right, and is shown as a sensitive primitive.
 //! This takes the graphic form of a perpendicular arrow marked with the || symbol and lying between the two edges.
 //! The Object type includes topological shapes, and connections between shapes.
 //! None, in order not to eliminate the object, tells the application to look further until it finds an object definition in its generation which is accepted.

src/AIS/AIS_ExclusionFilter.hxx

@@ -42,7 +42,7 @@ DEFINE_STANDARD_HANDLE(AIS_ExclusionFilter, SelectMgr_Filter)
 //! except those of the types and signatures stored
 //! in the filter framework
 //! -   Exclusion flag off
-//! -   the function IsOk answers true for all objects
+//! -   the funciton IsOk answers true for all objects
 //! which have the same type and signature as the stored ones.
 class AIS_ExclusionFilter : public SelectMgr_Filter
 {

src/AIS/AIS_RubberBand.hxx

@@ -40,7 +40,7 @@ public:
   //! @warning It binds this object with Graphic3d_ZLayerId_TopOSD layer.
   Standard_EXPORT AIS_RubberBand();
 
-  //! Constructs the rubber band with empty filling and defined line style.
+  //! Consructs the rubber band with empty filling and defined line style.
   //! @param theLineColor [in] color of rubber band lines
   //! @param theType [in] type of rubber band lines
   //! @param theLineWidth [in] width of rubber band line. By default it is 1.

src/APIHeaderSection/APIHeaderSection_MakeHeader.cxx

@@ -31,7 +31,7 @@
 #include <TCollection_HAsciiString.hxx>
 
 #include <stdio.h>
-// This is a generic header for any STEP scheme
+// This is a generic header for any STEP sheme
 static Handle(TCollection_HAsciiString) nulstr;
 static Handle(Interface_HArray1OfHAsciiString) nularr;
 

src/Adaptor3d/Adaptor3d_CurveOnSurface.cxx

@@ -146,7 +146,7 @@ static void Hunt(const TColStd_Array1OfReal& Arr,
 		 const Standard_Real Coord,
 		 Standard_Integer& Iloc)
 {//Warning: Hunt is used to find number of knot which equals coordinate component,
-  //        when coordinate component definitely equals a knot only.
+  //        when coordinate component definitly equals a knot only.
   Standard_Real Tol=Precision::PConfusion()/10;
   Standard_Integer i=1; 
   while((i <= Arr.Upper()) && (Abs(Coord - Arr(i)) > Tol)){
@@ -638,7 +638,7 @@ static void Locate2Coord(const Standard_Integer Index,
   if((DComp > 0)&&(Abs(DComp)>Tol)) {  
     Hunt(Arr,Comp,N);
     if (N >= NUp){
-      //limit case: Hunt() caught upper knot. Take the last span. 
+      //limit case: Hunt() cought upper knot. Take the last span. 
       N = NUp - 1;
     }
     if(Index==1) {  Tmp1=BSplS->UKnot(N);
@@ -659,7 +659,7 @@ static void Locate2Coord(const Standard_Integer Index,
     if((DComp < 0)&&(Abs(DComp)>Tol)){      
      Hunt(Arr,Comp,N);
      if (N <= NLo) {
-       //limit case: Hunt() caught lower knot. Take the first span.
+       //limit case: Hunt() cought lower knot. Take the first span.
        N = NLo + 1;
      }
      if(Index==1) {	  Tmp1=BSplS->UKnot(N-1);

src/Adaptor3d/Adaptor3d_TopolTool.cxx

@@ -559,7 +559,7 @@ Standard_Boolean Adaptor3d_TopolTool::Identical
 #include <gp_Dir.hxx>
 #include <gp_Vec.hxx>
 
-#define myMinPnts 4 //Absolute possible minimum of sample points
+#define myMinPnts 4 //Absolut possible minimum of sample points
                     //Restriction of IntPolyh
 
 

src/AdvApp2Var/AdvApp2Var_ApproxAFunc2Var.cxx

@@ -363,7 +363,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputePatches(const AdvApprox_Cutting& UChoice
       throw Standard_ConstructionError("AdvApp2Var_ApproxAFunc2Var : Surface Discretisation Error");
     }
 
-// calculate the number and the type of authorized cuts
+// calculate the number and the type of autorized cuts
 // depending on the max number of squares and the validity of next cuts.
     NbU = myResult.NbPatchInU();
     NbV = myResult.NbPatchInV();
@@ -457,7 +457,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputePatches(const AdvApprox_Cutting& UChoice
       throw Standard_ConstructionError("AdvApp2Var_ApproxAFunc2Var : Surface Discretisation Error");
     }
 
-// calculate the number and type of authorized cuts
+// calculate the number and type of autorized cuts
 // depending on the max number of squares and the validity of next cuts
     NbU = myResult.NbPatchInU();
     NbV = myResult.NbPatchInV();

src/AdvApp2Var/AdvApp2Var_ApproxAFunc2Var.hxx

@@ -42,13 +42,13 @@ class Geom_BSplineSurface;
 //! OneDTol, TwoDTol, ThreeDTol: The tolerance of approximation in each
 //! subspaces
 //! OneDTolFr, TwoDTolFr, ThreeDTolFr: The tolerance of approximation on
-//! the boundaries in each subspaces
+//! the boundarys in each subspaces
 //! [FirstInU, LastInU]: The Bounds in U of the Approximation
 //! [FirstInV, LastInV]: The Bounds in V of the Approximation
 //! FavorIso : Give preference to extract u-iso or v-iso on F(U,V)
 //! This can be useful to optimize the <Func> method
 //! ContInU, ContInV : Continuity waiting in u and v
-//! PrecisCode : Precision on approximation's error measurement
+//! PrecisCode : Precision on approximation's error mesurement
 //! 1 : Fast computation and average precision
 //! 2 : Average computation and good precision
 //! 3 : Slow computation and very good precision

src/AdvApp2Var/AdvApp2Var_ApproxF2var.cxx

@@ -337,7 +337,7 @@ int mma1cdi_(integer *ndimen,
 /*     HERMIT: Table of coeff. 2*(IORDRE+1) Hermite polynoms */
 /*             of degree 2*IORDRE+1. */
 /*     IERCOD: Error code, */
-/*             = 0, Everything is OK */
+/*             = 0, Everythig is OK */
 /*             = 1, The value of IORDRE is out of (0,2) */
 /*     COMMON USED   : */
 /*     ---------------- */
@@ -989,8 +989,8 @@ int mma1fer_(integer *,//ndimen,
 /*     IORDRE: Order of constraint at the extremities of the border */
 /*              -1 = no constraints, */
 /*               0 = constraints of passage to limits (i.e. C0), */
-/*               1 = C0 + constraints of 1st derivatives (i.e. C1), */
+/*               1 = C0 + constraintes of 1st derivatives (i.e. C1), */
-/*               2 = C1 + constraints of 2nd derivatives (i.e. C2). */
+/*               2 = C1 + constraintes of 2nd derivatives (i.e. C2). */
 /*     NDGJAC: Degree of development in series to use for the calculation  */
 /*             in the base of Jacobi. */
 /*     CRVJAC: Table of coeff. of the curve of approximation in the */
@@ -1131,7 +1131,7 @@ int mma1fer_(integer *,//ndimen,
 
 /* ------------------------------ The end ------------------------------- 
 */
-/* --> The order of constraints is not within authorized values. */
+/* --> The order of constraints is not within autorized values. */
 L9100:
     *iercod = 1;
     goto L9999;
@@ -3520,7 +3520,7 @@ int AdvApp2Var_ApproxF2var::mma2cdi_( integer *ndimen,
 	    goto L9100;
 	}
 
-/* ---- Subtract discretizations of polynoms of constraints 
+/* ---- Subract discretizations of polynoms of constraints 
 ---- */
 
 	mma2cd3_(ndimen, nbpntu, &urootl[1], nbpntv, iordru, &sotbu1[1],
@@ -4919,7 +4919,7 @@ int mma2cfv_(integer *ndvjac,
 /*   MAXDGU: Degree maximum by U of coeff. to calculate. */
 /*   NBPNTV: Degree of the Legendre polynom on the roots which of */
 /*           the coefficients of integration by V are calculated */
-/*           by Gauss method. It is required that NBPNTV = 30, 40, 50 or 61 and NDVJAC < NBPNTV. */
+/*           by Gauss method. It is reqired that NBPNTV = 30, 40, 50 or 61 and NDVJAC < NBPNTV. */
 /*   GSSVTB: Table of coefficients of integration by Gauss method */
 /*           by V for NDVJAC fixed: j varies from 0 to NBPNTV/2. */
 /*   CHPAIR: Table of terms connected to degrees from MINDGU to MAXDGU by U to */
@@ -7511,7 +7511,7 @@ int mmmapcoe_(integer *ndim,
 
 /*     FUNCTION : */
 /*     ---------- */
-/*     Calculate the coefficients of polynomial approximation curve */
+/*     Calculate the coefficients of polinomial approximation curve */
 /*     of degree NDGJAC by the method of smallest squares starting from */
 /*     the discretization of function on the roots of Legendre polynom */
 /*     of degree NBPNTS. */
@@ -8102,7 +8102,7 @@ int mmjacpt_(const integer *ndimen,
 
 /*     OUTPUT ARGUMENTS : */
 /*     ------------------- */
-/*        PTCAUX : Auxiliary space. */
+/*        PTCAUX : Auxilliary space. */
 /*        PTCCAN : The square in the canonic base (-1,1) */
 
 /*     COMMONS USED   : */

src/AdvApp2Var/AdvApp2Var_MathBase.cxx

@@ -1229,7 +1229,7 @@ int AdvApp2Var_MathBase::mmaperx_(integer *ncofmx,
 /*        ERRMAX : Precision of the approximation. */
 /*        IERCOD = 0, OK */
 /*               = 1, order of constraints (IORDRE) is not within the */
-/*                    authorized values. */
+/*                    autorized values. */
 /*     COMMONS USED   : */
 /*     ---------------- */
 
@@ -2281,7 +2281,7 @@ int AdvApp2Var_MathBase::mmcglc1_(integer *ndimax,
 /*               length calculation. */
 /*      TFINAL : Upper limit of the interval of integration for */
 /*               length calculation. */
-/*      EPSILN : REQUIRED precision for length calculation. */
+/*      EPSILN : REQIRED precision for length calculation. */
 
 /*     OUTPUT ARGUMENTS : */
 /*     ------------------- */
@@ -2677,14 +2677,14 @@ int AdvApp2Var_MathBase::mmcvctx_(integer *ndimen,
 /*              2 --> cas (0)+ (1) +   "         "   2nd derivatives. */
 /*                 etc... */
 /*     CTRTES : Table of constraints. */
-/*              CTRTES(*,1,*) = constraints at -1. */
+/*              CTRTES(*,1,*) = contraints at -1. */
-/*              CTRTES(*,2,*) = constraints at  1. */
+/*              CTRTES(*,2,*) = contraints at  1. */
 
 /*     OUTPUT ARGUMENTS : */
 /*     ------------------- */
 /*     CRVRES : Resulting curve defined on (-1,1). */
-/*     TABAUX : Auxiliary matrix. */
+/*     TABAUX : Auxilliary matrix. */
-/*     XMATRI : Auxiliary matrix. */
+/*     XMATRI : Auxilliary matrix. */
 
 /*     COMMONS UTILISES   : */
 /*     ---------------- */
@@ -3560,7 +3560,7 @@ int AdvApp2Var_MathBase::mmdrvck_(integer *ncoeff,
  */
 
 
-/*     Factorials (1 to 21)  calculated on VAX in R*16 */
+/*     Factorials (1 to 21)  caculated on VAX in R*16 */
 
 
 /* ********************************************************************** 
@@ -3845,7 +3845,7 @@ int mmexthi_(integer *ndegre,
 /*   within the interval [0,1]. They are ranked for the degrees increasing from */
 /*   2 to 61. */
 /*   HILTAB : Table of Legendre interpolators concerning ROOTAB. */
-/*   The addressing is the same. */
+/*   The adressing is the same. */
 /*   HI0TAB : Table of Legendre interpolators for root x=0 */
 /*   of polynoms of UNEVEN degree. */
 /*   RTLTB0 : Table of Li(uk) where uk are the roots of */
@@ -3990,7 +3990,7 @@ int mmextrl_(integer *ndegre,
 /*   within the interval [0,1]. They are ranked for the degrees increasing from */
 /*   2 to 61. */
 /*   HILTAB : Table of Legendre interpolators concerning ROOTAB. */
-/*   The addressing is the same. */
+/*   The adressing is the same. */
 /*   HI0TAB : Table of Legendre interpolators for root x=0 */
 /*   of polynoms of UNEVEN degree. */
 /*   RTLTB0 : Table of Li(uk) where uk are the roots of */
@@ -4610,7 +4610,7 @@ int AdvApp2Var_MathBase::mmfmcb5_(integer *isenmsc,
 
 /*     FUNCTION : */
 /*     ---------- */
-/*       Reformatting (and eventual compression/decompression) of curve */
+/*       Reformating (and  eventual compression/decompression) of curve */
 /*       (ndim,.) by (.,ndim) and vice versa. */
 
 /*     KEYWORDS : */
@@ -6260,7 +6260,7 @@ L9999:
 
 /*     OUTPUT ARGUMENTS : */
 /*     ------------------- */
-/*        POLAUX : Auxiliary space. */
+/*        POLAUX : Auxilliary space. */
 /*        CRVCAN : The curve in the canonic base [-1,1] */
 
 /*     COMMONS USED   : */
@@ -6297,7 +6297,7 @@ L9999:
 
     i__1 = *ndim;
     for (nd = 1; nd <= i__1; ++nd) {
-/*  Loading of the auxiliary table. */
+/*  Loading of the auxilliary table. */
 	ii = 0;
 	i__2 = ndeg / 2;
 	for (i__ = 0; i__ <= i__2; ++i__) {
@@ -6377,7 +6377,7 @@ int mmloncv_(integer *ndimax,
 /*     -------------------- */
 
 /*      NDIMAX : Max number of lines of tables (max number of polynoms). */
-/*      NDIMEN : Dimension of the polynom (Number of polynoms). */
+/*      NDIMEN : Dimension of the polynom (Nomber of polynoms). */
 /*      NCOEFF : Number of coefficients of the polynom (no limitation) */
 /*               This is degree + 1 */
 /*      COURBE : Coefficients of the polynom ordered by increasing power */
@@ -6606,7 +6606,7 @@ L9900:
 /*     FUNCTION : */
 /*     ---------- */
 /*       Position on the polynoms of base hermit-Jacobi */
-/*       and their successive derivatives */
+/*       and their succesive derivatives */
 
 /*     KEYWORDS : */
 /*     ----------- */
@@ -7160,7 +7160,7 @@ int mmpojac_(doublereal *tparam,
  */
 
 
-/*     static variables */
+/*     static varaibles */
 
 
 
@@ -7519,12 +7519,12 @@ L9999:
 
 /*     INPUT ARGUMENTS : */
 /*     -------------------- */
-/*      HDIMEN: NUMBER OF LINE (OR COLUMN) OF THE HESSIAN MATRIX */
+/*      HDIMEN: NOMBER OF LINE (OR COLUMN) OF THE HESSIAN MATRIX */
-/*      GDIMEN: NUMBER OF LINE OF THE MATRIX OF CONSTRAINTS */
+/*      GDIMEN: NOMBER OF LINE OF THE MATRIX OF CONSTRAINTS */
-/*      HNSTOC: NUMBERS OF TERMS IN THE PROFILE OF HESSIAN MATRIX 
+/*      HNSTOC: NOMBErS OF TERMS IN THE PROFILE OF HESSIAN MATRIX 
 */
-/*      GNSTOC: NUMBERS OF TERMS IN THE PROFILE OF THE MATRIX OF CONSTRAINTS */
+/*      GNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX OF CONSTRAINTS */
-/*      MNSTOC: NUMBERS OF TERMS IN THE PROFILE OF THE MATRIX M= G H t(G) */
+/*      MNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX M= G H t(G) */
 /*              where H IS THE HESSIAN MATRIX AND G IS THE MATRIX OF CONSTRAINTS */
 /*      MATSYH: TRIANGULAR INFERIOR PART OF THE HESSIAN MATRIX */
 /*              IN FORM OF PROFILE */
@@ -7896,7 +7896,7 @@ int mmrslss_(integer *,//mxcoef,
 /*     ----------------------------------- */
 /*       T */
 /*     SS  is the decomposition of choleski of a symmetric matrix */
-/*     defined positive, that can result from routine MMCHOLE. */
+/*     defined postive, that can result from routine MMCHOLE. */
 
 /*     For a full matrix it is possible to use MRSLMSC */
 
@@ -8409,7 +8409,7 @@ L9999:
 /* > */
 /* ********************************************************************** 
 */
-/*   Name of the routine */
+/*   Nome of the routine */
 
 
 /*   Common MLGDRTL: */
@@ -8675,7 +8675,7 @@ int mmtmave_(integer *nligne,
 /*     INPUT ARGUMENTS : */
 /*     -------------------- */
 /*       NLIGNE : NUMBER OF LINE OF THE MATRIX */
-/*       NCOLON : NUMBER OF COLUMN OF THE MATRIX */
+/*       NCOLON : NOMBER OF COLUMN OF THE MATRIX */
 /*       GPOSIT: TABLE OF POSITIONING OF TERMS OF STORAGE */
 /*               GPOSIT(1,I) CONTAINS THE NUMBER of TERMS-1 ON LINE */
 /*               I IN THE PROFILE OF THE MATRIX */
@@ -11193,7 +11193,7 @@ L9900:
 
 /*     FUNCTION : */
 /*     ---------- */
-/*        SERVES to calculate the euclidean norm of a vector : */
+/*        SERVES to calculate the euclidian norm of a vector : */
 /*                       ____________________________ */
 /*                  Z = V  V(1)**2 + V(2)**2 + ... */
 
@@ -11208,7 +11208,7 @@ L9900:
 
 /*     OUTPUT ARGUMENTS : */
 /*     ------------------- */
-/*        MZSNORM : Value of the euclidean norm of vector VECTEU */
+/*        MZSNORM : Value of the euclidian norm of vector VECTEU */
 
 /*     COMMONS USED   : */
 /*     ---------------- */

src/AdvApp2Var/AdvApp2Var_SysBase.cxx

@@ -416,7 +416,7 @@ int AdvApp2Var_SysBase::macrchk_()
 
 /*     FONCTION : */
 /*     ---------- */
-/*        TABLE OF MANAGEMENT OF DYNAMIC MEMORY ALLOCATIONS */
+/*        TABLE OF MANAGEMENT OF DYNAMIC MEMOTY ALLOCATIONS */
 
 /*     KEYWORDS : */
 /*     ----------- */
@@ -2484,7 +2484,7 @@ int mcrfree_(integer *,//ibyte,
 /*                                                                        */
 /*                   = 0  ==> OK                                          */
 /*                   = 1  ==> Allocation impossible                       */
-/*                   = -1 ==> Offset > 2**31 - 1                          */
+/*                   = -1 ==> Ofset > 2**31 - 1                           */
 /*                                                                        */
 
 /*                                                                        */

src/AdvApprox/AdvApprox_SimpleApprox.hxx

@@ -32,7 +32,7 @@
 class PLib_JacobiPolynomial;
 
 
-//! Approximate  a function on   an interval [First,Last]
+//! Approximate  a function on   an intervall [First,Last]
 //! The result  is  a simple  polynomial  whose  degree is  as low as
 //! possible  to   satisfy  the required  tolerance  and  the
 //! maximum degree.  The maximum  error and the averrage error

src/Approx/Approx_SweepFunction.hxx

@@ -68,7 +68,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const = 0;
   
-  //! Returns if the sections are rational or not
+  //! Returns if the sections are rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const = 0;
   
   //! Returns  the number  of  intervals for  continuity

src/Aspect/Aspect_DisplayConnection.hxx

@@ -27,7 +27,7 @@ struct Aspect_XVisualInfo;
 //! This class creates and provides connection with X server.
 //! Raises exception if can not connect to X server.
 //! On Windows and Mac OS X (in case when Cocoa used) platforms this class does nothing.
-//! WARNING: Do not close display connection manually!
+//! WARRNING: Do not close display connection manually!
 class Aspect_DisplayConnection : public Standard_Transient
 {
   DEFINE_STANDARD_RTTIEXT(Aspect_DisplayConnection, Standard_Transient)

src/BOPAlgo/BOPAlgo_Builder_2.cxx

@@ -223,7 +223,7 @@ typedef NCollection_Vector<BOPAlgo_VFI> BOPAlgo_VectorOfVFI;
 //=======================================================================
 void BOPAlgo_Builder::FillImagesFaces(const Message_ProgressRange& theRange)
 {
-  Message_ProgressScope aPS(theRange, "Filling splits of faces", 10);
+  Message_ProgressScope aPS(theRange, "Filing spligs of faces", 10);
   BuildSplitFaces(aPS.Next(9));
   if (HasErrors())
   {

src/BOPAlgo/BOPAlgo_PaveFiller_3.cxx

@@ -341,8 +341,12 @@ void BOPAlgo_PaveFiller::PerformEE(const Message_ProgressRange& theRange)
       GeomAbs_CurveType aType1 = aBAC1.GetType();
       GeomAbs_CurveType aType2 = aBAC2.GetType();
       //
-      bAnalytical = (aType1 == GeomAbs_Line && aType2 == GeomAbs_Circle) ||
+      bAnalytical = (((aType1 == GeomAbs_Line) &&
-                    (aType1 == GeomAbs_Circle && aType2 == GeomAbs_Line);
+                      (aType2 == GeomAbs_Line ||
+                       aType2 == GeomAbs_Circle)) ||
+                     ((aType2 == GeomAbs_Line) &&
+                      (aType1 == GeomAbs_Line ||
+                       aType1 == GeomAbs_Circle)));
     }
     //
     for (i=1; i<=aNbCPrts; ++i) {
@@ -439,7 +443,7 @@ void BOPAlgo_PaveFiller::PerformEE(const Message_ProgressRange& theRange)
 
           Standard_Real aTolVnew = BRep_Tool::Tolerance(aVnew);
           if (bAnalytical) {
-            // increase tolerance for Line/Circle intersection, but do not update 
+            // increase tolerance for Line/Line intersection, but do not update 
             // the vertex till its intersection with some other shape
             Standard_Real aTolMin = (BRepAdaptor_Curve(aE1).GetType() == GeomAbs_Line) ?
               (aCR1.Last() - aCR1.First()) / 2. : (aCR2.Last() - aCR2.First()) / 2.;

src/BOPTools/BOPTools_AlgoTools.cxx

@@ -1925,7 +1925,7 @@ Standard_Boolean BOPTools_AlgoTools::IsBlockInOnFace
   }
   //
 
-  // Treatment intermediate
+  // Treatment intemediate
   Standard_Real m1, aTolF, aTolE, aTol, aDist;
   m1=IntTools_Tools::IntermediatePoint(f1, l1);
   BOPTools_AlgoTools::PointOnEdge(aE1, m1, aP12);

src/BOPTools/BOPTools_AlgoTools.hxx

@@ -182,7 +182,7 @@ public: //! @name Point/Edge/Face classification relatively solid
   //! Computes the 3-D state of the point thePoint
   //! toward solid theSolid.
   //! theTol - value of precision of computation
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   //! Returns 3-D state.
   Standard_EXPORT static TopAbs_State ComputeState(const gp_Pnt& thePoint,
                                                    const TopoDS_Solid& theSolid,
@@ -192,7 +192,7 @@ public: //! @name Point/Edge/Face classification relatively solid
   //! Computes the 3-D state of the vertex theVertex
   //! toward solid theSolid.
   //! theTol - value of precision of computation
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   //! Returns 3-D state.
   Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Vertex& theVertex,
                                                    const TopoDS_Solid& theSolid,
@@ -202,7 +202,7 @@ public: //! @name Point/Edge/Face classification relatively solid
   //! Computes the 3-D state of the edge theEdge
   //! toward solid theSolid.
   //! theTol - value of precision of computation
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   //! Returns 3-D state.
   Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Edge& theEdge,
                                                   const TopoDS_Solid& theSolid,
@@ -213,7 +213,7 @@ public: //! @name Point/Edge/Face classification relatively solid
   //! toward solid theSolid.
   //! theTol - value of precision of computation
   //! theBounds - set of edges of <theSolid> to avoid
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   //! Returns 3-D state.
   Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Face& theFace,
                                                    const TopoDS_Solid& theSolid,
@@ -224,7 +224,7 @@ public: //! @name Point/Edge/Face classification relatively solid
   //! Computes the 3-D state of the shape theShape
   //! toward solid theSolid.
   //! theTol - value of precision of computation
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   //! Returns 3-D state.
   Standard_EXPORT static TopAbs_State ComputeStateByOnePoint(const TopoDS_Shape& theShape,
                                                              const TopoDS_Solid& theSolid,
@@ -274,7 +274,7 @@ public: //! @name Face classification relatively solid
   //! solid theSolid.
   //! theMEF - Map Edge/Faces for theSolid
   //! theTol - value of precision of computation
-  //! theContext- cached geometrical tools
+  //! theContext- cahed geometrical tools
   Standard_EXPORT static Standard_Boolean IsInternalFace(const TopoDS_Face& theFace,
                                                          const TopoDS_Solid& theSolid,
                                                          TopTools_IndexedDataMapOfShapeListOfShape& theMEF,

src/BRepAlgo/BRepAlgo_FaceRestrictor.hxx

@@ -51,10 +51,10 @@ public:
   //! Warning:
   //! The Wires must be closed.
   //!
-  //! The edges of <W> can be modified if they don't have
+  //! The edges of <W> can be modified if they  have not pcurves
-  //! pcurves on the surface <S> of <F>. In this case
+  //! on the surface <S>  of <F>. In this  case
   //! if <Proj> is false the first pcurve of  the edge
-  //! is positioned on <S>.
+  //! is positionned on <S>.
   //! if <Proj> is True ,the Pcurve On <S> is the
   //! projection of the  curve 3d on <F>.
   Standard_EXPORT void Add (TopoDS_Wire& W);

src/BRepAlgo/BRepAlgo_Loop.hxx

@@ -86,13 +86,13 @@ public:
   
   Standard_EXPORT void VerticesForSubstitute (TopTools_DataMapOfShapeShape& VerVerMap);
 
-  //! Set maximal tolerance used for comparing distances between vertices. 
+  //! Set maximal tolerance used for comparing distaces between vertices. 
   void SetTolConf(const Standard_Real theTolConf)
   {
     myTolConf = theTolConf;
   }
 
-  //! Get maximal tolerance used for comparing distances between vertices. 
+  //! Get maximal tolerance used for comparing distaces between vertices. 
   Standard_Real GetTolConf() const
   {
     return myTolConf;

src/BRepBlend/BRepBlend_AppFuncRoot.cxx

@@ -49,7 +49,7 @@ BRepBlend_AppFuncRoot::BRepBlend_AppFuncRoot(Handle(BRepBlend_Line)& Line,
   //  Tables
   Func.GetShape( NbPoles, NbKnots, Degree, NbPoles2d);
   
-  // Calculation of BaryCentre (rational case).
+  // Calculation of BaryCentre (rationnal case).
   if (Func.IsRational()) {
     Standard_Real Xmax =-1.e100, Xmin = 1.e100, 
     Ymax =-1.e100, Ymin = 1.e100, 

src/BRepBlend/BRepBlend_AppFuncRoot.hxx

@@ -69,7 +69,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const Standard_OVERRIDE;
   
-  //! Returns if the section is rational or not
+  //! Returns if the section is rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns  the number  of  intervals for  continuity
@@ -95,7 +95,7 @@ public:
   Standard_EXPORT virtual void Resolution (const Standard_Integer Index, const Standard_Real Tol, Standard_Real& TolU, Standard_Real& TolV) const Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary (in radian)
   //! SurfTol error inside the surface.

src/BRepBlend/BRepBlend_RstRstConstRad.hxx

@@ -139,7 +139,7 @@ public:
   
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U, const Standard_Real V, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -162,7 +162,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BRepBlend/BRepBlend_RstRstEvolRad.hxx

@@ -140,7 +140,7 @@ public:
   
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U, const Standard_Real V, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -163,7 +163,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BRepBlend/BRepBlend_SurfRstConstRad.hxx

@@ -133,7 +133,7 @@ public:
   
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U, const Standard_Real V, const Standard_Real W, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -156,7 +156,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BRepBlend/BRepBlend_SurfRstEvolRad.hxx

@@ -132,7 +132,7 @@ public:
   
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U, const Standard_Real V, const Standard_Real W, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -155,7 +155,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BRepClass/BRepClass_FaceExplorer.cxx

@@ -202,7 +202,7 @@ Standard_Boolean BRepClass_FaceExplorer::OtherSegment(const gp_Pnt2d& P,
               // is tangent to the edge curve. This condition is bad for classification.
               // Therefore try to go to another point in the hope that there will be 
               // no tangent. If there tangent is preserved then leave the last point in 
-              // order to get this edge chance to participate in classification.
+              // order to get this edge chanse to participate in classification.
               if (myCurEdgePar + Probing_Step < Probing_End)
                 continue;
             }

src/BRepExtrema/BRepExtrema_ProximityDistTool.cxx

@@ -95,7 +95,7 @@ void BRepExtrema_ProximityDistTool::LoadAdditionalPointsFirstSet (const BVH_Arra
 
 //=======================================================================
 //function : goThroughtSet1
-//purpose  : Goes through vertices from the 1st set
+//purpose  : Goes throught vertices from the 1st set
 //=======================================================================
 void BRepExtrema_ProximityDistTool::goThroughtSet1 (const BVH_Array3d& theVertices1,
                                                     const Standard_Boolean theIsAdditionalSet)

src/BRepExtrema/BRepExtrema_ProximityDistTool.hxx

@@ -88,7 +88,7 @@ public:
 
 public:
 
-  //! Creates new uninitialized tool.
+  //! Creates new unitialized tool.
   Standard_EXPORT BRepExtrema_ProximityDistTool();
 
   //! Creates new tool for the given element sets.
@@ -169,7 +169,7 @@ protected:
 
 private:
 
-  //! Goes through vertices from the 1st set.
+  //! Goes throught vertices from the 1st set.
   void goThroughtSet1 (const BVH_Array3d& aVertices1,
                        const Standard_Boolean theIsAdditionalSet);
 

src/BRepExtrema/BRepExtrema_ProximityValueTool.cxx

@@ -27,7 +27,7 @@
 
 //=======================================================================
 //function : BRepExtrema_ProximityValueTool
-//purpose  : Creates new uninitialized proximity tool
+//purpose  : Creates new unitialized proximity tool
 //=======================================================================
 BRepExtrema_ProximityValueTool::BRepExtrema_ProximityValueTool()
 : myIsRefinementRequired1 (Standard_False),
@@ -262,8 +262,8 @@ Standard_Boolean BRepExtrema_ProximityValueTool::getEdgeAdditionalVertices (
 //=======================================================================
 //function : doRecurTrgSplit
 //purpose  : Splits the triangle into two ones recursively, halving the longest side
-//           until the area of ​​the current triangle > input step
+//           untill the area of ​​the current triangle > input step
-//! @param theTrg points of the triangle to be split
+//! @param theTrg points of the triangle to be splitted
 //! @param theEdgesStatus status of triangle edges - on the border or middle of the face
 //! @param theTol telerance used in search of coincidence points
 //! @param theStep minimum area of ​​the resulting triangle

src/BRepExtrema/BRepExtrema_ProximityValueTool.hxx

@@ -90,7 +90,7 @@ class BRepExtrema_ProximityValueTool
 
 public:
 
-  //! Creates new uninitialized proximity tool.
+  //! Creates new unitialized proximity tool.
   Standard_EXPORT BRepExtrema_ProximityValueTool();
 
   //! Creates new proximity tool for the given element sets.

src/BRepExtrema/BRepExtrema_ShapeProximity.hxx

@@ -194,7 +194,7 @@ private:
 
   //! Reference point of the proximity value on the 1st shape.
   gp_Pnt myProxPoint1;
-  //! Reference point of the proximity value on the 2nd shape.
+  //! Reference point of the proximity value on the 2st shape.
   gp_Pnt myProxPoint2;
 
   //! Status of reference points of the proximity value.

src/BRepFill/BRepFill_Draft.cxx

@@ -541,7 +541,7 @@ static Standard_Boolean GoodOrientation(const Bnd_Box& B,
 
   if (!Surf.IsNull()) { // Add the face at end
 
-  // Waiting the use of traces & restriction in BRepFill_Sweep
+  // Waiting the use of traces & retriction in BRepFill_Sweep
   // Make Fuse.
     BRepLib_MakeFace MkF;
     MkF.Init(Surf, Standard_True, Precision::Confusion());

src/BRepFill/BRepFill_Evolved.cxx

@@ -3144,7 +3144,7 @@ void CutEdgeProf (const TopoDS_Edge&                  E,
 
 //=======================================================================
 //function : CutEdge
-//purpose  : Cut an edge at the extrema of curves and at points of inflexion.
+//purpose  : Cut an edge at thw extrema of curves and at points of inflexion.
 //           Closed circles are also cut in two.
 //           If <Cuts> are empty the edge is not modified.
 //           The first and the last vertex of the original edge 

src/BRepFill/BRepFill_LocationLaw.hxx

@@ -122,18 +122,18 @@ public:
 protected:
 
   
-  //! Initialize all the fields, this methode has to
+  //! Initialize all the fields, this methode have to
   //! be called by the constructors of Inherited class.
   Standard_EXPORT void Init (const TopoDS_Wire& Path);
   
-  //! To preserve if possible the Tangent in transformations
+  //! To preseve if possible  the Tangent in transformations
   //! It is the default mode.
   Standard_EXPORT void TangentIsMain();
   
-  //! To preserve if possible the Normal in transformations
+  //! To preseve if possible the Normal in transformations
   Standard_EXPORT void NormalIsMain();
   
-  //! To preserve if possible the BiNormal in transformations
+  //! To preseve if possible the BiNormal in transformations
   Standard_EXPORT void BiNormalIsMain();
 
   TopoDS_Wire myPath;

src/BRepFill/BRepFill_Pipe.cxx

@@ -501,7 +501,7 @@ TopoDS_Shape BRepFill_Pipe::Section(const TopoDS_Vertex& VSpine) const
 
 TopoDS_Wire BRepFill_Pipe::PipeLine(const gp_Pnt& Point)
 {
- // Positioning 
+ // Postioning 
  gp_Pnt P;
  P = Point;
  P.Transform(myTrsf);

src/BRepFill/BRepFill_PipeShell.cxx

@@ -1155,7 +1155,7 @@ void BRepFill_PipeShell::Generated(const TopoDS_Shape&   theShape,
 
 //=======================================================================
 //function : Place
-//purpose  : Implement a Section in the local reference frame
+//purpose  : Implement a Section in the local refernce frame
 //           and return its parameter on the trajectory
 //=======================================================================
 void BRepFill_PipeShell::Place(const BRepFill_Section& Sec,

src/BRepFill/BRepFill_PipeShell.hxx

@@ -48,7 +48,7 @@ class BRepFill_PipeShell;
 DEFINE_STANDARD_HANDLE(BRepFill_PipeShell, Standard_Transient)
 
 //! Computes a topological shell using some wires
-//! (spines and profiles) and displacement option
+//! (spines and profiles) and diplacement option
 //! Perform general sweeping construction
 class BRepFill_PipeShell : public Standard_Transient
 {
@@ -116,7 +116,7 @@ public:
   //! to be C0.
   //! Give section to sweep.
   //! Possibilities are :
-  //! - Give one or several profile
+  //! - Give one or sevral profile
   //! - Give one profile and an homotetic law.
   //! - Automatic compute of correspondence between profile, and section on the sweeped shape
   //! - correspondence between profile, and section on the sweeped shape defined by a vertex of the spine
@@ -153,7 +153,7 @@ public:
   Standard_EXPORT void SetTransition (const BRepFill_TransitionStyle Mode = BRepFill_Modified, const Standard_Real Angmin = 1.0e-2, const Standard_Real Angmax = 6.0);
   
   //! Perform simulation of the sweep :
-  //! Some Section are returned.
+  //! Somes Section are returned.
   Standard_EXPORT void Simulate (const Standard_Integer NumberOfSection, TopTools_ListOfShape& Sections);
   
   //! Builds the resulting shape (redefined from MakeShape).

src/BRepFill/BRepFill_Sweep.cxx

@@ -2890,7 +2890,7 @@ BRepFill_Sweep::BRepFill_Sweep(const Handle(BRepFill_SectionLaw)& Section,
 
 //=======================================================================
 //function : Build
-//purpose  : Construct the result of sweeping
+//purpose  : Construt the result of sweeping
 //======================================================================
 void BRepFill_Sweep::Build(TopTools_MapOfShape& ReversedEdges,
                            BRepFill_DataMapOfShapeHArray2OfShape& Tapes,

src/BRepFill/BRepFill_Sweep.hxx

@@ -64,7 +64,7 @@ public:
   //! Tolerance  To controle Corner management.
   //!
   //! If the discontinuity is lesser than <AngleMin> in radian The
-  //! Transition Performed will be always "Modified"
+  //! Transition Performed will be alway "Modified"
   Standard_EXPORT void SetAngularControl (const Standard_Real AngleMin = 0.01, const Standard_Real AngleMax = 6.0);
   
   //! Set the flag that indicates attempt to approximate
@@ -78,7 +78,7 @@ public:
   //! - GeomFill_Section : The composed Function Location X Section
   //! is directly approximated.
   //! - GeomFill_Location : The location law is approximated, and the
-  //! SweepSurface builds an algebraic composition
+  //! SweepSurface is bulid algebric composition
   //! of approximated location law and section law
   //! This option is Ok, if Section.Surface() methode
   //! is effective.

src/BRepOffsetAPI/BRepOffsetAPI_FindContigousEdges.hxx

@@ -37,7 +37,7 @@ class TopoDS_Edge;
 //! - define if necessary a new tolerance
 //! - set if necessary analysis of degenerated shapes off
 //! - add shapes to be controlled -> Add
-//! - compute -> Perform
+//! - compute -> Perfom
 //! - output couples of connected edges for control
 //! - output the problems if any
 class BRepOffsetAPI_FindContigousEdges 

src/BRepOffsetAPI/BRepOffsetAPI_MakeOffset.cxx

@@ -166,7 +166,7 @@ void BRepOffsetAPI_MakeOffset::Init(const GeomAbs_JoinType Join,
 //=======================================================================
 //function : SetApprox
 //purpose  : Set approximation flag
-//           for conversion input contours into ones consisting of
+//           for convertion input contours into ones consisting of
 //           2D circular arcs and 2D linear segments only
 //=======================================================================
 

src/BRepOffsetAPI/BRepOffsetAPI_MakeOffset.hxx

@@ -64,7 +64,7 @@ public:
   Standard_EXPORT void Init (const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
   
   //! Set approximation flag
-  //! for conversion input contours into ones consisting of
+  //! for convertion input contours into ones consisting of
   //! 2D circular arcs and 2D linear segments only.
   Standard_EXPORT void SetApprox (const Standard_Boolean ToApprox);
   

src/BRepOffsetAPI/BRepOffsetAPI_MakeOffsetShape.hxx

@@ -114,7 +114,7 @@ public:
                                      const Standard_Boolean RemoveIntEdges = Standard_False,
                                      const Message_ProgressRange& theRange = Message_ProgressRange());
 
-  //! Returns instance of the underlying intersection / arc algorithm.
+  //! Returns instance of the unrelying intersection / arc algorithm.
   Standard_EXPORT virtual const BRepOffset_MakeOffset& MakeOffset() const;
 
   //! Does nothing.

src/BRepOffsetAPI/BRepOffsetAPI_MakePipeShell.hxx

@@ -112,7 +112,7 @@ public:
   //! along the path.
   //! Give section to sweep.
   //! Possibilities are :
-  //! - Give one or several section
+  //! - Give one or sevral section
   //! - Give one profile and an homotetic law.
   //! - Automatic compute of correspondence between spine, and section
   //! on the sweeped shape

src/BRepTest/BRepTest_Fillet2DCommands.cxx

@@ -306,7 +306,7 @@ static Standard_Integer fillet2d(Draw_Interpretor& di, Standard_Integer n, const
   Standard_Boolean status = algo.Perform(radius);
   if (!status)
   {
-    di << "Error: the algorithm failed.";
+    di << "Error: the algrithm failed.";
     return 1;
   }
 
@@ -326,7 +326,7 @@ static Standard_Integer fillet2d(Draw_Interpretor& di, Standard_Integer n, const
   TopoDS_Edge fillet = algo.Result(common, M1, M2);
   if (fillet.IsNull())
   {
-    di << "Error: the algorithm produced no result.";
+    di << "Error: the algrithm produced no result.";
     return 1;
   }
 
@@ -403,7 +403,7 @@ static Standard_Integer chamfer2d(Draw_Interpretor& di, Standard_Integer n, cons
   TopoDS_Edge chamfer = algo.Result(M1, M2, length1, length2);
   if (chamfer.IsNull())
   {
-    di << "Error: the algorithm produced no result.";
+    di << "Error: the algrithm produced no result.";
     return 1;
   }
 

src/BRepTools/BRepTools_ReShape.cxx

@@ -11,7 +11,7 @@
 // Alternatively, this file may be used under the terms of Open CASCADE
 // commercial license or contractual agreement.
 
-//    abv 28.04.99 S4137: adding method Apply for work on all types of shapes
+//    abv 28.04.99 S4137: ading method Apply for work on all types of shapes
 //    sln 29.11.01 Bug24: correction iteration through map in method 'Status'
 //    sln 29.11.01 Bug22: correction of methods Replace and Value for case when mode myConsiderLocation is on
 
@@ -362,7 +362,7 @@ TopoDS_Shape BRepTools_ReShape::Apply (const TopoDS_Shape& shape,
   if(st == TopAbs_VERTEX || st == TopAbs_SHAPE)
     return shape;
   // define allowed types of components
-  //fix for SAMTECH bug OCC322 about absent internal vertices after sewing. 
+  //fix for SAMTECH bug OCC322 about abcense internal vertices after sewing. 
   /*
   switch ( st ) {
   case TopAbs_COMPOUND:  subt = TopAbs_SHAPE;  break;
@@ -402,14 +402,14 @@ TopoDS_Shape BRepTools_ReShape::Apply (const TopoDS_Shape& shape,
     if ( isEmpty )
       isEmpty = Standard_False;
     locStatus |= EncodeStatus(3);//ShapeExtend::EncodeStatus ( ShapeExtend_DONE3 );
-    if ( st == TopAbs_COMPOUND || newsh.ShapeType() == sh.ShapeType()) { //fix for SAMTECH bug OCC322 about absent internal vertices after sewing.
+    if ( st == TopAbs_COMPOUND || newsh.ShapeType() == sh.ShapeType()) { //fix for SAMTECH bug OCC322 about abcense internal vertices after sewing.
       B.Add ( result, newsh );
       continue;
     }
     Standard_Integer nitems = 0;
     for ( TopoDS_Iterator subit(newsh); subit.More(); subit.Next(), nitems++ ) {
       const TopoDS_Shape& subsh = subit.Value();
-      if ( subsh.ShapeType() == sh.ShapeType() ) B.Add ( result, subsh );//fix for SAMTECH bug OCC322 about absent internal vertices after sewing.
+      if ( subsh.ShapeType() == sh.ShapeType() ) B.Add ( result, subsh );//fix for SAMTECH bug OCC322 about abcense internal vertices after sewing.
       else locStatus |= EncodeStatus(10);//ShapeExtend::EncodeStatus ( ShapeExtend_FAIL1 );
     }
     if ( ! nitems ) locStatus |= EncodeStatus(10);//ShapeExtend::EncodeStatus ( ShapeExtend_FAIL1 );

src/BRepTools/BRepTools_ShapeSet.hxx

@@ -72,7 +72,7 @@ public:
   //! Clears the content of the set.
   Standard_EXPORT virtual void Clear() Standard_OVERRIDE;
   
-  //! Stores the geometry of <S>.
+  //! Stores the goemetry of <S>.
   Standard_EXPORT virtual void AddGeometry (const TopoDS_Shape& S) Standard_OVERRIDE;
   
   //! Dumps the geometry of me on the stream <OS>.

src/BRepTools/BRepTools_TrsfModification.cxx

@@ -171,7 +171,7 @@ Standard_Boolean BRepTools_TrsfModification::NewTriangulation
   // modify normals
   if (theTriangulation->HasNormals())
   {
-    for (Standard_Integer anInd = 1; anInd <= theTriangulation->NbNodes(); ++anInd)
+    for (Standard_Integer anInd = 1; anInd <= theTriangulation->NbTriangles(); ++anInd)
     {
       gp_Dir aNormal = theTriangulation->Normal(anInd);
       aNormal.Transform(aTrsf);

src/BSplCLib/BSplCLib_CurveComputation.gxx

@@ -1263,7 +1263,7 @@ void BSplCLib::MovePoint (const Standard_Real            U,
     }
   }
   
-  // find a kk2 if symmetry
+  // find a kk2 if symetriy
   kk2 = kk1;
   i = kk1 - FirstNonZeroBsplineIndex + 2;
   if ((kk1+1) <= LastIndex) {

src/BSplSLib/BSplSLib.cxx

@@ -2845,7 +2845,7 @@ void BSplSLib::MovePoint (const Standard_Real            U,
     }
   }
 
-  // find a ukk2 if symmetry
+  // find a ukk2 if symetriy
   ukk2 = ukk1;
   i = ukk1 - UFirstNonZeroBsplineIndex + 2;
   if ((ukk1+1) <= ULastIndex) {
@@ -2871,7 +2871,7 @@ void BSplSLib::MovePoint (const Standard_Real            U,
     }
   }
 
-  // find a vkk2 if symmetry
+  // find a vkk2 if symetriy
   vkk2 = vkk1;
   j = vkk1 - VFirstNonZeroBsplineIndex + 2;
   if ((vkk1+1) <= VLastIndex) {

src/BSplSLib/BSplSLib_Cache.hxx

@@ -31,7 +31,7 @@ public:
   //! \param theDegreeU    degree along the first parameter (U) of the surface
   //! \param thePeriodicU  identify the surface is periodical along U axis
   //! \param theFlatKnotsU knots of the surface (with repetition) along U axis
-  //! \param theDegreeV    degree along the second parameter (V) of the surface
+  //! \param theDegreeV    degree alogn the second parameter (V) of the surface
   //! \param thePeriodicV  identify the surface is periodical along V axis
   //! \param theFlatKnotsV knots of the surface (with repetition) along V axis
   //! \param theWeights    array of weights of corresponding poles

src/Blend/Blend_AppFunction.hxx

@@ -115,7 +115,7 @@ public:
   //! Returns the point on the first support.
   Standard_EXPORT virtual const gp_Pnt& Pnt2() const = 0;
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT virtual Standard_Boolean IsRational() const = 0;
   
   //! Returns the length of the maximum section
@@ -145,7 +145,7 @@ public:
                                          Standard_Integer& NbPoles2d) = 0;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/Blend/Blend_CSFunction.hxx

@@ -148,7 +148,7 @@ public:
   Standard_EXPORT virtual void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE = 0;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/Blend/Blend_RstRstFunction.hxx

@@ -156,7 +156,7 @@ public:
   //! but  the  values  calculated can  be  senseless.
   Standard_EXPORT virtual Blend_DecrochStatus Decroch (const math_Vector& Sol, gp_Vec& NRst1, gp_Vec& TgRst1, gp_Vec& NRst2, gp_Vec& TgRst2) const = 0;
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT virtual Standard_Boolean IsRational() const = 0;
   
   //! Returns the length of the maximum section
@@ -180,7 +180,7 @@ public:
   Standard_EXPORT virtual void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) = 0;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/Blend/Blend_SurfRstFunction.hxx

@@ -150,7 +150,7 @@ public:
   //! specific to  the function.
   Standard_EXPORT virtual Standard_Boolean Decroch (const math_Vector& Sol, gp_Vec& NS, gp_Vec& TgS) const = 0;
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT virtual Standard_Boolean IsRational() const = 0;
   
   //! Returns the length of the maximum section
@@ -174,7 +174,7 @@ public:
   Standard_EXPORT virtual void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) = 0;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_CSCircular.hxx

@@ -129,7 +129,7 @@ public:
   
   Standard_EXPORT Standard_Boolean GetSection (const Standard_Real Param, const Standard_Real U, const Standard_Real V, const Standard_Real W, TColgp_Array1OfPnt& tabP, TColgp_Array1OfVec& tabV);
   
-  //! Returns if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -155,7 +155,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_CSConstRad.hxx

@@ -117,7 +117,7 @@ public:
   
   Standard_EXPORT Standard_Boolean GetSection (const Standard_Real Param, const Standard_Real U, const Standard_Real V, const Standard_Real W, TColgp_Array1OfPnt& tabP, TColgp_Array1OfVec& tabV);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -142,7 +142,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_ChAsym.hxx

@@ -111,7 +111,7 @@ public:
   //! Utile pour une visu rapide et approximative de la surface.
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Lin& C);
   
-  //! Returns if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -135,7 +135,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_ConstRad.cxx

@@ -62,7 +62,7 @@ BlendFunc_ConstRad::BlendFunc_ConstRad(const Handle(Adaptor3d_Surface)& S1,
                   distmin(RealLast()),
                   mySShape(BlendFunc_Rational)
 { 
-// Initialisation of cash control variables.
+// Initialisaton of cash control variables.
   tval = -9.876e100;
   xval.Init(-9.876e100);
   myXOrder = -1;

src/BlendFunc/BlendFunc_ConstRad.hxx

@@ -116,7 +116,7 @@ public:
   //! Utile pour une visu rapide et approximative de la surface.
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns  if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -140,7 +140,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_EvolRad.hxx

@@ -115,7 +115,7 @@ public:
   //! Method for graphic traces
   Standard_EXPORT void Section (const Standard_Real Param, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2, Standard_Real& Pdeb, Standard_Real& Pfin, gp_Circ& C);
   
-  //! Returns if the section is rational
+  //! Returns  if the section is rationnal
   Standard_EXPORT Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns the length of the maximum section
@@ -139,7 +139,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_GenChamfer.hxx

@@ -105,7 +105,7 @@ public:
                                  Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BlendFunc/BlendFunc_Ruled.hxx

@@ -127,7 +127,7 @@ public:
   Standard_EXPORT void GetShape (Standard_Integer& NbPoles, Standard_Integer& NbKnots, Standard_Integer& Degree, Standard_Integer& NbPoles2d) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary
   //! SurfTol error inside the surface.

src/BndLib/BndLib_AddSurface.cxx

@@ -215,7 +215,7 @@ static void TreatInfinitePlane(const gp_Pln        &aPlane,
 // theMinIdx - minimum poles index, that can be used.
 // theMaxIdx - maximum poles index, that can be used.
 // theShiftCoeff - shift between flatknots array and poles array.
-// This value should be equal to 1 in case of non periodic BSpline,
+// This vaule should be equal to 1 in case of non periodic BSpline,
 // and (degree + 1) - mults(the lowest index).
 
 void ComputePolesIndexes(const TColStd_Array1OfReal &theKnots,

src/CPnts/CPnts_AbscissaPoint.cxx

@@ -451,7 +451,7 @@ void CPnts_AbscissaPoint::Perform(const Standard_Real   Abscissa,
   }
   else {
     Standard_Real Ui = U0 + (Abscissa / myL) * (myUMax - myUMin) / 3.;
-    // exercise : why 3 ?
+    // exercice : why 3 ?
     Perform(Abscissa,U0,Ui,Resolution);
   }
 }

src/ChFi3d/ChFi3d_FilBuilder_C3.cxx

@@ -157,7 +157,7 @@ static Standard_Boolean SearchFD(TopOpeBRepDS_DataStructure& DStr,
 
 //=======================================================================
 //function : ToricCorner
-//purpose  : Test if this is a particular case of a torus corner 
+//purpose  : Test if this is a paricular cas of a torus corner 
 //           (or spherical limited by isos).
 //=======================================================================
 
@@ -601,7 +601,7 @@ void ChFi3d_FilBuilder::PerformThreeCorner(const Standard_Integer Jndex)
 #endif
       
       // the contour to be fillet consists of straight lines uv in beginning and end 
-      // of two pcurves (only one if c1pointu) calculated as possible
+      // of two pcurves (only one if c1pointu) calculted as possible
       // on piv and the opposite face.
       Handle(GeomFill_Boundary) Bdeb,Bfin,Bpiv,Bfac;
       Handle(Geom2d_Curve) PCurveOnFace;

src/Convert/Convert_CompPolynomialToPoles.hxx

@@ -51,7 +51,7 @@
 //! TrueIntervals : the nth polynomial has to be mapped linearly to be
 //! defined on the following interval :
 //! myTrueIntervals->Value(n) and myTrueIntervals->Value(n+1)
-//! so that it adequately represents the function with the
+//! so that it represent adequatly the function with the
 //! required continuity
 class Convert_CompPolynomialToPoles 
 {
@@ -85,7 +85,7 @@ public:
   //! TrueIntervals[2] = {-1, 1}
   Standard_EXPORT Convert_CompPolynomialToPoles(const Standard_Integer NumCurves, const Standard_Integer Continuity, const Standard_Integer Dimension, const Standard_Integer MaxDegree, const Handle(TColStd_HArray1OfInteger)& NumCoeffPerCurve, const Handle(TColStd_HArray1OfReal)& Coefficients, const Handle(TColStd_HArray2OfReal)& PolynomialIntervals, const Handle(TColStd_HArray1OfReal)& TrueIntervals);
   
-  //! To Convert several span with different order of Continuity.
+  //! To Convert sevral span with different order of Continuity.
   //! Warning: The Length of Continuity have to be NumCurves-1
   Standard_EXPORT Convert_CompPolynomialToPoles(const Standard_Integer NumCurves, const Standard_Integer Dimension, const Standard_Integer MaxDegree, const TColStd_Array1OfInteger& Continuity, const TColStd_Array1OfInteger& NumCoeffPerCurve, const TColStd_Array1OfReal& Coefficients, const TColStd_Array2OfReal& PolynomialIntervals, const TColStd_Array1OfReal& TrueIntervals);
   

src/Extrema/Extrema_ExtCS.hxx

@@ -60,7 +60,7 @@ public:
   Standard_EXPORT void Initialize (const Adaptor3d_Surface& S, const Standard_Real Uinf, const Standard_Real Usup, const Standard_Real Vinf, const Standard_Real Vsup, const Standard_Real TolC, const Standard_Real TolS);
   
   //! Computes the distances.
-  //! An exception is raised if the fields have not been
+  //! An exception is raised if the fieds have not been
   //! initialized.
   Standard_EXPORT void Perform (const Adaptor3d_Curve& C, const Standard_Real Uinf, const Standard_Real Usup);
   

src/Extrema/Extrema_ExtPS.hxx

@@ -72,7 +72,7 @@ public:
   Standard_EXPORT void Initialize (const Adaptor3d_Surface& S, const Standard_Real Uinf, const Standard_Real Usup, const Standard_Real Vinf, const Standard_Real Vsup, const Standard_Real TolU, const Standard_Real TolV);
   
   //! Computes the distances.
-  //! An exception is raised if the fields have not been
+  //! An exception is raised if the fieds have not been
   //! initialized.
   Standard_EXPORT void Perform (const gp_Pnt& P);
   

src/Extrema/Extrema_ExtSS.hxx

@@ -51,7 +51,7 @@ public:
   Standard_EXPORT void Initialize (const Adaptor3d_Surface& S2, const Standard_Real Uinf2, const Standard_Real Usup2, const Standard_Real Vinf2, const Standard_Real Vsup2, const Standard_Real TolS1);
   
   //! Computes the distances.
-  //! An exception is raised if the fields have not been
+  //! An exception is raised if the fieds have not been
   //! initialized.
   Standard_EXPORT void Perform (const Adaptor3d_Surface& S1, const Standard_Real Uinf1, const Standard_Real Usup1, const Standard_Real Vinf1, const Standard_Real Vsup1, const Standard_Real TolS1);
   

src/FairCurve/FairCurve_Energy.hxx

@@ -77,7 +77,7 @@ public:
 protected:
 
   
-  //! Angles correspond to the Ox axis
+  //! Angles corresspond to the Ox axis
   //! ConstrOrder1(2) can be equal to 0, 1 or 2
   Standard_EXPORT FairCurve_Energy(const Handle(TColgp_HArray1OfPnt2d)& Poles, const Standard_Integer ConstrOrder1, const Standard_Integer ConstrOrder2, const Standard_Boolean WithAuxValue = Standard_False, const Standard_Real Angle1 = 0, const Standard_Real Angle2 = 0, const Standard_Integer Degree = 2, const Standard_Real Curvature1 = 0, const Standard_Real Curvature2 = 0);
   
@@ -98,7 +98,7 @@ protected:
   //! compute  the  pole which depend of variables and G2 constraint
   Standard_EXPORT void ComputePolesG2 (const Standard_Integer Side, const Standard_Real Lambda, const Standard_Real Rho, const gp_Pnt2d& P1, gp_Pnt2d& P2) const;
   
-  //! compute the energy (and derivatives) in intermediate format
+  //! compute the energy (and derivatives) in intermediat format
   Standard_EXPORT virtual Standard_Boolean Compute (const Standard_Integer DerivativeOrder, math_Vector& Result) = 0;
 
 

src/FairCurve/FairCurve_EnergyOfBatten.hxx

@@ -45,7 +45,7 @@ public:
   DEFINE_STANDARD_ALLOC
 
   
-  //! Angles correspond to the Ox axis
+  //! Angles corresspond to the Ox axis
   Standard_EXPORT FairCurve_EnergyOfBatten(const Standard_Integer BSplOrder, const Handle(TColStd_HArray1OfReal)& FlatKnots, const Handle(TColgp_HArray1OfPnt2d)& Poles, const Standard_Integer ContrOrder1, const Standard_Integer ContrOrder2, const FairCurve_BattenLaw& Law, const Standard_Real LengthSliding, const Standard_Boolean FreeSliding = Standard_True, const Standard_Real Angle1 = 0, const Standard_Real Angle2 = 0);
   
   //! return  the  lengthSliding = P1P2 + Sliding
@@ -66,7 +66,7 @@ protected:
   //! compute  the  poles which correspond with the variable X
   Standard_EXPORT virtual void ComputePoles (const math_Vector& X) Standard_OVERRIDE;
   
-  //! compute the energy in intermediate format
+  //! compute the energy in intermediat format
   Standard_EXPORT virtual Standard_Boolean Compute (const Standard_Integer DerivativeOrder, math_Vector& Result) Standard_OVERRIDE;
 
 

src/FairCurve/FairCurve_EnergyOfMVC.hxx

@@ -45,7 +45,7 @@ public:
   DEFINE_STANDARD_ALLOC
 
   
-  //! Angles correspond to the Ox axis
+  //! Angles corresspond to the Ox axis
   Standard_EXPORT FairCurve_EnergyOfMVC(const Standard_Integer BSplOrder, const Handle(TColStd_HArray1OfReal)& FlatKnots, const Handle(TColgp_HArray1OfPnt2d)& Poles, const Standard_Integer ContrOrder1, const Standard_Integer ContrOrder2, const FairCurve_BattenLaw& Law, const Standard_Real PhysicalRatio, const Standard_Real LengthSliding, const Standard_Boolean FreeSliding = Standard_True, const Standard_Real Angle1 = 0, const Standard_Real Angle2 = 0, const Standard_Real Curvature1 = 0, const Standard_Real Curvature2 = 0);
   
   //! return  the  lengthSliding = P1P2 + Sliding
@@ -66,7 +66,7 @@ protected:
   //! compute  the  poles which correspond with the variable X
   Standard_EXPORT virtual void ComputePoles (const math_Vector& X) Standard_OVERRIDE;
   
-  //! compute the energy in intermediate format
+  //! compute the energy in intermediat format
   Standard_EXPORT virtual Standard_Boolean Compute (const Standard_Integer DerivativeOrder, math_Vector& Result) Standard_OVERRIDE;
 
 

src/GProp/GProp_PrincipalProps.hxx

@@ -60,7 +60,7 @@ public:
   //! returns true if the geometric system has an axis of symmetry.
   //! For  comparing  moments  relative  tolerance  1.e-10  is  used.
   //! Usually  it  is  enough  for  objects,  restricted  by  faces  with
-  //! analytical  geometry.
+  //! analitycal  geometry.
   Standard_EXPORT Standard_Boolean HasSymmetryAxis() const;
   
 
@@ -73,7 +73,7 @@ public:
   //! returns true if the geometric system has a point of symmetry.
   //! For  comparing  moments  relative  tolerance  1.e-10  is  used.
   //! Usually  it  is  enough  for  objects,  restricted  by  faces  with
-  //! analytical  geometry.
+  //! analitycal  geometry.
   Standard_EXPORT Standard_Boolean HasSymmetryPoint() const;
   
 

src/GProp/GProp_ValueType.hxx

@@ -17,7 +17,7 @@
 #ifndef _GProp_ValueType_HeaderFile
 #define _GProp_ValueType_HeaderFile
 
-//! Algorithms:
+//! Algorithmes :
 enum GProp_ValueType
 {
 GProp_Mass,

src/Geom2dConvert/Geom2dConvert.cxx

@@ -598,7 +598,7 @@ static void Pretreatment(TColGeom2d_Array1OfBSplineCurve& tab)
 
 //=======================================================================
 //function : NeedToBeTreated
-//purpose  : Say if the BSpline is rational and if the two first and two
+//purpose  : Say if the BSpline is rationnal and if the two first and two
 //           last weigths are different
 //=======================================================================    
 

src/GeomConvert/GeomConvert.cxx

@@ -616,7 +616,7 @@ static void Pretreatment(TColGeom_Array1OfBSplineCurve& tab)
 	 
 //=======================================================================
 //function : NeedToBeTreated
-//purpose  : Say if the BSpline is rational and if the two first and two
+//purpose  : Say if the BSpline is rationnal and if the two first and two
 //           last weigths are different
 //=======================================================================    
 

src/GeomFill/GeomFill_CircularBlendFunc.hxx

@@ -79,7 +79,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const Standard_OVERRIDE;
   
-  //! Returns if the section is rational or not
+  //! Returns if the section is rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns  the number  of  intervals for  continuity
@@ -100,7 +100,7 @@ public:
   Standard_EXPORT virtual void SetInterval (const Standard_Real First, const Standard_Real Last) Standard_OVERRIDE;
   
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary (in radian)
   //! SurfTol error inside the surface.

src/GeomFill/GeomFill_EvolvedSection.hxx

@@ -74,7 +74,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const Standard_OVERRIDE;
   
-  //! Returns if the sections are rational or not
+  //! Returns if the sections are rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns if the sections are periodic or not

src/GeomFill/GeomFill_NSections.hxx

@@ -100,7 +100,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const Standard_OVERRIDE;
   
-  //! Returns if the sections are rational or not
+  //! Returns if the sections are rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const Standard_OVERRIDE;
   
   //! Returns if the sections are periodic or not

src/GeomFill/GeomFill_SectionLaw.hxx

@@ -69,7 +69,7 @@ public:
   //! get the Multplicities of the section
   Standard_EXPORT virtual void Mults (TColStd_Array1OfInteger& TMults) const = 0;
   
-  //! Returns if the sections are rational or not
+  //! Returns if the sections are rationnal or not
   Standard_EXPORT virtual Standard_Boolean IsRational() const = 0;
   
   //! Returns if the sections are periodic or not

src/GeomFill/GeomFill_SweepFunction.hxx

@@ -99,7 +99,7 @@ public:
   Standard_EXPORT virtual void Resolution (const Standard_Integer Index, const Standard_Real Tol, Standard_Real& TolU, Standard_Real& TolV) const Standard_OVERRIDE;
 
   //! Returns the tolerance to reach in approximation
-  //! to respect
+  //! to respecte
   //! BoundTol error at the Boundary
   //! AngleTol tangent error at the Boundary (in radian)
   //! SurfTol error inside the surface.