mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-08-04 13:13:25 +03:00
0026850: Replace nested instantiations of TCollection generic classes by NCollection templates
Remaining instantiations of NCollection generics are converted to NCollection templates; unused and duplicates removed
This commit is contained in:
abv
@@ -1,82 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#ifndef _Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
#define _Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <TCollection_SeqNode.hxx>
|
||||
#include <TCollection_SeqNodePtr.hxx>
|
||||
class Contap_TheIWLineOfTheIWalking;
|
||||
class Contap_SequenceOfIWLineOfTheIWalking;
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking;
|
||||
DEFINE_STANDARD_HANDLE(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking, TCollection_SeqNode)
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking : public TCollection_SeqNode
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
|
||||
Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking(const Handle(Contap_TheIWLineOfTheIWalking)& I, const TCollection_SeqNodePtr& n, const TCollection_SeqNodePtr& p);
|
||||
|
||||
Handle(Contap_TheIWLineOfTheIWalking)& Value() const;
|
||||
|
||||
|
||||
|
||||
|
||||
DEFINE_STANDARD_RTTI(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking,TCollection_SeqNode)
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
Handle(Contap_TheIWLineOfTheIWalking) myValue;
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define SeqItem_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define TCollection_Sequence Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
#include <TCollection_SequenceNode.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
|
||||
|
||||
#endif // _Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
@@ -1,41 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#include <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
#define SeqItem Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define SeqItem_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define TCollection_Sequence Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
#include <TCollection_SequenceNode.gxx>
|
||||
|
||||
@@ -1,83 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#ifndef _Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch_HeaderFile
|
||||
#define _Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#include <TCollection_SeqNode.hxx>
|
||||
#include <TCollection_SeqNodePtr.hxx>
|
||||
class Contap_ThePathPointOfTheSearch;
|
||||
class Contap_SequenceOfPathPointOfTheSearch;
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch;
|
||||
DEFINE_STANDARD_HANDLE(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch, TCollection_SeqNode)
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch : public TCollection_SeqNode
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
|
||||
Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch(const Contap_ThePathPointOfTheSearch& I, const TCollection_SeqNodePtr& n, const TCollection_SeqNodePtr& p);
|
||||
|
||||
Contap_ThePathPointOfTheSearch& Value() const;
|
||||
|
||||
|
||||
|
||||
|
||||
DEFINE_STANDARD_RTTI(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch,TCollection_SeqNode)
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
Contap_ThePathPointOfTheSearch myValue;
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Contap_ThePathPointOfTheSearch
|
||||
#define SeqItem_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfPathPointOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
#include <TCollection_SequenceNode.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
|
||||
|
||||
#endif // _Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch_HeaderFile
|
||||
@@ -1,41 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#include <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
#define SeqItem Contap_ThePathPointOfTheSearch
|
||||
#define SeqItem_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfPathPointOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
#include <TCollection_SequenceNode.gxx>
|
||||
|
||||
@@ -1,83 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#ifndef _Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch_HeaderFile
|
||||
#define _Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#include <TCollection_SeqNode.hxx>
|
||||
#include <TCollection_SeqNodePtr.hxx>
|
||||
class Contap_TheSegmentOfTheSearch;
|
||||
class Contap_SequenceOfSegmentOfTheSearch;
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch;
|
||||
DEFINE_STANDARD_HANDLE(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch, TCollection_SeqNode)
|
||||
|
||||
|
||||
class Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch : public TCollection_SeqNode
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
|
||||
Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch(const Contap_TheSegmentOfTheSearch& I, const TCollection_SeqNodePtr& n, const TCollection_SeqNodePtr& p);
|
||||
|
||||
Contap_TheSegmentOfTheSearch& Value() const;
|
||||
|
||||
|
||||
|
||||
|
||||
DEFINE_STANDARD_RTTI(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch,TCollection_SeqNode)
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
Contap_TheSegmentOfTheSearch myValue;
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Contap_TheSegmentOfTheSearch
|
||||
#define SeqItem_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfSegmentOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
#include <TCollection_SequenceNode.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
|
||||
|
||||
#endif // _Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch_HeaderFile
|
||||
@@ -1,41 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
#include <Standard_Type.hxx>
|
||||
|
||||
#include <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#include <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
#define SeqItem Contap_TheSegmentOfTheSearch
|
||||
#define SeqItem_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfSegmentOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
#include <TCollection_SequenceNode.gxx>
|
||||
|
||||
@@ -17,267 +17,9 @@
|
||||
#ifndef _Contap_SequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
#define _Contap_SequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_DefineAlloc.hxx>
|
||||
#include <Standard_Handle.hxx>
|
||||
|
||||
#include <TCollection_BaseSequence.hxx>
|
||||
#include <Standard_Integer.hxx>
|
||||
class Standard_NoSuchObject;
|
||||
class Standard_OutOfRange;
|
||||
class Contap_TheIWLineOfTheIWalking;
|
||||
class Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking;
|
||||
|
||||
|
||||
|
||||
class Contap_SequenceOfIWLineOfTheIWalking : public TCollection_BaseSequence
|
||||
{
|
||||
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);
|
||||
|
||||
|
||||
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define SeqItem_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define TCollection_Sequence Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
#include <TCollection_Sequence.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
#include <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#include <NCollection_Sequence.hxx>
|
||||
|
||||
typedef NCollection_Sequence<Handle(Contap_TheIWLineOfTheIWalking)> Contap_SequenceOfIWLineOfTheIWalking;
|
||||
|
||||
#endif // _Contap_SequenceOfIWLineOfTheIWalking_HeaderFile
|
||||
|
||||
@@ -1,33 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
#include <Standard_NoSuchObject.hxx>
|
||||
#include <Standard_OutOfRange.hxx>
|
||||
#include <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
|
||||
|
||||
#define SeqItem Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define SeqItem_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define TCollection_Sequence Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
#include <TCollection_Sequence.gxx>
|
||||
|
||||
@@ -17,267 +17,9 @@
|
||||
#ifndef _Contap_SequenceOfPathPointOfTheSearch_HeaderFile
|
||||
#define _Contap_SequenceOfPathPointOfTheSearch_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_DefineAlloc.hxx>
|
||||
#include <Standard_Handle.hxx>
|
||||
|
||||
#include <TCollection_BaseSequence.hxx>
|
||||
#include <Standard_Integer.hxx>
|
||||
class Standard_NoSuchObject;
|
||||
class Standard_OutOfRange;
|
||||
class Contap_ThePathPointOfTheSearch;
|
||||
class Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch;
|
||||
|
||||
|
||||
|
||||
class Contap_SequenceOfPathPointOfTheSearch : public TCollection_BaseSequence
|
||||
{
|
||||
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);
|
||||
|
||||
|
||||
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Contap_ThePathPointOfTheSearch
|
||||
#define SeqItem_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfPathPointOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
#include <TCollection_Sequence.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
#include <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#include <NCollection_Sequence.hxx>
|
||||
|
||||
typedef NCollection_Sequence<Contap_ThePathPointOfTheSearch> Contap_SequenceOfPathPointOfTheSearch;
|
||||
|
||||
#endif // _Contap_SequenceOfPathPointOfTheSearch_HeaderFile
|
||||
|
||||
@@ -1,33 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
#include <Standard_NoSuchObject.hxx>
|
||||
#include <Standard_OutOfRange.hxx>
|
||||
#include <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
|
||||
|
||||
#define SeqItem Contap_ThePathPointOfTheSearch
|
||||
#define SeqItem_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfPathPointOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
#include <TCollection_Sequence.gxx>
|
||||
|
||||
@@ -17,267 +17,9 @@
|
||||
#ifndef _Contap_SequenceOfSegmentOfTheSearch_HeaderFile
|
||||
#define _Contap_SequenceOfSegmentOfTheSearch_HeaderFile
|
||||
|
||||
#include <Standard.hxx>
|
||||
#include <Standard_DefineAlloc.hxx>
|
||||
#include <Standard_Handle.hxx>
|
||||
|
||||
#include <TCollection_BaseSequence.hxx>
|
||||
#include <Standard_Integer.hxx>
|
||||
class Standard_NoSuchObject;
|
||||
class Standard_OutOfRange;
|
||||
class Contap_TheSegmentOfTheSearch;
|
||||
class Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch;
|
||||
|
||||
|
||||
|
||||
class Contap_SequenceOfSegmentOfTheSearch : public TCollection_BaseSequence
|
||||
{
|
||||
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);
|
||||
|
||||
|
||||
|
||||
|
||||
protected:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
};
|
||||
|
||||
#define SeqItem Contap_TheSegmentOfTheSearch
|
||||
#define SeqItem_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfSegmentOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
#include <TCollection_Sequence.lxx>
|
||||
|
||||
#undef SeqItem
|
||||
#undef SeqItem_hxx
|
||||
#undef TCollection_SequenceNode
|
||||
#undef TCollection_SequenceNode_hxx
|
||||
#undef Handle_TCollection_SequenceNode
|
||||
#undef TCollection_Sequence
|
||||
#undef TCollection_Sequence_hxx
|
||||
|
||||
|
||||
#include <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#include <NCollection_Sequence.hxx>
|
||||
|
||||
typedef NCollection_Sequence<Contap_TheSegmentOfTheSearch> Contap_SequenceOfSegmentOfTheSearch;
|
||||
|
||||
#endif // _Contap_SequenceOfSegmentOfTheSearch_HeaderFile
|
||||
|
||||
@@ -1,33 +0,0 @@
|
||||
// Created on: 1993-02-05
|
||||
// Created by: Jacques GOUSSARD
|
||||
// Copyright (c) 1993-1999 Matra Datavision
|
||||
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
||||
//
|
||||
// This file is part of Open CASCADE Technology software library.
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or modify it under
|
||||
// the terms of the GNU Lesser General Public License version 2.1 as published
|
||||
// by the Free Software Foundation, with special exception defined in the file
|
||||
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
||||
// distribution for complete text of the license and disclaimer of any warranty.
|
||||
//
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
#include <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
#include <Standard_NoSuchObject.hxx>
|
||||
#include <Standard_OutOfRange.hxx>
|
||||
#include <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
|
||||
#define SeqItem Contap_TheSegmentOfTheSearch
|
||||
#define SeqItem_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define TCollection_SequenceNode Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define TCollection_SequenceNode_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_TCollection_SequenceNode Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define TCollection_Sequence Contap_SequenceOfSegmentOfTheSearch
|
||||
#define TCollection_Sequence_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
#include <TCollection_Sequence.gxx>
|
||||
|
||||
@@ -46,12 +46,8 @@ class Adaptor3d_HSurface;
|
||||
class Adaptor3d_HSurfaceTool;
|
||||
class Contap_SurfFunction;
|
||||
class Contap_TheIWLineOfTheIWalking;
|
||||
class Contap_SequenceOfIWLineOfTheIWalking;
|
||||
class Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking;
|
||||
class IntSurf_PntOn2S;
|
||||
|
||||
|
||||
|
||||
class Contap_TheIWalking
|
||||
{
|
||||
public:
|
||||
@@ -190,13 +186,7 @@ private:
|
||||
#define IntWalk_TheIWLine_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceOfIWLine Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceOfIWLine_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_IntWalk_TheIWLine Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define Handle_IntWalk_SequenceNodeOfSequenceOfIWLine Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define Handle_IntWalk_SequenceNodeOfSequenceOfIWLine Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define IntWalk_IWalking Contap_TheIWalking
|
||||
#define IntWalk_IWalking_hxx <Contap_TheIWalking.hxx>
|
||||
|
||||
@@ -224,13 +214,7 @@ private:
|
||||
#undef IntWalk_TheIWLine_hxx
|
||||
#undef IntWalk_SequenceOfIWLine
|
||||
#undef IntWalk_SequenceOfIWLine_hxx
|
||||
#undef IntWalk_SequenceNodeOfSequenceOfIWLine
|
||||
#undef IntWalk_SequenceNodeOfSequenceOfIWLine_hxx
|
||||
#undef IntWalk_SequenceNodeOfSequenceOfIWLine
|
||||
#undef IntWalk_SequenceNodeOfSequenceOfIWLine_hxx
|
||||
#undef Handle_IntWalk_TheIWLine
|
||||
#undef Handle_IntWalk_SequenceNodeOfSequenceOfIWLine
|
||||
#undef Handle_IntWalk_SequenceNodeOfSequenceOfIWLine
|
||||
#undef IntWalk_IWalking
|
||||
#undef IntWalk_IWalking_hxx
|
||||
|
||||
|
||||
@@ -27,9 +27,7 @@
|
||||
#include <Contap_SurfFunction.hxx>
|
||||
#include <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#include <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#include <IntSurf_PntOn2S.hxx>
|
||||
|
||||
|
||||
#define ThePointOfPath IntSurf_PathPoint
|
||||
#define ThePointOfPath_hxx <IntSurf_PathPoint.hxx>
|
||||
@@ -53,13 +51,7 @@
|
||||
#define IntWalk_TheIWLine_hxx <Contap_TheIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceOfIWLine Contap_SequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceOfIWLine_hxx <Contap_SequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking
|
||||
#define IntWalk_SequenceNodeOfSequenceOfIWLine_hxx <Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx>
|
||||
#define Handle_IntWalk_TheIWLine Handle(Contap_TheIWLineOfTheIWalking)
|
||||
#define Handle_IntWalk_SequenceNodeOfSequenceOfIWLine Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define Handle_IntWalk_SequenceNodeOfSequenceOfIWLine Handle(Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking)
|
||||
#define IntWalk_IWalking Contap_TheIWalking
|
||||
#define IntWalk_IWalking_hxx <Contap_TheIWalking.hxx>
|
||||
#include <IntWalk_IWalking.gxx>
|
||||
|
||||
@@ -36,13 +36,7 @@ class Contap_HContTool;
|
||||
class Adaptor3d_TopolTool;
|
||||
class Contap_ArcFunction;
|
||||
class Contap_ThePathPointOfTheSearch;
|
||||
class Contap_SequenceOfPathPointOfTheSearch;
|
||||
class Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch;
|
||||
class Contap_TheSegmentOfTheSearch;
|
||||
class Contap_SequenceOfSegmentOfTheSearch;
|
||||
class Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch;
|
||||
|
||||
|
||||
|
||||
class Contap_TheSearch
|
||||
{
|
||||
@@ -129,22 +123,10 @@ private:
|
||||
#define IntStart_ThePathPoint_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceOfPathPoint Contap_SequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceOfPathPoint_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_TheSegment Contap_TheSegmentOfTheSearch
|
||||
#define IntStart_TheSegment_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceOfSegment Contap_SequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceOfSegment_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfPathPoint Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfPathPoint Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfSegment Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfSegment Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define IntStart_SearchOnBoundaries Contap_TheSearch
|
||||
#define IntStart_SearchOnBoundaries_hxx <Contap_TheSearch.hxx>
|
||||
|
||||
@@ -167,22 +149,10 @@ private:
|
||||
#undef IntStart_ThePathPoint_hxx
|
||||
#undef IntStart_SequenceOfPathPoint
|
||||
#undef IntStart_SequenceOfPathPoint_hxx
|
||||
#undef IntStart_SequenceNodeOfSequenceOfPathPoint
|
||||
#undef IntStart_SequenceNodeOfSequenceOfPathPoint_hxx
|
||||
#undef IntStart_SequenceNodeOfSequenceOfPathPoint
|
||||
#undef IntStart_SequenceNodeOfSequenceOfPathPoint_hxx
|
||||
#undef IntStart_TheSegment
|
||||
#undef IntStart_TheSegment_hxx
|
||||
#undef IntStart_SequenceOfSegment
|
||||
#undef IntStart_SequenceOfSegment_hxx
|
||||
#undef IntStart_SequenceNodeOfSequenceOfSegment
|
||||
#undef IntStart_SequenceNodeOfSequenceOfSegment_hxx
|
||||
#undef IntStart_SequenceNodeOfSequenceOfSegment
|
||||
#undef IntStart_SequenceNodeOfSequenceOfSegment_hxx
|
||||
#undef Handle_IntStart_SequenceNodeOfSequenceOfPathPoint
|
||||
#undef Handle_IntStart_SequenceNodeOfSequenceOfPathPoint
|
||||
#undef Handle_IntStart_SequenceNodeOfSequenceOfSegment
|
||||
#undef Handle_IntStart_SequenceNodeOfSequenceOfSegment
|
||||
#undef IntStart_SearchOnBoundaries
|
||||
#undef IntStart_SearchOnBoundaries_hxx
|
||||
|
||||
|
||||
@@ -27,11 +27,8 @@
|
||||
#include <Contap_ArcFunction.hxx>
|
||||
#include <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#include <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#include <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#include <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
#include <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
|
||||
|
||||
#define TheVertex Handle(Adaptor3d_HVertex)
|
||||
#define TheVertex_hxx <Adaptor3d_HVertex.hxx>
|
||||
@@ -50,22 +47,10 @@
|
||||
#define IntStart_ThePathPoint_hxx <Contap_ThePathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceOfPathPoint Contap_SequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceOfPathPoint_hxx <Contap_SequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfPathPoint_hxx <Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx>
|
||||
#define IntStart_TheSegment Contap_TheSegmentOfTheSearch
|
||||
#define IntStart_TheSegment_hxx <Contap_TheSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceOfSegment Contap_SequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceOfSegment_hxx <Contap_SequenceOfSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch
|
||||
#define IntStart_SequenceNodeOfSequenceOfSegment_hxx <Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx>
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfPathPoint Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfPathPoint Handle(Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfSegment Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define Handle_IntStart_SequenceNodeOfSequenceOfSegment Handle(Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch)
|
||||
#define IntStart_SearchOnBoundaries Contap_TheSearch
|
||||
#define IntStart_SearchOnBoundaries_hxx <Contap_TheSearch.hxx>
|
||||
#include <IntStart_SearchOnBoundaries.gxx>
|
||||
|
||||
@@ -19,18 +19,9 @@ Contap_Line.lxx
|
||||
Contap_Point.cxx
|
||||
Contap_Point.hxx
|
||||
Contap_Point.lxx
|
||||
Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking.hxx
|
||||
Contap_SequenceNodeOfSequenceOfIWLineOfTheIWalking_0.cxx
|
||||
Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch.hxx
|
||||
Contap_SequenceNodeOfSequenceOfPathPointOfTheSearch_0.cxx
|
||||
Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch.hxx
|
||||
Contap_SequenceNodeOfSequenceOfSegmentOfTheSearch_0.cxx
|
||||
Contap_SequenceOfIWLineOfTheIWalking.hxx
|
||||
Contap_SequenceOfIWLineOfTheIWalking_0.cxx
|
||||
Contap_SequenceOfPathPointOfTheSearch.hxx
|
||||
Contap_SequenceOfPathPointOfTheSearch_0.cxx
|
||||
Contap_SequenceOfSegmentOfTheSearch.hxx
|
||||
Contap_SequenceOfSegmentOfTheSearch_0.cxx
|
||||
Contap_SurfFunction.cxx
|
||||
Contap_SurfFunction.hxx
|
||||
Contap_SurfFunction.lxx
|
||||
|
||||
Reference in New Issue
Block a user