| Package | ch.capi.data.tree |
| Interface | public interface IHeap extends IDataStructure |
| Implementors | ArrayHeap |
| Property | Defined by | ||
|---|---|---|---|
![]() | nextElement : *
Defines the next element that will be removed
from the data structure.
| IDataStructure | |
| sortFunction : Function [read-only]
Defines the sort function that will be used to sort
the items.
| IHeap | ||
| Method | Defined by | ||
|---|---|---|---|
![]() |
add(element:*):void
Add an element to the data structure.
| IDataStructure | |
![]() |
clear():void
Removes all the elements from the data structure.
| IDataStructure | |
|
contains(element:*):Boolean
Retrieves if the specified element is contained into
the
IHeap. | IHeap | ||
![]() |
isEmpty():Boolean
Get if the structure is empty or not.
| IDataStructure | |
![]() |
remove():*
Removes an element from the data structure.
| IDataStructure | |
| sortFunction | property |
sortFunction:Function [read-only]Defines the sort function that will be used to sort the items.
Implementation public function get sortFunction():Function
| contains | () | method |
public function contains(element:*):Boolean
Retrieves if the specified element is contained into
the IHeap.
element:* — The element.
|
Boolean — true if the element is contained into the IHeap.
|