libcascade
PackageApiSyntheticN collection autoGenerated

Generated (page 4 of 9)

OCCT package Generated:…

NCollection_DataMap_TopoDS_Shape_int_TopTools_ShapeMapHasher

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • Exchange(theOther: NCollection_DataMap_TopoDS_Shape_int_TopTools_ShapeMapHasher): 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(): TopTools_ShapeMapHasher

    Returns const reference to the hasher.

  • Assign(theOther: NCollection_DataMap_TopoDS_Shape_int_TopTools_ShapeMapHasher): NCollection_DataMap_TopoDS_Shape_int_TopTools_ShapeMapHasher

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: TopoDS_Shape, theItem: number): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: TopoDS_Shape, theItem: number): number

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: TopoDS_Shape, theItem: number): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: TopoDS_Shape, theItem: number): number

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: TopoDS_Shape): boolean

    IsBound.

    Parameters (1)
    • theKey
  • UnBind(theKey: TopoDS_Shape): boolean

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: TopoDS_Shape): number

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: TopoDS_Shape): number

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: TopoDS_Shape): number

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_gp_Pnt_handle_Standard_Transient

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: gp_Pnt, theItem: Standard_Transient): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: gp_Pnt, theItem: Standard_Transient): Standard_Transient

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: gp_Pnt, theItem: Standard_Transient): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: gp_Pnt, theItem: Standard_Transient): Standard_Transient

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: gp_Pnt): boolean

    IsBound.

    Parameters (1)
    • theKey
  • UnBind(theKey: gp_Pnt): boolean

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: gp_Pnt): Standard_Transient

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: gp_Pnt): Standard_Transient

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: gp_Pnt): Standard_Transient

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_handle_Standard_Transient_NCollection_List_Message_Msg

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

NCollection_DataMap_handle_Standard_Transient_handle_Standard_Transient

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: Standard_Transient, theItem: Standard_Transient): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: Standard_Transient, theItem: Standard_Transient): Standard_Transient

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: Standard_Transient, theItem: Standard_Transient): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: Standard_Transient, theItem: Standard_Transient): Standard_Transient

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: Standard_Transient): boolean

    IsBound.

    Parameters (1)
    • theKey
  • UnBind(theKey: Standard_Transient): boolean

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: Standard_Transient): Standard_Transient

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: Standard_Transient): Standard_Transient

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: Standard_Transient): Standard_Transient

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_handle_StepRepr_RepresentationItem_TopoDS_Shape

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: StepRepr_RepresentationItem, theItem: TopoDS_Shape): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: StepRepr_RepresentationItem, theItem: TopoDS_Shape): TopoDS_Shape

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: StepRepr_RepresentationItem, theItem: TopoDS_Shape): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: StepRepr_RepresentationItem, theItem: TopoDS_Shape): TopoDS_Shape

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: StepRepr_RepresentationItem): boolean

    IsBound.

    Parameters (1)
    • theKey
  • UnBind(theKey: StepRepr_RepresentationItem): boolean

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: StepRepr_RepresentationItem): TopoDS_Shape

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: StepRepr_RepresentationItem): TopoDS_Shape

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: StepRepr_RepresentationItem): TopoDS_Shape

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_handle_StepShape_TopologicalRepresentationItem_TopoDS_Shape

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

NCollection_DataMap_handle_TDF_Attribute_handle_TDF_Attribute

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: TDF_Attribute, theItem: TDF_Attribute): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: TDF_Attribute, theItem: TDF_Attribute): TDF_Attribute

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: TDF_Attribute, theItem: TDF_Attribute): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: TDF_Attribute, theItem: TDF_Attribute): TDF_Attribute

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: TDF_Attribute): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: TDF_Attribute): TDF_Attribute

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: TDF_Attribute): TDF_Attribute

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: TDF_Attribute): TDF_Attribute

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_handle_XCAFDimTolObjects_GeomToleranceObject_handle_XCAFDimTolObjects_DatumObject

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

