IntWalk

OCCT package IntWalk: IntWalk_StatusDeflection, IntWalk_TheInt2S, IntWalk_VectorOfInteger, IntWalk_VectorOfWalkingData, and 1 more bound classes.

IntWalk_StatusDeflection

Properties(6)

IntWalk_PasTropGrand:'IntWalk_PasTropGrand'readonly
IntWalk_StepTooSmall:'IntWalk_StepTooSmall'readonly
IntWalk_PointConfondu:'IntWalk_PointConfondu'readonly
IntWalk_ArretSurPointPrecedent:'IntWalk_ArretSurPointPrecedent'readonly
IntWalk_ArretSurPoint:'IntWalk_ArretSurPoint'readonly
IntWalk_OK:'IntWalk_OK'readonly

IntWalk_TheInt2S

Constructors(2)

constructor(S1: Adaptor3d_Surface, S2: Adaptor3d_Surface, TolTangency: number): IntWalk_TheInt2S
initialize the parameters to compute the solution point it 's possible to write to optimize: IntImp_Int2S inter(S1,S2,Func,TolTangency); math_FunctionSetRoot rsnld(inter.Function()); while ...{ Param(1)=... Param(2)=... param(3)=... inter.Perform(Param,rsnld); }
Parameters (3)
- S1
- S2
- TolTangency
constructor(Param: NCollection_Array1_double, S1: Adaptor3d_Surface, S2: Adaptor3d_Surface, TolTangency: number): IntWalk_TheInt2S
compute the solution point with the close point
Parameters (4)
- Param
- S1
- S2
- TolTangency

Instance methods(8)

IsDone(): boolean
Returns TRUE if the creation completed without failure.
IsEmpty(): boolean
Returns TRUE when there is no solution to the problem.
Point(): IntSurf_PntOn2S
Returns the intersection point.
IsTangent(): boolean
Returns True if the surfaces are tangent at the intersection point.
Direction(): gp_Dir
Returns the tangent at the intersection line.
DirectionOnS1(): gp_Dir2d
Returns the tangent at the intersection line in the parametric space of the first surface.
DirectionOnS2(): gp_Dir2d
Returns the tangent at the intersection line in the parametric space of the second surface.
ChangePoint(): IntSurf_PntOn2S
return the intersection point which is enable for changing.

Contiguous dynamic array using a flat memory buffer.
Unlike NCollection_DynamicArray which uses segmented block storage, this container stores all elements in a single contiguous allocation, providing O(1) element access with a single pointer dereference.
For trivially copyable types, growth uses Standard::Reallocate which can extend the buffer in-place without copying elements. For non-trivial types, growth allocates a new buffer and move-constructs elements.
Indices are always 0-based.

Constructors(4)

constructor(): IntWalk_VectorOfInteger
Empty constructor.
constructor(theCapacity: number): IntWalk_VectorOfInteger
Constructor with pre-allocated capacity. Unlike std::vector(n), this constructor does not create elements. Use Resize() or NCollection_LinearVector(theSize, theValue) to construct items.
Parameters (1)
- theCapacity —
  number of elements to pre-allocate
constructor(theOther: IntWalk_VectorOfInteger): IntWalk_VectorOfInteger
Copy constructor.
Parameters (1)
- theOther
constructor(theSize: number, theValue: number): IntWalk_VectorOfInteger
Constructor creating theSize elements initialized to theValue. Equivalent to std::vector(n, val).
Parameters (2)
- theSize —
  number of elements to construct
- theValue —
  value to initialize each element with

Static methods(1)

MaxSize(): number
Returns
current max supported size.

Instance methods(24)

Data(): number
Returns
raw data pointer.
HasData(): boolean
Returns
true if the vector has allocated storage.
Empty(): boolean
Returns
true if the vector contains no elements.
Size(): number
Returns
number of elements.
IsEmpty(): boolean
Returns
true if the vector contains no elements.
Capacity(): number
Returns
current allocated capacity.
Reserve(theCapacity: number): void
Pre-allocate memory for at least theCapacity elements without changing size.
Parameters (1)
- theCapacity —
  minimum capacity to ensure
Resize(theSize: number): void
Change the number of elements. If theSize > Size(), new elements are default-constructed. If theSize < Size(), excess elements are destroyed.
Parameters (1)
- theSize —
  new number of elements
Resize(theSize: number, theValue: number): void
Change the number of elements, filling new slots with theValue. If theSize > Size(), new elements are copy-constructed from theValue. If theSize < Size(), excess elements are destroyed.
Parameters (2)
- theSize —
  new number of elements
- theValue —
  value to fill new elements with
Value(theIndex: number): number
Parameters (1)
- theIndex —
  element index (0-based)
Returns
const reference to element at theIndex.
ChangeValue(theIndex: number): number
Parameters (1)
- theIndex —
  element index (0-based)
Returns
mutable reference to element at theIndex.
First(): number
Returns
const reference to the first element.
ChangeFirst(): number
Returns
mutable reference to the first element.
Last(): number
Returns
const reference to the last element.
ChangeLast(): number
Returns
mutable reference to the last element.
Append(theValue: number): number
Append a copy of theValue to the end.
Parameters (1)
- theValue —
  element to append
Returns
reference to the appended element
Appended(): number
Append a default-constructed element.
Returns
reference to the appended element
SetValue(theIndex: number, theValue: number): number
Set value at theIndex. If theIndex >= Size(), the vector is extended.
Parameters (2)
- theIndex —
  element index (0-based)
- theValue —
  value to set
Returns
reference to the element
InsertBefore(theIndex: number, theValue: number): void
Insert theValue before theIndex, shifting elements right.
Parameters (2)
- theIndex —
  insertion position (0-based)
