OpenCascade.js
PackageApiSyntheticN collection autoGenerated

Generated (page 8 of 9)

OCCT package Generated: BRepToolsWrapper, GeomToolsWrapper, NCollection_Array1_AppParCurves_ConstraintCouple,…

NCollection_List_IntAna_Curve

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_IntPolyh_Couple

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_IntSurf_PntOn2S

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_IntTools_CurveRangeSample

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_IntTools_SurfaceRangeSample

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_Message_Msg

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_NCollection_IndexedDataMap_TopoDS_Shape_NCollection_List_TopoDS_Shape_TopTools_ShapeMapHasher

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_NCollection_List_TopoDS_Shape

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(8)

NCollection_List_NCollection_Map_TopoDS_Shape_TopTools_ShapeMapHasher

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_NCollection_Sequence_int

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_Plate_Plate

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_Poly_Triangle

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_Standard_GUID

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_TCollection_AsciiString

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_TCollection_ExtendedString

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_TDF_Label

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear this list.

    Parameters (1)
    • theAllocator
  • First item.

  • Last item.

  • Append one item at the end.

    Parameters (1)
    • theItem
  • Append one item at the end.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • Prepend one item at the beginning.

    Parameters (1)
    • theItem
  • Prepend one item at the beginning.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • RemoveFirst(): void

    RemoveFirst item.

  • Reverse(): void

    Reverse the list.

  • Exchange the content of two lists without re-allocations. Swaps all internal state including allocators, ensuring correct deallocation. Existing iterators remain valid but will point to the other list's elements.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.

NCollection_List_TopBas_TestInterference

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_TopoDS_Shape

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

NCollection_List_unsignedchar

Purpose: Simple list to link items together keeping the first and the last one. Inherits BaseList, adding the data item to each node.

Constructors(4)

Instance methods(10)

  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear this list.

    Parameters (1)
    • theAllocator
  • First(): string

    First item.

  • Last(): string

    Last item.

  • Append(theItem: string): string

    Append one item at the end.

    Parameters (1)
    • theItem
  • Append one item at the end.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: string): string

    Prepend one item at the beginning.

    Parameters (1)
    • theItem
  • Prepend one item at the beginning.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • RemoveFirst(): void

    RemoveFirst item.

  • Reverse(): void

    Reverse the list.

  • Exchange the content of two lists without re-allocations. Swaps all internal state including allocators, ensuring correct deallocation. Existing iterators remain valid but will point to the other list's elements.

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.