NCollection_DataMap_handle_XCAFDoc_VisMaterial_handle_XCAFDoc_VisMaterial

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: XCAFDoc_VisMaterial, theItem: XCAFDoc_VisMaterial): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: XCAFDoc_VisMaterial, theItem: XCAFDoc_VisMaterial): XCAFDoc_VisMaterial

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: XCAFDoc_VisMaterial, theItem: XCAFDoc_VisMaterial): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: XCAFDoc_VisMaterial, theItem: XCAFDoc_VisMaterial): XCAFDoc_VisMaterial

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: XCAFDoc_VisMaterial): boolean

    IsBound.

    Parameters (1)
    • theKey
  • UnBind(theKey: XCAFDoc_VisMaterial): boolean

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: XCAFDoc_VisMaterial): XCAFDoc_VisMaterial

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: XCAFDoc_VisMaterial): XCAFDoc_VisMaterial

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: XCAFDoc_VisMaterial): XCAFDoc_VisMaterial

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_int_NCollection_List_TopoDS_Shape

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: number, theItem: NCollection_List_TopoDS_Shape): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: number, theItem: NCollection_List_TopoDS_Shape): NCollection_List_TopoDS_Shape

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: number, theItem: NCollection_List_TopoDS_Shape): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: number, theItem: NCollection_List_TopoDS_Shape): NCollection_List_TopoDS_Shape

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: number): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: number): NCollection_List_TopoDS_Shape

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: number): NCollection_List_TopoDS_Shape

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: number): NCollection_List_TopoDS_Shape

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_int_NCollection_PackedMap_int_NCollection_DefaultHasher_int

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • Exchange(theOther: NCollection_DataMap_int_NCollection_PackedMap_int_NCollection_DefaultHasher_int): 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: NCollection_DataMap_int_NCollection_PackedMap_int_NCollection_DefaultHasher_int): NCollection_DataMap_int_NCollection_PackedMap_int_NCollection_DefaultHasher_int

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: number, theItem: TColStd_PackedMapOfInteger): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: number, theItem: TColStd_PackedMapOfInteger): TColStd_PackedMapOfInteger

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: number, theItem: TColStd_PackedMapOfInteger): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: number, theItem: TColStd_PackedMapOfInteger): TColStd_PackedMapOfInteger

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: number): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: number): TColStd_PackedMapOfInteger

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: number): TColStd_PackedMapOfInteger

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: number): TColStd_PackedMapOfInteger

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_int_TopoDS_Shape

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: number, theItem: TopoDS_Shape): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: number, theItem: TopoDS_Shape): TopoDS_Shape

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: number, theItem: TopoDS_Shape): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: number, theItem: TopoDS_Shape): TopoDS_Shape

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: number): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: number): TopoDS_Shape

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: number): TopoDS_Shape

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: number): TopoDS_Shape

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_int_handle_MAT_BasicElt

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: number, theItem: MAT_BasicElt): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: number, theItem: MAT_BasicElt): MAT_BasicElt

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: number, theItem: MAT_BasicElt): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: number, theItem: MAT_BasicElt): MAT_BasicElt

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: number): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

    Parameters (1)
    • theKey
  • Seek(theKey: number): MAT_BasicElt

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeSeek(theKey: number): MAT_BasicElt

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

    Parameters (1)
    • theKey
  • ChangeFind(theKey: number): MAT_BasicElt

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DataMap_int_int

NCollection_BaseMap

Purpose: The DataMap is a Map to store keys with associated Items. See Map from NCollection for a discussion about the number of buckets.
The DataMap can be seen as an extended array where the Keys are the indices. For this reason the operator () is defined on DataMap to fetch an Item from a Key. So the following syntax can be used :
anItem = aMap(aKey); aMap(aKey) = anItem;
This analogy has its limit. aMap(aKey) = anItem can be done only if aKey was previously bound to an item in the map.

Constructors(4)

