mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-08-04 13:13:25 +03:00
0026595: Lost some comments in OCCT-code after cdl elimination
Recovered comments for instance classes from CDL generic classes.
This commit is contained in:
@@ -37,60 +37,209 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Constructs an empty sequence.
|
||||
//! Use:
|
||||
//! - the function Append or Prepend to add an item or
|
||||
//! a collection of items at the end, or at the beginning of the sequence,
|
||||
//! - the function InsertAfter or InsertBefore to add an
|
||||
//! item or a collection of items at any position in the sequence,
|
||||
//! - operator() or the function SetValue to assign a
|
||||
//! new value to an item of the sequence,
|
||||
//! - operator() to read an item of the sequence,
|
||||
//! - the function Remove to remove an item at any
|
||||
//! position in the sequence.
|
||||
//! Warning
|
||||
//! To copy a sequence, you must explicitly call the
|
||||
//! assignment operator (operator=).
|
||||
Contap_SequenceOfIWLineOfTheIWalking();
|
||||
|
||||
//! Creation by copy of existing Sequence.
|
||||
Standard_EXPORT Contap_SequenceOfIWLineOfTheIWalking(const Contap_SequenceOfIWLineOfTheIWalking& Other);
|
||||
|
||||
//! Removes all element(s) of the sequence <me>
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = ()
|
||||
Standard_EXPORT void Clear();
|
||||
~Contap_SequenceOfIWLineOfTheIWalking()
|
||||
{
|
||||
Clear();
|
||||
}
|
||||
|
||||
//! Copies the contents of the sequence Other into this sequence.
|
||||
//! If this sequence is not empty, it is automatically cleared before the copy.
|
||||
Standard_EXPORT const Contap_SequenceOfIWLineOfTheIWalking& Assign (const Contap_SequenceOfIWLineOfTheIWalking& Other);
|
||||
const Contap_SequenceOfIWLineOfTheIWalking& operator = (const Contap_SequenceOfIWLineOfTheIWalking& Other)
|
||||
{
|
||||
return Assign(Other);
|
||||
}
|
||||
|
||||
//! Appends <T> at the end of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C T)
|
||||
Standard_EXPORT void Append (const Handle(Contap_TheIWLineOfTheIWalking)& T);
|
||||
|
||||
//! Concatenates <S> at the end of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void Append (Contap_SequenceOfIWLineOfTheIWalking& S);
|
||||
|
||||
//! Add <T> at the beginning of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (T A B C )
|
||||
Standard_EXPORT void Prepend (const Handle(Contap_TheIWLineOfTheIWalking)& T);
|
||||
|
||||
//! Concatenates <S> at the beginning of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C) S = (D E F)
|
||||
//! after me = (D E F A B C)
|
||||
//! S = ()
|
||||
void Prepend (Contap_SequenceOfIWLineOfTheIWalking& S);
|
||||
|
||||
//! Inserts <T> in <me> before the position <Index>.
|
||||
//! Raises an exception if the index is out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B D), Index = 3, T = C
|
||||
//! after
|
||||
//! me = (A B C D )
|
||||
void InsertBefore (const Standard_Integer Index, const Handle(Contap_TheIWLineOfTheIWalking)& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> before
|
||||
//! the position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B F), Index = 3, S = (C D E)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertBefore (const Standard_Integer Index, Contap_SequenceOfIWLineOfTheIWalking& S);
|
||||
|
||||
//! Inserts <T> in <me> after the position <Index>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, T = D
|
||||
//! after
|
||||
//! me = (A B C D)
|
||||
Standard_EXPORT void InsertAfter (const Standard_Integer Index, const Handle(Contap_TheIWLineOfTheIWalking)& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> after the
|
||||
//! position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bound.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertAfter (const Standard_Integer Index, Contap_SequenceOfIWLineOfTheIWalking& S);
|
||||
|
||||
//! Returns the first element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns A
|
||||
Standard_EXPORT const Handle(Contap_TheIWLineOfTheIWalking)& First() const;
|
||||
|
||||
//! Returns the last element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns C
|
||||
Standard_EXPORT const Handle(Contap_TheIWLineOfTheIWalking)& Last() const;
|
||||
|
||||
//! Keeps in <me> the items 1 to <Index>-1 and
|
||||
//! puts in <Sub> the items <Index> to the end.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D) ,Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
//! Sub = (C D)
|
||||
void Split (const Standard_Integer Index, Contap_SequenceOfIWLineOfTheIWalking& Sub);
|
||||
|
||||
//! Returns the Item at position <Index> in <me>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT const Handle(Contap_TheIWLineOfTheIWalking)& Value (const Standard_Integer Index) const;
|
||||
const Handle(Contap_TheIWLineOfTheIWalking)& operator() (const Standard_Integer Index) const
|
||||
{
|
||||
return Value(Index);
|
||||
}
|
||||
|
||||
//! Changes the item at position <Index>
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1, Item = D
|
||||
//! after
|
||||
//! me = (D B C)
|
||||
Standard_EXPORT void SetValue (const Standard_Integer Index, const Handle(Contap_TheIWLineOfTheIWalking)& I);
|
||||
|
||||
//! Returns the Item at position <Index> in
|
||||
//! <me>. This method may be used to modify
|
||||
//! <me> : S.Value(Index) = Item.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT Handle(Contap_TheIWLineOfTheIWalking)& ChangeValue (const Standard_Integer Index);
|
||||
Handle(Contap_TheIWLineOfTheIWalking)& operator() (const Standard_Integer Index)
|
||||
{
|
||||
return ChangeValue(Index);
|
||||
}
|
||||
|
||||
//! Removes from <me> the item at position <Index>.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
Standard_EXPORT void Remove (const Standard_Integer Index);
|
||||
|
||||
//! Removes from <me> all the items of
|
||||
//! positions between <FromIndex> and <ToIndex>.
|
||||
//! Raises an exception if the indices are out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D E F), FromIndex = 1 ToIndex = 3
|
||||
//! after
|
||||
//! me = (D E F)
|
||||
Standard_EXPORT void Remove (const Standard_Integer FromIndex, const Standard_Integer ToIndex);
|
||||
|
||||
|
||||
|
@@ -37,60 +37,209 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Constructs an empty sequence.
|
||||
//! Use:
|
||||
//! - the function Append or Prepend to add an item or
|
||||
//! a collection of items at the end, or at the beginning of the sequence,
|
||||
//! - the function InsertAfter or InsertBefore to add an
|
||||
//! item or a collection of items at any position in the sequence,
|
||||
//! - operator() or the function SetValue to assign a
|
||||
//! new value to an item of the sequence,
|
||||
//! - operator() to read an item of the sequence,
|
||||
//! - the function Remove to remove an item at any
|
||||
//! position in the sequence.
|
||||
//! Warning
|
||||
//! To copy a sequence, you must explicitly call the
|
||||
//! assignment operator (operator=).
|
||||
Contap_SequenceOfPathPointOfTheSearch();
|
||||
|
||||
//! Creation by copy of existing Sequence.
|
||||
Standard_EXPORT Contap_SequenceOfPathPointOfTheSearch(const Contap_SequenceOfPathPointOfTheSearch& Other);
|
||||
|
||||
//! Removes all element(s) of the sequence <me>
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = ()
|
||||
Standard_EXPORT void Clear();
|
||||
~Contap_SequenceOfPathPointOfTheSearch()
|
||||
{
|
||||
Clear();
|
||||
}
|
||||
|
||||
//! Copies the contents of the sequence Other into this sequence.
|
||||
//! If this sequence is not empty, it is automatically cleared before the copy.
|
||||
Standard_EXPORT const Contap_SequenceOfPathPointOfTheSearch& Assign (const Contap_SequenceOfPathPointOfTheSearch& Other);
|
||||
const Contap_SequenceOfPathPointOfTheSearch& operator = (const Contap_SequenceOfPathPointOfTheSearch& Other)
|
||||
{
|
||||
return Assign(Other);
|
||||
}
|
||||
|
||||
//! Appends <T> at the end of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C T)
|
||||
Standard_EXPORT void Append (const Contap_ThePathPointOfTheSearch& T);
|
||||
|
||||
//! Concatenates <S> at the end of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void Append (Contap_SequenceOfPathPointOfTheSearch& S);
|
||||
|
||||
//! Add <T> at the beginning of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (T A B C )
|
||||
Standard_EXPORT void Prepend (const Contap_ThePathPointOfTheSearch& T);
|
||||
|
||||
//! Concatenates <S> at the beginning of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C) S = (D E F)
|
||||
//! after me = (D E F A B C)
|
||||
//! S = ()
|
||||
void Prepend (Contap_SequenceOfPathPointOfTheSearch& S);
|
||||
|
||||
//! Inserts <T> in <me> before the position <Index>.
|
||||
//! Raises an exception if the index is out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B D), Index = 3, T = C
|
||||
//! after
|
||||
//! me = (A B C D )
|
||||
void InsertBefore (const Standard_Integer Index, const Contap_ThePathPointOfTheSearch& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> before
|
||||
//! the position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B F), Index = 3, S = (C D E)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertBefore (const Standard_Integer Index, Contap_SequenceOfPathPointOfTheSearch& S);
|
||||
|
||||
//! Inserts <T> in <me> after the position <Index>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, T = D
|
||||
//! after
|
||||
//! me = (A B C D)
|
||||
Standard_EXPORT void InsertAfter (const Standard_Integer Index, const Contap_ThePathPointOfTheSearch& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> after the
|
||||
//! position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bound.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertAfter (const Standard_Integer Index, Contap_SequenceOfPathPointOfTheSearch& S);
|
||||
|
||||
//! Returns the first element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns A
|
||||
Standard_EXPORT const Contap_ThePathPointOfTheSearch& First() const;
|
||||
|
||||
//! Returns the last element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns C
|
||||
Standard_EXPORT const Contap_ThePathPointOfTheSearch& Last() const;
|
||||
|
||||
//! Keeps in <me> the items 1 to <Index>-1 and
|
||||
//! puts in <Sub> the items <Index> to the end.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D) ,Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
//! Sub = (C D)
|
||||
void Split (const Standard_Integer Index, Contap_SequenceOfPathPointOfTheSearch& Sub);
|
||||
|
||||
//! Returns the Item at position <Index> in <me>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT const Contap_ThePathPointOfTheSearch& Value (const Standard_Integer Index) const;
|
||||
const Contap_ThePathPointOfTheSearch& operator() (const Standard_Integer Index) const
|
||||
{
|
||||
return Value(Index);
|
||||
}
|
||||
|
||||
//! Changes the item at position <Index>
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1, Item = D
|
||||
//! after
|
||||
//! me = (D B C)
|
||||
Standard_EXPORT void SetValue (const Standard_Integer Index, const Contap_ThePathPointOfTheSearch& I);
|
||||
|
||||
//! Returns the Item at position <Index> in
|
||||
//! <me>. This method may be used to modify
|
||||
//! <me> : S.Value(Index) = Item.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT Contap_ThePathPointOfTheSearch& ChangeValue (const Standard_Integer Index);
|
||||
Contap_ThePathPointOfTheSearch& operator() (const Standard_Integer Index)
|
||||
{
|
||||
return ChangeValue(Index);
|
||||
}
|
||||
|
||||
//! Removes from <me> the item at position <Index>.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
Standard_EXPORT void Remove (const Standard_Integer Index);
|
||||
|
||||
//! Removes from <me> all the items of
|
||||
//! positions between <FromIndex> and <ToIndex>.
|
||||
//! Raises an exception if the indices are out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D E F), FromIndex = 1 ToIndex = 3
|
||||
//! after
|
||||
//! me = (D E F)
|
||||
Standard_EXPORT void Remove (const Standard_Integer FromIndex, const Standard_Integer ToIndex);
|
||||
|
||||
|
||||
|
@@ -37,60 +37,209 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Constructs an empty sequence.
|
||||
//! Use:
|
||||
//! - the function Append or Prepend to add an item or
|
||||
//! a collection of items at the end, or at the beginning of the sequence,
|
||||
//! - the function InsertAfter or InsertBefore to add an
|
||||
//! item or a collection of items at any position in the sequence,
|
||||
//! - operator() or the function SetValue to assign a
|
||||
//! new value to an item of the sequence,
|
||||
//! - operator() to read an item of the sequence,
|
||||
//! - the function Remove to remove an item at any
|
||||
//! position in the sequence.
|
||||
//! Warning
|
||||
//! To copy a sequence, you must explicitly call the
|
||||
//! assignment operator (operator=).
|
||||
Contap_SequenceOfSegmentOfTheSearch();
|
||||
|
||||
//! Creation by copy of existing Sequence.
|
||||
Standard_EXPORT Contap_SequenceOfSegmentOfTheSearch(const Contap_SequenceOfSegmentOfTheSearch& Other);
|
||||
|
||||
//! Removes all element(s) of the sequence <me>
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = ()
|
||||
Standard_EXPORT void Clear();
|
||||
~Contap_SequenceOfSegmentOfTheSearch()
|
||||
{
|
||||
Clear();
|
||||
}
|
||||
|
||||
//! Copies the contents of the sequence Other into this sequence.
|
||||
//! If this sequence is not empty, it is automatically cleared before the copy.
|
||||
Standard_EXPORT const Contap_SequenceOfSegmentOfTheSearch& Assign (const Contap_SequenceOfSegmentOfTheSearch& Other);
|
||||
const Contap_SequenceOfSegmentOfTheSearch& operator = (const Contap_SequenceOfSegmentOfTheSearch& Other)
|
||||
{
|
||||
return Assign(Other);
|
||||
}
|
||||
|
||||
//! Appends <T> at the end of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C T)
|
||||
Standard_EXPORT void Append (const Contap_TheSegmentOfTheSearch& T);
|
||||
|
||||
//! Concatenates <S> at the end of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void Append (Contap_SequenceOfSegmentOfTheSearch& S);
|
||||
|
||||
//! Add <T> at the beginning of <me>.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (T A B C )
|
||||
Standard_EXPORT void Prepend (const Contap_TheSegmentOfTheSearch& T);
|
||||
|
||||
//! Concatenates <S> at the beginning of <me>.
|
||||
//! <S> is cleared.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C) S = (D E F)
|
||||
//! after me = (D E F A B C)
|
||||
//! S = ()
|
||||
void Prepend (Contap_SequenceOfSegmentOfTheSearch& S);
|
||||
|
||||
//! Inserts <T> in <me> before the position <Index>.
|
||||
//! Raises an exception if the index is out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B D), Index = 3, T = C
|
||||
//! after
|
||||
//! me = (A B C D )
|
||||
void InsertBefore (const Standard_Integer Index, const Contap_TheSegmentOfTheSearch& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> before
|
||||
//! the position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B F), Index = 3, S = (C D E)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertBefore (const Standard_Integer Index, Contap_SequenceOfSegmentOfTheSearch& S);
|
||||
|
||||
//! Inserts <T> in <me> after the position <Index>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, T = D
|
||||
//! after
|
||||
//! me = (A B C D)
|
||||
Standard_EXPORT void InsertAfter (const Standard_Integer Index, const Contap_TheSegmentOfTheSearch& T);
|
||||
|
||||
//! Inserts the sequence <S> in <me> after the
|
||||
//! position <Index>. <S> is cleared.
|
||||
//! Raises an exception if the index is out of bound.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3, S = (D E F)
|
||||
//! after
|
||||
//! me = (A B C D E F)
|
||||
//! S = ()
|
||||
void InsertAfter (const Standard_Integer Index, Contap_SequenceOfSegmentOfTheSearch& S);
|
||||
|
||||
//! Returns the first element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns A
|
||||
Standard_EXPORT const Contap_TheSegmentOfTheSearch& First() const;
|
||||
|
||||
//! Returns the last element of the sequence <me>
|
||||
//! Raises an exception if the sequence is empty.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C)
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns C
|
||||
Standard_EXPORT const Contap_TheSegmentOfTheSearch& Last() const;
|
||||
|
||||
//! Keeps in <me> the items 1 to <Index>-1 and
|
||||
//! puts in <Sub> the items <Index> to the end.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D) ,Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
//! Sub = (C D)
|
||||
void Split (const Standard_Integer Index, Contap_SequenceOfSegmentOfTheSearch& Sub);
|
||||
|
||||
//! Returns the Item at position <Index> in <me>.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT const Contap_TheSegmentOfTheSearch& Value (const Standard_Integer Index) const;
|
||||
const Contap_TheSegmentOfTheSearch& operator() (const Standard_Integer Index) const
|
||||
{
|
||||
return Value(Index);
|
||||
}
|
||||
|
||||
//! Changes the item at position <Index>
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1, Item = D
|
||||
//! after
|
||||
//! me = (D B C)
|
||||
Standard_EXPORT void SetValue (const Standard_Integer Index, const Contap_TheSegmentOfTheSearch& I);
|
||||
|
||||
//! Returns the Item at position <Index> in
|
||||
//! <me>. This method may be used to modify
|
||||
//! <me> : S.Value(Index) = Item.
|
||||
//! Raises an exception if the index is out of bound
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 1
|
||||
//! after
|
||||
//! me = (A B C)
|
||||
//! returns
|
||||
//! A
|
||||
Standard_EXPORT Contap_TheSegmentOfTheSearch& ChangeValue (const Standard_Integer Index);
|
||||
Contap_TheSegmentOfTheSearch& operator() (const Standard_Integer Index)
|
||||
{
|
||||
return ChangeValue(Index);
|
||||
}
|
||||
|
||||
//! Removes from <me> the item at position <Index>.
|
||||
//! Raises an exception if the index is out of bounds
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C), Index = 3
|
||||
//! after
|
||||
//! me = (A B)
|
||||
Standard_EXPORT void Remove (const Standard_Integer Index);
|
||||
|
||||
//! Removes from <me> all the items of
|
||||
//! positions between <FromIndex> and <ToIndex>.
|
||||
//! Raises an exception if the indices are out of bounds.
|
||||
//! Example:
|
||||
//! before
|
||||
//! me = (A B C D E F), FromIndex = 1 ToIndex = 3
|
||||
//! after
|
||||
//! me = (D E F)
|
||||
Standard_EXPORT void Remove (const Standard_Integer FromIndex, const Standard_Integer ToIndex);
|
||||
|
||||
|
||||
|
@@ -47,10 +47,13 @@ public:
|
||||
|
||||
Standard_EXPORT Contap_TheIWLineOfTheIWalking(const IntSurf_Allocator& theAllocator = 0);
|
||||
|
||||
//! reverse the points in the line. Hasfirst, HasLast are kept.
|
||||
Standard_EXPORT void Reverse();
|
||||
|
||||
//! Cut the line at the point of rank Index.
|
||||
void Cut (const Standard_Integer Index);
|
||||
|
||||
//! Add a point in the line.
|
||||
void AddPoint (const IntSurf_PntOn2S& P);
|
||||
|
||||
void AddStatusFirst (const Standard_Boolean Closed, const Standard_Boolean HasFirst);
|
||||
@@ -63,6 +66,8 @@ public:
|
||||
|
||||
void AddStatusLast (const Standard_Boolean HasLast, const Standard_Integer Index, const IntSurf_PathPoint& P);
|
||||
|
||||
//! associer a l 'indice du point sur la ligne l'indice du point
|
||||
//! passant dans l'iterateur de depart
|
||||
void AddIndexPassing (const Standard_Integer Index);
|
||||
|
||||
void SetTangentVector (const gp_Vec& V, const Standard_Integer Index);
|
||||
@@ -71,28 +76,62 @@ public:
|
||||
|
||||
void SetTangencyAtEnd (const Standard_Boolean IsTangent);
|
||||
|
||||
//! Returns the number of points of the line (including first
|
||||
//! point and end point : see HasLastPoint and HasFirstPoint).
|
||||
Standard_Integer NbPoints() const;
|
||||
|
||||
//! Returns the point of range Index.
|
||||
//! If index <= 0 or Index > NbPoints, an exception is raised.
|
||||
const IntSurf_PntOn2S& Value (const Standard_Integer Index) const;
|
||||
|
||||
//! Returns the LineOn2S contained in the walking line.
|
||||
const Handle(IntSurf_LineOn2S)& Line() const;
|
||||
|
||||
//! Returns True if the line is closed.
|
||||
Standard_Boolean IsClosed() const;
|
||||
|
||||
//! Returns True if the first point of the line is a
|
||||
//! marching point . when is HasFirstPoint==False ,the line
|
||||
//! begins on the natural bound of the surface.the line can be
|
||||
//! too long
|
||||
Standard_Boolean HasFirstPoint() const;
|
||||
|
||||
//! Returns True if the end point of the line is a
|
||||
//! marching point (Point from IntWS).
|
||||
//! when is HasFirstPoint==False ,the line ends
|
||||
//! on the natural bound of the surface.the line can be
|
||||
//! too long.
|
||||
Standard_Boolean HasLastPoint() const;
|
||||
|
||||
//! Returns the first point of the line when it is a
|
||||
//! marching point.
|
||||
//! An exception is raised if HasFirstPoint returns False.
|
||||
const IntSurf_PathPoint& FirstPoint() const;
|
||||
|
||||
//! Returns the Index of first point of the line when it is a
|
||||
//! marching point.This index is the index in the
|
||||
//! PointStartIterator.
|
||||
//! An exception is raised if HasFirstPoint returns False.
|
||||
Standard_Integer FirstPointIndex() const;
|
||||
|
||||
//! Returns the last point of the line when it is a
|
||||
//! marching point.
|
||||
//! An exception is raised if HasLastPoint returns False.
|
||||
const IntSurf_PathPoint& LastPoint() const;
|
||||
|
||||
//! Returns the index of last point of the line when it is a
|
||||
//! marching point.This index is the index in the
|
||||
//! PointStartIterator.
|
||||
//! An exception is raised if HasLastPoint returns False.
|
||||
Standard_Integer LastPointIndex() const;
|
||||
|
||||
//! returns the number of points belonging to Pnts1 which are
|
||||
//! passing point.
|
||||
Standard_Integer NbPassingPoint() const;
|
||||
|
||||
//! returns the index of the point belonging to the line which
|
||||
//! is associated to the passing point belonging to Pnts1
|
||||
//! an exception is raised if Index > NbPassingPoint()
|
||||
void PassingPoint (const Standard_Integer Index, Standard_Integer& IndexLine, Standard_Integer& IndexPnts) const;
|
||||
|
||||
const gp_Vec& TangentVector (Standard_Integer& Index) const;
|
||||
|
@@ -59,22 +59,52 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Deflection is the maximum deflection admitted between two
|
||||
//! consecutive points on a resulting polyline.
|
||||
//! Step is the maximum increment admitted between two
|
||||
//! consecutive points (in 2d space).
|
||||
//! Epsilon is the tolerance beyond which 2 points
|
||||
//! are confused.
|
||||
Standard_EXPORT Contap_TheIWalking(const Standard_Real Epsilon, const Standard_Real Deflection, const Standard_Real Step);
|
||||
|
||||
//! Deflection is the maximum deflection admitted between two
|
||||
//! consecutive points on a resulting polyline.
|
||||
//! Step is the maximum increment admitted between two
|
||||
//! consecutive points (in 2d space).
|
||||
//! Epsilon is the tolerance beyond which 2 points
|
||||
//! are confused
|
||||
void SetTolerance (const Standard_Real Epsilon, const Standard_Real Deflection, const Standard_Real Step);
|
||||
|
||||
//! Searches a set of polylines starting on a point of Pnts1
|
||||
//! or Pnts2.
|
||||
//! Each point on a resulting polyline verifies F(u,v)=0
|
||||
Standard_EXPORT void Perform (const IntSurf_SequenceOfPathPoint& Pnts1, const IntSurf_SequenceOfInteriorPoint& Pnts2, Contap_SurfFunction& Func, const Handle(Adaptor3d_HSurface)& S, const Standard_Boolean Reversed = Standard_False);
|
||||
|
||||
//! Searches a set of polylines starting on a point of Pnts1.
|
||||
//! Each point on a resulting polyline verifies F(u,v)=0
|
||||
Standard_EXPORT void Perform (const IntSurf_SequenceOfPathPoint& Pnts1, Contap_SurfFunction& Func, const Handle(Adaptor3d_HSurface)& S, const Standard_Boolean Reversed = Standard_False);
|
||||
|
||||
//! Returns true if the calculus was successful.
|
||||
Standard_Boolean IsDone() const;
|
||||
|
||||
//! Returns the number of resulting polylines.
|
||||
//! An exception is raised if IsDone returns False.
|
||||
Standard_Integer NbLines() const;
|
||||
|
||||
//! Returns the polyline of range Index.
|
||||
//! An exception is raised if IsDone is False.
|
||||
//! An exception is raised if Index<=0 or Index>NbLines.
|
||||
const Handle(Contap_TheIWLineOfTheIWalking)& Value (const Standard_Integer Index) const;
|
||||
|
||||
//! Returns the number of points belonging to Pnts on which no
|
||||
//! line starts or ends.
|
||||
//! An exception is raised if IsDone returns False.
|
||||
Standard_Integer NbSinglePnts() const;
|
||||
|
||||
//! Returns the point of range Index .
|
||||
//! An exception is raised if IsDone returns False.
|
||||
//! An exception is raised if Index<=0 or
|
||||
//! Index > NbSinglePnts.
|
||||
const IntSurf_PathPoint& SinglePnt (const Standard_Integer Index) const;
|
||||
|
||||
|
||||
@@ -105,6 +135,7 @@ protected:
|
||||
|
||||
Standard_EXPORT void MakeWalkingPoint (const Standard_Integer Case, const Standard_Real U, const Standard_Real V, Contap_SurfFunction& Section, IntSurf_PntOn2S& Psol);
|
||||
|
||||
//! Clears up internal containers
|
||||
Standard_EXPORT void Clear();
|
||||
|
||||
|
||||
|
@@ -51,20 +51,44 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Empty constructor.
|
||||
Standard_EXPORT Contap_TheSearch();
|
||||
|
||||
//! Algorithm to find the points and parts of curves of Domain
|
||||
//! (domain of of restriction of a surface) which verify
|
||||
//! F = 0.
|
||||
//! TolBoundary defines if a curve is on Q.
|
||||
//! TolTangency defines if a point is on Q.
|
||||
Standard_EXPORT void Perform (Contap_ArcFunction& F, const Handle(Adaptor3d_TopolTool)& Domain, const Standard_Real TolBoundary, const Standard_Real TolTangency, const Standard_Boolean RecheckOnRegularity = Standard_False);
|
||||
|
||||
//! Returns True if the calculus was successful.
|
||||
Standard_Boolean IsDone() const;
|
||||
|
||||
//! Returns true if all arc of the Arcs are solution (inside
|
||||
//! the surface).
|
||||
//! An exception is raised if IsDone returns False.
|
||||
Standard_Boolean AllArcSolution() const;
|
||||
|
||||
//! Returns the number of resulting points.
|
||||
//! An exception is raised if IsDone returns False (NotDone).
|
||||
Standard_Integer NbPoints() const;
|
||||
|
||||
//! Returns the resulting point of range Index.
|
||||
//! The exception NotDone is raised if IsDone() returns
|
||||
//! False.
|
||||
//! The exception OutOfRange is raised if
|
||||
//! Index <= 0 or Index > NbPoints.
|
||||
const Contap_ThePathPointOfTheSearch& Point (const Standard_Integer Index) const;
|
||||
|
||||
//! Returns the number of the resulting segments.
|
||||
//! An exception is raised if IsDone returns False (NotDone).
|
||||
Standard_Integer NbSegments() const;
|
||||
|
||||
//! Returns the resulting segment of range Index.
|
||||
//! The exception NotDone is raised if IsDone() returns
|
||||
//! False.
|
||||
//! The exception OutOfRange is raised if
|
||||
//! Index <= 0 or Index > NbPoints.
|
||||
const Contap_TheSegmentOfTheSearch& Segment (const Standard_Integer Index) const;
|
||||
|
||||
|
||||
|
@@ -53,8 +53,16 @@ public:
|
||||
|
||||
Standard_Boolean IsDone() const;
|
||||
|
||||
//! Returns the number of points.
|
||||
//! The exception NotDone if raised if IsDone
|
||||
//! returns False.
|
||||
Standard_Integer NbPoints() const;
|
||||
|
||||
//! Returns the point of range Index.
|
||||
//! The exception NotDone if raised if IsDone
|
||||
//! returns False.
|
||||
//! The exception OutOfRange if raised if
|
||||
//! Index <= 0 or Index > NbPoints.
|
||||
const IntSurf_InteriorPoint& Value (const Standard_Integer Index) const;
|
||||
|
||||
|
||||
|
@@ -37,20 +37,32 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Empty constructor.
|
||||
Standard_EXPORT Contap_TheSegmentOfTheSearch();
|
||||
|
||||
//! Defines the concerned arc.
|
||||
void SetValue (const Handle(Adaptor2d_HCurve2d)& A);
|
||||
|
||||
//! Defines the first point or the last point,
|
||||
//! depending on the value of the boolean First.
|
||||
Standard_EXPORT void SetLimitPoint (const Contap_ThePathPointOfTheSearch& V, const Standard_Boolean First);
|
||||
|
||||
//! Returns the geometric curve on the surface 's domain
|
||||
//! which is solution.
|
||||
const Handle(Adaptor2d_HCurve2d)& Curve() const;
|
||||
|
||||
//! Returns True if there is a vertex (ThePathPoint) defining
|
||||
//! the lowest valid parameter on the arc.
|
||||
Standard_Boolean HasFirstPoint() const;
|
||||
|
||||
//! Returns the first point.
|
||||
const Contap_ThePathPointOfTheSearch& FirstPoint() const;
|
||||
|
||||
//! Returns True if there is a vertex (ThePathPoint) defining
|
||||
//! the greatest valid parameter on the arc.
|
||||
Standard_Boolean HasLastPoint() const;
|
||||
|
||||
//! Returns the last point.
|
||||
const Contap_ThePathPointOfTheSearch& LastPoint() const;
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user