@@ -4,5 +4,6 @@ Interface ICollection<T> Extends IIterable<T>
Method Count:Int()
Method CopyTo(array:T[], index:Int = 0)
+ Method IsEmpty:Int()
End Interface
@@ -58,6 +58,13 @@ Public
Return size
End Method
+ Rem
+ bbdoc: Returns #True if the #TLinkedList is empty, otherwise #False.
+ End Rem
+ Method IsEmpty:Int() Override
+ Return size = 0
+ End Method
+
' TODO
@@ -78,6 +78,13 @@ Public
Method Count:Int() Override
+ bbdoc: Returns #True if the #TArrayList is empty, otherwise #False.
Rem
bbdoc: Gets the total number of elements the internal data structure can hold without resizing.
@@ -62,6 +62,13 @@ Type TTreeMap<K, V> Implements IMap<K,V>
+ bbdoc: Returns #True if the #TTreeMap is empty, otherwise #False.
Method CopyTo(array:TMapNode<K,V>[], index:Int = 0)
@@ -71,7 +71,14 @@ Public
-
+ bbdoc: Returns #True if the #TQueue is empty, otherwise #False.
@@ -86,6 +86,13 @@ Type TSet<T> Implements ISet<T>
+ bbdoc: Returns #True if the #TSet is empty, otherwise #False.
@@ -67,7 +67,14 @@ Public
+ bbdoc: Returns #True if the #TStack is empty, otherwise #False.