Instance methods(15)

  • 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

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey: number, theItem: number): boolean

    Bind binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    true if Key was not bound already

  • Bound(theKey: number, theItem: number): number

    Bound binds Item to Key in map.

    Parameters (2)
    • theKey —
      key to add/update
    • theItem —
      new item; overrides value previously bound to the key (uses destroy+reconstruct)
    Returns

    pointer to modifiable Item

  • TryBind(theKey: number, theItem: number): boolean

    TryBind binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    true if Key was newly bound, false if Key already existed (no replacement)

  • TryBound(theKey: number, theItem: number): number

    TryBound binds Item to Key in map only if Key is not yet bound.

    Parameters (2)
    • theKey —
      key to add
    • theItem —
      item to bind if Key is not yet bound
    Returns

    reference to existing or newly bound Item

  • IsBound(theKey: number): boolean

    IsBound.

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

    UnBind removes Item Key pair from map.

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

    Seek returns pointer to Item by Key. Returns NULL is Key was not bound.

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

    ChangeSeek returns modifiable pointer to Item by Key. Returns NULL is Key was not bound.

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

    ChangeFind returns modifiable Item by Key. Raises if Key was not bound.

    Parameters (1)
    • theKey
  • 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

NCollection_DoubleMap_int_TDF_Label

NCollection_BaseMap

Purpose: The DoubleMap is used to bind pairs (Key1,Key2) and retrieve them in linear time.
See Map from NCollection for a discussion about the number of buckets

Constructors(3)

Instance methods(14)

  • 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.
  • Assign(theOther: unknown): unknown

    Assignment. This method does not change the internal allocator.

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

    ReSize.

    Parameters (1)
    • N
  • Bind(theKey1: number, theKey2: TDF_Label): void

    Bind binds the pair (Key1, Key2).

    Parameters (2)
    • theKey1
    • theKey2
  • TryBind(theKey1: number, theKey2: TDF_Label): boolean

    TryBind binds the pair (Key1, Key2) only if neither key is already bound.

    Parameters (2)
    • theKey1 —
      first key to bind
    • theKey2 —
      second key to bind
    Returns

    true if pair was successfully bound, false if either key already exists

  • AreBound(theKey1: number, theKey2: TDF_Label): boolean
    • AreBound
    Parameters (2)
    • theKey1
    • theKey2
  • IsBound1(theKey1: number): boolean

    IsBound1.

    Parameters (1)
    • theKey1
  • IsBound2(theKey2: TDF_Label): boolean

    IsBound2.

    Parameters (1)
    • theKey2
  • UnBind1(theKey1: number): boolean

    UnBind1.

    Parameters (1)
    • theKey1
  • UnBind2(theKey2: TDF_Label): boolean

    UnBind2.

    Parameters (1)
    • theKey2
  • Seek1(theKey1: number): TDF_Label

    Find the Key1 and return pointer to Key2 or NULL if Key1 is not bound.

    Parameters (1)
    • theKey1 —
      Key1 to find
    Returns

    pointer to Key2 or NULL if Key1 is not found

  • Seek2(theKey2: TDF_Label): number

    Find the Key2 and return pointer to Key1 or NULL if not bound.

    Parameters (1)
    • theKey2 —
      Key2 to find
    Returns

    pointer to Key1 if Key2 has been found

  • 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

NCollection_DoubleMap_int_TopoDS_Shape_NCollection_DefaultHasher_int_TopTools_ShapeMapHasher

NCollection_BaseMap

Purpose: The DoubleMap is used to bind pairs (Key1,Key2) and retrieve them in linear time.
See Map from NCollection for a discussion about the number of buckets

Constructors(3)

Instance methods(14)

NCollection_DynamicArray_BOPDS_Curve

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_FaceInfo

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_IndexRange

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfEE

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfEF

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfEZ

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfFF

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfFZ

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfVE

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfVF

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfVV

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfVZ

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_InterfZZ

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_Pair

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_Point

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_BOPDS_ShapeInfo

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_ExtremaPC_ExtremumResult

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_MathRoot_NullInterval

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_NCollection_DynamicArray_BOPDS_Pair

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_NCollection_List_handle_BOPDS_PaveBlock

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_TopoDS_Face

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_TopoDS_Shape

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_double

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_gp_Pnt2d

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_gp_XYZ

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_handle_Adaptor3d_Surface

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_handle_NCollection_HSequence_int

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_handle_Standard_Transient

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_DynamicArray_int