- theValue —
  element to insert
InsertAfter(theIndex: number, theValue: number): void
Insert theValue after theIndex, shifting elements right.
Parameters (2)
- theIndex —
  position after which to insert (0-based)
- theValue —
  element to insert
EraseLast(): void
Remove the last element.
Erase(theIndex: number): void
Remove element at theIndex, shifting subsequent elements left.
Parameters (1)
- theIndex —
  element index (0-based)
Erase(theFrom: number, theTo: number): void
Remove elements in range [theFrom, theTo), shifting subsequent elements left.
Parameters (2)
- theFrom —
  start index (inclusive, 0-based)
- theTo —
  end index (exclusive, 0-based)
Clear(theReleaseMemory?: boolean): void
Remove all elements.
Parameters (1)
- theReleaseMemory —
  if true, deallocate the buffer

IntWalk_VectorOfWalkingData

Constructors(4)

constructor(): IntWalk_VectorOfWalkingData
Empty constructor.
constructor(theCapacity: number): IntWalk_VectorOfWalkingData
Constructor with pre-allocated capacity. Unlike std::vector(n), this constructor does not create elements. Use Resize() or NCollection_LinearVector(theSize, theValue) to construct items.
Parameters (1)
- theCapacity —
  number of elements to pre-allocate
constructor(theOther: IntWalk_VectorOfWalkingData): IntWalk_VectorOfWalkingData
Copy constructor.
Parameters (1)
- theOther
constructor(theSize: number, theValue: IntWalk_WalkingData): IntWalk_VectorOfWalkingData
Constructor creating theSize elements initialized to theValue. Equivalent to std::vector(n, val).
Parameters (2)
- theSize —
  number of elements to construct
- theValue —
  value to initialize each element with

Static methods(1)

MaxSize(): number
Returns
current max supported size.

Instance methods(24)

Data(): IntWalk_WalkingData
Returns
raw data pointer.
HasData(): boolean
Returns
true if the vector has allocated storage.
Empty(): boolean
Returns
true if the vector contains no elements.
Size(): number
Returns
number of elements.
IsEmpty(): boolean
Returns
true if the vector contains no elements.
Capacity(): number
Returns
current allocated capacity.
Reserve(theCapacity: number): void
Pre-allocate memory for at least theCapacity elements without changing size.
Parameters (1)
- theCapacity —
  minimum capacity to ensure
Resize(theSize: number): void
Change the number of elements. If theSize > Size(), new elements are default-constructed. If theSize < Size(), excess elements are destroyed.
Parameters (1)
- theSize —
  new number of elements
Resize(theSize: number, theValue: IntWalk_WalkingData): void
Change the number of elements, filling new slots with theValue. If theSize > Size(), new elements are copy-constructed from theValue. If theSize < Size(), excess elements are destroyed.
Parameters (2)
- theSize —
  new number of elements
- theValue —
  value to fill new elements with
Value(theIndex: number): IntWalk_WalkingData
Parameters (1)
- theIndex —
  element index (0-based)
Returns
const reference to element at theIndex.
ChangeValue(theIndex: number): IntWalk_WalkingData
Parameters (1)
- theIndex —
  element index (0-based)
Returns
mutable reference to element at theIndex.
First(): IntWalk_WalkingData
Returns
const reference to the first element.
ChangeFirst(): IntWalk_WalkingData
Returns
mutable reference to the first element.
Last(): IntWalk_WalkingData
Returns
const reference to the last element.
ChangeLast(): IntWalk_WalkingData
Returns
mutable reference to the last element.
Append(theValue: IntWalk_WalkingData): IntWalk_WalkingData
Append a copy of theValue to the end.
Parameters (1)
- theValue —
  element to append
Returns
reference to the appended element
Appended(): IntWalk_WalkingData
Append a default-constructed element.
Returns
reference to the appended element
SetValue(theIndex: number, theValue: IntWalk_WalkingData): IntWalk_WalkingData
Set value at theIndex. If theIndex >= Size(), the vector is extended.
Parameters (2)
- theIndex —
  element index (0-based)
- theValue —
  value to set
Returns
reference to the element
InsertBefore(theIndex: number, theValue: IntWalk_WalkingData): void
Insert theValue before theIndex, shifting elements right.
Parameters (2)
- theIndex —
  insertion position (0-based)
- theValue —
  element to insert
InsertAfter(theIndex: number, theValue: IntWalk_WalkingData): void
Insert theValue after theIndex, shifting elements right.
Parameters (2)
- theIndex —
  position after which to insert (0-based)
- theValue —
  element to insert
EraseLast(): void
Remove the last element.
Erase(theIndex: number): void
Remove element at theIndex, shifting subsequent elements left.
Parameters (1)
- theIndex —
  element index (0-based)
Erase(theFrom: number, theTo: number): void
Remove elements in range [theFrom, theTo), shifting subsequent elements left.
Parameters (2)
- theFrom —
  start index (inclusive, 0-based)
- theTo —
  end index (exclusive, 0-based)
Clear(theReleaseMemory?: boolean): void
Remove all elements.
Parameters (1)
- theReleaseMemory —
  if true, deallocate the buffer

IntWalk_StatusDeflection

Properties(6)

IntWalk_TheInt2S

Constructors(2)

Instance methods(8)

IntWalk_VectorOfInteger

Constructors(4)

Static methods(1)

Instance methods(24)

IntWalk_VectorOfWalkingData

Constructors(4)

Static methods(1)

Instance methods(24)

IntWalk_WalkingData

Constructors(1)

Properties(3)