NCollection_Map_BOPDS_Pair

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: BOPDS_Pair): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: BOPDS_Pair): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove(K: BOPDS_Pair): boolean

    Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_handle_BOPDS_PaveBlock

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: BOPDS_PaveBlock): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: BOPDS_PaveBlock): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove(K: BOPDS_PaveBlock): boolean

    Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_handle_TDF_Attribute

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: TDF_Attribute): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: TDF_Attribute): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove(K: TDF_Attribute): boolean

    Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_handle_TNaming_NamedShape

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: TNaming_NamedShape): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: TNaming_NamedShape): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_int

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: number): boolean

    Add.

    Parameters (1)
    • theKey
  • Added(theKey: number): number

    Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: number): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove(K: number): boolean

    Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_TCollection_AsciiString

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: TCollection_AsciiString): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_TDF_Label

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

  • Exchange(theOther: unknown): void

    Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!

    Parameters (1)
    • theOther
      Mutated in place; read the updated value from this argument after the call.
  • GetHasher(): unknown

    Returns const reference to the hasher.

  • Assign(theOther: unknown): unknown

    Assign. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • ReSize(N: number): void

    ReSize.

    Parameters (1)
    • N
  • Add(theKey: TDF_Label): boolean

    Add.

    Parameters (1)
    • theKey
  • Added: add a new key if not yet in the map, and return reference to either newly added or previously existing object.

    Parameters (1)
    • theKey
  • Contains(theKey: TDF_Label): boolean

    Contains.

    Parameters (1)
    • theKey
  • Contains(theOther: unknown): boolean

    Checks if this map contains all keys of another map. This function checks if this map contains all keys of another map.

    Deprecated
    Parameters (1)
    • theOther
  • Remove(K: TDF_Label): boolean

    Remove.

    Parameters (1)
    • K
  • Clear(doReleaseMemory: boolean): void

    Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.

    Parameters (1)
    • doReleaseMemory
  • Clear(theAllocator: NCollection_BaseAllocator): void

    Clear data and reset allocator.

    Parameters (1)
    • theAllocator
  • IsEqual(theOther: unknown): boolean

    Checks if two maps contain exactly the same keys. This function compares the keys of this map and another map and returns true if they contain exactly the same keys.

    Deprecated
    Parameters (1)
    • theOther
  • Union(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps The new Map contains the values that are contained either in the first map or in the second map or in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Unite(theOther: unknown): boolean

    Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • HasIntersection(theMap: unknown): boolean

    Returns true if this and theMap have common elements.

    Deprecated
    Parameters (1)
    • theMap
  • Intersection(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous content of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Intersect(theOther: unknown): boolean

    Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Subtraction(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous content of this Map is cleared.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Subtract(theOther: unknown): boolean

    Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands. Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther
  • Difference(theLeft: unknown, theRight: unknown): void

    Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous content of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.

    Deprecated
    Parameters (2)
    • theLeft
    • theRight
  • Differ(theOther: unknown): boolean

    Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference(). Returns True if contents of this map is changed.

    Deprecated
    Parameters (1)
    • theOther

NCollection_Map_TopoDS_Shape_TopTools_ShapeMapHasher

Purpose: Single hashed Map. This Map is used to store and retrieve keys in linear time.
The Iterator class can be used to explore the content of the map. It is not wise to iterate and modify a map in parallel.
To compute the hashcode of the key the function ::HashCode must be defined in the global namespace
To compare two keys the function IsEqual must be defined in the global namespace.
The performance of a Map is conditioned by its number of buckets that should be kept greater to the number of keys. This map has an automatic management of the number of buckets. It is resized when the number of Keys becomes greater than the number of buckets.
If you have a fair idea of the number of objects you can save on automatic resizing by giving a number of buckets at creation or using the ReSize method. This should be consider only for crucial optimisation issues.

Constructors(2)

Instance methods(21)

NCollection_Sequence_AppParCurves_MultiBSpCurve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_AppParCurves_MultiCurve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Blend_Point

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Assign(theOther: unknown): unknown

    Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: Blend_Point): void

    Append one item.

    Parameters (1)
    • theItem
  • Append(theSeq: unknown): void

    Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: Blend_Point): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend(theSeq: unknown): void

    Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: Blend_Point): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: unknown): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: unknown): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: Blend_Point): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: unknown): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): Blend_Point

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): Blend_Point

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: Blend_Point): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): Blend_Point

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): Blend_Point

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_bool

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: boolean): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: boolean): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: boolean): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_bool): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_bool): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: boolean): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_bool): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First(): boolean

    First item access.

  • ChangeFirst(): boolean

    First item access.

  • Last(): boolean

    Last item access.

  • ChangeLast(): boolean

    Last item access.

  • Value(theIndex: number): boolean

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): boolean

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: boolean): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): boolean

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): boolean

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_BRepBlend_PointOnRst

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Assign(theOther: unknown): unknown

    Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append one item.

    Parameters (1)
    • theItem
  • Append(theSeq: unknown): void

    Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend one item.

    Parameters (1)
    • theItem
  • Prepend(theSeq: unknown): void

    Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: BRepBlend_PointOnRst): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: unknown): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: unknown): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: BRepBlend_PointOnRst): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: unknown): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): BRepBlend_PointOnRst

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: BRepBlend_PointOnRst): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): BRepBlend_PointOnRst

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): BRepBlend_PointOnRst

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_BRepExtrema_SolutionElem

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_BRepFill_EdgeFaceAndOrder

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_BRepFill_FaceAndOrder

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_BRepFill_Section

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Contap_Line

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Contap_Point

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Assign(theOther: unknown): unknown

    Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: Contap_Point): void

    Append one item.

    Parameters (1)
    • theItem
  • Append(theSeq: unknown): void

    Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: Contap_Point): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend(theSeq: unknown): void

    Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: Contap_Point): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: unknown): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: unknown): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: Contap_Point): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: unknown): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): Contap_Point

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): Contap_Point

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: Contap_Point): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): Contap_Point

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): Contap_Point

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_Contap_ThePathPointOfTheSearch

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Contap_TheSegmentOfTheSearch

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_double

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: number): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: number): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: number): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_double): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_double): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: number): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_double): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First(): number

    First item access.

  • ChangeFirst(): number

    First item access.

  • Last(): number

    Last item access.

  • ChangeLast(): number

    Last item access.

  • Value(theIndex: number): number

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): number

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: number): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): number

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): number

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_Extrema_POnCurv

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Extrema_POnCurv2d

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_Extrema_POnSurf

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_float

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: number): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: number): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: number): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_float): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_float): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: number): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_float): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First(): number

    First item access.

  • ChangeFirst(): number

    First item access.

  • Last(): number

    Last item access.

  • ChangeLast(): number

    Last item access.

  • Value(theIndex: number): number

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): number

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: number): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): number

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): number

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_GeomInt_ParameterAndOrientation

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_gp_Ax1

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Ax1): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Ax1): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Ax1): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Ax1): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Ax1): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Ax1): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Ax1): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Ax1

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Ax1

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Ax1): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Ax1

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Ax1

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Ax2

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Ax2): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Ax2): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Ax2): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Ax2): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Ax2): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Ax2): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Ax2): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Ax2

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Ax2

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Ax2): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Ax2

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Ax2

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Circ

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Circ): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Circ): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Circ): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Circ): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Circ): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Circ): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Circ): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Circ

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Circ

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Circ): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Circ

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Circ

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Dir

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Dir): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Dir): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Dir): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Dir): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Dir): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Dir): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Dir): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Dir

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Dir

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Dir): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Dir

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Dir

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Dir2d

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Dir2d): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Dir2d): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Dir2d): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Dir2d): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Dir2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Dir2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Dir2d): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Dir2d

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Dir2d

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Dir2d): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Dir2d

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Dir2d

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Lin

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Lin): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Lin): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Lin): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Lin): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Lin): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Lin): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Lin): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Lin

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Lin

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Lin): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Lin

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Lin

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Pnt

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Pnt): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Pnt): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Pnt): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Pnt): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Pnt

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Pnt

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Pnt): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Pnt

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Pnt

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Pnt2d

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Pnt2d): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Pnt2d): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Pnt2d): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt2d): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Pnt2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Pnt2d): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Pnt2d

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Pnt2d

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Pnt2d): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Pnt2d

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Pnt2d

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Trsf

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Trsf): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Trsf): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Trsf): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Trsf): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Trsf): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Trsf): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Trsf): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Trsf

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Trsf

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Trsf): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Trsf

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Trsf

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Vec

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Vec): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Vec): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Vec): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Vec): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Vec): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Vec): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Vec): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Vec

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Vec

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Vec): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Vec

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Vec

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_Vec2d

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_Vec2d): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_Vec2d): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_Vec2d): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_Vec2d): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_Vec2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_Vec2d): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_Vec2d): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_Vec2d

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_Vec2d

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_Vec2d): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_Vec2d

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_Vec2d

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_XY

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_XY): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_XY): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_XY): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_XY): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_XY): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_XY): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_XY): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_XY

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_XY

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_XY): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_XY

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_XY

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_gp_XYZ

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

  • Upper(): number

    Method for consistency with other collections.

    Returns

    Upper bound (inclusive) for iteration.

  • IsEmpty(): boolean

    Empty query.

  • Reverse(): void

    Reverse sequence.

  • Exchange(I: number, J: number): void

    Exchange two members.

    Parameters (2)
    • I
    • J
  • Clear(theAllocator?: NCollection_BaseAllocator): void

    Clear the items out, take a new allocator if non null.

    Parameters (1)
    • theAllocator
  • Replace this sequence by the items of theOther. This method does not change the internal allocator.

    Parameters (1)
    • theOther
  • Remove(theIndex: number): void

    Remove one item.

    Parameters (1)
    • theIndex
  • Remove(theFromIndex: number, theToIndex: number): void

    Remove range of items.

    Parameters (2)
    • theFromIndex
    • theToIndex
  • Append(theItem: gp_XYZ): void

    Append one item.

    Parameters (1)
    • theItem
  • Append one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • Prepend(theItem: gp_XYZ): void

    Prepend one item.

    Parameters (1)
    • theItem
  • Prepend one item.

    Parameters (1)
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertBefore(theIndex: number, theItem: gp_XYZ): void

    InsertBefore theIndex theItem.

    Parameters (2)
    • theIndex
    • theItem
  • InsertBefore(theIndex: number, theSeq: NCollection_Sequence_gp_XYZ): void
    Parameters (2)
    • theIndex
    • theSeq
  • InsertAfter(theIndex: number, theSeq: NCollection_Sequence_gp_XYZ): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • InsertAfter(theIndex: number, theItem: gp_XYZ): void

    InsertAfter the position of iterator.

    Parameters (2)
    • theIndex
    • theItem
  • Split(theIndex: number, theSeq: NCollection_Sequence_gp_XYZ): void

    Split in two sequences.

    Parameters (2)
    • theIndex
    • theSeq
      Mutated in place; read the updated value from this argument after the call.
  • First item access.

  • First item access.

  • Last item access.

  • Last item access.

  • Value(theIndex: number): gp_XYZ

    Constant item access by theIndex.

    Parameters (1)
    • theIndex
  • ChangeValue(theIndex: number): gp_XYZ

    Variable item access by theIndex.

    Parameters (1)
    • theIndex
  • SetValue(theIndex: number, theItem: gp_XYZ): void

    Set item value by theIndex.

    Parameters (2)
    • theIndex
    • theItem
  • At(theIndex: number): gp_XYZ

    0-based checked access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]
  • ChangeAt(theIndex: number): gp_XYZ

    0-based checked mutable access independent of Lower()/Upper().

    Parameters (1)
    • theIndex
      0-based index in [0, Size()-1]