Class NCollection_DynamicArray (dynamic array of objects)
The array's indices always start at 0.
The Vector is always created with 0 length. It can be enlarged by two means:

  1. Calling the method Append (val) - then "val" is added to the end of the vector (the vector length is incremented)
  2. Calling the method SetValue (i, val) - if "i" is greater than or equal to the current length of the vector, the vector is enlarged to accomo- date this index
    The methods Append and SetValue return a non-const reference to the copied object inside the vector. This reference is guaranteed to be valid until the vector is destroyed. It can be used to access the vector member directly or to pass its address to other data structures.
    The vector iterator remembers the length of the vector at the moment of the creation or initialisation of the iterator. Therefore the iteration begins at index 0 and stops at the index equal to (remembered_length-1). It is OK to enlarge the vector during the iteration.

Constructors(3)

Instance methods(20)

NCollection_FlatDataMap_BRepGraph_ItemId_BRepGraph_ItemId_NCollection_DefaultHasher_BRepGraph_ItemId

High-performance hash map using open addressing with Robin Hood hashing.
NCollection_FlatDataMap is an alternative to NCollection_DataMap that provides better cache locality and reduced memory allocation overhead by storing all key-value pairs inline in a contiguous array.
Key features:

  • Open addressing with linear probing (better cache locality)
  • Robin Hood hashing (reduces probe sequence variance)
  • Power-of-2 sizing for fast modulo operations
  • No per-element allocations
    Typical faster usage patterns:
  • POD or small key/value types
  • Performance-critical code paths
  • Lookup-heavy workloads
  • Full traversal / iteration-heavy workloads
  • Stable-size maps with Reserve() called once before bulk Bind()
    Container-specific implementation notes:
  • UnBind() keeps probe clusters consistent using backward-shift compaction.
    Relative to NCollection_DataMap:
  • Bind()/UnBind() can be faster in many workloads thanks to contiguous storage and no per-element node allocation.
  • Iteration is often faster due to contiguous slot scanning and reduced pointer chasing.
    Limitations:
  • Keys and values must be movable
  • Higher memory usage at low load factors
  • Iteration order is not insertion order
  • Probe distance grows with collisions (bounded by table capacity)

Constructors(4)

Instance methods(19)

NCollection_HArray1_AppParCurves_ConstraintCouple

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_AppParCurves_MultiBSpCurve

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_AppParCurves_MultiCurve

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_AppParCurves_MultiPoint

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_BRepAdaptor_Curve

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Bnd_Box

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Bnd_Box2d

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Bnd_Sphere

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_ChFiDS_CircSection

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Extrema_POnCurv

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Extrema_POnCurv2d

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Extrema_POnSurf

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_HLRAlgo_PolyHidingData

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_HLRAlgo_PolyInternalSegment

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_HLRAlgo_TriangleData

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_NCollection_List_TopoDS_Shape

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_NCollection_List_int

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_NCollection_Sequence_double

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_NCollection_Sequence_int

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Plate_PinpointConstraint

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Poly_Triangle

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_Quantity_Color

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_ApprovedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_CertifiedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_ChangeRequestItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_ClassifiedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_ContractedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_DateTimeItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_PersonOrganizationItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_SpecifiedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_StartRequestItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP203_WorkItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_ApprovalItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignDateAndPersonItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignDateAndTimeItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignDatedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignGeneralOrgItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignGroupedItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignPresentedItemSelect

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_AutoDesignReferencingItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_DateAndTimeItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_DateItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_DocumentReferenceItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_ExternalIdentificationItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_GroupItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_OrganizationItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_PersonAndOrganizationItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_PresentedItemSelect

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepAP214_SecurityClassificationItem

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepData_Field

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepDimTol_DatumReferenceModifier

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepDimTol_DatumSystemOrReference

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepDimTol_GeometricToleranceModifier

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)

NCollection_HArray1_StepDimTol_ToleranceZoneTarget

Template class for Handle-managed 1D arrays. Inherits from both NCollection_Array1<TheItemType> and Standard_Transient, providing reference-counted array functionality.

Constructors(5)

Static methods(2)

Instance methods(3)