OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-09 13:22:24 +03:00
Code Activity

0031939: Coding - correction of spelling errors in comments [part 10]

Browse Source 
Fix various typos via codespell.
This commit is contained in:
luz paz
2021-04-19 11:42:46 +03:00
committed by bugmaster
parent b69e576af0
commit 316ea29318
339 changed files with 1743 additions and 1972 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/NCollection/NCollection_Array2.hxx
View File

@@ -219,7 +219,7 @@ public:
//! Move assignment.
//! This array will borrow all the data from theOther.
//! The moved object will be left unitialized and should not be used anymore.
//! The moved object will be left uninitialized and should not be used anymore.
NCollection_Array2& Move (NCollection_Array2& theOther)
{
if (&theOther == this)

30
src/NCollection/NCollection_CellFilter.hxx
View File

@@ -45,7 +45,7 @@ enum NCollection_CellFilter_Action
* search for one bullet (more precisely, O(M) where M is number of cells covered
* by the bullet).
*
* The idea behind the algorithm is to separate each co-ordinate of the space
* The idea behind the algorithm is to separate each coordinate of the space
* into equal-size cells. Note that this works well when cell size is
* approximately equal to the characteristic size of the involved objects
* (targets and bullets; including tolerance eventually used for coincidence
@@ -56,7 +56,7 @@ enum NCollection_CellFilter_Action
* The target objects to be searched are added to the tool by methods Add();
* each target is classified as belonging to some cell(s). The data on cells
* (list of targets found in each one) are stored in the hash map with key being
* cumulative index of the cell by all co-ordinates.
* cumulative index of the cell by all coordinates.
* Thus the time needed to find targets in some cell is O(1) * O(number of
* targets in the cell).
*
@@ -123,7 +123,7 @@ public:
//! Constructor; initialized by dimension count and cell size.
//!
//! Note: the cell size must be ensured to be greater than
//! maximal co-ordinate of the involved points divided by INT_MAX,
//! maximal coordinate of the involved points divided by INT_MAX,
//! in order to avoid integer overflow of cell index.
//!
//! By default cell size is 0, which is invalid; thus if default
@@ -173,12 +173,12 @@ public:
}
//! Adds a target object for further search in the range of cells
//! defined by two points (the first point must have all co-ordinates equal or
//! less than the same co-ordinate of the second point)
//! defined by two points (the first point must have all coordinates equal or
//! less than the same coordinate of the second point)
void Add (const Target& theTarget,
const Point &thePntMin, const Point &thePntMax)
{
// get cells range by minimal and maximal co-ordinates
// get cells range by minimal and maximal coordinates
Cell aCellMin (thePntMin, myCellSize);
Cell aCellMax (thePntMax, myCellSize);
Cell aCell = aCellMin;
@@ -196,13 +196,13 @@ public:
//! Find a target object in the range of cells defined by two points and
//! remove it from the structures
//! (the first point must have all co-ordinates equal or
//! less than the same co-ordinate of the second point).
//! (the first point must have all coordinates equal or
//! less than the same coordinate of the second point).
//! For usage of this method "operator ==" should be defined for Target.
void Remove (const Target& theTarget,
const Point &thePntMin, const Point &thePntMax)
{
// get cells range by minimal and maximal co-ordinates
// get cells range by minimal and maximal coordinates
Cell aCellMin (thePntMin, myCellSize);
Cell aCellMax (thePntMax, myCellSize);
Cell aCell = aCellMin;
@@ -218,12 +218,12 @@ public:
}
//! Inspect all targets in the cells range limited by two given points
//! (the first point must have all co-ordinates equal or
//! less than the same co-ordinate of the second point)
//! (the first point must have all coordinates equal or
//! less than the same coordinate of the second point)
void Inspect (const Point& thePntMin, const Point& thePntMax,
Inspector &theInspector)
{
// get cells range by minimal and maximal co-ordinates
// get cells range by minimal and maximal coordinates
Cell aCellMin (thePntMin, myCellSize);
Cell aCellMax (thePntMax, myCellSize);
Cell aCell = aCellMin;
@@ -254,7 +254,7 @@ protected:
};
/**
* Auxilary structure representing a cell in the space.
* Auxiliary structure representing a cell in the space.
* Cells are stored in the map, each cell contains list of objects
* that belong to that cell.
*/
@@ -501,7 +501,7 @@ struct NCollection_CellFilter_InspectorXYZ
//! Points type
typedef gp_XYZ Point;
//! Access to co-ordinate
//! Access to coordinate
static Standard_Real Coord (int i, const Point &thePnt) { return thePnt.Coord(i+1); }
//! Auxiliary method to shift point by each coordinate on given value;
@@ -524,7 +524,7 @@ struct NCollection_CellFilter_InspectorXY
//! Points type
typedef gp_XY Point;
//! Access to co-ordinate
//! Access to coordinate
static Standard_Real Coord (int i, const Point &thePnt) { return thePnt.Coord(i+1); }
//! Auxiliary method to shift point by each coordinate on given value;

2
src/NCollection/NCollection_DefineArray1.hxx
View File

@@ -25,7 +25,7 @@
// Array1OfItem tttab (ttab(10),10,20); // a slice of ttab
// If you want to reindex an array from 1 to Length do :
// Array1 tab1(tab(tab.Lower()),1,tab.Length());
// Warning: Programs client of such a class must be independant
// Warning: Programs client of such a class must be independent
// of the range of the first element. Then, a C++ for
// loop must be written like this
// for (i = A.Lower(); i <= A.Upper(); i++)

2
src/NCollection/NCollection_DefineArray2.hxx
View File

@@ -17,7 +17,7 @@
// Purpose: The class Array2 represents bi-dimensional arrays
// of fixed size known at run time.
// The ranges of indices are user defined.
// Warning: Programs clients of such class must be independant
// Warning: Programs clients of such class must be independent
// of the range of the first element. Then, a C++ for
// loop must be written like this
// for (i = A.LowerRow(); i <= A.UpperRow(); i++)

2
src/NCollection/NCollection_DefineMap.hxx
View File

@@ -22,7 +22,7 @@
// ::HashCode must be defined in the global namespace
// To compare two keys the function ::IsEqual must be
// defined in the global namespace.
// The performance of a Map is conditionned by its
// The performance of a Map is conditioned by its
// number of buckets that should be kept greater to
// the number of keys. This map has an automatic
// management of the number of buckets. It is resized

2
src/NCollection/NCollection_IncAllocator.hxx
View File

@@ -74,7 +74,7 @@ class NCollection_IncAllocator : public NCollection_BaseAllocator
const size_t newSize);
//! Re-initialize the allocator so that the next Allocate call should
//! start allocating in the very begining as though the allocator is just
//! start allocating in the very beginning as though the allocator is just
//! constructed. Warning: make sure that all previously allocated data are
//! no more used in your code!
//! @param doReleaseMem

2
src/NCollection/NCollection_Map.hxx
View File

@@ -38,7 +38,7 @@
* To compare two keys the function ::IsEqual must be
* defined in the global namespace.
*
* The performance of a Map is conditionned by its
* The performance of a Map is conditioned by its
* number of buckets that should be kept greater to
* the number of keys. This map has an automatic
* management of the number of buckets. It is resized

2
src/NCollection/NCollection_UBTree.hxx
View File

@@ -296,7 +296,7 @@ public:
const TreeNode& Root () const { return *myRoot; }
/**
* Desctructor.
* Destructor.
*/
virtual ~NCollection_UBTree () { Clear(); }

4
src/NCollection/NCollection_UtfIterator.hxx
View File

@@ -107,7 +107,7 @@ public:
//! Buffer-fetching getter.
const Type* BufferNext() const { return myPosNext; }
//! @return the index displacement from iterator intialization
//! @return the index displacement from iterator initialization
//! (first symbol has index 0)
Standard_Integer Index() const
{
@@ -235,7 +235,7 @@ private: //! @name private fields
const Type* myPosition; //!< buffer position of the first element in the current symbol
const Type* myPosNext; //!< buffer position of the first element in the next symbol
Standard_Integer myCharIndex; //!< index displacement from iterator intialization
Standard_Integer myCharIndex; //!< index displacement from iterator initialization
Standard_Utf32Char myCharUtf32; //!< Unicode symbol stored at the current buffer position
};

2
src/NCollection/NCollection_UtfString.hxx
View File

@@ -163,7 +163,7 @@ public:
const Standard_Integer theEnd) const;
//! Returns NULL-terminated Unicode string.
//! Should not be modifed or deleted!
//! Should not be modified or deleted!
//! @return (const Type* ) pointer to string
const Type* ToCString() const
{

2
src/NCollection/NCollection_UtfString.lxx
View File

@@ -216,7 +216,7 @@ void NCollection_UtfString<Type>::Swap (NCollection_UtfString<Type>& theOther)
}
#if !defined(__ANDROID__)
//! Auxiliary convertion tool.
//! Auxiliary conversion tool.
class NCollection_UtfStringTool
{
public:

4
src/NCollection/NCollection_Vec2.hxx
View File

@@ -277,13 +277,13 @@ public:
return x() * x() + y() * y();
}
//! Constuct DX unit vector.
//! Construct DX unit vector.
static NCollection_Vec2 DX()
{
return NCollection_Vec2 (Element_t(1), Element_t(0));
}
//! Constuct DY unit vector.
//! Construct DY unit vector.
static NCollection_Vec2 DY()
{
return NCollection_Vec2 (Element_t(0), Element_t(1));

6
src/NCollection/NCollection_Vec3.hxx
View File

@@ -383,19 +383,19 @@ public:
return theFrom * (Element_t(1) - theT) + theTo * theT;
}
//! Constuct DX unit vector.
//! Construct DX unit vector.
static NCollection_Vec3 DX()
{
return NCollection_Vec3 (Element_t(1), Element_t(0), Element_t(0));
}
//! Constuct DY unit vector.
//! Construct DY unit vector.
static NCollection_Vec3 DY()
{
return NCollection_Vec3 (Element_t(0), Element_t(1), Element_t(0));
}
//! Constuct DZ unit vector.
//! Construct DZ unit vector.
static NCollection_Vec3 DZ()
{
return NCollection_Vec3 (Element_t(0), Element_t(0), Element_t(1));