NCollection_Sequence_handle_BRepBlend_Line

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_ChFiDS_Spine

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_ChFiDS_SurfData

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Contap_TheIWLineOfTheIWalking

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Expr_GeneralExpression

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Expr_GeneralRelation

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Expr_NamedExpression

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Expr_NamedFunction

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom_BoundedCurve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom_BSplineSurface

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom_Curve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom_Surface

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom2d_BoundedCurve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom2d_Curve

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Geom2d_Geometry

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IFSelect_AppliedModifiers

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IFSelect_Dispatch

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IFSelect_GeneralModifier

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IFSelect_Selection

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Interface_Check

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Interface_InterfaceModel

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IntPatch_Line

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_IntPatch_TheIWLineOfTheIWalking

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_MAT_Arc

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_MAT_BasicElt

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_MAT2d_Connexion

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Message_Printer

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_MoniTool_Element

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_NCollection_HArray1_double

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_NCollection_HArray1_gp_Pnt

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_NCollection_HArray1_gp_Pnt2d

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_NCollection_HSequence_gp_Pnt

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_NLPlate_HGPPConstraint

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_PCDM_Document

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Poly_Triangulation

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_ShapeAnalysis_FreeBoundData

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_Standard_Transient

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_StepElement_CurveElementPurposeMember

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_StepElement_CurveElementSectionDefinition

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_StepElement_ElementMaterial

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)

NCollection_Sequence_handle_StepElement_SurfaceElementPurposeMember

Purpose: Definition of a sequence of elements indexed by an Integer in range of 1..n

Constructors(3)

Instance methods(26)