Returns a string representation of the object. (Inherited from Object) Transfer(Object) Transfers the element to a consumer, waiting if necessary to do so. TryTransfer(Object, Int64, TimeUnit) Transfers the element to a consumer if it is possible to do so before the timeout elapses. ...
An optionally-bounded blocking queue based on linked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New...
Returns aSpliteratorover the elements in this queue. ToArray() To be added (Inherited fromAbstractCollection) ToArray(Object[]) To be added (Inherited fromAbstractCollection) ToArray<T>()(Inherited fromObject) ToString() Returns a string representation of the object. ...
Returns an array containing all of the elements in this queue, in proper sequence. String toString() Returns the string representation of this Collection. [Expand] Inherited Methods From class java.util.AbstractQueue From class java.util.AbstractCollection From class java.lang.Object From int...
Returns an array containing all of the elements in this queue, in proper sequence; the runtime type of the returned array is that of the specified array. StringtoString() Returns a string representation of this collection. Methods inherited from class java.util.AbstractQueue ...
Returns an array containing all of the elements in this deque, in proper sequence; the runtime type of the returned array is that of the specified array. String toString() Returns a string representation of this collection. Methods inherited from class java.util.AbstractQueue addAll Methods in...
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array. String toString () Returns a string representation of this collection.Methods inherited from class java.util. AbstractQueue add , addAll , element , remo...
Polynomial Representation Linked lists commonly represent polynomials in mathematics and computer science. Each node in the linked list represents a term in the polynomial, containing the coefficient and the degree of the term. The linked list allows easy manipulation of polynomial terms, such as addit...
Outputs the container into its JSON representation. Typical usage for key-value structures: package main import ( "encoding/json" "fmt" "github.com/emirpasic/gods/maps/hashmap" ) func main() { m := hashmap.New() m.Put("a", "1") m.Put("b", "2") m.Put("c", "3") bytes,...
Outputs the container into its JSON representation. Typical usage for key-value structures: package main import ( "encoding/json" "fmt" "github.com/emirpasic/gods/maps/hashmap" ) func main() { m := hashmap.New() m.Put("a", "1") m.Put("b", "2") m.Put("c", "3") bytes,...