11 Treap

Version: 5.0.1.6

← prev up next →

11 Treap

(require (planet krhari/pfds:1:5/treap))

Treaps are binary search trees in which each node has both a search key and a priority. Its keys are sorted in inorder and its each node priority is smaller than the priorities of its children. Because of this, a treap is a binary search tree for the keys and a heap for its priorities. This implementation uses random priorities to achieve good average-case performance.

Provides worst case running time of O(log(n)) for the operations insert, find-min/max and delete-min/max.

(Treap A)

A treap of type A.

(treap comp a ...) → (Treap A)

comp : (A A -> Boolean)

a : A

Function treap creates a Treap with the given inputs.

Example:

> (treap < 1 2 3 4 5 6)

- : (Treap Positive-Fixnum)

#<Treap>

In the above example, the treap obtained will have elements 1 thru’ 6 with < as the comparison function.

(empty? treap) → Boolean

treap : (Treap A)

Function empty? checks if the given treap is empty or not.

Examples:
  > (empty? (treap < 1 2 3 4 5 6))
  - : Boolean
  #f
  > (empty? (treap <))
  - : Boolean
  #t

(insert a treap ...) → (Treap A)

a : A

treap : (Treap A)

Function insert takes an element and a treap and inserts the given element into the treap.

Example:

> (insert 10 (treap < 1 2 3))

- : (Treap Positive-Fixnum)

#<Treap>

In the above example, insert adds the element 10 to (treap < 1 2 3).

(find-min/max treap) → A

treap : (Treap A)

Function find-min/max takes a treap and gives the largest or the smallest element in the treap if treap is not empty else throws an error. The element returned is largest or smallest depends on the comparison function of the treap.

Examples:

> (find-min/max (treap < 1 2 3 4 5 6))

- : Positive-Fixnum

> (find-min/max (treap > 1 2 3 4 5 6))

- : Positive-Fixnum

> (find-min/max (treap <))

find-min/max: given treap is empty

(delete-min/max treap) → (Treap A)

treap : (Treap A)

Function delete-min/max takes a treap and returns the same treap without the min or max element in the given treap. The element removed from the treap is max or min depends on the comparison function of the treap.

Examples:

> (delete-min/max (treap < 1 2 3 4 5 6))

- : (Treap Positive-Fixnum)

#<Treap>

> (delete-min/max (treap > 1 2 3 4 5 6))

- : (Treap Positive-Fixnum)

#<Treap>

> (delete-min/max (treap <))

delete-min/max: given treap is empty

In the above example, (delete-min/max (treap < 1 2 3 4 5 6)), deletes the element 1(min) from the treap. And (delete-min/max (treap > 1 2 3 4 5 6)), deletes the element 6(max) from the treap.

(delete elem treap) → (Treap A)

elem : A

treap : (Treap A)

Function delete deletes the given element from the given treap.

Examples:

> (delete 6 (treap < 1 2 3 4 5 6))

- : (Treap Positive-Fixnum)

#<Treap>

> (delete 3 (treap > 1 2 3 4 5 6))

- : (Treap Positive-Fixnum)

#<Treap>

> (delete 10 ((inst treap Integer) <))

delete: given treap is empty

In the above example, (delete 6 (treap < 1 2 3 4 5 6)), deletes the 6 returns (treap < 1 2 3 4 5). And (delete 3 (treap > 1 2 3 4 5 6)) returns (treap > 1 2 4 5 6).

(treap->list treap) → (Listof A)

treap : (Treap A)

Function treap->list takes a treap and returns a list which is sorted according to the comparison function of the treap.

Examples:

> (treap->list (treap > 1 2 3 4 5 6))

- : (Listof Positive-Fixnum)

'(2 4 6 5 3 1)

> (treap->list (treap < 1 2 3 4 5 6))

- : (Listof Positive-Fixnum)

'(1 6 2 3 4 5)

(map comparer func treap1 treap2 ...) → (Treap A)

comparer : (C C -> Boolean)

func : (A B ... B -> C)

treap1 : (Treap A)

treap2 : (Treap B)

Function map is similar to map for lists.

Examples:

