mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-08-04 13:13:25 +03:00
0031939: Coding - correction of spelling errors in comments
Fix various typos Fixed via `codespell v2.0.dev`
This commit is contained in:
@@ -27,7 +27,7 @@ class Interface_Graph;
|
||||
class Standard_Transient;
|
||||
|
||||
|
||||
//! this class gives content of the CONNECTED COMPONANT(S)
|
||||
//! this class gives content of the CONNECTED COMPONENT(S)
|
||||
//! which include specific Entity(ies)
|
||||
class IFGraph_AllConnected : public Interface_GraphContent
|
||||
{
|
||||
@@ -42,7 +42,7 @@ public:
|
||||
//! creates an AllConnected which memorizes Entities Connected to
|
||||
//! a given one, at any level : that is, itself, all Entities
|
||||
//! Shared by it and Sharing it, and so on.
|
||||
//! In other terms, this is the content of the CONNECTED COMPONANT
|
||||
//! In other terms, this is the content of the CONNECTED COMPONENT
|
||||
//! which include a specific Entity
|
||||
Standard_EXPORT IFGraph_AllConnected(const Interface_Graph& agraph, const Handle(Standard_Transient)& ent);
|
||||
|
||||
@@ -50,7 +50,7 @@ public:
|
||||
//! cumulate all Entities Connected by some ones)
|
||||
//! Note that if "ent" is in the already computed list,, no entity
|
||||
//! will be added, but if "ent" is not already in the list, a new
|
||||
//! Connected Componant will be cumulated
|
||||
//! Connected Component will be cumulated
|
||||
Standard_EXPORT void GetFromEntity (const Handle(Standard_Transient)& ent);
|
||||
|
||||
//! Allows to restart on a new data set
|
||||
|
@@ -27,7 +27,7 @@ class Interface_Graph;
|
||||
class IFGraph_StrongComponants;
|
||||
|
||||
|
||||
//! determines strong componants in a graph which are Cycles
|
||||
//! determines strong components in a graph which are Cycles
|
||||
class IFGraph_Cycles : public IFGraph_SubPartsIterator
|
||||
{
|
||||
public:
|
||||
|
@@ -27,7 +27,7 @@ class Interface_Graph;
|
||||
class IFGraph_StrongComponants;
|
||||
|
||||
|
||||
//! determines strong componants in a graph which are Roots
|
||||
//! determines strong components in a graph which are Roots
|
||||
class IFGraph_SCRoots : public IFGraph_StrongComponants
|
||||
{
|
||||
public:
|
||||
|
@@ -26,8 +26,8 @@
|
||||
class Interface_Graph;
|
||||
|
||||
|
||||
//! determines strong componants of a graph, that is
|
||||
//! isolated entities (single componants) or loops
|
||||
//! determines strong components of a graph, that is
|
||||
//! isolated entities (single components) or loops
|
||||
class IFGraph_StrongComponants : public IFGraph_SubPartsIterator
|
||||
{
|
||||
public:
|
||||
|
Reference in New Issue
Block a user