From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001 From: upstream source tree Date: Sun, 15 Mar 2015 20:14:05 -0400 Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream tarball. downloading a git-generated archive based on the 'upstream' tag should provide you with a source tree that is binary identical to the one extracted from the above tarball. if you have obtained the source via the command 'git clone', however, do note that line-endings of files in your working directory might differ from line-endings of the respective files in the upstream repository. --- ...priority_queue_random_int_push_timing_test.html | 200 +++++++++++++++++++++ 1 file changed, 200 insertions(+) create mode 100644 libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html (limited to 'libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html') diff --git a/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html b/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html new file mode 100644 index 000000000..ba91f601a --- /dev/null +++ b/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html @@ -0,0 +1,200 @@ + + + + + +Priority Queue Random Int Push Timing Test + + + +
+

Priority Queue Random Integer push Timing + Test

+

Description

+

This test inserts a number of values with i.i.d integer keys + into a container using push . It measures the average + time for push as a function of the number of + values.

+

(The test was executed with + priority_queue_random_intpush_timing_test + thirty_years_among_the_dead_preproc.txt 200 200 2100)

+

Purpose

+

The test checks the effect of different underlying + data structures (see Design::Priority + Queues::Implementations).

+

Results

+

Figures NPG, NPM, and + NPL show the results for the native priority + queues and pb_ds 's priority queues in g++, msvc++, and + local, + respectively; Figures NBPG, NBPM, and NBPL shows the + results for the binary-heap based native priority queues and + pb_ds 's priority queues in g++, msvc++, and + local, + respectively

+
+
+
+
+
no image
NPG: Native and pb ds priority queue push timing test - g++

In the above figure, the names in the legends have the following meaning:

+
    +
  1. +rc_binomial_heap- +priority_queue + with Tag = rc_binomial_heap_tag +
    2. +
  2. +binomial_heap- +priority_queue + with Tag = binomial_heap_tag +
    3. +
  3. +n_pq_deque- +std::priority_queue adapting std::deque
    4. +
  4. +pairing_heap- +priority_queue + with Tag = pairing_heap_tag +
    5. +
  5. +thin_heap- +priority_queue + with Tag = thin_heap_tag +
    6. +
  6. +n_pq_vector- +std::priority_queue adapting std::vector
    7. +
  7. +binary_heap- +priority_queue + with Tag = binary_heap_tag +
    8. +
+
+
+
+
+
+
+
+
+
+
no image
NPM: Native and pb ds priority queue push timing test - msvc++

In the above figure, the names in the legends have the following meaning:

+
    +
  1. +rc_binomial_heap- +priority_queue + with Tag = rc_binomial_heap_tag +
    2. +
  2. +binomial_heap- +priority_queue + with Tag = binomial_heap_tag +
    3. +
  3. +pairing_heap- +priority_queue + with Tag = pairing_heap_tag +
    4. +
  4. +thin_heap- +priority_queue + with Tag = thin_heap_tag +
    5. +
  5. +n_pq_deque- +std::priority_queue adapting std::deque
    6. +
  6. +n_pq_vector- +std::priority_queue adapting std::vector
    7. +
  7. +binary_heap- +priority_queue + with Tag = binary_heap_tag +
    8. +
+
+
+
+
+
+
+
+
+
+
no image
NPL: Native and pb ds priority queue push timing test - local
+
+
+
+
+
+
+
+
+
no image
NBPG: Native and pb ds binary priority queue push timing test - g++

In the above figure, the names in the legends have the following meaning:

+
    +
  1. +n_pq_deque- +std::priority_queue adapting std::deque
    2. +
  2. +n_pq_vector- +std::priority_queue adapting std::vector
    3. +
  3. +binary_heap- +priority_queue + with Tag = binary_heap_tag +
    4. +
+
+
+
+
+
+
+
+
+
+
no image
NBPM: Native and pb ds binary priority queue push timing test - msvc++

In the above figure, the names in the legends have the following meaning:

+
    +
  1. +n_pq_deque- +std::priority_queue adapting std::deque
    2. +
  2. +n_pq_vector- +std::priority_queue adapting std::vector
    3. +
  3. +binary_heap- +priority_queue + with Tag = binary_heap_tag +
    4. +
+
+
+
+
+
+
+
+
+
+
no image
NBPL: Native and pb ds binary priority queue push timing test - local
+
+
+
+
+

Observations

+

Binary heaps are the most suited for sequences of + push and pop operations of primitive types + (e.g. ints). They are less constrained + than any other type, and since it is very efficient to store + such types in arrays, they outperform even pairing heaps. (See + Priority + Queue Text push Timing Test for the case of + non-primitive types.)

+

Priority-Queue + Performance Tests::Observations discusses this further and + summarizes.

+
+ + -- cgit v1.2.3