> (treap->list (map < add1 (treap < 1 2 3 4 5 6)))

- : (Listof Exact-Positive-Integer)

'(3 2 7 4 5 6)

> (treap->list (map < * (treap < 1 2 3 4 5 6) (treap < 1 2 3 4 5 6)))

- : (Listof Exact-Positive-Integer)

'(12 6 5 5 12 24)

(fold func init treap1 treap2 ...) → C

func : (C A B ... B -> C)

init : C

treap1 : (Treap A)

treap2 : (Treap B)

Function fold is similar to foldl or foldr

fold currently does not produce correct results when the given function is non-commutative.

Examples:
  > (fold + 0 (treap < 1 2 3 4 5 6))
  - : Exact-Nonnegative-Integer
  21
  > (fold * 1 (treap < 1 2 3 4 5 6) (treap < 1 2 3 4 5 6))
  - : Exact-Positive-Integer
  518400

(filter func treap) → (Treap A)

func : (A -> Boolean)

treap : (Treap A)

Function filter is similar to filter.

Examples:

> (define trp (treap < 1 2 3 4 5 6))

> (treap->list (filter (λ: ([x : Integer]) (> x 5)) trp))

- : (Listof Positive-Fixnum)

'(6)

> (treap->list (filter (λ: ([x : Integer]) (< x 5)) trp))

- : (Listof Positive-Fixnum)

'(4 2 1 3)

> (treap->list (filter (λ: ([x : Integer]) (<= x 5)) trp))

- : (Listof Positive-Fixnum)

'(2 1 5 4 3)

(remove func treap) → (Treap A)

func : (A -> Boolean)

treap : (Treap A)

Function remove is similar to filter but remove removes the elements which satisfy the predicate.

Examples:

> (treap->list (remove (λ: ([x : Integer]) (> x 5))

(treap < 1 2 3 4 5 6)))

- : (Listof Positive-Fixnum)

'(2 1 5 3 4)

> (treap->list (remove (λ: ([x : Integer]) (< x 5))

(treap < 1 2 3 4 5 6)))

- : (Listof Positive-Fixnum)

'(5 6)

> (treap->list (remove (λ: ([x : Integer]) (<= x 5))

(treap < 1 2 3 4 5 6)))

- : (Listof Positive-Fixnum)

'(6)

(andmap func treap1 treap2 ...) → Boolean

func : (A B ... B -> Boolean)

treap1 : (Treap A)

treap2 : (Treap B)

Function andmap is similar to andmap.

Examples:
  > (andmap even? (treap < 1 2 3 4 5 6))
  - : Boolean
  #f
  > (andmap odd? (treap < 1 2 3 4 5 6))
  - : Boolean
  #f
  > (andmap positive? (treap < 1 2 3 4 5 6))
  - : Boolean
  #t
  > (andmap negative? (treap < -1 -2))
  - : Boolean
  #t

(ormap func treap1 treap2 ...) → Boolean

func : (A B ... B -> Boolean)

treap1 : (Treap A)

treap2 : (Treap B)

Function ormap is similar to ormap.

Examples:
  > (ormap even? (treap < 1 2 3 4 5 6))
  - : Boolean
  #t
  > (ormap odd? (treap < 1 2 3 4 5 6))
  - : Boolean
  #t
  > (ormap positive? (treap < -1 -2 3 4 -5 6))
  - : Boolean
  #t
  > (ormap negative? (treap < 1 -2))
  - : Boolean
  #t

(build-treap size func comp) → (Treap A)

size : Natural

func : (Natural -> A)

comp : (A A -> Boolean)

Function build-treap is similar to build-list but this function takes an extra comparison function.

Examples:
  > (treap->list (build-treap 5 (λ:([x : Integer]) (add1 x)) <))
  - : (Listof Integer)
  '(2 1 3 5 4)
  > (treap->list (build-treap 5 (λ:([x : Integer]) (* x x)) <))
  - : (Listof Integer)
  '(16 0 1 4 9)

← prev up next →

1	Queues
2	Deques
3	Heaps
4	Random Access Lists
5	Catenable List
6	VList
7	Streams
8	Red-Black Trees
9	Tries
10	Sets
11	Treap