Skewlia.jl

Skewlia - mergable priority queues

    heap = Skewlia.SkewHeap()

    # Insert one at a time
    for job in some_list_of_jobs
        Skewlia.put!(heap, job)
    end

    # Insert all at once
    Skewlia.put!(heap, some_list_of_jobs...)

    # Retrieve jobs in order (using <=)
    while !Skewlia.is_empty(heap)
        job = Skewlia.get!(heap)
        do_stuff_with(job)
    end

    # Or as an iterator
    for job in heap
        do-stuff_with(job)
    end

SkewHeap() ::SkewHeap

Initialize a new skew heap. Elements inserted into the heap will be ordered using <=.

iterate(h::SkewHeap)

Returns an iterator that will sequentially retrieve each item from the heap. Adding new items while iterating over the heap is perfectly acceptable.

heap = Skewlia.SkewHeap()

Skewlia.put!("foo", "bar", "baz", "bat")

for abused_string in heap
    println(abused_string)
end

explain(h::SkewHeap)

Prints out the structure of the heap for debugging.

is_empty(h::SkewHeap)

Returns true if the heap is empty.

length(h::SkewHeap)

Returns the number of items in the heap.

peek(h::SkewHeap)

Returns the next item from the heap without removing it, or nothing if empty.

put(h::SkewHeap, items...)

Inserts new items into the heap and returns the heap's new size.

take(h::SkewHeap)

Removes and returns the next item from the heap or nothing if it is empty.